It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th

This paper includes the application of Queuing theory with of Particle swarm algorithm or is called (Intelligence swarm) to solve the problem of The queues and developed for General commission for taxes /branch Karkh center in the service stage of the Department of calculators composed of six  employees , and it was chosen queuing model is a single-service channel  M / M / 1 according to the nature of the circuit work mentioned above and it will be divided according to the letters system for each employee, and  it was composed of data collection times (arrival time , service time, departure time)

The goal of this paper is to expose a new numerical method for solving initial value time-lag of delay differential equations by employing a high order improving formula of Euler method known as third order Euler method. Stability condition is discussed in detail for the proposed technique. Finally some examples are illustrated to verify the validity, efficiency and accuracy of the method.

The aim of this paper is to examine cases of deletion not dependent on linguistic context. Perlmutter (1971) claims that any sentence other than an imperative¹ in which there is an S that does not contain a subject in the surface structure is ungrammatical. Dillon (1978) counts elliptical sentences such as ^ Beg your pardon² as grammatically incomplete (and hence as strictly ungrammatical). Such statements are, however, not without problems for reasons that will be given below.

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust EA wit

The effect of Low-Level Laser (LLL) provided by green semiconductor laser with an emission wavelength of 532 nm on of human blood of people with brain and prostate cancer has been investigated. The effect of LLL on white blood cell (WBC), NEUT, LYMPH and MONO have been considered. Platelet count (PLT) has also been considered in this work. 2 ml of blood sample were irradiating by a green laser of the dose of 4.8 J/cm2. The results suggest a potential effect of LLL on WBC, PLT, NEUT, LYMPH, and MONO of people with brain and prostate cancer Key words: white blood cell , platelet , low-level laser therapy

Cryptography steganography is a practical tool for data security. Hybridization of the cryptography with steganography can provide more security by taking advantage of each technique. This work proposes a method for improving the crypto-stego method by utilizing the proposed dictionary method to modified ciphertext. After that, the modified encrypt ciphertext id was hidden in the text by using the proposed method. For cryptography, an Advanced Encryption Standard (AES) was utilized to encrypt the message. The AES employed a 128bit block size and 256bit key size. The ciphertext characters were then replaced by the characters identified by a dictionary list. The dictionary is time-dependent, where each of the equivalent words shift based o

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

     This paper describes the application of consensus optimization for Wireless Sensor Network (WSN) system. Consensus algorithm is usually conducted within a certain number of iterations for a given graph topology. Nevertheless, the best Number of Iterations (NOI) to reach consensus is varied in accordance with any change in number of nodes or other parameters of . graph topology. As a result, a time consuming trial and error procedure will necessary be applied
to obtain best NOI. The implementation of an intellig ent optimization can effectively help to get the optimal NOI. The performance of the consensus algorithm has considerably been improved by the inclusion of Particle Swarm Optimization (PSO). As a case s