Displaying 21 – 40 of 862

Showing per page

A generalization of Ueno's inequality for n-step transition probabilities

Andrzej Nowak (1998)

Applicationes Mathematicae

We provide a generalization of Ueno's inequality for n-step transition probabilities of Markov chains in a general state space. Our result is relevant to the study of adaptive control problems and approximation problems in the theory of discrete-time Markov decision processes and stochastic games.

A generalized dual maximizer for the Monge–Kantorovich transport problem

Mathias Beiglböck, Christian Léonard, Walter Schachermayer (2012)

ESAIM: Probability and Statistics

The dual attainment of the Monge–Kantorovich transport problem is analyzed in a general setting. The spaces X,Y are assumed to be polish and equipped with Borel probability measures μ and ν. The transport cost function c : X × Y →  [0,∞]  is assumed to be Borel measurable. We show that a dual optimizer always exists, provided we interpret it as a projective limit of certain finitely additive measures. Our methods are functional analytic and rely on Fenchel’s perturbation technique.

A generalized dual maximizer for the Monge–Kantorovich transport problem∗

Mathias Beiglböck, Christian Léonard, Walter Schachermayer (2012)

ESAIM: Probability and Statistics

The dual attainment of the Monge–Kantorovich transport problem is analyzed in a general setting. The spaces X,Y are assumed to be polish and equipped with Borel probability measures μ and ν. The transport cost function c : X × Y →  [0,∞]  is assumed to be Borel measurable. We show that a dual optimizer always exists, provided we interpret it as a projective limit of certain finitely additive measures. Our methods are functional analytic...

A mathematical framework for learning and adaption: (generalized) random systems with complete connections.

Ulrich Herkenrath, Radu Theodorescu (1981)

Trabajos de Estadística e Investigación Operativa

The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.

A mixed active and passive GLR test for a fault tolerant control system

Hicham Jamouli, Mohamed Amine El Hail, Dominique Sauter (2012)

International Journal of Applied Mathematics and Computer Science

This paper presents an adaptive Generalized Likelihood Ratio (GLR) test for multiple Faults Detection and Isolation (FDI) in stochastic linear dynamic systems. Based on the work of Willsky and Jones (1976), we propose a modified generalized likelihood ratio test, allowing detection, isolation and estimation of multiple sequential faults. Our contribution aims to maximise the good decision rate of fault detection using another updating strategy. This is based on a reference model updated on-line...

A multi-agent brokerage platform for media content recommendation

Bruno Veloso, Benedita Malheiro, Juan Carlos Burguillo (2015)

International Journal of Applied Mathematics and Computer Science

Near real time media content personalisation is nowadays a major challenge involving media content sources, distributors and viewers. This paper describes an approach to seamless recommendation, negotiation and transaction of personalised media content. It adopts an integrated view of the problem by proposing, on the business-to-business (B2B) side, a brokerage platform to negotiate the media items on behalf of the media content distributors and sources, providing viewers, on the business-to-consumer...

A multidimensional singular stochastic control problem on a finite time horizon

Marcin Boryc, Łukasz Kruk (2015)

Annales UMCS, Mathematica

A singular stochastic control problem in n dimensions with timedependent coefficients on a finite time horizon is considered. We show that the value function for this problem is a generalized solution of the corresponding HJB equation with locally bounded second derivatives with respect to the space variables and the first derivative with respect to time. Moreover, we prove that an optimal control exists and is unique

A note on the optimal portfolio problem in discrete processes

Naoyuki Ishimura, Yuji Mita (2009)

Kybernetika

We deal with the optimal portfolio problem in discrete-time setting. Employing the discrete Itô formula, which is developed by Fujita, we establish the discrete Hamilton–Jacobi–Bellman (d-HJB) equation for the value function. Simple examples of the d-HJB equation are also discussed.

A novel fuzzy c-regression model algorithm using a new error measure and particle swarm optimization

Moêz Soltani, Abdelkader Chaari, Fayçal Ben Hmida (2012)

International Journal of Applied Mathematics and Computer Science

This paper presents a new algorithm for fuzzy c-regression model clustering. The proposed methodology is based on adding a second regularization term in the objective function of a Fuzzy C-Regression Model (FCRM) clustering algorithm in order to take into account noisy data. In addition, a new error measure is used in the objective function of the FCRM algorithm, replacing the one used in this type of algorithm. Then, particle swarm optimization is employed to finally tune parameters of the obtained...

Currently displaying 21 – 40 of 862