1. Climate change has been shown to affect the phenology of many organisms, but interestingly these shifts are often unequal across trophic levels, causing a mismatch between the phenology of organisms and their food. 2. We consider two alternative hypotheses: consumers are constrained to adjust sufficiently to the lower trophic level, or prey species react more strongly than their predators to...

Nowadays, it is a common practice to protect various types of statistical data before publishing them for different researches. For instance, when conducting extensive demographic surveys such as national census, the collected data should be at least depersonalized to guarantee proper level of privacy preservation. In practice, even more complicated methods of data protection need to be used. A...

This article proposes a mathematical model of caterpillar track's force and kinematic interaction with the ground during movement. The presence positive displacement tracks was proved even in absence slipping. causes soil to be sheared thrown out area contact caterpillar. change rotation angles magnitude their longitudinal were obtained. A drop tension track detected on active section supportin...

A severe outbreak of Lepidoptera followed the 1997–98 El Niño Southern Oscillation event, during which the climate in central Panamawas unusually dry. The outbreak involved the larvae of at least 12 species of Lepidoptera and occurred at a seasonally dry, deciduous forest site, where extensive background data were available regarding climate, tree species and non-outbreak herbivory levels. Most...

Phylogeny reconstruction is the process of inferring evolutionary relationships from molecular sequences, and methods that are expected to accurately reconstruct trees from sequences of reasonable length are highly desirable. To formalize this concept, the property of fast-convergence has been introduced to describe phylogeny reconstruction methods that, with high probability, recover the true ...

Dirac’s classic theorem asserts that if G is a graph on n vertices, and δ(G) ≥ n/2, then G has a hamilton cycle. As is well known, the proof also shows that if deg(x) + deg(y) ≥ (n− 1), for every pair x, y of independent vertices in G, then G has a hamilton path. More generally, S. Win has shown that if k ≥ 2, G is connected and ∑ x∈I deg(x) ≥ n− 1 whenever I is a k-element independent set, the...

Let G be a graph with p vertices and q edges and let = 0,1, 2, , . 2 q A              A vertex labeling   : f V G A  i e a vertex equitable labeling of G if it induces an edge labeling s said to b given by      * =  f uv f u f v  * f such that     1 v a v b   and     * = 1,2,3, , f f f E q  , where   f v a is the ber of verti num ces v with   = f v a for . ...

Let h ≥ 1 be an integer. An L(h, 1, 1)-labelling of a (finite or infinite) graph is an assignment of nonnegative integers (labels) to its vertices such that adjacent vertices receive labels with difference at least h, and vertices distance 2 or 3 apart receive distinct labels. The span of such a labelling is the difference between the maximum and minimum labels used, and the minimum span over a...