Search results for "Putin"

showing 10 items of 25297 documents

MoMo: enabling hybrid museums

2005

Present-day museums are not mere passive institutions for the preservation of a society's cultural heritage. They have become instead learning environments, research centres and even tourist attractions. The paper introduces the notion of a hybrid museum (HM) in which wireless personal digital devices (PDAs) are used to tailor digital contents to the visitor to enrich both the learning and entertainment experience. The paper describes a fully functional hybrid museum infrastructure (MoMo) implemented with the.NET compact framework running on the PocketPC platform. Several research challenges that had to be faced during the implementation of the system such as the exploration of large sets o…

.NET Compact FrameworkEngineeringMultimediabusiness.industryLearning environmentVisitor patternMobile computingcomputer.software_genreComputer Graphics and Computer-Aided DesignPersonalizationCultural heritageEntertainmentbusinesscomputerSoftwareBlossom algorithmIEE Proceedings - Software
researchProduct

Des étudiants en ESPE moins satisfaits ?

2019

International audience

/Condition de vie/[SHS.EDU]Humanities and Social Sciences/Education[SHS.EDU] Humanities and Social Sciences/EducationSatisfactionÉtudiantCondition d'enseignementÉvolutionComputingMilieux_MISCELLANEOUSESPE
researchProduct

Variable time amplitude amplification and quantum algorithms for linear algebra problems

2012

Quantum amplitude amplification is a method of increasing a success probability of an algorithm from a small epsilon>0 to Theta(1) with less repetitions than classically. In this paper, we generalize quantum amplitude amplification to the case when parts of the algorithm that is being amplified stop at different times. We then apply the new variable time amplitude amplification to give two new quantum algorithms for linear algebra problems. Our first algorithm is an improvement of Harrow et al. algorithm for solving systems of linear equations. We improve the running time of the algorithm from O(k^2 log N) to O(k log^3 k log N) where k is the condition number of the system of equations. …

000 Computer science knowledge general works010201 computation theory & mathematics0103 physical sciencesComputer Science[INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information scienceslinear equations010306 general physicsquantum algorithmsamplitude amplification01 natural sciencesquantum computing
researchProduct

Computer Science Meets Ecology (Dagstuhl Seminar 17091)

2017

This report summarizes the program and main outcomes of the Dagstuhl Seminar 17091 entitled ``Computer Science Meets Ecolog''. Ecology is a discipline that poses many challenging problems involving big data collection, provenance and integration, as well as difficulties in data analysis, prediction and understanding. All these issues are precisely the arena where computer science is concerned. The seminar motivation was rooted in the belief that ecology could largely benefit from modern computer science. The seminar attracted scientists from both fields who discussed important topics in ecology (e.g. botany, animal science, biogeochemistry) and how to approach them with machine learning, co…

000 Computer science knowledge general works4. EducationComputer ScienceComputingMilieux_COMPUTERSANDEDUCATION
researchProduct

Codimension growth of central polynomials of Lie algebras

2019

Abstract Let L be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic zero and let I be the T-ideal of polynomial identities of the adjoint representation of L. We prove that the number of multilinear central polynomials in n variables, linearly independent modulo I, grows exponentially like ( dim ⁡ L ) n {(\dim L)^{n}} .

010101 applied mathematicsPure mathematicsExponential growthApplied MathematicsGeneral MathematicsComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATION010102 general mathematicsLie algebraCodimension0101 mathematics01 natural sciencesMathematicsForum Mathematicum
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

Removing the saturation assumption in Bank-Weiser error estimator analysis in dimension three

2020

International audience; We provide a new argument proving the reliability of the Bank-Weiser estimator for Lagrange piecewise linear finite elements in both dimension two and three. The extension to dimension three constitutes the main novelty of our study. In addition, we present a numerical comparison of the Bank-Weiser and residual estimators for a three-dimensional test case.

010103 numerical & computational mathematicsResidual01 natural sciencesPiecewise linear function: Multidisciplinaire généralités & autres [C99] [Ingénierie informatique & technologie]Dimension (vector space)Bank-Weiser estimatorApplied mathematicsfinite element methodssaturation assumption0101 mathematicsReliability (statistics)Mathematicsresidual estimatorBank-WeiserestimatorApplied Mathematics: Multidisciplinary general & others [C99] [Engineering computing & technology]NoveltyEstimatorExtension (predicate logic)16. Peace & justiceFinite element methoda posteriori error estimation010101 applied mathematics: Mathematics [G03] [Physical chemical mathematical & earth Sciences]: Mathématiques [G03] [Physique chimie mathématiques & sciences de la terre][MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]
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

The influence of AlN buffer over the polarity and the nucleation of self-organized GaN nanowires

2015

We experimentally investigate the influence of AlN buffer growth on the nucleation and the polarity of a self-organized assembly of GaN nanowires (NWs) grown on Si. Two complementary growth mechanisms for AlN buffer deposited on Si are demonstrated. Both emphasize the aggregation of Si on the AlN surface and the growth of large cubic crystallites, namely, AlN pedestals. Further growths of GaN NWs assembly reveal that the GaN 2D layer found at the bottom of the NW assembly is the result of the coalescence of Ga-polar pyramids, whereas AlN pedestals are observed as preferential but not exclusive NW nucleation sites. NWs are N-polar or exhibit inversion domains with a Ga-polar core/N-polar she…

010302 applied physicsCoalescence (physics)[PHYS]Physics [physics]Materials sciencebusiness.industryNucleationWide-bandgap semiconductorNanowireGeneral Physics and AstronomyNanotechnology02 engineering and technology021001 nanoscience & nanotechnology01 natural sciencesBuffer (optical fiber)Nanolithography0103 physical sciencesOptoelectronicsCrystalliteSelf-assembly0210 nano-technologybusinessComputingMilieux_MISCELLANEOUS
researchProduct