يهدف البحث الى دراسة وتحليل الهندسة المتزامنة (CE) وتحسين التكلفة(CO)، واستعمال مخرجات الهندسة المتزامنة كمدخلات لتحسين التكلفة، وبيان دور الهندسة المتزامنة في تحسين جودة المنتوج، وتحقيق وفورات في وقت التصميم والتصنيع والتجميع وتخفيض التكاليف، فضلاً عن توظيف بعض النماذج لتحديد مقدار الوفورات في الوقت ومنها نموذج(Lexmark) ونموذج (Pert) لتحديد الوفورات في وقت التصميم وقت لتصنيع والتجميع.      ولتحقيق اهداف 

The expanding use of multi-processor supercomputers has made a significant impact on the speed and size of many problems. The adaptation of standard Message Passing Interface protocol (MPI) has enabled programmers to write portable and efficient codes across a wide variety of parallel architectures. Sorting is one of the most common operations performed by a computer. Because sorted data are easier to manipulate than randomly ordered data, many algorithms require sorted data. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. In this paper, sequential sorting algorithms, the parallel implementation of man

This investigation was carried out to study the treatment and recycling of wastewater in the Battery industry for an effluent containing lead ion. The reuse of such effluent can only be made possible by appropriate treatment method such as electro coagulation.
The electrochemical process, which uses a cell comprised aluminum electrode as anode and stainless steel electrode as cathode was applied to simulated wastewater containing lead ion in concentration 30 – 120 mg/l, at different operational conditions such as current density 0.4-1.2 mA/cm2, pH 6 -10 , and time 10 - 180 minute.
The results showed that the best operating conditions for complete lead removal (100%) at maximum concentration 120 mg/l was found to be 1.2 mA/cm2 cur

This study was carried out to investigate the effect of dietary supplementation with different levels of parsley on semen quality of local Iraqi ganders. A total of thirty-two local ganders were used in this study during the period from the beginning of February to the end of April. The ganders were allocated for 4 treatment groups containing 8 ganders each. The treatment groups were as follows: Control diet (free from parsley); T1: Control diet + 80 g/d parsley; T2: Control diet + 160 g/d parsley; T3: Control diet + 240 g/d parsley. Semen samples were collected twice a week, fortnightly, from each gander by the dorsal-abdominal message method. The first semen collection was used to evaluate semen volume, sperm concentration, live in total

New series of 2-mecapto benzoxazole derivatives (1-20) incorporated into fused to different nitrogen and suphur containing heterocyclic were prepared from 2-meracpto benzoxazole, when treated with hydrazine hydrate to afford 2-hydrazino benzoxazol (1). Compound (1) converted to a variety of pyridazinone andphthalazinone derivatives (2-4) by reaction with different carboxylic anhydride. Also, reaction of (1) with phenyl isothiocyanate and ethyl chloro acetate afforded 3-phenyl-1,3-thiazolidin-2,4-dione-2-(benzoxazole-2-yl-hydrazone) (6). Azomethines (7-10) were prepared through reaction of (1) with aromatic aldehyde, then (7, 8) converted to thaizolidinone derivatives (11, 12). Treatment of (1) with active methylene compounds afforded deriva

The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so

In this paper, membrane-based computing image segmentation, both region-based and edge-based, is proposed for medical images that involve two types of neighborhood relations between pixels. These neighborhood relations—namely, 4-adjacency and 8-adjacency of a membrane computing approach—construct a family of tissue-like P systems for segmenting actual 2D medical images in a constant number of steps; the two types of adjacency were compared using different hardware platforms. The process involves the generation of membrane-based segmentation rules for 2D medical images. The rules are written in the P-Lingua format and appended to the input image for visualization. The findings show that the neighborhood relations between pixels o

A large amount of thermal energy is generated from burning hazardous chemical wastes, and the temperature of the flue gases in hazardous waste incinerators reaches up to (1200 °C). The flue gases are cooled to (40°C) and are treated before emission. This thermal energy can be utilized to produce electrical power by designing a system suitable for dangerous flue gases in the future depending on the results of much research about using a proto-type small steam power plant that uses safe fuel to study and develop the electricity generation process with water tube boiler which is manufactured experimentally with theoretical development for some of its parts which are inefficient in experimental work. The studied system gen

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