Time Data Sequential Processor /TDSP/

Time Data Sequential Processor /TDSP/ computer program provides preflight predictions for lunar trajectories from injection to impact, and for planetary escape trajectories for up to 100 hours from launch. One of the major options TDSP performs is the determination of tracking station view periods

Assessing the Distribution Consistency of Sequential Data

Given n observations, we study the consistency of a batch of k new observations, in terms of their distribution function. We propose a non-parametric, non-likelihood test based on Edgeworth expansion of the distribution function. The keypoint is to approximate the distribution of the n+k observations by the distribution of n-k among the n observations. Edgeworth expansion gives the correcting term and the rate of convergence. We also study the discrete distribution case, for which Cram\`er's condition of smoothness is not satisfied. The rate of convergence for the various cases are compared.Comment: 20 pages, 0 figure

Stochastic Collapsed Variational Inference for Sequential Data

Stochastic variational inference for collapsed models has recently been successfully applied to large scale topic modelling. In this paper, we propose a stochastic collapsed variational inference algorithm in the sequential data setting. Our algorithm is applicable to both finite hidden Markov models and hierarchical Dirichlet process hidden Markov models, and to any datasets generated by emission distributions in the exponential family. Our experiment results on two discrete datasets show that our inference is both more efficient and more accurate than its uncollapsed version, stochastic variational inference.Comment: NIPS Workshop on Advances in Approximate Bayesian Inference, 201

Discovering unbounded episodes in sequential data

One basic goal in the analysis of time-series data is to find frequent interesting episodes, i.e, collections of events occurring frequently together in the input sequence. Most widely-known work decide the interestingness of an episode from a fixed user-specified window width or interval, that bounds the subsequent sequential association rules. We present in this paper, a more intuitive definition that allows, in turn, interesting episodes to grow during the mining without any user-specified help. A convenient algorithm to efficiently discover the proposed unbounded episodes is also implemented. Experimental results confirm that our approach results useful and advantageous.Postprint (published version

On sequential multiscale inversion and data assimilation

Multiscale approaches are very popular for example for solving partial differential equations and in many applied fields dealing with phenomena which take place on different levels of detail. The broad idea of a multiscale approach is to decompose your problem into different scales or levels and to use these decompositions either for constructing appropriate approximations or to solve smaller problems on each of these levels, leading to increased stability or increased efficiency. The idea of sequential multiscale is to first solve the problem in a large-scale subspace and then successively move to finer scale spaces. Our goal is to analyse the sequential multiscale approach applied to an inversion or state estimation problem. We work in a generic setup given by a Hilbert space environment. We work out the analysis both for an unregularized and a regularized sequential multiscale inversion. In general the sequential multiscale approach is not equivalent to a full solution, but we show that under appropriate assumptions we obtain convergence of an iterative sequential multiscale version of the method. For the regularized case we develop a strategy to appropriately adapt the regularization when an iterative approach is taken. We demonstrate the validity of the iterative sequential multiscale approach by testing the method on an integral equation as it appears for atmospheric temperature retrieval from infrared satellite radiances

A Rejection Principle for Sequential Tests of Multiple Hypotheses Controlling Familywise Error Rates

We present a unifying approach to multiple testing procedures for sequential (or streaming) data by giving sufficient conditions for a sequential multiple testing procedure to control the familywise error rate (FWER), extending to the sequential domain the work of Goeman and Solari (2010) who accomplished this for fixed sample size procedures. Together we call these conditions the "rejection principle for sequential tests," which we then apply to some existing sequential multiple testing procedures to give simplified understanding of their FWER control. Next the principle is applied to derive two new sequential multiple testing procedures with provable FWER control, one for testing hypotheses in order and another for closed testing. Examples of these new procedures are given by applying them to a chromosome aberration data set and to finding the maximum safe dose of a treatment