Dust is a frequent contributor to health risks and changes in the climate, one of the most dangerous issues facing people today. Desertification, drought, agricultural practices, and sand and dust storms from neighboring regions bring on this issue. Deep learning (DL) long short-term memory (LSTM) based regression was a proposed solution to increase the forecasting accuracy of dust and monitoring. The proposed system has two parts to detect and monitor the dust; at the first step, the LSTM and dense layers are used to build a system using to detect the dust, while at the second step, the proposed Wireless Sensor Networks (WSN) and Internet of Things (IoT) model is used as a forecasting and monitoring model. The experiment DL system

In this paper, we used four classification methods to classify objects and compareamong these methods, these are K Nearest Neighbor's (KNN), Stochastic Gradient Descentlearning (SGD), Logistic Regression Algorithm(LR), and Multi-Layer Perceptron (MLP). Weused MCOCO dataset for classification and detection the objects, these dataset image wererandomly divided into training and testing datasets at a ratio of 7:3, respectively. In randomlyselect training and testing dataset images, converted the color images to the gray level, thenenhancement these gray images using the histogram equalization method, resize (20 x 20) fordataset image. Principal component analysis (PCA) was used for feature extraction, andfinally apply four classification metho

We introduce and discus recent type of fibrewise topological spaces, namely fibrewise bitopological spaces, Also, we introduce the concepts of fibrewise closed bitopological spaces, fibrewise open bitopological spaces, fibrewise locally sliceable bitopological spaces and fibrewise locally sectionable bitopological spaces. Furthermore, we state and prove several propositions concerning with these concepts.

The essential objective of this paper is to introduce new notions of fibrewise topological spaces on D that are named to be upper perfect topological spaces, lower perfect topological spaces, multi-perfect topological spaces, fibrewise upper perfect topological spaces, and fibrewise lower perfect topological spaces. fibrewise multi-perfect topological spaces, filter base, contact point, rigid, multi-rigid, multi-rigid, fibrewise upper weakly closed, fibrewise lower weakly closed, fibrewise multi-weakly closed, set, almost upper perfect, almost lower perfect, almost multi-perfect, fibrewise almost upper perfect, fibrewise almost lower perfect, fibrewise almost multi-perfect, upper^* continuous fibrewise upper^∗ topol

     We introduce and discuss the modern type of fibrewise topological spaces, namely fibrewise fuzzy topological spaces. Also, we introduce the concepts of fibrewise closed fuzzy topological spaces, fibrewise open fuzzy topological spaces, fibrewise locally sliceable fuzzy topological spaces and fibrewise locally sectionable fuzzy topological spaces. Furthermore, we state and prove several theorems concerning these concepts.

The main purpose of this work is to introduce some types of fuzzy convergence sequences of operators defined on a standard fuzzy normed space (SFN-spaces) and investigate some properties and relationships between these concepts. Firstly, the definition of weak fuzzy convergence sequence in terms of fuzzy bounded linear functional is given. Then the notions of weakly and strongly fuzzy convergence sequences of operators  are introduced and essential theorems related to these concepts are proved. In particular, if ( ) is a strongly fuzzy convergent sequence with a limit  where linear operator from complete standard fuzzy normed space  into a standard fuzzy normed space  then  belongs to the set of all fuzzy bounded linear operators

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

In this paper, we present the almost approximately nearly quasi compactly packed (submodules) modules as an application of the almost approximately nearly quasiprime submodule. We give some examples, remarks, and properties of this concept. Also, as the strong form of this concept, we introduce the strongly, almost approximately nearly quasi compactly packed (submodules) modules. Moreover, we present the definitions of almost approximately nearly quasiprime radical submodules and almost approximately nearly quasiprime radical submodules and give some basic properties of these concepts that will be needed in section four of this research. We study these two concepts extensively.

  Let M be an R-module, where R is commutative ring with unity. In this paper we study the behavior of strongly hollow and quasi hollow submodule in the class of strongly comultiplication modules. Beside this we give the relationships between strongly hollow and quasi hollow submodules with V-coprime, coprime, bi-hollow submodules.

In this paper, two of the local search algorithms are used (genetic algorithm and particle swarm optimization), in scheduling number of products (n jobs) on a single machine to minimize a multi-objective function which is denoted as  (total completion time, total tardiness, total earliness and the total late work). A branch and bound (BAB) method is used for comparing the results for (n) jobs starting from (5-18). The results show that the two algorithms have found the optimal and near optimal solutions in an appropriate times.