A METHODOLOGY FOR DETECTING BREAKS IN THE MEAN AND COVARIANCE STRUCTURE OF TIME SERIES
Texte intégral
Documents relatifs
To obtain an asymptotic formula for the MRT, we show that in the long time asymptotics, where winding occurs, the GOUP can be approximated by a standard Ornstein- Uhlenbeck
We show that this absence of negative values re- sults from the correlation between rain and divergence: averaging divergence conditionally on the absence of rain automatically
But in the case when individual components are highly reliable (in the sense that failure rates are much smaller than the repair rates), this often requires a very long computation
We develop a splitting method to prove the well-posedness, in short time, of solutions for two master equations in mean field game (MFG) theory: the second order master
DFT maps the time series data fromthe time domain to the frequency domain, and the fast Fourier transform algorithm (FFT) can compute the DFT coefficients in O (mn log n) time..
To allow time series comparison while dealing with time delays, numerous alignments strategies have been proposed, as the ones based on Dynamic Time Warping (DTW) [1], which
This paper deals with the convergence of the expected improvement algorithm, a popular global optimization algo- rithm based on a Gaussian process model of the function to
If a harmonic plane wave is normally incident on an infinite row, we highlight the transmission (resp. the total reflection) of the waves by the phononic crystal for certain