Water droplet flow paths and droplet deposition in low pressure steam turbines

The complex three-dimensional two-phase flow in a low pressure steam turbine is investigated with comprehensive numerical flow simulations. In addition to the condensation process, which already takes place in the last stages of steam turbines, the numerical flow model is enhanced to consider the drag forces between the droplets and the vapour phase. The present paper shows the differences in the flow path of the phases and investigates the effect of an increasing droplet diameter. For the flow simulations a performance cluster is used because of the high effort for such multi-momentum two-phase flow calculations. In steam turbines the deposition of small water droplets on the stator blades or on parts of the casing is responsible for the formation of large coarse water droplets and these may cause additional dissipation as well as damage due to blade erosion. A method is presented that uses detailed CFD data to predict droplet deposition on turbine stator blades. This simulation method to detect regions of droplet deposition can help to improve the design of water removal devices. © Springer-Verlag Berlin Heidelberg 2013.

Different transfer paths for thermally activated electrons and holes in self-organized Ge/Si(001) islands in a multilayer structure

We investigated the temperature dependence (10-250 K) of the photoluminescence (PL) emission spectrum of self-organized Ge/Si(001) islands in a multilayer structure. With elevated temperature, we find that the thermally activated holes and electrons are gathered by the Ge islands in different ways. The holes drift from the wetting layer into the islands, while the electrons, confined in Si due to type-II band alignment, leak into the Ge islands by the electrostatic interaction with the holes accumulated there. It results in an increase of the integrated intensity of island-related PL at a certain temperature range and a reduction of the phonon energy in the phonon-assisted PL of the islands by involving a type-I transition into a type-II transition. (C) 2001 American Institute of Physics.

an efficient method to generate feasible paths for basis path testing

Basis path testing is a very powerful structural testing criterion. The number of test paths equals to the cyclomatic complexity of program defined by McCabe. Traditional test generation methods select the paths either without consideration of the constraints of variables or interactively. In this note, an efficient method is presented to generate a set of feasible basis paths. The experiments show that this method can generate feasible basis paths for real-world C programs automatically in acceptable time.

Dominant kinetic paths on biomolecular binding-folding energy landscape

The identification of kinetic pathways is a central issue in understanding the nature of flexible binding. A new approach is proposed here to study the dynamics of this binding-folding process through the establishment of a path integral framework on the underlying energy landscape. The dominant kinetic paths of binding and folding can be determined and quantified. In this case, the corresponding kinetic paths of binding are shown to be intimately correlated with those of folding and the dynamics becomes quite cooperative. The kinetic time can be obtained through the contributions from the dominant paths and has a U-shape dependence on temperature.

Quantifying the kinetic paths of flexible biomolecular recognition

Biomolecular recognition often involves large conformational changes, sometimes even local unfolding. The identification of kinetic pathways has become a central issue in understanding the nature of binding. A new approach is proposed here to study the dynamics of this binding-folding process through the establishment of a path-integral framework on the underlying energy landscape. The dominant kinetic paths of binding and folding can be determined and quantified. The significant coupling between the binding and folding of biomolecules often exists in many important cellular processes. In this case, the corresponding kinetic paths of binding are shown to be intimately correlated with those of folding and the dynamics becomes quite cooperative. This implies that binding and folding happen concurrently. When the coupling between binding and folding is weak (strong), the kinetic process usually starts with significant folding (binding) first, with the binding (folding) later proceeding to the end. The kinetic rate can be obtained through the contributions from the dominant paths. The rate is shown to have a bell-shaped dependence on temperature in the concentration-saturated regime consistent with experiment. The changes of the kinetics that occur upon changing the parameters of the underlying binding-folding energy landscape are studied.

Computer perception of topological symmetry by all-paths algorithm

During the development of our ESESOC system (Expert System for the Elucidation of the Structures of Organic Compounds), computer perception of topological symmetry is essential in searching for the canonical description of a molecular structure, removing the irredundant connections in the structure generation process, and specifying the number of peaks in C-13- and H-1-NMR spectra in the structure evaluation process. In the present paper, a new path identifier is introduced and an algorithm for detection of topological symmetry from a connection table is developed by the all-paths method. (C) 1999 Elsevier Science B.V. All rights reserved.

Developing molecular identification numbers by an all-paths method

A new topological index is devised from an all-paths method. This molecular topological index has highly discriminating power for various kinds of organic compounds such as alkane trees, complex cyclic or polycyclic graphs, and structures containing heteroatoms and thus can be used as a Molecular IDentification number (MID) for chemical documentation. Some published MIDs derived from an all-paths method and their structural selectivity for alkane trees are also reviewed.

Calculation of Blocking Probabilities in Multistage Interconnection Networks with Redundant Paths

The blocking probability of a network is a common measure of its performance. There exist means of quickly calculating the blocking probabilities of Banyan networks; however, because Banyan networks have no redundant paths, they are not inherently fault-tolerant, and so their use in large-scale multiprocessors is problematic. Unfortunately, the addition of multiple paths between message sources and sinks in a network complicates the calculation of blocking probabilities. A methodology for exact calculation of blocking probabilities for small networks with redundant paths is presented here, with some discussion of its potential use in approximating blocking probabilities for large networks with redundant paths.

Methods for Parallelizing Search Paths in Phrasing

Many search problems are commonly solved with combinatoric algorithms that unnecessarily duplicate and serialize work at considerable computational expense. There are techniques available that can eliminate redundant computations and perform remaining operations concurrently, effectively reducing the branching factors of these algorithms. This thesis applies these techniques to the problem of parsing natural language. The result is an efficient programming language that can reduce some of the expense associated with principle-based parsing and other search problems. The language is used to implement various natural language parsers, and the improvements are compared to those that result from implementing more deterministic theories of language processing.