Search results for "Formation"

showing 10 items of 21020 documents

On Whitham and Related Equations

2017

The aim of this paper is to study, via theoretical analysis and numerical simulations, the dynamics of Whitham and related equations. In particular, we establish rigorous bounds between solutions of the Whitham and Korteweg–de Vries equations and provide some insights into the dynamics of the Whitham equation in different regimes, some of them being outside the range of validity of the Whitham equation as a water waves model.

010101 applied mathematicsPhysicsRange (mathematics)Nonlinear Sciences::Exactly Solvable and Integrable SystemsWhitham equationApplied Mathematics010102 general mathematicsMathematical analysis0101 mathematicsNonlinear Sciences::Pattern Formation and Solitons01 natural sciencesStudies in Applied Mathematics
researchProduct

Efficient generation of restricted growth words

2013

A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.

010102 general mathematicsBinary numberValue (computer science)0102 computer and information sciences[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesComputer Science ApplicationsTheoretical Computer SciencePrefixCombinatoricsGray code010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Signal ProcessingPartial word0101 mathematicsConstant (mathematics)ComputingMilieux_MISCELLANEOUSWord (group theory)Information SystemsMathematicsInformation Processing Letters
researchProduct

Análisis de la utilidad del algoritmo Gradient Boosting Machine (GBM) en la predicción del fracaso empresarial

2018

Este estudio, novedoso en cuanto a la utilizacion de la metodologia basada en la cultura de los algoritmos, prueba la capacidad de la tecnica ‘Gradient Boosting Machine’ (GBM) en la prediccion de l...

010104 statistics & probabilityEconomics and EconometricsAccounting0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing02 engineering and technology0101 mathematics01 natural sciencesFinanceSpanish Journal of Finance and Accounting / Revista Española de Financiación y Contabilidad
researchProduct

Adjacency matrices of random digraphs: singularity and anti-concentration

2017

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …

0102 computer and information sciences01 natural scienceslittlewood–offord theory60C05 60B20 05C80 15B52 46B06law.inventionCombinatoricsSingularityanti-concentrationlawFOS: MathematicsMathematics - CombinatoricsAdjacency matrix0101 mathematicsMathematicsinvertibility of random matricesApplied Mathematics010102 general mathematicsProbability (math.PR)random regular graphsDirected graphsingular probabilityGraphVertex (geometry)Invertible matrix010201 computation theory & mathematicsadjacency matricesCombinatorics (math.CO)Mathematics - ProbabilityAnalysis
researchProduct

Restricted compositions and permutations: from old to new Gray codes

2011

Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…

0102 computer and information sciences02 engineering and technologyInterval (mathematics)[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesTheoretical Computer ScienceCombinatoricsGray codePermutationsymbols.namesakeInteger020204 information systems[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0202 electrical engineering electronic engineering information engineeringComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsExtension (predicate logic)Composition (combinatorics)Cartesian productComputer Science Applications010201 computation theory & mathematicsComputer Science::Computer Vision and Pattern RecognitionBounded functionSignal ProcessingsymbolsInformation Systems
researchProduct

Statistics-preserving bijections between classical and cyclic permutations

2012

Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…

0102 computer and information sciencesFixed point[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesCombinatorial problemsTheoretical Computer ScienceCyclic permutationSet (abstract data type)CombinatoricsBijections[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsDescent (mathematics)Discrete mathematicsStatistics on permutationsMathematics::Combinatorics010102 general mathematicsDescentComputer Science ApplicationsDerangement010201 computation theory & mathematicsExcedenceSignal ProcessingBijectionBijection injection and surjectionMaximaInformation Systems
researchProduct

Promotion et Développement d'un Master Erasmus Mundus - L'Exemple du VIBOT

2011

Cet article decrit l’offre de formation a l’internationale proposee au Centre Universitaire Condorcet du Creusot (Universite de Bourgogne) dans le domaine de la vision par ordinateur et de la robotique. Il presente l’organisation particuliere de ces formations et les actions de support mises en place pour en assurer la perennite.

010201 computation theory & mathematics05 social sciences050301 education[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]0102 computer and information sciences16. Peace & justice[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]0503 education01 natural sciences
researchProduct

Impact of the erase algorithms on flash memory lifetime

2017

This paper presents a comparative study on the impact of the erase algorithm on flash memory lifetime, to demonstrate how the reduction of overall stress, suffered by memories, will increase their lifetime, thanks to a smart management of erase operations. To this purpose a fixed erase voltage, equal to the maximum value and the maximum time-window, was taken as the reference test; while an algorithm with adaptive voltage levels and the same overall time-window was designed and implemented in order to compare their experimental results. This study was carried out by using an innovative Automated Test Equipment, named Portable-ATE, tailored for Memory Test Chip and designed for performance e…

010302 applied physicsAdaptive algorithmComputer science02 engineering and technologyChip01 natural sciencesFlash memory020202 computer hardware & architectureReduction (complexity)Automatic test equipmentMemory managementBuilt-in self-test0103 physical sciences0202 electrical engineering electronic engineering information engineeringAlgorithm designAlgorithm2017 13th Conference on Ph.D. Research in Microelectronics and Electronics (PRIME)
researchProduct

Plastic yielding of glass in high-pressure torsion apparatus

2018

International audience; Hardness measurements performed at room temperature have demonstrated that glass can flow under elevated pressure, whereas the effect of high pressure on glass rheology remains poorly quantified. Here, we applied a high-pressure torsion (HPT) apparatus to deform SCHOTT SF6 â glass and attempted to quantify the effect of pressure and temperature on the shear deformation of glass subjected to pressures from 0.3 GPa to 7 GPa and temperatures from 25 ℃ to 496 ℃. Results show that the plastic yield deformation was occurring during the HPT experiments on the SF6 glass at elevated temperature from 350 ℃ to 496 ℃. The yield stress of SF6 glass decreases with increasing tempe…

010302 applied physicsArrhenius equationPlastic yieldingMaterials scienceYield (engineering)Deformation (mechanics)Plastic yieldingTorsion (mechanics)02 engineering and technologyActivation energy[SPI.MAT] Engineering Sciences [physics]/Materials021001 nanoscience & nanotechnology01 natural sciencesglass flow[SPI.MAT]Engineering Sciences [physics]/Materialspressuresymbols.namesakehigh-pressure torsionRheologyHigh pressure0103 physical sciencessymbolsGeneral Materials ScienceComposite material0210 nano-technologyInternational Journal of Applied Glass Science
researchProduct

Structural characterization and electrochemical hydrogen storage properties of Ti2LxZrxNi (x [ 0, 0.1, 0.2) alloys prepared by mechanical alloying

2013

International audience; Nominal Ti2Ni was synthesized under argon atmosphere at room temperature using a planetary high-energy ball mill. The effect of milling time and Zr substitution for Ti on the microstructure was characterized by XRD, SEM and TEM, and the discharge capacities of Ti2xZrxNi (x 1/4 0, 0.1, 0.2) were examined by electrochemical measurements at galvanostatic conditions. XRD analysis shows that amorphous phase of Ti2Ni can be elaborated by 60 h of milling, whereas Zr substitution hinders amorphization process of the system. The products of ball milling nominal Ti2xZrxNi (x 1/4 0.1, 0.2) were austenitic (Ti, Zr)Ni and partly TiO, despite the fact that the operation was carrie…

010302 applied physicsAusteniteMaterials scienceRenewable Energy Sustainability and the Environment020209 energyMetallurgyEnergy Engineering and Power Technology02 engineering and technologyCondensed Matter PhysicsElectrochemistryMicrostructure01 natural sciences7. Clean energyCharacterization (materials science)Amorphous solidHydrogen storageFuel TechnologyChemical engineering0103 physical sciences0202 electrical engineering electronic engineering information engineering[ SPI.NANO ] Engineering Sciences [physics]/Micro and nanotechnologies/Microelectronics[SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/MicroelectronicsBall millCurrent density
researchProduct