A linear arrangement is a labeling or a numbering or a linear ordering of the vertices of a graph. In this paper we solve the minimum linear arrangement problem for bijective connection graphs (for short BC graphs) which include hypercubes, Möbius cubes, crossed cubes, twisted cubes, locally twisted cube, spined cube, Z-cubes, etc. as the subfamilies.

We numerically solve microscopic deterministic equations of motion for the two-dimensional straight phi(4) theory with random initial states. Phase ordering dynamics is investigated. Dynamic scaling is found and it is dominated by a fixed point corresponding to the minimum energy of random initial states.

In this paper we specify the conditions on the parameters of pairs of gOS’s under which the corresponding generalized order statistics are ordered according to usual stochastic ordering, hazard rate ordering, likelihood ratio ordering and dispersive ordering. We consider this problem in one-sample as well as two-sample problems. We show that some of the results obtained by Franco et al. ...

Sequential processes can encounter faults as a result of improper ordering of subsets of the events. In order to reveal faults caused by the relative ordering of t or fewer of v events, for some fixed t, a test suite must provide tests so that every ordering of every set of t or fewer events is exercised. Such a test suite is equivalent to a sequence covering array, a set of permutations on v e...

The height of the elimination tree has long acted as the only criterion in deriving a suitable fill-preserving sparse matrix ordering for parallel factorization. Although the deficiency in adopting height as the criterion for all circumstances was well recognized, no research has succeeded in alleviating this constraint. In this paper, we extend the unit-cost fill-preserving ordering into a gen...

Recently, in Publish/Subscribe (P/S) systems, there has been increasing emphasis in managing end-to-end message delivery performance and message order-based consistency, which are addressed in distributed collaborative applications for on-the-fly data. A causal message ordering is more useful for these distributed applications in which a large number of processes request collaboratively and int...

We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination. This ordering is based on viewing the non-zero elements of a symmetric positive definite matrix as edges of an undirected graph, and aims at reducing the additional non-zeros (fill) in the matrix by repeatedly removing the vertex of minimum degree. It is one of the most widely used primit...

Positive semidefinite matrix fields are becoming increasingly important in digital imaging. One reason for this tendency consists of the introduction of diffusion tensor magnetic resonance imaging (DTMRI). In order to perform shape analysis, enhancement or segmentation of such tensor fields, appropriate image processing tools must be developed. This paper extends fundamental morphological opera...

Due to the availability of required information in the web, as multiple documents, the need for summarizing these multiple documents and ordering of the sentences in the summary in an efficient way become a relevant task in data mining. We present a novel sentence ordering method based on maximum cost spanning tree algorithm to improve the readability and cohesion of the summary obtained by ext...