The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.

Because of the quick growth of electrical instruments used in noxious gas detection, the importance of gas sensors has increased. X-ray diffraction (XRD) can be used to examine the crystal phase structure of sensing materials, which affects the properties of gas sensing. This contributes to the study of the effect of electrochemical synthesis of titanium dioxide (TiO₂) materials with various crystal phase shapes, such as rutile TiO₂ (R-TiO₂NTs) and anatase TiO₂ (A-TiO₂NTs). In this work, we have studied the effect of voltage on preparing TiO₂ nanotube arrays via the anodization technique for gas sensor applications. The results acquired from XRD, energy dispersion spectro

With the advent of the globalization, the rapid development in technology and the intensity of competition companies attemptto maintain competition advantages and retain customers. The traditional methods in managerial accounting become irrelevance to achieve the objectives of these companies especially with the rapid changes in modern manufacturing environment .Thus there is a need to new tools in accounting such as lean accounting, which is considered as a costing method that support creating value for the customer by costing the entire value stream, eliminating waste in the accounting process, reduced lead time, improved quality, lowered time delivery and increased available capacity. Using value stream focuses not only on the waste&n

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex

In this work, ZnO nanostructures for powder ZnO were synthesized by Hydrothermal Method. Size and shape of ZnO nanostructureas can be controlled by change ammonia concentration. In the preparation of ZnO nanostructure, zinc nitrate hexahydrate [Zn(NO₃)₂·6H2O] was used as a precursor. The structure and morphology of ZnO nanostructure have been characterized by scanning electron microscopy (SEM), atomic force microscopy (AFM), X-ray diffraction (XRD). The synthesized ZnO nanostructures have a hexagonal wurtzite structure. Also using Zeta potential and Particle Size Analyzers and size distribution of the ZnO powder

  In this paper, we use the repeated corrected Simpson's 3/8 quadrature method for obtaining the numerical solutions of Fredholm linear integral equations of the second kind. This method is more accurately than the repeated corrected Trapezoidal method and the repeated Simpson's 3/8 method. To illustrate the accuracy of this method, we give a numerical example

This article will introduce a new iteration method called the zenali iteration method for the approximation of fixed points. We show that our iteration process is faster than the current leading iterations  like Mann, Ishikawa, oor, D- iterations, and *-  iteration for new contraction mappings called  quasi contraction mappings. And we  proved that all these iterations (Mann, Ishikawa, oor, D- iterations and *-  iteration) equivalent to approximate fixed points of  quasi contraction. We support our analytic proof by a numerical example, data dependence result for contraction mappings type  by employing zenali iteration also discussed.