for solving large sparse non-hermitian positive definite linear equations, bai et al. proposed the hermitian and skew-hermitian splitting methods (hss). they recently generalized this technique to the normal and skew-hermitian splitting methods (nss). in this paper, we present an accelerated normal and skew-hermitian splitting methods (anss) which involve two parameters for the nss iteration. w...

In this paper, we propose a new approach to manage data distribution in a relationnal data warehouse environment. This approach deals with the dynamic data splitting on a set of interconnected machines. The data distribution that we consider is different from the “classical” one which depends on the data use. The distribution in our approach consists in splitting data when the machine reaches h...

In a bi-directional Community Antenna Television (CATV) Network the use of a Contention Resolutions Algorithm (CRA) is essential in order to allocate the bandwidth of the multiaccess medium in the upstream direction between the active stations. Two of the CRAs known as exponential backoff algorithm and splitting tree algorithm, have recently been adopted by the Digital Video Broadcasting (DVB)/...

In this work, we present a cell-centered time-splitting technique for solving evolutionary diffusion equations on triangular grids. To this end, we consider three variables (namely the pressure, the flux and a weighted gradient) and construct a so-called expanded mixed finite element method. This method introduces a suitable quadrature rule which permits to eliminate both fluxes and gradients, ...

In the search for optimized cathode materials for high-temperature electrolysis, mixed conducting oxides are highly promising candidates. This study deals with fundamentally novel insights into the relation between surface chemistry and electrocatalytic activity of lanthanum ferrite based electrolysis cathodes. For this means, near-ambient-pressure X-ray photoelectron spectroscopy (NAP-XPS) and...

Novel search space splitting techniques have recently been successfully exploited to paralleliz Constraint Programming and Mixed Integer Programming solvers. We first show how universal hashing can be used to extend one such interesting approach to a generalized setting that goes beyond discrepancy-based search, while still retaining strong theoretical guarantees. We then explain that such stat...