In this research work, a simulator with time-domain visualizers and configurable parameters using a continuous time simulation approach with Matlab R2019a is presented for modeling and investigating the performance of optical fiber and free-space quantum channels as a part of a generic quantum key distribution system simulator. The modeled optical fiber quantum channel is characterized with a maximum allowable distance of 150 km with 0.2 dB/km at =1550nm. While, at =900nm and =830nm the attenuation values are 2 dB/km and 3 dB/km respectively. The modeled free space quantum channel is characterized at 0.1 dB/km at =860 nm with maximum allowable distance of 150 km also. The simulator was investigated in terms of the execution of the BB84 prot

Gypsum is one of the important construction materials in Iraq in plastering surfaces and gypsum board , the ability of gypsum to give a comfortable an aesthetic ambiance as a construction material increase the need of gypsum , The particle size , total surface area and particle size distribution were factors affecting plaster properties used for construction properties . In this study gypsum paste was used with different mixing ratios of particle size and studied the physical properties of these types of pastes named (standard consistency ,setting time ,density) and compressive strength . The results showed that the water to gypsum ratio increased with increasing the fineness of the gypsum to (0.75%) and the setting time to the maxi

In the current study, the researchers have been obtained Bayes estimators for the shape and scale parameters of Gamma distribution under the precautionary loss function, assuming the priors, represented by Gamma and Exponential priors for the shape and scale parameters respectively. Moment, Maximum likelihood estimators and Lindley’s approximation have been used effectively in Bayesian estimation.

Based on Monte Carlo simulation method, those estimators are compared depending on the mean squared errors (MSE’s). The results show that, the performance of Bayes estimator under precautionary loss function with Gamma and Exponential priors is better than other estimates in all cases.

At present, the ability to promote national economy by adjusting to political, economic, and technological variables is one of the largest challenges faced by organization productivity. This challenge prompts changes in structure and line productivity, given that cash has not been invested. Thus, the management searches for investment opportunities that have achieved the optimum value of the annual increases in total output value of the production line workers in the laboratory. Therefore, the application of dynamic programming model is adopted in this study by addressing the division of investment expenditures to cope with market-dumping policy and to strive non-stop production at work.

To ensure fault tolerance and distributed management, distributed protocols are employed as one of the major architectural concepts underlying the Internet. However, inefficiency, instability and fragility could be potentially overcome with the help of the novel networking architecture called software-defined networking (SDN). The main property of this architecture is the separation of the control and data planes. To reduce congestion and thus improve latency and throughput, there must be homogeneous distribution of the traffic load over the different network paths. This paper presents a smart flow steering agent (SFSA) for data flow routing based on current network conditions. To enhance throughput and minimize latency, the SFSA distrib

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