Approximation der optimalen Vorhersage der Ausgabe stochastischer Quellen

This paper discusses the prediction of the output of a stochastic sourceQ having positive transition function. If the sourceQ has two output alphabets,X andY, then there exists such a stochastic automaton \(\mathfrak{A}(V_{opt} )\) with input alphabetX, output alphabetY, and a countable set of states, that realizes the optimal predictionV _opt fromX toY. Here it will be shown thatV _opt can be approximated with any precision by a predictionV which is realized by a stochastic automaton with finite set of states.     

Experimente zum Strömungswiderstand in gekrümmten,rotierenden Kanälen mit quadratischem Querschnitt

Zusammenfassung Bei ausgebildeter Strömung wurde der Druckverlust in rotierenden, gekrümmten Kanalstrecken experimentell ermittelt. Speziell interssierte der Einfluß der Krümmung auf den Reibungswiderstand und im besonderen der der Rotation, die sowohl in Richtung der Durchflußgeschwindigkeit als auch entgegengesetzt dazu erfolgte. Die strömungsspezifischen Parameter wie Reynolds-und Taylor-Zahl erfuhren eine Änderung im Bereich 3·10²<Re<2·10⁵ und 0Ta<10⁵. Das Krümmungsverhältnis variierte zwischen 0,0496a/r _m 0,337. Aufgezeigt wird die Möglichkeit einer universellen Darstellung des Widerstandsbeiwertes für den nicht rotierenden Kanal bei einerseits laminarer und anderseits bei turbulenter Bewegung. Im rotierenden Kanal beobachtet man beträchtliche Druckverlusterhöhungen, deren Größe von der Rotationsrichtung abhängt. Bei großen Taylor-Zahlen wurde eine Unabhängigkeit des Strömungswiderstandes vom Krümmungsverhältnis festgestellt.

---

Experimental investigations on the friction resistance in rotating curved channels with square cross-section

Summary For fully developed flow the pressure loss in rotating curved channels was investigated experimentally. The influence of the curvature on the friction coefficient and particularly on the rotation, which was realized in the direction of the through flow as well as in the opposite direction was of special interest. The specific parameters of the flow field, like the Reynolds-number and the Taylor-number were varied within the range of 3·10²<Re<2·10⁵ and 0Ta<10⁵. The curvature ratio were varied within 0,0496a/r _m 0,337. The possibility of an universal presentation of the friction coefficient for the nonrotating channel is shown for laminar and turbulent through flow. In the rotating channel a considerable pressure loss increase can be observed. The magnitude depends on the direction of rotation. In case of great Taylor-numbers the curvature ratio was found to be independent of the friction resistance.

---

Bezeichnungen a Kantenlänge - mittlere Geschwindigkeit - l Kanallänge - r _m Krümmungsradius - Volumenstrom - _p Druckdifferenz - Widerstandsbeiwert - =57/Re Widerstandsbeiwert des geraden Kanals - dynamische Viskosität - Dichte - Winkelgeschwindigkeit - Dean-Zahl - Reynolds-Zahl - Taylor-Zahl Mit 6 Abbildungen     

On grammar forms with terminal context

Summary A context-free grammar form G defines a family of context-free grammars {ie397-01}(G). In this paper {ie397-02}(G) is extended to give the family of terminal context grammars {ie397-03}(G), which were introduced by Book [4]. It is shown that the families of languages defined by {ie397-04}(G) and {ie397-05}(G) are equal when G is an -free context-free grammar form. This generalizes the result of Book [4] for context-free grammars and underlines the usefulness of the notion of grammar forms in formal language theory.The work of the second author was carried out partially under a National Research Council of Canada Grant. No. A-7700 and partially under the auspices of the University of Karlsruhe     

On a direct algorithm for the generation of log-normal pseudo-random numbers

The random variable \(\left( {\prod {_{i = 1}^n {{X_i } \mathord{\left/ {\vphantom {{X_i } {X_{i + n} }}} \right. \kern-0em} {X_{i + n} }}} } \right)^{{1 \mathord{\left/ {\vphantom {1 {\sqrt {2n} }}} \right. \kern-0em} {\sqrt {2n} }}}\) is used to generate standard log-normal variables Λ(0, 1), where theX _i are independent uniform variables on [0, 1].     

Polynomoperatoren in C k [a,b]

Some estimations for the relative projection constantP(∏ _n+k ^k ,Csik[a,b]) are given. By constructing an associated polynomial operatorL _n :C ⁰[a,b]→∏ _n ⁰ to a given polynomial operatorH _n+k :C ^k [a,b]→∏ _n+k ^k we get a lower bound for the projection constant. An upper bound forP(∏ _n+k ^k ,C ^k [a,b]) is obtained by the determination of the norms of appropriate polynomial operatorsP _n+k :C ^k [a,b]→∏ _n+k ^k . Further we give a convergence property for the sequence (P _n+k ) _n∈?.     

Einleitung und Abbruch der künstlichen Ernährung beim einwilligungsunfähigen Patienten

Definition of the problem: In Austria the legal discussion on initiating and withdrawing artificial nutrition in incompetent patients has just begun. Arguments and conclusion: Legal regulations are lacking, but there appears to be agreement on accepting advance directives under specific criteria. This would mean that a presumed will and documented refusal of treatment and nutrition has to be respected by physicians. However, there is no consensus with regard to the “supposed will” of an incompetent patient to refuse treatment and nutrition. At present, surrogate decision making with regard to refusing life-sustaining treatment or nutrition is only accepted according to a declared and documented directive of the patient himself. When the patient’s will has to be “surmised” the protection of life has priority. In Austria this concept is based on the national constitution and its duty to protect life.     

Software specification using graph grammars

The following paper demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify the changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to “specification engineering” using graph grammars. This approach is influenced by the syntactical definition of the underlying language for Programming in the Small, the module concept etc. to be supported on one side but also by the idea of the user interface.