The fetal heart rate (FHR) signal processing based on Artificial Neural Networks (ANN),Fuzzy Logic (FL) and frequency domain Discrete Wavelet Transform(DWT) were analysis in order to perform automatic analysis using personal computers. Cardiotocography (CTG) is a primary biophysical method of fetal monitoring. The assessment of the printed CTG traces was based on the visual analysis of patterns that describing the variability of fetal heart rate signal. Fetal heart rate data of pregnant women with pregnancy between 38 and 40 weeks of gestation were studied. The first stage in the system was to convert the cardiotocograghy (CTG) tracing in to digital series so that the system can be analyzed ,while the second stage ,the FHR time series was t

Abstract

Robust controller design requires a proper definition of uncertainty bounds. These uncertainty bounds are commonly selected randomly and conservatively for certain stability, without regard for controller performance.  This issue becomes critically important for multivariable systems with high nonlinearities, as in Active Magnetic Bearings (AMB) System. Flexibility and advanced learning abilities of intelligent techniques make them appealing for uncertainty estimation. The aim of this paper is to describe the development of robust H₂/H_∞ controller for AMB based on intelligent estimation of uncertainty bounds using Adaptive Neuro Fuzzy Inference System (ANFIS).  Simulatio

Relation on a set is a simple mathematical model to which many real-life data can be connected. A binary relation  on a set  can always be represented by a digraph. Topology on a set  can be generated by binary relations on the set . In this direction, the study will consider different classical categories of topological spaces whose topology is defined by the binary relations adjacency and reachability on the vertex set of a directed graph. This paper analyses some properties of these topologies and studies the properties of closure and interior of the vertex set of subgraphs of a digraph. Further, some applications of topology generated by digraphs in the study of biological systems are cited.

In this paper mildly-regular topological space was introduced via the concept of mildly g-open sets. Many properties of mildly - regular space are investigated and the interactions between mildly-regular space and certain types of topological spaces are considered. Also the concept of strong mildly-regular space was introduced and a main theorem on this space was proved.

In this paper the centralizing and commuting concerning skew left -derivations and skew left -derivations associated with antiautomorphism on prime and semiprime rings were studied and  the commutativity of Lie ideal under certain conditions were proved.

Csaszar introduced the concept of generalized topological space and a new open set in a generalized topological space called -preopen in 2002 and 2005, respectively. Definitions of -preinterior and -preclosuer were given. Successively, several studies have appeared to give many generalizations for an open set. The object of our paper is to give a new type of generalization of an open set in a generalized topological space called -semi-p-open set. We present the definition of this set with its equivalent. We give definitions of -semi-p-interior and -semi-p-closure of a set and discuss their properties. Also the properties of -preinterior and -preclosuer are discussed. In addition, we give a new type of continuous function

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

The goal of this study is to provide a new explicit iterative process method  approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing a finite family of different types of  mappings as( nonexpansive mappings,resolvent mappings and projection mappings. The findings given in this research strengthen and extend key previous findings in the literature. Then, utilizing various structural conditions in Hilbert space and variational inequality problems, we examine the strong convergence to nearest point projection for these explicit iterative process methods Under the presence of two important conditions for convergence, namely closure and convexity. The findings reported in this research strengthen and extend

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

Concealing the existence of secret hidden message inside a cover object is known as steganography, which is a powerful technique. We can provide a secret communication between sender and receiver using Steganography. In this paper, the main goal is for hiding secret message into the pixels using Least Significant Bit (LSB) of blue sector of the cover image. Therefore, the objective is by mapping technique presenting a model for hiding text in an image. In the model for proposing the secret message, convert text to binary also the covering (image) is divided into its three original colors, Red, Green and Blue (RGB) , use the Blue sector convert it to binary,  hide two bits from the message in  two bits of the least significant b