Examining the Scope of Channel Expansion: A Test of Channel Expansion Theory with New and Traditional Communication Media

This article draws on channel expansion theory to explore the selection and use of communication media by organizational members. Channel expansion theory scholars posit that media richness perceptions are dependent on experiences with communication partners, the message topic, and the communication media utilized. This study tests channel expansion theory in the context of new and traditional communication media. Respondents (N = 269) completed questionnaires regarding their use and perceptions of face-to-face, telephone, e-mail, or instant-messaging interactions. Results indicate that experience with channel, topic, partner, and social influence are all significant predictors of richness perceptions, when controlling for age and media characteristics. Findings also suggest that the richness of a medium is not fixed and may be shaped by interpersonal factors, including one’s relevant experiences

Utilization of urea, ammonia, nitrite, and nitrate by crop plants in a Controlled Ecological Life Support System (CELSS)

The utilization of nitrogen compounds by crop plants is studied. The selection of crop varieties for efficient production using urea, ammonia, nitrite, and nitrate, and the assimilation of mixed nitrogen sources by cereal leaves and roots are discussed

A Family of Quantum Stabilizer Codes Based on the Weyl Commutation Relations over a Finite Field

Using the Weyl commutation relations over a finite field we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over the finite field satisfying certain natural conditions. When the field is GF(2) the existence of a rich class of such symmetric matrices is demonstrated by a simple probabilistic argument depending on the Chernoff bound for i.i.d symmetric Bernoulli trials. If, in addition, these symmetric matrices are assumed to be circulant it is possible to obtain concrete examples by a computer program. The quantum codes thus obtained admit elegant encoding circuits.Comment: 16 pages, 2 figure

Irreversibility in asymptotic manipulations of entanglement

We show that the process of entanglement distillation is irreversible by showing that the entanglement cost of a bound entangled state is finite. Such irreversibility remains even if extra pure entanglement is loaned to assist the distillation process.Comment: RevTex, 3 pages, no figures Result on indistillability of PPT states under pure entanglement catalytic LOCC adde

Local permutations of products of Bell states and entanglement distillation

We present new algorithms for mixed-state multi-copy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best known algorithms. Better algorithms can be derived that are tuned for specific initial states. The new algorithms are based on a characterization of the group of all locally realizable permutations of the 4^n possible tensor products of n Bell states.Comment: 6 pages, 1 figur

Increasing subsequences and the hard-to-soft edge transition in matrix ensembles

Our interest is in the cumulative probabilities Pr(L(t) \le l) for the maximum length of increasing subsequences in Poissonized ensembles of random permutations, random fixed point free involutions and reversed random fixed point free involutions. It is shown that these probabilities are equal to the hard edge gap probability for matrix ensembles with unitary, orthogonal and symplectic symmetry respectively. The gap probabilities can be written as a sum over correlations for certain determinantal point processes. From these expressions a proof can be given that the limiting form of Pr(L(t) \le l) in the three cases is equal to the soft edge gap probability for matrix ensembles with unitary, orthogonal and symplectic symmetry respectively, thereby reclaiming theorems due to Baik-Deift-Johansson and Baik-Rains.Comment: LaTeX, 19 page

Multi Purpose Crew Vehicle Environmental Control and Life Support Development Status

The Orion Multi Purpose Crew Vehicle (MPCV) is the first crew transport vehicle to be developed by the National Aeronautics and Space Administration (NASA) in the last thirty years. Orion is currently being developed to transport the crew safely beyond Earth orbit. This year, the vehicle focused on building the Exploration Flight Test 1 (EFT1) vehicle to be launched in 2014. The development of the Orion Environmental Control and Life Support (ECLS) System, focused on the completing the components which are on EFT1. Additional development work has been done to keep the remaining component progressing towards implementation for a flight tests in of EM1 in 2017 and in and EM2 in 2020. This paper covers the Orion ECLS development from April 2012 to April 2013

Orion Multi-Purpose Crew Vehicle Active Thermal Control and Environmental Control and Life Support Development Status

The Orion Multi Purpose Crew Vehicle (MPCV) is the first crew transport vehicle to be developed by the National Aeronautics and Space Administration (NASA) in the last thirty years. Orion is currently being developed to transport the crew safely beyond Earth orbit. This year, the vehicle focused on building the Exploration Flight Test 1 (EFT1) vehicle to be launched in September of 2014. The development of the Orion Active Thermal Control (ATCS) and Environmental Control and Life Support (ECLS) System, focused on the integrating the components into the EFT1 vehicle and preparing them for launch. Work also has started on preliminary design reviews for the manned vehicle. Additional development work is underway to keep the remaining component progressing towards implementation on the flight tests of EM1 in 2017 and of EM2 in 2020. This paper covers the Orion ECLS development from April 2013 to April 2014

Low-complexity quantum codes designed via codeword-stabilized framework

We consider design of the quantum stabilizer codes via a two-step, low-complexity approach based on the framework of codeword-stabilized (CWS) codes. In this framework, each quantum CWS code can be specified by a graph and a binary code. For codes that can be obtained from a given graph, we give several upper bounds on the distance of a generic (additive or non-additive) CWS code, and the lower Gilbert-Varshamov bound for the existence of additive CWS codes. We also consider additive cyclic CWS codes and show that these codes correspond to a previously unexplored class of single-generator cyclic stabilizer codes. We present several families of simple stabilizer codes with relatively good parameters.Comment: 12 pages, 3 figures, 1 tabl

Universal Fault-Tolerant Computation on Decoherence-Free Subspaces

A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs with the properties that (i) only one- and two-qubit interactions are required, and (ii) the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under "collective decoherence" (qubit-permutation-invariant system-bath coupling). Our results have immediate relevance to a number of solid-state quantum computer implementations, in particular those in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled GaAs quantum dot arrays and the Si:$^{31}$P nuclear spin arrays.Comment: 5 pages, no figures. Many small changes and clarifications. Expanded discussion of relevance to solid-state implementations. This version to appear in Phys. Rev. Let