Abstract. Nano-continuous mappings have a wide range of applications in pure and applied sciences. This paper aims to study and investigate new types of mappings, namely nano-para-compact, completely nano-regular, nano-para-perfect, and countably nano-para-perfect mappings in nano-topological spaces using nano-open sets. We introduce several properties and basic characterizations related to these mappings, which are essential for proving our main results. Additionally, we discuss the relationships among these types of mappings in nano-topological spaces. We also introduce the concept of nano-Ti-mapping, where i = 0, 1, 2, nano-neighborhood separated, and nano-functionally separated, along with various other definitions. We explore the relat

Transparent nano- coating was prepared by Sol-Gel method from titanium dioxide TiO₂ which has the ability to self-cleaning coating used for hospitals, laboratories, and places requiring permanent sterilization. Three primary colors are selected (red, blue, and yellow) as preliminary study to the effect of these colors on the nano-coating. Three traditional oil paints color were used as base, then coated by a layer of TiO₂-Sol and deposited on the paints. The optical properties of TiO₂-Sol were measured; the maximum absorption wavelength at (λ_max=387 nm), the refractive index (n=1.4423) and the energy band gap (E_g=3.2 eV). The structure properties found by X-ray diffraction of TiO

It is shown that if a subset of a topological space (χ, τ) is δ-semi.closed, then it is semi.closed. By use this fact, we introduce the concept regularity of a topological space (χ, τ) via δ-semi.open sets. Many properties and results were investigated and studied. In addition we study some maps that preserve the δ-semi.regularity of spaces.

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

The aim of this paper is to look at fibrewise slightly issuances of the more important separation axioms of ordinary topology namely fibrewise said to be fibrewise slightly T0 spaces, fibrewise slightly T1spaces, fibrewise slightly R0 spaces, fibrewise slightly T2 spaces, fibrewise slightly functionally T2 spaces, fibrewise slightly regular spaces, fibrewise slightly completely regular spaces, fibrewise slightly normal spaces. In addition, we announce and confirm many proposals related to these concepts.

The purpose of this paper is to consider fibrewise near versions of the more important separation axioms of ordinary topology namely fibrewise near T0 spaces, fibrewise near T1 spaces, fibrewise near R0 spaces, fibrewise near Hausdorff spaces, fibrewise near functionally Hausdorff spaces, fibrewise near regular spaces, fibrewise near completely regular spaces, fibrewise near normal spaces and fibrewise near functionally normal spaces. Also we give several results concerning it.

In this paper we present the theoretical foundation of forward error analysis of numerical algorithms under;• Approximations in "built-in" functions.• Rounding errors in arithmetic floating-point operations.• Perturbations of data.The error analysis is based on linearization method. The fundamental tools of the forward error analysis are system of linear absolute and relative a prior and a posteriori error equations and associated condition numbers constituting optimal of possible cumulative round – off errors. The condition numbers enable simple general, quantitative bounds definitions of numerical stability. The theoretical results have been applied a Gaussian elimination, and have proved to be very effective means of both a prior

The manual classification of oranges according to their ripeness or flavor takes a long time; furthermore, the classification of ripeness or sweetness by the intensity of the fruit’s color is not uniform between fruit varieties. Sweetness and color are important factors in evaluating the fruits, the fruit’s color may affect the perception of its sweetness. This article aims to study the possibility of predicting the sweetness of orange fruits based on artificial intelligence technology by studying the relationship between the RGB values of orange fruits and the sweetness of those fruits by using the Orange data mining tool. The experiment has applied machine learning algorithms to an orange fruit image dataset and performed a co

Energy savings are very common in IoT sensor networks because IoT sensor nodes operate with their own limited battery. The data transmission in the IoT sensor nodes is very costly and consume much of the energy while the energy usage for data processing is considerably lower. There are several energy-saving strategies and principles, mainly dedicated to reducing the transmission of data. Therefore, with minimizing data transfers in IoT sensor networks, can conserve a considerable amount of energy. In this research, a Compression-Based Data Reduction (CBDR) technique was suggested which works in the level of IoT sensor nodes. The CBDR includes two stages of compression, a lossy SAX Quantization stage which reduces the dynamic range of the