Partition distance

Patterns of movement through time are important components of animal behavior and key to understanding animal ecology. Due to methodological challenges, including tracing and analyzing movements and their changes, they are seldom studied to identify both seasonal patterns and their driving forces. Using seven GPS-collared red-crowned cranes (Grus japonensis, RCCs), we recorded their moving distances and concurrent climatic data to analyze the relative importance of these factors in RCC movements. Temperature was identified as the most important of these climatic variables in RCC movements.

9p dolomite36 30-12-2021 6 0   Download

Bayesian clustering algorithms, in particular those utilizing Dirichlet Processes (DP), return a sample of the posterior distribution of partitions of a set. However, in many applied cases a single clustering solution is desired, requiring a ’best’ partition to be created from the posterior sample.

10p viconnecticut2711 28-10-2020 13 1   Download

A hypothetical problem which we call a “buried treasure problem” is presented where the objective is to locate m objects among N fixed equi-spaced caches in order to minimize a measure of the risk of loss. The general problem is shown to be NPhard. However, a sub problem may be solved as a special class of TSP in O (N log N) time. Several applications are noted.

10p vinguyentuongdanh 20-12-2018 19 0   Download

Coreferencing entities across documents in a large corpus enables advanced document understanding tasks such as question answering. This paper presents a novel cross document coreference approach that leverages the profiles of entities which are constructed by using information extraction tools and reconciled by using a within-document coreference module. We propose to match the profiles by using a learned ensemble distance function comprised of a suite of similarity specialists.

9p hongphan_1 14-04-2013 54 2   Download

Once you have identified the relevant database(s), use OneSearch to conduct a comprehensive search in those files. In OneSearch you can search up to 60 databases, browse the indexes using the EXPAND command, display records, or use any of the available system features, such as Duplicate Detection and RANK. For more information on using OneSearch or DIALINDEX, refer to the Dialog Pocket Guide, online at support.dialog.com/searchaids/dialog/pocketguide. Step-by-step examples of complete search sessions using DIALINDEX appear below.

216p nhacsihuytuan 13-04-2013 69 4   Download

Let's begin with the picture on the front cover. You may have observed that the portra让of Alan Turing is constructed from a number of pictures ("tiles") of great computer scientists and mathematicians. Suppose you were asked in an interview to design a program that takes an 垃nage and a collection of s x s-sized tiles and produce a mosaic from the tiles that resembles the image. A good way to begin may be to partition the image into s x s-sized squares, compute the average color of each such image square, and then find the tile that is closest to it in the color space. Here distance in...

0p bachduong1311 12-12-2012 40 5   Download