Linear scaling computation of the Fock matrix. IX. Parallel computation of the Coulomb matrix

We present parallelization of a quantum-chemical tree-code [J. Chem. Phys. {\bf 106}, 5526 (1997)] for linear scaling computation of the Coulomb matrix. Equal time partition [J. Chem. Phys. {\bf 118}, 9128 (2003)] is used to load balance computation of the Coulomb matrix. Equal time partition is a measurement based algorithm for domain decomposition that exploits small variation of the density between self-consistent-field cycles to achieve load balance. Efficiency of the equal time partition is illustrated by several tests involving both finite and periodic systems. It is found that equal time partition is able to deliver 91 -- 98 % efficiency with 128 processors in the most time consuming part of the Coulomb matrix calculation. The current parallel quantum chemical tree code is able to deliver 63 -- 81% overall efficiency on 128 processors with fine grained parallelism (less than two heavy atoms per processor).Comment: 7 pages, 6 figure

Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three

The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and constant-composition codes. Large classes of group divisible codes are constructed which enabled the determination of the sizes of optimal constant-composition codes of weight three (and specified distance), leaving only four cases undetermined. Previously, the sizes of constant-composition codes of weight three were known only for those of sufficiently large length.Comment: 13 pages, 1 figure, 4 table

Optimal Memoryless Encoding for Low Power Off-Chip Data Buses

Off-chip buses account for a significant portion of the total system power consumed in embedded systems. Bus encoding schemes have been proposed to minimize power dissipation, but none has been demonstrated to be optimal with respect to any measure. In this paper, we give the first provably optimal and explicit (polynomial-time constructible) families of memoryless codes for minimizing bit transitions in off-chip buses. Our results imply that having access to a clock does not make a memoryless encoding scheme that minimizes bit transitions more powerful.Comment: Proceedings of the 2006 IEEE/ACM international Conference on Computer-Aided Design (San Jose, California, November 05 - 09, 2006). ICCAD '06. ACM, New York, NY, 369-37

Flavoured Soft Leptogenesis

We study the impact of flavour in ``soft leptogenesis'' (leptogenesis induced by soft supersymmetry breaking terms). We address the question of how flavour effects can affect the region of parameters in which successful soft leptogenesis induced by CP violation in the right-handed sneutrino mixing is possible. We find that for decays which occur in the intermediate to strong washout regimes for all flavours, the produced total $B-L$ asymmetry can be up to a factor ${\cal O}(30)$ larger than the one predicted with flavour effects being neglected. This enhancement, permits slightly larger values of the required lepton violating soft bilinear term.Comment: 20 pages, 5 figures. Version accepted in JHEP. Results unchange

Self-Dual Conformal Supergravity and the Hamiltonian Formulation

In terms of Dirac matrices the self-dual and anti-self-dual decomposition of a conformal supergravity is given and a self-dual conformal supergravity theory is developed as a connection dynamic theory in which the basic dynamic variabes include the self-dual spin connection i.e. the Ashtekar connection rather than the triad. The Hamiltonian formulation and the constraints are obtained by using the Dirac-Bergmann algorithm. PACS numbers: 04.20.Cv, 04.20.Fy,04.65.+

The Constraints and Spectra of a Deformed Quantum Mechanics

We examine a deformed quantum mechanics in which the commutator between coordinates and momenta is a function of momenta. The Jacobi identity constraint on a two-parameter class of such modified commutation relations (MCR's) shows that they encode an intrinsic maximum momentum; a sub-class of which also imply a minimum position uncertainty. Maximum momentum causes the bound state spectrum of the one-dimensional harmonic oscillator to terminate at finite energy, whereby classical characteristics are observed for the studied cases. We then use a semi-classical analysis to discuss general concave potentials in one dimension and isotropic power-law potentials in higher dimensions. Among other conclusions, we find that in a subset of the studied MCR's, the leading order energy shifts of bound states are of opposite sign compared to those obtained using string-theory motivated MCR's, and thus these two cases are more easily distinguishable in potential experiments.Comment: 30 pages inclusive of 7 figure

Recent advances in numerical simulation and control of asymmetric flows around slender bodies

The problems of asymmetric flow around slender bodies and its control are formulated using the unsteady, compressible, thin-layer or full Navier-Stokes equations which are solved using an implicit, flux-difference splitting, finite-volume scheme. The problem is numerically simulated for both locally-conical and three-dimensional flows. The numerical applications include studies of the effects of relative incidence, Mach number and Reynolds number on the flow asymmetry. For the control of flow asymmetry, the numerical simulation cover passive and active control methods. For the passive control, the effectiveness of vertical fins placed in the leeward plane of geometric symmetry and side strakes with different orientations is studied. For the active control, the effectiveness of normal and tangential flow injection and surface heating and a combination of these methods is studied