Let the Kneser graph K of a distance-regular graph Γ be the graph on the same vertex set as Γ, where two vertices are adjacent when they have maximal distance in Γ. We study the situation where the Bose-Mesner algebra of Γ is not generated by the adjacency matrix of K. Let Γ be a distance-regular graph of diameter d on n vertices. Let Γi be the graph with the same vertex set as Γ where two vert...

This paper proposes an efficient sparse metric learning algorithm in high dimensional space via an `1-penalized log-determinant regularization. Compare to the most existing distance metric learning algorithms, the proposed algorithm exploits the sparsity nature underlying the intrinsic high dimensional feature space. This sparsity prior of learning distance metric serves to regularize the compl...

Abstract—Alignment of biological sequences such as DNA, RNA or proteins is one of the most widely used tools in computational bioscience. One of the important research topics of bioinformatics is the multiple proteins sequence alignment. Since the exact methods for MSA have exponential time complexity, the heuristic approaches and the progressive alignment are the most commonly used in multiple...

High dimensional data visualization is critical to data analysts since it gives a direct view of original data. We present a method to visualize large amount of high dimensional data. We divide dimensions of data into several groups. Then, we use one icon to represent each group, and associate visual properties of each icon with dimensions in each group. A high dimensional data record will be r...

This paper considers a two-echelon capacitated supply chain with two non-identical retailers and information sharing. We characterize the optimal inventory policies. We also study the benefits of the optimal stock rationing policy over the first come first served (FCFS) and the modified echelon-stock rationing (MESR) policies. © 2006 Elsevier B.V. All rights reserved.

In the article I present definitions of the concepts quality and quality assurance, which are basis for proposing a general definition of quality of word bases. The quality of word bases is the specifications that customer and producer agree upon, and includes linguistic and other user relevant considerations. This is exemplified with the revision work of a term record format, and work with a w...

rg(p, b) = ! ( row(p) =1 && sbf(p) =0) rp(p, b) = if ( ( ( sbf(p) >1) and (0<=row(p) <=sbf(p) -2) ) or ( ( sbf(p) =1) and (row(p) =0) ) ) then if (b=0) then BSh( sbf(p) , row(p) +1, col(p) ) else BSh( sbf(p) , row(p) +1, flip(row(p) , col(p) ) ) else if ( ( sbf(p) >1) and (row(p) =sbf(p) -1) ) then if (b=0) then BSh( sbf(p) -1, 0, col(p) ) else BSh( sbf(p) -1, 0, flip(row(p) , col(p) ) ) rb(p, ...

Transshipment, the sharing of inventory among parties at the same echelon level of a supply chain, can be used to reduce costs. The effectiveness of transshipment is in part determined by the configuration of the transshipment network. We introduce chain configurations in transshipment settings, where every party is linked in one connected loop. Under simplifying assumptions we show analyticall...

We study when the operator f(Bw) is chaotic in the sense of Devaney on a Köthe echelon sequence space, where Bw is a weighted backward shift and f(z) = ∑∞ j=0 fjz j is a formal power series.