Search results for "Tree"
showing 10 items of 1841 documents
Tabu search with strategic oscillation for the quadratic minimum spanning tree
2014
The quadratic minimum spanning tree problem consists of determining a spanning tree that minimizes the sum of costs of the edges and pairs of edges in the tree. Many algorithms and methods have been proposed for this hard combinatorial problem, including several highly sophisticated metaheuristics. This article presents a simple Tabu Search (TS) for this problem that incorporates Strategic Oscillation (SO) by alternating between constructive and destructive phases. The commonalties shared by this strategy and the more recently introduced methodology called iterated greedy search are shown and implications of their differences regarding the use of memory structures are identified. Extensive …
Guided local search for the optimal communication spanning tree problem
2011
This paper considers the optimal communication spanning tree (OCST) problem. Previous work analyzed features of high-quality solutions. Consequently, integrating this knowledge into a metaheuristic increases its performance for the OCST problem. In this paper, we present a guided local search (GLS) approach which dynamically changes the objective function to guide the search process into promising areas. In contrast to traditional approaches which reward promising solution features by favoring edges with low weights pointing towards the tree's center, GLS penalizes low-quality edges with large weights that do not point towards the tree's center.
Building Semantic Trees from XML Documents
2016
International audience; The distributed nature of the Web, as a decentralized system exchanging information between heterogeneous sources, has underlined the need to manage interoperability, i.e., the ability to automatically interpret information in Web documents exchanged between different sources, necessary for efficient information management and search applications. In this context, XML was introduced as a data representation standard that simplifies the tasks of interoperation and integration among heterogeneous data sources, allowing to represent data in (semi-) structured documents consisting of hierarchically nested elements and atomic attributes. However, while XML was shown most …
A novel XML document structure comparison framework based-on sub-tree commonalities and label semantics
2012
International audience; XML similarity evaluation has become a central issue in the database and information communities, its applications ranging over document clustering, version control, data integration and ranked retrieval. Various algorithms for comparing hierarchically structured data, XML documents in particular, have been proposed in the literature. Most of them make use of techniques for finding the edit distance between tree structures, XML documents being commonly modeled as Ordered Labeled Trees. Yet, a thorough investigation of current approaches led us to identify several similarity aspects, i.e., sub-tree related structural and semantic similarities, which are not sufficient…
The never-ending story of geologically ancient DNA: was the model plantArabidopsisthe source of Miocene Dominican amber?
2013
Studies characterizing geologically ancient DNA in plants are rare, and all have reportedly obtained plastid DNA sequences from Miocene fossils in a remarkable state of preservation. Recently, a group made the extraordinary claim of having amplified a geologically ancient Miocene plastid DNA fragment (the rbcL gene) from Dominican amber nuggets, and the organismal source of this DNA was identified as Hymenaea protera (Fabaceae), the plant that produced the fossilized Dominican amber. Assuming that the Miocene sequence is error-free, reanalysis of the sequence indicates it is probably a technical artifact or an rbcL pseudogene. Furthermore, BLAST similarity searches and phylogenetic analyses…
Gladius-bearing coleoids from the Upper Cretaceous Lebanese Lagerstätten: diversity, morphology, and phylogenetic implications.
2017
AbstractGladius-bearing coleoids are rare in the fossil record. For the Cretaceous period, these cephalopods are mainly recorded in a few Lagerstätten in Lebanon (Haqel, Hajoula, En Nammoura, and Sahel Aalma). Here, we study 16 specimens of gladius-bearing coleoids from these Upper Cretaceous Lebanese Lagerstätten to investigate their taxonomic diversity. Besides two species that were already reported (Dorateuthis syriacaandGlyphiteuthis libanotica), one new species is identified in the Cenomanian site of Hajoula:Rachiteuthis acutalin. sp., as well as another form ofGlyphiteuthisfrom En Nammoura. Several studied specimens exhibit well-preserved soft-part characters. Among them, we document …
Old World Megadroughts and Pluvials During the Common Era
2015
An atlas of megadroughts in Europe and in the Mediterranean Basin during the Common Era provides insights into climate variability.
Algorithms for the Maximum Weight Connected $$k$$-Induced Subgraph Problem
2014
Finding differentially regulated subgraphs in a biochemical network is an important problem in bioinformatics. We present a new model for finding such subgraphs which takes the polarity of the edges (activating or inhibiting) into account, leading to the problem of finding a connected subgraph induced by \(k\) vertices with maximum weight. We present several algorithms for this problem, including dynamic programming on tree decompositions and integer linear programming. We compare the strength of our integer linear program to previous formulations of the \(k\)-cardinality tree problem. Finally, we compare the performance of the algorithms and the quality of the results to a previous approac…
In-Depth Analysis of Pricing Problem Relaxations for the Capacitated Arc-Routing Problem
2015
Recently, Bode and Irnich [Bode C, Irnich S (2012) Cut-first branch-and-price-second for the capacitated arc-routing problem. Oper. Res. 60(5):1167–1182] presented a cut-first branch-and-price-second algorithm for solving the capacitated arc-routing problem (CARP). The fundamental difference to other approaches for exactly solving the CARP is that the entire algorithm works directly on the typically sparse underlying graph representing the street network. This enables the use of highly efficient dynamic programming-based pricing algorithms to solve the column-generation subproblem also known as the pricing problem. The contribution of this paper is the in-depth analysis of the CARP pricing…
The Role of Contextual Factors in the Influence of ICT on Street-Level Discretion
2017
Public service workers in the frontline have traditionally enjoyed a wide freedom to make decisions during policy implementation. Research shows that technology has both constraining and enabling effects on public service workers affecting their ability to exercise discretion. What remains unclear is under which circumstances discretion is influenced by technology. Using a case study approach and drawing on neo-institutional theory, this paper studies a court to identify contextual factors affecting the phenomenon. Findings show that technology has no unilateral effect on street-level discretion, and is found moderated by contextual factors such as the degree of social complexity in a case,…