Graph  is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is connected to a node in it via an edge. Because of the importance of domination in different areas, variant types of domination have been introduced according to the purpose they are used for. In this paper, two domination parameters the first is the restrained and the second is secure domination have been chosn. The secure domination, and some types of restrained domination in one type of trees is called complete ary tree  are determined.

In this research the change in the distance of the two stars in two binary star systems (13.6+8)M₈and (13+10)M₈ was studied, through the calculations the value  (rate of mass transfer) of the two phases of dynamical stages of mass which are mass loss and mass transfer has been extracted in its own way ,by extracting the value of  the value of (the distance variation between the two stars) has been found only in the mass transfer stage by using mathematical model ,in mass loss stage  and   were calculated from the change and the difference between the values of each at different times of binary star system evolution ,it was found that  the maximum values of  and  are in ma

Abstract:

 This research aims to compare Bayesian Method and Full Maximum Likelihood to estimate hierarchical Poisson regression model.

The comparison was done by  simulation  using different sample sizes (n = 30, 60, 120) and different Frequencies (r = 1000, 5000) for the experiments as was the adoption of the  Mean Square Error to compare the preference estimation methods and then choose the best way to appreciate model and concluded that hierarchical Poisson regression model that has been appreciated Full Maximum Likelihood Full Maximum Likelihood  with sample size  (n = 30) is the best to represent the maternal mortality data after it has been reliance value param

The aim of this study is to evaluate oxidative stress in diabetes mellitus (DM) Type1 by the measurement of Glucose-6-phosphate Dehydrogenase (G-6-PD), an enzyme expressed in human RBCs, is important in the generation of reduced glutathione which is the key product in oxidative stress controls. The Study was carried on 80 samples of blood and serum of National Diabetes Center (NDC). The study groups under fasting conditions and they divided as:20 samples of diabetes mellitus patients without complications and 20 samples of diabetes mellitus with cardiovascular (CV) complications and 20 samples of diabetes mellitus with Nephropathy (Neph) complications compared with 20 control group with average age (13-67) years.. The results sh

Both traditional and novel techniques were employed in this work for magnetic shielding evaluation to shed new light on the magnetic and aromaticity properties of benzene and 12 [n]paracyclophanes with n = 3–14. Density functional theory (DFT) with the B3LYP functional and all-electron Jorge-ATZP and x2c-TZVPPall-s basis sets was utilized for geometry optimization and magnetic shielding calculations, respectively. Additionally, the 6-311+G(d,p) basis set was incorporated for the purpose of comparing the magnetic shielding results. In addition to traditional evaluations such as NICS/NICSzz-Scan, and 2D-3D σiso(r)/σzz(r) maps, two new techniques were implemented: bendable grids (BGs) and cylindrical grids (CGs) of ghost atoms (Bqs). BGs a

Abstract. Full-waveform airborne laser scanning data has shown its potential to enhance available segmentation and classification approaches through the additional information it can provide. However, this additional information is unable to directly provide a valid physical representation of surface features due to many variables affecting the backscattered energy during travel between the sensor and the target. Effectively, this delivers a mis-match between signals from overlapping flightlines. Therefore direct use of this information is not recommended without the adoption of a comprehensive radiometric calibration strategy that accounts for all these effects. This paper presents a practical and reliable radiometric calibration r

One of the crucial public health problems worldwide is the urinary tract infections (UTIs) that are derived from uropathogenic bacteria (UPBs). Slime layer is known to have the ability to permit bacteria to achieve smooth surfaces attachment like catheters and prosthetic implants which in turn, facilitate biofilm formation and may cause lethal infections. On the other hand, Extended-spectrum beta-lactamase (ESBL) production is considered a growing concern among UPBs due to the limiting of the treatment options and contributes to resistance toward antibiotics. The principal study's point is the finding out the slime layer and ESBL production in Escherichia coli and Klebsiella pneumoniae of uropathogenic origin. Ten ready isolates (five isola

Digital forensics has become a fundamental requirement for law enforcement due to the growing volume of cyber and computer-assisted crime. Whilst existing commercial tools have traditionally focused upon string-based analyses (e.g., regular expressions, keywords), less effort has been placed towards the development of multimedia-based analyses. Within the research community, more focus has been attributed to the analysis of multimedia content; they tend to focus upon highly specialised specific scenarios such as tattoo identification, number plate recognition, suspect face recognition and manual annotation of images. Given the ever-increasing volume of multimedia content, it is essential that a holistic Multimedia-Forensic Analysis Tool (M-

In this work, we construct the projectively distinct (k, n)-arcs in PG (3, 4) over Galois field GF (4), where k 5, and we found that the complete (k, n)-arcs, where 3 n 21, moreover we prove geometrically that the maximum complete (k, n)-arc in PG (3, 4) is (85, 21)-arc. A (k, n)-arcs is a set of k points no n+ 1 of which are collinear. A (k, n)-arcs is complete if it is not contained in a (k+ 1, n)-arcs