Search results for "Bases"
showing 10 items of 1240 documents
Smart Phone, Smart Science: How the Use of Smartphones Can Revolutionize Research in Cognitive Science
2011
WOS:000295936900019; International audience; Investigating human cognitive faculties such as language, attention, and memory most often relies on testing small and homogeneous groups of volunteers coming to research facilities where they are asked to participate in behavioral experiments. We show that this limitation and sampling bias can be overcome by using smartphone technology to collect data in cognitive science experiments from thousands of subjects from all over the world. This mass coordinated use of smartphones creates a novel and powerful scientific "instrument" that yields the data necessary to test universal theories of cognition. This increase in power represents a potential re…
FlyMove – a new way to look at development of Drosophila
2003
Development of any organism requires a complex interplay of genes to orchestrate the many movements needed to build up an embryo. Previously, work on Drosophila melanogaster has provided important insights that are often applicable in other systems. But developmental processes, which take place in space and time, are difficult to convey in textbooks. Here, we introduce FlyMove (http://flymove.uni-muenster.de), a new database combining movies, animated schemata, interactive "modules" and pictures that will greatly facilitate the understanding of Drosophila development.
Character restrictions and multiplicities in symmetric groups
2017
Abstract We give natural correspondences of odd-degree characters of the symmetric groups and some of their subgroups, which can be described easily by restriction of characters, degrees and multiplicities.
Quantum Queries on Permutations with a Promise
2009
This paper studies quantum query complexities for deciding (exactly or with probability 1.0) the parity of permutations of n numbers, 0 through n *** 1. Our results show quantum mechanism is quite strong for this non-Boolean problem as it is for several Boolean problems: (i) For n = 3, we need a single query in the quantum case whereas we obviously need two queries deterministically. (ii) For even n , n /2 quantum queries are sufficient whereas we need n *** 1 queries deterministically. (iii) Our third result is for the problem deciding whether the given permutation is the identical one. For this problem, we show that there is a nontrivial promise such that if we impose that promise to the …
Quantum Queries on Permutations
2015
K. Iwama and R. Freivalds considered query algorithms where the black box contains a permutation. Since then several authors have compared quantum and deterministic query algorithms for permutations. It turns out that the case of \(n\)-permutations where \(n\) is an odd number is difficult. There was no example of a permutation problem where quantization can save half of the queries for \((2m+1)\)-permutations if \(m\ge 2\). Even for \((2m)\)-permutations with \(m\ge 2\), the best proved advantage of quantum query algorithms is the result by Iwama/Freivalds where the quantum query complexity is \(m\) but the deterministic query complexity is \((2m-1)\). We present a group of \(5\)-permutati…
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases
2008
The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular, a criterion for a system of vectors to satisfy the Welch bounds with equality is given and applied for the case of MUBs. This yields a necessary and sufficient condition on a set of orthonormal bases to form a complete system of MUBs. This condition takes an especially elegant form in the case of homogeneous systems of MUBs. We express some known constructions of MUBs in this form. Also it is shown how recently obtained results binding MUBs and some combinatorial structures (such as perfect nonlinear functions an…
BARGAINING WITH COMMITMENT UNDER AN UNCERTAIN DEADLINE
2006
We consider an infinite horizon bargaining game in which a deadline can arise with positive probability and where players possess an endogenous commitment device. We show that for any truncation of the game, the equilibrium agreement can only take place if the deadline arises within this finite horizon. Since the deadline is an uncertain event, the equilibrium exhibits agreements which are delayed with positive probability.
Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms
2005
The complexity of quantum query algorithms computing Boolean functions is strongly related to the degree of the algebraic polynomial representing this Boolean function. There are two related difficult open problems. First, Boolean functions are sought for which the complexity of exact quantum query algorithms is essentially less than the complexity of deterministic query algorithms for the same function. Second, Boolean functions are sought for which the degree of the representing polynomial is essentially less than the complexity of deterministic query algorithms. We present in this paper new techniques to solve the second problem.
Computation of Yvon-Villarceau circles on Dupin cyclides and construction of circular edge right triangles on tori and Dupin cyclides
2014
Ring Dupin cyclides are non-spherical algebraic surfaces of degree four that can be defined as the image by inversion of a ring torus. They are interesting in geometric modeling because: (1) they have several families of circles embedded on them: parallel, meridian, and Yvon-Villarceau circles, and (2) they are characterized by one parametric equation and two equivalent implicit ones, allowing for better flexibility and easiness of use by adopting one representation or the other, according to the best suitability for a particular application. These facts motivate the construction of circular edge triangles lying on Dupin cyclides and exhibiting the aforementioned properties. Our first contr…
JANE: efficient mapping of prokaryotic ESTs and variable length sequence reads on related template genomes
2009
Abstract Background ESTs or variable sequence reads can be available in prokaryotic studies well before a complete genome is known. Use cases include (i) transcriptome studies or (ii) single cell sequencing of bacteria. Without suitable software their further analysis and mapping would have to await finalization of the corresponding genome. Results The tool JANE rapidly maps ESTs or variable sequence reads in prokaryotic sequencing and transcriptome efforts to related template genomes. It provides an easy-to-use graphics interface for information retrieval and a toolkit for EST or nucleotide sequence function prediction. Furthermore, we developed for rapid mapping an enhanced sequence align…