K advertising, including sponsored links and contextual advertising, powers many of today’s online information services such as search engines and Internet-based emails. This paper examines the design of keyword auctions, a novel mechanism that keyword advertising providers such as Google and Yahoo! use to allocate advertising slots. In our keyword auction model, advertisers bid their willingne...

Secret Sharing from the perspective of threshold schemes has been wellstudied over the past decade. Threshold schemes, however, can only handle a small fraction of the secret sharing functions which we may wish to form. For example, if it is desirable to divide a secret among four participants A , B: C, and D in such a way that either A together with B can reconstruct the secret or C together w...

In this article we report on a study of how to use the context tree weight-ing (CTW) algorithm for lossless image compression. This algorithm has been shown to perform optimally, in terms of redundancy, for a wide class of data sources. Our study shows that this algorithm can successfully be applied to image compression even in its basic form. We also report on possible modiica-tions of the bas...

The context-tree weighting algorithm [4] is a universal source coding algorithm for binary tree sources. In [2] the algorithm is modified for byte-oriented tree sources. This paper describes the context-tree branch-weighting algorithm, which can reduce the number of parameters for such sources, without increasing the complexity significantly.

Optimum weighting ratios of maternal:direct EBV for litter size using an animal model were examined to achieve maximum genetic improvement (direct plus maternal response). Stochastic simulation of a 120-sow herd over a 10-yr period of selection was used (20 replicates). Directional selection was based on a merit function of maternal and direct EBV for first-parity litter size. Optimum weighting...

The context-tree weighting method (Willems, Shtarkov, and Tjalkens [1995]) is a sequential universal source coding method that achieves the Rissanen lower bound [1984] for tree sources. The same authors also proposed context-tree maximizing, a two-pass version of the context-tree weighting method [1993]. Later Willems and Tjalkens [1998] described a method based on ratios (betas) of sequence pr...

Abstract Scientific and effective water allocation schemes are crucial for managing resources. Traditional built on an annual basis fixed. However, because of the drastic spatio-temporal fluctuations in availability demand resources, fixed impracticable. This work proposed a dynamic mechanism that can divide into monthly scales dynamically correct to make them adapt above fluctuations. First, t...

These last years, main IT companies have build software solutions and change management plans promoting data quality management within organizations concerned by the enhancement of their business intelligence system. These offers are closely similar data governance schemes based on a common paradigm called Master Data Management. These schemes appear generally inappropriate to the context of co...