BACKGROUND: Keratoconus is a progressive non inflammatory bilateral (usually asymmetric) ectatic corneal disease characterized by paraxial stromal thinning ,weakening that lead to corneal surface distortion ,vision loss primarily from irregular astigmatism and myopia and secondly from corneal scar. OBJECTIVE: To evaluate visual and refractive outcomes after intracorneal continuous ring (ICCR) implantation combined with intrapocket corneal collagen cross linking in patient with keratoconus. Setting: Eye Specialty Private Hospital, Baghdad, Iraq. METHODS: This study assessed the results of implantation of Myoring ICCR combined with CXL in 40 eyes with KC. Outcome measures include UDVA,CDVA(spectacle correction),refraction, complications and s

The ground state proton, neutron and matter densities of exotic ¹¹Be and ¹⁵C nuclei are studied by means of the TFSM and BCM. In TFSM, the calculations are based on using different model spaces for the core and the valence (halo) neutron. Besides single particle harmonic oscillator wave functions are employed with two different size parameters  B_c and B_v.  In BCM, the halo nucleus is considered as a composite projectile consisting of core and valence clusters bounded in a state of relative motion. The internal densities of the clusters are described by single particle Gaussian wave functions.

 Elastic electron scattering proton f

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T

Statement of the Problem. The use of orthodontic fixed appliances may adversely affect oral health leading to demineralizing lesions and the development of gingival problems. Aims of the Study. The study aimed to coat orthodontic archwires with chlorhexidine hexametaphosphate nanoparticles (CHX-HMP NPs) and to evaluate the elusion of CHX from CHX-HMP NPs. Materials and Methods. A solution of CHX-HMP nanoparticles with an overall concentration of 5 mM for both CHX and HMP was prepared, characterized (using atomic force microscope and Fourier transformation infrared spectroscopy), and used to coat orthodontic stainless steel (SSW) and NiTi archwires (NiTiW). The coated segments were characterized (using scanning electron microscopy

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res

This 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

      Information is an essential and valuable object in all systems. The more information you have about your issue, the better you can conform to the world around you. Moreover, information recognizes companies and provides influence that helps one company be more effective than another. So, protecting this information using better security controls and providing a high level of access to authorized parties becomes an urgent need. As a result, many algorithms and encryption techniques have been developed to provide a high level of protection for system information. Therefore, this paper presents an enhancement to the Blowfish algorithm as one of the cryptography techniques. Then it proposes an enhancement for increasing efficiency

Nowadays, it is quite usual to transmit data through the internet, making safe online communication essential and transmitting data over internet channels requires maintaining its confidentiality and ensuring the integrity of the transmitted data from unauthorized individuals. The two most common techniques for supplying security are cryptography and steganography. Data is converted from a readable format into an unreadable one using cryptography. Steganography is the technique of hiding sensitive information in digital media including image, audio, and video. In our proposed system, both encryption and hiding techniques will be utilized. This study presents encryption using the S-DES algorithm, which generates a new key in each cyc