Query-Sensitive Embeddings

A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, especially in domains where objects are compared using computationally expensive similarity (or distance) measures. This paper proposes a novel method for approximate nearest neighbor retrieval in such spaces. Our method is embedding-based, meaning that it constructs a function that maps objects into a real vector space. The mapping preserves a large amount of the proximity structure of the original space, and it can be used to rapidly obtain a short list of likely matches to the query. The main novelty of our method is that it constructs, together with the embedding, a query-sensitive distance measure that should be used when measuring distances in the vector space. The term "query-sensitive" means that the distance measure changes depending on the current query object. We report experiments with an image database of handwritten digits, and a time-series database. In both cases, the proposed method outperforms existing state-of-the-art embedding methods, meaning that it provides significantly better trade-offs between efficiency and retrieval accuracy.

On Osgood theorem in Banach spaces

Let $X$ be a real Banach space, $\omega:[0,+\infty)\to\R$ be an increasing continuous function such that $\omega(0)=0$ and $\omega(t+s)\leq\omega(t)+\omega(s)$ for all $t,s\in[0,+\infty)$. By the Osgood theorem, if $\int_{0}^1\frac{dt}{\omega(t)}=\infty$, then for any $(t_0,x_0)\in R\times X$ and any continuous map $f: R\times X\to X$ and such that $\|f(t,x)-f(t,y)\|\leq\omega(\|x-y\|)$ for all $t\in R$, $x,y\in X$, the Cauchy problem $\dot x(t)=f(t,x(t))$, $(t_0)=x_0$ has a unique solution in a neighborhood of $t_0$ . We prove that if $X$ has a complemented subspace with an unconditional Schauder basis and $\int_{0}^1\frac{dt}{\omega(t)}

Improvisation, Indeterminacy and Game-Mediated Participation in Network Music Performance

This chapter focuses on the relationship between improvisation and indeterminacy. We discuss the two practices by referring to play theory and game studies and situate it in recent network music performance. We will develop a parallel with game theory in which indeterminacy is seen as a way of articulating situations where structural decisions are left to the discernment of the performers and discuss improvisation as a method of play. The improvisation-indeterminacy relationship is discussed in the context of network music performance, which employs digital networks in the exchange of data between performers and hence relies on topological structures with varying degrees of openness and flexibility. Artists such as Max Neuhaus and The League of Automatic Music Composers initiated the development of a multitude of practices and technologies exploring the network as an environment for music making. Even though the technologies behind “the network” have shifted dramatically since Neuhaus’ use of radio in the 1960’s, a preoccupation with distribution and sharing of artistic agency has remained at the centre of networked practices. Gollo Föllmer, after undertaking an extensive review of network music initiatives, produced a typology that comprises categories as diverse as remix lists, sound toys, real/virtual space installations and network performances. For Föllmer, “the term ‘Net music’ comprises all formal and stylistic kinds of music upon which the specifics of electronic networks leave considerable traces, whereby the electronic networks strongly influence the process of musical production, the musical aesthetic, or the way music is received” (2005: 185).

The Wolf and the Whale: aesthetic relationships between electroacoustic music and poetry inspired by the Canadian landscape

La version intégrale de cette thèse est disponible uniquement pour consultation individuelle à la Bibliothèque de musique de l’Université de Montréal (www.bib.umontreal.ca/MU).

Statistical modeling on (α, +∞)

Observations in daily practice are sometimes registered as positive values larger then a given threshold α. The sample space is in this case the interval (α,+∞), α > 0, which can be structured as a real Euclidean space in different ways. This fact opens the door to alternative statistical models depending not only on the assumed distribution function, but also on the metric which is considered as appropriate, i.e. the way differences are measured, and thus variability

Distributions on the simplex

The simplex, the sample space of compositional data, can be structured as a real Euclidean space. This fact allows to work with the coefficients with respect to an orthonormal basis. Over these coefficients we apply standard real analysis, inparticular, we define two different laws of probability trought the density function and we study their main properties

Perspex machine VII: The universal perspex machine

The perspex machine arose from the unification of projective geometry with the Turing machine. It uses a total arithmetic, called transreal arithmetic, that contains real arithmetic and allows division by zero. Transreal arithmetic is redefined here. The new arithmetic has both a positive and a negative infinity which lie at the extremes of the number line, and a number nullity that lies off the number line. We prove that nullity, 0/0, is a number. Hence a number may have one of four signs: negative, zero, positive, or nullity. It is, therefore, impossible to encode the sign of a number in one bit, as floating-, point arithmetic attempts to do, resulting in the difficulty of having both positive and negative zeros and NaNs. Transrational arithmetic is consistent with Cantor arithmetic. In an extension to real arithmetic, the product of zero, an infinity, or nullity with its reciprocal is nullity, not unity. This avoids the usual contradictions that follow from allowing division by zero. Transreal arithmetic has a fixed algebraic structure and does not admit options as IEEE, floating-point arithmetic does. Most significantly, nullity has a simple semantics that is related to zero. Zero means "no value" and nullity means "no information." We argue that nullity is as useful to a manufactured computer as zero is to a human computer. The perspex machine is intended to offer one solution to the mind-body problem by showing how the computable aspects of mind and. perhaps, the whole of mind relates to the geometrical aspects of body and, perhaps, the whole of body. We review some of Turing's writings and show that he held the view that his machine has spatial properties. In particular, that it has the property of being a 7D lattice of compact spaces. Thus, we read Turing as believing that his machine relates computation to geometrical bodies. We simplify the perspex machine by substituting an augmented Euclidean geometry for projective geometry. This leads to a general-linear perspex-machine which is very much easier to pro-ram than the original perspex-machine. We then show how to map the whole of perspex space into a unit cube. This allows us to construct a fractal of perspex machines with the cardinality of a real-numbered line or space. This fractal is the universal perspex machine. It can solve, in unit time, the halting problem for itself and for all perspex machines instantiated in real-numbered space, including all Turing machines. We cite an experiment that has been proposed to test the physical reality of the perspex machine's model of time, but we make no claim that the physical universe works this way or that it has the cardinality of the perspex machine. We leave it that the perspex machine provides an upper bound on the computational properties of physical things, including manufactured computers and biological organisms, that have a cardinality no greater than the real-number line.

On a formula for the spectral flow and its applications

We consider a continuous path of bounded symmetric Fredholm bilinear forms with arbitrary endpoints on a real Hilbert space, and we prove a formula that gives the spectral flow of the path in terms of the spectral flow of the restriction to a finite codimensional closed subspace. We also discuss the case of restrictions to a continuous path of finite codimensional closed subspaces. As an application of the formula, we introduce the notion of spectral flow for a periodic semi-Riemannian geodesic, and we compute its value in terms of the Maslov index. (C) 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Flash Mob: da rede à praça

This work explores the flash mobs, which are flash mobilizations arranged by intent that involve a large number of people to do something together in a pre-arranged place. With the advent of 2.0 Internet, the sharing of information and the mobile virtual communication grown up and showed behavior of an individual person to meet for a common interest. Those affective relationships born in the social networks come to the urban space in a real-virtual space junction and the possibilities of that are unexplored yet. Studied by this work, the Y generation is the flash mob most popular public and uses those mobilizations to reinforce their fan identity and appreciation for a media product

Bourgin-Yang version of the Borsuk-Ulam theorem for Z(pk)-equivariant maps

Let G = Z(pk) be a cyclic group of prime power order and let V and W be orthogonal representations of G with V-G = W-G = W-G = {0}. Let S(V) be the sphere of V and suppose f: S(V) -> W is a G-equivariant mapping. We give an estimate for the dimension of the set f(-1){0} in terms of V and W. This extends the Bourgin-Yang version of the Borsuk-Ulam theorem to this class of groups. Using this estimate, we also estimate the size of the G-coincidences set of a continuous map from S(V) into a real vector space W'.

Hyperplane arrangements, interval orders, and trees.

A hyperplane arrangement is a finite set of hyperplanes in a real affine space. An especially important arrangement is the braid arrangement, which is the set of all hyperplanes xi - xj = 1, 1

Sampling Quantum Nonlocal Correlations with High Probability

It is well known that quantum correlations for bipartite dichotomic measurements are those of the form (Formula presented.), where the vectors ui and vj are in the unit ball of a real Hilbert space. In this work we study the probability of the nonlocal nature of these correlations as a function of (Formula presented.), where the previous vectors are sampled according to the Haar measure in the unit sphere of (Formula presented.). In particular, we prove the existence of an (Formula presented.) such that if (Formula presented.), (Formula presented.) is nonlocal with probability tending to 1 as (Formula presented.), while for (Formula presented.), (Formula presented.) is local with probability tending to 1 as (Formula presented.).

An approximate Hahn–Banach theorem for positively homogeneous functions

This note provides an approximate version of the Hahn–Banach theorem for non-necessarily convex extended-real valued positively homogeneous functions of degree one. Given p : X → R∪{+∞} such a function defined on the real vector space X, and a linear function defined on a subspace V of X and dominated by p (i.e. (x) ≤ p(x) for all x ∈ V), we say that can approximately be p-extended to X, if is the pointwise limit of a net of linear functions on V, every one of which can be extended to a linear function defined on X and dominated by p. The main result of this note proves that can approximately be p-extended to X if and only if is dominated by p∗∗, the pointwise supremum over the family of all the linear functions on X which are dominated by p.

Perturbed Proximal Point Algorithm with Nonquadratic Kernel

Let H be a real Hilbert space and T be a maximal monotone operator on H. A well-known algorithm, developed by R. T. Rockafellar [16], for solving the problem (P) ”To find x ∈ H such that 0 ∈ T x” is the proximal point algorithm. Several generalizations have been considered by several authors: introduction of a perturbation, introduction of a variable metric in the perturbed algorithm, introduction of a pseudo-metric in place of the classical regularization, . . . We summarize some of these extensions by taking simultaneously into account a pseudo-metric as regularization and a perturbation in an inexact version of the algorithm.

The Perturbed Generalized Tikhonov's Algorithm

We work on the research of a zero of a maximal monotone operator on a real Hilbert space. Following the recent progress made in the context of the proximal point algorithm devoted to this problem, we introduce simultaneously a variable metric and a kind of relaxation in the perturbed Tikhonov’s algorithm studied by P. Tossings. So, we are led to work in the context of the variational convergence theory.