scholarly journals Maximum Entropy on the Mean approach to solve generalized inverse problems with an application in computational thermodynamics.

Author(s):  
Eva Lawrence ◽  
Fabrice Gamboa ◽  
Thierry Klein ◽  
Christine Guéneau

In this paper, we study entropy maximisation problems in order to reconstruct functions or measures subject to very general integral constraints. Our work has a twofold purpose. We first make a global synthesis of entropy maximisation problems in the case of a single reconstruction (measure or function) from the convex analysis point of view, as well as in the framework of the embedding into the Maximum Entropy on the Mean (MEM) setting. We further propose an extension of the entropy methods for a multidimensional case.

2004 ◽  
Vol 155 (5) ◽  
pp. 142-145 ◽  
Author(s):  
Claudio Defila

The record-breaking heatwave of 2003 also had an impact on the vegetation in Switzerland. To examine its influences seven phenological late spring and summer phases were evaluated together with six phases in the autumn from a selection of stations. 30% of the 122 chosen phenological time series in late spring and summer phases set a new record (earliest arrival). The proportion of very early arrivals is very high and the mean deviation from the norm is between 10 and 20 days. The situation was less extreme in autumn, where 20% of the 103 time series chosen set a new record. The majority of the phenological arrivals were found in the class «normal» but the class«very early» is still well represented. The mean precocity lies between five and twenty days. As far as the leaf shedding of the beech is concerned, there was even a slight delay of around six days. The evaluation serves to show that the heatwave of 2003 strongly influenced the phenological events of summer and spring.


2018 ◽  
Vol 21 (08) ◽  
pp. 1850054 ◽  
Author(s):  
DAVID BAUDER ◽  
TARAS BODNAR ◽  
STEPAN MAZUR ◽  
YAREMA OKHRIN

In this paper, we consider the estimation of the weights of tangent portfolios from the Bayesian point of view assuming normal conditional distributions of the logarithmic returns. For diffuse and conjugate priors for the mean vector and the covariance matrix, we derive stochastic representations for the posterior distributions of the weights of tangent portfolio and their linear combinations. Separately, we provide the mean and variance of the posterior distributions, which are of key importance for portfolio selection. The analytic results are evaluated within a simulation study, where the precision of coverage intervals is assessed.


2019 ◽  
Vol 27 (3) ◽  
pp. 317-340 ◽  
Author(s):  
Max Kontak ◽  
Volker Michel

Abstract In this work, we present the so-called Regularized Weak Functional Matching Pursuit (RWFMP) algorithm, which is a weak greedy algorithm for linear ill-posed inverse problems. In comparison to the Regularized Functional Matching Pursuit (RFMP), on which it is based, the RWFMP possesses an improved theoretical analysis including the guaranteed existence of the iterates, the convergence of the algorithm for inverse problems in infinite-dimensional Hilbert spaces, and a convergence rate, which is also valid for the particular case of the RFMP. Another improvement is the cancellation of the previously required and difficult to verify semi-frame condition. Furthermore, we provide an a-priori parameter choice rule for the RWFMP, which yields a convergent regularization. Finally, we will give a numerical example, which shows that the “weak” approach is also beneficial from the computational point of view. By applying an improved search strategy in the algorithm, which is motivated by the weak approach, we can save up to 90  of computation time in comparison to the RFMP, whereas the accuracy of the solution does not change as much.


2001 ◽  
Vol 16 (25) ◽  
pp. 4207-4222 ◽  
Author(s):  
J. A. NIETO ◽  
L. N. ALEJO-ARMENTA

By using tensor analysis, we find a connection between normed algebras and the parallelizability of the spheres S 1, S 3 and S 7. In this process, we discovered the analog of Hurwitz theorem for curved spaces and a geometrical unified formalism for the metric and the torsion. In order to achieve these goals we first develop a proof of Hurwitz theorem based on tensor analysis. It turns out that in contrast to the doubling procedure and Clifford algebra mechanism, our proof is entirely based on tensor algebra applied to the normed algebra condition. From the tersor analysis point of view our proof is straightforward and short. We also discuss a possible connection between our formalism and the Cayley–Dickson algebras and Hopf maps.


2018 ◽  
Vol 10 (5) ◽  
Author(s):  
Almoctar Hassoumi ◽  
Vsevolod Peysakhovich ◽  
Christophe Hurter

      In this paper, we investigate how visualization assets can support the qualitative evaluation of gaze estimation uncertainty. Although eye tracking data are commonly available, little has been done to visually investigate the uncertainty of recorded gaze information. This paper tries to fill this gap by using innovative uncertainty computation and visualization. Given a gaze processing pipeline, we estimate the location of this gaze position in the world camera. To do so we developed our own gaze data processing which give us access to every stage of the data transformation and thus the uncertainty computation. To validate our gaze estimation pipeline, we designed an experiment with 12 participants and showed that the correction methods we proposed reduced the Mean Angular Error by about 1.32 cm, aggregating all 12 participants’ results. The Mean Angular Error is 0.25° (SD=0.15°) after correction of the estimated gaze. Next, to support the qualitative assessment of this data, we provide a map which codes the actual uncertainty in the user point of view. 


Sign in / Sign up

Export Citation Format

Share Document