We present a tabu search heuristic for a network design problem which consists in determining at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a “ring”) does not exceed a given length K. Numerical results are provided for randomly generated graphs and graphs coming from real-world applications.

we study the notion of bounded approximate connes-amenability for‎ ‎dual banach algebras and characterize this type of algebras in terms‎ ‎of approximate diagonals‎. ‎we show that bounded approximate‎ ‎connes-amenability of dual banach algebras forces them to be unital‎. ‎for a separable dual banach algebra‎, ‎we prove that bounded‎ ‎approximate connes-amenability implies sequential approximate...

Each giant planet is encircled by planetary rings, usually composed of particles centimeters to meters in radius, but each system also contains regions where much smaller dust grains predominate. This chapter summarizes the techniques used to determine the properties of circumplanetary material, and then gives a precis of the known characteristics of circumplanetary rings (with emphasis on tenu...

Spin carriers propagating along quantum circuits gather spin phases depending on the circuit's size, shape, and spin-orbit coupling (SOC) strength. These typically grow monotonically with SOC strength, as found in Rashba wires rings. In this work we show that spin-phase gathering can be engineered by geometric means, viz., curvature of circuits, to nonmonotonic. We demonstrate peculiar property...

We study the problem of designing at minimum cost a two-connected network such that each edge belongs to a cycle using at most K edges. This problem is a particular case of the two-connected networks with bounded meshes problem studied by Fortz, Labb e and Maaoli 6]. Structural results for this particular case are presented : we compute a lower bound on the number of edges in a feasible solutio...

We consider the network design problem which consists in determining at minimum cost a 2-edge connected network such that the shortest cycle (a “ring”) to which each edge belongs, does not exceed a given length K. We identify a class of valid inequalities, called cycle inequalities, valid for the problem and show that this inequalities together with the so-called cut inequalities yield an integ...

in this paper, we introduce the new notion of strongly j-clean rings associatedwith polynomial identity g(x) = 0, as a generalization of strongly j-clean rings. we denotestrongly j-clean rings associated with polynomial identity g(x) = 0 by strongly g(x)-j-cleanrings. next, we investigate some properties of strongly g(x)-j-clean.

It is shown that a probabilistic Turing acceptor or transducer running within space bound S can be simulated by a time S 2 parallel machine and therefore by a space S 2 deterministic machine. (Previous simulations ran in space $6.) In order to achieve these simulations, known algorithms are extended for the computation of determinants in small arithmetic parallel time to computations having sma...

Let i : A → R be a ring morphism, and χ : R → A a right R-linear map with χ(χ(r)s) = χ(rs) and χ(1 R) = 1 A. If R is a Frobenius A-ring, then we can define a trace map tr : A → A R. If there exists an element of trace 1 in A, then A is right FBN if and only if A R is right FBN and A is right noetherian. The result can be generalized to the case where R is an I-Frobenius A-ring. We recover resul...

for some real number X, the symbol V denoting the lattice least upper bound. Any ring R is regular [10] if for each xER there is an xaER such that xx°x = x. It is evident that every regular F-ring R contains a maximal bounded sub-F-ring R, the F-ring of all xER satisfying equation (1.1). The relationship between a regular F-ring and its maximal bounded sub-F-ring is analogous to that between th...