In modern era, which requires the use of networks in the transmission of data across distances, the transport or storage of such data is required to be safe. The protection methods are developed to ensure data security. New schemes are proposed that merge crypto graphical principles with other systems to enhance information security. Chaos maps are one of interesting systems which are merged with cryptography for better encryption performance. Biometrics is considered an effective element in many access security systems. In this paper, two systems which are fingerprint biometrics and chaos logistic map are combined in the encryption of a text message to produce strong cipher that can withstand many types of attacks. The histogram analysis of ciphertext shows that the resulted cipher is robust. Each character in the plaintext has different representations in the ciphertext even if the characters are repeated through the message. The strength of generated cipher was measured through brute force attackers, they were unable to deduce the key from the knowledge about pairs of plaintext- ciphertext due to the fact that each occurrence of characters in the message will have different shift value, and as a result a diverse representation will be obtained for same characters of the message.
The main aim of this paper is to apply a new technique suggested by Temimi and Ansari namely (TAM) for solving higher order Integro-Differential Equations. These equations are commonly hard to handle analytically so it is request numerical methods to get an efficient approximate solution. Series solutions of the problem under consideration are presented by means of the Iterative Method (IM). The numerical results show that the method is effective, accurate and easy to implement rapidly convergent series to the exact solution with minimum amount of computation. The MATLAB is used as a software for the calculations.
(4)
(3)
(3)
An efficient combination of Adomian Decomposition iterative technique coupled Elzaki transformation (ETADM) for solving Telegraph equation and Riccati non-linear differential equation (RNDE) is introduced in a novel way to get an accurate analytical solution. An elegant combination of the Elzaki transform, the series expansion method, and the Adomian polynomial. The suggested method will convert differential equations into iterative algebraic equations, thus reducing processing and analytical work. The technique solves the problem of calculating the Adomian polynomials. The method’s efficiency was investigated using some numerical instances, and the findings demonstrate that it is easier to use than many other numerical procedures. It has
... Show More
(1)
(1)
(1)
Multilevel models are among the most important models widely used in the application and analysis of data that are characterized by the fact that observations take a hierarchical form, In our research we examined the multilevel logistic regression model (intercept random and slope random model) , here the importance of the research highlights that the usual regression models calculate the total variance of the model and its inability to read variance and variations between levels ,however in the case of multi-level regression models, the calculation of the total variance is inaccurate and therefore these models calculate the variations for each level of the model, Where the research aims to estimate the parameters of this m
... Show More
Date stones were used as precursor for the preparation of activated carbons by chemical
activation with ferric chloride and zinc chloride. The effects of operating conditions represented
by the activation time, activation temperature, and impregnation ratio on the yield and adsorption
capacity towards methylene blue (MB) of prepared activated carbon by ferric chloride activation
(FAC) and zinc chloride activation (ZAC) were studied. For FAC, an optimum conditions of 1.25
h activation time, 700 °C activation temperature, and 1.5 impregnation ratio gave 185.15 mg/g
MB uptake and 47.08 % yield, while for ZAC, 240.77 mg/g MB uptake and 40.46 % yield were
obtained at the optimum conditions of 1.25 h activation time, 500
(6)
Abstract
The basic orientation of the research is an attempting to apply the cost determining method according in the contract sector projects for Al- Iraq ceneral company, that this subject has a big value according to its modernity and its influence on the future and the eaning of the company.
The research aims to find out the effect of the method for determining cost based on the activity in determining the cost of the construction sector projects.The research was conducted in Iraq General Company for the implementation of irrigation projects. Bani search on three assumptions, the first is (that the application of the method for determining the cost on the basis of
... Show More
In this study a DFT calculation on cyclopropanone, cyclopropandione and cyclopropantrione molecules was performed using the basis function 6-31G ** / MP2 and exchange correlation potential B3-LYP. The results showed that the ground state of all molecules geometry belong to the point group ð¶2ð‘£where a vibronic coupling between the vibrational motion with the electronic ground state in the molecule C3O3 this leads to a reduction in symmetry of the molecule fromð·3â„Žto ð¶2ð‘£, the driving force of this process is accessing to the electronic configuration complies with Hückel aromatic systems with two electrons. Also in this, study the normal modes of vibration, frequencies, intensities and symm
... Show More
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.