Functions and tools for using open GIS and remote sensing command-line interfaces in a reproducible environment.

It allows to cluster communication networks using the Stochastic
  Topic Block Model <doi:10.1007/s11222-016-9713-7> by posting jobs through 
  the API of the linkage.fr server, which implements the clustering method.
  The package also allows to visualize the clustering results returned by the server.

Produces high resolution, publication ready linkage maps
    and quantitative trait loci maps. Input can be output from 'R/qtl',
    simple text or comma delimited files. Output is currently
    a portable document file.

Prototypes for construction of a Gaussian Stochastic Process emulator (GASP) of a computer model. This is done within the objective Bayesian implementation of the GASP. The package allows for construction of a linked GASP of the composite computer model. Computational implementation follows the mathematical exposition given in publication: Ksenia N. Kyzyurova, James O. Berger, Robert L. Wolpert. Coupling computer models through linking their statistical emulators. SIAM/ASA Journal on Uncertainty Quantification, 6(3): 1151-1171, (2018).<DOI:10.1137/17M1157702>.

Collect  marketing data from 'LinkedIn' Ads using the 'Windsor.ai' API <https://windsor.ai/api-fields/>.

A class that links matrix-like objects (nodes) by rows or by
    columns while behaving similarly to a base R matrix. Very large matrices
    are supported if the nodes are file-backed matrices.

Build powerful, linked-view dashboards in 'shiny' applications. With a 
    declarative, one-line setup, you can create bidirectional links between 
    interactive components. When a user interacts with one element (e.g., clicking 
    a map marker), all linked components (such as 'DT' tables or other charts) 
    instantly update. Supports 'leaflet' maps, 'DT' tables, 'plotly' charts, and spatial data 
    via 'sf' objects out-of-the-box, with an extensible API for custom components.

Implementations of most of the existing proximity-based methods of 
  link prediction in graphs. Among the 20 implemented methods are e.g.:
  Adamic L. and Adar E. (2003) <doi:10.1016/S0378-8733(03)00009-1>,
  Leicht E., Holme P., Newman M. (2006) <doi:10.1103/PhysRevE.73.026120>,
  Zhou T. and Zhang Y (2009) <doi:10.1140/epjb/e2009-00335-8>, and
  Fouss F., Pirotte A., Renders J., and Saerens M. (2007) <doi:10.1109/TKDE.2007.46>.