This paper considers the problem of listing all linear extensions of a partial order so that successive extensions diier by the transposition of a single pair of elements. A necessary condition is given for the case when the partial order is a forest. A necessary and suucient condition is given for the case where the partial order consists of disjoint chains. Some open problems are mentioned.

The given paper deals with the problem of structural control (dependability planning) for a wide class of any multi-component standby systems consisting of unreliable renewable elements. Mathematical models for interaction of degradation and its compensation processes in the above mentioned systems are constructed and partially investigated. These models represent open and closed queuing system...

d We present a work-in-progress report of our research on automatically analyzing German court decisions. A description language for linguistic features in content zones of a court decision is introduced, developed to cover linguistic features of German court decisions. We motivated our research with significant text characteristics found in our corpus of private law decisions and show how we m...

We present a review on rendering rigid shadows precisely and proficiently. Our review provides the details of all the existing methods for rendering shadows and the hybrid approaches. Hybrid approaches merge the two or more existing algorithms. The algorithm merges shadow map and shadow volume computation. Analysis of shadow volume, shadow map and projection algorithm is performed and is mentio...

BACKGROUND While the potential of clinical practice guidelines (CPGs) to support implementation of evidence has been demonstrated, it is not currently being achieved. CPGs are both poorly developed and ineffectively implemented. To improve clinical practice and health outcomes, both well-developed CPGs and effective methods of CPG implementation are needed. We sought to establish whether there ...