Let f and g be a self – maps of a rational exterior space . A natural number m is called a minimal coincidence period of maps f and g if f^m and g^m have a coincidence point which is not coincidence by any earlier iterates. This paper presents a complete description of the set of algebraic coincidence periods for self - maps of a rational exterior space which has rank 2 .
In this paper, we introduce an exponential of an operator defined on a Hilbert space H, and we study its properties and find some of properties of T inherited to exponential operator, so we study the spectrum of exponential operator e^T according to the operator T.
In this paper we generalize Jacobsons results by proving that any integer in is a square-free integer), belong to . All units of are generated by the fundamental unit having the forms
Our generalization build on using the conditions
This leads us to classify the real quadratic fields into the sets Jacobsons results shows that and Sliwa confirm that and are the only real quadratic fields in .
Background: Langerhans' cell histiocytosis (LCH) is a group of conditions affecting the reticuloendothelial system. It includes Letterer-Siwe disease, Hand-Schuller-Christian disease and eosinophilic granuloma and most often presents in childhood. Materials and methods: Twenty-five cases of LCH were diagnosed histologically and confirmed by CD1a antibody and assessed immunohistochemically using anti-RANKL and anti-RANK antibodies to evaluate osteoclastogenic mechanism. Results: Regarding jaw cases, there was a significant correlation between CD1a and RANK (P=0.016). While in the skull, highly significant correlation existed between RANK and RANKL (p=0.001). Among the sites, there was no statistically significant difference found for each
... Show MoreChaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed. Compared with the classical traditional ciphers like Feistel-based structure ciphers, Data Encryption Standards (DES), is the common example of Feistel-based ciphers, the process of confusion and diffusion, will contains the dynamical permutation choice boxes, dynamical substitution choice boxes, which will be generated once and hence, considered static,
While using chaotic maps, in the suggested system, called
This paper presents a new RGB image encryption scheme using multi chaotic maps. Encrypting an image is performed via chaotic maps to confirm the properties of secure cipher namely confusion and diffusion are satisfied. Also, the key sequence for encrypting an image is generated using a combination of 1D logistic and Sine chaotic maps. Experimental results and the compassion results indicate that the suggested scheme provides high security against several types of attack, large secret keyspace and highly sensitive.
This study was designed to investing the drug prescribing pattern which is the important point in the rational or irrational use of drugs among patients dispensing their prescriptions from the private pharmacies in Maysan governorate, Iraq for a period of 1 month. The data collected from prescriptions were calculated and analyzed according to the WHO prescribing guidelines. The data showed that the mean of drugs included in single prescription was 3.4, and 12% of prescribed drugs were written as generic names; moreover, the percentage of antibiotics, corticosteroids and anxiolytics were 33.3%, 11.4% and 23.8% respectively. Those results indicate the irrational use of drugs when compared with the world health organization standard values
... Show MoreTrue random number generators are essential components for communications to be conconfidentially secured. In this paper a new method is proposed to generate random sequences of numbers based on the difference of the arrival times of photons detected in a coincidence window between two single-photon counting modules
In this paper we introduce a new class of degree of best algebraic approximation polynomial Α,, for unbounded functions in weighted space Lp,α(X), 1 ∞ .We shall prove direct and converse theorems for best algebraic approximation in terms modulus of smoothness in weighted space
The paper establishes explicit representations of the errors and residuals of approximate
solutions of triangular linear systems by Jordan elimination and of general linear algebraic
systems by Gauss-Jordan elimination as functions of the data perturbations and the rounding
errors in arithmetic floating-point operations. From these representations strict optimal
componentwise error and residual bounds are derived. Further, stability estimates for the
solutions are discussed. The error bounds for the solutions of triangular linear systems are
compared to the optimal error bounds for the solutions by back substitution and by Gaussian
elimination with back substitution, respectively. The results confirm in a very