It is recognized that organisms live and interact in groups, exposing them to various elements like disease, fear, hunting cooperation, and others. As a result, in this paper, we adopted the construction of a mathematical model that describes the interaction of the prey with the predator when there is an infectious disease, as well as the predator community's characteristic of cooperation in hunting, which generates great fear in the prey community. Furthermore, the presence of an incubation period for the disease provides a delay in disease transmission from diseased predators to healthy predators. This research aims to examine the proposed mathematical model's solution behavior to better understand these elements' impact on an eco-epidemi
... Show MoreThe paper is devoted to solve nth order linear delay integro-differential equations of convolution type (DIDE's-CT) using collocation method with the aid of B-spline functions. A new algorithm with the aid of Matlab language is derived to treat numerically three types (retarded, neutral and mixed) of nth order linear DIDE's-CT using B-spline functions and Weddle rule for calculating the required integrals for these equations. Comparison between approximated and exact results has been given in test examples with suitable graphing for every example for solving three types of linear DIDE's-CT of different orders for conciliated the accuracy of the results of the proposed method.
The main objective of this research is to use the methods of calculus ???????? solving integral equations Altbataah When McCann slowdown is a function of time as the integral equation used in this research is a kind of Volterra
This work describes two efficient and useful methods for solving fractional pantograph delay equations (FPDEs) with initial and boundary conditions. These two methods depend mainly on orthogonal polynomials, which are the method of the operational matrix of fractional derivative that depends on Bernstein polynomials and the operational matrix of the fractional derivative with Shifted Legendre polynomials. The basic procedure of this method is to convert the pantograph delay equation to a system of linear equations and by using, the operational matrices we get rid of the integration and differentiation operations, which makes solving the problem easier. The concept of Caputo has been used to describe fractional derivatives. Finally, some
... Show MorePurpose: The aim of this study was to gain insight into causes of time delays and cost overruns in a selection of thirty case projects in Iraq. Delay factors have been studied in many countries/contexts, but not much data exists from countries under the conditions characterizing Iraq during the last 10-15 years.Design/methodology/approach: A case study approach was adopted, with thirty construction projects selected from the Baghdad region, of different types and sizes. For the case of the study, the participants in the projects provided data about the projects through the data collection tool distributed through the questionnaire directed to them. Statistical data analysis was used to build statistical relationships between time and cost d
... Show MoreThis paper presents a minimum delay congestion control in differentiated Service communication networks. The premium and ordinary passage services based fluid flow theory is used to build the suggested structure in high efficient manage. The established system is capable to adeptly manage both the physical network resource limitations and indefinite time delay related to networking system structure.
In this paper, some necessary and sufficient conditions are obtained to ensure the oscillatory of all solutions of the first order impulsive neutral differential equations. Also, some results in the references have been improved and generalized. New lemmas are established to demonstrate the oscillation property. Special impulsive conditions associated with neutral differential equation are submitted. Some examples are given to illustrate the obtained results.
In this paper, the method of estimating the variation of Zenith Path Delay (ZPD) estimation method will be illustrate and evaluate using Real Time Kinematic Differential Global Positioning System (RTK-DGPS). The GPS provides a relative method to remotely sense atmospheric water vapor in any weather condition. The GPS signal delay in the atmosphere can be expressed as ZPD. In order to evaluate the results, four points had been chosen in the university of Baghdad campus to be rover ones, with a fixed Base point. For each rover position a 155 day of coordinates measurements was collected to overcome the results. Many models and mathematic calculations were used to extract the ZPD using the Matlab environment. The result shows that the ZPD valu
... Show MoreThis essay aims to highlight the most important issues and difficulties facing implementing large projects that follow the turn-key method, considered one of the types of contractual methods in Iraq, especially for large and complex projects requiring speedy completion. The projects implemented in this way face delays and delays in completion, which led to the lack of benefit from the projects for which they were implemented, especially those affecting the lives of citizens within the health sector. The case study dealt with the construction of hospitals with multi-bed capacities within multiple governorates in Iraq, With large financial allocations within the federal budget of the Government of Iraq over several years.
... Show MoreTraditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).