This paper presents a new complexity metric for Object-Oriented (OO) design measurement to find at the design stage whether the classes become more complex, Moderate complex or less complex. The proposed metric is theoretically evaluated against the Weyuker’s properties as well as empirically evaluated against three open source software system. Furthermore, for validating the validity of new co...

Distance metric learning is of fundamental interest in machine learning because the distance metric employed can significantly affect the performance of many learning methods. Quadratic Mahalanobis metric learning is a popular approach to the problem, but typically requires solving a semidefinite programming (SDP) problem, which is computationally expensive. Standard interior-point SDP solvers ...

In 2014, Zead Mustafa introduced $b_2$-metric spaces, as a generalization of both $2$-metric and $b$-metric spaces. Then new fixed point results for the classes of  rational Geraghty contractive mappings of type I,II and III in the setup of $b_2$-metric spaces are investigated. Then, we prove some fixed point theorems under various contractive conditions in partially ordered $b_2$-metric spaces...

In this paper, we present a new algorithm for solving the block matching problem which is independent of image content and is faster than other full-search methods. The method employs a novel data structure called the Windowed-Sum-Squared-Table, and uses the fast Fourier transform (FFT) in its computation of the sum squared difference (SSD) metric. Use of the SSD metric allows for higher peak s...

In the present paper, we give a new approach to Caristi's fixed pointtheorem on non-Archimedean fuzzy metric spaces. For this we define anordinary metric $d$ using the non-Archimedean fuzzy metric $M$ on a nonemptyset $X$ and we establish some relationship between $(X,d)$ and $(X,M,ast )$%. Hence, we prove our result by considering the original Caristi's fixedpoint theorem.

Intrinsic camera calibration using a single image is possible provided that certain geometric objects such as orthogonal vanishing points and metric homographies can be estimated from the image and give rise to adequate constraints on the sought calibration parameters. In doing so, however, any additional metric information that might be available for the imaged scene is not always straightforw...

A major criticism of metrics for objectoriented systems design has been their lack in generating meaningful feedback information. This paper proposes a data interpretation method based on visualisation of results obtained from the method redefinition metric set. The method encompasses an “alarmer” technique for identifying suspected design problems occurring under certain conditions. We demonst...

The paper proposes an indexing method for fast content-based retrieval in an image repository. The method is based on a metric-indexing strategy that avoids to calculate the distance from the query to all the images in the repository. The proposed indexing method is tested on a pathology image collection comparing its performance against sequential scaning indexing. The results show that the me...

In this paper, we present a new method called setvectors to predict cache contention introduced by co-scheduled applications on a multicore processor system. Additionally, we propose a new metric to compare cache contention prediction methods. Applying this metric, we demonstrate that our setvector method predicts cache contention with about the same accuracy as the most accurate stateof-the-ar...