The main purpose of this package is to provide the algorithmic complexity for short strings, an approximation of the Kolmogorov Complexity of a short string using the coding theorem method. While the database containing the complexity is provided in the data only package acss.data, this package provides functions accessing the data such as prob_random returning the posterior probability that a given string was produced by a random process. In addition, two traditional (but problematic) measures of complexity are also provided: entropy and change complexity.

This package provides a replication of key functionality from dplyr and the wider tidyverse using only base.

This package provides methods and algorithms for discrete optimization, e.g. knapsack and subset sum procedures, derivative-free Nelder-Mead and Hooke-Jeeves minimization, and some (evolutionary) global optimization functions.

The r-nleqslv package solves a system of nonlinear equations using a Broyden or a Newton method with a choice of global strategies such as line search and trust region. There are options for using a numerical or user supplied Jacobian, for specifying a banded numerical Jacobian and for allowing a singular or ill-conditioned Jacobian.

This package provides a matrix-like data structure that allows for efficient, convenient, and scalable subsetting of binary genotype/phenotype files generated by PLINK, the whole genome association analysis toolset, without loading the entire file into memory.

This package provides a color picker that can be used as an input in Shiny apps or Rmarkdown documents. The color picker supports alpha opacity, custom color palettes, and many more options. A plot color helper tool is available as an RStudio Addin, which helps you pick colors to use in your plots. A more generic color picker RStudio Addin is also provided to let you select colors to use in your R code.

Designed to enable simultaneous substitution in strings in a safe fashion. Safe means it does not rely on placeholders (which can cause errors in same length matches).

Several tools for assessing the quality of fit of a gaussian nonlinear model are provided.

This package contains functions to estimate L-moments and trimmed L-moments from the data. It also contains functions to estimate the parameters of the normal polynomial quantile mixture and the Cauchy polynomial quantile mixture from L-moments and trimmed L-moments.

This package provides HTTP error helpers. Methods are included for general purpose HTTP error handling, as well as individual methods for every HTTP status code, both via status code numbers as well as their descriptive names. It supports the ability to adjust behavior to stop, message or warning. It includes the ability to use a custom whisker template to have any configuration of status code, short description, and verbose message.

This package provides functions for making contour plots. The contour plot can be created from grid data, a function, or a data set. If non-grid data is given, then a Gaussian process is fit to the data and used to create the contour plot.

This package provides various R programming tools for data manipulation, including:

• medical unit conversions

• combining objects

• character vector operations

• factor manipulation

• obtaining information about R objects

• generating fixed-width format files

• extricating components of date and time objects

• operations on columns of data frames

• matrix operations

• operations on vectors and data frames

• value of last evaluated expression

• wrapper for sample that ensures consistent behavior for both scalar and vector arguments

This package provides a comprehensive collection for structural multivariate function estimation using smoothing splines.

Dichromat collapses red-green or green-blue distinctions to simulate the effects of different types of color-blindness.

This package provides a graphical user interface for interactive Markov chain Monte Carlo (MCMC) diagnostics and plots and tables helpful for analyzing a posterior sample. The interface is powered by the Shiny web application framework and works with the output of MCMC programs written in any programming language (and has extended functionality for Stan models fit using the rstan and rstanarm packages).

This package provides bindings to tesseract: an optical character recognition (OCR) engine that supports over 100 languages. The engine is highly configurable in order to tune the detection algorithms and obtain the best possible results.

This package estimates optimal cutpoints for binary classification metrics. It also validates performance using bootstrapping. Some methods for more robust cutpoint estimation are supported, e.g. a parametric method assuming normal distributions, bootstrapped cutpoints, and smoothing of the metric values per cutpoint using Generalized Additive Models. Various plotting functions are included.

This package provides a syntax highlighter for R code based on the results of the R parser. It supports rendering in HTML and LaTeX markup. It includes a custom Sweave driver performing syntax highlighting of R code chunks.

This package provides utility functions useful when programming and developing R packages.

This package provides tools for performing the leaf reordering for the dendrogram that preserves the hierarchical clustering result and at the same time tries to group instances from the same class together.

This package provides a collection of functions to visualize spatial data and models on top of static maps from various online sources (e.g Google Maps and Stamen Maps). It includes tools common to those tasks, including functions for geolocation and routing.

This is a package for maximum likelihood estimation of random utility discrete choice models. The software is described in Croissant (2020) <doi:10.18637/jss.v095.i11> and the underlying methods in Train (2009) <doi:10.1017/CBO9780511805271>.

This package provides tools to read, write, create, and manipulate DESCRIPTION files. It is intended for packages that create or manipulate other packages.

Learn vector representations of words by continuous bag of words and skip-gram implementations of the word2vec algorithm. The techniques are detailed in the paper "Distributed Representations of Words and Phrases and their Compositionality" by Mikolov et al. (2013), available at <arXiv:1310.4546>.