Stochastic differential equations with random coefficients

In this paper we establish the existence and uniqueness of a solution for different types of stochastic differential equation with random initial conditions and random coefficients. The stochastic integral is interpreted as a generalized Stratonovich integral, and the techniques used to derive these results are mainly based on the path properties of the Brownian motion, and the definition of the Stratonovich integral.

Large deviations for stochastic Volterra equations

This paper is devoted to prove a large-deviation principle for solutions to multidimensional stochastic Volterra equations.

Stochastic delay differential equations driven by fractional Brownian motion with Hurst parameter H 1/2

We consider the Cauchy problem for a stochastic delay differential equation driven by a fractional Brownian motion with Hurst parameter H>¿. We prove an existence and uniqueness result for this problem, when the coefficients are sufficiently regular. Furthermore, if the diffusion coefficient is bounded away from zero and the coefficients are smooth functions with bounded derivatives of all orders, we prove that the law of the solution admits a smooth density with respect to Lebesgue measure on R.

Polydispersity index from linear viscoelastic data: Unimodal and bimodal linear polymer melts

This article describes a method for determining the polydispersity index Ip2=Mz/Mw of the molecular weight distribution (MWD) of linear polymeric materials from linear viscoelastic data. The method uses the Mellin transform of the relaxation modulus of a simple molecular rheological model. One of the main features of this technique is that it enables interesting MWD information to be obtained directly from dynamic shear experiments. It is not necessary to achieve the relaxation spectrum, so the ill-posed problem is avoided. Furthermore, a determinate shape of the continuous MWD does not have to be assumed in order to obtain the polydispersity index. The technique has been developed to deal with entangled linear polymers, whatever the form of the MWD is. The rheological information required to obtain the polydispersity index is the storage G′(ω) and loss G″(ω) moduli, extending from the terminal zone to the plateau region. The method provides a good agreement between the proposed theoretical approach and the experimental polydispersity indices of several linear polymers for a wide range of average molecular weights and polydispersity indices. It is also applicable to binary blends.

On the tractability of the piecewise-linear approximation for general discrete-choice network revenue management

The choice network revenue management (RM) model incorporates customer purchase behavioras customers purchasing products with certain probabilities that are a function of the offeredassortment of products, and is the appropriate model for airline and hotel network revenuemanagement, dynamic sales of bundles, and dynamic assortment optimization. The underlyingstochastic dynamic program is intractable and even its certainty-equivalence approximation, inthe form of a linear program called Choice Deterministic Linear Program (CDLP) is difficultto solve in most cases. The separation problem for CDLP is NP-complete for MNL with justtwo segments when their consideration sets overlap; the affine approximation of the dynamicprogram is NP-complete for even a single-segment MNL. This is in contrast to the independentclass(perfect-segmentation) case where even the piecewise-linear approximation has been shownto be tractable. In this paper we investigate the piecewise-linear approximation for network RMunder a general discrete-choice model of demand. We show that the gap between the CDLP andthe piecewise-linear bounds is within a factor of at most 2. We then show that the piecewiselinearapproximation is polynomially-time solvable for a fixed consideration set size, bringing itinto the realm of tractability for small consideration sets; small consideration sets are a reasonablemodeling tradeoff in many practical applications. Our solution relies on showing that forany discrete-choice model the separation problem for the linear program of the piecewise-linearapproximation can be solved exactly by a Lagrangian relaxation. We give modeling extensionsand show by numerical experiments the improvements from using piecewise-linear approximationfunctions.

SAT Modulo Linear Arithmetic for Solving Polynomial

Polynomial constraint solving plays a prominent role in several areas of hardware and software analysis and verification, e.g., termination proving, program invariant generation and hybrid system verification, to name a few. In this paper we propose a new method for solving non-linear constraints based on encoding the problem into an SMT problem considering only linear arithmetic. Unlike other existing methods, our method focuses on proving satisfiability of the constraints rather than on proving unsatisfiability, which is more relevant in several applications as we illustrate with several examples. Nevertheless, we also present new techniques based on the analysis of unsatisfiable cores that allow one to efficiently prove unsatisfiability too for a broad class of problems. The power of our approach is demonstrated by means of extensive experiments comparing our prototype with state-of-the-art tools on benchmarks taken both from the academic and the industrial world.

Generation and nonlinear evolution of shore-oblique/transverse sand bars

The coupling between topography, waves and currents in the surf zone may selforganize to produce the formation of shore-transverse or shore-oblique sand bars on an otherwise alongshore uniform beach. In the absence of shore-parallel bars, this has been shown by previous studies of linear stability analysis, but is now extended to the finite-amplitude regime. To this end, a nonlinear model coupling wave transformation and breaking, a shallow-water equations solver, sediment transport and bed updating is developed. The sediment flux consists of a stirring factor multiplied by the depthaveraged current plus a downslope correction. It is found that the cross-shore profile of the ratio of stirring factor to water depth together with the wave incidence angle primarily determine the shape and the type of bars, either transverse or oblique to the shore. In the latter case, they can open an acute angle against the current (upcurrent oriented) or with the current (down-current oriented). At the initial stages of development, both the intensity of the instability which is responsible for the formation of the bars and the damping due to downslope transport grow at a similar rate with bar amplitude, the former being somewhat stronger. As bars keep on growing, their finite-amplitude shape either enhances downslope transport or weakens the instability mechanism so that an equilibrium between both opposing tendencies occurs, leading to a final saturated amplitude. The overall shape of the saturated bars in plan view is similar to that of the small-amplitude ones. However, the final spacings may be up to a factor of 2 larger and final celerities can also be about a factor of 2 smaller or larger. In the case of alongshore migrating bars, the asymmetry of the longshore sections, the lee being steeper than the stoss, is well reproduced. Complex dynamics with merging and splitting of individual bars sometimes occur. Finally, in the case of shore-normal incidence the rip currents in the troughs between the bars are jet-like while the onshore return flow is wider and weaker as is observed in nature.

Maximum likelihood Linear Programming Data Fusion for Speaker Recognition

Biometric system performance can be improved by means of data fusion. Several kinds of information can be fused in order to obtain a more accurate classification (identification or verification) of an input sample. In this paper we present a method for computing the weights in a weighted sum fusion for score combinations, by means of a likelihood model. The maximum likelihood estimation is set as a linear programming problem. The scores are derived from a GMM classifier working on a different feature extractor. Our experimental results assesed the robustness of the system in front a changes on time (different sessions) and robustness in front a change of microphone. The improvements obtained were significantly better (error bars of two standard deviations) than a uniform weighted sum or a uniform weighted product or the best single classifier. The proposed method scales computationaly with the number of scores to be fussioned as the simplex method for linear programming.

Non-Linear and Non-Conventional Speech Processing: Alternative Techniques

This special issue aims to cover some problems related to non-linear and nonconventional speech processing. The origin of this volume is in the ISCA Tutorial and Research Workshop on Non-Linear Speech Processing, NOLISP’09, held at the Universitat de Vic (Catalonia, Spain) on June 25–27, 2009. The series of NOLISP workshops started in 2003 has become a biannual event whose aim is to discuss alternative techniques for speech processing that, in a sense, do not fit into mainstream approaches. A selected choice of papers based on the presentations delivered at NOLISP’09 has given rise to this issue of Cognitive Computation.

A Canonical Genetic Algorithm for Blind Inversion of Linear Channels

It is well known the relationship between source separation and blind deconvolution: If a filtered version of an unknown i.i.d. signal is observed, temporal independence between samples can be used to retrieve the original signal, in the same manner as spatial independence is used for source separation. In this paper we propose the use of a Genetic Algorithm (GA) to blindly invert linear channels. The use of GA is justified in the case of small number of samples, where other gradient-like methods fails because of poor estimation of statistics.

On the approximation of the subgrid scale for systems of equations

Postprint (published version)

On periodic solutions of 2-periodic Lyness difference equations

We study the existence of periodic solutions of the non--autonomous periodic Lyness' recurrence u_{n+2}=(a_n+u_{n+1})/u_n, where {a_n} is a cycle with positive values a,b and with positive initial conditions. It is known that for a=b=1 all the sequences generated by this recurrence are 5-periodic. We prove that for each pair (a,b) different from (1,1) there are infinitely many initial conditions giving rise to periodic sequences, and that the family of recurrences have almost all the even periods. If a is not equal to b, then any odd period, except 1, appears.

Kinetic equations for difussion in the presence of entropic barriers

We use the mesoscopic nonequilibrium thermodynamics theory to derive the general kinetic equation of a system in the presence of potential barriers. The result is applied to a description of the evolution of systems whose dynamics is influenced by entropic barriers. We analyze in detail the case of diffusion in a domain of irregular geometry in which the presence of the boundaries induces an entropy barrier when approaching the exact dynamics by a coarsening of the description. The corresponding kinetic equation, named the Fick-Jacobs equation, is obtained, and its validity is generalized through the formulation of a scaling law for the diffusion coefficient which depends on the shape of the boundaries. The method we propose can be useful to analyze the dynamics of systems at the nanoscale where the presence of entropy barriers is a common feature.

Bayes linear spaces

Linear spaces consisting of σ-finite probability measures and infinite measures (improper priors and likelihood functions) are defined. The commutative group operation, called perturbation, is the updating given by Bayes theorem; the inverse operation is the Radon-Nikodym derivative. Bayes spaces of measures are sets of classes of proportional measures. In this framework, basic notions of mathematical statistics get a simple algebraic interpretation. For example, exponential families appear as affine subspaces with their sufficient statistics as a basis. Bayesian statistics, in particular some well-known properties of conjugated priors and likelihood functions, are revisited and slightly extended

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