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

 A particle swarm optimization algorithm and neural network like self-tuning PID controller for CSTR system is presented. The scheme of the discrete-time PID control structure is based on neural network and tuned the parameters of the PID controller by using a particle swarm optimization PSO technique as a simple and fast training algorithm. The proposed method has advantage that it is not necessary to use a combined structure of identification and decision because it used PSO. Simulation results show the effectiveness of the proposed adaptive PID neural control algorithm in terms of minimum tracking error and smoothness control signal obtained for non-linear dynamical CSTR system.

In this paper, compared eight methods for generating the initial value and the impact of these methods to estimate the parameter of a autoregressive model, as was the use of three of the most popular methods to estimate the model and the most commonly used by researchers MLL method, Barg method  and the least squares method and that using the method of simulation model  first order autoregressive through the design of a number of simulation experiments and the different sizes of the samples.

In this paper the research introduces a new definition of a fuzzy normed space then the related concepts such as fuzzy continuous, convergence of sequence of fuzzy points and Cauchy sequence of fuzzy points are discussed in details.

Fuzzy orbit topological space is a new structure very recently given by [1]. This new space is based on the notion of open fuzzy orbit sets. The aim of this paper is to provide applications of open fuzzy orbit sets. We introduce the notions of fuzzy orbit irresolute mappings and fuzzy orbit open (resp. irresolute open) mappings and studied some of their properties. .

           This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G^* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set,  μ(u, v) ≤ σ(u) ᴧ σ(v) and  η(e) = μ(u₁, u₂) ᴧ μ(u₂, u₃) ᴧ … ᴧ μ(u_n-1, u_n) ≤ σ(u₁) ᴧ σ(u_n), if e = (u₁, u₂, …, u_n), n ≥ 2 is an edge in the semigraph G

     We introduce and discuss the modern type of fibrewise topological spaces, namely fibrewise fuzzy topological spaces. Also, we introduce the concepts of fibrewise closed fuzzy topological spaces, fibrewise open fuzzy topological spaces, fibrewise locally sliceable fuzzy topological spaces and fibrewise locally sectionable fuzzy topological spaces. Furthermore, we state and prove several theorems concerning these concepts.

The purpose of this research is to show a constructive method
for using known fuzzy groups as building blocks to form more fuzzy
subgroups. As we shall describe employing this procedure with the
fuzzy generating subgroups give us a large class of fuzzy
subgroup of abelian groups which include all fuzzy subgroup of
abelian groups of finite order.