In this paper the efficient space virtualisation for Hoshen–Kopelman algorithm is presented. We observe minimal parallel overhead during computations, due to negligible communication costs. The proposed algorithm is applied for computation of random-site percolation thresholds for four dimensional simple cubic lattice with sites’ neighbourhoods containing next-next-nearest neighbours (3NN). The...

Meson-meson correlation effects are investigated in the NN → ρπ annihilation process using a realistic meson-exchange model for the ρπ interaction determined previously, together with a conventional baryon-exchange transition model and a consistent NN interaction. For NN S-states, they have a drastic effect and bring the relative (S0/ S1) branching ratio up to the experimental value, thus resol...

We note that in the limit where the NN S0 and S1 scattering lengths, a (S0) and a 3S1), go to infinity, the leading terms in the effective field theory for strong NN interactions are invariant under Wigner’s SU(4) spin-isospin symmetry. This explains why the leading effects of radiation pions on the S-wave NN scattering amplitudes vanish as a S0) and a S1) go to infinity. The implications of Wi...

effect of different concentrations of ammonium chloride (ncl) and ammonium nitrate (nn)and surfactants such as tween-80, hpcd and rhamnolipids on the bioremediation of pahs and ocps wasinvestigated. the results showed that the best optimum concentration of ncl and nn was 50 g·kg-1, and thepahs degradation rate during 60 days of remediation was enhanced to 64.6% and 62.8% for ncl and nn,respecti...

In this paper, it is shown that Multilayer perceptron Neural Network can elegantly perform nonlinear regression of transfer characteristic of electronic devices. After rigorous computer simulations authors develop the optimal MLP NN models, which elegantly perform such a nonlinear regression. Results show that the proposed optimal MLP NN models have optimal values of MSE (mean square error), r ...

In this paper we introduce a new paradigm for similarity search, called PAC-NN (probably approximately correct nearest neighbor) queries, aiming to break the “dimensionality curse” which inhibits current approaches to be applied in high-dimensional spaces. PAC-NN queries return, with probability at least 1− δ, a (1+ )-approximate NN – an object whose distance from the query q is less than (1 + ...