We discuss a robust alternative to the ex-post decomposition of a portfolio into the fundamental law co-efficients using statistically estimated breadth. The breadth of a market provides a measure of the number of independent bets available to the investor. We use the Keiser-Gutman stopping criterion to select the integer valued effective dimension eigenvalues greater-than or equal to 1. Such a...

Under the conditions of fasting moving, shape changing and partial occlusion of target, Now mostly tracing algorithms are difficult to get accurate contour of target, for these problems, a novel contour tracing algorithm based on particle filter and fast level set is proposed. Firstly, the particle filter algorithm is adopted to estimate moving target's boundary contour. Then, according to the ...

The electronic stopping cross-section is calculated in the spirit of the Bethe theory. Interaction potential between projectile and target is regarded to have a Coulombic character and we have modified it to take into account velocity dependences on a number of bound electrons of projectile and an effective charge of projectile and target. These velocity dependences are obtained from the Bohr a...

As supervised machine learning methods are increasingly used in language technology, the need for high-quality annotated language data becomes imminent. Active learning (AL) is a means to alleviate the burden of annotation. This paper addresses the problem of knowing when to stop the AL process without having the human annotator make an explicit decision on the matter. We propose and evaluate a...

We examine a model in which the user of an online system continually updates his/her estimated probability of success, and quits or continues according to the expected utility of each action. The prior distribution of the unknown probability is a beta distribution, with mean determined by the a priori expectation of success, and variance determined by the confidence with which the user has that...

Cross-entropy (CE)-based stopping criteria for turbo iterative decoding are known to outperform fixed-iteration stopping criteria at high signal-to-noise ratios (SNRs). While CE-based stopping criteria have a range of thresholds, a highvalue threshold for small frame sizes, and vice versa, should be used. It is difficult to advocate the value that can be categorized as either a small or large f...

SenseClusters is a freely available system that clusters similar contexts. It can be applied to a wide range of problems, although here we focus on word sense and name discrimination. It supports several different measures for automatically determining the number of clusters in which a collection of contexts should be grouped. These can be used to discover the number of senses in which a word i...

In several distributed video coding architectures, a well-known complexity trade-off exists, where the low encoding benefits are paid with a higher decoding complexity. In a feedback channel based DVC architecture, the high decoding complexity is mainly due to the Slepian–Wolf decoding and the repetitive requestdecode operation, especially when there is no initial encoder rate estimation or ite...