The clique partitioning problem (CPP) can be formulated as follows: Given is a complete graph G = (V, E), with edge weights wij ∈ R for all {i, j} ∈ E. A subset A ⊆ E is called a clique partition if there is a partition of V into nonempty, disjoint sets V1, . . . , Vk , such that each Vp (p = 1, . . . ,k) induces a clique (i.e., a complete subgraph), and A = ∪ p=1 {{i, j}|i, j ∈ Vp , i ≠ j}. Th...

For little q-Jacobi polynomials and q-Hahn polynomials we give particular q-hypergeometric series representations in which the termwise q = 0 limit can be taken. When rewritten in matrix form, these series representations can be viewed as LU factorizations. We develop a general theory of LU factorizations related to complete systems of orthogonal polynomials with discrete orthogonality relation...

The paper introduces a new concept to express the architecture and behavior of distributed systems in a formal, detailed and extensible manner in terms of reference point facets (RP-facets). RP-facets are based on the well-established concept of reference points as used in ODP and TINA. Facets describe statical and dynamic aspects of reference points as well as preand post-conditions for their ...

let r and s be reduced rings with identities whose idempotents are central, and let m be an(r, s)-bimodule such that annr (m)=0. in this paper, we determine first the structure of automorphisms ofthe triangular ring, =sr mt0, and then, for all automorphisms α ,β of t we determine the structureof (α,β)-derivations of t.

The cheetah Acinonyx jubatus is the most cursorial felid and has been described as somewhat dog-like in both the shape and the diminished degree of retraction of the claws. In this study we evaluate and investigate the osteological correlates associated with claw retraction in the cheetah through a comparison of the morphology of its middle phalanges with those of other felids and of the wolf C...

We study facets of the cut cone C,, i.e., the cone of dimension 1⁄2n(n 1) generated by the cuts of the complete graph on n vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a "'lifting" procedure for constructing facets of C~ +1 from given facets of t...