Provides 'Scilab' 'n1qn1'. This takes more memory than traditional L-BFGS.  The n1qn1 routine is useful since it allows prespecification of a Hessian.
       If the Hessian is near enough the truth in optimization it can speed up the optimization problem. The algorithm is described in the
       'Scilab' optimization documentation located at
       <https://www.scilab.org/sites/default/files/optimization_in_scilab.pdf>. This version uses manually modified code from 'f2c' to make this a C only binary.

Provides some functions to get Korean text sample from news articles in
             Naver which is popular news portal service <https://news.naver.com/> in Korea.

Implements methods to perform fast approximate K-nearest neighbor search on input matrix. Algorithm based on the 'N2' implementation of an approximate nearest neighbor search using hierarchical  Navigable Small World (NSW) graphs. The original algorithm is described in "Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs", Y. Malkov and D. Yashunin, <doi:10.1109/TPAMI.2018.2889473>, <doi:10.48550/arXiv.1603.09320>.

Functions for reading cancer record files which follow a format
    defined by the North American Association of Central Cancer Registries
    (NAACCR).

Exact automatic differentiation for R functions. Provides a
    composable derivative operator D that computes gradients, Hessians,
    Jacobians, and arbitrary-order derivative tensors at machine precision.
    D(D(f)) gives Hessians, D(D(D(f))) gives third-order tensors for
    skewness of maximum likelihood estimators, and so on to any order. Works through any R code
    including loops, branches, and control flow.

An R wrapper for 'libnabo', an exact or approximate k nearest
    neighbour library which is optimised for low dimensional spaces (e.g. 3D).
    'libnabo' has speed and space advantages over the 'ANN' library wrapped by
    package 'RANN'. 'nabor' includes a knn function that is designed as a 
    drop-in replacement for 'RANN' function nn2. In addition, objects which 
    include the k-d tree search structure can be returned to speed up repeated 
    queries of the same set of target points.