NLMR | R package to simulate neutral landscape models | Development Tools library
kandi X-RAY | NLMR Summary
kandi X-RAY | NLMR Summary
NLMR is a R library typically used in Utilities, Development Tools, Numpy applications. NLMR has no bugs, it has no vulnerabilities and it has low support. You can download it from GitHub.
NLMR supplies 15 NLM algorithms, with several options to simulate derivatives of them. The algorithms differ from each other in spatial auto-correlation, from no auto-correlation (random NLM) to a constant gradient (planar gradients):. Function Description Crossreference Reference nlm\_curds Simulates a randomly curdled or wheyed neutral landscape model. Random curdling recursively subdivides the landscape into blocks. At each level of the recursion, a fraction of these blocks is declared as habitat while the remaining stays matrix. When option q is set, it simulates a wheyed curdling model, where previously selected cells that were declared matrix during recursion, can now contain a proportion of habitat cells Figure 1a,p O’Neill, Gardner, and Turner (1992); Keitt (2000) nlm\_distancegradient Simulates a distance gradient neutral landscape model. The gradient is always measured from a rectangle that one has to specify in the function (parameter origin) Figure 1b Etherington, Holland, and O’Sullivan (2015) nlm\_edgegradient Simulates a linear gradient orientated neutral model. The gradient has a specified or random direction that has a central peak, which runs perpendicular to the gradient direction Figure 1c Travis and Dytham (2004); Schlather et al. (2015) nlm\_fbm Simulates neutral landscapes using fractional Brownian motion (fBm). fBm is an extension of Brownian motion in which the amount of spatial autocorrelation between steps is controlled by the Hurst coefficient H Figure 1d Schlather et al. (2015) nlm\_gaussianfield Simulates a spatially correlated random fields (Gaussian random fields) model, where one can control the distance and magnitude of spatial autocorrelation Figure 1e Schlather et al. (2015) nlm\_mosaicfield Simulates a mosaic random field neutral landscape model. The algorithm imitates fault lines by repeatedly bisecting the landscape and lowering the values of cells in one half and increasing the values in the other half. If one sets the parameter infinite to TRUE, the algorithm approaches a fractal pattern Figure 1f Schlather et al. (2015) nlm\_neigh Simulates a neutral landscape model with land cover classes and clustering based on neighbourhood characteristics. The cluster are based on the surrounding cells. If there is a neighbouring cell of the current value/type, the target cell will more likely turned into a cell of that type/value Figure 1g Scherer et al. (2016) nlm\_percolation Simulates a binary neutral landscape model based on percolation theory. The probability for a cell to be assigned habitat is drawn from a uniform distribution Figure 1h Gardner et al. (1989) nlm\_planargradient Simulates a planar gradient neutral landscape model. The gradient is sloping in a specified or (by default) random direction between 0 and 360 degree Figure 1i Palmer (1992) nlm\_mosaictess Simulates a patchy mosaic neutral landscape model based on the tessellation of a random point process. The algorithm randomly places points (parameter germs) in the landscape, which are used as the centroid points for a voronoi tessellation. A higher number of points therefore leads to a more fragmented landscape Figure 1k Gaucherel (2008), Method 1 nlm\_mosaicgibbs Simulates a patchy mosaic neutral landscape model based on the tessellation of an inhibition point process. This inhibition point process starts with a given number of points and uses a minimisation approach to fit a point pattern with a given interaction parameter (0 - hardcore process; 1 - Poisson process) and interaction radius (distance of points/germs being apart) Figure 1l Gaucherel (2008), Method 2 nlm\_random Simulates a spatially random neutral landscape model with values drawn a uniform distribution Figure 1m With and Crist (1995) nlm\_randomcluster Simulates a random cluster nearest-neighbour neutral landscape. The parameter ai controls for the number and abundance of land cover classes and p controls for proportion of elements randomly selected to form clusters Figure 1n Saura and Martínez-Millán (2000) nlm\_mpd Simulates a midpoint displacement neutral landscape model where the parameter roughness controls the level of spatial autocorrelation Figure 1n Peitgen and Saupe (1988) nlm\_randomrectangularcluster Simulates a random rectangular cluster neutral landscape model. The algorithm randomly distributes overlapping rectangles until the landscape is filled Figure 1o Gustafson and Parker (1992) .
NLMR supplies 15 NLM algorithms, with several options to simulate derivatives of them. The algorithms differ from each other in spatial auto-correlation, from no auto-correlation (random NLM) to a constant gradient (planar gradients):. Function Description Crossreference Reference nlm\_curds Simulates a randomly curdled or wheyed neutral landscape model. Random curdling recursively subdivides the landscape into blocks. At each level of the recursion, a fraction of these blocks is declared as habitat while the remaining stays matrix. When option q is set, it simulates a wheyed curdling model, where previously selected cells that were declared matrix during recursion, can now contain a proportion of habitat cells Figure 1a,p O’Neill, Gardner, and Turner (1992); Keitt (2000) nlm\_distancegradient Simulates a distance gradient neutral landscape model. The gradient is always measured from a rectangle that one has to specify in the function (parameter origin) Figure 1b Etherington, Holland, and O’Sullivan (2015) nlm\_edgegradient Simulates a linear gradient orientated neutral model. The gradient has a specified or random direction that has a central peak, which runs perpendicular to the gradient direction Figure 1c Travis and Dytham (2004); Schlather et al. (2015) nlm\_fbm Simulates neutral landscapes using fractional Brownian motion (fBm). fBm is an extension of Brownian motion in which the amount of spatial autocorrelation between steps is controlled by the Hurst coefficient H Figure 1d Schlather et al. (2015) nlm\_gaussianfield Simulates a spatially correlated random fields (Gaussian random fields) model, where one can control the distance and magnitude of spatial autocorrelation Figure 1e Schlather et al. (2015) nlm\_mosaicfield Simulates a mosaic random field neutral landscape model. The algorithm imitates fault lines by repeatedly bisecting the landscape and lowering the values of cells in one half and increasing the values in the other half. If one sets the parameter infinite to TRUE, the algorithm approaches a fractal pattern Figure 1f Schlather et al. (2015) nlm\_neigh Simulates a neutral landscape model with land cover classes and clustering based on neighbourhood characteristics. The cluster are based on the surrounding cells. If there is a neighbouring cell of the current value/type, the target cell will more likely turned into a cell of that type/value Figure 1g Scherer et al. (2016) nlm\_percolation Simulates a binary neutral landscape model based on percolation theory. The probability for a cell to be assigned habitat is drawn from a uniform distribution Figure 1h Gardner et al. (1989) nlm\_planargradient Simulates a planar gradient neutral landscape model. The gradient is sloping in a specified or (by default) random direction between 0 and 360 degree Figure 1i Palmer (1992) nlm\_mosaictess Simulates a patchy mosaic neutral landscape model based on the tessellation of a random point process. The algorithm randomly places points (parameter germs) in the landscape, which are used as the centroid points for a voronoi tessellation. A higher number of points therefore leads to a more fragmented landscape Figure 1k Gaucherel (2008), Method 1 nlm\_mosaicgibbs Simulates a patchy mosaic neutral landscape model based on the tessellation of an inhibition point process. This inhibition point process starts with a given number of points and uses a minimisation approach to fit a point pattern with a given interaction parameter (0 - hardcore process; 1 - Poisson process) and interaction radius (distance of points/germs being apart) Figure 1l Gaucherel (2008), Method 2 nlm\_random Simulates a spatially random neutral landscape model with values drawn a uniform distribution Figure 1m With and Crist (1995) nlm\_randomcluster Simulates a random cluster nearest-neighbour neutral landscape. The parameter ai controls for the number and abundance of land cover classes and p controls for proportion of elements randomly selected to form clusters Figure 1n Saura and Martínez-Millán (2000) nlm\_mpd Simulates a midpoint displacement neutral landscape model where the parameter roughness controls the level of spatial autocorrelation Figure 1n Peitgen and Saupe (1988) nlm\_randomrectangularcluster Simulates a random rectangular cluster neutral landscape model. The algorithm randomly distributes overlapping rectangles until the landscape is filled Figure 1o Gustafson and Parker (1992) .
Support
Quality
Security
License
Reuse
Support
NLMR has a low active ecosystem.
It has 54 star(s) with 15 fork(s). There are 13 watchers for this library.
It had no major release in the last 12 months.
There are 10 open issues and 45 have been closed. On average issues are closed in 90 days. There are 1 open pull requests and 0 closed requests.
It has a neutral sentiment in the developer community.
The latest version of NLMR is v0.6
Quality
NLMR has no bugs reported.
Security
NLMR has no vulnerabilities reported, and its dependent libraries have no vulnerabilities reported.
License
NLMR does not have a standard license declared.
Check the repository for any license declaration and review the terms closely.
Without a license, all rights are reserved, and you cannot use the library in your applications.
Reuse
NLMR releases are available to install and integrate.
Installation instructions, examples and code snippets are available.
Top functions reviewed by kandi - BETA
kandi's functional review helps you automatically verify the functionalities of the libraries and avoid rework.
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of NLMR
Currently covering the most popular Java, JavaScript and Python libraries. See a Sample of NLMR
NLMR Key Features
No Key Features are available at this moment for NLMR.
NLMR Examples and Code Snippets
No Code Snippets are available at this moment for NLMR.
Community Discussions
Trending Discussions on NLMR
QUESTION
How to merge two csv files that do not have the same number of lines?
Asked 2019-Jun-17 at 17:05
Below is my two csv files:
...ANSWER
Answered 2019-Jun-17 at 16:44You need to use some of the options to the merge command.
In this instance...
Community Discussions, Code Snippets contain sources that include Stack Exchange Network
Vulnerabilities
No vulnerabilities reported
Install NLMR
Install the release version from CRAN:.
Support
For any new features, suggestions and bugs create an issue on GitHub.
If you have any questions check and ask questions on community page Stack Overflow .
Find more information at:
Reuse Trending Solutions
Find, review, and download reusable Libraries, Code Snippets, Cloud APIs from over 650 million Knowledge Items
Find more librariesStay Updated
Subscribe to our newsletter for trending solutions and developer bootcamps
Share this Page