A staircase in this paper is the set of points in Z below a given rational line in the plane that have Manhattan Distance less than 1 to the line. Staircases are closely related to Beatty and Sturmian sequences of rational numbers. Connecting the geometry and the number theoretic concepts, we obtain three equivalent characterizations of Sturmian sequences of rational numbers, as well as a new p...

This paper proposes an original statistical decision theory to accomplish a multi-speaker recognition task in cocktail party problem. This theory relies on an assumption that the varied frequencies of speakers obey Gaussian distribution and the relationship of their voiceprints can be represented by Euclidean distance vectors. This paper uses Mel-Frequency Cepstral Coefficients to extract the f...

Disguised face recognition is a major challenge in the field of face recognition which has been taken less attention. Therefore, in this paper a disguised face recognition algorithm based on Local Phase Quantization (LPQ) method and Singular Value Decomposition (SVD) is presented which deals with two main challenges. The first challenge is when an individual intentionally alters the appearance ...

A load estimation algorithm based on k-means cluster analysis was developed. The algorithm applies cluster centres – of previously clustered load profiles – and distance functions to estimate missing and future measurements. Canberra, Manhattan, Euclidean, and Pearson correlation distances were investigated. Several case studies were implemented using daily and segmented load profiles of aggreg...

In recent years, the research cluster of objective interestingness measures has rapidly developed in order to assist users to choose the appropriate measure for their application. Researchers in this field mainly focus on three main directions: clustering based on the properties of the measures, clustering based on the behavior of measures and clustering tendency of variation in statistical imp...

Multi-point distance minimization problems (M-DMP) pose a number of theoretical challenges and simultaneously represent a number of practical applications, particularly in navigational and layout design problems. When the Euclidean distance measure is minimized for each target point, the resulting problem has a trivial solution, however such a consideration limits its application in practice. S...

Temporal queries on time evolving data are at the heart of a broad range of business and network intelligence applications ranging from consumer behavior analysis, trend analysis, temporal pattern mining, sentiment analysis on social media, cyber security, and network monitoring. In this work, we present an innovative data structure called Fast Approximate Query-able(FAQ), which provides a unif...