The formulation and implementation of wavelet based methods for the solution of multidimensional partial differential equations in complex geometries is discussed. Utilizing the close connection between Daubechies wavelets and finite difference methods on arbitrary grids, we formulate a wavelet based collocation method, well suited for dealing with general boundary conditions and nonlinearities...

MOTIVATION Multiple OCCurrences Analysis (Mocca) is a new method for repeat extraction. It is based on the T-Coffee package (Notredame et al., JMB, 302, 205-217, 2000). Given a sequence or a set of sequences, and a library of local alignments, Mocca extracts every segment of sequence homologous to a pre-specified master. The implementation is meant for domain hunting and makes it fast and easy ...

As a fundamental problem in image processing, image deblurring has still attracted a lot of research attention. Due to the large computational cost, especially for high-resolution images, it becomes challenging to solve the deblurring minimization problem and the underlying partial differential equations. The domain decomposition method (DD), as one of themost efficient algorithms for solving l...

Pallalel GPGPU computing for lattice QCD simulations has a bottleneck on the GPU to GPU data communication due to the lack of the direct data exchanging facility. In this work we investigate the performance of quark solver using the restricted additive Schwarz (RAS) preconditioner on a low cost GPU cluster. We expect that the RAS preconditioner with appropriate domaindecomposition and task dist...

A different lattice fermion method is introduced. Staggered domain wall fermions are defined in 2n + 1 dimensions and describe 2 flavors of light lattice fermions with exact U(1)×U(1) chiral symmetry in 2n dimensions. As the size of the extra dimension becomes large, 2 chiral flavors with the same chiral charge are expected to be localized on each boundary and the full SU(2n)×SU(2n) flavor chir...

Diffuse optical tomography is modelled as an optimization problem to find the absorption and scattering coefficients that minimize the error between the measured photon density function and the approximated one computed using the coefficients. The problem is composed of two steps: the forward solver to compute the photon density function and its Jacobian (with respect to the coefficients), and ...

Domain decomposition methods are widely used to solve the parabolic partial differential equations with Dirichlet, Neumann, or mixed boundary conditions. Modified implicit prediction (MIP) algorithm is unconditionally stable domain decomposition method. In this paper, the SOR iterative technique is applied to the MIP algorithm and the optimum over-relaxation parameter is provided.

I present the gap domain wall fermion (GDWF) method. I show that GDWF induce a substantial gap in the transfer matrix Hamiltonian along the fifth dimension. As a result they significantly improve the chiral properties of domain wall fermions in the large to intermediate lattice spacing regime of QCD, 1 to 2 GeV. Furthermore, I argue that this method should also improve the chiral properties of ...

This paper devotes itself to the study of secret message delivery using cover image and introduces a novel steganographic technique based on genetic algorithm to find a near-optimum structure for the pair-wise least-significant-bit (LSB) matching scheme. A survey of the related literatures shows that the LSB matching method developed by Mielikainen, employs a binary function to reduce the numbe...