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

This research aims at studying the relation between fair value and the Financial Reports Quality  to achieve a number of aims such as :-

1- Throw light on the problems of the measurement that depends on the historic cost as it paves the way towards the method of the fair value in the accounting measurement.

2-Give a general definition for  fair value in the accounting via analyzing the theoretical aspects that relates the subject and the  scientific bases on which the relating accounting treatment depend.

3- Exhibit the characteristics that could be added by the fair value  to the accounting Information .

       The study problem is summarized in that the e

Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is eff

Catalytic reforming of naphtha occupies an important issue in refineries for obtaining high octane gasoline and aromatic compounds, which are the basic materials of petrochemical industries. In this study, a novel of design parameters for industrial continuous catalytic reforming reactors of naphtha is proposed to increase the aromatics and hydrogen productions. Improving a rigorous mathematical model for industrial catalytic reactors of naphtha is studied here based on industrial data applying a new kinetic and deactivation model. The optimal design variables are obtained utilizing the optimization process in order to build the model with high accuracy and such design parameters are then applied to get the best configuration of this pro

The present article is devoted to the analysis of Arabic phraseological units with a component hand, selected by continuous sampling from the “Training Russian-Arabic phraseological dictionary: about 900 phraseological units” by G. L. Permyakov. Arabic phraseological units with a component hand are modeled as invariant situations (by logical-semiotic models) and figurative statements are expressed by phraseological variants (according to the figurative characteristic of the hand component). The artical focuses on the fact that somatism in Arabic phraseology has a symbolic and symbolic nature, marking various situations of Arabs' behavior, their actions, deeds, rituals, emotional and psychological states, etiquette, in

In this paper, some relations between the flows and the Enveloping Semi-group were studied. It allows to associate some properties on the topological compactification to any pointed flows. These relations enable us to study a number of the properties of the principles of flows corresponding with using algebric properties. Also in this paper proofs to some theorems of these relations are given.

Throughout this paper we study the properties of the composition operator
C
p1  o
p2  o…o
pn  induced by the composition of finite numbers of special
automorphisms of U,
pi  (z)  i
i
p z
1 p z


Such that pi  U, i  1, 2, …, n, and discuss the relation between the product of
finite numbers of automorphic composition operators on Hardy space H2 and some
classes of operators.