Search results for "UTI"
showing 10 items of 62830 documents
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…
Asymptotic behavior of global solutions of aerotaxis equations
2019
Abstract We study asymptotic behavior of global solutions of one-dimensional aerotaxis model proposed in Knosalla and Nadzieja (2015) [9] .
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.
Constant sign and nodal solutions for nonlinear robin equations with locally defined source term
2020
We consider a parametric Robin problem driven by a nonlinear, nonhomogeneous differential operator which includes as special cases the p-Laplacian and the (p,q)-Laplacian. The source term is parametric and only locally defined (that is, in a neighborhood of zero). Using suitable cut-off techniques together with variational tools and comparison principles, we show that for all big values of the parameter, the problem has at least three nontrivial smooth solutions, all with sign information (positive, negative and nodal).
Multiple Solutions for Fractional Boundary Value Problems
2018
Variational methods and critical point theorems are used to discuss existence and multiplicity of solutions for fractional boundary value problem where Riemann–Liouville fractional derivatives and Caputo fractional derivatives are used. Some conditions to determinate nonnegative solutions are presented. An example is given to illustrate our results.
Random Tensor Theory: Extending Random Matrix Theory to Mixtures of Random Product States
2012
We consider a problem in random matrix theory that is inspired by quantum information theory: determining the largest eigenvalue of a sum of p random product states in $${(\mathbb {C}^d)^{\otimes k}}$$ , where k and p/d k are fixed while d → ∞. When k = 1, the Marcenko-Pastur law determines (up to small corrections) not only the largest eigenvalue ( $${(1+\sqrt{p/d^k})^2}$$ ) but the smallest eigenvalue $${(\min(0,1-\sqrt{p/d^k})^2)}$$ and the spectral density in between. We use the method of moments to show that for k > 1 the largest eigenvalue is still approximately $${(1+\sqrt{p/d^k})^2}$$ and the spectral density approaches that of the Marcenko-Pastur law, generalizing the random matrix…
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…