The principal factor in the proofs of many so-called intersection results and associated best approximation theorems—such as the famed Brouwer fixed-point theorem) is Knaster-Kuratowski-Mazurkiewicz theorem (KKM), which was extended from Rl to Hausdorff vector spaces by Ky Fan. This kind of theory necessitates introducing some form of abstract convex structure on a topological space. In both pure and applied mathematics, the theory of approximation plays a central role. The connection between best approximation and fixed-point theory provides a powerful tool for analyzing the nonlinear maps, the convergence of iterative processes, and the solving of variational problems. This paper is dedicated to presenting a new extension of the

This paper is concerned with introducing and studying the o-space by using out degree system (resp. i-space by using in degree system) which are the core concept in this paper. In addition, the m-lower approximations, the m-upper approximations and ospace and i-space. Furthermore, we introduce near supraopen (near supraclosed) d. g.'s. Finally, the supra-lower approximation, supraupper approximation, supra-accuracy are defined and some of its properties are investigated.

Soil tillage is a critical agricultural practice that creates favorable conditions for seedbed preparation and plant growth. This study presents an innovative application of artificial intelligence (AI) in agriculture by employing the YOLOv7 algorithm to classify and assess post-tillage soil surface conditions, a domain underexplored in current research. The integration of mechanical operation parameters with AI-based image classification enables optimization of tillage quality and mitigation of soil compaction, highlighting the novelty of this approach. The study aims to improve the efficiency of moldboard plow operations by examining the effects of tillage speed and depth on soil clod distribution, fuel consumption, and power requ

In this paper, we define a cubic positive implicative-ideal, a cubic implicative-ideal and a cubic commutative-ideal of a semigroup in KU-algebra as a generalization of a fuzzy (positive implicative-ideal, an implicative-ideal and a commutative-ideal) of a semigroup in KU-algebra. Some relations between these types of cubic ideals are discussed. Also, some important properties of these ideals are studied. Finally, some important theories are discussed. It is proved that every cubic commutative-ideal, cubic positive implicative-ideal, and cubic implicative-ideal are a cubic ideal, but not conversely. Also, we show that if Θ is a cubic positive implicative-ideal and a cubic commutative-ideal then Θ is a cubic implicative-ideal. Some example

The presence of different noise sources and continuous increase in crosstalk in the deep submicrometer technology raised concerns for on-chip communication reliability, leading to the incorporation of crosstalk avoidance techniques in error control coding schemes. This brief proposes joint crosstalk avoidance with adaptive error control scheme to reduce the power consumption by providing appropriate communication resiliency based on runtime noise level. By switching between shielding and duplication as the crosstalk avoidance technique and between hybrid automatic repeat request and forward error correction as the error control policies, three modes of error resiliencies are provided. The results show that, in reduced mode, the scheme achie

Information security in data storage and transmission is increasingly important. On the other hand, images are used in many procedures. Therefore, preventing unauthorized access to image data is crucial by encrypting images to protect sensitive data or privacy. The methods and algorithms for masking or encoding images vary from simple spatial-domain methods to frequency-domain methods, which are the most complex and reliable. In this paper, a new cryptographic system based on the random key generator hybridization methodology by taking advantage of the properties of Discrete Cosine Transform (DCT) to generate an indefinite set of random keys and taking advantage of the low-frequency region coefficients after the DCT stage to pass them to