Title: Model species distributions by estimating the probability of
Description: Provides a likelihood-based approach to modeling species
distributions using presence-only data. In contrast to the
popular software program MAXENT, this approach yields estimates
of the probability of occurrence, which is a natural descriptor
Packaged: 2012-02-17 18:27:39 UTC; rchandler

Packaged: 2012-12-21 18:23:54 UTC; rchandler

Packaged: 2013-01-10 18:53:41 UTC; rchandler

Packaged: 2013-07-05 14:32:39 UTC; rchandler

Description: Provides a likelihood-based approach to modeling species distributions using presence-only data. In contrast to the popular software program MAXENT, this approach yields estimates of the probability of occurrence, which is a natural descriptor of a species' distribution.

Title: Model Species Distributions by Estimating the Probability of
Author: Richard Chandler, Andy Royle and Roeland Kindt

Title: Maximum Matching for General Weighted Graph
Description: Computes the maximum matching for unweighted graph and maximum
matching for (un)weighted bipartite graph efficiently.
Packaged: 2017-01-15 05:03:13 UTC; bowendeng

Title: Fitting 'Maxent' Species Distribution Models with 'glmnet'
Description: Procedures to fit species distributions models from occurrence records and environmental variables, using 'glmnet' for model fitting. Model structure is the same as for the 'Maxent' Java package, version 3.4.0, with the same feature types and regularization options.  See the 'Maxent' website <http://biodiversityinformatics.amnh.org/open_source/maxent> for more details.

Title: Approximate Maximisation of Nestedness in Bipartite Graphs
Authors@R: c(person("Christoph ", "Hoeppke", email = "christoph.hoeppke@googlemail.com", role = c("aut", "cre")),
person("Benno ", "Simmons", email = "benno.simmons@gmail.com", role = c("aut")))
Description: Functions to generate graphs that maximise the NODF (nestedness metric based
on overlap and decreasing fill) metric for a given number of rows, columns
and links. NODF was originally defined by Almeida-Neto et al. (2008)
<doi:10.1111/j.0030-1299.2008.16644.x>. As nestedness in ecological networks
depends on the size of the networks we require normalisation to make them
comparable. We offer three highly optimised algorithms to find the
optimising graphs so that users can choose an appropriate trade off between
computation time and NODF value for the task at hand.
Packaged: 2020-03-05 15:37:57 UTC; bennosimmons