Scheduling data transfers in a network and the set scheduling problem

In this paper we consider the online ftp problem. The goal is to service a sequence of file transfer requests given bandwidth constraints of the underlying communication network. The main result of the paper is a technique that leads to algorithms that optimize several natural metrics, such as max-stretch, total flow time, max flow time, and total completion time. In particular, we show how to achieve optimum total flow time and optimum max-stretch if we increase the capacity of the underlying network by a logarithmic factor. We show that the resource augmentation is necessary by proving polynomial lower bounds on the max-stretch and total flow time for the case where online and offline algorithms are using same-capacity edges. Moreover, we also give polylogarithmic lower bounds on the resource augmentation factor necessary in order to keep the total flow time and max-stretch within a constant factor of optimum.     

Two-Variable Identities in Groups and Lie Algebras

We study two-variable Engel-like relations and identities characterizing finite-dimensional solvable Lie algebras and, conjecturally, finite solvable groups and introduce some invariants of finite groups associated with such relations. Bibliography: 29 titles.     

Study of the peak effect phenomenon in single crystals of 2H-NbSe2

The weakly pinned single crystals of the hexagonal 2H-NbSe₂ compound have emerged as prototypes for determining and characterizing the phase boundaries of the possible order-disorder transformations in the vortex matter. We present here a status report based on the ac and dc magnetization measurements of the peak effect phenomenon in three crystals of 2H-NbSe₂, in which the critical current densities vary over two orders of magnitude. We sketch the generic vortex phase diagram of a weakly pinned superconductor, which also utilizes theoretical proposals. We also establish the connection between the metastability effects and pinning.     

A highly enantioselective conjugate reduction of 3-arylinden-1-ones using bakers' yeast for the preparation of (S)-3-arylindan-1-ones

[formula: see text] The bakers' yeast reduction of 3-(1,3-benzodioxol-5-yl)-6-propoxy-1H-inden-1-one 4 has been shown to give (S)-3-(1,3-benzodioxol-5-yl)-2,3-dihydro-6-propoxy-1H-indan-1-one 6 in 65% yield with high enantioselectivity (> 99.0% ee), a key intermediate for the synthesis of the endothelin receptor antagonist SB 217242. In addition, the substituted 3-arylinden-1-ones 10a-e gave equally high enantioselectivity for the 3-arylindan-1-one products 13a-e. Mechanistic studies of the reaction indicate the operative pathway to be an asymmetric conjugate reduction, wherein the hydride transfer from NAD(P)H occurs from the Re-face of the indenone substrate.     

PI-groups and PI-representations of groups

It is well known that many famous Burnside-type problems have positive solutions for PI-groups and PI-algebras. In the present article, we also consider various Burnside-type problems for PI-groups and PI-representations of groups.     

Approximation Algorithms for Steiner and Directed Multicuts

In this paper we consider theSteiner multicutproblem. This is a generalization of the minimum multicut problem where instead of separating nodepairs, the goal is to find a minimum weight set of edges that separates all givensetsof nodes. A set is considered separated if it is not contained in a single connected component. We show anO(log³(kt)) approximation algorithm for the Steiner multicut problem, wherekis the number of sets andtis the maximum cardinality of a set. This improves theO(t log k) bound that easily follows from the previously known multicut results. We also consider an extension of multicuts to directed case, namely the problem of finding a minimum-weight set of edges whose removal ensures that none of the strongly connected components includes one of the prespecifiedknode pairs. In this paper we describe anO(log² k) approximation algorithm for this directed multicut problem. Ifk ? n, this represents an improvement over theO(log n log log n) approximation algorithm that is implied by the technique of Seymour.     

Algebraic Operations and Generic Effects

Given a complete and cocomplete symmetric monoidal closed category V and a symmetric monoidal V-category C with cotensors and a strong V-monad T on C, we investigate axioms under which an Ob C-indexed family of operations of the form _x :(Tx) ^v (Tx) ^w provides semantics for algebraic operations on the computational -calculus. We recall a definition for which we have elsewhere given adequacy results, and we show that an enrichment of it is equivalent to a range of other possible natural definitions of algebraic operation. In particular, we define the notion of generic effect and show that to give a generic effect is equivalent to giving an algebraic operation. We further show how the usual monadic semantics of the computational -calculus extends uniformly to incorporate generic effects. We outline examples and non-examples and we show that our definition also enriches one for call-by-name languages with effects.