Negative association, ordering and convergence of resampling methods

We study convergence and convergence rates for resampling schemes. Our first main result is a general consistency theorem based on the notion of negative association, which is applied to establish the almost-sure weak convergence of measures output from Kitagawa's (1996) stratified resampling method. Carpenter et al's (1999) systematic resampling method is similar in structure but can fail to converge depending on the order of the input samples. We introduce a new resampling algorithm based on a stochastic rounding technique of Srinivasan (2001), which shares some attractive properties of systematic resampling, but which exhibits negative association and therefore converges irrespective of the order of the input samples. We confirm a conjecture made by Kitagawa (1996) that ordering input samples by their states in $\mathbb{R}$ yields a faster rate of convergence; we establish that when particles are ordered using the Hilbert curve in $\mathbb{R}^d$, the variance of the resampling error is ${\scriptscriptstyle\mathcal{O}}(N^{-(1+1/d)})$ under mild conditions, where $N$ is the number of particles. We use these results to establish asymptotic properties of particle algorithms based on resampling schemes that differ from multinomial resampling.Comment: 54 pages, including 30 pages of supplementary materials (a typo in Algorithm 1 has been corrected

Stability with respect to initial conditions in V-norm for nonlinear filters with ergodic observations

AbstractWe establish conditions for an exponential rate of forgetting of the initial distribution of nonlinear filters in V-norm, allowing for unbounded test functions. The analysis is conducted in an general setup involving nonnegative kernels in a random environment which allows treatment of filters and prediction filters in a single framework. The main result is illustrated on two examples, the first showing that a total variation norm stability result obtained by Douc et al. (2009) can be extended to V-norm without any additional assumptions, the second concerning a situation in which forgetting of the initial condition holds in V-norm for the filters, but the V-norm of each prediction filter is infinite.</jats:p

Melodic contour representations in the analysis of children's songs

http://igitur-archive.library.uu.nl/math/2013-0604-200726/UUindex.htmlInternational audienceChildren's songs is a particular musical genre related to folk music, with its own musical characteristics. This paper sets out to explore melodic contour in children's songs from seven different countries/nations across Europe. We look for distinctive contour patterns which differentiate the songs of each country. For pattern representation we use different viewpoints related to melodic contour, two of which also relying on beat information. Preliminary results are presented, and some initial observations regarding the patterns found, the representations used, and the genre as a whole, are discussed

Terminus-driven retreat of a major southwest Greenland tidewater glacier during the early 19th century : insights from glacier reconstructions and numerical modelling

Peer reviewedPublisher PD

Nudges, social norms and permanence in agri-environmental schemes

The permanence of land management practices adopted under Agri-environmental schemes (AES) is often questioned. This paper investigates the drivers of farmers’ decision as to whether to maintain “pro-environment” practices beyond the duration of a contract, and in particular the effect of social norms. Our results, based on the stated intentions of 395 French farmers, show that both pecuniary and non-pecuniary motivations drive farmers’ decision, which is also significantly influenced by information about a social norm. Therefore “nudging” farmers, by conveying information to them on other farmers’ pro-environmental practices, appears as a means of maintaining the long-run benefits of AES.PostprintPeer reviewe

A Lambda Term Representation Inspired by Linear Ordered Logic

We introduce a new nameless representation of lambda terms inspired by ordered logic. At a lambda abstraction, number and relative position of all occurrences of the bound variable are stored, and application carries the additional information where to cut the variable context into function and argument part. This way, complete information about free variable occurrence is available at each subterm without requiring a traversal, and environments can be kept exact such that they only assign values to variables that actually occur in the associated term. Our approach avoids space leaks in interpreters that build function closures. In this article, we prove correctness of the new representation and present an experimental evaluation of its performance in a proof checker for the Edinburgh Logical Framework. Keywords: representation of binders, explicit substitutions, ordered contexts, space leaks, Logical Framework.Comment: In Proceedings LFMTP 2011, arXiv:1110.668

Advancing global & regional reanalyses

This report outlines the structure of and summarizes the recommendations made at the 5th International Conference on Reanalysis (ICR5), attended by 259 participants from 37 countries, in Rome (Italy), on 13-17 November 2017. It first summarizes the conference structure. Then, the key recommendations of ICR5 are given for the five main conference topics: production; observations (data rescue and preparation); data assimilation methods; quality assurance of reanalysis; and applications in science, services, and policymaking. Lastly, five high-level recommendations are proposed to managing agencies on how best to advance the field of reanalyses, which serves tens of thousands of users, via enhanced research, development, and operations

FEATUR.UX: exploiting multitrack information for artistic visualization

FEATUR.UX (Feature - ous) is an audio visualization tool, currently in the process of development, which proposes to introduce a new approach to sound visualization using pre-mixed, independent multitracks and audio feature extraction. Sound visualization is usually performed using a final mix, mono or stereo track of audio. Audio feature extraction is commonly used in the field of music information retrieval to create search and recommendation systems for large music databases rather than generating live visualizations. Visualizing multitrack audio circumvents problems related to the source separation of mixed audio signals and presents an opportunity to examine interdependent relationships within and between separate streams of music. This novel approach to sound visualization aims to provide an enhanced accession to the listening experience corresponding to this use case that employs non-tonal, non-notated forms of electronic music. Findings from prior research studies focused on live performance and preliminary quantitative results from a user survey have provided the basis from which to develop a prototype that will be used throughout an iterative design study to examine the impact of using multitrack audio and audio feature extraction on sound visualization practice