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

  We study one example of hyperbolic problems it's Initial-boundary string problem with two ends. In fact we look for the solution in weak sense in some sobolev spaces. Also we use energy technic with Galerkin's method to study some properties for our problem as existence and uniqueness

      The aim of this article is to present the exact analytical solution for models as system of (2+1) dimensional PDEs by using a reliable manner based on combined LA-transform with decomposition technique and the results have shown a high-precision, smooth and speed convergence to the exact solution compared with other classic methods. The suggested approach does not need any discretization of the domain or presents assumptions or neglect for a small parameter in the problem and does not need to convert the nonlinear terms into linear ones. The convergence of series solution has been shown with two illustrated examples such (2+1)D- Burger's system and (2+1)D- Boiti-Leon-Pempinelli (BLP) system.

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

   In this research, an adaptive Canny algorithm using fast Otsu multithresholding method is presented, in which fast Otsu multithresholding method is used to calculate the optimum maximum and minimum hysteresis values and used as automatic thresholding for the fourth stage of the Canny algorithm.      The new adaptive Canny algorithm and the standard Canny algorithm (manual hysteresis value) was tested on standard image (Lena) and satellite image. The results approved the validity and accuracy of the new algorithm to find the images edges for personal and satellite images as pre-step for image segmentation.  
 

Medium Access Control (MAC) spoofing attacks relate to an attacker altering the manufacturer assigned MAC address to any other value. MAC spoofing attacks in Wireless Fidelity (WiFi) network are simple because of the ease of access to the tools of the MAC fraud on the Internet like MAC Makeup, and in addition to that the MAC address can be changed manually without software. MAC spoofing attacks are considered one of the most intensive attacks in the WiFi network; as result for that, many MAC spoofing detection systems were built, each of which comes with its strength and weak points. This paper logically identifies and recognizes the weak points
and masquerading paths that penetrate the up-to-date existing detection systems. Then the

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

In this research, salbutamol sulphate (SAS) has been determined by a simple, rapid and sensitive spectrophotometric method. Salbutamol sulphate in this method is based on the coupling of SAS with diazotized ρ- bromoaniline reagent in alkaline medium of Triton X-100 (Tx) to form an orange azo dye which is stable and water-soluble. The azo dye is exhibiting maximum absorption at 441 nm. A 10 - 800 µg of SAS is obeyed of Beer^'s law in a final volume of 20 ml, i.e., 0.5- 40 ppm with ε, the molar absorptivity of 48558 L.mol^-1.cm^-1 and Sandell's sensitivity index of 0.01188 µg.cm^-2. This new method does not need solvent extraction or temperature control which is well applied to determine SAS in d

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

A new efficient Two Derivative Runge-Kutta method (TDRK) of order five is developed for the numerical solution of the special first order ordinary differential equations (ODEs). The new method is derived using the property of First Same As Last (FSAL). We analyzed the stability of our method. The numerical results are presented to illustrate the efficiency of the new method in comparison with some well-known RK methods.