Results 151 to 160 of about 279 (207)
Abstract We introduce mixed super‐circles, a position‐curvature formulation of the original dynamic 2D super‐helix model. Compared to the latter, purely curvature‐based model – the so‐called chained formulation –, the mixed formulation that we propose here drastically reduces the algorithmic complexity of the solving scheme – from quadratic to quasi ...
Emile Hohnadel +2 more
wiley +1 more source
Dynamic Wave Trains: A Procedural Approach to Spatially Varying Ocean Synthesis
In this paper, we present a high performance procedural model capable of synthesizing and rendering a virtually infinite ocean. Our method exhibits spatial variations as the orientations, speed and choppiness of the waves is parametrized for each frequencies and each point in space. The provided visual abstract exhibits a sunset rendering of a large 40
Romain Fournier +4 more
wiley +1 more source
The eukaryote‐specific N‐terminal domain (NTD) of eS31 uses two distinct strategies to maintain translation fidelity. During elongation, a positively charged “hotspot” fine‐tunes the selection of incoming aa‐tRNA. During termination, the entire NTD acts as a structural scaffold to ensure the correct positioning of the release factor eRF1.
Qingxuan Gao +3 more
wiley +1 more source
PEG400 regulates Falcipain 2 activity through an allosteric mechanism
Falcipain‐2 can potentially be leveraged as a drug target due to its critical role as a haemoglobinase during the intra‐erythrocytic stage of Plasmodium falciparum. Here, we investigate the regulation of the proteolytic and haemoglobinase activity of falcipain‐2 in the presence of polyethylene glycol.
Bikram Nath +2 more
wiley +1 more source
Xylan, the second most abundant plant cell wall polysaccharide, is degraded by β‐xylanases and β‐xylosidases. Here, we present the 2.65 Å cryo‐EM structure of Enterobacter cloacae β‐xylosidase (EcXyl43, GH43) and the 2.4 Å X‐ray structure of its inactive F507A mutant.
Lorenzo Briganti +8 more
wiley +1 more source
Structural insights into tyrosine sulfation of CCR5 by human tyrosylprotein sulfotransferase‐1
Structural analysis of human tyrosylprotein sulfotransferase‐1 (hTPST1) bound to a CCR5 N‐terminal peptide reveals how hTPST1 recognizes the Tyr3 sulfation site. Structure‐guided models of additional CCR5 sulfation states and full‐length assemblies provide a framework for understanding CCR5 tyrosine sulfation, a post‐translational modification relevant
Shinnosuke Tanaka +10 more
wiley +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Superposition codes for mismatched decoding
2013 IEEE International Symposium on Information Theory, 2013An achievable rate is given for discrete memoryless channels with a given (possibly suboptimal) decoding rule. The result is obtained using a refinement of the superposition coding ensemble. The rate is tight with respect to the ensemble average, and can be weakened to the LM rate of Hui and Csiszar-Korner, and to Lapidoth's rate based on parallel ...
Jonathan Scarlett +2 more
openaire +1 more source
Superposition coding in the combination network
2016 IEEE International Symposium on Information Theory (ISIT), 2016We present an inner bound for the combination network based on superposition coding and partial interference decoding. This inner bound is tight in the three-user and K-user symmetric cases, where capacity has been previously characterized. However, unlike previous achievability schemes, the scheme presented herein does not require network coding.
Henry P. Romero, Mahesh Kumar Varanasi
openaire +1 more source
Implementation of Sparse Superposition Codes
IEEE Transactions on Signal Processing, 2017Sparse superposition codes (SSCs) are capacity achieving codes whose decoding process is a linear sensing problem. Decoding approaches thus exploit the approximate message passing algorithm, which has been proven to be effective in compressing sensing.
Carlo Condo, Warren J. Gross
openaire +1 more source
Superposition coding in rewritable channels
2010 Information Theory and Applications Workshop (ITA), 2010We introduce the notions of superposition coding and sequential decoding in the context of rewritable channels. Using these concepts we will show that for k 1 > k 0 , C(k 1 ) ≥ C(k 0 )+log(k1/k0), where C(·) is the capacity of the rewritable channel for a given cost. A consequence of this result is that C(k) ≥ C(1) + log k, where C(1) is the classical
L. A. Lastras-Montao +2 more
openaire +1 more source

