Search results for "call"

showing 10 items of 2320 documents

Some Computational Aspects of DISTANCE-SAT

2007

In many AI fields, one must face the problem of finding a solution that is as close as possible to a given configuration. This paper addresses this problem in a propositional framework. We introduce the decision problem distance-sat, which consists in determining whether a propositional formula admits a model that disagrees with a given partial interpretation on at most d variables. The complexity of distance-sat and of several restrictions of it are identified. Two algorithms based on the well-known Davis/Logemann/Loveland search procedure for the satisfiability problem sat are presented so as to solve distance-sat for CNF formulas. Their computational behaviors are compared with the ones …

[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI]Theoretical computer scienceComputational complexity theory0102 computer and information sciences02 engineering and technologyComputer Science::Computational Complexity01 natural sciences[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]#SATArtificial IntelligenceComputer Science::Logic in Computer ScienceDPLL algorithm0202 electrical engineering electronic engineering information engineeringComputingMilieux_MISCELLANEOUSMathematicsDecision problemFunction problemSatisfiabilityPropositional formulaTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputational Theory and Mathematics010201 computation theory & mathematics020201 artificial intelligence & image processingBoolean satisfiability problemAlgorithmSoftware
researchProduct

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

Attempts to produce minimal Resolution refutations

2018

We address the challenge of searching minimal refutations proofs of inconsistent CNF formulae using the Resolution rule. We propose two algorithms which can only afford formulae of at most 5 variables with a desktop computer. A faster but incomplete algorithm is used to produce "hard" 5 variables 3CNF formulae though a stochastic greedy search. It allowed us to find formulae that can be refuted by producing clauses of at most 3 literals, but whose all minimal refutations contain at least one clause of 4 literals.

[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI]TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
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

A Symplectic Kovacic's Algorithm in Dimension 4

2018

Let $L$ be a $4$th order differential operator with coefficients in $\mathbb{K}(z)$, with $\mathbb{K}$ a computable algebraically closed field. The operator $L$ is called symplectic when up to rational gauge transformation, the fundamental matrix of solutions $X$ satisfies $X^t J X=J$ where $J$ is the standard symplectic matrix. It is called projectively symplectic when it is projectively equivalent to a symplectic operator. We design an algorithm to test if $L$ is projectively symplectic. Furthermore, based on Kovacic's algorithm, we design an algorithm that computes Liouvillian solutions of projectively symplectic operators of order $4$. Moreover, using Klein's Theorem, algebraic solution…

[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]010102 general mathematicsDynamical Systems (math.DS)Differential operator01 natural sciencesSymplectic matrixDifferential Galois theory34M15Operator (computer programming)Fundamental matrix (linear differential equation)Mathematics - Symplectic Geometry0103 physical sciencesFOS: MathematicsSymplectic Geometry (math.SG)010307 mathematical physicsMathematics - Dynamical Systems0101 mathematicsAlgebraically closed fieldAlgebraic numberMathematics::Symplectic GeometryAlgorithmMathematicsSymplectic geometryProceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation
researchProduct

Stimulation of root and somatic embryo production in Euconymus europaeus L. by an inhibitor of polyamine biosynthesis

1995

In vitro formation of roots and somatic embryos is obtained from cotyledon explants of a Spindle tree (Euonymus europaeus L.) cultured on two different media: a medium inducing callus formation and the production of roots, and a medium inducing callus formation, root and somatic embryo production. We studied the effects of α-difluoromethylornithine (DFMO), a specific, irreversible inhibitor of ornithine decarboxylase (ODC) on root and somatic embryo production, growth and titers of putrescine in Euonymus explants and explant-derived calli. Early changes in putrescine levels were detected in both cultures before the visible emergence of roots or somatic embryos. DFMO rapidly inhibited putres…

[SDE] Environmental Sciences0106 biological sciencesfood.ingredientSomatic embryogenesisPhysiologyCallus formationSomatic cell[SDV]Life Sciences [q-bio]Plant ScienceBiology01 natural sciencesOrnithine decarboxylase03 medical and health scienceschemistry.chemical_compoundfoodComputingMilieux_MISCELLANEOUS030304 developmental biology0303 health sciencesfungiCell biology[SDV] Life Sciences [q-bio]BiochemistrychemistryCallus[SDE]Environmental SciencesPutrescinePolyamineAgronomy and Crop ScienceCotyledon010606 plant biology & botany
researchProduct

Simulation study of the effects of intensified crop management in genetically manipulated maize on arable weed flora and associated fauna

2014

International audience; Cultivation of GM crops with herbicide tolerance is mostly associated with changes in crop and weed management, like simplified rotations, simplified tillage and change from selective herbicides to the broadband glyphosate. All of these management practices decrease weed densities in crops and change their composition. Although weeds cause yield loss and harvest problems, they are an important part of arable biodiversity and offer food and habitat for different groups of animals. A simulation study was conducted to analyse indirect effects of intensified cropping in GM maize on biodiversity. The dynamic crop: weed model FlorSys was used to simulate weed densities and…

[SDE] Environmental Sciencesmodel[SDV]Life Sciences [q-bio]changes in agricultural practicescrop productioncropping system[SHS]Humanities and Social Sciences[SDV] Life Sciences [q-bio][SDE]Environmental Sciences[SDV.BV]Life Sciences [q-bio]/Vegetal Biology[SDV.BV] Life Sciences [q-bio]/Vegetal Biology[SHS] Humanities and Social Sciencesgenetically-modified (GM)biodiversityweed
researchProduct

Assessing the effect of changes of agricultural practices accompanying herbicide-tolerant crops on agricultural biodiversity. A simulation study with…

2014

International audience

[SDE] Environmental Sciencesmodel[SDV]Life Sciences [q-bio]yield lossgenetically-modifiedcropping system[SHS]Humanities and Social Sciences[SDV] Life Sciences [q-bio][SDE]Environmental Sciencesherbicide resistance[SDV.BV]Life Sciences [q-bio]/Vegetal Biology[SDV.BV] Life Sciences [q-bio]/Vegetal Biology[SHS] Humanities and Social SciencesComputingMilieux_MISCELLANEOUSweedbiodiversity
researchProduct

How to manage the impact of gene flow on oilseed rape grain quality? Simulation case studies of three contrasted landscapes

2012

Abstract Grain admixture due to gene flow of oilseed rape (OSR) could be economically damaging. Different strategies are currently used or proposed to manage grain quality, ranging from homogenisation at the silo level to tactical decision rules at the field level. The relevance of these general strategies was appraised in the case of genetically modified (GM) OSR in three contrasted regions in Europe: Beauce Blesoise (France), Schleswig-Flensburg (Germany), and Fife (UK). Field patterns, crop allocation and agricultural practices were derived from existing datasets and complementary field surveys. Then a gene flow simulator was used to assess how the local contexts influenced the grain adm…

[SDV.SA]Life Sciences [q-bio]/Agricultural sciencesoilseed rapebusiness.industryherbicide tolerancegrain qualitySoil Sciencegenetically modifiedPlant ScienceDecision ruleGene flowAgronomyAgricultureSiloGrain qualityEnvironmental sciencebusinessgene flowAgronomy and Crop Science
researchProduct

Vers la validation fonctionnelle du gène WEE1 dans l’acquisition de la résistance au stress abiotique chez des protéagineux

2017

[SDV] Life Sciences [q-bio]Medicago truncatula R108Agrobacterium tumefaciensPisum sativum cv. Caméor[SDV]Life Sciences [q-bio]WEE1callogénèse
researchProduct