The demand for single photon sources in quantum key distribution (QKD) systems has necessitated the use of weak coherent pulses (WCPs) characterized by a Poissonian distribution. Ensuring security against eavesdropping attacks requires keeping the mean photon number (µ) small and known to legitimate partners. However, accurately determining µ poses challenges due to discrepancies between theoretical calculations and practical implementation. This paper introduces two experiments. The first experiment involves theoretical calculations of µ using several filters to generate the WCPs. The second experiment utilizes a variable attenuator to generate the WCPs, and the value of µ was estimated from the photons detected by the BB

Modern machine-learning applications require GPUs, and modern platforms can leverage numerous GPUs on one or more machines to increase performance. Contemporary deep-learning models are too huge for CPU or GPU training. Training these models with many GPUs without performance degradation is necessary to train them rapidly and maximize GPU consumption. Thus, training deep convolutional neural networks (DCNN) with multiple GPUs has become necessary for improving training. Therefore, we presented a parallel design and development of an efficient model for enhancing face mask CNN performance and improving resource efficiency. This DCNN model is a parallel training system over multiple GPUs, a multi-core CPU, and a multi-process GPU platform wit

The work includes synthesis and characterization of some new heterocyclic compounds, as flow: The compound (3) (5-(4-chlorophenyl) -2-hydrazinyl-1,3,4-oxadiazole was synthesized by using two methods; the first method includes the direct reaction between hydrazine hydrate 80% and 5-(4-chlorophenyl)-2- (ethylthio) 1,3,4-oxadiazole (1), the second method involves converting 5-(4-chlorophenyl)-1,3,4-oxadiazol-2-amine (2) to diazonium salt then reducing this salt to compound (3) by stannous chloride. Compound (3) was used as starting material for synthesizing several fused heterocyclic compounds. The compound 6-(4- chlorophenyl)[1,2.4] triazolo [3,4,b][1,3,4] oxadiazole-3-(2H) thione (compound 4) was synthesized from the reaction of compo

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

The work includes synthesis and characterization of some new heterocyclic compounds, as flow: The compound (3) (5-(4-chlorophenyl) -2-hydrazinyl-1,3,4-oxadiazole was synthesized by using two methods; the first method includes the direct reaction between hydrazine hydrate 80% and 5-(4-chlorophenyl)-2- (ethylthio) 1,3,4-oxadiazole (1), the second method involves converting 5-(4-chlorophenyl)-1,3,4-oxadiazol-2-amine (2) to diazonium salt then reducing this salt to compound (3) by stannous chloride. Compound (3) was used as starting material for synthesizing several fused heterocyclic compounds. The compound 6-(4-chlorophenyl)[1,2.4] triazolo [3,4,b][1,3,4] oxadiazole-3-(2H) thione (compound 4) was synthesized from the reaction of compound (3)

          The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key