Search results for " Algorithms"

showing 10 items of 612 documents

Variable time amplitude amplification and quantum algorithms for linear algebra problems

2012

Quantum amplitude amplification is a method of increasing a success probability of an algorithm from a small epsilon>0 to Theta(1) with less repetitions than classically. In this paper, we generalize quantum amplitude amplification to the case when parts of the algorithm that is being amplified stop at different times. We then apply the new variable time amplitude amplification to give two new quantum algorithms for linear algebra problems. Our first algorithm is an improvement of Harrow et al. algorithm for solving systems of linear equations. We improve the running time of the algorithm from O(k^2 log N) to O(k log^3 k log N) where k is the condition number of the system of equations. …

000 Computer science knowledge general works010201 computation theory & mathematics0103 physical sciencesComputer Science[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information scienceslinear equations010306 general physicsquantum algorithmsamplitude amplification01 natural sciencesquantum computing
researchProduct

A comprehensive probabilistic analysis of approximate SIR‐type epidemiological models via full randomized discrete‐time Markov chain formulation with…

2020

Spanish Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P; Generalitat Valenciana, Grant/Award Number: APOSTD/2019/128; Ministerio de Economia y Competitividad, Grant/Award Number: MTM2017-89664-P

010101 applied mathematicsDiscrete mathematicsMarkov chainDiscrete time and continuous timeGeneral Mathematics010102 general mathematicsGeneral EngineeringProbabilistic analysis of algorithms0101 mathematicsType (model theory)01 natural sciencesMathematicsMathematical Methods in the Applied Sciences
researchProduct

Whole genome sequencing data and de novo draft assemblies for 66 teleost species

2017

Teleost fishes comprise more than half of all vertebrate species, yet genomic data are only available for 0.2% of their diversity. Here, we present whole genome sequencing data for 66 new species of teleosts, vastly expanding the availability of genomic data for this important vertebrate group. We report on de novo assemblies based on low-coverage (9–39×) sequencing and present detailed methodology for all analyses. To facilitate further utilization of this data set, we present statistical analyses of the gene space completeness and verify the expected phylogenetic position of the sequenced genomes in a large mitogenomic context. We further present a nuclear marker set used for phylogenetic…

0106 biological sciences0301 basic medicineStatistics and ProbabilityData DescriptorComputational biologyLibrary and Information Sciences010603 evolutionary biology01 natural sciencesGenomeEducation03 medical and health sciencesbiology.animalGenome assembly algorithmsAnimalsDNA sequencingGenePhylogenyGeneticsWhole genome sequencingGenomeWhole Genome SequencingbiologyPhylogenetic treeComparative genomicsGene treeFishesRobustness (evolution)VertebrateGenomicsComputer Science ApplicationsMetadata030104 developmental biologyStatistics Probability and UncertaintyInformation SystemsScientific Data
researchProduct

Reverse-engineering the Arabidopsis thaliana transcriptional network under changing environmental conditions

2009

46 pages, 4 tables, 6 figures, 3 additinoal files.

0106 biological sciencesMESH: Genome PlantArabidopsis thalianaGene regulatory networkArabidopsis01 natural sciencesTranscriptomeGene Expression Regulation PlantArabidopsisMESH: Gene Expression Regulation DevelopmentalCluster AnalysisGene Regulatory NetworksMESH: ArabidopsisMESH: EcosystemMESH: Models GeneticOligonucleotide Array Sequence AnalysisMESH: Gene Regulatory NetworksGenetics0303 health sciencesMESH: Stress MechanicalbiologyMESH: Genomicsfood and beveragesGene Expression Regulation DevelopmentalGenomicsPhenotypeAlgorithmsGenome PlantMESH: MutationSystems biologyGenomicsMESH: AlgorithmsComputational biologyMESH: Arabidopsis ProteinsMESH: Phenotype03 medical and health sciencesMESH: Gene Expression Profiling[SDV.BBM]Life Sciences [q-bio]/Biochemistry Molecular BiologyMESH: Gene Expression Regulation PlantEcosystem030304 developmental biologyModels GeneticMicroarray analysis techniquesArabidopsis ProteinsGene Expression ProfilingResearchfungiRobustness (evolution)biology.organism_classificationMESH: Cluster AnalysisGene expression profilingMutationMESH: Oligonucleotide Array Sequence AnalysisStress Mechanical010606 plant biology & botany
researchProduct

Online Scheduling of Task Graphs on Hybrid Platforms

2018

Modern computing platforms commonly include accelerators. We target the problem of scheduling applications modeled as task graphs on hybrid platforms made of two types of resources, such as CPUs and GPUs. We consider that task graphs are uncovered dynamically, and that the scheduler has information only on the available tasks, i.e., tasks whose predecessors have all been completed. Each task can be processed by either a CPU or a GPU, and the corresponding processing times are known. Our study extends a previous \(4\sqrt{m/k}\)-competitive online algorithm [2], where m is the number of CPUs and k the number of GPUs (\(m\ge k\)). We prove that no online algorithm can have a competitive ratio …

020203 distributed computingCompetitive analysisonline algorithmsComputer scienceHeuristicSchedulingSymmetric multiprocessor system02 engineering and technologyParallel computingUpper and lower boundsheterogeneous computingGraph020202 computer hardware & architectureScheduling (computing)task graphs0202 electrical engineering electronic engineering information engineeringOnline algorithm[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]
researchProduct

Ant Colony Optimisation-Based Classification Using Two-Dimensional Polygons

2016

The application of Ant Colony Optimization to the field of classification has mostly been limited to hybrid approaches which attempt at boosting the performance of existing classifiers (such as Decision Trees and Support Vector Machines (SVM)) — often through guided feature reductions or parameter optimizations.

0209 industrial biotechnologyBoosting (machine learning)business.industryComputer scienceAnt colony optimization algorithmsDecision treePattern recognition02 engineering and technologyAnt colonycomputer.software_genreSwarm intelligenceSupport vector machineComputingMethodologies_PATTERNRECOGNITION020901 industrial engineering & automationKernel method0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingArtificial intelligenceData miningbusinesscomputer
researchProduct

Generative Design for Additively Manufactured Textiles in Orthopaedic Applications

2021

AbstractThe aim of this work is to implement a new process for the design and production of orthopaedic devices to realize entirely by Additive Manufacturing (AM). In particular, a generative algorithm for parametric modelling of flexible structures to use in orthopaedic devices has been developed. The developed modelling algorithm has been applied to a case study based on the design and production of a customized elbow orthosis made by Selective Laser Sintering. The results obtained have demonstrated that the developed algorithm overcomes many drawbacks typical of traditional CAD modelling approaches. FEM simulations have been also performed to validate the design of the orthosis. The new …

0209 industrial biotechnologyEngineering drawingElbow orthosiComputer scienceProcess (engineering)Additive ManufacturingGenerative algorithmsCADAdditively manufactured textile02 engineering and technology01 natural sciences0104 chemical scienceslaw.invention010404 medicinal & biomolecular chemistrySelective laser sintering020901 industrial engineering & automationlawParametric modellingCAD modellingElbow orthosisGenerative DesignSettore ING-IND/15 - Disegno E Metodi Dell'Ingegneria IndustrialeParametric cadFem simulations
researchProduct

Reliable diagnostics using wireless sensor networks

2019

International audience; Monitoring activities in industry may require the use of wireless sensor networks, for instance due to difficult access or hostile environment. But it is well known that this type of networks has various limitations like the amount of disposable energy. Indeed, once a sensor node exhausts its resources, it will be dropped from the network, stopping so to forward information about maybe relevant features towards the sink. This will result in broken links and data loss which impacts the diagnostic accuracy at the sink level. It is therefore important to keep the network's monitoring service as long as possible by preserving the energy held by the nodes. As packet trans…

0209 industrial biotechnologyGeneral Computer ScienceComputer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]02 engineering and technologyData loss[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]Network topology[SPI.AUTO]Engineering Sciences [physics]/Automatic[INFO.INFO-IU]Computer Science [cs]/Ubiquitous ComputingPrognostics and health management[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]020901 industrial engineering & automation0202 electrical engineering electronic engineering information engineeringAdaBoostElectroniquebusiness.industryNetwork packetGeneral Engineering[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationWireless sensor networksRandom forest[SPI.TRON]Engineering Sciences [physics]/Electronics[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Sensor node020201 artificial intelligence & image processing[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Gradient boosting[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessWireless sensor networkComputer networkComputers in Industry
researchProduct

A novel clustering-based algorithm for solving spatially-constrained robotic task sequencing problems

2021

The robotic task sequencing problem (RTSP) appears in various forms across many industrial applications and consists of developing an optimal sequence of motions to visit a set of target points defined in a task space. Developing solutions to problems involving complex spatial constraints remains challenging due to the existence of multiple inverse kinematic solutions and the requirements for collision avoidance. So far existing studies have been limited to relaxed RTSPs involving a small number of target points and relatively uncluttered environments. When extending existing methods to problems involving greater spatial constraints and large sets of target points, they either require subst…

0209 industrial biotechnologyKinematicsClustering algorithmsService robotsComputer scienceTKComputation02 engineering and technologyKinematicsTask (project management)Reduction (complexity)Set (abstract data type)Settore ING-IND/14 - Progettazione Meccanica E Costruzione Di Macchine020901 industrial engineering & automationoptimal planningSequential analysisRobotic task sequencingElectrical and Electronic EngineeringCluster analysisSequenceCollision avoidanceComputer Science ApplicationsControl and Systems EngineeringmanipulationTask analysisAutonomous inspectionTask analysisAlgorithmIEEE/ASME Transactions on Mechatronics
researchProduct

Metaheuristic procedures for the lexicographic bottleneck assembly line balancing problem

2015

The goal of this work is to develop an improved procedure for the solution of the lexicographic bottleneck variant of the assembly line balancing problem (LB-ALBP). The objective of the LB-ALBP is to minimize the workload of the most heavily loaded workstation, followed by the workload of the second most heavily loaded workstation and so on. This problem-recently introduced to the literature (Pastor, 2011)-has practical relevance to manufacturing facilities. We design, implement and fine-tune GRASP, tabu search (TS) and scatter search (SS) heuristics for the LB-ALBP and show that our procedures are able to obtain solutions of a quality that outperforms previous approaches. We rely on both s…

0209 industrial biotechnologyMathematical optimizationComputer scienceStrategy and Management0211 other engineering and technologiesassembly line balancingheuristics02 engineering and technologyManagement Science and Operations ResearchHeuristic algorithms.BottleneckManagement Information Systemslb-albp020901 industrial engineering & automation:Economia i organització d'empreses [Àrees temàtiques de la UPC]Genetic algorithmgenetic algorithmMetaheuristicsearchMarketingmetaheuristicsmodel021103 operations researchGRASPWorkloadTabu searchmultiplelexicographic bottleneckProgramació heurísticanetworkHeuristicsTreball en cadenaJournal of the Operational Research Society
researchProduct