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).

In this paper, we will show that the Modified SP iteration can be used to approximate fixed point of contraction mappings under certain condition. Also, we show that this iteration method is faster than Mann, Ishikawa, Noor, SP, CR, Karahan iteration methods. Furthermore, by using the same condition, we shown that the Picard S- iteration method converges faster than Modified SP iteration and hence also faster than all Mann, Ishikawa, Noor, SP, CR, Karahan iteration methods. Finally, a data dependence result is proven for fixed point of contraction mappings with the help of the Modified SP iteration process.

This paper presents a new algorithm in an important research field which is the semantic word similarity estimation. A new feature-based algorithm is proposed for measuring the word semantic similarity for the Arabic language. It is a highly systematic language where its words exhibit elegant and rigorous logic. The score of sematic similarity between two Arabic words is calculated as a function of their common and total taxonomical features. An Arabic knowledge source is employed for extracting the taxonomical features as a set of all concepts that subsumed the concepts containing the compared words. The previously developed Arabic word benchmark datasets are used for optimizing and evaluating the proposed algorithm. In this paper,

     Binary relations or interactions among bio-entities, such as proteins, set up the essential part of any living biological system. Protein-protein interactions are usually structured in a graph data structure called "protein-protein interaction networks" (PPINs). Analysis of PPINs into complexes tries to lay out the significant knowledge needed to answer many unresolved questions, including how cells are organized and how proteins work. However, complex detection problems fall under the category of non-deterministic polynomial-time hard (NP-Hard) problems due to their computational complexity. To accommodate such combinatorial explosions, evolutionary algorithms (EAs) are proven effective alternatives to heuristics in solvin

Increasing interest in planning at the level of government units as a means to manage the physical and human resources, direct and invest in areas that would include an increase in the economies of the general government units that are part of the general economics of the state.The research problem lies in the introduction of the factors influencing the ongoing expenses that adversely affect the financial planning process at the level of the Ministry of Health Planning, which affects the quality of services provided to citizens, so I sought the researchers to study the reality of financial planning in some of the Ministry of Health and health departments through the analysis of current budgets and diagnose deviations in the implementatio

The main aims of this research is to find the stabilizer groups of a cubic curves over a finite field of order , studying the properties of their groups and then constructing the arcs of degree  which are embedding in a cubic curves of even size which are considering as the arcs of degree . Also drawing all these arcs.