Search results for " algorithms"

showing 10 items of 612 documents

Comparison of stereo vision techniques for cloud-top height retrieval

2007

This paper presents an ongoing study for the estimation of the cloud-top height by using only geometrical methods. In agreement with some recent studies showing that it is possible to achieve reliable height estimations not only with the classical methods based on radiative transfer, this article includes a comparison of performances of a selected set of vision algorithms devoted to extract dense disparity maps or motion fields from Infra Red stereo image pairs. This collection includes both area-based techniques and an optical flow-based method and the comparison is accomplished by using a set of cloudy scenes selected from the Along-Track Scanning Radiometer (ATSR2) database. The first gr…

RadiometerSettore INF/01 - Informaticabusiness.industryCloud topComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONOptical flowSet (abstract data type)GeographyStereopsisRadiative transferCloud-top height multi view stereo matching algorithms satellite infra red images optical flow.Computer visionArtificial intelligencebusinessVision algorithmsComputer stereo visionRemote sensing
researchProduct

Maintaining Dynamic Minimum Spanning Trees: An Experimental Study

2010

AbstractWe report our findings on an extensive empirical study on the performance of several algorithms for maintaining minimum spanning trees in dynamic graphs. In particular, we have implemented and tested several variants of the polylogarithmic algorithm by Holm et al., sparsification on top of Frederickson’s algorithm, and other (less sophisticated) dynamic algorithms. In our experiments, we considered as test sets several random, semi-random and worst-case inputs previously considered in the literature together with inputs arising from real-world applications (e.g., a graph of the Internet Autonomous Systems).

Random graphSpanning treeExperimental analysisMinimum spanning tree algorithmsbusiness.industryApplied MathematicsExperimental analysis; Minimum spanning tree algorithms; Dynamic graphsMinimum spanning treeGraphDistributed minimum spanning treedynamic graphs; experimental analysis; minimum spanning tree algorithmsEmpirical researchDynamic problemDiscrete Mathematics and CombinatoricsThe InternetbusinessSettore ING-INF/05 - Sistemi di Elaborazione delle InformazioniAlgorithmMathematicsDynamic graphs
researchProduct

Approximation algorithm for constrained coupled-tasks scheduling problem

2014

International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.

Rate-monotonic schedulingEarliest deadline first schedulingOptimizationBipartite graphMathematical optimizationOpen-shop schedulingSchedulesDistributed computingComplexity theoryProcessor schedulingDynamic priority schedulingApproximation methodscoupled-tasksFair-share schedulingApproximation algorithmsFixed-priority pre-emptive schedulingNurse scheduling problemTwo-level schedulingMathematics[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
researchProduct

An approximate/exact objective based search technique for solving general scheduling problems

2018

Abstract In this paper, we analyze single machine scheduling problems under the following minimization objectives: the maximum completion time (makespan), the total completion time and the maximum lateness, including fundamental practical aspects, which often occur in industrial or manufacturing reality: release dates, due dates, setup times, precedence constraints, deterioration (aging) of machines, as well as maintenance activities. To solve the problems, we propose an efficient representation of a solution and a fast neighborhood search technique, which calculates an approximation of criterion values in a constant time per solution in a neighborhood. On this basis, a novel approximate/ex…

Rate-monotonic schedulingMathematical optimization021103 operations researchSingle-machine schedulingJob shop schedulingComputer science0211 other engineering and technologiesaging effectmetaheuristic02 engineering and technologyDynamic priority schedulingsetup timeFair-share schedulingScheduling (computing)Metaheuristic algorithmsTwo-level scheduling0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingschedulingmaintenance activitySoftwareprecedence constraintsApplied Soft Computing
researchProduct

CAMLearn : a semantic context-aware recommender system architecture : application on m-learning domain

2015

Given the rapid emergence of new mobile technologies and the growth of needs of a moving society in training, works are increasing to identify new relevant educational platforms to improve distant learning. The next step in distance learning is porting e-learning to mobile systems. This is called m-learning. So far, learning environment was either defined by an educational setting, or imposed by the educational content. In our approach, in m-learning, we change the paradigm where the system recommends content and adapts learning follow to learner's context.

RecommandationContexte[SCCO.COMP] Cognitive science/Computer scienceContextCombinatorial algorithmsM-learningWeb sémantiqueRecommendationAlgorithmes combinatoiresSemantic Web
researchProduct

Fitting linear models and generalized linear models with large data sets in R

2009

We present an estimating algorithm to fit linear and generalized linear models not involving the QR decomposition. Some new R functions are presented and discussed. For large data sets, comparisons with respect to the well-known lm() and glm(), as well as to biglm() and bigglm() from the package biglm, show that the proposed functions speed up computation while preserving numerical stability and accuracy

Regression updating methodology and algorithms of statistical computing linear regression generalized linear regression statistical computing R programmingSettore SECS-S/01 - Statistica
researchProduct

The Algorithm of a Game-Based System in the Relation between an Operator and a Technical Object in Management of E-Commerce Logistics Processes with …

2021

Machine learning (ML) is applied in various logistic processes utilizing innovative techniques (e.g., the use of drones for automated delivery in e-commerce). Early challenges showed the insufficient drones’ steering capacity and cognitive gap related to the lack of theoretical foundation for controlling algorithms. The aim of this paper is to present a game-based algorithm of controlling behaviours in the relation between an operator (OP) and a technical object (TO), based on the assumption that the game is logistics-oriented and the algorithm is to support ML applied in e-commerce optimization management. Algebraic methods, including matrices, Lagrange functions, systems of differential e…

Relation (database)Computer scienceProcess (engineering)TP1-1185NotationMachine learningcomputer.software_genreBiochemistryOutcome (game theory)ArticleAnalytical ChemistryMachine LearningSet (abstract data type)Operator (computer programming)machine learning algorithms0502 economics and businessHumanse-commerceComputer SimulationElectrical and Electronic Engineeringa logistics zero-sum gameInstrumentationcomputer.programming_languagebusiness.industryChemical technology05 social sciencesCommerceBayesian networkBayes TheoremPython (programming language)Atomic and Molecular Physics and Opticsa game-based systemBayesian network050211 marketingArtificial intelligencebusinesscomputerAlgorithmAlgorithms050203 business & managementSensors
researchProduct

Integrated Production and Predictive Maintenance Planning based on Prognostic Information

2019

International audience; This paper address the problem of scheduling production and maintenance operation in predictive maintenance context. It proposes a contribution in the decision making phase of the prognostic and health management framework. Theprognostics and decision processes are merged and an ant colony optimization approach for finding the sequence of decisions that optimizes the benefits of a production system is developed. A case study on a single machine composed of several components where machine can have several usage profiles. The results show thatour approach surpasses classical condition based maintenance policy.

Remaining UsefulLife0209 industrial biotechnology021103 operations researchHealth management systemOperations researchComputer scienceCondition-based maintenanceAnt colony optimization algorithms[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]0211 other engineering and technologiesScheduling (production processes)02 engineering and technologyPredictive maintenanceAnt Colony Optimization[SPI.AUTO]Engineering Sciences [physics]/Automatic020901 industrial engineering & automationPrognostic InformationProduction and Maintenance SchedulingPrognosticsIntegrated productionDecision processPredic-tive Maintenance
researchProduct

A reverse engineering approach to measure the deformations of a sailing yacht

2016

In this work, a multidisciplinary experience, aimed to study the permanent deformations of the hull of a regatta sailing yacht is described. In particular, a procedure to compare two different surfaces of the hull of a small sailing yacht, designed and manufactured at the University of Palermo, has been developed. The first one represents the original CAD model while the second one has been obtained by means of a reverse engineering approach. The reverse engineering process was performed through an automatic close-range photogrammetry survey, that has allowed to obtain very accurate measures of the hull, and a 3D modelling step by the well-known 3D computer graphics software Rhinoceros. The…

Reverse engineeringEngineeringProcess (engineering)Mechanical engineeringCADcomputer.software_genre03 medical and health sciences0302 clinical medicine3D computer graphics softwareHull0502 economics and businessGenerative algorithmReverse engineeringSettore ING-IND/15 - Disegno E Metodi Dell'Ingegneria IndustrialeMeasure (data warehouse)business.industry05 social sciences030206 dentistryPhotogrammetryCAE toolClose range photogrammetrySailing yachtSettore ICAR/17 - DisegnoCAE tools; Close range photogrammetry; Generative algorithms; Reverse engineering; Sailing yacht;businesscomputer050203 business & managementSettore ICAR/06 - Topografia E CartografiaMarine engineering
researchProduct

Parallel Genetic Algorithms for the Tuning of a Fuzzy AQM Controller

2003

This paper presents the results of the application of a parallel Genetic Algorithm (GA) in order to design a Fuzzy Proportional Integral (FPI) controller for active queue management on Internet routers. The Active Queue Management (AQM) policies are those policies of router queue management that allow the detection of network congestion, the notification of such occurrences to the hosts on the network borders, and the adoption of a suitable control policy. Two different parallel implementations of the genetic algorithm are adopted to determine an optimal configuration of the FPI controller parameters. Finally, the results of several experiments carried out on a forty nodes cluster of workst…

RouterSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniQueue management systemComputer sciencebusiness.industryDistributed computingFuzzy control systemActive queue managementFuzzy logicNetwork congestionTCP Actuve Queue Management Genetic algorithms Fuzzy logic AQM TCP congestion controlControl theoryGenetic algorithmbusinessComputer network
researchProduct