Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n; r) of middle-state switches for the symmetric 3-stage Clos network C(n;m(n; r); r) to be rearrangeable in the multirate enviroment is at most 2n 1. This problem is equivalent to a generalized version of the bipartite graph edge coloring problem. The best bounds known so far on this function m(n; r) is 11n=9 m(n;...

In an attempt to improve models of human perception, the recognition of phonemes in nonsense utterances was predicted with automatic speech recognition (ASR) in order to analyze its applicability for modeling human speech recognition (HSR) in noise. In the first experiments, several feature types are used as input for an ASR system; the resulting phoneme scores are compared to listening experim...

Let PN (R) be the space of all real polynomials in N variables with the usual inner product 〈 , 〉 on it, given by integrating over the unit sphere. We start by deriving an explicit combinatorial formula for the bilinear form representing this inner product on the space of coefficient vectors of all polynomials in PN (R) of degree ≤ M . We exhibit two applications of this formula. First, given a...

Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then extended with a collection of operations to access and modify the data structure. In this paper we study their satisfiability and the model checking problems. We first give sound and complete tableaux calculi for the ...

The locally repairable codes (LRCs) were introduced to correct erasures efficiently in distributed storage systems. LRCs are extensively studied recently. In this paper, we first deal with the open case remained in [40] and derive an improved upper bound for the minimum distances of LRCs. We also give an explicit construction for LRCs attaining this bound. Secondly, we consider the construction...

The proposed encryption algorithm is composed of two parts, permutation and diffusion. we firstly separate the RGB image into R, G, B components, and Generate three chaotic sequences by chaotic maps to encryption. Then, transform the R, G, B components and the chaotic sequences into DNA code, and get DNA sequences matrix. Secondly, DNA matrices of the RGB image is permutated under the Chen’s hy...

It is shown that for a metric space (M,d) the following are equivalent: (i) M is a complete R-tree; (ii) M is hyperconvex and has unique metric segments.

This paper proposes a matching method for medical image registration, which combined with SURF (Speeded up Robust Features) algorithm and the improved R-RANSAC (the Randomized of Random Sample Consensus) algorithm. Firstly, this algorithm extracts featured points with SURF algorithm from images and matches similar featured points with Euclidean distance. Secondly, the RRANSAC algorithm is used ...

We present a new spatial index belonging to R-tree family. Since our new index comes out from the R-tree and holds the concept of nonoverlapping nodes we call it R-tree. The original R-tree was designed for both point and spatial data. Using R-tree for indexing spatial data is very inefficient. In our research we face the problem of indexing product catalogues data that can be represented as po...