Most state-of-the-art ordering schemes for sparse matrices are a hybrid of a bottom-up method such as minimum degree and a top down scheme such as George’s nested dissection. In this paper we present an ordering algorithm that achieves a tighter coupling of bottom-up and topdown methods. In our methodology vertex separators are interpreted as the boundaries of the last elements in a bottom-up o...

This paper proposes a new detection ordering scheme, which minimizes average error rate of the MIMO system with per antenna rate control. This paper shows an optimal scheme minimizing average error rate expressed by the Q function, and simplifies the optimal scheme by using the minimum equivalent SINR scaled by modulation indices, based on approximated error rate. In spite of reduced complexity...

Sparse Symmetric Positive Definite (SPD) Linear System Solvers (LSS) are routinely required in various Power System Analysis problems. In sparse LSS ordering of nodes is desired to reduce fill ins, which in turn reduce computations. Minimum Degree Algorithm (MDA) has established itself as a very competitive ordering algorithm, for reducing fill ins to quite often near minimum level. With the ac...

We use the Ford-Bellman algorithm to construct feasible class cardinality functions for a given semantic entity relationship scheme (SER scheme). Further we show that these functions form a distributive lattice under a natural ordering. Finally we present an algorithm to construct the minimum element of this lattice which can be interpreted as the class cardinality function of a realizer of min...

We say that a k-uniform hypergraph C is an `-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of adjacent edges (in the natural ordering of the edges) intersects in precisely ` vertices. We prove that if 1 ≤ ` < k and k − ` does not divide k then any k-uniform hypergraph on n vertices with minimum ...

Visualization of multidimensional dataset is a challenging task due to non-uniformity of the data. It requires new ways to display data for better analysis and interpretation. Parallel coordinate is one of the popular techniques for visualization of multi dimensional dataset. Parallel coordinate technique emphasis various types of patterns present in the dataset. Here, pattern is shown by a pol...

We say that a k-uniform hypergraph C is an `-cycle if there exists a cyclic ordering of the vertices of C such that every edge of C consists of k consecutive vertices and such that every pair of consecutive edges (in the natural ordering of the edges) intersects in precisely ` vertices. We prove that if 1 ≤ ` < k and k − ` does not divide k then any k-uniform hypergraph on n vertices with minim...

this paper submitting the computation of optimize point of ordering in inventory control systems and particularly for continuous review of ordering system (r,q) by fuzzy logic method which similarly can be used for other ordering systems. since in the ordering models we cannot forecast the parameters like cost exactly, we have ambiguity. in this case using precise parameters may cause wrong dec...