Global Krylov subspace methods are the most efficient and robust methods to solve generalized coupled Sylvester matrix equation. In this paper, we propose the nested splitting conjugate gradient process for solving this equation. This method has inner and outer iterations, which employs the generalized conjugate gradient method as an inner iteration to approximate each outer iterate, while each...

Bit-splitting breaks the problem of monitoring traffic payloads to detect the occurrence of suspicious patterns into several parallel components, each of which searches for a particular bit pattern. We analyze bit-splitting as applied to Aho-Corasick style string matching. The problem can be viewed as the recovery of a special class of regular languages over product alphabets from a collection ...

In the splitting model, information theoretic authentication codes allow non-deterministic encoding, that is, several messages can be used to communicate a particular plaintext. Certain applications require that the aspect of secrecy should hold simultaneously. Ogata–Kurosawa–Stinson–Saido (2004) have constructed optimal splitting authentication codes achieving perfect secrecy for the special c...

The second heart sounds in 29 cases with right bundle branch block, mainly surgically induced, were studied. Three general types of the second sound were classified. Eleven cases revealed wide splitting of the second sound (0.05 sec. or more), and 14 cases showed narrow splitting less than 0.05 sec.), while 4 cases showed a single 2nd heart sound throughout the respiratory cycle. Ten cases reve...

Previously, we reported that little canonical (H3.1-H4)(2) tetramers split to form "hybrid" tetramers consisted of old and new H3.1-H(4) dimers, but approximately 10% of (H3.3-H4)2 tetramers split during each cell cycle. In this report, we mapped the H3.3 nucleosome occupancy, the H3.3 nucleosome turnover rate and H3.3 nucleosome splitting events at the genome-wide level. Interestingly, H3.3 nu...

In this work, defect-based local error estimators for higher-order exponential operator splitting methods are constructed and analyzed in the context of time-dependent linear Schrödinger equations. The technically involved procedure is carried out in detail for a general three-stage third-order splitting method and then extended to the higher-order case. Asymptotical correctness of the a poster...

We prove that an n-valued function that is lower semi-continuous is also upper semi-continuous and therefore continuous, that is, an n-valued map. Several conditions are shown to be equivalent to continuity for n-valued functions, in particular the continuity of a corresponding singlevalued function to a configuration space. Consequently, splitting is related to braid groups to prove a Splittin...

Reaction-Advection-Diffusion problems occurring in Air Pollution Models have very stiff reaction terms and moderately stiff vertical mixing (diffusion and cloud transport) terms which both should be integrated implicitly in time. Standard implicit time stepping is by far too expensive for this type of problems whereas widely used splitting techniques may lead to unacceptably large errors for fa...

We report on the growth and exploitation of InGaN epilayers as a photoelectrochemical cell PEC material for direct generation of hydrogen by splitting water using photoelectrochemical hydrolysis. Under white light illumination, a drastic dependence of the photocurrent density on the In content was observed. Direct hydrogen gas generation by splitting water was accomplished using an n-type InxGa...

A polygon splitting algorithm is a combinatorial recipe. The description and the implementation of polygon splitting should not depend on the embedding geometry. Whether a polygon is being split in Euclidean, in spherical, in oriented projective, or in hyperbolic geometry should not be part of the description of the algorithm. The algorithm should be purely combinatorial, or geometry free. The ...