Contains many functions useful for data
	analysis, high-level graphics, utility operations, functions for
	computing sample size and power, simulation, importing and annotating datasets,
	imputing missing values, advanced table making, variable clustering,
	character string manipulation, conversion of R objects to LaTeX and html code,
	recoding variables, caching, simplified parallel computing, encrypting and decrypting data using a safe workflow, general moving window statistical estimation, and assistance in interpreting principal component analysis.

An algorithm for time series analysis that leverages hidden Markov models, cluster analysis, and mixture distributions to segment data, detect patterns and predict future sequences.

Easy to use library to setup, apply and make inference with discrete time and discrete space Hidden Markov Models.

Fits hidden Markov models with discrete non-parametric 
	observation distributions to data sets.  The observations may
	be univariate or bivariate. Simulates data from such models.
	Finds most probable underlying hidden states, the most
	probable sequences of such states, and the log likelihood
	of a collection of observations given the parameters of
	the model.  Auxiliary predictors are accommodated in the
        univariate setting.

Estimation procedures and goodness-of-fit test for several Markov regime switching models and mixtures of  bivariate copula models. The goodness-of-fit test is based on a Cramer-von Mises statistic and uses Rosenblatt's transform and parametric bootstrap to estimate the p-value. The proposed methodologies are described in Nasri, Remillard and Thioub (2020) <doi:10.1002/cjs.11534>.

Consider the linear mixed model with normal random effects. A typical method to solve Henderson's Mixed Model Equations (HMME) is recursive estimation of the fixed effects and random effects. We provide a fast, stable, and scalable solver to the HMME without computing matrix inverse. See Kim (2017) <arXiv:1710.09663> for more details.