Search results for "algorithm"

showing 10 items of 4887 documents

A multiagent system approach for image segmentation using genetic algorithms and extremal optimization heuristics

2006

We propose a new distributed image segmentation algorithm structured as a multiagent system composed of a set of segmentation agents and a coordinator agent. Starting from its own initial image, each segmentation agent performs the iterated conditional modes method, known as ICM, in applications based on Markov random fields, to obtain a sub-optimal segmented image. The coordinator agent diversifies the initial images using the genetic crossover and mutation operators along with the extremal optimization local search. This combination increases the efficiency of our algorithm and ensures its convergence to an optimal segmentation as it is shown through some experimental results.

Extremal optimizationMathematical optimizationSegmentation-based object categorizationbusiness.industryMulti-agent systemCrossoverComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONImage segmentationComputingMethodologies_ARTIFICIALINTELLIGENCEComputer Science::Multiagent SystemsArtificial IntelligenceComputer Science::Computer Vision and Pattern RecognitionSignal ProcessingSegmentationIterated conditional modesLocal search (optimization)Computer Vision and Pattern RecognitionbusinessAlgorithmSoftwareMathematicsPattern Recognition Letters
researchProduct

Strategies for accelerating ant colony optimization algorithms on graphical processing units

2007

Ant colony optimization (ACO) is being used to solve many combinatorial problems. However, existing implementations fail to solve large instances of problems effectively. In this paper we propose two ACO implementations that use graphical processing units to support the needed computation. We also provide experimental results by solving several instances of the well-known orienteering problem to show their features, emphasizing the good properties that make these implementations extremely competitive versus parallel approaches.

Extremal optimizationMathematical optimizationTheoretical computer scienceOptimization problemComputer scienceComputationAnt colony optimization algorithmsArtificial lifeMetaheuristicParallel metaheuristic2007 IEEE Congress on Evolutionary Computation
researchProduct

First search for point sources of high-energy cosmic neutrinos with the ANTARES neutrino telescope

2011

Results are presented of a search for cosmic sources of high-energy neutrinos with the ANTARES neutrino telescope. The data were collected during 2007 and 2008 using detector configurations containing between 5 and 12 detection lines. The integrated live time of the analyzed data is 304 days. Muon tracks are reconstructed using a likelihood-based algorithm. Studies of the detector timing indicate a median angular resolution of 0.5 0.1deg. The neutrino flux sensitivity is 7.5 ¿ 10 -8(E ¿/ GeV) -2 GeV -1 s -1 cm -2 for the part of the sky that is always visible (¿ < -48deg), which is better than limits obtained by previous experiments. No cosmic neutrino sources have been observed.

FLUX[PHYS.ASTR.HE]Physics [physics]/Astrophysics [astro-ph]/High Energy Astrophysical Phenomena [astro-ph.HE]Physics::Instrumentation and Detectorsmedia_common.quotation_subjectAstrophysics::High Energy Astrophysical PhenomenaFOS: Physical sciencesFluxAstrophysics::Cosmology and Extragalactic AstrophysicsAstrophysics01 natural sciencesDeclinationneutrinos; cosmic rays; astroparticle physicscosmic rays0103 physical sciencesAngular resolutionALGORITHMNeutrinosDETECTOR010303 astronomy & astrophysicsCosmic raysmedia_commonHigh Energy Astrophysical Phenomena (astro-ph.HE)PhysicsCOSMIC cancer databaseMuon010308 nuclear & particles physics[SDU.ASTR.HE]Sciences of the Universe [physics]/Astrophysics [astro-ph]/High Energy Astrophysical Phenomena [astro-ph.HE]DetectorneutrinosASTRONOMYAstronomy and Astrophysicsastroparticle physics13. Climate actionSpace and Planetary ScienceSkyFISICA APLICADAddc:520Física nuclearHigh Energy Physics::ExperimentNeutrinoAstroparticle physicsAstrophysics - High Energy Astrophysical Phenomena
researchProduct

On the Greedy Algorithm for the Shortest Common Superstring Problem with Reversals

2015

We study a variation of the classical Shortest Common Superstring (SCS) problem in which a shortest superstring of a finite set of strings $S$ is sought containing as a factor every string of $S$ or its reversal. We call this problem Shortest Common Superstring with Reversals (SCS-R). This problem has been introduced by Jiang et al., who designed a greedy-like algorithm with length approximation ratio $4$. In this paper, we show that a natural adaptation of the classical greedy algorithm for SCS has (optimal) compression ratio $\frac12$, i.e., the sum of the overlaps in the output string is at least half the sum of the overlaps in an optimal solution. We also provide a linear-time implement…

FOS: Computer and information sciences0102 computer and information sciences02 engineering and technologyInformation System01 natural sciencesString (physics)Theoretical Computer ScienceCombinatoricsHigh Energy Physics::TheoryAnalysis of algorithmGreedy algorithmComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)Greedy algorithmFinite setAnalysis of algorithmsMathematicsSuperstring theoryShortest Common SuperstringComputer Science Applications1707 Computer Vision and Pattern RecognitionComputer Science ApplicationsReversalShortest Path Faster Algorithm010201 computation theory & mathematicsCompression ratioSignal Processing020201 artificial intelligence & image processingK shortest path routingInformation Systems
researchProduct

Optimizing colormaps with consideration for color vision deficiency to enable accurate interpretation of scientific data

2018

Color vision deficiency (CVD) affects more than 4% of the population and leads to a different visual perception of colors. Though this has been known for decades, colormaps with many colors across the visual spectra are often used to represent data, leading to the potential for misinterpretation or difficulty with interpretation by someone with this deficiency. Until the creation of the module presented here, there were no colormaps mathematically optimized for CVD using modern color appearance models. While there have been some attempts to make aesthetically pleasing or subjectively tolerable colormaps for those with CVD, our goal was to make optimized colormaps for the most accurate perce…

FOS: Computer and information sciences0301 basic medicineBrightnessVisual perceptionVisionComputer scienceComputer Vision and Pattern Recognition (cs.CV)Computer Science - Computer Vision and Pattern Recognitionlcsh:MedicineSocial SciencesColor Vision Defects01 natural sciencesMass SpectrometryAnalytical ChemistrySecondary Ion Mass SpectrometrySpectrum Analysis TechniquesMathematical and Statistical TechniquesPsychologyComputer visionlcsh:ScienceData ProcessingMultidisciplinaryPhysicsClassical MechanicsOther Quantitative Biology (q-bio.OT)Quantitative Biology - Other Quantitative BiologyChemistryPhysical SciencesRegression AnalysisSensory PerceptionInformation TechnologyStatistics (Mathematics)AlgorithmsColor PerceptionResearch ArticleComputer and Information SciencesColor visionColorFluid MechanicsLinear Regression AnalysisColor spaceResearch and Analysis MethodsContinuum Mechanics010309 optics03 medical and health sciencesSine Waves0103 physical sciencesHumansStatistical MethodsFluid FlowVision OcularHueColor Visionbusiness.industrylcsh:RBiology and Life SciencesFluid Dynamics030104 developmental biologyFOS: Biological scienceslcsh:QArtificial intelligencebusinessMathematical FunctionsMathematicsPhotic StimulationSoftwareNeurosciencePLOS ONE
researchProduct

On the use of approximate Bayesian computation Markov chain Monte Carlo with inflated tolerance and post-correction

2020

Approximate Bayesian computation allows for inference of complicated probabilistic models with intractable likelihoods using model simulations. The Markov chain Monte Carlo implementation of approximate Bayesian computation is often sensitive to the tolerance parameter: low tolerance leads to poor mixing and large tolerance entails excess bias. We consider an approach using a relatively large tolerance for the Markov chain Monte Carlo sampler to ensure its sufficient mixing, and post-processing the output leading to estimators for a range of finer tolerances. We introduce an approximate confidence interval for the related post-corrected estimators, and propose an adaptive approximate Bayesi…

FOS: Computer and information sciences0301 basic medicineStatistics and Probabilitytolerance choiceGeneral MathematicsMarkovin ketjutInference01 natural sciencesStatistics - Computationapproximate Bayesian computation010104 statistics & probability03 medical and health sciencessymbols.namesakeMixing (mathematics)adaptive algorithmalgoritmit0101 mathematicsComputation (stat.CO)MathematicsAdaptive algorithmMarkov chainbayesilainen menetelmäApplied MathematicsProbabilistic logicEstimatorMarkov chain Monte CarloAgricultural and Biological Sciences (miscellaneous)Markov chain Monte CarloMonte Carlo -menetelmätimportance sampling030104 developmental biologyconfidence intervalsymbolsStatistics Probability and UncertaintyApproximate Bayesian computationGeneral Agricultural and Biological SciencesAlgorithm
researchProduct

Inducing the Lyndon Array

2019

In this paper we propose a variant of the induced suffix sorting algorithm by Nong (TOIS, 2013) that computes simultaneously the Lyndon array and the suffix array of a text in $O(n)$ time using $\sigma + O(1)$ words of working space, where $n$ is the length of the text and $\sigma$ is the alphabet size. Our result improves the previous best space requirement for linear time computation of the Lyndon array. In fact, all the known linear algorithms for Lyndon array computation use suffix sorting as a preprocessing step and use $O(n)$ words of working space in addition to the Lyndon array and suffix array. Experimental results with real and synthetic datasets show that our algorithm is not onl…

FOS: Computer and information sciences050101 languages & linguisticsComputer scienceComputationInduced suffix sorting02 engineering and technologySpace (mathematics)law.inventionSuffix sortinglawSuffix arrayComputer Science - Data Structures and Algorithms0202 electrical engineering electronic engineering information engineeringData_FILESPreprocessorData Structures and Algorithms (cs.DS)0501 psychology and cognitive sciencesComputer Science::Data Structures and AlgorithmsTime complexitySettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSettore INF/01 - Informatica05 social sciencesLightweight algorithmSuffix arraySigmaComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Induced suffix sorting; Lightweight algorithms; Lyndon array; Suffix arrayWorking spaceLyndon arrayLightweight algorithms020201 artificial intelligence & image processingAlgorithmComputer Science::Formal Languages and Automata Theory
researchProduct

Combinatorial proofs of two theorems of Lutz and Stull

2021

Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems states that if $K \subset \mathbb{R}^{n}$ is any set with equal Hausdorff and packing dimensions, then $$ \dim_{\mathrm{H}} π_{e}(K) = \min\{\dim_{\mathrm{H}} K,1\} $$ for almost every $e \in S^{n - 1}$. Here $π_{e}$ stands for orthogonal projection to $\mathrm{span}(e)$. The primary purpose of this paper is to present proofs for Lutz and Stull's projection theorems which do not refer to information theoretic concepts. Instead, they will rely on combinatori…

FOS: Computer and information sciences28A80 (primary) 28A78 (secondary)General MathematicskombinatoriikkaCombinatorial proofComputational Complexity (cs.CC)01 natural sciencesCombinatoricsMathematics - Metric GeometryHausdorff and packing measures0103 physical sciencesClassical Analysis and ODEs (math.CA)FOS: Mathematics0101 mathematicsMathematicsAlgorithmic information theoryLemma (mathematics)Euclidean spacePigeonhole principle010102 general mathematicsOrthographic projectionHausdorff spaceMetric Geometry (math.MG)Projection (relational algebra)Computer Science - Computational ComplexityMathematics - Classical Analysis and ODEsfraktaalit010307 mathematical physicsmittateoria
researchProduct

A Big Data Approach for Sequences Indexing on the Cloud via Burrows Wheeler Transform

2020

Indexing sequence data is important in the context of Precision Medicine, where large amounts of ``omics'' data have to be daily collected and analyzed in order to categorize patients and identify the most effective therapies. Here we propose an algorithm for the computation of Burrows Wheeler transform relying on Big Data technologies, i.e., Apache Spark and Hadoop. Our approach is the first that distributes the index computation and not only the input dataset, allowing to fully benefit of the available cloud resources.

FOS: Computer and information sciencesArtificial Intelligence (cs.AI)Computer Science - Distributed Parallel and Cluster ComputingComputer Science - Artificial IntelligenceComputer Science - Data Structures and AlgorithmsData_FILESData Structures and Algorithms (cs.DS)Distributed Parallel and Cluster Computing (cs.DC)
researchProduct

Denoising Autoencoders for Fast Combinatorial Black Box Optimization

2015

Estimation of Distribution Algorithms (EDAs) require flexible probability models that can be efficiently learned and sampled. Autoencoders (AE) are generative stochastic networks with these desired properties. We integrate a special type of AE, the Denoising Autoencoder (DAE), into an EDA and evaluate the performance of DAE-EDA on several combinatorial optimization problems with a single objective. We asses the number of fitness evaluations as well as the required CPU times. We compare the results to the performance to the Bayesian Optimization Algorithm (BOA) and RBM-EDA, another EDA which is based on a generative neural network which has proven competitive with BOA. For the considered pro…

FOS: Computer and information sciencesArtificial neural networkI.2.6business.industryFitness approximationComputer scienceNoise reductionI.2.8MathematicsofComputing_NUMERICALANALYSISComputer Science - Neural and Evolutionary ComputingMachine learningcomputer.software_genreAutoencoderOrders of magnitude (bit rate)Estimation of distribution algorithmBlack boxComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONNeural and Evolutionary Computing (cs.NE)Artificial intelligencebusinessI.2.6; I.2.8computerProceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation
researchProduct