Application of novel extractants for actinide(III)/ lanthanide(III) separation in hollow-fibre modules

Separation tests using hollow-fibre modules were performed for the difficult selective extraction of trivalent actinides over fission lanthanides from acidic media. This article shows that with 2,6-di(5,6-dipropyl-1,2,4-triazin-3-yl)pyridine as the extractant, up to 94% americium could be extracted from 1.0 kmol/m³ HNO₃, with minimal lanthanide co-extraction. Using a synergistic mixture of bis(chlorophenyl)dithiophosphinic acid and tri-n-octyl phosphine oxide, tests were performed on extraction, lanthanide scrubbing and stripping. In the extraction test, up to 99.99% americium could be extracted from 0.5 kmol/m³ HNO₃, with approximately one third of the lanthanides being co-extracted. Mass transfer calculations using a consistent set of input data showed good agreement with the experiments.     

Verbessertes Widerstandsgesetz für Stufendiffusoren

Zusammenfassung Es wird ein allgemeines Widerstandsgesetz für Stufendiffusoren hergeleitet, bei dem die Widerstandszahl den Zusatzverlust gegenüber den Verlusten der bis zum Kontursprung reichenden fiktiven Kanal- bzw. Rohrstr?mungen in der Zu- und Abstr?mung beschreibt. Unter vereinfachenden Annahmen reduziert sich dieses Gesetz auf die bekannte Carnot-Formel. Insbesondere wird dabei der Anteil des Zusatzverlustes, der vom Unterdruck an der Stufe und von der Wandschubspannungs?nderung unmittelbar hinter der Stufe herrührt, vernachl?ssigt. Die Berücksichtigung dieses Anteils führt zu einem gegenüber der Carnot-Formel verbesserten Widerstandsgesetz. Herrn Prof. Dr.-Ing. Martin Fiebig zum 60. Geburtstag     

Implantable biomedical microsystems for neural prostheses.

In the following article, the technologies to fabricate polyimide-based thin and flexible substrates with monolithically integrated electrode arrays and printed circuit boards (PCB) for hybrid electronic assemblies as well as an assembling technique that connects bare electronic dice with flexible PCBs are presented. The concept of modular, flexible biomedical microsystems as neural prostheses is introduced in general and described in detail in three examples. A cuff electrode with integrated multiplexer circuitry and standard implantable cables represents the combination of microtechnology with precision mechanics; a sieve electrode used as an implant in peripheral nerve regeneration studies demonstrates the next level of integration density but still uses a cable connection; and last, joint effort to fabricate the demonstrator of a vision prosthesis that is completely implantable in the eye with a wireless link for energy supply and data transmission is presented. System design, hybrid assembling technology, and flexible multilayer encapsulation using parylene and silicone rubber are the key components for creating a new generation of neural prostheses for complex and challenging new applications.     

Modified CIELAB formula tested using a textile pass/fail data set

The proposed new color-difference formula of CIE TC 129, which is a modified version of CIELAB, was tested with a recently published data set of textile pass/fail judgments. Goodness of fit is improved, if the parameter of lightness is set near 2, and if, additionally, a weight function for lightness is defined that reduces the weight of a lightness difference with lightness level in relation to chroma or hue scaling. © 1994 John Wiley & Sons, Inc.     

Computing presentations for subgroups of polycyclic groups and of context-free groups

Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and ()-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.Finitely generated context-free groups can be presented by finite, monadic, and -confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and -confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup U ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92