Given a set P of points in $$\mathbb {R}^2$$ , point burning process is discrete time to burn all the where fires must be initiated at P. Specifically, starts with single burnt from P, and each subsequent step, burns that are within one unit distance currently points, as well other unburnt (if exists). The number smallest steps required If we allow fire anywhere then called an process. One can ...

We propose two approximate versions of the first-order primal-dual algorithm (PDA) to solve a class convex-concave saddle point problems. The introduced criteria are easy implement in sense that they only involve subgradient certain function at current iterate. first PDA solves both subproblems inexactly and adopts absolute error criteria, which based on non-negative summable sequences. Assumin...

To validate the accuracy of snow depth products retrieved from passive microwave remote sensing data with a high confidence level, verification method based on points ground observation is subject to great uncertainty, due scale effect. Thus, it necessary use point-to-surface transformation obtain relative truth at pixel scale. In this study, by using observations different scales, upscaling me...