PropertyValue
nif:beginIndex
  • 0 (xsd:integer)
nif:broaderContext
nif:endIndex
  • 90 (xsd:integer)
nif:isString
  • (5) Hence, the number of new trees per time step is num0to S(t)=Binomial(Si(t),P0to S(t)),
rdf:type