California Institute of Technology

About: California Institute of Technology is a education organization based out in Pasadena, California, United States. It is known for research contribution in the topics: Galaxy & Redshift. The organization has 57649 authors who have published 146691 publications receiving 8620287 citations. The organization is also known as: Caltech & Cal Tech.

RING Domain E3 Ubiquitin Ligases

Abstract: E3 ligases confer specificity to ubiquitination by recognizing target substrates and mediating transfer of ubiquitin from an E2 ubiquitinconjugating enzyme to substrate. The activity of most E3s is specified by a RING domain, which binds to an E2∼ubiquitin thioester and activates discharge of its ubiquitin cargo. E2-E3 complexes can either monoubiquitinate a substrate lysine or synthesize polyubiquitin chains assembled via different lysine residues of ubiquitin. These modifications can have diverse effects on the substrate, ranging from proteasome-dependent proteolysis to modulation of protein function, structure, assembly, and/or localization. Not surprisingly, RING E3mediated ubiquitination can be regulated in a number of ways. RING-based E3s are specified by over 600 human genes, surpassing the 518 protein kinase genes. Accordingly, RING E3s have been linked to the control of many cellular processes and to multiple human diseases. Despite their critical importance, our knowledge of the physiological partners, biological functions, substrates, and mechanism of action for most RING E3s remains at a rudimentary stage.

Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions

Abstract: Low-rank matrix approximations, such as the truncated singular value decomposition and the rank-revealing QR decomposition, play a central role in data analysis and scientific computing. This work surveys and extends recent research which demonstrates that randomization offers a powerful tool for performing low-rank matrix approximation. These techniques exploit modern computational architectures more fully than classical methods and open the possibility of dealing with truly massive data sets. This paper presents a modular framework for constructing randomized algorithms that compute partial matrix decompositions. These methods use random sampling to identify a subspace that captures most of the action of a matrix. The input matrix is then compressed---either explicitly or implicitly---to this subspace, and the reduced matrix is manipulated deterministically to obtain the desired low-rank factorization. In many cases, this approach beats its classical competitors in terms of accuracy, speed, and robustness. These claims are supported by extensive numerical experiments and a detailed error analysis.

Variable-rate variable-power MQAM for fading channels

Abstract: We propose a variable-rate and variable-power MQAM modulation scheme for high-speed data transmission over fading channels. We first review results for the Shannon capacity of fading channels with channel side information, where capacity is achieved using adaptive transmission techniques. We then derive the spectral efficiency of our proposed modulation. We show that there is a constant power gap between the spectral efficiency of our proposed technique and the channel capacity, and this gap is a simple function of the required bit-error rate (BER). In addition, using just five or six different signal constellations, we achieve within 1-2 dB of the maximum efficiency using unrestricted constellation sets. We compute the rate at which the transmitter needs to update its power and rate as a function of the channel Doppler frequency for these constellation sets. We also obtain the exact efficiency loss for smaller constellation sets, which may be required if the transmitter adaptation rate is constrained by hardware limitations. Our modulation scheme exhibits a 5-10-dB power gain relative to variable-power fixed-rate transmission, and up to 20 dB of gain relative to nonadaptive transmission. We also determine the effect of channel estimation error and delay on the BER performance of our adaptive scheme. We conclude with a discussion of coding techniques and the relationship between our proposed modulation and Shannon capacity.

Unconditional quantum teleportation

Abstract: Quantum teleportation of optical coherent states was demonstrated experimentally using squeezed-state entanglement. The quantum nature of the achieved teleportation was verified by the experimentally determined fidelity Fexp = 0.58 +/- 0.02, which describes the match between input and output states. A fidelity greater than 0.5 is not possible for coherent states without the use of entanglement. This is the first realization of unconditional quantum teleportation where every state entering the device is actually teleported.

GWTC-1: A Gravitational-Wave Transient Catalog of Compact Binary Mergers Observed by LIGO and Virgo during the First and Second Observing Runs

Abstract: We present the results from three gravitational-wave searches for coalescing compact binaries with component masses above 1 Ma™ during the first and second observing runs of the advanced gravitational-wave detector network. During the first observing run (O1), from September 12, 2015 to January 19, 2016, gravitational waves from three binary black hole mergers were detected. The second observing run (O2), which ran from November 30, 2016 to August 25, 2017, saw the first detection of gravitational waves from a binary neutron star inspiral, in addition to the observation of gravitational waves from a total of seven binary black hole mergers, four of which we report here for the first time: GW170729, GW170809, GW170818, and GW170823. For all significant gravitational-wave events, we provide estimates of the source properties. The detected binary black holes have total masses between 18.6-0.7+3.2 Mâ™ and 84.4-11.1+15.8 Mâ™ and range in distance between 320-110+120 and 2840-1360+1400 Mpc. No neutron star-black hole mergers were detected. In addition to highly significant gravitational-wave events, we also provide a list of marginal event candidates with an estimated false-alarm rate less than 1 per 30 days. From these results over the first two observing runs, which include approximately one gravitational-wave detection per 15 days of data searched, we infer merger rates at the 90% confidence intervals of 110-3840 Gpc-3 y-1 for binary neutron stars and 9.7-101 Gpc-3 y-1 for binary black holes assuming fixed population distributions and determine a neutron star-black hole merger rate 90% upper limit of 610 Gpc-3 y-1.