In this paper, we present an ordinal feature based method for face recognition. Ordinal features are used to represent faces. Hamming distance of many local sub-windows is computed to evaluate differences of two ordinal faces. AdaBoost learning is finally applied to select most effective hamming distance based weak classifiers and build a powerful classifier. Experiments demonstrate good result...

A coloring of the vertices of a graph G is a distance k coloring of G if and only if any two vertices lying on a path of length less than or equal to k are given different colors. Hamming graphs are Cartesian (or box) products of complete graphs. In this paper, we will consider the interaction between coding theory and distance k colorings of Hamming graphs.

We develop the fuzzy generalized ordered weighted averaging distance (FGOWAD) operator. It is a new aggregation operator that uses the main characteristics of the generalized OWA (GOWA), the ordered weighted averaging distance (OWAD) and uncertain information represented as fuzzy numbers. This operator includes a wide range of distance measures and aggregation operators such as the fuzzy maximu...

In this work, the performance and reliability analysis of a crossbar molecular switch nanomemory demultiplexer is studied and results presented. In particular, we investigate the impact on the performance of a crossbar nanomemory demultiplexer of implementing a combination of error correction coding and multi-switch junction fault tolerance schemes. Results indicate that delay and power scale l...

The demand for mobile computer power has exploded in the recent years. Variable length VLIW processors offer the necessary performance at low power. Software optimizations are necessary to further decrease the energy consumption. In this article we present a compiler optimization which reduces the dynamic power dissipation resulting from the switching activities during instruction fetch. Energy...

In this paper we introduce the concentration and dilation operators on interval valued intuitionistic fuzzy soft sets of root type which is a generalization of fuzzy set, intuitionistic fuzzy set, interval valued intuitionistic fuzzy set and intuitionistic fuzzy set of root type and establish some properties of these operators. We define Hamming distance between two interval valued intuitionist...

Cyclic, negacyclic and constacyclic codes are part of a larger class of codes called polycyclic codes; namely, those codes which can be viewed as ideals of a factor ring of a polynomial ring. The structure of the ambient ring of polycyclic codes over GR(p,m) and generating sets for its ideals are considered. It is shown that these generating sets are strong Groebner bases. A method for finding ...

In this paper, we present a new concept and its circuit implementation for high-speed associative memories based on Hamming distance. A chained search logic embedded in a memory cell enables a word-parallel search operation based on Hamming distance. A hierarchically chained search architecture maintains a high-speed operation with faultless precision in a large input number. We also propose a ...

Let 1=(X, R) denote a distance-regular graph with distance function and diameter d 4. By a parallelogram of length i (2 i d ), we mean a 4-tuple xyzu of vertices in X such that (x, y)= (z, u)=1, (x, u)=i, and (x, z)= ( y, z)= ( y, u)=i&1. We prove the following theorem. Theorem. Let 1 denote a distanceregular graph with diameter d 4, and intersection numbers a1=0, a2 {0. Suppose 1 is Q-polynomi...