For terms not defined here, the reader is referred to [6]. For a graph G=(V, E), we denote by G the complement of G. We use |(G) to denote the size of a largest clique in G and :(G) to denote the size of a largest stable set in G, or simply | and : when no confusion is possible. A graph G is said to be perfect if, for each induced subgraph H of G, H can be coloured with |(H) colours such that e...

The aim of this work is to study a very special family odd-quadratic Lie superalgebras g = 0 ¯ ⊕ 1 such that weak filiform -module (weak type). We introduce concept after having proved the unique non-zero superalgebra ( , B ) with abelian 2-dimensional dim . Let us note in context role center crucial. Thus, we obtain an inductive description type via generalized odd double extensions. Moreover,...

When stepping onto a stopped escalator, we often perceive an "odd sensation" that is never felt when stepping onto stairs. The sight of an escalator provides a strong contextual cue that, in expectation of the backward acceleration when stepping on, triggers an anticipatory forward postural adjustment driven by a habitual and implicit motor process. Here we contrast two theories about why this ...

We put the final piece into a puzzle first introduced by Bollobás, Erdős and Szemerédi in 1975. For arbitrary positive integers n and r we determine the largest integer ∆ = ∆(r, n), for which any r-partite graph with partite sets of size n and of maximum degree less than ∆ has an independent transversal. This value was known for all even r. Here we determine the value for odd r and find that ∆(...

Background: Bacterial sepsis is highly prevalent among premature infants. Amikacin is an antibiotic widely recommended for the treatment of neonatal sepsis, one of the consequences of which might be nephrotoxicity. The present study aimed to compare the efficacy and nephrotoxicity of multiple daily dosing (MDD) and once-daily dosing (ODD) of amikacin in preterm infants suspected of sepsis. Met...

We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle are partitioned into two matchings canonically. A matching defines a single step, the two matchings form a single round. Processors connected by an edge of the matching perfectly balance their loads, and, if there is an excess to...

Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...