String Functions for Compact and Expressive Code (yasp)
A collection of string functions designed for writing more compact and expressive code. ‘yasp’ (Yet Another String Package) is simple, fast, dependency-free, and written in pure R. The package provides: a coherent set of abbreviations for paste() from package ‘base’ with a variety of defaults, such as p() for ‘paste’ and pcc() for ‘paste and collapse with commas’; wrap(), bracket(), and others for wrapping a string in flanking characters; unwrap() for removing pairs of characters (at any position in a string); and sentence() for cleaning whitespace around punctuation and capitalization appropriate for prose sentences.

Multilingual Stopword Collection (stopwords)
Exposes the full Stopwords ISO dataset as an easy to use data structure.

Multiple Objective Latin Hypercube Design (MOLHD)
Generate the optimal maximin distance, minimax distance (only for low dimensions), and maximum projection designs within the class of Latin hypercube designs efficiently for computer experiments. Generate Pareto front optimal designs for each two of the three criteria and all the three criteria within the class of Latin hypercube designs efficiently. Provide criterion computing functions. References of this package can be found in Morris, M. D. and Mitchell, T. J. (1995) <doi:10.1016/0378-3758(94)00035-T>, Lu Lu and Christine M. Anderson-CookTimothy J. Robinson (2011) <doi:10.1198/Tech.2011.10087>, Joseph, V. R., Gul, E., and Ba, S. (2015) <doi:10.1093/biomet/asv002>.

Measuring Multivariate Dependence Using Distance Multivariance (multivariance)
Distance multivariance is a measure of dependence which can be used to detect and quantify dependence structures. The necessary functions are implemented in this packages, and examples are given. For the theoretic background we refer to the forthcoming papers: B. Böttcher, M. Keller-Ressel, R.L. Schilling (2017) Detecting independence of random vectors I + II. Preprints.

R Bindings for the ‘PicoSAT’ SAT Solver (rpicosat)
Bindings for the ‘PicoSAT’ solver to solve Boolean satisfiability problems (SAT). The boolean satisfiability problem asks the question if a given boolean formula can be TRUE; i.e. does there exist an assignment of TRUE/FALSE for each variable such that the whole formula is TRUE? The package bundles ‘PicoSAT’ solver release 965 <http://…/>.