Numerical study on the internal flow field of a reversible turbine during continuous guide vane closing

The unsteady flow field in a reversible pump-turbine is investigated during the continuous load rejection using a 3D computational fluid dynamic analysis. Numerical calculations are carried out using the detached eddy simulation (DES) turbulence model and a new approach involving automatic mesh motion. In this way, the instability of the flow field is analyzed by continuously changing the guide vane openings from the best efficiency point (BEP). Unsteady flow characteristics are described by post-processing signals for several monitoring points including mass flow, torque, head and pressure in the frequency and time-frequency domains. The formation of vortices of different scales is observed from the origin to further enlargement and stabilization; the effect of the rotating structures on the flow passage is analyzed, and the influence of unsteady flow development on the performance of the turbine is investigated. Finally, the evolution during the period of load rejection is characterized in order to determine the hydrodynamic conditions causing the vibrations in the machine

Inductive Definition and Domain Theoretic Properties of Fully Abstract

A construction of fully abstract typed models for PCF and PCF^+ (i.e., PCF + "parallel conditional function"), respectively, is presented. It is based on general notions of sequential computational strategies and wittingly consistent non-deterministic strategies introduced by the author in the seventies. Although these notions of strategies are old, the definition of the fully abstract models is new, in that it is given level-by-level in the finite type hierarchy. To prove full abstraction and non-dcpo domain theoretic properties of these models, a theory of computational strategies is developed. This is also an alternative and, in a sense, an analogue to the later game strategy semantics approaches of Abramsky, Jagadeesan, and Malacaria; Hyland and Ong; and Nickau. In both cases of PCF and PCF^+ there are definable universal (surjective) functionals from numerical functions to any given type, respectively, which also makes each of these models unique up to isomorphism. Although such models are non-omega-complete and therefore not continuous in the traditional terminology, they are also proved to be sequentially complete (a weakened form of omega-completeness), "naturally" continuous (with respect to existing directed "pointwise", or "natural" lubs) and also "naturally" omega-algebraic and "naturally" bounded complete -- appropriate generalisation of the ordinary notions of domain theory to the case of non-dcpos.Comment: 50 page