Lattice quantum codes and exotic topological phases of matter

<p>This thesis addresses whether it is possible to build a robust memory device for quantum information. Many schemes for fault-tolerant quantum information processing have been developed so far, one of which, called topological quantum computation, makes use of degrees of freedom that are inherently insensitive to local errors. However, this scheme is not so reliable against thermal errors. Other fault-tolerant schemes achieve better reliability through active error correction, but incur a substantial overhead cost. Thus, it is of practical importance and theoretical interest to design and assess fault-tolerant schemes that work well at finite temperature without active error correction.p> <p>In this thesis, a three-dimensional gapped lattice spin model is found which demonstrates for the first time that a reliable quantum memory at finite temperature is possible, at least to some extent. When quantum information is encoded into a highly entangled ground state of this model and subjected to thermal errors, the errors remain easily correctable for a long time without any active intervention, because a macroscopic energy barrier keeps the errors well localized. As a result, stored quantum information can be retrieved faithfully for a memory time which grows exponentially with the square of the inverse temperature. In contrast, for previously known types of topological quantum storage in three or fewer spatial dimensions the memory time scales exponentially with the inverse temperature, rather than its square.p> <p>This spin model exhibits a previously unexpected topological quantum order, in which ground states are locally indistinguishable, pointlike excitations are immobile, and the immobility is not affected by small perturbations of the Hamiltonian. The degeneracy of the ground state, though also insensitive to perturbations, is a complicated number-theoretic function of the system size, and the system bifurcates into multiple noninteracting copies of itself under real-space renormalization group transformations. The degeneracy, the excitations, and the renormalization group flow can be analyzed using a framework that exploits the spin model's symmetry and some associated free resolutions of modules over polynomial algebras.p>

Nuclear Hartree-Fock calculations on parallel computers

<p>Hartree-Fock (HF) calculations have had remarkable success in describing large nuclei at high spin, temperature and deformation. To allow full range of possible deformations, the Skyrme HF equations can be discretized on a three-dimensional mesh. However, such calculations are currently limited by the computational resources provided by traditional supercomputers. To take advantage of recent developments in massively parallel computing technology, we have implemented the LLNL Skyrme-force static and rotational HF codes on Intel's DELTA and GAMMA systems at Caltech.p> <p>We decomposed the HF code by assigning a portion of the mesh to each node, with nearest neighbor meshes assigned to nodes connected by communication· channels. This kind of decomposition is well-suited for the DELTA and the GAMMA architecture because the only non-local operations are wave function orthogonalization and the boundary conditions of the Poisson equation for the Coulomb field.p> <p>Our first application of the HF code on parallel computers has been the study of identical superdeformed (SD) rotational bands in the Hg region. In the last ten years, many SD rotational bands have been found experimentally. One very surprising feature found in these SD rotational bands is that many pairs of bands in nuclei that differ by one or two mass units have nearly identical deexcitation gamma-ray energies. Our calculations of the five rotational bands in ^(192)Hg and ^(194)Pb show that the filling of specific orbitals can lead to bands with deexcitation gamma-ray energies differing by at most 2 keV in nuclei differing by two mass units and over a range of angular momenta comparable to that observed experimentally. Our calculations of SD rotational bands in the Dy region also show that twinning can be achieved by filling or emptying some specific orbitals.p> <p>The interpretation of future precise experiments on atomic parity nonconservation (PNC) in terms of parameters of the Standard Model could be hampered by uncertainties in the atomic and nuclear structure. As a further application of the massively parallel HF calculations, we calculated the proton and neutron densities of the Cesium isotopes from A = 125 to A = 139. Based on our good agreement with experimental charge radii, binding energies, and ground state spins, we conclude that the uncertainties in the ratios of weak charges are less than 10^(-3), comfortably smaller than the anticipated experimental error.p>

The electrocatalytic and stoichiometric oxidation chemistry of binuclear ruthenium complexes incorporating the anionic tripod ligand {(η5-C5H5)Co[P(OCH3)2(=O)]3}-

The anionic tripod ligand NaLoMe (L_(oMe) - = [(η^5-C_5H_5)Co{P(O)(OCH_3)_2}_3]^-) reacts with RuO_4 in a biphasic reaction mixture of 1% H_2SO_4 and CCI_4 to afford [(L_(oMe) (HO)Ru^(IV) (µ-O)_2Ru ^(IV)(OH)(L_(oMe)] (1), which is treated with aqueous CF_3S0_3H to generate [(L_(oMe)(H_2O)Ru^(IV) (µ-O)_2R^(IV) (OH_2)(L_(oMe)][CF_3SO_3]_2 ([H_21][CF_3SO_3]_2). Addition of iodosobenzene to an acetonitrile solution of this salt yields [(L_(oMe)(O)Ru^v(µ-0)2Ru^v-(O)(_(LoMe)] (2). The dimer 1 can be reduced chemically or electrochemically to the Ru^(III)- Ru^(III) dimers [(L_(oMe)(H_20)Ru^(III) (µ-OH)_2Ru^(III) (OH_2)(L_(oMe)) ]^2+ and [(L_(oMe)) ^(III) (µ-0Hh(µ-0H2)Ru^(III) (L_(oMe)]^2+ which interconvert in aqueous media. Two electron processes dominate both the bulk chemistry and the electrochemistry of 1. Among these processes are the quasi-reversible Ru^(IV) - Ru^(IV)/Ru^(III)- Ru^(III) and Ru^(III)- Ru^(III)/ Ru^(II)- Ru^(II) reductions and a largely irreversible Ru^(V) - Ru^(V)/ Ru^(IV) - Ru^(IV)/oxidation. The dioxo dimer 2 oxidizes alcohols and aldehydes in organic media to afford 1 and the corresponding aldehydes and acids. Analogously, the Ru^(V) - Ru^(V)/ Ru^(IV)- Ru^(IV) redox wave mediates the electrooxidation of alcohols and aldehydes in aqueous buffer. In this system, substrates can be oxidized completely to CO_2. The kinetic behavior of these oxidations was examined by UV-vis and chronoamperometry, respectively, and the chemistry is typical of metal-oxo complexes, indicating that electronic coupling between two metal centers does not dramatically affect the metal-oxo chemistry. Dimer [H_21]^(2+) also reacts with alcohols, aldehydes, and triphenylphosphine in CH_3CN to afford Ru^(III)- Ru^(III) products including [(L_(oMe))CH_3CN) Ru^(III) (µ-OH)_2 Ru^(III) (NCCH_3)( L_(oMe))][CF_3SO_3]2 (characterized by X-ray crystallography) and the corresponding organic products. Reaction of 1 with formaldehyde in aqueous buffer quantitatively affords the triply bridged dimer [(L_(oMe)Ru^(III) (µ-OH)2- (µ-HCOO) Ru^(III) (L_(oMe)][CF_3SO_3] (characterized by X-ray crystallography). This reaction evidently proceeds by two parallel inner-sphere pathways, one of which is autocatalytic. Neither pathway exhibits a primary isotope effect suggesting the rate determining process could be the formation of an intermediate, perhaps a Ru^(IV) - Ru^(IV) formate adduct. The Ru^(III)- Ru^(III)formate adduct is easily oxidized to the Ru^(IV) - Ru^(IV) analog [(L_(oMe)Ru^(IV)(µ-OH)_2-(µ-HCOO) Ru^(IV) (L_(oMe)][CF_3SO_3], which, after isolation, reacts slowly with aqueous formaldehyde to generate free formate and the Ru^(III)- Ru^(III) formate adduct. These dimers function as catalysts for the electrooxidation of formaldehyde at low anodic potentials (+0.0 V versus SCE in aqueous buffer, pH 8.5) and enhance the activity of Nafion treated palladium/carbon heterogeneous fuel cell catalysts.

Search for color transparency in A(e,e'p) at high momentum transfer

Rates for A(e, e'p) on the nuclei ^2H, C, Fe, and Au have been measured at momentum transfers Q^2 = 1, 3, 5, and 6.8 (GeV fc)^2 . We extract the nuclear transparency T, a measure of the importance of final state interactions (FSI) between the outgoing proton and the recoil nucleus. Some calculations based on perturbative QCD predict an increase in T with momentum transfer, a phenomenon known as Color Transparency. No statistically significant rise is seen in the present experiment.

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

<p>Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.p> <p>In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.p> <p>The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.p> <p>In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.p> <p>The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.p> <p>Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.p>

Quantum error correction with biased noise

<p>Quantum computing offers powerful new techniques for speeding up the calculation of many classically intractable problems. Quantum algorithms can allow for the efficient simulation of physical systems, with applications to basic research, chemical modeling, and drug discovery; other algorithms have important implications for cryptography and internet security.p> <p>At the same time, building a quantum computer is a daunting task, requiring the coherent manipulation of systems with many quantum degrees of freedom while preventing environmental noise from interacting too strongly with the system. Fortunately, we know that, under reasonable assumptions, we can use the techniques of quantum error correction and fault tolerance to achieve an arbitrary reduction in the noise level. p> <p>In this thesis, we look at how additional information about the structure of noise, or "noise bias," can improve or alter the performance of techniques in quantum error correction and fault tolerance. In Chapter 2, we explore the possibility of designing certain quantum gates to be extremely robust with respect to errors in their operation. This naturally leads to structured noise where certain gates can be implemented in a protected manner, allowing the user to focus their protection on the noisier unprotected operations.p> <p>In Chapter 3, we examine how to tailor error-correcting codes and fault-tolerant quantum circuits in the presence of dephasing biased noise, where dephasing errors are far more common than bit-flip errors. By using an appropriately asymmetric code, we demonstrate the ability to improve the amount of error reduction and decrease the physical resources required for error correction.p> <p>In Chapter 4, we analyze a variety of protocols for distilling magic states, which enable universal quantum computation, in the presence of faulty Clifford operations. Here again there is a hierarchy of noise levels, with a fixed error rate for faulty gates, and a second rate for errors in the distilled states which decreases as the states are distilled to better quality. The interplay of of these different rates sets limits on the achievable distillation and how quickly states converge to that limit.p>

Coding for information storage

<p>Storage systems are widely used and have played a crucial rule in both consumer and industrial products, for example, personal computers, data centers, and embedded systems. However, such system suffers from issues of cost, restricted-lifetime, and reliability with the emergence of new systems and devices, such as distributed storage and flash memory, respectively. Information theory, on the other hand, provides fundamental bounds and solutions to fully utilize resources such as data density, information I/O and network bandwidth. This thesis bridges these two topics, and proposes to solve challenges in data storage using a variety of coding techniques, so that storage becomes faster, more affordable, and more reliable.p> <p>We consider the system level and study the integration of RAID schemes and distributed storage. Erasure-correcting codes are the basis of the ubiquitous RAID schemes for storage systems, where disks correspond to symbols in the code and are located in a (distributed) network. Specifically, RAID schemes are based on MDS (maximum distance separable) array codes that enable optimal storage and efficient encoding and decoding algorithms. With r redundancy symbols an MDS code can sustain r erasures. For example, consider an MDS code that can correct two erasures. It is clear that when two symbols are erased, one needs to access and transmit all the remaining information to rebuild the erasures. However, an interesting and practical question is: What is the smallest fraction of information that one needs to access and transmit in order to correct a single erasure? In Part I we will show that the lower bound of 1/2 is achievable and that the result can be generalized to codes with arbitrary number of parities and optimal rebuilding.p> <p>We consider the device level and study coding and modulation techniques for emerging non-volatile memories such as flash memory. In particular, rank modulation is a novel data representation scheme proposed by Jiang et al. for multi-level flash memory cells, in which a set of n cells stores information in the permutation induced by the different charge levels of the individual cells. It eliminates the need for discrete cell levels, as well as overshoot errors, when programming cells. In order to decrease the decoding complexity, we propose two variations of this scheme in Part II: bounded rank modulation where only small sliding windows of cells are sorted to generated permutations, and partial rank modulation where only part of the n cells are used to represent data. We study limits on the capacity of bounded rank modulation and propose encoding and decoding algorithms. We show that overlaps between windows will increase capacity. We present Gray codes spanning all possible partial-rank states and using only ``push-to-the-top'' operations. These Gray codes turn out to solve an open combinatorial problem called universal cycle, which is a sequence of integers generating all possible partial permutations.p>

On erasure coding for distributed storage and streaming communications

<p>The work presented in this thesis revolves around erasure correction coding, as applied to distributed data storage and real-time streaming communications.p> <p>First, we examine the problem of allocating a given storage budget over a set of nodes for maximum reliability. The objective is to find an allocation of the budget that maximizes the probability of successful recovery by a data collector accessing a random subset of the nodes. This optimization problem is challenging in general because of its combinatorial nature, despite its simple formulation. We study several variations of the problem, assuming different allocation models and access models, and determine the optimal allocation and the optimal symmetric allocation (in which all nonempty nodes store the same amount of data) for a variety of cases. Although the optimal allocation can have nonintuitive structure and can be difficult to find in general, our results suggest that, as a simple heuristic, reliable storage can be achieved by spreading the budget maximally over all nodes when the budget is large, and spreading it minimally over a few nodes when it is small. Coding would therefore be beneficial in the former case, while uncoded replication would suffice in the latter case.p> <p>Second, we study how distributed storage allocations affect the recovery delay in a mobile setting. Specifically, two recovery delay optimization problems are considered for a network of mobile storage nodes: the maximization of the probability of successful recovery by a given deadline, and the minimization of the expected recovery delay. We show that the first problem is closely related to the earlier allocation problem, and solve the second problem completely for the case of symmetric allocations. It turns out that the optimal allocations for the two problems can be quite different. In a simulation study, we evaluated the performance of a simple data dissemination and storage protocol for mobile delay-tolerant networks, and observed that the choice of allocation can have a significant impact on the recovery delay under a variety of scenarios.p> <p>Third, we consider a real-time streaming system where messages created at regular time intervals at a source are encoded for transmission to a receiver over a packet erasure link; the receiver must subsequently decode each message within a given delay from its creation time. For erasure models containing a limited number of erasures per coding window, per sliding window, and containing erasure bursts whose maximum length is sufficiently short or long, we show that a time-invariant intrasession code asymptotically achieves the maximum message size among all codes that allow decoding under all admissible erasure patterns. For the bursty erasure model, we also show that diagonally interleaved codes derived from specific systematic block codes are asymptotically optimal over all codes in certain cases. We also study an i.i.d. erasure model in which each transmitted packet is erased independently with the same probability; the objective is to maximize the decoding probability for a given message size. We derive an upper bound on the decoding probability for any time-invariant code, and show that the gap between this bound and the performance of a family of time-invariant intrasession codes is small when the message size and packet erasure probability are small. In a simulation study, these codes performed well against a family of random time-invariant convolutional codes under a number of scenarios.p> <p>Finally, we consider the joint problems of routing and caching for named data networking. We propose a backpressure-based policy that employs virtual interest packets to make routing and caching decisions. In a packet-level simulation, the proposed policy outperformed a basic protocol that combines shortest-path routing with least-recently-used (LRU) cache replacement.p>

Ordinary mod p representations of the metaplectic cover of p-adic SL_2

We classify the genuine ordinary mod p representations of the metaplectic group SL(2,F)-tilde, where F is a p-adic field, and compute its genuine mod p spherical and Iwahori Hecke algebras. The motivation is an interest in a possible correspondence between genuine mod p representations of SL(2,F)-tilde and mod p representations of the dual group PGL(2,F), so we also compare the two Hecke algebras to the mod p spherical and Iwahori Hecke algebras of PGL(2,F). We show that the genuine mod p spherical Hecke algebra of SL(2,F)-tilde is isomorphic to the mod p spherical Hecke algebra of PGL(2,F), and that one can choose an isomorphism which is compatible with a natural, though partial, correspondence of unramified ordinary representations via the Hecke action on their spherical vectors. We then show that the genuine mod p Iwahori Hecke algebra of SL(2,F)-tilde is a subquotient of the mod p Iwahori Hecke algebra of PGL(2,F), but that the two algebras are not isomorphic. This is in contrast to the situation in characteristic 0, where by work of Savin one can recover the local Shimura correspondence for representations generated by their Iwahori fixed vectors from an isomorphism of Iwahori Hecke algebras.

The ^(26)Al(p,γ)^(27)Si reaction : stellar origins of galactic ^(26)Al

<p>To explain the ^(26)Mg isotopic anomaly seen in meteorites (^(26)Al daughter) as well as the observation of 1809-keV γ rays in the interstellar medium (live decay of 26Al) one must know, among other things, the destruction rate of ^(26)Al. Properties of states in ^(27)Si just above the ^(26)Al + p mass were investigated to determine the destruction rate of ^(26)Al via the ^(26)Al(p,γ)^(27)Si reaction at astrophysical temperatures.p> <p>Twenty micrograms of ^(26)Al were used to produce two types of Al_2O_3 targets by evaporation of the oxide. One was onto a thick platinum backing suitable for (p,γ) work, and the other onto a thin carbon foil for the (^3He,d) reaction.p> <p>The ^(26)Al(p,γ)^(27)Si excitation function, obtained using a germanium detector and voltage-ramped target, confirmed known resonances and revealed new ones at 770, 847, 876, 917, and 928 keV. Possible resonances below the lowest observed one at E_p = 286 keV were investigated using the ^(26)Al(^3He,d)^(27)Si proton-transfer reaction. States in 27Si corresponding to 196- and 286-keV proton resonances were observed. A possible resonance at 130 keV (postulated in prior work) was shown to have a strength of wγ less than 0.02 µeV.p> <p>By arranging four large Nal detector as a 47π calorimeter, the 196-keV proton resonance, and one at 247 keV, were observed directly, having wγ = 55± 9 and 10 ± 5 µeV, respectively.p> <p>Large uncertainties in the reaction rate have been reduced. At novae temperatures, the rate is about 100 times faster than that used in recent model calculations, casting some doubt on novae production of galactic ^(26)Al.p>

Gene enrichment using antibodies to DNA/RNA hybrids : mapping the ribosomal DNA of slime mold and rat

<p>A novel method for gene enrichment has been developed and applied to mapping the rRNA genes of two eucaryotic organisms. The method makes use of antibodies to DNA/RNA hybrids prepared by injecting rabbits with the synthetic hybrid poly(rA)•poly(dT). Antibodies which cross-react with non-hybrid nucleic acids were removed from the purified IgG fraction by adsorption on columns of DNA-Sepharose, oligo(dT)-cellulose, and poly(rA)-Sepharose. Subsequent purification of the specific DNA/RNA hybrid antibody was carried out on a column of oligo(dT)-cellulose to which poly(rA) was hybridized. Attachment of these antibodies to CNBr-activated Sepharose produced an affinity resin which specifically binds DNA/RNA hybrids.p> <p>In order to map the rDNA of the slime mold Dictyostelium discoideum, R-loops were formed using unsheared nuclear DNA and the 178 and 268 rRNAs of this organism. This mixture was passed through a column containing the affinity resin, and bound molecules containing R- loops were eluted by high salt. This purified rDN A was observed directly in the electron microscope. Evidence was obtained that there is a physical end to Dictyostelium rDN A molecules approximately 10 kilobase pairs (kbp) from the region which codes for the 268 rRNA. This finding is consistent with reports of other investigators that the rRNA genes exist as inverse repeats on extra-chromosomal molecules of DNA unattached to the remainder of the nuclear DNA in this organism.p> <p>The same general procedure was used to map the rRNA genes of the rat. Molecules of DNA which contained R-loops formed with the 188 and 288 rRNAs were enriched approximately 150- fold from total genomal rat DNA by two cycles of purification on the affinity column. Electron microscopic measurements of these molecules enabled the construction of an R-loop map of rat rDNA. Eleven of the observed molecules contained three or four R-loops or else two R-loops separated by a long spacer. These observations indicated that the rat rRNA genes are arranged as tandem repeats. The mean length of the repeating units was 37.2 kbp with a standard deviation of 1.3 kbp. These eleven molecules may represent repeating units of exactly the same length within the errors of the measurements, although a certain degree of length heterogeneity cannot be ruled out. If significantly shorter or longer repeating units exist, they are probably much less common than the 37.2 kbp unit.p> <p>The last section of the thesis describes the production of antibodies to non-histone chromosomal proteins which have been exposed to the ionic detergent sodium dodecyl sulfate (SDS). The presence of low concentrations of SDS did not seem to affect either production of antibodies or their general specificity. Also, a technique is described for the in situ immunofluorescent detection of protein antigens in polyacrylamide gels.p>

Influence of composition on the structure and properties of Fe-Pd-P and Ni-Pd-P amorphous alloys

<p>Ternary alloys of nickel-palladium-phosphorus and iron-palladium- phosphorus containing 20 atomic % phosphorus were rapidly quenched from the liquid state. The structure of the quenched alloys was investigated by X-ray diffraction. Broad maxima in the diffraction patterns, indicative of a glass-like structure, were obtained for 13 to 73 atomic % nickel and 13 to 44 atomic % iron, with palladium adding up to 80%.p> <p>Radial distribution functions were computed from the diffraction data and yielded average interatomic distances and coordination numbers. The structure of the amorphous alloys could be explained in terms of structural units analogous to those existing in the crystalline Pd₃P, Ni₃P and Fe₃P phases, with iron or nickel substituting for palladium. A linear relationship between interatomic distances and composition, similar to Vegard's law, was shown for these metallic glasses.p> <p>Electrical resistivity measurements showed that the quenched alloys were metallic. Measurements were performed from liquid helium temperatures (4.2°K) up to the vicinity of the melting points (900°K- 1000°K). The temperature coefficient in the glassy state was very low, of the order of 10p>-4p>/°K. A resistivity minimum was found at low temperature, varying between 9°K and 14°K for Ni_x-Pd_80-x -P₂₀ and between 17°K and 96°K for Fe_x-Pd_80-x -P₂₀, indicating the presence of a Kondo effect. Resistivity measurements, with a constant heating rate of about 1.5°C/min,showed progressive crystallization above approximately 600°K.p> <p>The magnetic moments of the amorphous Fe-Pd-P alloys were measured as a function of magnetic field and temperature. True ferromagnetism was found for the alloys Fe₃₂-Pd₄₈-P₂₀ and Fe₄₄-Pd₃₆-P₂₀ with Curie points at 165° K and 380° K respectively. Extrapolated values of the saturation magnetic moments to 0° K were 1.70 µ_B and 2.10 µ_B respectively. The amorphous alloy Fe₂₃-Pd₅₇-P₂₀ was assumed to be superparamagnetic. The experimental data indicate that phosphorus contributes to the decrease of moments by electron transfer, whereas palladium atoms probably have a small magnetic moment. A preliminary investigation of the Ni-Pd-P amorphous alloys showed that these alloys are weakly paramagnetic.p>

Randomness-efficient curve sampling

<p>Curve samplers are sampling algorithms that proceed by viewing the domain as a vector space over a finite field, and randomly picking a low-degree curve in it as the sample. Curve samplers exhibit a nice property besides the sampling property: the restriction of low-degree polynomials over the domain to the sampled curve is still low-degree. This property is often used in combination with the sampling property and has found many applications, including PCP constructions, local decoding of codes, and algebraic PRG constructions.p> <p>The randomness complexity of curve samplers is a crucial parameter for its applications. It is known that (non-explicit) curve samplers using O(log N + log(1/δ)) random bits exist, where N is the domain size and δ is the confidence error. The question of explicitly constructing randomness-efficient curve samplers was first raised in [TU06] where they obtained curve samplers with near-optimal randomness complexity.p> <p>In this thesis, we present an explicit construction of low-degree curve samplers with optimal randomness complexity (up to a constant factor) that sample curves of degree (m log_q(1/δ))p>O(1)p> in F_qp>mp>. Our construction is a delicate combination of several components, including extractor machinery, limited independence, iterated sampling, and list-recoverable codes.p>

Nonstationary response of structures and its application to earthquake engineering

<p>This thesis presents a simplified state-variable method to solve for the nonstationary response of linear MDOF systems subjected to a modulated stationary excitation in both time and frequency domains. The resulting covariance matrix and evolutionary spectral density matrix of the response may be expressed as a product of a constant system matrix and a time-dependent matrix, the latter can be explicitly evaluated for most envelopes currently prevailing in engineering. The stationary correlation matrix of the response may be found by taking the limit of the covariance response when a unit step envelope is used. The reliability analysis can then be performed based on the first two moments of the response obtained.p> <p>The method presented facilitates obtaining explicit solutions for general linear MDOF systems and is flexible enough to be applied to different stochastic models of excitation such as the stationary models, modulated stationary models, filtered stationary models, and filtered modulated stationary models and their stochastic equivalents including the random pulse train model, filtered shot noise, and some ARMA models in earthquake engineering. This approach may also be readily incorporated into finite element codes for random vibration analysis of linear structures.p> <p>A set of explicit solutions for the response of simple linear structures subjected to modulated white noise earthquake models with four different envelopes are presented as illustration. In addition, the method has been applied to three selected topics of interest in earthquake engineering, namely, nonstationary analysis of primary-secondary systems with classical or nonclassical dampings, soil layer response and related structural reliability analysis, and the effect of the vertical components on seismic performance of structures. For all the three cases, explicit solutions are obtained, dynamic characteristics of structures are investigated, and some suggestions are given for aseismic design of structures.p>

Part I. Kinetics of coarsening of the gamma-prime precipitate in nickel-silicon alloys. Part II. Rate of crystallization of an amorphous Fe-P-C alloy

<p>The coarsening kinetics of Ni₃ Si(γ') precipitate in a binary Ni-Si alloy containing 6.5 wt. % silicon was studied by magnetic techniques and transmission electronmicroscopy. A calibration curve was established to determine the concentration of silicon in the matrix. The variation of the Si content of the Ni-rich matrix as a function of time follows Lifshitz and Wagner theory for diffusion controlled coarsening phenomena. The estimated values of equilibrium solubility of silicon in the matrix represent the true coherent equilibrium solubilities.p> <p>The experimental particle-size distributions and average particle size were determined from dark field electron micrographs. The average particle size varies linearly with tp>-1/3p> as suggested by Lifshitz and Wagner. The experimental distributions of particle sizes differ slightly from the theoretical curve at the early stages of aging, but the agreement is satisfactory at the later stages. The values of diffusion coefficient of silicon, interfacial free energy and activation energy were calculated from the results of coarsening kinetics. The experimental value of effective diffusion coefficient is in satisfactory agreement with the value predicted by the application of irreversible the rmodynamics to the process of volume constrained growth of coherent precipitate during coarsening. The coherent γ' particles in Ni-Sialloy unlike those in Ni-Al and Ni-Ti seem to lose coherency at high temperature. A mechanism for the formation of semi-coherent precipitate is suggested.p>