The systems cooling hybrid solar uses solar collector to convert solar energy into the source of heat for roasting Refrigerant outside of the compressor and this process helps in the transformation of Refrigerant from the gas to a liquid state in two-thirds the top of the condenser instead of two-thirds the bottom of the condenser as in Conventional cooling systems and this in turn reduces the energy necessary to lead the process of cooling. The system cooling hybrid use with a capacity of 1 ton and Refrigerant type R22 and the value of current drawn by the system limits (3.9-4.2A), the same value of electric current calculated by the system are Conventional within this atmosphere of Iraq, and after taking different readings
... Show MoreOptimizing the Access Point (AP) deployment is of great importance in wireless applications owing the requirement to provide efficient and cost-effective communication. Highly targeted by many researchers and academic industries, Quality of Service (QOS) is an important primary parameter and objective in mind along with AP placement and overall publishing cost. This study proposes and investigates a multi-level optimization algorithm based on Binary Particle Swarm Optimization (BPSO). It aims to an optimal multi-floor AP placement with effective coverage that makes it more capable of supporting QOS and cost effectiveness. Five pairs (coverage, AP placement) of weights, signal threshol
RA Ali, LK Abood, Int J Sci Res, 2017 - Cited by 2
The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
An experiment was carried out in the fields of Agriculture College-Baghdad University during spring and autumn of 2015 by using a randomized complete blocks design with three replications. The first season hybridization was established among three pure cultivars of cowpea (Vigna uniguiculata L.) which: Ramshorn, California black eye and Rahawya in full diallel crosses according to Griffing with first method and fixed model (3 parents+ 3 diallel hybrids +3 reciprocal hybrids) and a comparison experiment was in autumn season. The result of statistical analysis showed that there was a significant difference among the parents and their hybrids for all the studied characters. The parent 1 was the higher for root nodules number , leaf number, pod
... Show MoreThe objective of the present study is to verify the actual carious lesion depth by laser
fluorescence technique using 650 nm CW diode laser in comparison with the histopathological
investigation. Five permanent molar teeth were extracted from adult individuals for different reasons
(tooth impaction, periodontal diseases, and pulp infections); their ages were ranging from 20-25 years
old. Different carious teeth with varying clinical stages of caries progression were examined. An
experimental laser fluorescence set-up was built to perform the work regarding in vitro detection and
quantification of occlusal dental caries and the determination of its actual clinical carious lesion depth by
650 nm CW diode laser (excitat
FG Mohammed, HM Al-Dabbas, Iraqi journal of science, 2018 - Cited by 6
The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul
... Show More