In [Sa] Sarig has introduced and explored the concept of positively recurrent functions. In this paper, using the concept of an iterated function system, we construct a natural wide class of positively recurrent functions and we show that they have stronger properties than the general functions considered in [Sa]. In some parts our exposition is similar and follows the approach developed in [MU...

Complexity of a recursive algorithm typically is related to the solution to a recurrence equation based on its recursive structure. For a broad class of recursive algorithms we model their complexity in what we call the complexity approach space, the space of all functions in X = ]0,∞]Y , where Y can be a more dimensional input space. The set X, which is a dcpo for the pointwise order, moreover...

This paper presents a new approach to recognize individual façade objects and to reconstruct such objects in 3D using MLS point clouds. Core of the approach is a primitive shape based algorithm, which introduces building primitives, to identify the façade objects separately from other irrelevant objects and then to model the correct topology. The primitive shape is identified against defined di...

BACKGROUND The purpose of our study is to assess primitive and secondary malignant pulmonary tumors in children. The presence of lung tumors in newborns and infants is a point of interest to specialists in pediatric surgery, thoracic surgery and genetics due to the high death rate. The 5-years survival rate communicated by EUROCARE-study is less than 10% for primitive tumors and less than 15% i...

Abstract We consider the problem of geometrically locally approximating a general complex analytic curve in plane at point by image polynomial parametrization t ? ( x 1 ) , 2 bidegree d . show number such curves is primitive necklaces on white beads and black beads. that this odd when = squarefree use to give partial solution conjecture Rababah. Our results naturally extend generalization regar...

In this article, we study symmetric designs D with parameters ( v , k λ ) admitting a flag-transitive and point-primitive automorphism group G whose socle X is finite simple exceptional of Lie type. conclusion, the design q 6 − 1 / 5 4 associated to generalised hexagon H or its dual = 2 point-stabiliser ˆ [ ] : L orthogonal 351 126 45 378 117 36 respectively for ϵ + 3 S . Our analysis depends h...

Using proof-theoretical techniques, we analyze a proof by Hong-Kun Xu regarding result of strong convergence for the Halpern type proximal point algorithm. We obtain rate metastability (in sense Terence Tao) and also asymptotic regularity iteration. Furthermore, our final quantitative bypasses sequential weak compactness argument present in original proof. This elimination is reflected extracti...

Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollification, and noise removal. All of these primitive operations require the seemingly repetitive process of finding the k nearest neighbors of each point. These algorithms are primarily designed to run in main memory. However, ...

Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollification, and noise removal. All of these primitive operations require the seemingly repetitive process of finding the k nearest neighbors (kNNs) of each point. These algorithms are primarily designed to run in main memory. Ho...