The removal of commercial orange G dye from its aqueous solution by adsorption on tobacco leaves (TL) was studied in respect to different factor that affected the adsorption process. These factors including the tobacco leaves does, period of orange G adsorption, pH, and initial orange G dye concentration .Different types of isotherm models were used to describe the orange G dye adsorption onto the tobacco leaves. The experimental results were compared using Langmuir, and frundlich adsorption isotherm, the constants for these two isotherm models was determined. The results fitted frundlich model with value of correlation coefficient equal to (0.981). The capacity of adsorption for the orange G dye was carried out using various kinetic models

S Khalifa E, AR Jamal R, N Adil A, J Munqithe M…, 2009

A recently reported Nile red (NR) dye conjugated with benzothiadiazole species paves the way for the development of novel organic-based sensitizers used in solar cells whose structures are susceptible to modifications. Thus, six novel NR structures were derived from two previously developed structures in laboratories. In this study, density functional theory (DFT) calculations and time-dependent DFT (TD-DFT) were used to determine the optoelectronic properties of the NR-derived moieties such as absorption spectra. Various linkers were investigated in an attempt to understand the impact of π-linkers on the optoelectronic properties. According to the findings, the presence of furan species led to the planarity of the molecule and a reduction

Let A be a unital algebra, a Banach algebra module M is strongly fully stable Banach A-module relative to ideal K of A, if for every submodule N of M and for each multiplier θ : N → M such that θ(N) ⊆ N ∩ KM. In this paper, we adopt the concept of strongly fully stable Banach Algebra modules relative to an ideal which generalizes that of fully stable Banach Algebra modules and we study the properties and characterizations of strongly fully stable Banach A-module relative to ideal K of A.

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

     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 E