Search results for "Algorithm"

showing 10 items of 4887 documents

A Two-Stage Reconstruction of Microstructures with Arbitrarily Shaped Inclusions

2020

The main goal of our research is to develop an effective method with a wide range of applications for the statistical reconstruction of heterogeneous microstructures with compact inclusions of any shape, such as highly irregular grains. The devised approach uses multi-scale extended entropic descriptors (ED) that quantify the degree of spatial non-uniformity of configurations of finite-sized objects. This technique is an innovative development of previously elaborated entropy methods for statistical reconstruction. Here, we discuss the two-dimensional case, but this method can be generalized into three dimensions. At the first stage, the developed procedure creates a set of black synthetic …

FOS: Computer and information sciencesComputer science02 engineering and technologylcsh:Technology01 natural sciencesArticleComputational Engineering Finance and Science (cs.CE)0103 physical sciencesCluster (physics)Effective methodGeneral Materials ScienceComputer Science - Computational Engineering Finance and Sciencelcsh:Microscopy010306 general physicslcsh:QC120-168.85lcsh:QH201-278.5Pixellcsh:Tmulti-scale entropic descriptorsrandom heterogeneous materials021001 nanoscience & nanotechnologyMicrostructureStandard techniqueCement pastetwo-stage reconstructionlcsh:TA1-2040simulated annealing for clustersSimulated annealinglcsh:Descriptive and experimental mechanicslcsh:Electrical engineering. Electronics. Nuclear engineeringlcsh:Engineering (General). Civil engineering (General)0210 nano-technologylcsh:TK1-9971AlgorithmMaterials
researchProduct

Lightweight LCP construction for very large collections of strings

2016

The longest common prefix array is a very advantageous data structure that, combined with the suffix array and the Burrows-Wheeler transform, allows to efficiently compute some combinatorial properties of a string useful in several applications, especially in biological contexts. Nowadays, the input data for many problems are big collections of strings, for instance the data coming from "next-generation" DNA sequencing (NGS) technologies. In this paper we present the first lightweight algorithm (called extLCP) for the simultaneous computation of the longest common prefix array and the Burrows-Wheeler transform of a very large collection of strings having any length. The computation is reali…

FOS: Computer and information sciencesComputer scienceComputation0102 computer and information sciences02 engineering and technologyParallel computing01 natural sciencesGeneralized Suffix ArrayTheoretical Computer Sciencelaw.inventionlawComputational Theory and MathematicComputer Science - Data Structures and AlgorithmsExtended Burrows-Wheeler TransformData_FILES0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsData Structures and Algorithms (cs.DS)Discrete Mathematics and CombinatoricAuxiliary memoryLongest Common Prefix Array; Extended Burrows-Wheeler Transform; Generalized Suffix Array;String (computer science)LCP arraySuffix arrayData structureComputational Theory and Mathematics010201 computation theory & mathematicsLongest Common Prefix Array020201 artificial intelligence & image processingJournal of Discrete Algorithms
researchProduct

A survey of active learning algorithms for supervised remote sensing image classification

2011

Defining an efficient training set is one of the most delicate phases for the success of remote sensing image classification routines. The complexity of the problem, the limited temporal and financial resources, as well as the high intraclass variance can make an algorithm fail if it is trained with a suboptimal dataset. Active learning aims at building efficient training sets by iteratively improving the model performance through sampling. A user-defined heuristic ranks the unlabeled pixels according to a function of the uncertainty of their class membership and then the user is asked to provide labels for the most uncertain pixels. This paper reviews and tests the main families of active …

FOS: Computer and information sciencesComputer scienceComputer Vision and Pattern Recognition (cs.CV)Computer Science - Computer Vision and Pattern RecognitionMachine learningcomputer.software_genreactive learningHyperspectral image classificationEntropy (information theory)Electrical and Electronic EngineeringArchitectureRemote sensingvery high resolution (VHR)PixelContextual image classificationbusiness.industryHyperspectral imagingSupport vector machinehyperspectraltraining set definitionSignal Processingsupport vector machine (SVM)Artificial intelligenceHeuristicsbusinessAlgorithmcomputerimage classification
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

Improving table compression with combinatorial optimization

2002

We study the problem of compressing massive tables within the partition-training paradigm introduced by Buchsbaum et al. [SODA'00], in which a table is partitioned by an off-line training procedure into disjoint intervals of columns, each of which is compressed separately by a standard, on-line compressor like gzip. We provide a new theory that unifies previous experimental observations on partitioning and heuristic observations on column permutation, all of which are used to improve compression rates. Based on the theory, we devise the first on-line training algorithms for table compression, which can be applied to individual files, not just continuously operating sources; and also a new, …

FOS: Computer and information sciencesComputer scienceHeuristic (computer science)E.4G.2.1Data_CODINGANDINFORMATIONTHEORYDisjoint setsTravelling salesman problemPermutationArtificial IntelligenceCompression (functional analysis)Computer Science - Data Structures and AlgorithmsH.1.8H.2.7Data Structures and Algorithms (cs.DS)E.4; F.1.3; F.2.2; G.2.1; H.1.1; H.1.8; H.2.7H.1.1Dynamic programmingHardware and ArchitectureControl and Systems EngineeringCombinatorial optimizationTable (database)F.1.3F.2.2AlgorithmSoftwareInformation SystemsJournal of the ACM
researchProduct

A Review of Multiple Try MCMC algorithms for Signal Processing

2018

Many applications in signal processing require the estimation of some parameters of interest given a set of observed data. More specifically, Bayesian inference needs the computation of {\it a-posteriori} estimators which are often expressed as complicated multi-dimensional integrals. Unfortunately, analytical expressions for these estimators cannot be found in most real-world applications, and Monte Carlo methods are the only feasible approach. A very powerful class of Monte Carlo techniques is formed by the Markov Chain Monte Carlo (MCMC) algorithms. They generate a Markov chain such that its stationary distribution coincides with the target posterior density. In this work, we perform a t…

FOS: Computer and information sciencesComputer scienceMonte Carlo methodMachine Learning (stat.ML)02 engineering and technologyMultiple-try MetropolisBayesian inference01 natural sciencesStatistics - Computation010104 statistics & probabilitysymbols.namesakeArtificial IntelligenceStatistics - Machine Learning0202 electrical engineering electronic engineering information engineering0101 mathematicsElectrical and Electronic EngineeringComputation (stat.CO)Signal processingMarkov chainApplied MathematicsEstimator020206 networking & telecommunicationsMarkov chain Monte CarloStatistics::ComputationComputational Theory and MathematicsSignal ProcessingsymbolsSample spaceComputer Vision and Pattern RecognitionStatistics Probability and UncertaintyAlgorithm
researchProduct

Critical comments on EEG sensor space dynamical connectivity analysis

2019

Many different analysis techniques have been developed and applied to EEG recordings that allow one to investigate how different brain areas interact. One particular class of methods, based on the linear parametric representation of multiple interacting time series, is widely used to study causal connectivity in the brain. However, the results obtained by these methods should be interpreted with great care. The goal of this paper is to show, both theoretically and using simulations, that results obtained by applying causal connectivity measures on the sensor (scalp) time series do not allow interpretation in terms of interacting brain sources. This is because (1) the channel locations canno…

FOS: Computer and information sciencesComputer scienceSocial SciencesTransfer functionStatistics - Applications050105 experimental psychology03 medical and health sciences0302 clinical medicinegranger causalityMVARHumansApplications (stat.AP)Computer Simulation0501 psychology and cognitive sciencesRadiology Nuclear Medicine and imagingBrain connectivityEEGTime domainSpurious relationshipRepresentation (mathematics)Mixing (physics)Parametric statisticsBrain MappingRadiological and Ultrasound TechnologySeries (mathematics)05 social sciencesbrain connectivitysource modellingElectroencephalographyNeurologyFOS: Biological sciencesFrequency domainQuantitative Biology - Neurons and CognitionSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaGranger causalityDirected transfer functionNeurons and Cognition (q-bio.NC)Neurology (clinical)AnatomyAlgorithm030217 neurology & neurosurgery
researchProduct

Some complexity and approximation results for coupled-tasks scheduling problem according to topology

2016

International audience; We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters.

FOS: Computer and information sciencesCoupled-task scheduling model[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Computer science0211 other engineering and technologies0102 computer and information sciences02 engineering and technologyManagement Science and Operations ResearchComputational Complexity (cs.CC)Topology01 natural sciencesExecution timeTheoretical Computer ScienceComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)021103 operations researchJob shop schedulingPolynomial-time approximation algorithmApproximation algorithmCompatibility graphComplexityIdle timeComputer Science ApplicationsComputer Science - Computational Complexity[ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]010201 computation theory & mathematicsCompatibility (mechanics)Bipartite graphMinification
researchProduct

Analyzing multidimensional movement interaction with generalized cross-wavelet transform

2021

Humans are able to synchronize with musical events whilst coordinating their movements with others. Interpersonal entrainment phenomena, such as dance, involve multiple body parts and movement directions. Along with being multidimensional, dance movement interaction is plurifrequential, since it can occur at different frequencies simultaneously. Moreover, it is prone to nonstationarity, due to, for instance, displacements around the dance floor. Various methodological approaches have been adopted for the study of human entrainment, but only spectrogram-based techniques allow for an integral analysis thereof. This article proposes an alternative approach based upon the cross-wavelet transfor…

FOS: Computer and information sciencesDanceComputer sciencetanssiMovementBiophysicsmusiikkiWavelet AnalysisExperimental and Cognitive PsychologyTranslation (geometry)sosiaalinen vuorovaikutus050105 experimental psychologyEntrainmentMethodology (stat.ME)03 medical and health sciences0302 clinical medicinerytmitajuHumans0501 psychology and cognitive sciencesOrthopedics and Sports MedicineliikeanalyysiStatistics - MethodologyMovement (music)signaalinkäsittely05 social sciencesJoint actionGeneral MedicineliikeEntrainment (biomusicology)Time–frequency analysisDyadic interactionTime-frequency analysisDyadic interactionLeader-follower dynamicsSpectrogramsynkronointiAlgorithmRotation (mathematics)030217 neurology & neurosurgery
researchProduct

Multi-scale analysis of the European airspace using network community detection

2014

We show that the European airspace can be represented as a multi-scale traffic network whose nodes are airports, sectors, or navigation points and links are defined and weighted according to the traffic of flights between the nodes. By using a unique database of the air traffic in the European airspace, we investigate the architecture of these networks with a special emphasis on their community structure. We propose that unsupervised network community detection algorithms can be used to monitor the current use of the airspaces and improve it by guiding the design of new ones. Specifically, we compare the performance of three community detection algorithms, also by using a null model which t…

FOS: Computer and information sciencesDatabases FactualDistributed computingSocial SciencesPoison controllcsh:MedicineSociologycommunity detectionData Mininglcsh:SciencePhysicsMultidisciplinaryMathematical modelApplied MathematicsPhysicsCommunity structureComputer Science - Social and Information NetworksAir traffic controlAir TravelSocial NetworksPhysical SciencesInterdisciplinary PhysicsSocial SystemsEngineering and TechnologyFree flightInformation TechnologyNetwork AnalysisAlgorithmsResearch ArticlePhysics - Physics and SocietyComputer and Information SciencesControl (management)FOS: Physical sciencesComputerApplications_COMPUTERSINOTHERSYSTEMSPhysics and Society (physics.soc-ph)Statistical MechanicsDatabasescomplex networkHumansArchitectureNetworks network communities socio-technical system complex systems Air Traffic ManagementSocial and Information Networks (cs.SI)Null modellcsh:RModels TheoreticalSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Computational SociologySignal ProcessingAir trafficlcsh:QMathematics
researchProduct