Reverse micelles in the AOT/water/isooctane system, at various water contents (W(0)), were studied using rheometry and small angle X-ray scattering (SAXS) experiments under static conditions and under shear. The SAXS analysis confirmed the spherical shape of the micelles at low water content and revealed a transition into elongated micelles at higher water content. A population of spherical mic...

We obtain the diffusion matrix, D, consisting of the main and cross-diffusion coefficients for a loaded AOT microemulsion, a quaternary system containing water (1)/AOT (2)/species (3)/octane (4). Here "species" is a component of the Belousov-Zhabotinsky reaction: NaBr, NaBrO(3), bathoferroin, ferroin, or Br(2). The main and cross-diffusion coefficients of each species depend crucially on its so...

the subject of transplant immunosuppression has generated significant interest in recent years. excellent immunosuppression, advances in surgical technique, post-transplantation care, and infection control have resulted in excellent outcomes. there is widespread support for the notion that the fundamental objective in transplant immunology should be the achievement of specific graft tolerance. ...

One of the basic results in extremal set theory was discovered in [1] and rediscovered in [2]: For a given number of k-element subsets of an n-set the shadow, that is, the set of ( k 1)-element subsets contained in at least one of the specified k-element subsets, is minimal, if the k-element subsets are chosen as an initial segment in the squashed order (see [10]; called colex order in [liD, th...

We show that enumerating all minimal spanning and connected subsets of a given matroid can be solved in incremental quasi-polynomial time. In the special case of graphical matroids, we improve this complexity bound by showing that all minimal 2-vertex connected subgraphs of a given graph can be generated in incremental polynomial time.

The Hosoya index of a graph is de*ned as the total number of independent edge subsets of the graph. In this note, we characterize the trees with a given size of matching and having minimal and second minimal Hosoya index. ? 2002 Elsevier Science B.V. All rights reserved.

We show that enumerating all minimal spanning and connected subsets of a given matroid can be solved in incremental quasi-polynomial time. In the special case of graphical matroids, we improve this complexity bound by showing that all minimal 2-vertex connected subgraphs of a given graph can be generated in incremental polynomial time.

An important parameter in a secret sharing scheme is the number of minimal qualified sets. Given this number, the universal access structure is the richest possible structure, namely the one in which there are one or more participants in every possible Boolean combination of the minimal qualified sets. Every access structure is a substructure of the universal structure for the same number of mi...