Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ⊊ W ⊆ M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of rings

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

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, 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

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored. A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure. Pharmacological

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored.A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure.Pharmacological s

Background: Unlike normal EEG patterns, the epileptiform abnormal pattern is characterized by different mor phologies such as the high-frequency oscillations (HFOs) of ripples on spikes, spikes and waves, continuous and sporadic spikes, and ploy2 spikes. Several studies have reported that HFOs can be novel biomarkers in human epilepsy study. S) Method: To regenerate and investigate these patterns, we have proposed three large scale brain network models (BNM by linking the neural mass model (NMM) of Stefanescu-Jirsa 2D (S-J 2D) with our own structural con nectivity derived from the realistic biological data, so called, large-scale connectivity connectome. These models include multiple network connectivity of brain regions at different

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored.A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure.Pharmacological s

The rapid development of Internet of Things (IoT) devices and their increasing numbers have caused a tremendous increase in network traffic and a wider range of cyber-attacks. This growing trend has complicated the detection process for traditional intrusion detection systems and heightened the challenges faced by these devices, such as imbalanced and large training data. This study presents a cohesive methodology of a series of intelligent techniques to prepare clean and balanced data for training the first (core) layer of a robust hierarchical intrusion detection system. The methodology was built by cleaning and compressing the data using an Autoencoder and preparing a strong latent space for balancing using a hybrid method that combines

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric