Search results for "UTIN"
showing 10 items of 26364 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…
Due note etimologiche circostanziali circa il Ms.II.D.54 (BNN) attribuito a Baffi
2019
Within the investigations on the attribution of some manuscripts to the famous philologist P. Baffi and now kept at the National Library of Naples (BNN), this brief contribution investigates in detail some of the passages contained in Ms.II.D.54 (f. 234r et f. 325r), in order to understand its meaning and to evaluate and validate its attributing hypotheses.
Des étudiants en ESPE moins satisfaits ?
2019
International audience
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. …
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…
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}} .
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.
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.
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…
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…