Viscosity (η) of solutions of 1-butanol, sec-butanol, isobutanol and tert-butanol were investigated in aqueous solution structures of ranged composition from 0.55 to 1 mol.dm-3 at 298.15 K. The data of (η/η˳) were evaluated based on reduced Jone - Dole equation; η/η˳ =BC+1. In the term of B value, the consequences based on solute-solvent interaction in aqueous solutions of alcohols were deliberated. The outcomes of this paper discloses that alcohols act as structure producers in the water. Additionally, it has shown that solute-solvent with interacting activity of identical magnitude is in water-alcohol system
Na+/K+-ATPase is a prevalent enzyme that maintains the Na+ and K+ gradients across the cell membrane by transporting three Na+ out and two K+ into the cell, the aim of this study is to provide detailed mechanistic insights, potentially with important effects on physiological regulation of active Na and K transport in tissues of Aerobic Thyroid Patient. Thyroid tissues were obtained from a 35 year old patients, the operation was carried out at the Al-Hadi Specialist Hospital in Samarra city, the sample was stored at -20ºC until used. The purification protocol included Salt Precipitation, Ion Exchange Chromatography, Gel Filtration and E
... Show MoreThis paper presents a hybrid genetic algorithm (hGA) for optimizing the maximum likelihood function ln(L(phi(1),theta(1)))of the mixed model ARMA(1,1). The presented hybrid genetic algorithm (hGA) couples two processes: the canonical genetic algorithm (cGA) composed of three main steps: selection, local recombination and mutation, with the local search algorithm represent by steepest descent algorithm (sDA) which is defined by three basic parameters: frequency, probability, and number of local search iterations. The experimental design is based on simulating the cGA, hGA, and sDA algorithms with different values of model parameters, and sample size(n). The study contains comparison among these algorithms depending on MSE value. One can conc
... Show MoreHiding technique for dynamic encryption text using encoding table and symmetric encryption method (AES algorithm) is presented in this paper. The encoding table is generated dynamically from MSB of the cover image points that used as the first phase of encryption. The Harris corner point algorithm is applied on cover image to generate the corner points which are used to generate dynamic AES key to second phase of text encryption. The embedded process in the LSB for the image pixels except the Harris corner points for more robust. Experimental results have demonstrated that the proposed scheme have embedding quality, error-free text recovery, and high value in PSNR.
Computer systems and networks are increasingly used for many types of applications; as a result the security threats to computers and networks have also increased significantly. Traditionally, password user authentication is widely used to authenticate legitimate user, but this method has many loopholes such as password sharing, brute force attack, dictionary attack and more. The aim of this paper is to improve the password authentication method using Probabilistic Neural Networks (PNNs) with three types of distance include Euclidean Distance, Manhattan Distance and Euclidean Squared Distance and four features of keystroke dynamics including Dwell Time (DT), Flight Time (FT), mixture of (DT) and (FT), and finally Up-Up Time (UUT). The resul
... Show MoreThe Internet of Things (IoT) is an information network that connects gadgets and sensors to allow new autonomous tasks. The Industrial Internet of Things (IIoT) refers to the integration of IoT with industrial applications. Some vital infrastructures, such as water delivery networks, use IIoT. The scattered topology of IIoT and resource limits of edge computing provide new difficulties to traditional data storage, transport, and security protection with the rapid expansion of the IIoT. In this paper, a recovery mechanism to recover the edge network failure is proposed by considering repair cost and computational demands. The NP-hard problem was divided into interdependent major and minor problems that could be solved in polynomial t
... Show More