K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using direct K-way refinement, instead of the widely adopted recursive bisection paradigm. Our arguments are based on the fact that recursive-bisection-based partitioning algorithms...

Results from an extensive relativistic many-body analysis utilizing a realistic effective QCD Hamiltonian are presented for the meson spectrum. A comparative numerical study of the BCS, Tamm-Dancoff (TDA), and RPA treatments provides new, significant insight into the condensate structure of the vacuum, the chiral symmetry governance of the pion, and the meson spin, orbital, and flavor mass spli...

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the...

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the...

The nuclear wobbling motion in the Lu region is studied by the microscopic cranked mean-field plus RPA method. The Woods-Saxon potential is used as a mean-field with a new parameterization which gives reliable description of rapidly rotating nuclei. The prescription of symmetry-preserving residual interaction makes the calculation of the RPA step parameter-free, and we find the wobbling-like RP...

We present a new O(nlglgn) time sort algorithm that is more robust than O(n) distribution sorting algorithms. The algorithm uses a recursive partition-concatenate approach, partitioning each set into a variable number of subsets using information gathered dynamically during execution. Sequences are partitioned using statistical information computed during the sort for each sequence. _ Space com...