This study aimed to investigate the incorporation of recycled waste compact discs (WCDs) powder in concrete mixes to replace the fine aggregate by 5%, 10%, 15% and 20%. Compared to the reference concrete mix, results revealed that using WCDs powder in concrete mixes improved the workability and the dry density. The results demonstrated that the compressive, flexural, and split tensile strengths values for the WCDs-modified concrete mixes showed tendency to increase above the reference mix. However, at 28 days curing age, the strengths values for WCDs-modified concrete mixes were comparable to those for the reference mix. The leaching test revealed that none of the WCDs constituents was detected in the leachant after 180 days. The

In this work, novel copolymers of poly(adipic anhydride-co-mannitol) were synthesized by melting condensation polymerization of poly(adipic anhydride) with five percentages of mannitol sugar, 1 to 5 Wt.%. These copolymers were purified and then, characterized by FT-IR, which was proved that the cross-linking reaction was caused by nucleophilic attack of mannitol hydroxyl group to acidic anhydride groups of poly(adipic anhydride) backbone and new ester groups were formed and appeared. Also, modified organic-soluble chitosan, N-maleoyl-chitosan, were synthesized by grafting reaction of chitosan with maleic anhydride in DMF as solvent, and it was also purified and characterized by FT-IR. Biodegradation in vitro of the IPNs of poly(adipic anhyd

The chlorine concentration variation in Baghdad water networks was studied. The
chlorine data were collected from Mayoralty of Baghdad and Ministry of Environment
(MOE) for the networks for both sides of the city Karkh and Rasafa for (2008-2009). The
study of these data indicates that there are no systematic testing program .Classified GIS
maps showed that the areas far from the treatment plants have almost always low
chlorine concentration .This indicates that the problem of the low chlorine concentration
in the far areas is due to cracks of pipe along the conveyance path ,as expected. The area's
most frequently have low concentration are Al-sadir,Al-Kadhimya, and Al-Amiria . It
was found also that the chlorine c

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

Determining the face of wearing a mask from not wearing a mask from visual data such as video and still, images have been a fascinating research topic in recent decades due to the spread of the Corona pandemic, which has changed the features of the entire world and forced people to wear a mask as a way to prevent the pandemic that has calmed the entire world, and it has played an important role. Intelligent development based on artificial intelligence and computers has a very important role in the issue of safety from the pandemic, as the Topic of face recognition and identifying people who wear the mask or not in the introduction and deep education was the most prominent in this topic. Using deep learning techniques and the YOLO (”You on

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene

Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par

For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs and expedite delivery. Some small and medium businesses still use conventional methods to manage delivery routes. Decisions to manage delivery schedules and routes do not use any specific methods to expedite the delivery settlement process. This process is inefficient, takes a long time, increases costs and is prone to errors. Therefore, the Dijkstra algorithm has been used to improve the delivery management process. A delivery management system was developed to help managers and drivers

The study presents the modification of the Broyden-Flecher-Goldfarb-Shanno (BFGS) update (H-Version) based on the determinant property of inverse of Hessian matrix (second derivative of the objective function), via updating of the vector s ( the difference between the next solution and the current solution), such that the determinant of the next inverse of Hessian matrix is equal to the determinant of the current inverse of Hessian matrix at every iteration. Moreover, the sequence of inverse of Hessian matrix generated by the method would never  approach a near-singular matrix, such that the program would never break before the minimum value of the objective function is obtained. Moreover, the new modification of BFGS update (H-vers