Infinite Hopf family of elliptic algebras and bosonization

Elliptic current algebras E_{q,p}(\hat{g}) for arbitrary simply laced finite dimensional Lie algebra g are defined and their co-algebraic structures are studied. It is shown that under the Drinfeld like comultiplications, the algebra E_{q,p}(\hat{g}) is not co-closed for any g. However putting the algebras E_{q,p}(\hat{g}) with different deformation parameters together, we can establish a structure of infinite Hopf family of algebras. The level 1 bosonic realization for the algebra E_{q,p}(\hat{g}) is also established.Comment: LaTeX, 11 pages. This is the new and final versio

Eigenvalues of Ruijsenaars-Schneider models associated with An−1A_{n-1} root system in Bethe ansatz formalism

Ruijsenaars-Schneider models associated with $A_{n-1}$ root system with a discrete coupling constant are studied. The eigenvalues of the Hamiltonian are givein in terms of the Bethe ansatz formulas. Taking the "non-relativistic" limit, we obtain the spectrum of the corresponding Calogero-Moser systems in the third formulas of Felder et al [20].Comment: Latex file, 25 page

Topology design and performance analysis of an integrated communication network

A research study on the topology design and performance analysis for the Space Station Information System (SSIS) network is conducted. It is begun with a survey of existing research efforts in network topology design. Then a new approach for topology design is presented. It uses an efficient algorithm to generate candidate network designs (consisting of subsets of the set of all network components) in increasing order of their total costs, and checks each design to see if it forms an acceptable network. This technique gives the true cost-optimal network, and is particularly useful when the network has many constraints and not too many components. The algorithm for generating subsets is described in detail, and various aspects of the overall design procedure are discussed. Two more efficient versions of this algorithm (applicable in specific situations) are also given. Next, two important aspects of network performance analysis: network reliability and message delays are discussed. A new model is introduced to study the reliability of a network with dependent failures. For message delays, a collection of formulas from existing research results is given to compute or estimate the delays of messages in a communication network without making the independence assumption. The design algorithm coded in PASCAL is included as an appendix

Suppressing decoherence and improving entanglement by quantum-jump-based feedback control in two-level systems

We study the quantum-jump-based feedback control on the entanglement shared between two qubits with one of them subject to decoherence, while the other qubit is under the control. This situation is very relevant to a quantum system consisting of nuclear and electron spins in solid states. The possibility to prolong the coherence time of the dissipative qubit is also explored. Numerical simulations show that the quantum-jump-based feedback control can improve the entanglement between the qubits and prolong the coherence time for the qubit subject directly to decoherence

A search for the fourth SM family quarks at Tevatron

It is shown that the fourth standard model (SM) family quarks can be observed at the Fermilab Tevatron if their anomalous interactions with known quarks have sufficient strength.Comment: 7 pages, 2 tables, 4 figure

Entanglement detection beyond the CCNR criterion for infinite-dimensions

In this paper, in terms of the relation between the state and the reduced states of it, we obtain two inequalities which are valid for all separable states in infinite-dimensional bipartite quantum systems. One of them provides an entanglement criterion which is strictly stronger than the computable cross-norm or realignment (CCNR) criterion.Comment: 11 page