In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...

We present a novel single facility due-date quotation model and algorithm, and characterize the effectiveness of this algorithm employing the tools of probabilistic analysis. This model is intended to be a building block for the models that we will use to analyze due date quotation in make-to-order supply chains, and we present a summary of these models.

For fixed t ≥ 2, we consider the class of representations of 1 as sum of unit fractions whose denominators are powers of t or equivalently the class of canonical compact t-ary Huffman codes or equivalently rooted t-ary plane “canonical” trees. We study the probabilistic behaviour of the height (limit distribution is shown to be normal), the number of distinct summands (normal distribution), the...

Recently, several latent topic analysis methods such as LSI, pLSI, and LDA have been widely used for text analysis. However, those methods basically assign topics to words, but do not account for the events in a document. With this background, in this paper, we propose a latent topic extracting method which assigns topics to events. We also show that our proposed method is useful to generate a ...

We don’t see doughnut shapes when we look up in the sky. But what if the Earth we live on were shaped like a torus instead of a sphere? This remote, but otherwise intriguing possibility, lead me to explore the formation of islands and pools in a toroidal world. In this exposition, I start with a programming perspective on counting islands and pools, and finish by presenting a probabilistic anal...

Deciding in an efficient way weak probabilistic bisimulation in the context of probabilistic automata is an open problem for about a decade. In this work we close this problem by proposing a procedure that checks in polynomial time the existence of a weak combined transition satisfying the step condition of the bisimulation. This enables us to arrive at a polynomial time algorithm for deciding ...

Useless paths are a chronic problem for marker-passing techniques. We use a prob­ abilistic analysis to justify a method for quickly identifying and rejecting useless paths. Using the same analysis, we identify key conditions and assumptions necessary for marker-passing to perform well.

The recently-introduced OM3 aggregation operators fulfill three appealing properties: they are simultaneously minitive, maxitive, and modular. Among the instances of OM3 operators we find e.g. OWMax and OWMin operators, the famous Hirsch h-index and all its natural generalizations. In this paper the basic axiomatic and probabilistic properties of extended, i.e. in an arity-dependent setting, OM...