The performance of a solar assisted desiccant cooling system for a meeting-hall located in the College of Engineering/University of Baghdad was evaluated theoretically. The system was composed of four components; a solar air heater, a desiccant dehumidifier, a heat exchanger and an evaporative cooler. A computer simulation was developed by using MATLAB to assess the effect of various design and operating conditions on the performance of the system and its components. The actual weather data on recommended days were used to assess the load variation and the system performance during those days. The radiant time series method (RTS) was used to evaluate the hourly variation of the cooling load. Four operation modes were employed for performance evaluation. A 100 % ventilation mode and 3 recirculation modes, 30 % , 60 % and 100 % recirculation of room air. The concept of variable air volume was employed as a control strategy over the day, by changing the supply airflow rate to match the variation in the cooling load.
The results showed that the reduction in moisture content at regeneration temperatures from 55 o C to 75 o C lead to adequate removal of the high latent load in the meeting-hall. Also, the 30 % recirculation of return air resulted in comfortable indoor conditions satisfying the ventilation requirements for most periods of system operation. In addition, the COP of the system was high compared with the conventional vapor compression system. It varied from 1 to 13, when considering solar energy used to regenerate the
desiccant material as free energy.
The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time. Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle to involve four types of binary code books (i.e. Pour when , Flat when , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding procedure, with very small distortion per block, by designing s
... Show MoreObjectives: Evaluation of school health surveillance system with Indicate the level of usefulness of this system,
in addition to Describe the system.
Methodology: A probability multistage sample of (54) subjects which is selected the school health units from
the health institutions. Questionnaire has been divided into three main parts consist, form(A) especially for
health directorate, form (B) for health sectors, and form (C) for primary health care centers; each form contains
the basic components, structure, process, outcome, total items of questionnaire was ( 74) items.
Results: The study results indicate that the system is average adequacy, simple, moderately flexible, highly
acceptance, representative, low utili
Let
he concept of small monoform module was introduced by Hadi and Marhun, where a module U is called small monoform if for each non-zero submodule V of U and for every non-zero homomorphism f ∈ Hom R (V, U), implies that ker f is small submodule of V. In this paper the author dualizes this concept; she calls it co-small monoform module. Many fundamental properties of co-small monoform module are given. Partial characterization of co-small monoform module is established. Also, the author dualizes the concept of small quasi-Dedekind modules which given by Hadi and Ghawi. She show that co-small monoform is contained properly in the class of the dual of small quasi-Dedekind modules. Furthermore, some subclasses of co-small monoform are investiga
... Show MoreLet R be a commutative ring with identity, and M be unital (left) R-module. In this paper we introduce and study the concept of small semiprime submodules as a generalization of semiprime submodules. We investigate some basis properties of small semiprime submodules and give some characterizations of them, especially for (finitely generated faithful) multiplication modules.
Let
