Search results for " Trees"
showing 10 items of 214 documents
Discrete wavelet transform based multispectral filter array demosaicking
2013
International audience; The idea of colour filter array may be adapted to multi-spectral image acquisition by integrating more filter types into the array, and developing associated demosaicking algorithms. Several methods employing discrete wavelet transform (DWT) have been proposed for CFA demosaicking. In this work, we put forward an extended use of DWT for mul-tispectral filter array demosaicking. The extension seemed straightforward, however we observed striking results. This work contributes to better understanding of the issue by demonstrating that spectral correlation and spatial resolution of the images exerts a crucial influence on the performance of DWT based demosaicking.
Split decomposition A technique to analyze viral evolution
1993
A clustering technique allowing a restricted amount of overlapping and based on an abstract theory of coherent decompositions of finite metrics is used to analyze the evolution of foot-and-mouth disease viruses. The emerging picture is compatible with the existence of viral populations with a quasispecies structure and illustrates various forms of evolution of this virus family. In addition, it allows the correlation of these forms with geographic occurrence.
Eupelmus spermophilus Silvestri (Hymenoptera: Chalcidoidea), an Indigenous Olive Seed Wasp Potentially Harmful to Olive Growing in the Western Cape, …
2021
The objectives of this study were the specific taxonomic confirmation of the main olive seed wasp (OSW) attacking commercial olives in the Western Cape, to investigate monitoring methods and seasonal occurrence of OSW, to determine the potential economic damage of infestations, and to ascertain the geographic distribution of OSW in the regions where olives are cultivated in the Western Cape. Morphological and molecular methods were used to identify all the species obtained from cultivated olives at two trial sites near Stellenbosch and Agter-Paarl. Eupelmus spermophilus Silvestri (Hymenoptera: Chalcidoidea) was by far the most frequent and widespread olive seed wasp. Monitoring with yellow …
Finding k -dissimilar paths with minimum collective length
2018
Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohibitively expensive computational cost. To achieve scalability, we also define the much smaller set …
Completely independent spanning trees in some regular graphs
2014
International audience; Let k >= 2 be an integer and T-1,..., T-k be spanning trees of a graph G. If for any pair of vertices {u, v} of V(G), the paths between u and v in every T-i, 1 <= i <= k, do not contain common edges and common vertices, except the vertices u and v, then T1,... Tk are completely independent spanning trees in G. For 2k-regular graphs which are 2k-connected, such as the Cartesian product of a complete graph of order 2k-1 and a cycle, and some Cartesian products of three cycles (for k = 3), the maximum number of completely independent spanning trees contained in these graphs is determined and it turns out that this maximum is not always k. (C) 2016 Elsevier B.V. All righ…
Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
2017
International audience; The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by dening (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges, respectively) that are shared by more than one tree. We illustrate how (i, j)-disjoint spanning trees provide some nuances between the existence of disjoint connected dominating sets and completely independent spanning trees. We prove that determining if there exist two (i, j)-disjoint spanning trees in a graph G is NP-comple…
Plaid model for microarray data: an enhancement of the pruning step
2010
Microarrays have become a standard tool for studying gene functions. For example, we can investigate if a subset of genes shows a coherent expression pattern under different conditions. The plaid model, a model-based biclustering method, can be used to incorporate the addiction structure used for the microarray experiment. In this paper we describe an enhancement for the plaid model algorithm based on the theory of the false discovery rate.
Polish is quantitatively different on quartzite flakes used on different worked materials.
2020
Metrology has been successfully used in the last decade to quantify use-wear on stone tools. Such techniques have been mostly applied to fine-grained rocks (chert), while studies on coarse-grained raw materials have been relatively infrequent. In this study, confocal microscopy was employed to investigate polished surfaces on a coarse-grained lithology, quartzite. Wear originating from contact with five different worked materials were classified in a data-driven approach using machine learning. Two different classifiers, a decision tree and a support-vector machine, were used to assign the different textures to a worked material based on a selected number of parameters (Mean density of furr…
The pruning-grafting lattice of binary trees
2008
AbstractWe introduce a new lattice structure Bn on binary trees of size n. We exhibit efficient algorithms for computing meet and join of two binary trees and give several properties of this lattice. More precisely, we prove that the length of a longest (resp. shortest) path between 0 and 1 in Bn equals to the Eulerian numbers 2n−(n+1) (resp. (n−1)2) and that the number of coverings is (2nn−1). Finally, we exhibit a matching in a constructive way. Then we propose some open problems about this new structure.
Local old olive landrace varieties in Israel—Valuable plant genetic resources in olive cultivation
2008
It is assumed that the cultivation of olive trees started in the East Mediterranean in the third millennia BCE. Throughout history and until recently, successful olive clones were maintained vegetatively and were grafted either on seedlings or on spheroblasts removed from the base of the trunk. It therefore can be hypothesized that local old olive trees, older than 500 years might represent an ancient gene pool. Modern terminology categorizes local genotypes into four main variety groups. However, in traditional terminology these were further differentiated into 27 cultivars according to their phenotypic traits. This genetic diversity, along with the fact that olive trees have been cultivat…