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.

Some Remarks Concerning Contraction Mappings

Abstract: The following result is proved in [1, p. 6]. Theorem 1. Let X be a complete metric space, and let T and Tn(n = 1, 2,…)be contraction mappings of X into itself with the same Lipschitz constant k<1, and with fixed points u and un respectively. Suppose that limn → ∞ Tn(x) = T(x) for every x ∊ X. Then limn → ∞ un = u.

Properties of basal dendrites of layer 5 pyramidal neurons: a direct patch-clamp recording study.

Abstract: Basal dendrites receive the majority of synapses that contact neocortical pyramidal neurons, yet our knowledge of synaptic processing in these dendrites has been hampered by their inaccessibility for electrical recordings. A new approach to patch-clamp recordings enabled us to characterize the integrative properties of these cells. Despite the short physical length of rat basal dendrites, synaptic inputs were electrotonically remote from the soma (>30-fold excitatory postsynaptic potential (EPSP) attenuation) and back-propagating action potentials were significantly attenuated. Unitary EPSPs were location dependent, reaching large amplitudes distally (>8 mV), yet their somatic contribution was relatively location independent. Basal dendrites support sodium and NMDA spikes, but not calcium spikes, for 75% of their length. This suggests that basal dendrites, despite their proximity to the site of action potential initiation, do not form a single basal-somatic region but rather should be considered as a separate integrative compartment favoring two integration modes: subthreshold, location-independent summation versus local amplification of incoming spatiotemporally clustered information.

Efficient search for approximate nearest neighbor in high dimensional spaces

Abstract: We address the problem ofdesigning data structures that allow efficient search f or approximate nearest neighbors. More specifically, given a database consisting ofa set ofvectors in some high dimensional Euclidean space, we want to construct a space-efficient data structure that would allow us to search, given a query vector, for the closest or nearly closest vector in the database. We also address this problem when distances are measured by the L1 norm and in the Hamming cube. Significantly improving and extending recent results ofKleinberg, we construct data structures whose size is polynomial in the size ofthe database and search algorithms that run in time nearly linear or nearly quadratic in the dimension. (Depending on the case, the extra factors are polylogarithmic in the size ofthe database.)

Principles of Concurrent and Distributed Programming

Abstract: I CONCURRENT PROGRAMMING: 1. What is Concurrent Programming? 2. The Concurrent Programming Abstraction. 3. The Mutal Exclusion Problem. 4. Semaphores. 5. Monitors. 6. the Problem of Dining Philosophers. II DISTRIBUTED PROGRAMMING. 7. Distributed Programming Models. 8. Ada. 9. occam. 10. Linda. 11. Distributed Mutual Exclusion. 12. Distributed Termination. 13. The Byzantine Generals Problem. III. IMPLEMENTATION PRINCIPLES: 14. Single Processor Implementation. 15. Multi-processor Implementation. 16. Real-Time Programming. Appendix A: Ada Overview. B: Concurrent Programs in Ada. C: Implementation of the Ada Emulations. D: Distributed Algoriths in Ada. Biblography. Index.

QoS routing in networks with inaccurate information: theory and algorithms

Abstract: This paper investigates the problem of routing flows with quality-of-service (QoS) requirements through one or more networks, when the information available for making such routing decisions is inaccurate. Inaccuracy in the information used in computing QoS routes, e.g., network state such as link and node metrics, arises naturally in a number of different environments that are reviewed in the paper. The goal is to determine the impact of such inaccuracy on the ability of the path-selection process to successfully identify paths with adequate available resources. In particular, we focus on devising algorithms capable of selecting path(s) that are most likely to successfully accommodate the desired QoS, in the presence of uncertain network state information for the purpose of the analysis, we assume that this uncertainty is expressed through probabilistic models, and we briefly discuss sample cases that can give rise to such models. We establish that the impact of uncertainty is minimal for flows with only bandwidth requirements, but that it makes path selection intractable when end-to-end delay requirements are considered. For this latter case, we provide efficient solutions for special cases of interest and develop useful heuristics.