Studien über Kernalkylierung

Ohne Zusammenfassung     

Perspectives on Advanced Mathematical Thinking

This article sets the stage for the following 3 articles. It opens with a brief history of attempts to characterize advanced mathematical thinking, beginning with the deliberations of the Advanced Mathematical Thinking Working Group of the International Group for the Psychology of Mathematics Education. It then locates the articles within 4 recurring themes: (a) the distinction between identifying kinds of thinking that might be regarded as advanced at any grade level, and taking as advanced any thinking about mathematical topics considered advanced; (b) the utility of characterizing such thinking for integrating the entire curriculum; (c) general tests, or criteria, for identifying advanced mathematical thinking; and (d) an emphasis on advancing mathematical practices. Finally, it points out some commonalities and differences among the 3 following articles.     

Spray thermometry using thermographic phosphors

In this study a novel technique for 2D spray temperature measurement is presented. For this purpose the thermographic phosphor (TP) Mg₄GeO_5.5F:Mn was dispersed in n-dodecane and atomised using a conventional semi solid-cone nozzle. The thermographic phosphor was excited electronically by a frequency tripled Nd:YAG laser (355 nm). An ICCD-camera in combination with an image doubler detected the subsequently emitted phosphorescence at both peak emission wavelengths located at 633 nm and 659 nm, respectively. Utilising suitable calibration measurements, the local spray temperature was determined by evaluating the intensity ratio of both emission wavelengths. To the knowledge of the authors this is the first approach of spray temperature measurement exploiting the temperature dependent intensity ratio of thermographic phosphors. PACS 07.20.Dt; 32.50.+d     

Large Scale Linear Programs and Heuristics for the Design of Survivable Telecommunication Networks

We consider the problem of providing a minimum cost multi-service network subject to one link failure scenarios. We assume our network is fully meshed and demand is satisfied by using direct or two hop-paths. We provide a large scale linear programming formulation and propose and test two effective heuristics.     

Problems, Models and Complexity. Part II: Application to the DLSP

In Part I of this study, we suggest to identify an operations research (OR) problem with the equivalence class of models describing the problem and enhance the standard computer-science theory of computational complexity to be applicable to this situation of an often model-based OR context. The Discrete Lot-sizing and Scheduling Problem (DLSP) is analysed here in detail to demonstrate the difficulties which can arise if these aspects are neglected and to illustrate the new theoretical concept. In addition, a new minimal model is introduced for the DLSP which makes this problem eventually amenable to a rigorous analysis of its computational complexity.     

Rational approximation of vertical segments

In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.     

Idempotency of Extensions via the Bicompletion

Let Top ₀ be the category of topological T ₀-spaces, QU ₀ the category of quasi-uniform T ₀-spaces, T : QU ₀ → Top ₀ the usual forgetful functor and K : QU ₀ → QU ₀ the bicompletion reflector with unit k : 1 → K. Any T-section F : Top ₀ → QU ₀ is called K-true if KF = FTKF, and upper (lower) K-true if KF is finer (coarser) than FTKF. The literature considers important T-sections F that enjoy all three, or just one, or none of these properties. It is known that T(K,k)F is well-pointed if and only if F is upper K-true. We prove the surprising fact that T(K,k)F is the reflection to Fix(TkF) whenever it is idempotent. We also prove a new characterization of upper K-trueness. We construct examples to set apart some natural cases. In particular we present an upper K-true F for which T(K,k)F is not idempotent, and a K-true F for which the coarsest associated T-preserving coreflector in QU ₀ is not stable under K. We dedicate this paper to the memory of Sérgio de Ornelas Salbany (1941–2005).