BACKGROUNDS: Optimization of microbial compositions and load in live food during the process of bioencapsulation is one of the most important concerns in aquaculture, as it can promote the growth and feeding parameters of fish larvae. OBJECTIVES: The aim of this study was to determine the growth and feeding performance of Persian sturgeon larvae fed with bioencapsulated D. magna with Saccharomy...

The prevalence in Chinese of grammatical structures that translate into English in different word orders is an important cause of translation difficulty. While previous work has used phrase-structure parses to deal with such ordering problems, we introduce a richer set of Chinese grammatical relations that describes more semantically abstract relations between words. Using these Chinese grammat...

In earlier work, we have shown that articulation rate in Swedish child-directed speech (CDS) increases as a function of the age of the child, even when utterance length and differences in articulation rate between subjects are controlled for. In this paper we show on utterance level in spontaneous Swedish speech that i) for the youngest children, articulation rate in CDS is lower than in adult-...

The fallacy that a many-period expected-utility maximizer should maximize (a) the expected logarithm of portfolio outcomes or (b) the expected average compound return of his portfolio is now understood to rest upon a fallacious use of the LawofLargc Nurtrbcrs. This paper exposes a more subtle fallacy based upon a fallacious use of the Cenfral-Limit Throrcnr. While the properly normalized produc...

Entropy methods enable a convenient general approach to providing a probability distribution with partial information. The minimum cross-entropy principle selects the distribution that minimizes the Kullback–Leibler divergence subject to the given constraints. This general principle encompasses a wide variety of distributions, and generalizes other methods that have been proposed independently....

k-means++ is a seeding technique for the k-means method with an expected approximation ratio of O(log k), where k denotes the number of clusters. Examples are known on which the expected approximation ratio of k-means++ is Ω(log k), showing that the upper bound is asymptotically tight. However, it remained open whether k-means++ yields an O(1)-approximation with probability 1/poly(k) or even wi...