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

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

Anyonic interferometry without anyons: How a flux qubit can read out a topological qubit

Proposals to measure non-Abelian anyons in a superconductor by quantum interference of vortices suffer from the predominantly classical dynamics of the normal core of an Abrikosov vortex. We show how to avoid this obstruction using coreless Josephson vortices, for which the quantum dynamics has been demonstrated experimentally. The interferometer is a flux qubit in a Josephson junction circuit, which can nondestructively read out a topological qubit stored in a pair of anyons --- even though the Josephson vortices themselves are not anyons. The flux qubit does not couple to intra-vortex excitations, thereby removing the dominant restriction on the operating temperature of anyonic interferometry in superconductors.Comment: 7 pages, 3 figures; Added an Appendix on parity-protected single-qubit rotations; problem with Figure 3 correcte

A semismooth newton method for the nearest Euclidean distance matrix problem

The Nearest Euclidean distance matrix problem (NEDM) is a fundamentalcomputational problem in applications such asmultidimensional scaling and molecularconformation from nuclear magnetic resonance data in computational chemistry.Especially in the latter application, the problem is often large scale with the number ofatoms ranging from a few hundreds to a few thousands.In this paper, we introduce asemismooth Newton method that solves the dual problem of (NEDM). We prove that themethod is quadratically convergent.We then present an application of the Newton method to NEDM with $H$-weights.We demonstrate the superior performance of the Newton method over existing methodsincluding the latest quadratic semi-definite programming solver.This research also opens a new avenue towards efficient solution methods for the molecularembedding problem

Grazing activity increases decomposition of yak dung and litter in an alpine meadow on the Qinghai-Tibet plateau

Publishe

EFFECT OF EXHAUSTIVE UPHILL RUNNING ON KNEE JOINT MOTION DURING THE STANCE PHASE OF RUNNING

The purpose of this study was to imitate an exhaustive outdoor mountain road uphill running and investigate the effect on knee joint motion angles during the stance phase of running. Knee joint kinematical data collected from 8 male recreational runners running at 10 km/hr on a level treadmill prior to and following exhaustive uphill running revealed differences in flexion angles. These results demonstrated that exhaustive running can have an effect on knee joint running movement pattern. Due to these findings, the human natural movement control may be adjusted and the maintenance of preferred or optimal movement path costs more efforts which possibly play a role in many common lower extremity running injuries. This relevance may be applied to the future designing of assistive performance control shoes

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