The theory of probabilistic programming  may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, pro­duction and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient b_i is random variable

This paper discusses using H2 and H∞ robust control approaches for designing control systems. These approaches are applied to elementary control system designs, and their respective implementation and pros and cons are introduced. The H∞ control synthesis mainly enforces closed-loop stability, covering some physical constraints and limitations. While noise rejection and disturbance attenuation are more naturally expressed in performance optimization, which can represent the H₂ control synthesis problem. The paper also applies these two methodologies to multi-plant systems to study the stability and performance of the designed controllers. Simulation results show that the H2 controller tracks a desirable cl

In this work, we apply the notion of a filter of a KU-Algebra and investigate several properties. The paper defined some filters such as strong filter, n-fold filter and P-filter and discussed a few theorems and examples.

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

The aim of this study was to Identifying The Effect of using Linear programming and Branching programming by computer in Learning and Retention of movement concatenation(Linkwork) in parallel bars in Artistic Gymnastics. The searchers have used the experimental method. The search subject of this article has been taken (30) male - students in the second class from the College of Physical Education/University of Baghdad divided into three groups; the first group applied linear programming by computer, and the second group has been applicated branching programming by computer, while precision group used traditional method in the college. The researchers concluded the results by using the statistical bag for social sciences (spss) such as both