Search results for " trees."

showing 10 items of 207 documents

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 …

EupelmidaebiologySpermophilusEupelmidae fruit susceptibility geographic distribution monitoring seasonal occurrence wild olive yield lossesHymenopterabiology.organism_classificationmedicine.disease_causeOlive treesHorticultureInsect ScienceYield (wine)InfestationmedicineKey (lock)PEST analysisAgronomy and Crop ScienceEcology Evolution Behavior and SystematicsAfrican Entomology
researchProduct

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 …

FOS: Computer and information sciencesComputer scienceDatabases (cs.DB)0102 computer and information sciences02 engineering and technology01 natural sciencesSet (abstract data type)Exact algorithmComputer Science - Databases010201 computation theory & mathematicsIterated function020204 information systemsComputer Science - Data Structures and AlgorithmsShortest path problemScalabilityPath (graph theory)0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)Pairwise comparisonPruning (decision trees)AlgorithmProceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
researchProduct

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…

FOS: Computer and information sciences[ MATH ] Mathematics [math]Discrete Mathematics (cs.DM)Small Depths0102 computer and information sciences02 engineering and technology[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesCombinatoricssymbols.namesakeCompletely independent spanning treeFOS: Mathematics0202 electrical engineering electronic engineering information engineeringCartesian productDiscrete Mathematics and CombinatoricsMathematics - Combinatorics[MATH]Mathematics [math]MathematicsConstructionSpanning treeSpanning treeApplied MathematicsComplete graph020206 networking & telecommunications[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Cartesian productIndependent spanning treesGraphPlanar graphPlanar Graphs010201 computation theory & mathematicssymbolsCompletely independent spanning tree.Combinatorics (math.CO)Computer Science - Discrete Mathematics
researchProduct

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…

FOS: Computer and information sciences[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Discrete Mathematics (cs.DM)Spanning trees[ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]0102 computer and information sciences02 engineering and technologyMinimum spanning tree[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]01 natural sciencesConnected dominating setCombinatorics[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsGridMathematicsMinimum degree spanning treeDiscrete mathematics020203 distributed computingTrémaux treeSpanning treeApplied MathematicsShortest-path treeWeight-balanced tree[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM]Disjoint connected dominating setsIndependent spanning trees[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsReverse-delete algorithmCompletely independent spanning treesComputer Science - Discrete MathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

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.

False discovery rateStructure (mathematical logic)MicroarrayMicroarray Plaid model pruning step.Microarray analysis techniquesComputer sciencefood and beveragescomputer.software_genreBiclusteringDNA microarray experimentPruning (decision trees)Data miningDNA microarraySettore SECS-S/01 - Statisticacomputer
researchProduct

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…

Future studiesConfocal MicroscopyDecision AnalysisLithologyRaw MaterialsAntlersBone imagingPlant Science01 natural sciencesDiagnostic RadiologyMedicine and Health Sciences0601 history and archaeologyElectron MicroscopyAnimal AnatomyMaterialsMicroscopyMultidisciplinary060102 archaeologyPlant AnatomyRadiology and ImagingQRLight Microscopy06 humanities and the artsQuartzWoodBone ImagingProcess EngineeringPhysical SciencesMedicineEngineering and TechnologyScanning Electron MicroscopyAnatomyManagement EngineeringGeologyResearch Article010506 paleontologyImaging TechniquesScienceMaterials ScienceMineralogyIndustrial ProcessesResearch and Analysis MethodsDiagnostic MedicineIndustrial Engineering0105 earth and related environmental sciencesSurface TreatmentsDecision TreesBiology and Life SciencesManufacturing ProcessesSample size determinationZoologyPloS one
researchProduct

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.

General Computer ScienceMatching (graph theory)Distribution sequences0102 computer and information sciencesFeasible sequences01 natural sciencesTheoretical Computer ScienceCombinatoricsCatalan numbersymbols.namesakeLattice (order)[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsBinary tree010102 general mathematicsEulerian pathLatticesJoin (topology)Binary trees010201 computation theory & mathematicsShortest path problemPath (graph theory)symbolsCatalan numbersComputer Science(all)
researchProduct

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…

Genetic diversityRange (biology)Plant SciencePhenotypic traitBiologyOlive treesAgronomyBotanyCultivarGene poolRootstockAgronomy and Crop ScienceEcology Evolution Behavior and SystematicsSelection (genetic algorithm)Israel Journal of Plant Sciences
researchProduct

Genetic similarity among Tunisian cultivated olive estimated through SSR markers

2013

Olive (Olea europaea L. subsp. europaea var. europaea) is one of the oldest fruit tree in the Mediterranean basin, and is cultivated for oil and canned fruit. Part of this interest is driven by the economic importance of olive oil which is increasing throughout the world due to its beneficial effect to human health. In Tunisia, olive has great socio-economic importance, with more than 60 millions olive trees cultivated for olive oil production including a wide range of cultivars which are widely extended from the north to the south regions of the country for its high economic value. Here, we applied microsatellites (SSRs) molecular markers to assess the genetic variability of the most impor…

Genetic diversitymicrosatellitebiologyGenetic relationshipDendrogramfood and beveragesMicrosatellitegenetic diversitybiology.organism_classificationMediterranean Basinlcsh:S1-972Genetic diversityOlive treesSettore AGR/03 - Arboricoltura Generale E Coltivazioni ArboreeGenetic diversity; Genetic relationships; Microsatellite; Olea europaeagenetic relationshipsOleaBotanyAnimal Science and ZoologyCultivarGenetic variabilitylcsh:Agriculture (General)Olea europaeaAgronomy and Crop ScienceFruit tree
researchProduct

Centennial olive trees as a reservoir of genetic diversity

2011

†Background and Aims Genetic characterization and phylogenetic analysis of the oldest trees could be a powerful tool both for germplasm collection and for understanding the earliest origins of clonally propagated fruit crops. The olive tree (Olea europaea L.) is a suitable model to study the origin of cultivars due to its long lifespan, resulting in the existence of both centennial and millennial trees across the Mediterranean Basin. †Methods The genetic identity and diversity as well as the phylogenetic relationships among the oldest wild and cultivated olives of southern Spain were evaluated by analysing simple sequence repeat markers. Samples from both the canopy and the roots of each tr…

GermplasmPlant ScienceBiologyGenes PlantPlant RootsMediterranean Basintraditional cultivarsdomesticationOleaBotanyCultivarDomesticationOlea europaeaPhylogenyGenetic diversityPhylogenetic treeGenetic Variationfood and beverageswild olivesOriginal Articlesmicrosatellite markersbiology.organism_classificationOlive treesPlant Leavesintracultivar variabilitySpainOleaMicrosatellite Repeatsin situ conservation
researchProduct