Given a compact closed subset M of a line segment in R, we construct a sequence of minimal surfaces Σk embedded in a neighborhood C of the line segment that converge smoothly to a limit lamination of C away from M . Moreover, the curvature of this sequence blows up precisely on M , and the limit lamination has non-removable singularities precisely on the boundary of M .

A TU-game in characteristic function form generates a unique minimal dominant set. This set is non-empty. For a game with a non-empty core, the core and the minimal dominant set coincide; in this case the core is the smallest (for inclusion) set of outcomes that satisfies accessibility. For an abstract game, the minimal dominant set and Shenoy’s dynamic solution coincide.

In a significant step towards the construction of the semi-synthetic minimal cell, a protein expression system with a minimal set of pure and specific enzymes is required. A novel cell-free transcription and translation system named PURESYSTEM (PS), consisting of a specified set of 36 enzymes and ribosomes, has been entrapped in POPC liposomes for protein synthesis. The PS has been used to tran...

Since the first publications on non-first-normal-form relations in the late 70's and early 80's, a variety of formalizations of the data structure of and operations for nested relations have been devised. The data structure itself is defined almost identical in the several approaches, only some subtle difi'erences concerning special cases can be observed. For instance, both the VER50 relations ...