Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed

Began the process of re-engineering processes in the private sector as a way to assist organizations in re-thinking how to run the business in order to improve production processes and reduce operational cost, to get to compete on a global level. That was a major restructuring by further evolution in the use of technology to support innovative operations.

 Entered the technology in all areas of life and different regulations, This led to use as a change in all aspects The companies achieved success and progress today through the use of resources so as to ensure the wishes of the customers and their needs, and the requirements of the market primarily, Which is reflected on the basis of building strate

The present work involved four steps: First step include reaction of acrylamide ,N-?-Methylen-bis(acryl amide) and N-tert Butyl acryl amide with poly acryloyl chloride in the presence of triethyl amine (Et3N) as catalyst, the second step include homopolymerization of all products of the first step by using benzoyl peroxide(BPO) as initiator in (80-90)Co in the presence of Nitrogen gas(N2). In the third step the poly acrylimide which prepare in second step was convert into potassium salt by using alcoholic potassium hydroxide solution. Fourth step include Alkylation of the prepared polymeric salts in third step by react it with different alkyl halides(benzyl chloride, allylbromide , methyl iodide) by using DMF as solvent for(10-12) hours.

A new derivative of PAM, acrylamide was copolymerized with succinic anhydride, and the reaction product reacted with three dyes, anthocyanin, bromophenol, and thymol. The prepared polymers were characterized by X-ray diffraction, FT-IR and UV-visible spectroscopy, proton nuclear magnetic resonance spectrometry, and thermal analysis. FT-IR spectroscopy showed the disappearance of two bands near 3450 and 3380 cm-1 for the stretching vibrations of the primary amine which indicates for the formation of amides. The UV-photolysis of aqueous solutions of different concentrations of the polymers was studied. Polyacrylamide-g-succinic anhydride showed an increase in polymerization under light. An increase of ~ 50% was observed for a 200 mg/L

Alginate is one of the natural biopolymers that is widely used for drug formulations, combination of alginate with other polymers, such as gum acacia, pectin, and carrageenan can increase mechanical strength, therefore, can reduce leakage of the encapsulated active pharmaceutical ingredient from the polymer matrix. Interaction of alginate and these polymers can occur via intermolecular hydrogen bonds causing synergism, which is determined from the viscosity of polymer mixture.

Alginate was combined with gum acacia/pectin/carrageenan in different blending ratios (100:0, 75:25, 50:50, 25:75, and 0:100) with and without addition of CaCl₂. The synergism effect is obtained from the design of experimental (DoE), and calculati

The CdS quantum dots were prepared by chemical reaction
of cadmium oleylamine (Cd –oleylamine complex) with the
sulfite-oleylamine (S-oleylamine) with 1:6 mole ratios. The
optical properties structure and spectroscopy of the product
quantum dot were studied. The results show the dependence of the
optical properties on the crystal dimension and the formation of
the trap states in the energy band gap.

This research paper aimed to quantitively characterize the pore structure of shale reservoirs. Six samples of Silurian shale from the Ahnet basin were selected for nitrogen adsorption-desorption analysis. Experimental findings showed that all the samples are mainly composed of mesopores with slit-like shaped pores, as well as the Barrett-Joyner-Halenda pore volume ranging from 0.014 to 0.046 cm3/ 100 g, where the lowest value has recorded in the AHTT-1 sample, whereas the highest one in AHTT-6, while the rest samples (AHTT-2, AHTT-3, AHTT-4, AHTT-5) have a similar average value of 0.03 cm3/ 100 g. Meanwhile, the surface area and pore size distribution were in the range of 3.8 to 11.1 m2 / g and 1.7 to 40 nm, respectively.

Luffa aegyptiaca is a plant of multi-purpose importance whose usefulness cuts across virtually all areas of life. This study has characterized L. aegyptiaca in Lagos state and determined the mineral, proximate, phytochemical as well as the heavy metal accumulation potential. Samples were collected from the 20 Local Government Areas (LGAs) in Lagos state at 2 samples per location.   Genetic similarity and intra-specific variation in 40 samples of L. aegyptiaca were determined using 3 Random Amplified Polymorphic DNA (RAPD) primers which yielded a total of 42 markers of which 25 was polymorphic. The maximum number of bands (14) was produced by OPC4 while the minimum (7) were produced by OPAF20. Percenta

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i