Search results for " algorithms"

showing 10 items of 612 documents

On the Extension of the DIRECT Algorithm to Multiple Objectives

2020

AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…

Control and Optimization0211 other engineering and technologies02 engineering and technologyManagement Science and Operations ResearchMulti-objective optimizationSet (abstract data type)Local optimumoptimointialgoritmitConvergence (routing)0202 electrical engineering electronic engineering information engineeringmultiobjective optimizationmultiple criteria optimizationMathematics021103 operations researchApplied MathematicsPareto principleDIRECT algorithmmonitavoiteoptimointiComputer Science Applicationsglobal convergenceNonlinear systemdeterminantitHausdorff distancemonimuuttujamenetelmät020201 artificial intelligence & image processingHeuristicsdeterministic optimization algorithmsAlgorithmJournal of Global Optimization
researchProduct

Mammographic images segmentation based on chaotic map clustering algorithm

2013

Background: This work investigates the applicability of a novel clustering approach to the segmentation of mammographic digital images. The chaotic map clustering algorithm is used to group together similar subsets of image pixels resulting in a medically meaningful partition of the mammography. Methods: The image is divided into pixels subsets characterized by a set of conveniently chosen features and each of the corresponding points in the feature space is associated to a map. A mutual coupling strength between the maps depending on the associated distance between feature space points is subsequently introduced. On the system of maps, the simulated evolution through chaotic dynamics leads…

Cooperative behaviorClustering algorithmsComputer scienceFeature vectorCorrelation clusteringPhysics::Medical PhysicsMass lesionsMicrocalcificationsImage processingBreast NeoplasmsDigital imageSegmentationBreast cancerImage Processing Computer-AssistedCluster AnalysisHumansRadiology Nuclear Medicine and imagingSegmentationComputer visionCluster analysisFeaturesPixelChaotic maps Clustering algorithms Cooperative behavior Segmentation Mammography Features Mass lesions Microcalcifications Breast cancerbusiness.industrySegmentation-based object categorizationCalcinosisSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)Radiographic Image EnhancementChaotic mapsRadiology Nuclear Medicine and imagingComputer Science::Computer Vision and Pattern RecognitionFemaleArtificial intelligencebusinessAlgorithmsMammographyResearch Article
researchProduct

Decentralized Coordination System for Multiple AGVs in a Structured Environment

2011

Abstract In this paper, we propose a decentralized coordination algorithm for safe and efficient management of a group of mobile robots following predefined paths in a dynamic industrial environment. The proposed algorithm is based on shared resources and proved to guarantee ordered traffic flows avoiding collisions and deadlocks. In consistency with the model of distributed robotic systems (DRS), no centralized mechanism, synchronized clock, shared memory or ground support is needed. A local inter-robot communication is required among a small number of spatially adjacent robotic units.

Coordination algorithms0209 industrial biotechnologyEngineeringbusiness.industryDistributed computingMobile robot0102 computer and information sciences02 engineering and technologyGround support01 natural sciencesComputer Science::RoboticsConsistency (database systems)020901 industrial engineering & automationRobotic systemsShared memorySettore ING-INF/04 - Automatica010201 computation theory & mathematicsCollision avoidance distributed control autonomous vehiclesbusiness
researchProduct

Robust coordinated control algorithm for multiple marine vessels with external disturbances

2013

Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2013/597195 Open Access The problem of coordinated control for multiple marine vessels in the presence of external disturbances is considered in this paper. A robust coordinated control algorithm is proposed for multiple marine vessels. The proposed robust coordinated control algorithm is divided into two parts. The first part develops an extended state observer to estimate the disturbances of marine vessels. The second part presents a robust coordinated control algorithm based on the output of the extended state observer. Furthermore, the rob…

Coordination algorithmsSurface (mathematics)EngineeringControl algorithmArticle Subjectbusiness.industrylcsh:MathematicsGeneral MathematicsControl (management)General EngineeringControl engineeringlcsh:QA1-939lcsh:TA1-2040Control theoryTrajectoryState observerVDP::Matematikk og Naturvitenskap: 400::Matematikk: 410::Anvendt matematikk: 413lcsh:Engineering (General). Civil engineering (General)businessControl methods
researchProduct

A cultural heritage experience for visually impaired people

2020

Abstract In recent years, we have assisted to an impressive advance of computer vision algorithms, based on image processing and artificial intelligence. Among the many applications of computer vision, in this paper we investigate on the potential impact for enhancing the cultural and physical accessibility of cultural heritage sites. By using a common smartphone as a mediation instrument with the environment, we demonstrate how convolutional networks can be trained for recognizing monuments in the surroundings of the users, thus enabling the possibility of accessing contents associated to the monument itself, or new forms of fruition for visually impaired people. Moreover, computer vision …

Cultural heritagePotential impactComputer scienceVisually impairedHuman–computer interactionSettore ING-INF/03 - TelecomunicazioniMediationComputer vision algorithmsImage processingnavigation visually impaired computer vision augmented reality cultural context convolutional neural network machine learning hapticPhysical accessibility
researchProduct

Co-simulation of bio-inspired multi-agent algorithms

2020

This paper reports on the co-simulation of a team of robots deployed in an exploration task, coordinated by a bio-inspired exploration algorithm. The co-simulation integrates the high-level exploration algorithm with detailed implementations of the robot controllers and kinematic models. Co-simulation results are used to find and correct mismatches between submodels.

Cyber-Physical SystemsMap explorationCo-simulationBio-inspired algorithms; Co-simulation; Cyber-Physical Systems; Map explorationBio-inspired algorithms
researchProduct

Comparison of some dispersion-corrected and traditional functionals as applied to peptides and conformations of cyclohexane derivatives.

2012

We compare the energetic and structural properties of fully optimized α-helical and antiparallel β-sheet polyalanines and the energetic differences between axial and equatorial conformations of three cyclohexane derivatives (methyl, fluoro, and chloro) as calculated using several functionals designed to treat dispersion (B97-D, ωB97x-D, M06, M06L, and M06-2X) with other traditional functionals not specifically parametrized to treat dispersion (B3LYP, X3LYP, and PBE1PBE) and with experimental results. Those functionals developed to treat dispersion significantly overestimate interaction enthalpies of folding for the α-helix and predict unreasonable structures that contain Ramachandran φ and …

CyclohexaneChemistryHydrogen bondMolecular biophysicsMolecular ConformationGeneral Physics and AstronomyThermodynamicsAntiparallel (biochemistry)chemistry.chemical_compoundMolecular geometryCyclohexanesComputational chemistryTheoretical Methods and AlgorithmsQuantum TheoryThermodynamicsPhysical and Theoretical ChemistryPeptidesProtein secondary structureBasis setRamachandran plot
researchProduct

FRIPON: a worldwide network to track incoming meteoroids

2020

Context. Until recently, camera networks designed for monitoring fireballs worldwide were not fully automated, implying that in case of a meteorite fall, the recovery campaign was rarely immediate. This was an important limiting factor as the most fragile - hence precious - meteorites must be recovered rapidly to avoid their alteration. Aims. The Fireball Recovery and InterPlanetary Observation Network (FRIPON) scientific project was designed to overcome this limitation. This network comprises a fully automated camera and radio network deployed over a significant fraction of western Europe and a small fraction of Canada. As of today, it consists of 150 cameras and 25 European radio receiver…

DYNAMICS[INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR]MeteorsComputer scienceRadio receiver[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Surveys010502 geochemistry & geophysicsTrack (rail transport)01 natural sciencesMeteorites meteors meteoroidslaw.inventionPlanets and planetary system[INFO.INFO-TS]Computer Science [cs]/Signal and Image ProcessingMethods: observationallaw[INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]meteoroids010303 astronomy & astrophysicsComputingMilieux_MISCELLANEOUSObservational methodsEarth and Planetary Astrophysics (astro-ph.EP)meteoroids -surveys -methods: observational -interplanetary medium[SDU.ASTR]Sciences of the Universe [physics]/Astrophysics [astro-ph]ORIGIN[INFO.INFO-AO]Computer Science [cs]/Computer Arithmeticmeteorites meteors meteoroids – surveys – methods: observational – interplanetary mediumMeteoroidsRECOVERYORBITMeteoriteFully automatedInterplanetary medium; Meteorites meteors meteoroids; Methods: observational; Surveys[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]Astrophysics - Instrumentation and Methods for Astrophysics[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processingFLUXReal-time computingfripon[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]FOS: Physical sciencesContext (language use)CAMERA[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE][SPI.AUTO]Engineering Sciences [physics]/Automatic[SDU.STU.PL]Sciences of the Universe [physics]/Earth Sciences/Planetology0103 physical sciencesFIREBALL NETWORKobservational [Methods]meteorsInstrumentation and Methods for Astrophysics (astro-ph.IM)0105 earth and related environmental sciencesMeteoroidINNISFREE METEORITE[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Astronomy and AstrophysicsMETEORITE FALLMeteorites meteors meteoroidCamera networkSpace and Planetary Science[SDU]Sciences of the Universe [physics]Interplanetary spaceflightmeteroids trackingmeteoroids - surveys - methods: observationalSYSTEMInterplanetary mediumAstrophysics - Earth and Planetary AstrophysicsMeteorites
researchProduct

Analyzing big datasets of genomic sequences: fast and scalable collection of k-mer statistics

2019

Abstract Background Distributed approaches based on the MapReduce programming paradigm have started to be proposed in the Bioinformatics domain, due to the large amount of data produced by the next-generation sequencing techniques. However, the use of MapReduce and related Big Data technologies and frameworks (e.g., Apache Hadoop and Spark) does not necessarily produce satisfactory results, in terms of both efficiency and effectiveness. We discuss how the development of distributed and Big Data management technologies has affected the analysis of large datasets of biological sequences. Moreover, we show how the choice of different parameter configurations and the careful engineering of the …

Data AnalysisFOS: Computer and information sciencesTime FactorsTime FactorComputer scienceStatistics as TopicBig dataApache Spark; distributed computing; performance evaluation; k-mer countinglcsh:Computer applications to medicine. Medical informaticsBiochemistryDomain (software engineering)Databases03 medical and health sciences0302 clinical medicineStructural BiologyComputer clusterStatisticsSpark (mathematics)Molecular Biologylcsh:QH301-705.5030304 developmental biology0303 health sciencesGenomeSettore INF/01 - InformaticaBase SequenceNucleic AcidApache Sparkbusiness.industryResearchApache Spark; Distributed computing; k-mer counting; Performance evaluation; Algorithms; Base Sequence; Software; Time Factors; Data Analysis; Databases Nucleic Acid; Genome; Statistics as TopicApplied Mathematicsk-mer countingDistributed computingComputer Science ApplicationsAlgorithmData AnalysiComputer Science - Distributed Parallel and Cluster Computinglcsh:Biology (General)030220 oncology & carcinogenesisScalabilityPerformance evaluationlcsh:R858-859.7Algorithm designDistributed Parallel and Cluster Computing (cs.DC)Databases Nucleic AcidbusinessAlgorithmsSoftware
researchProduct

New results for finding common neighborhoods in massive graphs in the data stream model

2008

AbstractWe consider the problem of finding pairs of vertices that share large common neighborhoods in massive graphs. We give lower bounds for randomized, two-sided error algorithms that solve this problem in the data-stream model of computation. Our results correct and improve those of Buchsbaum, Giancarlo, and Westbrook [On finding common neighborhoods in massive graphs, Theoretical Computer Science, 299 (1–3) 707–718 (2004)]

Data streamDiscrete mathematicsGeneral Computer ScienceExtremal graph theorySpace lower boundsModel of computationCommunication complexityGraph theoryUpper and lower boundsTheoretical Computer ScienceExtremal graph theoryCombinatoricsGraph algorithms for data streamsAlgorithms Theoretical Computer SciencedGraph algorithmsCommunication complexityComputer Science(all)MathematicsTheoretical Computer Science
researchProduct