نتایج جستجو برای: bulinus truncates

تعداد نتایج: 486  

Journal: :Language and speech 2006
Mitsuhiko Ota

Recent research indicates that the statistical properties of the input have an impact on the prosodic shape of young children's word production. However, it is still not clear whether the effects of input statistics emerge from the frequency of prosodic structures or the frequency of individual lexical items. This issue is investigated in this study by analyzing cases of word truncation spontan...

Journal: :The Journal of parasitology 1992
F Mouchet A Théron P Brémond E Sellin B Sellin

The emergence pattern of Schistosoma curassoni cercariae from Bulinus umbilicatus, whose adult worms parasitize bovine, caprine, and ovine ungulates in Niger, is of a circadian type with a mean emission time at 0855 hr +/- 1 hr 6 min, characteristic of the schistosome species parasitizing domestic or wild cattle. The comparison of this cercarial emergence pattern with those of the other 3 sympa...

Journal: :Parasitology 1999
C M Davies J P Webster O Krüger A Munatsi J Ndamba M E Woolhouse

The genetic population structures of the freshwater snail Bulinus globosus and its trematode parasite Schistosoma haematobium from 8 river sites in the Zimbabwean highveld were compared using randomly amplified DNA (RAPD) markers. There was significant variability between snail populations collected at different sites, but schistosome populations only showed differentiation at a wider geographi...

Journal: :Annales de Parasitologie Humaine et Comparée 1955

Journal: :Annales de Parasitologie Humaine et Comparée 1962

Journal: :J. Language Modelling 2015
Giorgio Magri

The literature on error-driven learning in Harmonic Grammar (HG) has adopted the Perceptron reweighing rule. Yet, this rule is not suited to HG, as it fails at ensuring non-negative weights. A variant is thus considered which truncates the updates at zero, keeping the weights non-negative. Convergence guarantees and error bounds for the original Perceptron are shown to extend to its truncated v...

2004
Jouni K. Seppänen Heikki Mannila

We consider the problem of how one can estimate the support of Boolean queries given a collection of frequent itemsets. We describe an algorithm that truncates the inclusion-exclusion sum to include only the frequencies of known itemsets, give a bound for its performance on disjunctions of attributes that is smaller than the previously known bound, and show that this bound is in fact achievable...

Journal: :Bulletin of the British Museum (Natural History). 1957

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید