University of Haifa

About: University of Haifa is a education organization based out in Haifa, Israel. It is known for research contribution in the topics: Population & Poison control. The organization has 7558 authors who have published 27141 publications receiving 711629 citations. The organization is also known as: Haifa University & Universiṭat Ḥefah.

Species richness and the proportion of predatory animal species in temporary freshwater pools: relationships with habitat size and permanence

Abstract: The proportion of predatory animal species is often believed not to vary systematically across communities. However, we predict that larger temporary freshwater pools, and pools that are more permanent, will contain a higher proportion of predatory animal species. In 24 temporary rockpools in Northern Israel (supporting communities dominated by ostracods, copepods, cladocerans, flatworms, dipterans and amphibians), the mean proportion of macroscopic predatory species (averaged over a series of samples) increased with increasing pool area. For the highest possible proportion of predatory species (including microscopic species with uncertain diets), the relationship with pool area was not statistically significant. We did not find significant relationships between permanence and the proportion of either macroscopic or all possible predatory species. Larger pools and pools that were more permanent had more species. Species richness and the proportion of macroscopic predators were positively correlated. These patterns imply that species-poor ecosystems are likely to be functionally different from species-rich systems.

Speech and swallowing disorders in Parkinson disease.

Abstract: Purpose of reviewTo review recent research and clinical studies pertaining to the nature, diagnosis, and treatment of speech and swallowing disorders in Parkinson disease.Recent findingsAlthough some studies indicate improvement in voice and speech with dopamine therapy and deep brain stimulation of

Adapting an immersive virtual reality system for rehabilitation

Abstract: The purpose of this paper is to present an overview of the adaptations that have been done to VividGroup's Gesture Xtreme projected VR scenarios in order to facilitate their use in neurological rehabilitation. First, the scenarios and the adaptation (control of the type, speed, location and direction of all stimuli) are briefly described. The advantages and limitations of the adapted VR system as a rehabilitation tool are presented. Next, initial results and two examples of case studies, one a patient following stroke and one who requires balance training as a result of complete spinal cord injury, are used to illustrate applications of this VR system to rehabilitation. Copyright © 2003 John Wiley & Sons, Ltd.

An algorithm for approximate tandem repeats.

Abstract: A perfect single tandem repeat is defined as a nonempty string that can be divided into two identical substrings, e.g., abcabc. An approximate single tandem repeat is one in which the substrings are similar, but not identical, e.g., abcdaacd. In this paper we consider two criterions of similarity: the Hamming distance (k mismatches) and the edit distance (k differences). For a string S of length n and an integer k our algorithm reports all locally optimal approximate repeats, r = umacro u, for which the Hamming distance of umacro and u is at most k, in O(nk log (n/k)) time, or all those for which the edit distance of umacro and u is at most k, in O(nk log k log (n/k)) time. This paper concentrates on a more general type of repeat called multiple tandem repeats. A multiple tandem repeat in a sequence S is a (periodic) substring r of S of the form r = u(a)u', where u is a prefix of r and u' is a prefix of u. An approximate multiple tandem repeat is a multiple repeat with errors; the repeated subsequences are similar but not identical. We precisely define approximate multiple repeats, and present an algorithm that finds all repeats that concur with our definition. The time complexity of the algorithm, when searching for repeats with up to k errors in a string S of length n, is O(nka log (n/k)) where a is the maximum number of periods in any reported repeat. We present some experimental results concerning the performance and sensitivity of our algorithm. The problem of finding repeats within a string is a computational problem with important applications in the field of molecular biology. Both exact and inexact repeats occur frequently in the genome, and certain repeats occurring in the genome are known to be related to diseases in the human.