Through recent years many researchers have developed methods to estimate the self-similarity and long memory parameter that is best known as the Hurst parameter. In this paper, we set a comparison between nine different methods. Most of them use the deviations slope to find an estimate for the Hurst parameter like Rescaled range (R/S), Aggregate Variance (AV), and Absolute moments (AM), and some depend on filtration technique like Discrete Variations (DV), Variance versus level using wavelets (VVL) and Second-order discrete derivative using wavelets (SODDW) were the comparison set by a simulation study to find the most efficient method through MASE. The results of simulation experiments were shown that the performance of the meth

A new approach for baud time (or baud rate) estimation of a random binary signal is presented. This approach utilizes the spectrum of the signal after nonlinear processing in a way that the estimation error can be reduced by simply increasing the number of the processed samples instead of increasing the sampling rate. The spectrum of the new signal is shown to give an accurate estimate about the baud time when there is no apriory information or any restricting preassumptions. The performance of the estimator for random binary square waves perturbed by white Gaussian noise and ISI is evaluated and compared with that of the conventional estimator of the zero crossing detector.

 In this paper, we introduce three robust fuzzy estimators of a location parameter based on Buckley’s approach, in the presence of outliers. These estimates were compared using the variance of fuzzy numbers criterion, all these estimates were best of Buckley’s estimate. of these, the fuzzy median was the best in the case of small and medium sample size, and in large sample size, the fuzzy trimmed mean was the best.

planning is among the most significant in the field of robotics research.  As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the

In general, path-planning problem is one of most important task in the field of robotics. This paper describes the path-planning problem of mobile robot based on various metaheuristic algorithms. The suitable collision free path of a robot must satisfies certain optimization criteria such as feasibility, minimum path length, safety and smoothness and so on. In this research, various three approaches namely, PSO, Firefly and proposed hybrid FFCPSO are applied in static, known environment to solve the global path-planning problem in three cases. The first case used single mobile robot, the second case used three independent mobile robots and the third case applied three follow up mobile robot.  Simulation results, whi

Background: Mobile phones are approximately widely used everywhere like in hospital wards, clinics and universities as well as biomedical laboratories. They have become very important tool in students’ life. In contrast, these tools carry many harmful bacteria which are responsible for infectious diseases in human because they serve as a reservoir for different pathogens. Current study was aimed to isolate bacteria from students’ mobile phones at the Institute of Medical Technology/Al-Mansour/The Middle Technical University, Baghdad, Iraq. Also, the study investigated microbial resistance to many antimicrobial agents as well as the appropriate remedial measures. Method: Four hundred and fifty swabs from mobile phones were collected from

This research aims to study the radiation concentration distribution of the old District of Najaf (Iraq), where 15 samples were taken from featured sites in the District, which represents archaeological, religious, and heritage sites. Track detector CR-39 was used to calculate the concentration of three different soil weights for each sample site after being exposed for a month. Geographical information systems (GIS) were used to distribute the radioactive concentration on the sites of the samples, where two interpolation methods, namely the inverse distance weight method (IDW) and the triangle irregular network method (NIT), to study the distribution of the radioactivity concentration. The study showed that the western part of the district

In this paper a WLAN network that accesses the Internet through a GPRS network was implemented and tested. The proposed network is managed by the Linux based server. Because of the limited facilities of GPRS such as dynamic IP addressing besides to its limited bandwidth a number of techniques are implemented to overcome these limitations.

      Dynamic Host Configuration Protocol (DHCP) server was added to provide a single central control for all TCP/IP resources. Squid Proxy  was added to provide caching of the redundant accessed Web content to reduce the Internet bandwidth usage and speeding up the client’s download time. Network Address Translation (NAT) service was configured to share one IP ad

The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. This work modernize the feedforward neural network, so the secret message will be encrypted by unsupervised neural network method to get the cipher text that can be decrypted using the same network to get the original text. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding lengths. In this work, the key is the final weights