We consider search by mobile agents for a hidden, idle target, placed on the infinite line. Feasible solutions are agent trajectories in which all reach target sooner or later. A special feature of our problem is that p-faulty, meaning every attempt to change direction an independent Bernoulli trial with known probability p, where p turn fails. looking minimize worst-case expected termination t...

a procedure is presented that synthesizes fractional crystallization separation processes to obtain pure solids from multi-component solutions. the method includes a procedure to generate a network flow model to identify alternative process designs for fractional crystallization. the main advantage of this systematic procedure with respect to other reported procedures is using non-equilibrium s...

An earlier experiment using a yes-no procedure with a search accuracy task [A.L. Nagy, G. Thomas, Distractor heterogeneity, attention, and color in visual search tasks, Vision Research, 43 (2003) 1541-1552] showed that observers could combine information in different cardinal color mechanisms to facilitate search performance. In the experiments reported here we attempted to replicate these resu...

Basically, medical diagnosis problems are the most effective component of treatment policies. Recently, significant advances have been formed in medical diagnosis fields using data mining techniques. Data mining or Knowledge Discovery is searching large databases to discover patterns and evaluate the probability of next occurrences. In this paper, Bayesian Classifier is used as a Non-linear dat...

In this paper we present a new density estimation algorithm using mixtures of mixtures of Gaussians. The new algorithm overcomes the limitations of the popular Expectation Maximization algorithm. The paper first introduces a new model selection criterion called the Penaltyless Information Criterion, which is based on the Jensen-Shannon divergence. Mean-shift is used to automatically initialize ...

Draft Copy|January 24, 1996|Do not circulate. 0 abstract A exible motif search technique is presented which has two major components: 1. a generalized proole syntax serving as a motif deenition language 2. a motif search method speciically adapted to the problem of nding multiple instances of a motif in the same sequence. The new proole structure, which is the core of the generalized proole syn...

A flexible motif search technique is presented which has two major components: (1) a generalized profile syntax serving as a motif definition language; and (2) a motif search method specifically adapted to the problem of finding multiple instances of a motif in the same sequence. The new profile structure, which is the core of the generalized profile syntax, combines the functions of a variety ...

This paper examines how one can obtain state of the art Chinese word segmentation using global linear models. We provide experimental comparisons that give a detailed road-map for obtaining state of the art accuracy on various datasets. In particular, we compare the use of reranking with full beam search; we compare various methods for learning weights for features that are full sentence featur...

In STOC’16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by importance. That is, if a treasure is in a more important box, then one would like to find it faster. Assuming there are many searchers, the authors suggest that using an algorithm that requires no coordination between searchers can be highly beneficial. Indeed, besides savin...