A series of liquid crystals comprising a heterocyclics dihydro pyrrole and 1,2,3-triazole rings [VII]-[X] were synthesized by many steps starting from a reaction of 3,3'-dimethyl-[1,1'-biphenyl]- 4,4'-diamine with chloroacetyl chloride in a mixture of solutions DMF and TEA to synthesise the compounds [I], then the compounds [I] reacted with malononitrile in 1,4-dioxane and TEA solutions to produce compounds [II], then the first step is repeated with compound [II] where it reacted with chloroacetyl chloride in mixture of DMF and TEA to give compound [III], this compound reacted with sodium azide in the presence of sodium chloride and DMF as solvent to produce the compound [IV], which reacted with acrylic acid by a 1.3 dipolar reaction in sol

To maintain the security and integrity of data, with the growth of the Internet and the increasing prevalence of transmission channels, it is necessary to strengthen security and develop several algorithms. The substitution scheme is the Playfair cipher. The traditional Playfair scheme uses a small 5*5 matrix containing only uppercase letters, making it vulnerable to hackers and cryptanalysis. In this study, a new encryption and decryption approach is proposed to enhance the resistance of the Playfair cipher. For this purpose, the development of symmetric cryptography based on shared secrets is desired. The proposed Playfair method uses a 5*5 keyword matrix for English and a 6*6 keyword matrix for Arabic to encrypt the alphabets of

High performance work systems and general industrial enterprise performance

Background: Diabetes mellitus (DM) is a significant cause of visual impairment; many diabetics do not have regular eye examinations, although it is known that early diagnosis and reduces the risk of blindness. There were many barriers that prevent diabetics from attending eye clinics.

Objectives: To assess knowledge, and practice about ocular complications among diabetic patients and to determine barriers preventing the diabetic patients annual visual checking

Methods: A cross-sectional study involving the interview was conducted among 300 diabetic patients attending out patient in Ibn Al Haitham Teaching Ophthalmology Hospital between November 2017 and June 2018.

Wireless channels are typically much more noisy than wired links and subjected to fading due to multipath  propagation which result in ISI and hence high error rate. Adaptive modulation is a powerful technique to improve the tradeoff between spectral efficiency and Bit Error Rate (BER). In order to adjust the transmission rate, channel state information (CSI) is required at the transmitter side.

In this paper the performance enhancement of using linear prediction along with channel estimation to track the channel variations and adaptive modulation were examined. The simulation results shows that the channel estimation is sufficient for low Doppler frequency shifts (<30 Hz), while channel prediction is much more suited at

A new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th

Let  be a commutative ring with 1 and  be left unitary  . In this paper we introduced and studied concept of semi-small compressible module (a     is said to be semi-small compressible module if  can be embedded in every nonzero semi-small submodule of . Equivalently,  is  semi-small compressible module if there exists a monomorphism  , ,     is said to be semi-small retractable module if  , for every non-zero  semi-small sub module in . Equivalently,  is semi-small retractable if there exists a homomorphism  whenever  .     In this paper we introduce and study the concept of semi-small compressible and semi-small retractable s as a generalization of compressible  and retractable  respectively and give some of their adv