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.