Using the Neural network as a type of associative memory will be introduced in this paper through the problem of mobile position estimation where mobile estimate its location depending on the signal strength reach to it from several around base stations where the neural network can be implemented inside the mobile. Traditional methods of time of arrival (TOA) and received signal strength (RSS) are used and compared with two analytical methods, optimal positioning method and average positioning method. The data that are used for training are ideal since they can be obtained based on geometry of CDMA cell topology. The test of the two methods TOA and RSS take many cases through a nonlinear path that MS can move through that region. The results show that the neural network has good performance compared with two other analytical methods which are average positioning method and optimal positioning method
Many of the key stream generators which are used in practice are LFSR-based in the sense that they produce the key stream according to a rule y = C(L(x)), where L(x) denotes an internal linear bit stream, produced by small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. In this paper we combine between the output sequences from the linear feedback shift registers with the sequences out from non linear key generator to get the final very strong key sequence
Glaucoma is one of the most dangerous eye diseases. It occurs as a result of an imbalance in the drainage and flow of the retinal fluid. Consequently, intraocular pressure is generated, which is a significant risk factor for glaucoma. Intraocular pressure causes progressive damage to the optic nerve head, thus leading to vision loss in the advanced stages. Glaucoma does not give any signs of disease in the early stages, so it is called "the Silent Thief of Sight". Therefore, early diagnosis and treatment of retinal eye disease is extremely important to prevent vision loss. Many articles aim to analyze fundus retinal images and diagnose glaucoma. This review can be used as a guideline to help diagnose glaucoma. It presents 63 artic
... Show MoreThis paper including a gravitational lens time delays study for a general family of lensing potentials, the popular singular isothermal elliptical potential (SIEP), and singular isothermal elliptical density distribution (SIED) but allows general angular structure. At first section there is an introduction for the selected observations from the gravitationally lensed systems. Then section two shows that the time delays for singular isothermal elliptical potential (SIEP) and singular isothermal elliptical density distributions (SIED) have a remarkably simple and elegant form, and that the result for Hubble constant estimations actually holds for a general family of potentials by combining the analytic results with data for the time dela
... Show MoreIn 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.
This paper generalizes and improves the results of Margenstren, by proving that the number of -practical numbers which is defined by has a lower bound in terms of . This bound is more sharper than Mangenstern bound when Further general results are given for the existence of -practical numbers, by proving that the interval contains a -practical for all
In this paper, some relations between the flows and the Enveloping Semi-group were studied. It allows to associate some properties on the topological compactification to any pointed flows. These relations enable us to study a number of the properties of the principles of flows corresponding with using algebric properties. Also in this paper proofs to some theorems of these relations are given.
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
The objective of this work is to study the concept of a fuzzy -cone metric space And some related definitions in space. Also, we discuss some new results of fixed point theorems. Finally, we apply the theory of fixed point achieved in the research on an integral type.
Iraq depends mainly on Tigris and Euphrates Rivers to provide high percentage of agricultural water use for thousands years. At last years, Iraq is suffering from shortage in water resources due to global climate changes and unfair water politics of the neighboring countries, which affected the future of agriculture plans for irrigation, added to that the lack of developed systems of water management in the irrigation projects and improper allocation of irrigation water, which reduces water use efficiency and lead to losing irrigation water and decreasing in agricultural yield. This study aims at studying the usability of irrigation and leaching scheduling within the irrigating projects and putting a complete annual or seasonal irrigatio
... Show MoreThere 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
... Show More