خلال الربع الأخير من القرن العشرين ، شهد الاقتصاد العالمي تحولا في مختلف المجالات التجارية والتكنولوجية والمالية التي غيرت هيكلها وأنتجت وضعا جديدا يتمثل بشكل رئيس في زيادة حركة رأس المال الأجنبي والتوسع السريع للإنتاج الدولي والتجارة بالإضافة إلى التطور التكنولوجي الهائل ونقل التكنولوجيا ، مما أدى إلى هوس الدول بالمنافسة على المستوى العالمي والسعي لدخول الأسواق الدولية وتحسين قدرتها التنافسية. وت

Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie

This paper proposes a new structure of the hybrid neural controller based on the identification model for nonlinear systems. The goal of this work is to employ the structure of the Modified Elman Neural Network (MENN) model into the NARMA-L2 structure instead of Multi-Layer Perceptron (MLP) model in order to construct a new hybrid neural structure that can be used as an identifier model and a nonlinear controller for the SISO linear or nonlinear systems. Weight parameters of the hybrid neural structure with its serial-parallel configuration are adapted by using the Back propagation learning algorithm. The ability of the proposed hybrid neural structure for nonlinear system has achieved a fast learning with minimum number

Wireless Sensor Networks (WSNs) are composed of a collection of rechargeable sensor nodes. Typically, sensor nodes collect and deliver the necessary data in response to a user’s specific request in many application areas such as health, military and domestic purposes. Applying routing protocols for sensor nodes can prolong the lifetime of the network. Power Efficient GAthering in Sensor Information System (PEGASIS) protocol is developed as a chain based protocol that uses a greedy algorithm in selecting one of the nodes as a head node to transmit the data to the base station. The proposed scheme Multi-cluster Power Efficient GAthering in Sensor Information System (MPEGASIS) is developed based on PEGASIS routing protocol in WSN. The aim

In this paper, a FPGA model of intelligent traffic light system with power saving was built. The intelligent traffic light system consists of sensors placed on the side's ends of the intersection to sense the presence or absence of vehicles. This system reduces the waiting time when the traffic light is red, through the transition from traffic light state to the other state, when the first state spends a lot of time, because there are no more vehicles. The proposed system is built using VHDL, simulated using Xilinx ISE 9.2i package, and implemented using Spartan-3A XC3S700A FPGA kit. Implementation and Simulation behavioral model results show that the proposed intelligent traffic light system model satisfies the specified operational req

              Automated clinical decision support system (CDSS) acts as new paradigm in medical services today. CDSSs are utilized to increment specialists (doctors) in their perplexing decision-making. Along these lines, a reasonable decision support system is built up dependent on doctors' knowledge and data mining derivation framework so as to help with the interest the board in the medical care gracefully to control the Corona Virus Disease (COVID-19) virus pandemic and, generally, to determine the class of infection and to provide a suitable protocol treatment depending on the symptoms of patient. Firstly, it needs to determine the three early symptoms of COVID-19 pandemic criteria (fever, tiredness, dry cough and breat

Survival analysis is widely applied to data that described by the length of time until the occurrence of an event under interest such as death or other important events. The purpose of this paper is to use the dynamic methodology which provides a flexible method, especially in the analysis of discrete survival time, to estimate the effect of covariate variables through time in the survival analysis on dialysis patients with kidney failure until death occurs. Where the estimations process is completely based on the Bayes approach by using two estimation methods: the maximum A Posterior (MAP) involved with Iteratively Weighted Kalman Filter Smoothing (IWKFS) and in combination with the Expectation Maximization (EM) algorithm. While the other

The haplotype association analysis has been proposed to capture the collective behavior of sets of variants by testing the association of each set instead of individual variants with the disease.Such an analysis typically involves a list of unphased multiple-locus genotypes with potentially sparse frequencies in cases and controls.It starts with inferring haplotypes from genotypes followed by a haplotype co-classification and marginal screening for disease-associated haplotypes.Unfortunately,phasing uncertainty may have a strong effects on the haplotype co-classification and therefore on the accuracy of predicting risk haplotypes.Here,to address the issue,we propose an alternative approach:In Stage 1,we select potential risk genotypes inste

The widespread of internet allover the world, in addition to the increasing of the huge number of users that they exchanged important information over it highlights the need for a new methods to protect these important information from intruders' corruption or modification. This paper suggests a new method that ensures that the texts of a given document cannot be modified by the intruders. This method mainly consists of mixture of three steps. The first step which barrows some concepts of "Quran" security system to detect some type of change(s) occur in a given text. Where a key of each paragraph in the text is extracted from a group of letters in that paragraph which occur as multiply of a given prime number. This step cannot detect the ch

This paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).

The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with