A measurement of B0-B0 mixing in e+e- annihilation at 29 GeV

This thesis describes a measurement of B⁰- B⁰ mixing in events produced by electron-positron annihilation at a center of mass energy of 29 GeV. The data were taken by the Mark II detector in the PEP storage ring at the Stanford Linear Accelerator Center between 1981 and 1987, and correspond to a total integrated luminosity of 224pb^-1.

We used a new method, based on the kinematics of hadronic events containing two leptons, to provide a measurement of the probability, x, that a hadron, initially containing a b (b) quark decays to a positive (negative) lepton to be X = 0.17^+0.15_-0.08, with 90% confidence level upper and lower limits of 0.38 and 0.06, respectively, including all estimated systematic errors. Because of the good separation of signal and background, this result is relatively insensitive to various systematic effects which have complicated previous measurements.

We interpret this result as evidence for the mixing of neutral B mesons. Based on existing B⁰_d mixing rate measurements, and some assumptions about the fractions of B⁰_d and B⁰_s mesons present in the data, this result favors maximal mixing of B⁰_s mesons, although it cannot rule out zero B⁰_s mixing at the 90% confidence level.

Ring-opening metathesis of bulky norbornene monomers and the radical-mediated hydrophosphonation of olefins

This thesis discusses two major topics: the ring-opening metathesis polymerization (ROMP) of bulky monomers and the radical-mediated hydrophosphonation of olefins. The research into the ROMP of bulky monomers is further divided into three chapters: wedge-shaped monomers, the alternating copolymerization of 1-methyloxanorbornene derivatives with cyclooctene, and the kinetic resolution polymerization of 1-methyloxanorbornene derivatives. The wedge-shaped monomers can be polymerized into diblock copolymers that possess photonic crystal properties. The alternating copolymerization of 1-methyloxanorbornene derivatives with cyclooctene is performed with > 90% alternation via two different routes: typical alternating copolymerization and a sequence editing approach. The kinetic resolution polymerization of these same 1-methyloxanorbornene monomers achieves only modest selectivity (S=4), but there is evidence that the growing polymer chain forms a helix that influences the selectivity of the resolution. The last topic is the radical-mediated hydrophosphonation of olefins. This synthetic method provides access to Wittig reagents that are capable of highly cis-selective olefinations of aldehydes.

Coding for information storage

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.

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.

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.

On erasure coding for distributed storage and streaming communications

The work presented in this thesis revolves around erasure correction coding, as applied to distributed data storage and real-time streaming communications.

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.

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.

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.

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.

Aqueous ring-opening metathesis polymerizations

Past workers in this group as well as in others have made considerable progress in the understanding and development of the ring-opening metathesis polymerization (ROMP) technique. Through these efforts, ROMP chemistry has become something of an organometallic success story. Extensive work was devoted to trying to identify the catalytically active species in classical reaction mixtures of early metal halides and alkyl aluminum compounds. Through this work, a mechanism involving the interconversion of metal carbenes and metallacyclobutanes was proposed. This preliminary work finally led to the isolation and characterization of stable metal carbene and metallacyclobutane complexes. As anticipated, these well-characterized complexes were shown to be active catalysts. In a select number of cases, these catalysts have been shown to catalyze the living polymerization of strained rings such as norbornene. The synthetic control offered by these living systems places them in a unique category of metal catalyzed reactions. To take full advantage of these new catalysts, two approaches should be explored. The first takes advantage of the unusual fact that all of the unsaturation present in the monomer is conserved in the polymer product. This makes ROMP techniques ideal for the synthesis of highly unsaturated, and fully conjugated polymers, which find uses in a variety of applications. This area is currently under intense investigation. The second aspect, which should lend itself to fruitful investigations, is expanding the utility of these catalysts through the living polymerization of monomers containing interesting functional groups. Polymer properties can be dramatically altered by the incorporation of functional groups. It is this latter aspect which will be addressed in this work.

After a general introduction to both the ring-opening metathesis reaction (Chapter 1) and the polymerization of fuctionalized monomers by transition metal catalysts (Chapter 2), the limits of the existing living ROMP catalysts with functionalized monomers are examined in Chapter 3. Because of the stringent limitations of these early metal catalysts, efforts were focused on catalysts based on ruthenium complexes. Although not living, and displaying unusually long induction periods, these catalysts show high promise for future investigations directed at the development of catalysts for the living polymerization of functionalized monomers. In an attempt to develop useful catalysts based on these ruthenium complexes, efforts to increase their initiation rates are presented in Chapter 4. This work eventually led to the discovery that these catalysts are highly active in aqueous solution, providing the opportunity to develop aqueous emulsion ROMP systems. Recycling the aqueous catalysts led to the discovery that the ruthenium complexes become more activated with use. Investigations of these recycled solutions uncovered new ruthenium-olefin complexes, which are implicated in the activation process. Although our original goal of developing living ROMP catalysts for the polymerization of fuctionalized monomers is yet to be realized, it is hoped that this work provides a foundation from which future investigations can be launched.

In the last chapter, the ionophoric properties of the poly(7-oxanobornene) materials is briefly discussed. Their limited use as acyclic host polymers led to investigations into the fabrication of ion-permeable membranes fashioned from these materials.