Two-magnon bound state causes ultrafast thermally induced magnetisation switching

There has been much interest recently in the discovery of thermally induced magnetisation switching using femtosecond laser excitation, where a ferrimagnetic system can be switched deterministically without an applied magnetic field. Experimental results suggest that the reversal occurs due to intrinsic material properties, but so far the microscopic mechanism responsible for reversal has not been identified. Using computational and analytic methods we show that the switching is caused by the excitation of two-magnon bound states, the properties of which are dependent on material factors. This discovery allows us to accurately predict the onset of switching and the identification of this mechanism will allow new classes of materials to be identified or designed for memory devices in the THz regime.

Advances in Nonlinear Complexity Analysis for Partial Differential Equations

1 p. -- [Editorial Material]

Complexity of planning in design

Planning in design processes is modeled in terms of connectivities between product developments. Each product development comprises a network of processes. Similarity between processes is analysed by a layered classification ranging from common components to shared design knowledge. The connectivities between products arising from similarities among products are represented by a multidimensional network. Design planning is described by flows or 'traffic' on this network which represents a structural model of complexity. Comparison is made with information based measures of the complexity of designs and processes.

Surface-Bound Selectin-Ligand Binding Is Regulated By Carrier Diffusion

Two-dimensional (2D) kinetics of receptor-ligand interactions governs cell adhesion in many biological processes. While the dissociation kinetics of receptor-ligand bond is extensively investigated, the association kinetics has much less been quantified. Recently receptor-ligand interactions between two surfaces were investigated using a thermal fluctuation assay upon biomembrane force probe technique (Chen et al. in Biophys J 94:694-701, 2008). The regulating factors on association kinetics, however, are not well characterized. Here we developed an alternative thermal fluctuation assay using optical trap technique, which enables to visualize consecutive binding-unbinding transition and to quantify the impact of microbead diffusion on receptor-ligand binding. Three selectin constructs (sLs, sPs, and PLE) and their ligand P-selectin glycoprotein ligand 1 were used to conduct the measurements. It was indicated that bond formation was reduced by enhancing the diffusivity of selectin-coupled carrier, suggesting that carrier diffusion is crucial to determine receptor-ligand binding. It was also found that 2D forward rate predicted upon first-order kinetics was in the order of sPs > sLs > PLE and bond formation was history-dependent. These results further the understandings in regulating association kinetics of surface-bound receptor-ligand interactions.

Proteomic analysis of the Cdc48/Ubx network identifies a role for Ubx2 in the regulation of lipid biosynthesis

Cdc48/p97 is an essential, highly abundant hexameric member of the AAA (ATPase associated with various cellular activities) family. It has been linked to a variety of processes throughout the cell but it is best known for its role in the ubiquitin proteasome pathway. In this system it is believed that Cdc48 behaves as a segregase, transducing the chemical energy of ATP hydrolysis into mechanical force to separate ubiquitin-conjugated proteins from their tightly-bound partners.

Current models posit that Cdc48 is linked to its substrates through a variety of adaptor proteins, including a family of seven proteins (13 in humans) that contain a Cdc48-binding UBX domain. As such, due to the complexity of the network of adaptor proteins for which it serves as the hub, Cdc48/p97 has the potential to exert a profound influence on the ubiquitin proteasome pathway. However, the number of known substrates of Cdc48/p97 remains relatively small, and smaller still is the number of substrates that have been linked to a specific UBX domain protein. As such, the goal of this dissertation research has been to discover new substrates and better understand the functions of the Cdc48 network. With this objective in mind, we established a proteomic screen to assemble a catalog of candidate substrate/targets of the Ubx adaptor system.

Here we describe the implementation and optimization of a cutting-edge quantitative mass spectrometry method to measure relative changes in the Saccharomyces cerevisiae proteome. Utilizing this technology, and in order to better understand the breadth of function of Cdc48 and its adaptors, we then performed a global screen to identify accumulating ubiquitin conjugates in cdc48-3 and ubxΔ mutants. In this screen different ubx mutants exhibited reproducible patterns of conjugate accumulation that differed greatly from each other, pointing to various unexpected functional specializations of the individual Ubx proteins.

As validation of our mass spectrometry findings, we then examined in detail the endoplasmic-reticulum bound transcription factor Spt23, which we identified as a putative Ubx2 substrate. In these studies ubx2Δ cells were deficient in processing of Spt23 to its active p90 form, and in localizing p90 to the nucleus. Additionally, consistent with reduced processing of Spt23, ubx2Δ cells demonstrated a defect in expression of their target gene OLE1, a fatty acid desaturase. Overall, this work demonstrates the power of proteomics as a tool to identify new targets of various pathways and reveals Ubx2 as a key regulator lipid membrane biosynthesis.

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.