The Rota-Baxter algebra and the shuffle product are both algebraic structures arising from integral operators equations. Free commutative algebras provide an framework for equations with simple Riemann operator. Zinbiel form a category in which is free object. Motivated by underlying involving multiple kernels, we study matching construct objects making use of decorations. We also relative cont...

the most important factor in donor-recipient matching for hematopoietic stem cell transplantation is their hla typing. for many patients, we can not find a full-matched donor. in high risk patients, one locus  mismatched related donors are suitable alternatives. (1, 2) since the matching of patients and their siblings usually is based on low resolution hla typing, the matching of one locus mism...

Invited Lecture: Foundations of Practical Parallel Programming Languages p. 115 Prototyping Parallel Algorithms with ProSet-Linda p. 135 Identifying the Available Parallelism Using Static Analysis p. 151 Automatic Parallelization by Pattern-Matching p. 166 Parallelization A Case Study p. 182 Invited Lecture: PVM 3 Beyond Network Computing p. 194 The Design of the PACLIB Kernel for Parallel Alge...

Tutte [W.T. Tutte, On the algebraic theory of graph colorings, J. Combin. Theory 1 (1966) 15–20] conjectured that every bridgeless Petersen-minor free graph admits a nowhere-zero 4-flow. Let (P10)μ̄ be the graph obtained from the Petersen graph by contracting μ edges from a perfect matching. In this paper we prove that every bridgeless (P10)3̄-minor free graph admits a nowhere-zero 4-flow. c © 20...

The relationship between two important problems in tree pattern matching, the largest common subtree and the smallest common supertree problems, is established by means of simple constructions, which allow one to obtain a largest common subtree of two trees from a smallest common supertree of them, and vice versa. These constructions are the same for isomorphic, homeomorphic, topological, and m...

This paper summarizes a number of discretization and solution tech niques that are commonly referred to as nite volume and mixed nite element methods We describe some of them in more detail that is provide a common discretization strategy as well as address the issue of solving the resulting systems of linear algebraic equations The paper focuses on locally conservative discretizations that inc...

A multiblock mortar approach to modeling multiphase ow in porous media decomposes the simulation domain into a series of blocks with possibly di erent physical and numerical models employed in each block. Matching conditions along the interfaces are imposed through the use of mortar nite elements. A parallel domain decomposition algorithm reduces the algebraic nonlinear system to an interface p...

In this paper, we present the implementation in Tom of a de Bruijn indices generalization allowing the representation of term-graphs over an algebraic signature. By adding pattern matching and traversal controls to Java, Tom is a well-suited environment for defining program transformations or analyses. As some analyses, e.g. based on control flow, require graph-like structures, the use of this ...

We consider the problem of term normalisation modulo associative-commutative (AC) theories and describe several techniques for compiling many-to-one AC matching and reduced term construction. The proposed method, illustrated on three examples, is based on compact bipartite graphs, and is designed for working very efficiently on specific classes of AC patterns. Our experimental results provide s...