The semiempirical (PM3) and DFT quantum mechanical methods were used to investigate the theoretical degradation of Indigo dye. The chemical reactivity of the Indigo dye was evaluated by comparing the potential energy stability of the mean bonds. Seven transition states were suggested and studied to estimate the actually starting step of the degradation reaction. The bond length and bond angle calculations indicate that the best active site in the Indigo dye molecule is at C10=C11.  The most possible transition states are examined for all suggested paths of Indigo dye degradation predicated on zero-point energy and imaginary frequency. The first starting step of the reaction mechanism is proposed. The change in enthalpy, Gibbs free energ

     The current study aimed to adopt a method for inducing callus cells and regenerating the important common red bean using different types of growth regulators such as N⁶-benzylaminopurine (BAP), Naphthalene acetic acid (NAA), and Thidiazuron (TDZ). Different types of common bean pinto cultivar explants, such as  internodes, cotyledons and roots,  were inoculated on Murashige and Skoog medium (MS) provided with different combinations of plant growth regulators, including 1- BAP (5 mg/l) 2-BAP (4.5 mg/l) NAA (0.5 mg/l), 3- BAP (4.5 mg/l), and TDZ (0.1mg/l). Callus was initiated on MS culture medium supplied with 5 mg/l BAP for all explants (internodes, cotyledons, and roots) at 50, 20, and 10% r

Due to economic reasons or need for environmental conservatism or also preserve the natural resources; there has been an increasing shift towards the use of reclaimed asphalt pavement (RAP) materials in the pavement construction industry. Therefore, use the Reclaimed Asphalt Pavement (RAP) has been enormously increased in pavement construction and has been become common practice in many countries. Nevertheless, this is a relatively new concept in Iraq, and has to be remarked that is not used RAP in the production of HMA and this valuable material is mostly degraded. For this purpose, the reclaimed materials were collected from deteriorated pavement segments. The components of asphalt mixtures consist of: two asphalt penetration grades (40-5

Optimizing the Access Point (AP) deployment has a great role in wireless applications due to the need for providing an efficient communication with low deployment costs. Quality of Service (QoS), is a major significant parameter and objective to be considered along with AP placement as well the overall deployment cost. This study proposes and investigates a multi-level optimization algorithm called Wireless Optimization Algorithm for Indoor Placement (WOAIP) based on Binary Particle Swarm Optimization (BPSO). WOAIP aims to obtain the optimum AP multi-floor placement with effective coverage that makes it more capable of supporting QoS and cost-effectiveness. Five pairs (coverage, AP deployment) of weights, signal thresholds and received s

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

      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