Computer Program for Assessing the Economic Feasibility of Solar Energy for Single Family Residences and Light Commercial Applications

Computer program, SHCOST, was used to perform economic analyses of operational test sites. The program allows consideration of the economic parameters which are important to the solar system user. A life cycle cost and cash flow comparison is made between a solar heating system and a conventional system. The program assists in sizing the solar heating system. A sensitivity study and plot capability allow the user to select the most cost effective system configuration

Mutations of penicillin acylase residue B71 extend substrate specificity by decreasing steric constraints for substrate binding

Two mutant forms of penicillin acylase from Escherichia coli strains, selected using directed evolution for the ability to use glutaryl-L-leucine for growth [Forney, Wong and Ferber (1989) Appl. Environ. Microbiol. 55, 2550-2555], are changed within one codon, replacing the B-chain residue Phe(B71) with either Cys or Leu. Increases of up to a factor of ten in k(cat)/K-m values for substrates possessing a phenylacetyl leaving group are consistent with a decrease in K-s. Values of k(cat/)K(m) for glutaryl-L-leucine are increased at least 100-fold. A decrease in k(cat)/K-m for the CySB71 mutant with increased pH is consistent with binding of the uncharged glutaryl group. The mutant proteins are more resistant to urea denaturation monitored by protein fluorescence, to inactivation in the presence of substrate either in the presence of urea or at high pH, and to heat inactivation. The crystal structure of the Leu(B71) mutant protein, solved to 2 X resolution, shows a flip of the side chain of Phe(B256) into the periphery of the catalytic centre, associated with loss of the pi-stacking interactions between Phe(B256) and Phe(B71). Molecular modelling demonstrates that glutaryl-L-leucine may bind with the uncharged glutaryl group in the S-1 subsite of either the wild-type or the Leu(B71) mutant but with greater potential freedom of rotation of the substrate leucine moiety in the complex with the mutant protein. This implies a smaller decrease in the conformational entropy of the substrate on binding to the mutant proteins and consequently greater catalytic activity

Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a "pearl-necklace encoder." Despite their theoretical significance as a neat way of representing quantum convolutional codes, they are not well-suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation and practical implementation. In our previous work, we presented an efficient algorithm for finding a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work extends our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the non-commutative paths through the pearl-necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.Comment: 16 pages, 5 figures; extends paper arXiv:1004.5179v

Application of Ecological Network Theory to the Human Microbiome

In healthy humans, many microbial consortia constitute rich ecosystems with dozens to hundreds of species, finely tuned to functions relevant to human health. Medical interventions, lifestyle changes, and the normal rhythms of life sometimes upset the balance in microbial ecosystems, facilitating pathogen invasions or causing other clinically relevant problems. Some diseases, such as bacterial vaginosis, have exactly this sort of community etiology. Mathematical network theory is ideal for studying the ecological networks of interacting species that comprise the human microbiome. Theoretical networks require little consortia specific data to provide insight into both normal and disturbed microbial community functions, but it is easy to incorporate additional empirical data as it becomes available. We argue that understanding some diseases, such as bacterial vaginosis, requires a shift of focus from individual bacteria to (mathematical) networks of interacting populations, and that known emergent properties of these networks will provide insights that would be otherwise elusive

Good Quantum Convolutional Error Correction Codes And Their Decoding Algorithm Exist

Quantum convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of quantum convolutional code, I report a way to decode certain quantum convolutional codes based on the classical Viterbi decoding algorithm. This decoding algorithm is optimal for a memoryless channel. I also report three simple criteria to test if decoding errors in a quantum convolutional code will terminate after a finite number of decoding steps whenever the Hilbert space dimension of each quantum register is a prime power. Finally, I show that certain quantum convolutional codes are in fact stabilizer codes. And hence, these quantum stabilizer convolutional codes have fault-tolerant implementations.Comment: Minor changes, to appear in PR

Mixed quantum state detection with inconclusive results

We consider the problem of designing an optimal quantum detector with a fixed rate of inconclusive results that maximizes the probability of correct detection, when distinguishing between a collection of mixed quantum states. We develop a sufficient condition for the scaled inverse measurement to maximize the probability of correct detection for the case in which the rate of inconclusive results exceeds a certain threshold. Using this condition we derive the optimal measurement for linearly independent pure-state sets, and for mixed-state sets with a broad class of symmetries. Specifically, we consider geometrically uniform (GU) state sets and compound geometrically uniform (CGU) state sets with generators that satisfy a certain constraint. We then show that the optimal measurements corresponding to GU and CGU state sets with arbitrary generators are also GU and CGU respectively, with generators that can be computed very efficiently in polynomial time within any desired accuracy by solving a semidefinite programming problem.Comment: Submitted to Phys. Rev.

Multi-Exciton Spectroscopy of a Single Self Assembled Quantum Dot

We apply low temperature confocal optical microscopy to spatially resolve, and spectroscopically study a single self assembled quantum dot. By comparing the emission spectra obtained at various excitation levels to a theoretical many body model, we show that: Single exciton radiative recombination is very weak. Sharp spectral lines are due to optical transitions between confined multiexcitonic states among which excitons thermalize within their lifetime. Once these few states are fully occupied, broad bands appear due to transitions between states which contain continuum electrons.Comment: 12 pages, 4 figures, submitted for publication on Jan,28 199

Quantifying the Performance of Quantum Codes

We study the properties of error correcting codes for noise models in the presence of asymmetries and/or correlations by means of the entanglement fidelity and the code entropy. First, we consider a dephasing Markovian memory channel and characterize the performance of both a repetition code and an error avoiding code in terms of the entanglement fidelity. We also consider the concatenation of such codes and show that it is especially advantageous in the regime of partial correlations. Finally, we characterize the effectiveness of the codes and their concatenation by means of the code entropy and find, in particular, that the effort required for recovering such codes decreases when the error probability decreases and the memory parameter increases. Second, we consider both symmetric and asymmetric depolarizing noisy quantum memory channels and perform quantum error correction via the five qubit stabilizer code. We characterize this code by means of the entanglement fidelity and the code entropy as function of the asymmetric error probabilities and the degree of memory. Specifically, we uncover that while the asymmetry in the depolarizing errors does not affect the entanglement fidelity of the five qubit code, it becomes a relevant feature when the code entropy is used as a performance quantifier.Comment: 21 pages, 10 figure

Changes in liver and spleen volumes after living liver donation: A report from the adult‐to‐adult living donor liver transplantation cohort study (A2ALL)

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/110585/1/lt24062.pd

Common structure in the heterogeneity of plant-matter decay

Carbon removed from the atmosphere by photosynthesis is released back by respiration. Although some organic carbon is degraded quickly, older carbon persists; consequently carbon stocks are much larger than predicted by initial decomposition rates. This disparity can be traced to a wide range of first-order decay-rate constants, but the rate distributions and the mechanisms that determine them are unknown. Here, we pose and solve an inverse problem to find the rate distributions corresponding to the decomposition of plant matter throughout North America. We find that rate distributions are lognormal, with a mean and variance that depend on climatic conditions and substrate. Changes in temperature and precipitation scale all rates similarly, whereas the initial substrate composition sets the time scale of faster rates. These findings probably result from the interplay of stochastic processes and biochemical kinetics, suggesting that the intrinsic variability of decomposers, substrate and environment results in a predictable distribution of rates. Within this framework, turnover times increase exponentially with the kinetic heterogeneity of rates, thereby providing a theoretical expression for the persistence of recalcitrant organic carbon in the natural environment