A b s t r a c t . Numerous authors have proposed functions to quantify the degree of similarity between two fuzzy numbers using various descriptive parameters, such as the geometric distance, the distance between the centers of gravity or the perimeter. However, these similarity functions have drawbacks for specific situations. We propose a new similarity measure for generalized trapezoidal fuz...

The iteration of complex function can generate beautiful fractal images. This paper presents a novel method based on the iteration of the distance ratio with two points, which generates a generalized Mandelbrot set according to distance ratio convergence times. This paper states the definition of distance ratio and its iteration. Then taking the complex function f(z)=z+c for example, it discuss...

We present two fast and simple algorithms for approximating the distance function for given isolated points on uniform grids. The algorithms are then generalized to compute the distance to piecewise linear objects. By incorporating the geometry of Huygens’ principle in the reverse order with the classical viscosity solution theory for the eikonal equation |∇u| = 1, the algorithms become almost ...

We obtain $$L^p$$ estimates for Toeplitz operators on the generalized Hartogs triangles $$\mathbb {H}_\gamma = \{(z_1,z_2) \in \mathbb {C}^2\,{:}\, |z_1|^\gamma \!< |z_2|<1\}$$ two classes of positive radial symbols, one a power distance to origin, and other boundary.

Let φ and ψ be analytic self-maps of the open unit disk D . Using pseudo-hyperbolic distance ρ(φ ,ψ) , we characterize the boundedness and compactness of the differences of generalized composition operators (C φ −Ch ψ ) f (z) = ∫ z 0 [ f ′(φ(ξ ))g(ξ )− f ′(ψ(ξ ))h(ξ )]dξ , z ∈ D between two Bloch-type spaces on D . The results generalize the corresponding results on the single generalized compo...

Frame imperfection, non-response and unequal selection probabilities always affect survey results. In order to compensate for the effects of these problems, Devill and S&auml;rndal (1992) introduced a family of estimators called calibration estimators. In these estimators we look for weights that have minimum distance with design weights based on a distance function and satisfy calibration equa...

the aim of this paper is to establish random coincidence point results for weakly increasing random operators in the setting of ordered metric spaces by using generalized altering distance functions. our results present random versions and extensions of some well-known results in the current literature.