in 2001, s. bulman-fleming et al. initiated the study of three flatness properties (weakly kernel flat, principally weakly kernel flat, translation kernel flat) of right acts $a_{s}$ over a monoid $s$ that can be described by means of when the functor $a_{s} otimes -$ preserves pullbacks. in this paper, we extend these results to$s$-posets and present equivalent descriptions of weakly kernel po...

PURPOSE To evaluate the effects of a structured hand cycle training programme on physical capacity in subjects with spinal cord injury (SCI) during clinical rehabilitation. METHOD Twenty subjects with SCI who followed hand cycle training were compared with matched control subjects from a Dutch longitudinal cohort study, who received usual care. Primary outcomes of physical capacity were peak ...

Effect of carnitine supplementation in enhancing fat utilization was investigated by looking into its effects on mitochondrial respiratory enzymes activity in liver and muscle as well as on membrane fatty acid profile in rats fed with hydrogenated fat (HF) and MUFA-rich peanut oil (PO) with or without exercise. Male Wistar rats were fed HF-diet (4 groups, 8 rats in each group) or PO-diet (4 gro...

The effects of dynamic quantum allocation and swap-time variability on central processing unit (CPU) behavior are investigated using a model that allows both quantum length and swap-time to be statedependent random variables. Effective CPU utilization is defined to be the proportion of a CPU busy period that is devoted to program processing, i.e. the time not spent in swapping. Using this measu...

In this paper we introduce a class of partially ordered sets, called differential posets, with many remarkable combinatorial and algebraic properties. (Terminology from lattice theory and the theory of partially ordered sets not explained here may be found in [St6].) The combinatorial properties of differential posets are concerned with the counting of saturated chains Xl < x2 < ... < x k or of...

We present Regular-SAT, an extension of Boolean Satisfiability based on a class of many-valued CNF formulas. Regular-SAT shares many properties with Boolean SAT, which allows us to generalize some of the best known SAT results and apply them to Regular-SAT. In addition, Regular-SAT has a number of advantages over Boolean SAT. Most importantly, it produces more compact encodings that capture pro...

Unlike the (classical) Kolakoski sequence on the alphabet {1, 2}, its analogue on {1, 3} can be related to a primitive substitution rule. Using this connection, we prove that the corresponding bi-infinite fixed point is a regular generic model set and thus has a pure point diffraction spectrum. The Kolakoski-(3, 1) sequence is then obtained as a deformation, without losing the pure point diffra...

We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achieved by either applying an inverse morphism and a weak coding, or a left (right) quotient with a regular language. A consequences for the closure properties of insertion grammars are shown. We also study an application i...

In this paper, the notions of L-fuzzy subalgebra degree and L-subalgebras on an effect algebra are introduced some characterizations given. We use four kinds cut sets L-subsets to characterize degree. induce convexity by degree, we prove that a morphism between two algebras is preserving mapping monomorphism convex-to-convex mapping. Finally, it proved set all can form L-convexity, its L-convex...