X-ray Fluorescence Uptake Measurement of Functionalized Gold Nanoparticles in Tumor Cell Microsamples

Quantitative cellular in vitro nanoparticle uptake measurements are possible with a large number of different techniques, however, all have their respective restrictions. Here, we demonstrate the application of synchrotron-based X-ray fluorescence imaging (XFI) on prostate tumor cells, which have internalized differently functionalized gold nanoparticles. Total nanoparticle uptake on the order of a few hundred picograms could be conveniently observed with microsamples consisting of only a few hundreds of cells. A comparison with mass spectroscopy quantification is provided, experimental results are both supported and sensitivity limits of this XFI approach extrapolated by Monte-Carlo simulations, yielding a minimum detectable nanoparticle mass of just 5 pg. This study demonstrates the high sensitivity level of XFI, allowing non-destructive uptake measurements with very small microsamples within just seconds of irradiation time.     

Bioenergetic Alterations of Metabolic Redox Coenzymes as NADH,FAD and FMN by Means of Fluorescence Lifetime Imaging Techniques

Metabolic FLIM (fluorescence lifetime imaging) is used to image bioenergetic status in cells and tissue. Whereas an attribution of the fluorescence lifetime of coenzymes as an indicator for cell metabolism is mainly accepted, it is debated whether this is valid for the redox state of cells. In this regard, an innovative algorithm using the lifetime characteristics of nicotinamide adenine dinucleotide (phosphate) (NAD(P)H) and flavin adenine dinucleotide (FAD) to calculate the fluorescence lifetime induced redox ratio (FLIRR) has been reported so far. We extended the FLIRR approach and present new results, which includes FLIM data of the various enzymes, such as NAD(P)H, FAD, as well as flavin mononucleotide (FMN). Our algorithm uses a two-exponential fitting procedure for the NAD(P)H autofluorescence and a three-exponential fit of the flavin signal. By extending the FLIRR approach, we introduced FLIRR1 as protein-bound NAD(P)H related to protein-bound FAD, FLIRR2 as protein-bound NAD(P)H related to free (unbound) FAD and FLIRR3 as protein-bound NAD(P)H related to protein-bound FMN. We compared the significance of extended FLIRR to the metabolic index, defined as the ratio of protein-bound NAD(P)H to free NAD(P)H. The statistically significant difference for tumor and normal cells was found to be highest for FLIRR1.     

Matching ultrasonic transducer using two matching layers where one of them is glue

The aim of this work is to propose an original solution to the acoustic impedance mismatch between a PZT transducer and a water load. The characteristic acoustic impedance of the PZT is around 33 MRayl. Theoretically, a quarter-wave layer with characteristic acoustic impedance equal to 7 MRayl is necessary to match the transducer to water. In practice, it is difficult to find a material with this particular impedance. Two or more quarter-wave layers may also be used. The following proposed solution consists in using two matching layers where one of them is the glue. Moreover, their thicknesses are not equal to a quarter of their individual wavelength. Once the glue is taken as the first matching layer, the specific material of the second layer can easily be found. In this work, the second layer, which is also the front layer, is made of glass. The thickness of each matching layer is then calculated as a function of the characteristic acoustic impedance of the two layers. The influence of the thickness of these layers is discussed. The proposed matching configuration is analyzed and theoretical results have been carefully and successfully compared with measurements.     

Continuous production of structured phospholipids in a packed bed reactor with lipase from <Emphasis Type="Italic">Thermomyces lanuginosa</Emphasis>

The possibilities of producing structured phospholipids between soybean phospholipids and caprylic acid by lipase-catalyzed acidolysis were examined in continuous packedbed enzyme reactors. Acidolysis reactions were performed in both a solvent system and a solvent-free system with the commercially immobilized lipase from Thermomyces lanuginosa (Lipozyme TL IM) as catalyst. In the packed bed reactors, different parameters for the lipase-catalyzed acidolysis were elucidated, such as solvent ratio (solvent system), temperature, substrate ratio, residence time, water content, and operation stability. The water content was observed to be very crucial for the acidolysis reaction in packed bed reactors. If no water was added to the substrate during reactions under the solvent-free system, very low incorporation corporation of caprylic acid was observed. In both solvent and solvent-free systems, acyl incorporation was favored by a high substrate ratio between acyl donor and phospholipids, a longer residence time, and a higher reaction temperature. Under certain conditions, the incorporation of around 30% caprylic acid can be obtained in continuous operation with hexane as the solvent. Presented at the 95th American Oil Chemists' Society Annual Meeting and Expo in Cincinnati, Ohio, May 10, 2004.     

Development and characterization of a biocompatible OH-modified copolymer based on polyurethane

Different polyurethanes were synthesized by varying the diol as well as the diisocyanate components and chain extenders. Polyurethanes with OH-groups were obtained by photo- and thermoinitiation of the radical polymerization of hydroxy alkyl acrylates in the presence of the polyurethanes. The polymers were evaluated with respect to their biocompatibility by measuring the cell spreading, the rates of DNA- and protein synthesis and the swelling behaviour. The differences in the surfaces and the bulks between the selected basic polyurethane and the functionalized modification were determined and characterized by XPS, FTIR-ATR and ¹³C-FT-NMR-spectroscopy. The mechanical data of Tecoflex EG 60D® and Pellethane 2363–80AE® were compared with the data of the synthesized polyurethanes.     

A computational investigation of non-isothermal gas-solid flow in a U-bend

The non-isothermal gas-solid flow through a U-bend of a pneumatic conveying dryer system is calculated using the commercial CFD program Fluent 6.1. Steady-state, incompressible and non-isothermal gas-solid flows are employed to simulate the cases. Variables studied include: particle diameter, particle density, solid loading ratio, feed gas temperature, heat flux through the wall, gas velocity and bend radius ratio on heat transfer phenomena between gas and solid particles. Validation is done by comparing calculation results with the available experimental data provided by Baughn et al. [J.W. Baughn, H. Iacovides, D.C. Jackson, B.E. Launder, Local heat transfer measurements in turbulent flow around a 180° pipe bend, Journal of Heat Transfer 109 (1) (1987) 43-48] and Depew and Farbar [C.A. Depew, L. Farbar, Heat transfer to pneumatically conveyed glass particles of fixed size, Journal of Heat Transfer 85 (1963) 164-172].In general, data validations of both cases show good agreement. The gas temperature decreases and the solid temperature increases along the axial direction of the pipe due to transfer of heat from the gas phase to the solid phase. The gas temperature decreases significantly at the outer bend wall due to an accumulation of particles, which causes much more energy to be transferred from the gas to solid phases. At the inner bend wall, the gas temperature decreases slightly but the solid temperature increases significantly due to a low concentration of particles. A U-bend significantly increases the local and area average Nu numbers, but not the mass average Nu number. The slip velocity and particle distribution are the major factors influencing the value of the mass average Nu number.     

Computational Problem Solving in Spatial Substrates -- A Cognitive Systems Engineering Approach

The ability to perform spatial tasks is crucial for everyday life and of great importance to cognitive agents such as humans, animals, and autonomous robots. A common artificial intelligence approach to accomplish spatial tasks is to represent spatial configurations and tasks in form of detailed knowledge about various aspects of space and time. Suitable algorithms then use the representations to compute solutions to spatial problems. In comparison, natural embodied and situated agents often solve spatial tasks without detailed knowledge about geometric, topological, or mechanical laws; they directly relate actions to effects that are due to spatio-temporal affordances in their bodies and environments. Accordingly, we propose a paradigm that makes the spatio-temporal substrate an integral part of the engine that drives spatial problem solving. We argue that spatial and temporal structures in body and environment can substantially support (and even replace) reasoning effort in computational processes: physical manipulation and perception in spatial environments substitute formal computation. While the approach is well known – for example, we employ diagrams as spatial substrate for geometric problem solving and maps for wayfinding – the underlying principle has not been systematically investigated or formally analyzed as a paradigm of cognitive processing. Topology, distance, and orientation constraints are all integrated and interdependent in truly 2- or 3-dimensional space. Exploiting this fact may not only help overcome the need for acquiring detailed knowledge about the interrelationships between different aspects of space; it also can point to a way of avoiding exploding computational complexity that occurs when we deal with these aspects of space in complex real-world scenarios. Our approach employs affordance-based object-level problem solving to complement knowledge-level formal approaches. We will assess strengths and weaknesses of the new cognitive systems paradigm.     

Five-year experience with setup and implementation of an integrated database system for clinical documentation and research

In radiation oncology, where treatment concepts are elaborated in interdisciplinary collaborations, handling distributed, large heterogeneous amounts of data efficiently is very important, yet challenging, for an optimal treatment of the patient as well as for research itself. This becomes a strong focus, as we step into the era of modern personalized medicine, relying on various quantitative data information, thus involving the active contribution of multiple medical specialties. Hence, combining patient data from all involved information systems is inevitable for analyses. Therefore, we introduced a documentation and data management system integrated in the clinical environment for electronic data capture. We discuss our concept and five-year experience of a precise electronic documentation system, with special focus on the challenges we encountered. We specify how such a system can be designed and implemented to plan, tailor and conduct (multicenter) clinical trials, ultimately reaching the best clinical performance, and enhancing interdisciplinary and clinical research.     

A Distributed O(1)-Approximation Algorithm for the Uniform Facility Location Problem

We investigate a metric facility location problem in a distributed setting. In this problem, we assume that each point is a client as well as a potential location for a facility and that the opening costs for the facilities and the demands of the clients are uniform. The goal is to open a subset of the input points as facilities such that the accumulated cost for the whole point set, consisting of the opening costs for the facilities and the connection costs for the clients, is minimized. We present a randomized distributed algorithm that computes in expectation an ${\mathcal {O}}(1)$ -approximate solution to the metric facility location problem described above. Our algorithm works in a synchronous message passing model, where each point is an autonomous computational entity that has its own local memory and that communicates with the other entities by message passing. We assume that each entity knows the distance to all the other entities, but does not know any of the other pairwise distances. Our algorithm uses three rounds of all-to-all communication with message sizes bounded to $\mathcal{O}(\log(n))$ bits, where n is the number of input points. We extend our distributed algorithm to constant powers of metric spaces. For a metric exponent ?≥1, we obtain a randomized ${\mathcal {O}}(1)$ -approximation algorithm that uses three rounds of all-to-all communication with message sizes bounded to $\mathcal{O}(\log(n))$ bits.