Search results for "TASK"

showing 10 items of 1658 documents

How to Enrich Description Logics with Fuzziness

2017

International audience; The paper describes the relation between fuzzy and non-fuzzy description logics. It gives an overview about current research in these areas and describes the difference between tasks for description logics and fuzzy logics. The paper also deals with the transformation properties of description logics to fuzzy logics and backwards. While the process of transformation from a description logic to a fuzzy logic is a trivial inclusion, the other way of reducing information from fuzzy logic to description logic is a difficult task, that will be topic of future work.

[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI]Theoretical computer science[ INFO ] Computer Science [cs]Relation (database)Process (engineering)Computer scienceMathematics::General Mathematics0102 computer and information sciences02 engineering and technology[INFO] Computer Science [cs]01 natural sciencesFuzzy logicTask (project management)[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]Knowledge-based systemsFuzzy Description LogicDescription logicComputer Science::Logic in Computer Science0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs][ INFO.INFO-AI ] Computer Science [cs]/Artificial Intelligence [cs.AI]Semantic WebSemantic WebUncertaintyTransformation (function)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES010201 computation theory & mathematics020201 artificial intelligence & image processingComputingMethodologies_GENERALHardware_LOGICDESIGN
researchProduct

Scheduling independent stochastic tasks on heterogeneous cloud platforms

2019

International audience; This work introduces scheduling strategies to maximize the expected number of independent tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The cloud platform is composed of several types of virtual machines (VMs), where each type has a unitexecution cost that depends upon its characteristics. The amount of budget spent during the execution of a task on a given VM is the product of its execution length by the unit execution cost of that VM. The execution lengths of tasks follow a variety of standard probability distributions (exponential, uniform, halfnormal, etc.), which is known beforehand and whose mean and stand…

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]020203 distributed computingComputer scienceStochastic processbusiness.industryDistributed computing[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Processor schedulingCloud computing02 engineering and technologycomputer.software_genreScheduling (computing)Virtual machine0202 electrical engineering electronic engineering information engineeringTask analysisProbability distribution020201 artificial intelligence & image processing[INFO]Computer Science [cs][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]InterruptHeuristicsbusinesscomputer
researchProduct

Scheduling independent stochastic tasks under deadline and budget constraints

2018

This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Mathematical optimizationOperations researchComputer science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Cloud computing[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]02 engineering and technologyExpected valueTheoretical Computer ScienceScheduling (computing)[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]deadline0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]schedulingComputer Science::Operating SystemsComputingMilieux_MISCELLANEOUSBudget constraint020203 distributed computingcloud platformindependent tasksbusiness.industry[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulationstochastic costAsymptotically optimal algorithmContinuous distributions[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Hardware and ArchitectureProbability distribution[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]020201 artificial intelligence & image processingInterrupt[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessSoftwarebudget
researchProduct

Scheduling stretched coupled-tasks with compatibilities constraints : model, complexity and approximation results for some class of graphs

2014

We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, {\it i.e.}coupled-tasks having the same sub-tasks execution time and idle time duration. We study severals problems in frame works of classic complexity and approximation for which the compatibility graph $G_c$ is bipartite (star, chain, $\ldots$) In such context, we design some efficient polynomial-time approximation algorithms according to difference parameters of the scheduling problem. When $G_c$ is a $k$-stage bipartite graph, we propose, among other, a $\frac{7}{6}$-approximation algorithm when $k=1$, and a $\frac{13}{9}$-approximation…

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC][ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC][INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC]schedulingcoupled-taskscomplexityapproximation algorithmcompatibility graph
researchProduct

Theoretical Aspects of Scheduling Coupled-Tasks in the Presence of Compatibility Graph

2012

International audience; This paper presents a generalization of the coupled-task sche-duling problem introduced by Shapiro \cite{Shapiro}, where considered tasks are subject to incompatibility constraints depicted by an undirected graph. The motivation of this problem comes from data acquisition and processing in a mono-processor torpedo used for underwater exploration. As we add the compatibility graph, we focus on complexity of the problem, and more precisely on the boundary between $\mathcal{P}$ and $\mathcal{NP}$-completeness when some other input parameters are restricted (e.g. the ratio between the durations of the two sub-tasks composing a task): we adapt the global visualization of …

[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO][INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]schedulingComplexitycoupled-tasksARC/ERA rank Aapproximation algorithm[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
researchProduct

''High-Intensity Interval Training in Cardiac Rehabilitation''

2012

Guiraud, Thibaut | Nigam, Anil | Gremeaux, Vincent | Meyer, Philippe | Juneau, Martin | Bosquet, Laurent; International audience; ''High-intensity interval training (HIIT) is frequently used in sports training. The effects on cardiorespiratory and muscle systems have led scientists to consider its application in the field of cardiovascular diseases. The objective of this review is to report the effects and interest of HIIT in patients with coronary artery disease (CAD) and heart failure (HF), as well as in persons with high cardiovascular risk. A non-systematic review of the literature in the MEDLINE database using keywords 'exercise', 'high-intensity interval training', 'interval training'…

[SCCO.NEUR] Cognitive science/NeuroscienceSTEADY-STATE EXERCISERANDOMIZED CONTROLLED-TRIALSTEADY-STATE EXERCISE''CHRONIC HEART-FAILUREPRACTICE GUIDELINES COMMITTEEQUALITY-OF-LIFECHRONIC STABLE ANGINA[ SCCO.NEUR ] Cognitive science/NeuroscienceCORONARY-ARTERY-DISEASESHORT INTERMITTENT RUNSASSOCIATION TASK-FORCE''CHRONIC HEART-FAILURECONTINUOUS MODERATE EXERCISE
researchProduct

Dynamic spatial abilities and learning from animation

2016

International audience; This paper presents part of a wider project to create, validate and apply a comprehensive dynamic spatial ability test suitable for use with learning from animation. Four types of test item were devised (two race tasks and two intercept tasks) and tested with forty undergraduate participants. Absolute and relative speed of the objects as well as trajectory directions were manipulated. Task performances and the effect of the manipulated factors are reported. Comparison with a conventional static spatial ability test revealed little correlation, suggesting that dynamic spatial ability can be regarded as a distinct capacity.

[SCCO.PSYC]Cognitive science/Psychology[SCCO.PSYC] Cognitive science/PsychologySpatial abilitiesTask Performance and Analysis[ SCCO.PSYC ] Cognitive science/PsychologyLearning ExperienceAnimation Processing Model
researchProduct

Task-specific ionic liquid for the depolymerisation of starch-based industrial waste into high reducing sugars

2014

Development of a simple route for the catalytic conversion of starch-based industrial waste (potato peels) and potato starch into reducing sugars was investigated in two ionic liquids for comparison – 1-allyl-3-methylimidazolium chloride [AMIM]Cl and 1-(4-sulfobutyl)-3-methylimidazolium chloride [SBMIM]Cl. Over a two hour period, a 20 wt% solution containing up to 43% and 98% of reducing sugars at low temperature in aqueous [SBMIM]Cl was achieved for the starch-based waste and the potato starch, respectively. In addition, the use of microwave and low frequency ultrasound to perform the depolymerisation of the raw starch-based material was explored and compared with conventional heating proc…

[SDE] Environmental ScienceshydrolyysiStarchtask-specific ionic liquidsultrasoundsChlorideCatalysisIndustrial wasteCatalysismikroaallotchemistry.chemical_compoundHydrolysis[CHIM] Chemical Sciencesmedicine[CHIM]Chemical SciencesOrganic chemistryta116Potato starchComputingMilieux_MISCELLANEOUScarbohydrates reducing sugarsAqueous solutionGeneral Chemistry6. Clean waterchemistry[SDE]Environmental SciencesIonic liquidNuclear chemistrymedicine.drugCatalysis Today
researchProduct

Task design for Engineering Mathematics: process, principles and products

2018

International audience; We present and analyse principles and process employed at the Danish Technical University to use authentic problems from engineering (APE) in a first year mathematics course, along with some of the products (actual student assignments).

[SHS.EDU]Humanities and Social Sciences/Education[MATH.MATH-HO]Mathematics [math]/History and Overview [math.HO]Task DesignMathematics for EngineersDidactic Transposition
researchProduct

La catégorisation d'un exogroupe à travers une tâche d'association de mots

2001

International audience

[SHS.PSY] Humanities and Social Sciences/Psychology[ SHS.PSY ] Humanities and Social Sciences/Psychologysocial categorizationsocial representationsverbal association task[SHS.PSY]Humanities and Social Sciences/Psychologyintergroup relationsComputingMilieux_MISCELLANEOUS
researchProduct