Implements the Topic Testlet Model (TTM) as described by Xiong et al. (2025) <doi:10.1111/jedm.70001>. 
    The package integrates Latent Dirichlet Allocation (LDA) with the Partial Credit Model to 
    account for local item dependence in testlets using latent topics from student 
    textual responses.

For multiple ranked input lists (full or partial) representing the same set of N objects, the package 'TopKLists' <doi:10.1515/sagmb-2014-0093> offers (1) statistical inference on the lengths of informative top-k lists, (2) stochastic aggregation of full or partial lists, and (3) graphical tools for the statistical exploration of input lists, and for the visualization of aggregation results. Note that RGtk2 and gWidgets2RGtk2 have been archived on CRAN. See <https://github.com/pievos101/TopKLists> for installation instructions.

A mathematical optimization procedure in combination with statistical bootstrap for the estimation of the latent signals (sometimes called scores) informing the global consensus ranking (often named aggregation ranking). To solve mid/large-scale problems, users should install the 'gurobi' optimiser (available from <https://www.gurobi.com/>).

A toolkit for calculating topographic distances and identifying and plotting topographic paths. Topographic distances can be calculated along shortest topographic paths (Wang (2009) <doi:10.1111/j.1365-294X.2009.04338.x>), weighted topographic paths (Zhan et al. (1993) <doi:10.1007/3-540-57207-4_29>), and topographic least cost paths (Wang and Summers (2010) <doi:10.1111/j.1365-294X.2009.04465.x>). Functions can map topographic paths on colored or hill shade maps and plot topographic cross sections (elevation profiles) for the paths.

Using Gaussian graphical models we propose a novel approach to
             perform pathway analysis using gene expression. Given the
             structure of a graph (a pathway) we introduce two statistical
             tests to compare the mean and the concentration matrices between
             two groups. Specifically, these tests can be performed on the
             graph and on its connected components (cliques). The package is
             based on the method described in Massa M.S., Chiogna M., Romualdi
             C. (2010) <doi:10.1186/1752-0509-4-121>.