Asymptotic model for shape resonance control of diatomics by intense non-resonant light: universality in the single-channel approximation

Non-resonant light interacting with diatomics via the polarizability anisotropy couples different rotational states and may lead to strong hybridization of the motion. The modification of shape resonances and low-energy scattering states due to this interaction can be fully captured by an asymptotic model, based on the long-range properties of the scattering (Crubellier et al 2015 New J. Phys. 17 045020). Remarkably, the properties of the field-dressed shape resonances in this asymptotic multi-channel description are found to be approximately linear in the field intensity up to fairly large intensity. This suggests a perturbative single-channel approach to be sufficient to study the control of such resonances by the non-resonant field. The multi-channel results furthermore indicate the dependence on field intensity to present, at least approximately, universal characteristics. Here we combine the nodal line technique to solve the asymptotic Schrödinger equation with perturbation theory. Comparing our single channel results to those obtained with the full interaction potential, we find nodal lines depending only on the field-free scattering length of the diatom to yield an approximate but universal description of the field-dressed molecule, confirming universal behavior.

Explorations of the Practical Issues of Learning Prediction-Control Tasks Using Temporal Difference Learning Methods

There has been recent interest in using temporal difference learning methods to attack problems of prediction and control. While these algorithms have been brought to bear on many problems, they remain poorly understood. It is the purpose of this thesis to further explore these algorithms, presenting a framework for viewing them and raising a number of practical issues and exploring those issues in the context of several case studies. This includes applying the TD(lambda) algorithm to: 1) learning to play tic-tac-toe from the outcome of self-play and of play against a perfectly-playing opponent and 2) learning simple one-dimensional segmentation tasks.

Feature Point Detection and Curve Approximation for Early Processing of Freehand Sketches

Freehand sketching is both a natural and crucial part of design, yet is unsupported by current design automation software. We are working to combine the flexibility and ease of use of paper and pencil with the processing power of a computer to produce a design environment that feels as natural as paper, yet is considerably smarter. One of the most basic steps in accomplishing this is converting the original digitized pen strokes in the sketch into the intended geometric objects using feature point detection and approximation. We demonstrate how multiple sources of information can be combined for feature detection in strokes and apply this technique using two approaches to signal processing, one using simple average based thresholding and a second using scale space.

Measure Fields for Function Approximation

The computation of a piecewise smooth function that approximates a finite set of data points may be decomposed into two decoupled tasks: first, the computation of the locally smooth models, and hence, the segmentation of the data into classes that consist on the sets of points best approximated by each model, and second, the computation of the normalized discriminant functions for each induced class. The approximating function may then be computed as the optimal estimator with respect to this measure field. We give an efficient procedure for effecting both computations, and for the determination of the optimal number of components.

Perceptual Evaluation of Video-Realistic Speech

abstract With many visual speech animation techniques now available, there is a clear need for systematic perceptual evaluation schemes. We describe here our scheme and its application to a new video-realistic (potentially indistinguishable from real recorded video) visual-speech animation system, called Mary 101. Two types of experiments were performed: a) distinguishing visually between real and synthetic image- sequences of the same utterances, ("Turing tests") and b) gauging visual speech recognition by comparing lip-reading performance of the real and synthetic image-sequences of the same utterances ("Intelligibility tests"). Subjects that were presented randomly with either real or synthetic image-sequences could not tell the synthetic from the real sequences above chance level. The same subjects when asked to lip-read the utterances from the same image-sequences recognized speech from real image-sequences significantly better than from synthetic ones. However, performance for both, real and synthetic, were at levels suggested in the literature on lip-reading. We conclude from the two experiments that the animation of Mary 101 is adequate for providing a percept of a talking head. However, additional effort is required to improve the animation for lip-reading purposes like rehabilitation and language learning. In addition, these two tasks could be considered as explicit and implicit perceptual discrimination tasks. In the explicit task (a), each stimulus is classified directly as a synthetic or real image-sequence by detecting a possible difference between the synthetic and the real image-sequences. The implicit perceptual discrimination task (b) consists of a comparison between visual recognition of speech of real and synthetic image-sequences. Our results suggest that implicit perceptual discrimination is a more sensitive method for discrimination between synthetic and real image-sequences than explicit perceptual discrimination.

An Equivalence Between Sparse Approximation and Support Vector Machines

In the first part of this paper we show a similarity between the principle of Structural Risk Minimization Principle (SRM) (Vapnik, 1982) and the idea of Sparse Approximation, as defined in (Chen, Donoho and Saunders, 1995) and Olshausen and Field (1996). Then we focus on two specific (approximate) implementations of SRM and Sparse Approximation, which have been used to solve the problem of function approximation. For SRM we consider the Support Vector Machine technique proposed by V. Vapnik and his team at AT&T Bell Labs, and for Sparse Approximation we consider a modification of the Basis Pursuit De-Noising algorithm proposed by Chen, Donoho and Saunders (1995). We show that, under certain conditions, these two techniques are equivalent: they give the same solution and they require the solution of the same quadratic programming problem.

Convergence Rates of Approximation by Translates

In this paper we consider the problem of approximating a function belonging to some funtion space Φ by a linear comination of n translates of a given function G. Ussing a lemma by Jones (1990) and Barron (1991) we show that it is possible to define function spaces and functions G for which the rate of convergence to zero of the erro is 0(1/n) in any number of dimensions. The apparent avoidance of the "curse of dimensionality" is due to the fact that these function spaces are more and more constrained as the dimension increases. Examples include spaces of the Sobolev tpe, in which the number of weak derivatives is required to be larger than the number of dimensions. We give results both for approximation in the L2 norm and in the Lc norm. The interesting feature of these results is that, thanks to the constructive nature of Jones" and Barron"s lemma, an iterative procedure is defined that can achieve this rate.

Exploring Bit-Difference for Approximate KNN Search in High-dimensional Databases

In this paper, we develop a novel index structure to support efficient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of the distance (e.g., Euclidean distance) between two points contributes a dominant portion of the overall query response time for memory processing. To reduce the distance computation, we first propose a structure (BID) using BIt-Difference to answer approximate KNN query. The BID employs one bit to represent each feature vector of point and the number of bit-difference is used to prune the further points. To facilitate real dataset which is typically skewed, we enhance the BID mechanism with clustering, cluster adapted bitcoder and dimensional weight, named the BID⁺. Extensive experiments are conducted to show that our proposed method yields significant performance advantages over the existing index structures on both real life and synthetic high-dimensional datasets.

Integro-difference equations for interacting species and the Neolithic transition

We introduce a set of sequential integro-difference equations to analyze the dynamics of two interacting species. Firstly, we derive the speed of the fronts when a species invades a space previously occupied by a second species, and check its validity by means of numerical random-walk simulations. As an example, we consider the Neolithic transition: the predictions of the model are consistent with the archaeological data for the front speed, provided that the interaction parameter is low enough. Secondly, an equation for the coexistence time between the invasive and the invaded populations is obtained for the first time. It agrees well with the simulations, is consistent with observations of the Neolithic transition, and makes it possible to estimate the value of the interaction parameter between the incoming and the indigenous populations

A First approximation to the realism/idealism debate about the external world

El text intenta fer una primera aproximació al debat contemporani entre realistes i anti-realistes sobre el món empíric, centrant-se en les posicions de Putnam i Nagel. El seu objectiu principal és el d'entendre les motivacions de les posicions i l'estructura actual del debat, i el d'establir les característiques que hauria de tenir qualsevol posició satisfactòria

Replicated nil associations of digit ratio (2D:4D) and absolute finger lengths with implicit and explicit measures of aggression. 'Replicaci??n de asociaciones nulas del ratio del segundo y cuarto dedo (2D:4D) y la longitud absoluta de los dedos con medidas de agresi??n impl??citas y expl??citas'

Resumen tomado de la publicaci??n

Factores determinantes del margen entre la deuda corporativa y la deuda pública en Colombia

Este trabajo hace una estimación explicita de los factores en los cuales está compuesto el margen corporativo, entendido este como la diferencia entre la tasa spot de deuda pública y la tasa spot de deuda corporativa con calificación AAA y AA. La metodología implementada, es la propuesta por Elton et al (2001), y de esta manera se establece el margen corporativo como la suma de tres factores: factor por riesgo de emisor, factor por costos de emisión y factor por riesgo sistémico. La muestra analizada contiene los datos diarios de negociación observados en el Mercado Electrónico Colombiano (MEC) desde enero de 2005 hasta noviembre de 2009, las probabilidades de incumplimiento son estimadas a partir de las matrices de transición calculadas por las dos principales calificadoras de valores del mercado colombiano.

What’s the Difference between Web Technology and Web Science? Opportunities for study and research at the University of Southampton

The University of Southampton has a long history of pursuing research, development and social change with the Web This document guides you through the opportunities for Web-related study and research that we offer: an MSc in Web Technology; a 3-year PhD in Web Technology; an MSc in Web Science or a 4-year PhD in Web Science

El perdón y la filosofía

El objetivo de este trabajo es mostrar el papel que desempeña la filosofía al hacer explícita la relación existente entre incondicionalidad y condicionalidad del perdón, es decir que el único perdón que tiene sentido es aquel que perdona lo imperdonable, donde la fuerza del concepto se encuentra determinada por su incondicionalidad. Esto puede ser llamado “la fuerza teórica del concepto” y a pesar de ello se encuentra determinado por su carácter práctico, donde se busca reunir las condiciones necesarias para otorgar un “justo” perdón. Por otra parte, se busca hacer explícita la conexión existente entre el concepto de perdón y el concepto de diferencia, de modo que cada elaboración del primer concepto “devela” una forma de teorizar y aplicar el segundo. El perdón surge como un acontecimiento con múltiples dimensiones: figura religiosa, concepto filosófico, acto político; por tanto, es imposible crear un concepto único del perdón, su multidimensionalidad exige que esa construcción sea examinada desde una pluralidad de perspectivas. Además, es de resaltar que dicha multidimensionalidad genera una ganancia para la filosofía, pues nos introduce en diferentes escenarios del ejercicio filosófico, desentrañando la filosofía desde el hacer, mostrando cómo surge en otros campos, para hacerse filosofía. Es decir, a partir del perdón es posible hacer filosofía, evitando caer en una filosofía del perdón.

An approximation to the digital divide among low income people in Colombia, Mexico and Perú: two composite indexes

El estudio analiza los determinantes de uso y acceso a las tecnologías de información y comunicación en personas de bajos ingresos en pasases como Colombia, México y Perú. El punto central está en analizar las diferencias entre países de acuerdo a diferentes variables socioeconómicas. Se encuentra que la variable que más explica el nivel de acceso digital es la escolaridad. De otro lado no se encuentra una brecha por género sino en Perú. Los resultados también indican que cuando solo se tienen en cuenta las tecnologías más ‘avanzadas’, las diferencias entre la población son más notorias