Ab initio studies of the spin-transfer torque in tunnel junctions

We calculate the spin-transfer torque in Fe/MgO/Fe tunnel junctions and compare the results to those for all-metallic junctions. We show that the spin-transfer torque is interfacial in the ferromagnetic layer to a greater degree than in all-metallic junctions. This result originates in the half metallic behavior of Fe for the $\Delta_1$ states at the Brillouin zone center; in contrast to all-metallic structures, dephasing does not play an important role. We further show that it is possible to get a component of the torque that is out of the plane of the magnetizations and that is linear in the bias. However, observation of such a torque requires highly ideal samples. In samples with typical interfacial roughness, the torque is similar to that in all-metallic multilayers, although for different reasons.Comment: 5 pages, 4 figure

Wind speed statistics for Goldstone, California, anemometer sites

An exploratory wind survey at an antenna complex was summarized statistically for application to future windmill designs. Data were collected at six locations from a total of 10 anemometers. Statistics include means, standard deviations, cubes, pattern factors, correlation coefficients, and exponents for power law profile of wind speed. Curves presented include: mean monthly wind speeds, moving averages, and diurnal variation patterns. It is concluded that three of the locations have sufficiently strong winds to justify consideration for windmill sites

Facilitated sequence counting and assembly by template mutagenesis

Presently, inferring the long-range structure of the DNA templates is limited by short read lengths. Accurate template counts suffer from distortions occurring during PCR amplification. We explore the utility of introducing random mutations in identical or nearly identical templates to create distinguishable patterns that are inherited during subsequent copying. We simulate the applications of this process under assumptions of error-free sequencing and perfect mapping, using cytosine deamination as a model for mutation. The simulations demonstrate that within readily achievable conditions of nucleotide conversion and sequence coverage, we can accurately count the number of otherwise identical molecules as well as connect variants separated by long spans of identical sequence. We discuss many potential applications, such as transcript profiling, isoform assembly, haplotype phasing, and de novo genome assembly

Electrical manipulation of an electronic two-state system in Ge/Si quantum dots

We calculate that the electron states of strained self-assembled Ge/Si quantum dots provide a convenient two-state system for electrical control. An electronic state localized at the apex of the quantum dot is nearly degenerate with a state localized at the base of the quantum dot. Small electric fields shift the electronic ground state from apex-localized to base-localized, which permits sensitive tuning of the electronic, optical and magnetic properties of the dot. As one example, we describe how spin-spin coupling between two Ge/Si dots can be controlled very sensitively by shifting the individual dot's electronic ground state between apex and base

Fast Matrix Factorization for Online Recommendation with Implicit Feedback

This paper contributes improvements on both the effectiveness and efficiency of Matrix Factorization (MF) methods for implicit feedback. We highlight two critical issues of existing works. First, due to the large space of unobserved feedback, most existing works resort to assign a uniform weight to the missing data to reduce computational complexity. However, such a uniform assumption is invalid in real-world settings. Second, most methods are also designed in an offline setting and fail to keep up with the dynamic nature of online data. We address the above two issues in learning MF models from implicit feedback. We first propose to weight the missing data based on item popularity, which is more effective and flexible than the uniform-weight assumption. However, such a non-uniform weighting poses efficiency challenge in learning the model. To address this, we specifically design a new learning algorithm based on the element-wise Alternating Least Squares (eALS) technique, for efficiently optimizing a MF model with variably-weighted missing data. We exploit this efficiency to then seamlessly devise an incremental update strategy that instantly refreshes a MF model given new feedback. Through comprehensive experiments on two public datasets in both offline and online protocols, we show that our eALS method consistently outperforms state-of-the-art implicit MF methods. Our implementation is available at https://github.com/hexiangnan/sigir16-eals.Comment: 10 pages, 8 figure

Lorentz Transformation from Symmetry of Reference Principle

The Lorentz Transformation is traditionally derived requiring the Principle of Relativity and light-speed universality. While the latter can be relaxed, the Principle of Relativity is seen as core to the transformation. The present letter relaxes both statements to the weaker, Symmetry of Reference Principle. Thus the resulting Lorentz transformation and its consequences (time dilatation, length contraction) are, in turn, effects of how we manage space and time.Comment: 2 page

AdS-Carroll Branes

Coset methods are used to determine the action of a co-dimension one brane (domain wall) embedded in (d+1)-dimensional AdS space in the Carroll limit in which the speed of light goes to zero. The action is invariant under the non-linearly realized symmetries of the AdS-Carroll spacetime. The Nambu-Goldstone field exhibits a static spatial distribution for the brane with a time varying momentum density related to the brane's spatial shape as well as the AdS-C geometry. The AdS-C vector field dual theory is obtained.Comment: 47 page

Content addressable memory project

The progress on the Rutgers CAM (Content Addressable Memory) Project is described. The overall design of the system is completed at the architectural level and described. The machine is composed of two kinds of cells: (1) the CAM cells which include both memory and processor, and support local processing within each cell; and (2) the tree cells, which have smaller instruction set, and provide global processing over the CAM cells. A parameterized design of the basic CAM cell is completed. Progress was made on the final specification of the CPS. The machine architecture was driven by the design of algorithms whose requirements are reflected in the resulted instruction set(s). A few of these algorithms are described