نتایج جستجو برای: probability ofcommuting pairs

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

1999
Mark J. Rice Arup K. Chakraborty Alexis T. Bell

The distribution of framework Al in ZSM-5 was simulated for various Si/Al ratios and the results used to determine the fraction of Al atoms in next nearest neighbors (NNN) T sites. All the 4-, 5-, and 6-membered rings were identified in the unit cell and the fraction of these rings with 0, 1, 2, and 3 Al was calculated. Lastly, the radial distribution function of Al–Al pairs, the number of Al’s...

Journal: :Evolution; international journal of organic evolution 2002
Martin W G Brinkhof Anton J Cavé Serge Daan Albert C Perdeck

Life-history theory suggests that the variation in the seasonal timing of reproduction within populations may be explained on the basis of individual optimization. Optimal breeding times would vary between individuals as a result of trade-offs between fitness components. The existence of such trade-offs has seldom been tested empirically. We experimentally investigated the consequences of alter...

Journal: :Journal of child language 2004
Tania S Zamuner LouAnn Gerken Michael Hammond

This research explores the role of phonotactic probability in two-year-olds' production of coda consonants. Twenty-nine children were asked to repeat CVC non-words that were used as labels for pictures of imaginary animals. The CVC non-words were controlled for their phonotactic probabilities, neighbourhood densities, word-likelihood ratings, and contained the identical coda across low and high...

Objectives: Different treatment approaches have been introduced for children with Speech Sound Disorders (SSD). Minimal pair intervention, Metaphon therapy, and parents and children together approach as linguistically-based approaches are routinely utilized in this population and both of them shared minimal pairs as a common component. The purpose of the current study was to develop and investi...

Journal: :CoRR 2018
Tetsunao Matsuta Tomohiko Uyematsu

In the successive refinement problem, a fixed-length sequence emitted from an information source is encoded into two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is obtained by one of two codewords, and the other reconstruction is obtained by all two codewords. For this coding problem, we give non-asymptotic inner and outer bounds on...

2008
Eiji Aramaki Takeshi Imai Kengo Miyo Kazuhiko Ohe

Orthographic variance is a fundamental problem for many natural language processing applications. The Japanese language, in particular, contains many orthographic variants for two main reasons: (1) transliterated words allow many possible spelling variations, and (2) many characters in Japanese nouns can be omitted or substituted. Previous studies have mainly focused on the former problem; in c...

2000
Yee Whye Teh Geoffrey E. Hinton

We describe a neurally-inspired, unsupervised learning algorithm that builds a non-linear generative model for pairs of face images from the same individual. Individuals are then recognized by finding the highest relative probability pair among all pairs that consist of a test image and an image whose identity is known. Our method compares favorably with other methods in the literature. The gen...

2007
Xiangyu Duan Jun Zhao Bo Xu

Action-based dependency parsing, also known as deterministic dependency parsing, has often been regarded as a time efficient parsing algorithm while its parsing accuracy is a little lower than the best results reported by more complex parsing models. In this paper, we compare actionbased dependency parsers with complex parsing methods such as all-pairs parsers on Penn Chinese Treebank. For Chin...

Journal: :Journal of forensic sciences 2014
Yan Yang Avi Koffman Gil Hocherman Lawrence M Wein

Firearms identification imaging systems help solve crimes by comparing newly acquired images of cartridge casings or bullets to a database of images obtained from past crime scenes. We formulate an optimization problem that bases its matching decisions not only on the similarity between pairs of images, but also on the time and spatial location of each new acquisition and each database entry. T...

2007
Damien Pitman

We consider a random fitness landscape on the space of haploid diallelic genotypes with n genetic loci, where each genotype is considered either inviable or viable depending on whether or not there are any incompatibilities among its allele pairs. We suppose that each allele pair in the set of all possible allele pairs on the n loci is independently incompatible with probability p = c/(2n). We ...

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

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