Background: Chronic periodontitis is an inflammatory disease of tissues supporting the teeth. Salivary compositions have been most intensely studied as a potential marker for periodontal disease. In this study, analysis of saliva provides a simple and non-invasive method of evaluating the role of salivary IgA (s-IgA) levels in periodontal disease by detecting the level of (s-IgA) in patients with chronic periodontitis smokers and non smokers patients and correlate the mean (s-IgA) levels with clinical periodontal parameters Plaque index (PLI) gingival index (GI), probing pocket depth (PPD) and clinical attachment level (CAL). Materials and Methods: The study samples consists of (15) patients with chronic periodontitis who were non smokers (Group I) and (15) patients with chronic periodontitis who were smokers (Group II) of both gender with an age ranged (35-45) years were the periodontal parameters used in this study (PLI, GI, PPD and CAL), unstimulated salivary sample were collected from all subjects and the levels of salivary IgA (s-IgA) in each sample were analyzed for each group by using enzyme-linked immunosorbent assay (ELISA) technique. A statistical analysis was done by using excel 2013. Results: There was a significant difference with high mean level in the clinical periodontal parameters in smokers group compared to non smokers with chronic periodontitis (PLI, PPD and CAL) except GI which showed no significant difference between the same groups. The biochemical finding showed significant difference with low mean level for (s-IgA) in smokers group compared to non smokers. Conclusion: The findings in this study showed that the concentrations of salivary IgA might be used as an indicator for periodontal disease progression in smokers with chronic periodontitis as a resultant to the effect of smoking which lowering the concentration of the salivary IgA and subsequent reducing of the host’s defense lead to increase in the progression of periodontal disease.
There has been a great deal of research into the considerable challenge of managing of traffic at road junctions; its application to vehicular ad hoc network (VANET) has proved to be of great interest in the developed world. Dynamic topology is one of the vital challenges facing VANET; as a result, routing of packets to their destination successfully and efficiently is a non-simplistic undertaking. This paper presents a MDORA, an efficient and uncomplicated algorithm enabling intelligent wireless vehicular communications. MDORA is a robust routing algorithm that facilitates reliable routing through communication between vehicles. As a position-based routing technique, the MDORA algorithm, vehicles' precise locations are used to establish th
... Show MoreThe evaluation of subsurface formations as applied to oil well drilling started around 50 years ago. Generally, the curent review articule includes all methods for coring, logging, testing, and sampling. Also the methods for deciphering logs and laboratory tests that are relevant to assessing formations beneath the surface, including a look at the fluids they contain are discussed. Casing is occasionally set in order to more precisely evaluate the formations; as a result, this procedure is also taken into account while evaluating the formations. The petrophysics of reservoir rocks is the branch of science interested in studying chemical and physical properties of permeable media and the components of reservoir rocks which are associated
... Show MoreThe significance fore supra topological spaces as a subject of study cannot be overstated, as they represent a broader framework than traditional topological spaces. Numerous scholars have proposed extension to supra open sets, including supra semi open sets, supra per open and others. In this research, a notion for ⱨ-supra open created within the generalizations of the supra topology of sets. Our investigation involves harnessing this style of sets to introduce modern notions in these spaces, specifically supra ⱨ - interior, supra ⱨ - closure, supra ⱨ - limit points, supra ⱨ - boundary points and supra ⱨ - exterior of sets. It has been examining the relationship with supra open. The research was also enriched with many
... Show MoreIn this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.
Recently, Image enhancement techniques can be represented as one of the most significant topics in the field of digital image processing. The basic problem in the enhancement method is how to remove noise or improve digital image details. In the current research a method for digital image de-noising and its detail sharpening/highlighted was proposed. The proposed approach uses fuzzy logic technique to process each pixel inside entire image, and then take the decision if it is noisy or need more processing for highlighting. This issue is performed by examining the degree of association with neighboring elements based on fuzzy algorithm. The proposed de-noising approach was evaluated by some standard images after corrupting them with impulse
... Show MoreLet be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.
This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of
... Show More