Search results for "data structure"

showing 10 items of 441 documents

Hybrid segmentation and exploration of the human lungs

2004

Segmentation of the tracheo-bronchial tree of the lungs is notoriously difficult. This is due to the fact that the small size of some of the anatomical structures is subject to partial volume effects. Furthermore, the limited intensity contrast between the participating materials (air, blood, and tissue) increases the segmentation of difficulties. In this paper, we propose a hybrid segmentation method which is based on a pipeline of three segmentation stages to extract the lower airways down to the seventh generation of the bronchi. User interaction is limited to the specification of a seed point inside the easily detectable trachea at the upper end of the lower airways. Similarly, the comp…

medicine.medical_specialtyLungComputer scienceAnatomical structuresPartial volumeImage segmentationrespiratory systemrespiratory tract diseasesTree (data structure)medicine.anatomical_structuremedicineSegmentationRadiologyRespiratory systemAirwayBiomedical engineeringIEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control
researchProduct

ON-LINE CONSTRUCTION OF A SMALL AUTOMATON FOR A FINITE SET OF WORDS

2012

In this paper we describe a "light" algorithm for the on-line construction of a small automaton recognising a finite set of words. The algorithm runs in linear time. We carried out good experimental results on real dictionaries, on biological sequences and on the sets of suffixes (resp. factors) of a set of words that shows how our automaton is near to the minimal one. For the suffixes of a text, we propose a modified construction that leads to an even smaller automaton. We moreover construct linear algorithms for the insertion and deletion of a word in a finite set, directly from the constructed automaton.

minimal automata[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Timed automatondeterministic automataBüchi automaton0102 computer and information sciences02 engineering and technology01 natural sciencesDeterministic automaton0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Two-way deterministic finite automatonNondeterministic finite automatonMathematicsonline construction.Discrete mathematicsSettore INF/01 - InformaticaPowerset constructionPushdown automatonComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)010201 computation theory & mathematicsProbabilistic automaton020201 artificial intelligence & image processingFinite set of wordAlgorithmComputer Science::Formal Languages and Automata Theory
researchProduct

Optimal Spectral Wavelengths for Discriminating Orchard Species Using Multivariate Statistical Techniques

2019

Sustainable management of orchard fields requires detailed information about the tree types, which is a main component of precision agriculture programs. To this end, hyperspectral imagery can play a major role in orchard tree species mapping. Efficient use of hyperspectral data in combination with field measurements requires the development of optimized band selection strategies to separate tree species. In this study, field spectroscopy (350 to 2500 nm) was performed through scanning 165 spectral leaf samples of dominant orchard tree species (almond, walnut, and grape) in Chaharmahal va Bakhtiyari province, Iran. Two multivariable methods were employed to identify the optimum wavelengths:…

optimal spectral wavelengths010504 meteorology & atmospheric sciences0211 other engineering and technologiesRed edge02 engineering and technologyfield spectroscopy; orchards species; ANOVA–RFC–PCA; PLS; optimal spectral wavelengths; discriminant analysis01 natural sciencesPartial least squares regressionlcsh:Science021101 geological & geomatics engineering0105 earth and related environmental sciencesMathematicsRemote sensinganova–rfc–pcaorchards speciesNear-infrared spectroscopyHyperspectral imaging15. Life on landplsLinear discriminant analysisdiscriminant analysisfield spectroscopyRandom forestTree (data structure)Principal component analysisGeneral Earth and Planetary Scienceslcsh:QRemote Sensing
researchProduct

Perfect Hashing Structures for Parallel Similarity Searches

2015

International audience; Seed-based heuristics have proved to be efficient for studying similarity between genetic databases with billions of base pairs. This paper focuses on algorithms and data structures for the filtering phase in seed-based heuristics, with an emphasis on efficient parallel GPU/manycores implementa- tion. We propose a 2-stage index structure which is based on neighborhood indexing and perfect hashing techniques. This structure performs a filtering phase over the neighborhood regions around the seeds in constant time and avoid as much as possible random memory accesses and branch divergences. Moreover, it fits particularly well on parallel SIMD processors, because it requ…

parallelismSimilarity (geometry)OpenCLComputer scienceseed-based heuristicsHash functionSearch engine indexingGPUParallel computingData structureperfect hash functionPattern matchingSIMD[INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]read mapperHeuristicsPerfect hash function2015 IEEE International Parallel and Distributed Processing Symposium Workshop
researchProduct

Computing Subdivision Surface Intersection

2003

Computer surface intersections is fundamental problem in geometric modeling. Any Boolean operation can be seen as an intersection calculation followed by a selection of parts necessary for building the surface of the resulting object. This paper deals with the computing of intersection curveson subdivision surfaces (surfaces generated by the Loop scheme). We present three variants of our algorithm. The first variant calculates this intersection after classification of the object faces into intersecting and non-intersecting pairs of faces. the second variant is based on 1-neighborhood of the intersecting faces. The third variant uses the concept of bipartite graph.

průnik křivekgeometric modellinggeometrické modelovánírežim smyčky[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]intersection curvesčlenění povrchu[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]loop shemesubdivison surfacesComputingMilieux_MISCELLANEOUS[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]ComputingMethodologies_COMPUTERGRAPHICS
researchProduct

Last millennium northern hemisphere summer temperatures from tree rings: Part I: The long term context

2016

Текст статьи не публикуется в открытом доступе в соответствии с политикой журнала. Large-scale millennial length Northern Hemisphere (NH) temperature reconstructions have been progressively improved over the last 20 years as new datasets have been developed. This paper, and its companion (Part II, Anchukaitis et al. in prep), details the latest tree-ring (TR) based NH land air temperature reconstruction from a temporal and spatial perspective. This work is the first product of a consortium called N-TREND (Northern Hemisphere Tree-Ring Network Development) which brings together dendroclimatologists to identify a collective strategy for improving large-scale summer temperature reconstructions…

summer temperatures010506 paleontologyArcheologyGlobal and Planetary Changereconstruction010504 meteorology & atmospheric sciencesCalibration (statistics)34.03.02CMIP5 modelNorthern HemisphereGeologyContext (language use)01 natural sciencesWeightingTerm (time)Tree (data structure)last millenniumClimatologytree-ringsnorthern hemisphereScale (map)Ecology Evolution Behavior and SystematicsGeologyGlobal and Planetary Change0105 earth and related environmental sciences
researchProduct

A Repository for Multirelational Dynamic Networks

2012

Nowadays, WWW contains a number of social media sites, which are growing rapidly. One of the main features of social media sites is to allow to its users creation and modification of contents of the site utilizing the offered WWW interfaces. Such contents are referred to as user generated contents and their type varies from site to site. Social media sites can be modeled as constantly evolving multirelational directed graphs. In this paper we discuss persistent data structures for such graphs, and present and analyze queries performed against the structures. We also estimate the space requirements of the proposed data structures, and compare them with the naive "store each complete snapshot…

ta113Databasebusiness.industryComputer scienceDirected graphcomputer.software_genreData structureData modelingTemporal databaseSnapshot (computer storage)Social mediaPersistent data structurebusinesscomputerContent management2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
researchProduct

A Generic Architecture for a Social Network Monitoring and Analysis System

2011

This paper describes the architecture and a partial implementation of a system designed for the monitoring and analysis of communities at social media sites. The main contribution of the paper is a novel system architecture that facilitates long-term monitoring of diverse social networks existing and emerging at various social media sites. It consists of three main modules, the crawler, the repository and the analyzer. The first module can be adapted to crawl different sites based on ontology describing the structure of the site. The repository stores the crawled and analyzed persistent data using efficient data structures. It can be implemented using special purpose graph databases and/or …

ta113Graph databaseDatabaseRelational databaseComputer scienceSystems architectureGraph (abstract data type)Persistent data structureOntology (information science)computer.software_genreSoftware architectureData structurecomputer2011 14th International Conference on Network-Based Information Systems
researchProduct

Methods for estimating forest stem volumes by tree species using digital surface model and CIR images taken from light UAS

2012

In this paper we consider methods for estimating forest tree stem volumes by species using images taken from light unmanned aircraft systems (UAS). Instead of using LiDAR and additional multiband imagery a color infrared camera mounted to a light UAS is used to acquire both imagery and the DSM of target area. The goal of this study is to accurately estimate tree stem volumes in three classes. The status of the ongoing work is described and an initial method for delineating and classifying treetops is presented.

ta113precision agriculturebusiness.industryComputer scienceUAVtarget detectionPiezo actuatorsmedical imagingairborneFabry-Perot Interferometerimaging spectrometerTree (data structure)Hyperspectral sensorsLidarRemote sensing (archaeology)Computer visionArtificial intelligencemultispectral image sensorsDigital surfacebusinessTree speciesRemote sensingProceedings of SPIE
researchProduct

Lattice Boltzmann Simulations at Petascale on Multi-GPU Systems with Asynchronous Data Transfer and Strictly Enforced Memory Read Alignment

2015

The lattice Boltzmann method is a well-established numerical approach for complex fluid flow simulations. Recently general-purpose graphics processing units have become accessible as high-performance computing resources at large-scale. We report on implementing a lattice Boltzmann solver for multi-GPU systems that achieves 0.69 PFLOPS performance on 16384 GPUs. In addition to optimizing the data layout on the GPUs and eliminating the halo sites, we make use of the possibility to overlap data transfer between the host CPU and the device GPU with computing on the GPU. We simulate flow in porous media and measure both strong and weak scaling performance with the emphasis being on a large scale…

ta113ta114Computer scienceLattice Boltzmann methodsGPUParallel computingSolverLattice Boltzmannmemory alignmentComputational sciencePetascale computingAsynchronous communicationData structure alignmentGraphicsasynchronous communicationTitanHost (network)ComputingMethodologies_COMPUTERGRAPHICSData transmissionEuromicro international conference on parallel, distributed and network-based processing
researchProduct