Title: Algorithm for Searching the Space of Gaussian Directed Acyclic
Graph Models Through Moment Fractional Bayes Factors
Description: We propose an objective Bayesian algorithm for searching the space of Gaussian directed acyclic graph (DAG) models. The algorithm proposed makes use of moment fractional Bayes factors (MFBF) and thus it is suitable for learning sparse graph. The algorithm is implemented by using Armadillo: an open-source C++ linear algebra library.

Title: FISH Based Normalization and Copy Number inference of SNP
Author: Adrian Andronache <adi.andronache@gmail.com>, Luca Agnelli
Maintainer: Adrian Andronache <adi.andronache@gmail.com>, Luca Agnelli
Description: Normalizes the data from a file containing the raw values
of the SNP probes of microarrray data by using the FISH probes

Title: Fatigue Crack Growth in Reliability
Depends: R (>= 3.2.2), KernSmooth, kerdiest, nlme
Description: Fatigue Crack Growth in Reliability estimates the distribution
of material lifetime due to mechanical fatigue efforts. The FCGR
package provides simultaneous crack growth curves fitting to
different specimens in materials under mechanical stress efforts.
Linear mixed-effects models (LME) with smoothing B-Splines
and the linearized Paris-Erdogan law are applied. Once defined
the fail for a determined crack length, the distribution function
of failure times to fatigue is obtained. The density function is
estimated by applying nonparametric binned kernel density estimate
(bkde) and the kernel estimator of the distribution function (kde).
The results of Pinheiro and Bates method based on nonlinear
mixed-effects regression (nlme) can be also retrieved. The package
contains the crack.growth, PLOT.cg, IB.F, and Alea.A (database) functions.

Author: Shaun Turney and Michael Bachhofer
Description: Provides several functions to create and manipulate fuzzy cognitive maps. It is based on FCMapper for Excel, distributed at http://www.fcmappers.net/joomla/, developed by Michael Bachhofer and Martin Wildenberg. Maps are inputted as adjacency matrices. Attributes of the maps and the equilibrium values of the concepts (including with user-defined constrained values) can be calculated. The maps can be graphed with a function that calls "igraph". Multiple maps with shared concepts can be aggregated.