The purpose of this work is to localise missing individuals onto VHR aerial images of agricultural parcels in the case of discontinuous crops which are planted according to a squared-grid pattern. The global approach considers the planted parcel as a topological graph of vertices whose geometrical relationships are defined by rules according to orientation and length. The system initiates the g...

Oscillations in dynamical systems are widely reported in multiple branches of applied mathematics. Critically, even a non-oscillatory deterministic system can produce cyclic trajectories when it is in a low copy number, stochastic regime. Common methods of finding parameter ranges for stochastically driven resonances, such as direct calculation, are cumbersome for any but the smallest networks....

Let G be a graph of order n ≥ 3. An even squared hamiltonian cycle (ESHC) of G is a hamiltonian cycle C = v1v2 . . . vnv1 of G with chords vivi+3 for all 1 ≤ i ≤ n (where vn+j = vj for j ≥ 1). When n is even, an ESHC contains all bipartite 2-regular graphs of order n. We prove that there is a positive integer N such that for every graph G of even order n ≥ N , if the minimum degree δ(G) ≥ n 2 +...

We study the problem of finding constant mean curvature graphs over a domain of a totally geodesic hyperplane and an equidistant hypersurface Q of hyperbolic space. We find the existence of graphs of constant mean curvature H over mean convex domains ⊂ Q and with boundary ∂ for −H∂ < H ≤ |h|, where H∂ > 0 is the mean curvature of the boundary ∂ . Here h is the mean curvature respectively of the...

This paper deals with randomized polling of a social network. In the case of forecasting the outcome of an election between two candidates A and B, classical intent polling asks randomly sampled individuals: who will you vote for? Expectation polling asks: who do you think will win? In this paper, we propose a novel neighborhood expectation polling (NEP) strategy that asks randomly sampled indi...

We study the problem of sampling a bandlimited graph signal in the presence of noise, where the objective is to select a node subset of prescribed cardinality that minimizes the signal reconstruction mean squared error (MSE). To that end, we formulate the task at hand as the minimization of MSE subject to binary constraints, and approximate the resulting NP-hard problem via semidefinite program...

Aromaticity can be interpreted as extra stabilization of a cyclic unsaturated molecule arising from cyclic conjugation of mr-electrons. The extra stabilization energy is estimated relative to the r-electron energy of a hypothetical reference molecule formed by the "localized" ir bonds. It is termed the resonance energy due to aromaticity. Our graph theory of aromaticity defines this type of res...

Given an m-dimensional compact submanifold M of Euclidean space R, the concept of mean location of a distribution, related to mean or expected vector, is generalized to more general R-valued functionals including median location, which is derived from the spatial median. The asymptotic statistical inference for general functionals of distributions on such submanifolds is elaborated. Convergence...

Given two sets A and B of n points each in R, we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. We can compute an optimal matching in O(n2+δ) time, for any δ > 0, and an ε-approximation in time O((n/ε)3/2 log n). If the set B is allowed to move rigidly to minimize the rms distance, we can compute a rigid motion of B...

When images at low bit-depth are rendered at high bit-depth displays, missing least significant bits need to be estimated. We study the image bit-depth enhancement problem: estimating an original image from its quantized version from a minimum mean squared error (MMSE) perspective. We first argue that a graph-signal smoothness prior-one defined on a graph embedding the image structure-is an app...