This paper studies recognition of fish shapes using both Region based and Contour based shape based descriptors[9]. Moment Invariants are chosen as the Region based descriptor and the Simple (geometric) shape descriptors (SSD) are used as Contour based shape descriptors. The shapes are varied through scaling and rotation. Manhattan Distance is used as the classifier. The study of the recognitio...

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...

Published papers rarely disclose implementation details. In this paper we show how such details can account for speedups of up to a factor of 28 for different implementations of the same algorithm. We perform an in-depth analysis of the most popular benchmark in heuristic search: the 15-puzzle. We study implementation choices in C++ for both IDA* and A* using the Manhattan distance heuristic. R...

The Detection of rare variants responsible for human complex diseases has been receiving more and more attentions. However, most existing computational methods for this purpose require the selection of functional variants before statistical analysis. Based on the assumption that nonsynonymous single nucleotide polymorphisms (nsSNPs) associated with specific diseases should be similar in their p...

In this paper we calculate the exact cumulative distribution function (CDF) of path distance (L1 norm) between a randomly selected intersection and k-th nearest node Cox point process driven by Manhattan Poisson line process. The CDF is expressed as sum over integer partition $p\!\left(k\righ...

General Game Playing (GGP) is concerned with the development of programs that are able to play previously unknown games well. The main problem such a player is faced with is to come up with a good heuristic evaluation function automatically. Part of these heuristics are distance measures used to estimate, e.g., the distance of a pawn towards the promotion rank. However, current distance heurist...

General Game Playing (GGP) is concerned with the development of programs that are able to play previously unknown games well. The main problem such a player is faced with is to come up with a good heuristic evaluation function automatically. Part of these heuristics are distance measures used to estimate, e.g., the distance of a pawn towards the promotion rank. However, current distance heurist...

General Game Playing (GGP) is concerned with the development of programs that are able to play previously unknown games well. The main problem such a player is faced with is to come up with a good heuristic evaluation function automatically. Part of these heuristics are distance measures used to estimate, e.g., the distance of a pawn towards the promotion rank. However, current distance heurist...

TOPSIS is a multicriteria decision making technique based on the minimization of geometric distances that allows the ordering of compared alternatives in accordance with their distances from the ideal and anti-ideal solutions. The technique, that usually measures distances in the Euclidean norm, implicitly supposes that the contemplated attributes are independent. However, as this rarely occurs...