Title: Bivariate Correlations Calculation and Visualization
person("Alassane", "Samba", role = c("aut", "cre"),email = "alassane.samba@orange.com"),
Description: Compute and visualize using the 'visNetwork' package all the bivariate correlations of a dataframe.
Several and different types of correlation coefficients (Pearson's r, Spearman's rho, Kendall's tau,
distance correlation, maximal information coefficient and
equal-freq discretization-based maximal normalized mutual information) are used according to
the variable couple type (quantitative vs categorical, quantitative vs quantitative, categorical vs categorical).
Imports: shiny, visNetwork, infotheo, minerva, energy, mclust,
rAmCharts, Hmisc, pbapply, ggplot2, dplyr, tidyr

rAmCharts, pbapply, ggplot2, dplyr, tidyr, shinybusy

Author: Dirk Eddelbuettel and Aaron Wolen
Description: A 'LaTeX' Letter class for 'rmarkdown', using the
'pandoc-letter' template adapted for use with 'markdown'.

Description: Conveniently generate 'CSS' using R code.
Imports: R6, rlang, purrr, cli, shiny, magrittr
Suggests: htmltools, knitr, rmarkdown, testthat, covr

Title: Generate Concentration-Time Profiles from Linear PK Systems
Authors@R: person("Benjamin", "Rich", role=c("aut", "cre"), email="mail@benjaminrich.net")
Description: Generate concentration-time profiles from linear pharmacokinetic
(PK) systems, possibly with first-order absorption or zero-order infusion,
possibly with one or more peripheral compartments, and possibly under
steady-state conditions. Single or multiple doses may be specified. Secondary
(derived) PK parameters (e.g. Cmax, Ctrough, AUC, Tmax, half-life, etc.) are

Title: Linear Programming / Optimization
Description: This package can be used to solve Linear Programming / Linear
Optimization problems by using the simplex algorithm.

Packaged: Fri May 11 15:50:07 2007; suapm095

Packaged: Mon May 14 10:59:17 2007; suapm095

Packaged: Sun Aug 12 12:58:01 2007; suapm095

Packaged: Wed Jun 18 16:10:58 2008; suapm095

Description: This package can be used to solve Linear Programming /
Linear Optimization problems by using the simplex algorithm.