person("Thomas", "Rosendal", role = c("aut", "cre"),
email = "trosendal@gmail.com",
comment = c(ORCID = "0000-0002-6576-9668"))
Implements the formulae required to calculate freedom
from disease according to Cameron and Baldock (1998)
<doi:10.1016/S0167-5877(97)00081-0>. These are the
methods used at the Swedish national veterinary institute (SVA) to
evaluate the performance of our nation animal disease
surveillance programmes.
Thomas Rosendal [aut, cre] (<https://orcid.org/0000-0002-6576-9668>)

Provides functionality for manipulating elements of the free group (juxtaposition is represented by a plus) including inversion, multiplication by a scalar, group-theoretic power operation, and Tietze forms.  The package is fully vectorized.

c(person(c("Robin", "K. S. "), "Hankin",
role=c("aut","cre"),
email="hankin.robin@gmail.com",
comment = c(ORCID = "0000-0001-5982-0415")))
The free group in R; juxtaposition is represented by a plus.  Includes inversion, multiplication by a scalar, group-theoretic power operation, and Tietze forms.

Algorithms for Implementing Free-Knot Splines
Steven Spiriti <puzzlesteven@gmail.com>, Philip Smith <philip.smith@ttu.edu>, Pierre Lecuyer <lecuyer@iro.UMontreal.ca>,
Algorithms for fitting free-knot splines for data with one independent variable and one dependent variable.  Four free-knot spline algorithms are provided for the case where the number of knots is known in advance.  A knot-search algorithm is provided for the case where the number of knots is not known in advance.  In addition, methods are available to compute the fitted values, the residuals, and the coefficients of the splines, and to plot the results, along with a method to summarize the results.

Steven Spiriti <puzzlesteven@gmail.com>, Philip Smith
<philip.smith@ttu.edu>, Pierre Lecuyer
<lecuyer@iro.UMontreal.ca>,
This package is for fitting free-knot splines for data
with one independent variable and one dependent variable.  Four
free-knot spline algorithms are provided for the case where the
number of knots is known in advance.  A knot-search algorithm
is provided for the case where the number of knots is not known
in advance.  In addition, methods are available to compute the
fitted values, the residuals, and the coefficients of the
splines, and to plot the results, along with a method to
summarize the results.