Recursive spectral bisection (RSB) is a heuristic technique for finding a minimum cut graph bisection. To use this method the second eigenvector of the Laplacian of the graph is computed and from it a bisection is obtained. The most common method is to use the median of the components of the second eigenvector to induce a bisection. We prove here that this median cut method is optimal in the se...

Soft error could cause digital circuit to temporary malfunction. In an asynchronous circuit, the temporary malfunction of the control circuit will cause deadlock; a state where the system will be disabled indefinitely until the system has been reset or the error is filtered or corrected from the system. C-element is most commonly found in control circuit. We have studied the vulnerability of si...

The most commonly used p-way partitioning method is recursive bisection (RB). It first divides a graph or a mesh into two equal-sized pieces, by a “good” bisection algorithm, and then recursively divides the two pieces. Ideally, we would like to use an optimal bisection algorithm. Because the optimal bisection problem that partitions a graph into two equal-sized subgraphs to minimize the number...

An exhaustive qualitative (vote-counting) review is conducted of the literature concerning visual and non-visual line bisection in neurologically normal subject populations. Although most of these studies report a leftward bisection error (i.e., pseudoneglect), considerable between-study variability and inconsistency characterize this literature. A meta-analysis of this same literature is perfo...

Most established subdivision schemes have the refined grid at each stage aligned with the previous one. The √ 3 and √ 2 schemes alternate orientations. This paper is one of the first detailed studies of a skew scheme in which the axis directions after refinement do not either lie along or bisect those before. It raises the issue of how the analysis techniques can be applied in this new context ...

De Bruijn and Kautz graphs have been intensively studied as perspective interconnection networks of massively parallel computers. One of the crucial parameters of an interconnection network is its bisection width. It has innuence on both communication properties of the network and the algorithmic design. We prove optimal bounds on the edge and vertex bisection widths of the k-ary n-dimensional ...