Search results for "complex"

showing 10 items of 5889 documents

“Two-Story” Calix[6]arene-Based Zinc and Copper Complexes: Structure, Properties, and O 2 Binding

2017

International audience; A new “two-story” calix[6]arene-based ligand was synthesized, and its coordination chemistry was explored. It presents a tren cap connected to the calixarene small rim through three amido spacers. X-ray diffraction studies of its metal complexes revealed a six-coordinate ZnII complex with all of the carbonyl groups of the amido arms bound and a five-coordinate CuII complex with only one amido arm bound. These dicationic complexes were poorly responsive toward exogenous neutral donors, but the amido arms were readily displaced by small anions or deprotonated with a base to give the corresponding monocationic complexes. Cyclic voltammetry in various solvents showed a r…

[CHIM.INOR] Chemical Sciences/Inorganic chemistryStereochemistry“two-story” calix[6]arene-based ligand[CHIM.INOR]Chemical Sciences/Inorganic chemistry010402 general chemistry01 natural sciencesRedoxCoordination complexInorganic ChemistryMetalDeprotonationCalixarenePolymer chemistry[CHIM.COOR]Chemical Sciences/Coordination chemistryPhysical and Theoretical ChemistryAnion bindingta116chemistry.chemical_classificationligands010405 organic chemistryChemistryLigandligandit[CHIM.COOR] Chemical Sciences/Coordination chemistry0104 chemical sciencesvisual_artvisual_art.visual_art_mediumCyclic voltammetry
researchProduct

Perceptual odor blending is influenced by chemical complexity of odorant mixtures

2008

International audience; Perfumers and flavorists are familiar with odor blending phenomenon and often report that a minimum number of odorants has to be mixed for a good odor blend to arise. Previous studies in humans and animals suggested that a configural process could be involved in the perceptual analysis of mixtures of odorants. It has been proposed that the perceptual blending phenomenon corresponds to a configural perception of odorant mixtures. In the present study, we investigated the influence of chemical complexity on the configural perception of odorant mixtures. Six mixtures including 2 to 6 odorants as well as each unmixed odorant were assessed for their odor quality by a pane…

[CHIM.OTHE] Chemical Sciences/Othermusculoskeletal neural and ocular physiologyodorant mixtureschemical complexityperceptual odor blending[CHIM.OTHE]Chemical Sciences/Otherpsychological phenomena and processes
researchProduct

Influence of the stereochemistry and of the functionality of organic molecules on the hydration of cementitious compounds

2015

The current limited knowledge on the interactions between organic admixtures and mineral phases as well as their influence on the hydration mechanisms of the Ordinary Portland Cement (OPC) represents a real limitation in the development of new organic products with improved and controlled properties. Here, this study intended to understand why and how organic admixtures modify the setting time of OPC by progressively varying the characteristics of simple organic molecules such as their charge, functional groups (hydroxyl, hydroxy-carboxylate, carboxylate, sulfonate and phosphonate) and the stereochemistry of their hydroxyl groups.The different retardations induced by the organic molecules s…

[CHIM.THEO] Chemical Sciences/Theoretical and/or physical chemistryHydratationCementHydrationComplexationAdsorptionAdjuvant organiqueCimentOrganic admixture
researchProduct

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

Customizing Semantic Profiling for Digital Advertising

2014

International audience; Personalization is the new magic buzzword of application development. To make the complexity of today's application functionalities and information spaces "digestible", customization has become the new go-to technique. But while those technologies aim to ease the consumption of media for their users, they suffer from the same problematic: in the age of Big Data, applications have to cope with a conundrum of heterogeneous information sources that have to be perceived, processed and interpreted. Researchers tend to aim for a maximum degree of integration to create the perfect, all-embracing personalization. The results are wide-range, but overly complex systems that su…

[INFO.INFO-AI] Computer Science [cs]/Artificial Intelligence [cs.AI][ INFO ] Computer Science [cs]Computer scienceBig dataComplex systemsemantic technologies02 engineering and technology[INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]Personalization[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]World Wide Web020204 information systems0202 electrical engineering electronic engineering information engineeringProfiling (information science)Heterogeneous information[ INFO.INFO-CL ] Computer Science [cs]/Computation and Language [cs.CL][INFO]Computer Science [cs]user profiles[ INFO.INFO-AI ] Computer Science [cs]/Artificial Intelligence [cs.AI]OWLuser profilingbusiness.industryScalabilitySemantic technology020201 artificial intelligence & image processingbusinessDigital advertisingcustomization
researchProduct

Inverse Tone Mapping Based upon Retina Response

2014

International audience; The development of high dynamic range (HDR) display arouses the research of inverse tone mapping methods, which expand dynamic range of the low dynamic range (LDR) image to match that of HDR monitor. This paper proposed a novel physiological approach, which could avoid artifacts occurred in most existing algorithms. Inspired by the property of the human visual system (HVS), this dynamic range expansion scheme performs with a low computational complexity and a limited number of parameters and obtains high-quality HDR results. Comparisons with three recent algorithms in the literature also show that the proposed method reveals more important image details and produces …

[INFO.INFO-AR]Computer Science [cs]/Hardware Architecture [cs.AR]Computational complexity theoryArticle SubjectComputer sciencemedia_common.quotation_subjectComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONlcsh:MedicineTone mappinglcsh:TechnologyRetinaGeneral Biochemistry Genetics and Molecular BiologyImage (mathematics)BiomimeticsDistortionImage Interpretation Computer-AssistedHumansContrast (vision)Computer visionlcsh:ScienceHigh dynamic rangeGeneral Environmental Sciencemedia_commonDynamic rangebusiness.industrylcsh:Tlcsh:RGeneral MedicineImage EnhancementHuman visual system modellcsh:QArtificial intelligence[ INFO.INFO-AR ] Computer Science [cs]/Hardware Architecture [cs.AR]businessAlgorithmsColor PerceptionResearch ArticleThe Scientific World Journal
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

Whole mirror duplication-random loss model and pattern avoiding permutations

2010

International audience; In this paper we study the problem of the whole mirror duplication-random loss model in terms of pattern avoiding permutations. We prove that the class of permutations obtained with this model after a given number p of duplications of the identity is the class of permutations avoiding the alternating permutations of length p2+1. We also compute the number of duplications necessary and sufficient to obtain any permutation of length n. We provide two efficient algorithms to reconstitute a possible scenario of whole mirror duplications from identity to any permutation of length n. One of them uses the well-known binary reflected Gray code (Gray, 1953). Other relative mo…

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]Class (set theory)0206 medical engineeringBinary number0102 computer and information sciences02 engineering and technology[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesIdentity (music)Combinatorial problemsTheoretical Computer ScienceGray codeCombinatoricsPermutation[ INFO.INFO-BI ] Computer Science [cs]/Bioinformatics [q-bio.QM]Gene duplicationRandom loss[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Pattern avoiding permutationGenerating algorithmComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsWhole duplication-random loss modelMathematics::CombinatoricsGenomeParity of a permutationComputer Science Applications[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO][ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC]Binary reflected Gray code010201 computation theory & mathematicsSignal Processing[INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]020602 bioinformaticsAlgorithmsInformation Systems
researchProduct

Topological properties of cellular automata on trees

2012

We prove that there do not exist positively expansive cellular automata defined on the full k-ary tree shift (for k>=2). Moreover, we investigate some topological properties of these automata and their relationships, namely permutivity, surjectivity, preinjectivity, right-closingness and openness.

[INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)FOS: Physical sciencesComputer Science - Formal Languages and Automata Theory0102 computer and information sciences[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Computational Complexity (cs.CC)Topology01 natural scienceslcsh:QA75.5-76.95[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]0101 mathematicsF.1.1;F.1.2;F.1.3MathematicsCellular Automata and Lattice Gases (nlin.CG)lcsh:Mathematics010102 general mathematicsCellular automaton tree shift expansivity permutivity right-closingness opennesslcsh:QA1-939Nonlinear Sciences::Cellular Automata and Lattice GasesCellular automatonAutomatonComputer Science - Computational Complexity010201 computation theory & mathematicsTree (set theory)lcsh:Electronic computers. Computer scienceF.1.2F.1.3ExpansiveNonlinear Sciences - Cellular Automata and Lattice GasesF.1.1Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematics
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