Algorithms for solving selective k-means problem,
    which is defined as finding k rows in an m x n matrix such that 
    the sum of each column minimal is minimized. 
    In the scenario when m == n and each cell value in matrix is a 
    valid distance metric, this is equivalent to a k-means problem. 
    The selective k-means extends the k-means problem in the sense 
    that it is possible to have m != n, often the case m < n which 
    implies the search is limited within a small subset of rows. 
    Also, the selective k-means extends the k-means problem in the 
    sense that the instance in row set can be instance not seen in 
    the column set, e.g., select 2 from 3 internet service provider
    (row) for 5 houses (column) such that minimize the overall cost 
    (cell value) - overall cost is the sum of the column minimal of
    the selected 2 service provider.

Algorithms to compute spherical k-means partitions.
  Features several methods, including a genetic and a fixed-point
  algorithm and an interface to the CLUTO vcluster program.

It's a Super K-Nearest Neighbor classification method with using kernel density to describe weight of the distance between a training observation and the testing sample.

Generates and evaluates D, I, A, Alias, E, T, and G optimal designs. Supports generation and evaluation of blocked and split/split-split/.../N-split plot designs. Includes parametric and Monte Carlo power evaluation functions, and supports calculating power for censored responses. Provides a framework to evaluate power using functions provided in other packages or written by the user. Includes a Shiny graphical user interface that displays the underlying code used to create and evaluate the design to improve ease-of-use and make analyses more reproducible. For details, see Morgan-Wall et al. (2021) <doi:10.18637/jss.v099.i01>.

A tool to calculate sky illuminance values (in lux) for both sun and moon. The
 model is a verbatim translation of the code by Janiczek and DeYoung (1987)
 <https://archive.org/details/DTIC_ADA182110>.