99,225 research outputs found
Searching for Minimum Storage Regenerating Codes
Regenerating codes allow distributed storage systems to recover from the loss
of a storage node while transmitting the minimum possible amount of data across
the network. We present a systematic computer search for optimal systematic
regenerating codes. To search the space of potential codes, we reduce the
potential search space in several ways. We impose an additional symmetry
condition on codes that we consider. We specify codes in a simple alternative
way, using additional recovered coefficients rather than transmission
coefficients and place codes into equivalence classes to avoid redundant
checking. Our main finding is a few optimal systematic minimum storage
regenerating codes for and , over several finite fields. No such
codes were previously known and the matching of the information theoretic
cut-set bound was an open problem
Port-Hamiltonian systems: an introductory survey
The theory of port-Hamiltonian systems provides a framework for the geometric description of network models of physical systems. It turns out that port-based network models of physical systems immediately lend themselves to a Hamiltonian description. While the usual geometric approach to Hamiltonian systems is based on the canonical symplectic structure of the phase space or on a Poisson structure that is obtained by (symmetry) reduction of the phase space, in the case of a port-Hamiltonian system the geometric structure derives from the interconnection of its sub-systems. This motivates to consider Dirac structures instead of Poisson structures, since this notion enables one to define Hamiltonian systems with algebraic constraints. As a result, any power-conserving interconnection of port-Hamiltonian systems again defines a port-Hamiltonian system. The port-Hamiltonian description offers a systematic framework for analysis, control and simulation of complex physical systems, for lumped-parameter as well as for distributed-parameter models
A parallel algorithm for Hamiltonian matrix construction in electron-molecule collision calculations: MPI-SCATCI
Construction and diagonalization of the Hamiltonian matrix is the
rate-limiting step in most low-energy electron -- molecule collision
calculations. Tennyson (J Phys B, 29 (1996) 1817) implemented a novel algorithm
for Hamiltonian construction which took advantage of the structure of the
wavefunction in such calculations. This algorithm is re-engineered to make use
of modern computer architectures and the use of appropriate diagonalizers is
considered. Test calculations demonstrate that significant speed-ups can be
gained using multiple CPUs. This opens the way to calculations which consider
higher collision energies, larger molecules and / or more target states. The
methodology, which is implemented as part of the UK molecular R-matrix codes
(UKRMol and UKRMol+) can also be used for studies of bound molecular Rydberg
states, photoionisation and positron-molecule collisions.Comment: Write up of a computer program MPI-SCATCI Computer Physics
Communications, in pres
Parallel computing for the finite element method
A finite element method is presented to compute time harmonic microwave
fields in three dimensional configurations. Nodal-based finite elements have
been coupled with an absorbing boundary condition to solve open boundary
problems. This paper describes how the modeling of large devices has been made
possible using parallel computation, New algorithms are then proposed to
implement this formulation on a cluster of workstations (10 DEC ALPHA 300X) and
on a CRAY C98. Analysis of the computation efficiency is performed using simple
problems. The electromagnetic scattering of a plane wave by a perfect electric
conducting airplane is finally given as example
- …