* On leave of absence from the Department of Electronics and Computers, Transylvania University of Braşov. Abstract – Ordered Weighted Aggregation (OWA) operators represent a distinct family of aggregation operators and were introduced by Yager in [1]. They compute a weighted sum of a number of criteria that must be satisfied. The central element of the OWA operators is that the criteria are re...

Kernel regression is a well-established method for nonlinear regression in which the target value for a test point is estimated using a weighted average of the surrounding training samples. The weights are typically obtained by applying a distance-based kernel function to each of the samples, which presumes the existence of a well-defined distance metric. In this paper, we construct a novel alg...

The aim of phishing is tracing the users' s private information without their permission by designing a new website which mimics the trusted website. The specialists of information technology do not agree on a unique definition for the discriminative features that characterizes the phishing websites. Therefore, the number of reliable training samples in phishing detection problems is limited. M...

In this paper, we define the concept of compatible and weakly compatible mappings in b-metric spaces and inspired by the Ciric and et. al method, we produce appropriate conditions for given the unique common fixed point for a family of the even number of self-maps with together another two self-maps in a complete b-metric spaces. Also, we generalize this common fixed point theorem for a seq...

We introduce a family of weighted BMO spaces in the Bergman metric on the unit ball of C and use them to characterize complex functions f such that the big Hankel operators Hf and Hf̄ are both bounded or compact from a weighted Bergman space into a weighted Lesbegue space with possibly different exponents and different weights. As a consequence, when the symbol function f is holomorphic, we char...

For example, IR 2 with the regular Euclidean distance is a metric space. It is usually of interest to consider the finite case, where X is an a set of n points. Then, the function d can be specified by n 2 real numbers; that is, the distance between every pair of points of X. Alternatively, one can think about (X, d) is a weighted complete graph, where we specify positive weights on the edges, ...

This paper presents the generalization of weighted distances to modules and their computation through the chamfer algorithm on general point-lattices. A first part is devoted to the definitions and properties (distance, metric, norm) of weighted distances on modules, with a presentation of weight optimization in the general case, to get rotation invariant distances. A general formula for the we...

The paper contributes to No-Reference video quality assessment of broadcasted HD video over IP networks and DVB. In this work we have enhanced our bottom-up spatio-temporal saliency map model by considering semantics of the visual scene. Thus we propose a new saliency map model based on face detection that we called semantic saliency map. A new fusion method has been proposed to merge the botto...