ABSTRACT Modeling the response of soils to liming is important for understanding neutralization reactions and predicting lime residual effects. Models based on simple or quadratic polynomial equations are most used due their simplicity ease fitting; however, they fail reproduce a realistic soil liming, indicating decrease in pH as dose increased after reaching maximum point. Thus, several nonli...

CNL, intoduced by de Groote and Lamarche [11], is a conservative extension of Nonassociative Lambek Calculus (NL) by a De Morgan negation ∼, satisfying A∼/B ⇔ A\B∼. [11] provides a fine theory of proof nets for CNL and shows cut elimination and polynomial decidability. Here the purely proof-theoretic approach of [11] is enriched with algebras and phase spaces for CNL. We prove that CNL is a str...

In multivariate statistical analysis, several authors have studied the total positivity properties of the generalized (0F1) hypergeometric function of two real symmetric matrix arguments. In this paper, we make use of zonal polynomial expansions to obtain a new proof of a result that these 0F1 functions fail to satisfy certain pairwise total positivity properties; this proof extends both to arb...

Introduction Landsat Thematic Mapper ( TM ) imagery was used to analyze patterns of landscape diversity in the seasonal tropical forests of northeastern Guatemala. TM radiance and the radiance coefficient of variation (CV) were significant in discriminating land-cover types. Cluster analysis of TM4, TM5, and TM7 radiance produced six distinct types of landcover. Green leaf biomass from TM4 and ...

Detecting patterns in strings and images is a fundamental and well studied problem. We study the circuit complexity of the string matching problem under two popular choices of gates: De Morgan and threshold gates. For strings of length n and patterns of length log n k ≤ n− o(n), we prove super polynomial lower bounds for De Morgan circuits of depth 2, and nearly linear lower bounds for depth 2 ...

Detecting patterns in strings and images is a fundamental and widely studied problem. Motivated by the proliferation of specialized circuits in pattern recognition tasks, we study the circuit complexity of pattern matching under two popular choices of gates: De Morgan and threshold gates. For strings of length n and patterns of length log n k ≤ n− o(n), we prove super polynomial lower bounds fo...

A stable (or independent) set is a set of vertices where no two of the vertices in the set are adjacent. The stability polynomial A(G; p) of a graph G is the probability that a set of randomly chosen vertices is stable where the probability of each vertex being chosen is p, with choices independent. This polynomial is analogous to the chromatic polynomial in a precise sense. This paper consider...