Search results for " Computer"
showing 10 items of 6910 documents
Closedness properties in ex-identification
2001
In this paper we investigate in which cases unions of identifiable classes are also necessarily identifiable. We consider identification in the limit with bounds on mindchanges and anomalies. Though not closed under the set union, these identification types still have features resembling closedness. For each of them we and n such that (1) if every union of n − 1 classes out of U1, ... , Un is identifiable, so is the union of all n classes; (2) there are classes U1, ... ,Un−1 such that every union of n−2 classes out of them is identifiable, while the union of n − 1 classes is not. We show that by finding these n we can distinguish which requirements put on the identifiability of unions of cl…
On bijections vs. unary functions
1996
A set of finite structures is in Binary NP if it can be characterized by existential second order formulas in which second order quantification is over relations of arity 2. In [DLS95] subclasses of Binary NP were considered, in which the second order quantifiers range only over certain classes of relations. It was shown that many of these subclasses coincide and that all of them can be ordered in a three-level linear hierarchy, the levels of which are represented by bijections, successor relations and unary functions respectively.
Quantum Identification of Boolean Oracles
2004
The oracle identification problem (OIP) is, given a set S of M Boolean oracles out of 2 N ones, to determine which oracle in S is the current black-box oracle. We can exploit the information that candidates of the current oracle is restricted to S. The OIP contains several concrete problems such as the original Grover search and the Bernstein-Vazirani problem. Our interest is in the quantum query complexity, for which we present several upper bounds. They are quite general and mostly optimal: (i) The query complexity of OIP is \(O(\sqrt{N {\rm log} M {\rm log} N}{\rm log log} M)\) for anyS such that M = |S| > N, which is better than the obvious bound N if M \(< 2^{N/log^3 N}\). (ii) It is \…
On embedding Boolean as a subtype of integer
1990
DAQs-based wattmeters for high accuracy measurements. Comparison with the Italian power primary standard
2013
Abstract This paper is focused on the use of data acquisition boards (DAQs) for the development of high accuracy PC-based instruments for the measurements of electrical power. The proposed systems are simple, portable and low cost because they are based on commercial data acquisition boards (DAQs) connected to a common personal computer. Data processing is carried out by a commercial software based on an interpolating windowed FFT. In the paper it is shown how the voltage can be sensed directly, thanks to the DAQ input range, thus avoiding expensive voltage dividers. The set up of the DAQs-based solutions is described and the evaluation of their metrological features is made by means of a c…
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.
Existence, uniqueness and comparison results for BSDEs with Lévy jumps in an extended monotonic generator setting
2018
We show existence of a unique solution and a comparison theorem for a one-dimensional backward stochastic differential equation with jumps that emerge from a L\'evy process. The considered generators obey a time-dependent extended monotonicity condition in the y-variable and have linear time-dependent growth. Within this setting, the results generalize those of Royer (2006), Yin and Mao (2008) and, in the $L^2$-case with linear growth, those of Kruse and Popier (2016). Moreover, we introduce an approximation technique: Given a BSDE driven by Brownian motion and Poisson random measure, we consider BSDEs where the Poisson random measure admits only jumps of size larger than $1/n$. We show con…
Identifying individuality and variability in team tactics by means of statistical shape analysis and multilayer perceptrons.
2012
Abstract Offensive and defensive systems of play represent important aspects of team sports. They include the players’ positions at certain situations during a match, i.e., when players have to be on specific positions on the court. Patterns of play emerge based on the formations of the players on the court. Recognition of these patterns is important to react adequately and to adjust own strategies to the opponent. Furthermore, the ability to apply variable patterns of play seems to be promising since they make it harder for the opponent to adjust. The purpose of this study is to identify different team tactical patterns in volleyball and to analyze differences in variability. Overall 120 s…
Predictive and Evolutive Cross-Referencing for Web Textual Sources
2017
International audience; One of the main challenges in the domain of competitive intelligence is to harness important volumes of information from the web, and extract the most valuable pieces of information. As the amount of information available on the web grows rapidly and is very heterogeneous, this process becomes overwhelming for experts. To leverage this challenge, this paper presents a vision for a novel process that performs cross-referencing at web scale. This process uses a focused crawler and a semantic-based classifier to cross-reference textual items without expert intervention, based on Big Data and Semantic Web technologies. The system is described thoroughly, and interests of…