Technion – Israel Institute of Technology

About: Technion – Israel Institute of Technology is a education organization based out in Haifa, Israel. It is known for research contribution in the topics: Population & Nonlinear system. The organization has 31714 authors who have published 79377 publications receiving 2603976 citations. The organization is also known as: Technion Israel Institute of Technology & Ṭekhniyon, Makhon ṭekhnologi le-Yiśraʼel.

The ubiquitin–proteasome pathway: on protein death and cell life

Abstract: The discovery of the ubiquitin pathway and its many substrates and functions has revolutionized our concept of intracellular protein degradation. From an unregulated, non‐specific terminal scavenger process, it has become clear that proteolysis of cellular proteins is a highly complex, temporally controlled and tightly regulated process which plays important roles in a broad array of basic cellular processes. It is carried out by a complex cascade of enzymes and displays a high degree of specificity towards its numerous substrates. Among these are cell cycle and growth regulators, components of signal transduction pathways, enzymes of house keeping and cell‐specific metabolic pathways, and mutated or post‐translationally damaged proteins. The system is also involved in processing major histocompatibility complex (MHC) class I antigens. For many years it has been thought that activity of the system is limited to the cytosol and probably to the nucleus. However, recent experimental evidence has demonstrated that membrane‐anchored and even secretory pathway‐compartmentalized proteins are also targeted by the system. These proteins must be first translocated in a retrograde manner into the cytosol, as components of the pathway have not been identified in the endoplasmic reticulum (ER) lumen. With the multiple cellular targets, it is not surprising that the system is involved in the regulation of many basic cellular processes such as cell cycle and division, differentiation and development, the response to stress and extracellular modulators, morphogenesis of neuronal networks, modulation of cell surface receptors, ion channels and the secretory pathway, DNA repair, regulation of the immune and inflammatory responses, biogenesis of organelles and apoptosis. One would also predict that aberrations in such a complex system may be implicated in the pathogenesis of many diseases, both inherited and acquired. Recent evidence shows that this is indeed the case. Degradation of a protein by the ubiquitin system involves two distinct …

Block-Sparse Signals: Uncertainty Relations and Efficient Recovery

Abstract: We consider efficient methods for the recovery of block-sparse signals-ie, sparse signals that have nonzero entries occurring in clusters-from an underdetermined system of linear equations An uncertainty relation for block-sparse signals is derived, based on a block-coherence measure, which we introduce We then show that a block-version of the orthogonal matching pursuit algorithm recovers block -sparse signals in no more than steps if the block-coherence is sufficiently small The same condition on block-coherence is shown to guarantee successful recovery through a mixed -optimization approach This complements previous recovery results for the block-sparse case which relied on small block-restricted isometry constants The significance of the results presented in this paper lies in the fact that making explicit use of block-sparsity can provably yield better reconstruction properties than treating the signal as being sparse in the conventional sense, thereby ignoring the additional structure in the problem

Efficient near-infrared polymer nanocrystal light-emitting diodes.

Abstract: Conjugated polymers and indium arsenide–based nanocrystals were used to create near-infrared plastic light-emitting diodes. Emission was tunable from 1 to 1.3 micrometers—a range that effectively covers the short-wavelength telecommunications band—by means of the quantum confinement effects in the nanocrystals. The external efficiency value (photons out divided by electrons in) is ∼0.5% (that is, >1% internal) and is mainly limited by device architecture. The near-infrared emission did not overlap the charge-induced absorption bands of the polymer.

An application procedure for DEA

Abstract: Data Envelopment Analysis (DEA) has become an accepted approach for assessing efficiency in a wide range of cases. The present paper suggests a systematic application procedure of the DEA methodology in its various stages. Attention is focused on the selection of ‘decision making units’ (DMUs) to enter the analysis as well as the choice and screening of factors. The application of several DEA models (in different versions and formulations) is demonstrated, in the process of determining relative efficiencies within the compared DMUs.

List Decoding of Polar Codes

Abstract: We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Arikan. In the proposed list decoder, $L$ decoding paths are considered concurrently at each decoding stage, where $L$ is an integer parameter. At the end of the decoding process, the most likely among the $L$ paths is selected as the single codeword at the decoder output. Simulations show that the resulting performance is very close to that of maximum-likelihood decoding, even for moderate values of $L$ . Alternatively, if a genie is allowed to pick the transmitted codeword from the list, the results are comparable with the performance of current state-of-the-art LDPC codes. We show that such a genie can be easily implemented using simple CRC precoding. The specific list-decoding algorithm that achieves this performance doubles the number of decoding paths for each information bit, and then uses a pruning procedure to discard all but the $L$ most likely paths. However, straightforward implementation of this algorithm requires $\Omega (L n^{2})$ time, which is in stark contrast with the $O(n \log n)$ complexity of the original successive-cancellation decoder. In this paper, we utilize the structure of polar codes along with certain algorithmic transformations in order to overcome this problem: we devise an efficient, numerically stable, implementation of the proposed list decoder that takes only $O(L n \log n)$ time and $O(L n)$ space.