الأثر V بالنسبة إلى   sinshT و خواصه قد تم دراسته في هذا البحث حيث تم دراسة علاقة الأثر المخلص والاثر المنتهى التولد والاثر المنفصل وربطها بالمؤثرات المتباينة حيث تم بهنة العلاقات التالية ان الاثر اذا وفقط اذا مقاس في حالة كون المؤثر هو عديم القوة وكذلك في حالة كون المؤثر شامل فان الاثر هو منتهي التولد اي ان الغضاء هو منتهي التولد وايضا تم برهن ان الاثر مخلص لكل مؤثر مقيد وك\لك قد تم التحقق من انه لاي مؤثر مقي

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise Lindelöf and locally Lindelöf topological spaces, which are generalizations of will-known concepts: Lindelöf topological space (1) "A topological space X is called a Lindelöf space if for every open cover of X has a countable subcover" and locally Lindelöf topological space (1) "A topological space X is called a locally Lindelöf space if for every point x in X, there exist a nbd U of x such that the closure of U in X is Lindelöf space". Either the new concepts are: "A fibrewise topological space X over B is called a fibrewise Lindelöf if the projection function p : X→B is Lindelöf" and "The fibrewise topological space X over B

This study delves into the properties of the associated act V over the monoid S of sinshT. It examines the relationship between faithful, finitely generated, and separated acts, as well as their connections to one-to-one and onto operators. Additionally, the correlation between acts over a monoid and modules over a ring is explored. Specifically, it is established that  functions as an act over S if and only if  functions as module, where T represents a nilpotent operator. Furthermore, it is proved that when T is onto operator and  is finitely generated, is guaranteed to be finite-dimensional. Prove that for any bounded operator the following,  is acting over S if and only if  is a module where T is a nilpotent operator, is a

Quantum channels enable the achievement of communication tasks inaccessible to their
classical counterparts. The most famous example is the distribution of secret keys. Unfortunately, the rate
of generation of the secret key by direct transmission is fundamentally limited by the distance. This limit
can be overcome by the implementation of a quantum repeater. In order to boost the performance of the
repeater, a quantum repeater based on cut-off with two different types of quantum memories is suggestd,
which reduces the effect of decoherence during the storage of a quantum state.

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith