Search results for "ENSEMBLES"

showing 10 items of 22 documents

Molecular wires - long range electron tunneling and hopping in novel donor-acceptor ensembles

2004

PhotophysicsFullereneSettore CHIM/06 - Chimica Organicadonor-acceptor ensembles
researchProduct

Computing the Arrangement of Circles on a Sphere, with Applications in Structural Biology

2009

International audience; Balls and spheres are the simplest modeling primitives after affine ones, which accounts for their ubiquitousness in Computer Science and Applied Mathematics. Amongst the many applications, we may cite their prevalence when it comes to modeling our ambient 3D space, or to handle molecular shapes using Van der Waals models. If most of the applications developed so far are based upon simple geometric tests between balls, in particular the intersection test, a number of applications would obviously benefit from finer pieces of information. Consider a sphere $S_0$ and a list of circles on it, each such circle stemming from the intersection between $S_0$ and another spher…

Single passSpheresControl and Optimization0102 computer and information sciences[INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]01 natural sciencesArrangement of circlesDockingmolecular surfacesCombinatorics03 medical and health sciencesVan der Waals modelsConformational ensembles030304 developmental biologyMathematics0303 health sciencesOptimization algorithmData structureComputer Science ApplicationsAlgebraComputational Mathematics[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]Computational Theory and MathematicsStructural biology010201 computation theory & mathematicsBall (bearing)[ INFO.INFO-CG ] Computer Science [cs]/Computational Geometry [cs.CG]SPHERESGeometry and TopologyAffine transformationflexible docking
researchProduct

A multi-scale approach for testing and detecting peaks in time series

2020

An approach is presented that combines a statistical test for peak detection with the estimation of peak positions in time series. Motivated by empirical observations in neuronal recordings, we aim at investigating peaks of different heights and widths. We use a moving window approach to compare the differences of estimated slope coefficients of local regression models. We combine multiple windows and use the global maximum of all different processes as a test statistic. After rejection, a multiple filter algorithm combines peak positions estimated from multiple windows. Analysing neuronal activity recorded in anaesthetized mice, the procedure could identify significant differences between …

Statistics and Probabilitypeak detection ; multi-scale ; linear regression ; neuronal ensembles ; Brain statesSeries (mathematics)Scale (ratio)business.industry05 social sciencesPattern recognition01 natural sciencesPeak detection010104 statistics & probabilityBrain state0502 economics and businessLinear regressionArtificial intelligence0101 mathematicsStatistics Probability and Uncertaintybusiness050205 econometrics Statistical hypothesis testingMathematics
researchProduct

Ensemble Feature Selection Based on the Contextual Merit

2001

Recent research has proved the benefits of using ensembles of classifiers for classification problems. Ensembles constructed by machine learning methods manipulating the training set are used to create diverse sets of accurate classifiers. Different feature selection techniques based on applying different heuristics for generating base classifiers can be adjusted to specific domain characteristics. In this paper we consider and experiment with the contextual feature merit measure as a feature selection heuristic. We use the diversity of an ensemble as evaluation function in our new algorithm with a refinement cycle. We have evaluated our algorithm on seven data sets from UCI. The experiment…

Training setComputer sciencebusiness.industryHeuristicPattern recognitionFeature selectionContext (language use)Machine learningcomputer.software_genreEvaluation functionComputingMethodologies_PATTERNRECOGNITIONEnsembles of classifiersFeature (computer vision)Artificial intelligenceHeuristicsbusinesscomputer
researchProduct

Ensemble Feature Selection Based on Contextual Merit and Correlation Heuristics

2001

Recent research has proven the benefits of using ensembles of classifiers for classification problems. Ensembles of diverse and accurate base classifiers are constructed by machine learning methods manipulating the training sets. One way to manipulate the training set is to use feature selection heuristics generating the base classifiers. In this paper we examine two of them: correlation-based and contextual merit -based heuristics. Both rely on quite similar assumptions concerning heterogeneous classification problems. Experiments are considered on several data sets from UCI Repository. We construct fixed number of base classifiers over selected feature subsets and refine the ensemble iter…

Training setbusiness.industryComputer scienceFeature selectionPattern recognitionBase (topology)Machine learningcomputer.software_genreExpert systemRandom subspace methodComputingMethodologies_PATTERNRECOGNITIONEnsembles of classifiersFeature (machine learning)Artificial intelligencebusinessHeuristicscomputerCascading classifiers
researchProduct

Structure of longitudinal chromomagnetic fields in high energy collisions

2014

We compute expectation values of spatial Wilson loops in the forward light cone of high-energy collisions. We consider ensembles of gauge field configurations generated from a classical Gaussian effective action as well as solutions of high-energy renormalization group evolution with fixed and running coupling. The initial fields correspond to a color field condensate exhibiting domain-like structure over distance scales of order the saturation scale. At later times universal scaling emerges at large distances for all ensembles, with a nontrivial critical exponent. Finally, we compare the results for the Wilson loop to the two-point correlator of magnetic fields.

We compute expectation values of spatial Wilson loops in the forward light cone of high-energy collisions. We consider ensembles of gauge field configurations generated from a classical Gaussian effective action as well as solutions of high-energy renormalization group evolution with fixed and running coupling. The initial like structure over distance scales of oder the saturation scale. At later times universal scaling emerges at large distances for all ensembles with a nontrivial critical exponent. Finally we compare the resulats for the Wilson loop to the two-point correlator of magnetic fields. (C) 2014 The Authors. Published by Elsevier BV This is an open access article under the CC BY licenseNuclear and High Energy PhysicsWilson loopLARGE NUCLEINuclear TheoryField (physics)FOS: Physical sciences114 Physical sciences01 natural sciencesColor-glass condensateRENORMALIZATION-GROUPNuclear Theory (nucl-th)GLUON DISTRIBUTION-FUNCTIONSHigh Energy Physics - Phenomenology (hep-ph)Light cone0103 physical sciencesSCATTERINGGauge theory010306 general physicsSMALL-XEffective actionPhysicsCORRELATORSta114010308 nuclear & particles physicsCOLOR GLASS CONDENSATERenormalization groupEVOLUTIONJIMWLK EQUATIONHigh Energy Physics - PhenomenologySATURATIONQuantum electrodynamicsCritical exponentPhysics Letters B
researchProduct

ÉQUATIONS DIFFÉRENTIELLES À COEFFICIENTS DANS DES CORPS DE SÉRIES GÉNÉRALISÉES.

2007

We express the connection between the support of some equations and those of generalized series solutions. On the one hand we prove that any real power series solution of a sub-analytic differential equation belong to a lattice (i.e. an additive sub semi-group of positive reals). On the other hand we consider the field Mr of series with well-ordered support included in the Hahn product Hr with finite rank r (i.e. the lexicographic product of r copies of the reals). We equip Mr with a "Hardy type" derivation and define some well-ordered sets T1, ..., Tr such that : for all equation F(y,...,y(n))=0 with F in Mr[[Y0,...,Yn]] and whose support Supp F is a well-ordered subset of Hr, and for all …

[ MATH ] Mathematics [math]corps valué[MATH] Mathematics [math]well-ordered sets.Generalized (power) seriesensembles bien ordonnésfonction sous-analytiqueensembles bien ordonnés.valued fields[MATH]Mathematics [math]Séries généraliséesdéveloppement asymp-<br />totiquevaluationsub-analytic functionsasymptotic<br />development
researchProduct

Differential inclusions involving normal cones of nonregular sets in Hilbert spaces

2017

This thesis is dedicated to the study of differential inclusions involving normal cones of nonregular sets in Hilbert spaces. In particular, we are interested in the sweeping process and its variants. The sweeping process is a constrained differential inclusion involving normal cones which appears naturally in several applications such as elastoplasticity, electrical circuits, hysteresis, crowd motion, etc.This work is divided conceptually in three parts: Study of positively alpha-far sets, existence results for differential inclusions involving normal cones and characterizations of Lyapunov pairs for the sweeping process. In the first part (Chapter 2), we investigate the class of positivel…

[ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC]cône normalMoreau-Yosida regularizationcono normalmétodo de tipo Galerkinfonction distanceGalerkin-like methodMSC: 34A60 49J52 34G25 49J53 34B10 93D30subdiferencial de Clarkeprocessus de rafleInclusión diferencialensembles positivement alpha-far'sweeping processfonctions de Lyapunovsous-différentiel de Clarkeprocesos de arrastrefunción distanciaLyapunov functionsconjuntos positivamente alpha-farFunciones de Lyapunovméthode de type Galerkinrégularisation de Moreau-YosidaDifferential inclusions[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Clarke subdifferentialregularización de Moreau-YosidaDistance functionInclusion différentielle[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]Normal conepositively alpha-far sets
researchProduct

Seasonal reproducibility and predictability of the West African Monsoon in coupled GCMs

2009

In the framework of the ENSEMBLES FP6 project, an ensemble prediction system based on five different state-of-the-art European coupled models has been developed. This study evaluates the performance of these models for forecasting the West African monsoon (WAM) at the monthly time scale. From simulations started the 1 May of each year and covering the period 1991–2001, the reproducibility and potential predictability (PP) of key parameters of the WAM—rainfall, zonal and meridional wind at four levels from the surface to 200 hPa, and specific humidity, from July to September—are assessed. The Sahelian rainfall mode of variability is not accurately reproduced contrary to the Guinean rainfall …

[ SDE.MCG ] Environmental Sciences/Global ChangesWest African monsoonENSEMBLESModel Output Statistics[SDE.MCG] Environmental Sciences/Global Changes[SDU.STU.CL] Sciences of the Universe [physics]/Earth Sciences/Climatology[SDU.STU.CL]Sciences of the Universe [physics]/Earth Sciences/Climatology[SDE.MCG]Environmental Sciences/Global Changespredictability[ SDU.STU.CL ] Sciences of the Universe [physics]/Earth Sciences/ClimatologyComputingMilieux_MISCELLANEOUS
researchProduct

Arbres couvrants presque disjoints

2015

International audience; Dans un réseau, la recherche de plusieurs arbres couvrants avec des propriétés intéressantes a amené à l'introduc-tion de plusieurs notions : les arbres couvrants arête-disjoints, les arbres indépendants enracinés en un sommet et les arbres complètement indépendants. Afin de généraliser ces notions, nous introduisons la notion d'arbres couvrants (i, j)-disjoints, où i et j sont respectivement le nombre maximum de noeuds internes et d'arêtes communs aux arbres couvrants. Nous montrons que déterminer s'il existe deux arbres couvrants (i, j)-disjoints dans un graphe G est un problème NP-complet pour i et j quelconques, et nous déterminons les valeurs minimales de i et j…

[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI]Arbres couvrantsArbres couvrants com-plètement indépendants[INFO.INFO-NI] Computer Science [cs]/Networking and Internet Architecture [cs.NI][ INFO.INFO-NI ] Computer Science [cs]/Networking and Internet Architecture [cs.NI]Ensembles dominants connexes[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Arbres couvrants arête-disjointsArbres couvrants indépendants
researchProduct