Scattered data interpolation problems arise in many applications. Shepard’s method for constructing a global interpolant by blending local interpolants using local-support weight functions usually creates reasonable approximations. SHEPPACK is a Fortran 95 package containing five versions of the modified Shepard algorithm: quadratic (Fortran 95 translations of Algorithms 660, 661, and 798), cub...

one of the most important problems in geodesy is the unification of height datum. generally in geodesy; there are two types of height systems, the geometrical height based on ellipsoid and the physical height based on gravity-defined surface (zhang et al, 2009).local height datum is determined according to mean sea level (msl). in regarding to mismatch of mean sea level and geoid, on the one ha...

We investigate the computability of distributed tasks in reliable anonymous networks with arbitrary knowledge. More precisely, we consider tasks computable with local termination, i.e., a node knows when to stop to participate in a distributed algorithm, even though the algorithm is not necessarily terminated elsewhere. We also study weak local termination, that is when a node knows its final v...

We present an optimal, combinatorial 1− 1/e approximation algorithm for Maximum Coverage over a matroid constraint, using non-oblivious local search. Calinescu, Chekuri, Pál and Vondrák have given an optimal 1−1/e approximation algorithm for the more general problem of monotone submodular maximization over a matroid constraint. The advantage of our algorithm is that it is entirely combinatorial...