Traditionally, 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).
Abstract\
In this research we built a mathematical model of the transportation problem for data of General Company for Grain Under the environment of variable demand ,and situations of incapableness to determining the supply required quantities as a result of economic and commercial reasons, also restrict flow of grain amounts was specified to a known level by the decision makers to ensure that the stock of reserves for emergency situations that face the company from decrease, or non-arrival of the amount of grain to silos , also it took the capabilities of the tanker into consideration and the grain have been restricted to avoid shortages and lack of processing capability, Function has been adopted
... Show MoreAfter 2003, Iraq witnessed new challenges represented by the predominance of sectarian discourses, hatred and extremism at the expense of moderate political discourse and the predominance of sub-affiliations and external agendas at the expense of national affiliation, which led to the creation of an unsafe or stable environment dominated by the character of violence and terrorism. Moderate discourse would work to fuse sub-affiliations into one melting pot in which it would be the first loyalty to the homeland and not to the tribe, party or sect... Etc., and this in turn will contribute to promoting peaceful coexistence between the various other sub-affiliations within the framework of one community construction
The γ- mixing ratios of γ- transitions from levels of 56Fe populated in reaction are calculated using least square fitting program for the first time in the case of pure and mixed transitions the results obtained have been compound with γ Values determined by other methods .The comparison shows that the agreement is good this confirmed the valilety of this method in calculating of values for such γ- transitions key word: γ- transition ,Multipole mixing ratios ,Least square fitting method.
In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.
An efficient modification and a novel technique combining the homotopy concept with Adomian decomposition method (ADM) to obtain an accurate analytical solution for Riccati matrix delay differential equation (RMDDE) is introduced in this paper . Both methods are very efficient and effective. The whole integral part of ADM is used instead of the integral part of homotopy technique. The major feature in current technique gives us a large convergence region of iterative approximate solutions .The results acquired by this technique give better approximations for a larger region as well as previously. Finally, the results conducted via suggesting an efficient and easy technique, and may be addressed to other non-linear problems.
This study examines traveling wave solutions of the SIS epidemic model with nonlocal dispersion and delay. The research shows that a key factor in determining whether traveling waves exist is the basic reproduction number R0. In particular, the system permits nontrivial traveling wave solutions for σ≥σ∗ for R0>1, whereas there are no such solutions for σ<σ∗. This is because there is a minimal wave speed σ∗>0. On the other hand, there are no traveling wave solutions when R0≤1. In conclusion, we provide several numerical simulations that illustrate the existence of TWS.
Most of the medical datasets suffer from missing data, due to the expense of some tests or human faults while recording these tests. This issue affects the performance of the machine learning models because the values of some features will be missing. Therefore, there is a need for a specific type of methods for imputing these missing data. In this research, the salp swarm algorithm (SSA) is used for generating and imputing the missing values in the pain in my ass (also known Pima) Indian diabetes disease (PIDD) dataset, the proposed algorithm is called (ISSA). The obtained results showed that the classification performance of three different classifiers which are support vector machine (SVM), K-nearest neighbour (KNN), and Naïve B
... Show MoreChoosing antimicrobials is a common dilemma when the expected rate of bacterial resistance is high. The observed resistance values in unequal groups of isolates tested for different antimicrobials can be misleading. This can affect the decision to recommend one antibiotic over the other. We analyzed recalled data with the statistical consideration of unequal sample groups. Data was collected concerning children suspected to have typhoid fever at Al Alwyia Pediatric Teaching Hospital in Baghdad, Iraq. The study period extended from September 2021 to September 2022. A novel algorithm was developed to compare the drug sensitivity among unequal numbers of Salmonella typhi (S. Typhi) isolates tested with different antibacterials.
... Show MoreA new modified differential evolution algorithm DE-BEA, is proposed to improve the reliability of the standard DE/current-to-rand/1/bin by implementing a new mutation scheme inspired by the bacterial evolutionary algorithm (BEA). The crossover and the selection schemes of the DE method are also modified to fit the new DE-BEA mechanism. The new scheme diversifies the population by applying to all the individuals a segment based scheme that generates multiple copies (clones) from each individual one-by-one and applies the BEA segment-wise mechanism. These new steps are embedded in the DE/current-to-rand/bin scheme. The performance of the new algorithm has been compared with several DE variants over eighteen benchmark functions including sever
... Show More