Determination of the redox activity of leukocytes in whole blood by flow cytometry

Conclusion The tetrazolium salt CTC is reduced to a fluorescent formazan involving redox reactions on the surface of leukocytes. The amount of formazan and that of stained nuclear DNA per cell are measured simultaneously by flow cytometry. Two-parametric histograms are obtained showing subgroups of cells with different formazan production.

---

Die Bestimmung der Redox-Aktivität von Leukocyten in Vollblut mit der Fluß-Cytometrie

     

On the use of the imine-diene cyclocondensation reaction in the synthesis of yohimbine congeners

Cycloaddition of dihydroβ-carbolines with polyoxygenated dienes is used to provide rapid access to the title compounds.     

Generalized singly-implicit Runge-Kutta methods with arbitrary knots

The aim of this paper is to derive Butcher's generalization of singly-implicit methods without restrictions on the knots. Our analysis yields explicit computable expressions for the similarity transformations involved which allow the efficient implementation of the first phase of the method, i.e. the solution of the nonlinear equations. Furthermore, simple formulas for the second phase of the method, i.e. computation of the approximations at the next nodal point, are established. Finally, the matrix which governs the stability of the method is studied.     

The Δ-Filtered Modules Without Self-Extensions for the Auslander Algebra of k[T]/〈T n 〉

It is well known that the Auslander algebra of any representation finite algebra is quasi-hereditary. We consider the Auslander algebra A _n of k[T]/ ⁿ (here, k is a field, T a variable and n a natural number). We determine all -filtered A _n -modules without self-extensions. They can be described purely combinatorially. Given any -filtered module N, we show that there is (up to isomorphism) a unique -filtered module M without self-extensions which has the same dimension vector. In the case where k is an infinite field, N is a degeneration of this module M. In particular, we see that in this case, the set of -filtered modules with a fixed dimension vector is the closure of an open orbit (thus irreducible). As observed by Hille and Röhrle, the problem of describing all -filtered A _n -modules is the same as that of describing the conjugacy classes of elements in the unipotent radical of a parabolic subgroup P of GL(m, k) under the action of P, thus we recover Richardson's dense orbit theorem in this instance.     

Classifying spaces for polarized mixed Hodge structures and for Brieskorn lattices

Classifying spaces and moduli spaces are constructed for two invariants of isolated hypersurface singularities, for the polarized mixed Hodge structure on the middle cohomology of the Milnor fibre, and for the Brieskorn lattice as a subspace of the Gauß–Manin connection. The relations between them, period mappings for -constant families of singularities, and Torelli theorems are discussed.     

Inducing monodomain blue phase liquid crystals by long-lasting voltage application during temperature variation

We demonstrate a new successful technique for inducing a monodomain in blue phase (BP) liquid crystals (BPLCs). By application of an AC voltage during the cooling or heating of the material into the BP temperature range, a fairly homogeneous BP area was obtained, compared to the case without voltage. We determined that applying a voltage of 3.3 V/µm was very effective in terms of obtaining a monodomain: for four of the seven different applied cooling/heating rates an area ratio of more than 99% was obtained for one particular BP orientation. This study describes a successful and replicable technique to make a BPLC monodomain, which is important for the development of BPLCs and other applications.     

A parallel stiff ODE solver based on MIRKs

A parallel, "across the method" implementation of a stiff ODE solver is presented. The construction of the methods is outlined and the main implementational issues are discussed. Performance results, using MPI on the IBM SP-2, are presented and they indicate that a speed-up between 3 and 5 typically can be obtained compared to state-of-the-art sequential codes.