Metrics are proposed for the distance between two multivariate stable distributions. The first set of metrics are defined in terms of the closeness of the parameter functions of one dimensional projections of the laws. Convergence in these metrics is equivalent to convergence in distribution and an explicit bound on the closeness of two stable densities is given. Another metric based on the Pro...

Human eye closeness detection has gained wide applications in human computer interface designation, facial expression recognition, driver fatigue detection, and so on. In this work, we present an extensive comparison on several state of art appearance-based eye closeness detection methods, with emphasize on the role played by each crucial component, including geometric normalization, feature ex...

Measurement of closeness between homologous configurations is often of interest. For configurations that can be embedded onto the Euclidean space, we attempted to develop closeness coefficients between corresponding Euclidean coordinate matrices. A suitable closeness coefficient was required to satisfy the following five properties: 1) It must range between 0 and 1; 2) It must be invariant over...

We consider the problem of testing whether two unequal-sized samples were drawn from identical distributions, versus distributions that differ significantly. Specifically, given a target error parameter ε > 0, m1 independent draws from an unknown distribution p with discrete support, and m2 draws from an unknown distribution q of discrete support, we describe a test for distinguishing the case ...

Human eye closeness detection has gained wide applications in human computer interface designation, facial expression recognition, driver fatigue detection, and so on. In this work, we present an extensive comparison on several state of art appearance-based eye closeness detection methods, with emphasize on the role played by each crucial component, including geometric normalization, feature ex...

Networks are commonly used to model traffic patterns, social interactions, or web pages. The vertices in a network do not possess the same characteristics: some vertices are naturally more connected and some vertices can be more important. Closeness centrality (CC) is a global metric that quantifies how important is a given vertex in the network. When the network is dynamic and keeps changing, ...

In our work, an agent-based system supporting workers in an organization is centered around utilization of ontologically demarcated data. In this system, ontological matchmaking, understood as a way of establishing closeness between resources, is one of key functionalities. Specifically, it is used to autonomously provide recommendations to the user, who is represented by her/his personal agent...