Objective: Evaluation the national standards for exposure to chemical materials and dusts in The State
Company for Drugs Industry in Samarra.
Methodology: A descriptive evaluation design is employed through the present study from 25th May 2011
to 30th November 2011 in order to evaluate the national standards for exposure chemical materials and dusts
in The State Company for Drugs Industry in Samarra. A purposive (non-probability) sample is selected for the
study which includes (110) workers from the State Company for Drugs Industry in Samarra. Data were
gathered through the workers` interviewed according to the nature of work that they perform. The evaluation
questionnaire comprised of three parts which include the w

The work was carried out in two stages. The first stage concerned
with study of silicon carbide (SiC) ratio (1.5, 2.5, 3.5, and 4.5 wt%)
effect on the Thermal conductivity of polyvinyl chloride (PVC); and
the second stage concerned with the UV – weatherizing (25, 50, and
75 hr), thermal aging (40, 50, and 60 °C), and rain- weatherizing (1,
2.5, and 4 hr) effect on the samples involved. Thermal conductivity
results proved that there was slight increase in thermal conductivity
by (SiC) loading; it increased from 0.17 W/m.K for PVC to 0.19
W/m.K for 4.5% SiC/PVC; where as it was systematically decreased
by UV- weatherizing, thermal aging, and rain- weatherizing. This
property is in a good agreement with gene

A new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove

In data transmission a change in single bit in the received data may lead to miss understanding or a disaster. Each bit in the sent information has high priority especially with information such as the address of the receiver. The importance of error detection with each single change is a key issue in data transmission field.
The ordinary single parity detection method can detect odd number of errors efficiently, but fails with even number of errors. Other detection methods such as two-dimensional and checksum showed better results and failed to cope with the increasing number of errors.
Two novel methods were suggested to detect the binary bit change errors when transmitting data in a noisy media.Those methods were: 2D-Checksum me

Abstract

Much attention has been paid for the use of robot arm in various applications. Therefore, the optimal path finding has a significant role to upgrade and guide the arm movement. The essential function of path planning is to create a path that satisfies the aims of motion including, averting obstacles collision, reducing time interval, decreasing the path traveling cost and satisfying the kinematics constraints. In this paper, the free Cartesian space map of 2-DOF arm is constructed to attain the joints variable at each point without collision. The D*algorithm and Euclidean distance are applied to obtain the exact and estimated distances to the goal respectively. The modified Particle Swarm Optimization al

 Dens itiad ns vcovadoay fnre Dec2isco0D,ia asrn2trcds4 fenve ns 6ocfo ts ida%n2notd, rasr sedno6t(a asrn2trcd fnre sc2a 2cynwnvtrnco co nrs wcd2 /nt sedno6t(a fan(er wtvrcd ﯿ)ﺔ mh         Dens r,ia cw asrn2trcds et/a laao vcosnyaday wcd asrn2trno( rea itdt2arads ﻘ cw sn2i%a %noatd da(dassnco 2cya%4 feao t idncd asrn2tra cw rea itdt2arad /t%ua )ﻘm ns t/tn%tl%a4 st, ﻘxh Dens ﻘx ets laao dawadday no srtrnsrnvt% %nradtrudas ts (uass icnor tlcur rea itdt2arad ﻘh         Dea aMidassncos wcd Snts4 Oato -9utday 8ddcd )O-8m toy .a%trn/a 8wwnvnaov, cw rea idcicsay asrn2trcds tda clrtnoayh 1u2adnvt% dasu%rs tda idc/nyay feao rea

The aims of the paper are to present a modified symmetric fuzzy approach to find the best workable compromise solution for quadratic fractional programming problems (QFPP) with fuzzy crisp in both the objective functions and the constraints. We introduced a modified symmetric fuzzy by proposing a procedure, that starts first by converting the quadratic fractional programming problems that exist in the objective functions to crisp numbers and then converts the linear function that exists in the constraints to crisp numbers. After that, we applied the fuzzy approach to determine the optimal solution for our quadratic fractional programming problem which is supported theoretically and practically. The computer application for the algo