1,721,793 research outputs found
Fine-Grained Complexity of Earth Mover’s Distance Under Translation
Publisher Copyright: © Karl Bringmann, Frank Staals, Karol Węgrzycki, and Geert van Wordragen.The Earth Mover’s Distance is a popular similarity measure in several branches of computer science. It measures the minimum total edge length of a perfect matching between two point sets. The Earth Mover’s Distance under Translation (EMDuT) is a translation-invariant version thereof. It minimizes the Earth Mover’s Distance over all translations of one point set. For EMDuT in R1, we present an Oe(n2)-time algorithm. We also show that this algorithm is nearly optimal by presenting a matching conditional lower bound based on the Orthogonal Vectors Hypothesis. For EMDuT in Rd, we present an Oe(n2d+2)-time algorithm for the L1 and L∞ metric. We show that this dependence on d is asymptotically tight, as an no(d)-time algorithm for L1 or L∞ would contradict the Exponential Time Hypothesis (ETH). Prior to our work, only approximation algorithms were known for these problems.Peer reviewe
Chondromas
Definition: Intramedullary neoplasm made of well-differentiated hyaline cartilage
Osteochondromas
Definition: Benign cartilaginous neoplasm arising from the surface of the bone, histologically mimicking abnormal epiphyseal plate which grows and matures according to normal enchondral ossification
Nearest Neighbor Searching in a Dynamic Simple Polygon
In the nearest neighbor problem, we are given a set S of point sites that we want to store such that we can find the nearest neighbor of a (new) query point efficiently. In the dynamic version of the problem, the goal is to design a data structure that supports both efficient queries and updates, i.e. insertions and deletions in S. This problem has been widely studied in various settings, ranging from points in the plane to more general distance measures and even points within simple polygons. When the sites do not live in the plane but in some domain, another dynamic problem arises: what happens if not the sites, but the domain itself is subject to updates?
Updating sites often results in local changes to the solution or data structure, while updating the domain may incur many global changes. For example, in the closest pair problem, inserting a point only requires us to check if this point is in the new closest pair, while updating the domain might change the distances between most pairs of points in our set. Presumably, this is the reason that this form of dynamization has received much less attention. Only some basic problems, such as shortest paths and ray shooting, have been studied in this setting.
Here, we tackle the nearest neighbor problem in a dynamic simple polygon. We allow insertions into both the set of sites and the polygon. An insertion in the polygon is the addition of a line segment starting at the boundary of the polygon. We present a near-linear size -in both the number of sites and the complexity of the polygon- data structure with sublinear update and query time. This is the first nearest neighbor data structure that allows for updates to the domain
Going Beyond Counting First Authors in Author Co-citation Analysis
The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Rare primary malignant bone sarcomas
Rare primary malignant bone sarcomas (RPMBS), other than osteosarcoma, chondrosarcoma, chordoma, and Ewing sarcoma, account for about 5-10% of primary bone tumors and represent a major diagnostic challenge. These tumors include spindle cell and round cell sarcoma entities, hemangiopericytoma-like and vascular tumors. Additionally, several histotypes, traditionally described in the soft tissues, such as myxofibrosarcoma, synovial sarcoma, and malignant peripheral nerve sheath tumor of bone, have been reported in patients with primary bone tumors. While wide surgical resection is the mainstay of local treatment, systemic therapy of these rare entities is controversial. Patients with undifferentiated spindle cell or pleomorphic high-grade tumors of bone, are usually treated with osteosarcoma-like chemotherapy, while patients with round cell and undifferentiated round cell tumors (URCTs), may respond to sarcoma treatment regimens for Ewing sarcoma patients. Studies on analogies and differences among these ultra-rare tumors have seldom been reported. This review describes relevance, clinical aspects, diagnostic procedures, staging, treatment recommendations, and current research in this composite tumor group
Appropriate Similarity Measures for Author Cocitation Analysis
We provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
