Abstract :H.pylori is an important cause of gastric duodenal disease, including gastric ulcers, Mucosa-associated lymphoid tissue (MALT), and gastric carcinoma. biosensors are becoming the most extensively studied discipline because the easy, rapid, low-cost, highly sensitive, and highly selective biosensors contribute to advances in next-generation medicines such as individualized medicine and ultrasensitive point-of-care detection of markers for diseases. Five of ten patients diagnosed with H.pylori ranging in age from 15–85 participated in this research. who [gastritis, duodenitis, duodenal ulcer (DU), and peptic ulcer (PU)] Suspected H.pylori colonies were identified by the presence of urease, catalase, oxidase activity, and PCR. All parameters are fixed: Laser power:40 mW, size of drops:25 μ, Turbidity:0.5. , Multi modes optical fiber, and Coreless optical fiber to construct optical biosensor (Multimode-Coreless-Multimode) optical fibers based on an inline Mach-Zehnder Interferometer. All samples had a sensitivity. Multimode-Coreless-Multimode optical Biosensor: is a rapid and sensitive method for the detection of H.pylori bacteria.
The energy expectation values for Li and Li-like ions ( , and ) have been calculated and examined within the ground state and the excited state in position space. The partitioning technique of Hartree-Fock (H-F) has been used for existing wave functions.
As s widely use of exchanging private information in various communication applications, the issue to secure it became top urgent. In this research, a new approach to encrypt text message based on genetic algorithm operators has been proposed. The proposed approach follows a new algorithm of generating 8 bit chromosome to encrypt plain text after selecting randomly crossover point. The resulted child code is flipped by one bit using mutation operation. Two simulations are conducted to evaluate the performance of the proposed approach including execution time of encryption/decryption and throughput computations. Simulations results prove the robustness of the proposed approach to produce better performance for all evaluation metrics with res
... Show MoreThe problem motivation of this work deals with how to control the network overhead and reduce the network latency that may cause many unwanted loops resulting from using standard routing. This work proposes three different wireless routing protocols which they are originally using some advantages for famous wireless ad-hoc routing protocols such as dynamic source routing (DSR), optimized link state routing (OLSR), destination sequenced distance vector (DSDV) and zone routing protocol (ZRP). The first proposed routing protocol is presented an enhanced destination sequenced distance vector (E-DSDV) routing protocol, while the second proposed routing protocol is designed based on using the advantages of DSDV and ZRP and we named it as
... Show MoreMany numerical approaches have been suggested to solve nonlinear problems. In this paper, we suggest a new two-step iterative method for solving nonlinear equations. This iterative method has cubic convergence. Several numerical examples to illustrate the efficiency of this method by Comparison with other similar methods is given.
Silver-bismuth iodide (ABI) ternary semiconductors, such as AgBi2I7, AgBiI4, Ag2BiI5, and Ag3BiI6, have emerged as promising lead-free light absorbers for photovoltaic applications due to their favorable optoelectronic properties. Despite recent advances that have improved power conversion efficiencies from ∼1% to over 5%, ABI-based solar cells still show substantial open-circuit voltage (VOC) losses of up to ∼1 V, which significantly hinder the device performance. These losses have been experimentally attributed to the non-radiative recombination originating from intrinsic defects, however, theoretical understanding of these defect mechanisms remains limited. Here, using density functional theory calculations, we systematical
... Show MoreGraph 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.