Facet-Based Browsing in Video Retrieval: A Simulation-Based Evaluation

In this paper we introduce a novel interactive video retrieval approach which uses sub-needs of an information need for querying and organising the search process. The underlying assumption of this approach is that the search effectiveness will be enhanced when employed for interactive video retrieval. We explore the performance bounds of a faceted system by using the simulated user evaluation methodology on TRECVID data sets and also on the logs of a prior user experiment with the system. We discuss the simulated evaluation strategies employed in our evaluation and the effect on the use of both textual and visual features. The facets are simulated by the use of clustering the video shots using textual and visual features. The experimental results of our study demonstrate that the faceted browser can potentially improve the search effectiveness

Generalized Bell Inequality Experiments and Computation

We consider general settings of Bell inequality experiments with many parties, where each party chooses from a finite number of measurement settings each with a finite number of outcomes. We investigate the constraints that Bell inequalities place upon the correlations possible in a local hidden variable theories using a geometrical picture of correlations. We show that local hidden variable theories can be characterized in terms of limited computational expressiveness, which allows us to characterize families of Bell inequalities. The limited computational expressiveness for many settings (each with many outcomes) generalizes previous results about the many-party situation each with a choice of two possible measurements (each with two outcomes). Using this computational picture we present generalizations of the Popescu-Rohrlich non-local box for many parties and non-binary inputs and outputs at each site. Finally, we comment on the effect of pre-processing on measurement data in our generalized setting and show that it becomes problematic outside of the binary setting, in that it allows local hidden variable theories to simulate maximally non-local correlations such as those of these generalised Popescu-Rohrlich non-local boxes.Comment: 16 pages, 2 figures, supplemental material available upon request. Typos corrected and references adde

A Systematic Comparison of Music Similarity Adaptation Approaches

In order to support individual user perspectives and different retrieval tasks, music similarity can no longer be considered as a static element of Music Information Retrieval (MIR) systems. Various approaches have been proposed recently that allow dynamic adaptation of music similarity measures. This paper provides a systematic comparison of algorithms for metric learning and higher-level facet distance weighting on the MagnaTagATune dataset. A crossvalidation variant taking into account clip availability is presented. Applied on user generated similarity data, its effect on adaptation performance is analyzed. Special attention is paid to the amount of training data necessary for making similarity predictions on unknown data, the number of model parameters and the amount of information available about the music itself. 1

Bell nonlocality

Bell's 1964 theorem, which states that the predictions of quantum theory cannot be accounted for by any local theory, represents one of the most profound developments in the foundations of physics. In the last two decades, Bell's theorem has been a central theme of research from a variety of perspectives, mainly motivated by quantum information science, where the nonlocality of quantum theory underpins many of the advantages afforded by a quantum processing of information. The focus of this review is to a large extent oriented by these later developments. We review the main concepts and tools which have been developed to describe and study the nonlocality of quantum theory, and which have raised this topic to the status of a full sub-field of quantum information science.Comment: 65 pages, 7 figures. Final versio

Time-Constrained Temporal Logic Control of Multi-Affine Systems

In this paper, we consider the problem of controlling a dynamical system such that its trajectories satisfy a temporal logic property in a given amount of time. We focus on multi-affine systems and specifications given as syntactically co-safe linear temporal logic formulas over rectangular regions in the state space. The proposed algorithm is based on the estimation of time bounds for facet reachability problems and solving a time optimal reachability problem on the product between a weighted transition system and an automaton that enforces the satisfaction of the specification. A random optimization algorithm is used to iteratively improve the solution

The simplest causal inequalities and their violation

In a scenario where two parties share, act on and exchange some physical resource, the assumption that the parties' actions are ordered according to a definite causal structure yields constraints on the possible correlations that can be established. We show that the set of correlations that are compatible with a definite causal order forms a polytope, whose facets define causal inequalities. We fully characterize this causal polytope in the simplest case of bipartite correlations with binary inputs and outputs. We find two families of nonequivalent causal inequalities; both can be violated in the recently introduced framework of process matrices, which extends the standard quantum formalism by relaxing the implicit assumption of a fixed causal structure. Our work paves the way to a more systematic investigation of causal inequalities in a theory-independent way, and of their violation within the framework of process matrices.Comment: 7 + 4 pages, 2 figure

Reexamination of a multisetting Bell inequality for qudits

The class of d-setting, d-outcome Bell inequalities proposed by Ji and collaborators [Phys. Rev. A 78, 052103] are reexamined. For every positive integer d > 2, we show that the corresponding non-trivial Bell inequality for probabilities provides the maximum classical winning probability of the Clauser-Horne-Shimony-Holt-like game with d inputs and d outputs. We also demonstrate that the general classical upper bounds given by Ji et al. are underestimated, which invalidates many of the corresponding correlation inequalities presented thereof. We remedy this problem, partially, by providing the actual classical upper bound for d less than or equal to 13 (including non-prime values of d). We further determine that for prime value d in this range, most of these probability and correlation inequalities are tight, i.e., facet-inducing for the respective classical correlation polytope. Stronger lower and upper bounds on the quantum violation of these inequalities are obtained. In particular, we prove that once the probability inequalities are given, their correlation counterparts given by Ji and co-workers are no longer relevant in terms of detecting the entanglement of a quantum state.Comment: v3: Published version (minor rewordings, typos corrected, upper bounds in Table III improved/corrected); v2: 7 pages, 1 figure, 4 tables (substantially revised with new results on the tightness of the correlation inequalities included); v1: 7.5 pages, 1 figure, 4 tables (Comments are welcome

DCU and ISI@INEX 2010: Ad-hoc and data-centric tracks

We describe the participation of Dublin City University (DCU)and the Indian Statistical Institute (ISI) in INEX 2010. The main contributions of this paper are: i) a simplified version of Hierarchical Language Model (HLM) which involves scoring XML elements with a combined probability of generating the given query from itself and the top level article node, is shown to outperform the baselines of Language Model (LM) and Vector Space Model (VSM) scoring of XML elements; ii) the Expectation Maximization (EM) feedback in LM is shown to be the most effective on the domain specic collection of IMDB; iii) automated removal of sentences indicating aspects of irrelevance from the narratives of INEX ad-hoc topics is shown to improve retrieval eectiveness

Negotiation Games: Acquiring Skills by Playing

This paper shows the research done at the School of Industrial Engineers (ETSII) of the Technical University of Madrid (UPM), in two consecutive academic courses. In this negotiation game each team is formed by three students playing different roles, with a different degree of complexity. The game is played three different times changing the conditions and doing the Zones of Possible Agreement (ZOPA) smaller so the negotiation is going “harder” and it was more difficult for the team to achieve an agreement. Roles were distributed according to the student’s experience, since it was understood that difficulty of the roles was different, especially when there was set a time limit for negotiation. The combination of playing and training has shown that students without particularly good negotiating skills at the beginning of the experiment attained better final results than those who have natural negotiating skills, but no benefit of training