Solution of discrete ARMA-representations via MAPLE

Solution of discrete ARMA-representations via MAPLE

In [3] closed formulae for the forward, backward and symmetric solutions of an ARMA–Representation have been presented. Here these formulae are implemented in the symbolic computational language MAPLE and corresponding MAPLE code is provided.

Discrete-valued ARMA processes

This paper presents a unified framework of stationary ARMA processes for discrete-valued time series based on Pegram’s [Pegram, G.G.S., 1980. An autoregressive model for multilag markov chains. J. Appl. Probab. 17, 350–362] mixing operator. Such a stochastic operator appears to be more flexible than the currently popular thinning operator to construct Box and Jenkins’ type stationary ARMAproces...

Numerical Solution of ODEs with Distributed Maple

Multiple Representations for Systems of Linear Equations via the Computer Algebra System Maple

A number of different representational methods exist for presenting the theory of linear equations and associated solution spaces. Discussed in this paper are the findings of a case study where first year undergraduate students were exposed to a new (to the department) method of teaching linear systems which used visual, algebraic and data-based representations constructed using the computer al...

Learning Discrete Representations via Information Maximizing Self-Augmented Training

Our method is related to denoising auto-encoders (Vincent et al., 2008). Auto-encoders maximize a lower bound of mutual information (Cover & Thomas, 2012) between inputs and their hidden representations (Vincent et al., 2008), while the denoising mechanism regularizes the auto-encoders to be locally invariant. However, such a regularization does not necessarily impose the invariance on the hidd...