Search results for "database."
showing 10 items of 2119 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…
Some Quantitative Aspects of Stability Management Strategy in a Bank
2012
Abstract The stability of commercial bank system is the result of balanced development, which can be characterised by equilibrium and security over a longer period of time. The history of commercial bank system development indicates that reaching and sustaining this qualitative and quantitative state requires regulations and management. One of the most important parts of commercial bank management system is correctly chosen strategy in the circumstances of a changing environment. Strategy gives a possibility to look into the future of the commercial bank, forecast its goals, areas, scale and potential operational results in relation to resource sources and expenses. Nowadays a commercial ba…
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.
The Idiosincrancies of the European M&A Market
2020
This paper provides a comprehensive descriptive analysis of the European market of mergers and acquisitions (MA 2) method of payment; 3) geographical scope; 4) target’s attitude; 5) bidders’ competition; 6) industry relatedness; 7) public status of the firms involved; and 8) acquirers’ ownership of targets before and after the transaction. Additionally, we identify the similarities and differences of this market with those of the dominant market worldwide, namely the US. Both markets show similar trends in their activity and the occurrence of waves concentrated around economic shocks. However, the European market notably exhibits higher levels of friendly and cash deals.
Data-Centric and Multimedia Components
2011
The content of XML documents is often primarily plain text, interspersed with various headers and perhaps some lists and tables. However, there are many applications for which the content of documents is not primarily narrative in nature, but instead includes (portions of) data records that are subject to storage and computational manipulation. The latter documents are sometimes referred to as data-centric or record-like, and they rely extensively on precise descriptions of the forms of data that can appear. In this chapter we first introduce the data type definition capabilities in XML Schema. We then consider the types of data very common in traditional databases: numeric data, dates, and…
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.