Quantum key distribution (QKD) provides unconditional security in theory. However, practical QKD systems face challenges in maximizing the secure key rate and extending transmission distances. In this paper, we introduce a comparative study of the BB84 protocol using coincidence detection with two different quantum channels: a free space and underwater quantum channels. A simulated seawater was used as an example for underwater quantum channel. Different single photon detection modules were used on Bob’s side to capture the coincidence counts. Results showed that increasing the mean photon number generally leads to a higher rate of coincidence detection and therefore higher possibility of increasing the secure key rate. The secure key rate can reach 0.0239 (bits/pulse) with a quantum bit error rate (QBER) of 3.2% for the free space channel and 1.5% for the simulated sea-water channel. The security parameters for each value of the mean photon number closely align with the corresponding theoretical predictions. However, some discrepancies were observed, primarily due to a mismatch in photon detection efficiency for SPDMs and system fluctuations. The theoretical calculations also predict that using coincidence detection, the key can be distributed over distances of up to 195 km.
Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith
... Show Morehe concept of small monoform module was introduced by Hadi and Marhun, where a module U is called small monoform if for each non-zero submodule V of U and for every non-zero homomorphism f ∈ Hom R (V, U), implies that ker f is small submodule of V. In this paper the author dualizes this concept; she calls it co-small monoform module. Many fundamental properties of co-small monoform module are given. Partial characterization of co-small monoform module is established. Also, the author dualizes the concept of small quasi-Dedekind modules which given by Hadi and Ghawi. She show that co-small monoform is contained properly in the class of the dual of small quasi-Dedekind modules. Furthermore, some subclasses of co-small monoform are investiga
... Show MoreLet R be a commutative ring with 1 and M be a (left) unitary R – module. This essay gives generalizations for the notions prime module and some concepts related to it. We termed an R – module M as semi-essentially prime if annR (M) = annR (N) for every non-zero semi-essential submodules N of M. Given some of their advantages characterizations and examples, and we study the relation between these and some classes of modules.
Let
Beta thalassemia major (BTM) is a genetic disorder that has been linked to an increased risk of contracting blood-borne viral infections, primarily due to the frequent blood transfusions required to manage the condition. One such virus that can be transmitted through blood is the Human Parvovirus B19 (B19V). The aim of this study was to investigate the frequency and molecular detection of B19V. This study included 60 blood donors as controls and 120 BTM patients. B19V was identified by serology, which measured B19-IgG and B19-IgM antibodies. Nested Polymerase Chain Reaction (nPCR) was employed to target the VP1/VP2 structural proteins. The results showed that B19V seropositivity represents 27.5% (33 out of 120) in BTM patients, and
... Show MoreIntroduction The abortions reasons in several circumstances yet are mysterious, nevertheless the bacterial toxicities signify a main reason in abortion, where germs seems to be the utmost elaborate pathogens (Khameneh et.al., 2014) and (Oliver and Overton ,2014). Between numerous germs, Humano
Community detection is an important and interesting topic for better understanding and analyzing complex network structures. Detecting hidden partitions in complex networks is proven to be an NP-hard problem that may not be accurately resolved using traditional methods. So it is solved using evolutionary computation methods and modeled in the literature as an optimization problem. In recent years, many researchers have directed their research efforts toward addressing the problem of community structure detection by developing different algorithms and making use of single-objective optimization methods. In this study, we have continued that research line by improving the Particle Swarm Optimization (PSO) algorithm using a
... Show More