Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel webring send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
This package provides a parallel function for multivariate outlier detection named modified Stahel-Donoho estimators is contained in this package. The function RMSDp() is for elliptically distributed datasets and recognizes outliers based on Mahalanobis distance. This function is for higher dimensional datasets that cannot be handled by a single core function RMSD() included in RMSD package. See Wada and Tsubaki (2013) <doi:10.1109/CLOUDCOM-ASIA.2013.86> for the detail of the algorithm.
This package implements the network clustering algorithm described in Newman (2006) <doi:10.1103/PhysRevE.74.036104>. The complete iterative algorithm comprises of two steps. In the first step, the network is expressed in terms of its leading eigenvalue and eigenvector and recursively partition into two communities. Partitioning occurs if the maximum positive eigenvalue is greater than the tolerance (10e-5) for the current partition, and if it results in a positive contribution to the Modularity. Given an initial separation using the leading eigen step, rSpectral then continues to maximise for the change in Modularity using a fine-tuning step - or variate thereof. The first stage here is to find the node which, when moved from one community to another, gives the maximum change in Modularity. This nodeâ s community is then fixed and we repeat the process until all nodes have been moved. The whole process is repeated from this new state until the change in the Modularity, between the new and old state, is less than the predefined tolerance. A slight variant of the fine-tuning step, which can improve speed of the calculation, is also provided. Instead of moving each node into each community in turn, we only consider moves of neighbouring nodes, found in different communities, to the community of the current node of interest. The two steps process is repeatedly applied to each new community found, subdivided each community into two new communities, until we are unable to find any division that results in a positive change in Modularity.
Fits a multivariate value-added model (VAM), see Broatch, Green, and Karl (2018) <doi:10.32614/RJ-2018-033> and Broatch and Lohr (2012) <doi:10.3102/1076998610396900>, with normally distributed test scores and a binary outcome indicator. A pseudo-likelihood approach, Wolfinger (1993) <doi:10.1080/00949659308811554>, is used for the estimation of this joint generalized linear mixed model. The inner loop of the pseudo-likelihood routine (estimation of a linear mixed model) occurs in the framework of the EM algorithm presented by Karl, Yang, and Lohr (2013) <DOI:10.1016/j.csda.2012.10.004>. This material is based upon work supported by the National Science Foundation under grants DRL-1336027 and DRL-1336265.
HTML formats and templates for rmarkdown documents, with some extra features such as automatic table of contents, lightboxed figures, dynamic crosstab helper.
This package provides functionality to read files containing observations which consist of arbitrary key/value pairs.
Enhances the R Optimization Infrastructure ('ROI') package with the possibility to obtain multiple solutions for linear problems with binary variables. The main function is copied (with small modifications) from the relations package.
This package provides two general frameworks to generate a multi-layer network. This also provides several methods to reveal the embedding of both nodes and layers. The reference paper can be found from the URL mentioned below. Ting Li, Zhongyuan Lyu, Chenyu Ren, Dong Xia (2023) <arXiv:2302.04437>.
This package implements the hierarchical Bayesian analysis of populations structure (hierBAPS) algorithm of Cheng et al. (2013) <doi:10.1093/molbev/mst028> for clustering DNA sequences from multiple sequence alignments in FASTA format. The implementation includes improved defaults and plotting capabilities and unlike the original MATLAB version removes singleton SNPs by default.
R interface to the LTP'-Cloud service for Natural Language Processing in Chinese (http://www.ltp-cloud.com/).
Computes the influence functions time series of the returns for the risk and performance measures as mentioned in Chen and Martin (2018) <https://www.ssrn.com/abstract=3085672>, as well as in Zhang et al. (2019) <https://www.ssrn.com/abstract=3415903>. Also evaluates estimators influence functions at a set of parameter values and plots them to display the shapes of the influence functions.
Microbenchmarks for determining the run time performance of aspects of the R programming environment and packages relevant to high-performance computation. The benchmarks are divided into three categories: dense matrix linear algebra kernels, sparse matrix linear algebra kernels, and machine learning functionality.
This package provides a collection of several utility functions related to resolvable and affine resolvable Partially Balanced Incomplete Block Designs (PBIBDs), have been developed. In the class of resolvable designs, affine resolvable designs are said to be optimal, Bailey (1995) <doi:10.2307/2337638>. Here, the package contains three functions to generate and study the characterization properties of these designs. Developed functions are named as PBIBD1(), PBIBD2() and PBIBD3(), in which first two functions are used to generate two new series of affine resolvable PBIBDs and last one is used to generate a new series of resolvable PBIBDs, respectively. In addition, these functions can also be used to generate design parameters (v, b, r and k), canonical efficiency factors, variance factor between associates and average variance factors of the generated designs. Here v is the number of treatments, b (= b1 + b2, in case of non-proper design) is the number of blocks, r is the number of replications and k (= k1 + k2; k1 is the size of b1 and k2 is the size of b2) is the block size.
This package provides functions for linking and deduplicating data sets. Methods based on a stochastic approach are implemented as well as classification algorithms from the machine learning domain. For details, see our paper "The RecordLinkage Package: Detecting Errors in Data" Sariyar M / Borg A (2010) <doi:10.32614/RJ-2010-017>.
This package provides color schemes for maps and other graphics designed by CARTO as described at <https://carto.com/carto-colors/>. It includes four types of palettes: aggregation, diverging, qualitative, and quantitative.
This package provides a part of precision agriculture is linked to the spectral image obtained from the cameras. With the image information of the agricultural experiment, the included functions facilitate the collection of spectral data associated with the experimental units. Some designs generated in R are linked to the images, which allows the use of the information of each pixel of the image in the experimental unit and the treatment. Tables and images are generated for the analysis of the precision agriculture experiment during the entire vegetative period of the crop.
Facilitates making a connection to the Revenera API and executing various queries. You can use it to get event data and metadata. The Revenera documentation is available at <https://rui-api.redoc.ly/>. This package is not supported by Flexera (owner of the software).
Download large sections of GenBank <https://www.ncbi.nlm.nih.gov/genbank/> and generate a local SQL-based database. A user can then query this database using restez functions or through rentrez <https://CRAN.R-project.org/package=rentrez> wrappers.
Build powerful pivot tables (aka Pivot Grid, Pivot Chart, Cross-Tab) and dynamically slice & dice / drag n drop your data. rpivotTable is a wrapper of pivottable', a powerful open-source Pivot Table library implemented in JavaScript by Nicolas Kruchten. Aligned to pivottable v2.19.0.
This package provides a unified framework for detecting regime changes (changepoints) in time series data. Implements both frequentist methods including Cumulative Sum (CUSUM, Page (1954) <doi:10.1093/biomet/41.1-2.100>), Pruned Exact Linear Time (PELT, Killick, Fearnhead, and Eckley (2012) <doi:10.1080/01621459.2012.737745>), Binary Segmentation, and Wild Binary Segmentation, as well as Bayesian methods such as Bayesian Online Changepoint Detection (BOCPD, Adams and MacKay (2007) <doi:10.48550/arXiv.0710.3742> and Shiryaev-Roberts. Supports offline analysis for retrospective detection and online monitoring for real-time surveillance. Provides rigorous uncertainty quantification through confidence intervals and posterior distributions. Handles univariate and multivariate series with detection of changes in mean, variance, trend, and distributional properties.
Displays palette of 5 colors based on photos depicting the unique and vibrant culture of Punjab in Northern India. Since Punjab translates to ``Land of 5 Rivers there are 5 colors per palette. If users need more than 5 colors, they can merge 2 to 3 palettes to create their own color-combination, or they can cherry-pick their own custom colors. Users can view up to 3 palettes together. Users can also list all the palette choices. And last but not least, users can see the photo that inspired a particular palette.
Implementation of Robust Regression tailored to deal with Asymmetric noise Distribution, which was originally proposed by Takeuchi & Bengio & Kanamori (2002) <doi:10.1162/08997660260293300>. In addition, this implementation is extended as introducing potential feature regularization by LASSO etc.
Embeds sources and headers from Tina's Random Number Generator ('TRNG') C++ library. Exposes some functionality for easier access, testing and benchmarking into R. Provides examples of how to use parallel RNG with RcppParallel'. The methods and techniques behind TRNG are illustrated in the package vignettes and examples. Full documentation is available in Bauke (2021) <https://github.com/rabauke/trng4/blob/v4.23.1/doc/trng.pdf>.
Parser generator for R using combinatory parsers. It is inspired by combinatory parsers developed in Haskell.
This package provides a collection of methods for the robust analysis of univariate and multivariate functional data, possibly in high-dimensional cases, and hence with attention to computational efficiency and simplicity of use. See the R Journal publication of Ieva et al. (2019) <doi:10.32614/RJ-2019-032> for an in-depth presentation of the roahd package. See Aleman-Gomez et al. (2021) <arXiv:2103.08874> for details about the concept of depthgram.