We provide functions for computing the decision boundaries for pre-licensure vaccine trials using the Generalized Likelihood Ratio tests proposed by Shih, Lai, Heyse and Chen (2010, <doi:10.1002/sim.4036>).

It computes the solutions to a generic stochastic growth model for a given set of user supplied parameters. It includes
    the solutions to the model, plots of the solution, 	
    a summary of the features of the model, a function that covers different types of consumption preferences,
    and a function that computes the moments of a Markov process.	
	Merton, Robert C (1971) <doi:10.1016/0022-0531(71)90038-X>,
	Tauchen, George (1986) <doi:10.1016/0165-1765(86)90168-0>,
	Wickham, Hadley (2009, ISBN:978-0-387-98140-6 ).

An implementation of sparse Gaussian Markov random field mixtures 
  presented by Ide et al. (2016) <doi:10.1109/ICDM.2016.0119>.
  It provides a novel anomaly detection method for multivariate noisy sensor data.
  It can automatically handle multiple operational modes.
  And it can also compute variable-wise anomaly scores.

Methods focused in performing the OSGB36/ETRS89 transformation 
  (Great Britain and the Isle of Man only) by using the Ordnance Survey's 
  OSTN15/OSGM15 transformation model. Calculation of distances and areas from 
  sets of points defined in any of the supported Coordinated Systems is also
  available.

Seven different methods for multiple testing problems. The SGoF-type methods (see for example, Carvajal Rodríguez et al., 2009 <doi:10.1186/1471-2105-10-209>;  de Uña Álvarez, 2012 <doi:10.1515/1544-6115.1812>; Castro Conde et al., 2015 <doi:10.1177/0962280215597580>) and the BH and BY false discovery rate controlling procedures.

Smoothing signals and computing their derivatives is a common
 requirement in signal processing workflows. Savitzky-Golay filters are a
 established method able to do both (Savitzky and Golay, 1964 <doi:10.1021/ac60214a047>).
 This package implements one dimensional Savitzky-Golay filters that can be applied to
 vectors and matrices (either row-wise or column-wise).
 Vectorization and memory allocations have been profiled to reduce computational
 fingerprint. Short filter lengths are implemented in the direct space, while
 longer filters are implemented in frequency space, using a Fast Fourier
 Transform (FFT).