9 resultados para 1883-1894

em Boston University Digital Common


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Sketch of life

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/alexandermackay00unknuoft/

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/hindrancestothew00unknuoft

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/johnludwigkrapfe00kretiala

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/maryandifortyyea00riggrich

Relevância:

10.00% 10.00%

Publicador:

Resumo:

http://www.archive.org/details/twentyfiveyears00wattuoft

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this report, we extend our study of the intensity of mistreatment in distributed caching groups due to state interaction. In our earlier work (published as BUCS-TR-2006-003), we analytically showed how this type of mistreatment may appear under homogeneous demand distributions. We provided a simple setting where mistreatment due to state interaction may occur. According to this setting, one or more "overactive" nodes generate disproportionately more requests than the other nodes. In this report, we extend our experimental evaluation of the intensity of mistreatment to which non-overactive nodes are subjected, when the demand distributions are not homogeneous.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

The problem of discovering frequent arrangements of temporal intervals is studied. It is assumed that the database consists of sequences of events, where an event occurs during a time-interval. The goal is to mine temporal arrangements of event intervals that appear frequently in the database. The motivation of this work is the observation that in practice most events are not instantaneous but occur over a period of time and different events may occur concurrently. Thus, there are many practical applications that require mining such temporal correlations between intervals including the linguistic analysis of annotated data from American Sign Language as well as network and biological data. Two efficient methods to find frequent arrangements of temporal intervals are described; the first one is tree-based and uses depth first search to mine the set of frequent arrangements, whereas the second one is prefix-based. The above methods apply efficient pruning techniques that include a set of constraints consisting of regular expressions and gap constraints that add user-controlled focus into the mining process. Moreover, based on the extracted patterns a standard method for mining association rules is employed that applies different interestingness measures to evaluate the significance of the discovered patterns and rules. The performance of the proposed algorithms is evaluated and compared with other approaches on real (American Sign Language annotations and network data) and large synthetic datasets.