Das erste Hexaoxoselenat (VI) – Synthese und Charakterisierung von Na12(SeO6)(SeO4)3

The First Hexaoxoselenate(VI) – Synthesis and Characterization of Na₁₂(SeO₆)(SeO₄)₃ Pure Na₁₂(SeO₆)(SeO₄)₃ has been prepared by solid state reaction at 500 °C from a mixture of Na₂O and Na₂SeO₄ in silver crucibles. The crystal structure has been determined from single crystal data (Pnma, a = 1577.2(7), b = 781.7(3), c = 1475.5(7) pm, Z = 4, R1 = 0.030, wR2 = 0.058, 2480 observed reflections [I_o ≥ 2σ(I_o)]). Na₁₂(SeO₆)(SeO₄)₃ contains novel SeO₆^6– anions. There exists an unexpected topological relationship between the SeO₆Naⁱ₈Na^a₂Na^a_4/2 part of the structure and the MoCl₂ structure type (Mo₆Clⁱ₈Cl^a₂Cl^a_4/2). The crystal structure as determined is consistent with spectroscopic data (IR, Raman, ⁷⁷Se‐MAS‐NMR).     

Liquid chromatographic purification and detection of anabolic compounds.

The role of liquid chromatography within methods of analysis for steroids, related compounds and beta-agonists in biological samples is discussed. Special attention is given to the application of liquid chromatography in sample preparation and extract clean-up. Different forms of liquid chromatography, including immunoaffinity chromatography, are compared and evaluated. Methods for confirmation based on gas chromatography-mass spectrometry and cryotrapping Fourier transform infrared spectrometry are discussed.     

Verfeinerung der Kristallstruktur von K2O2

Refinement of the Crystal Structure of K₂O₂ The crystal structure of K₂O₂ has been refined using 241 diffractometer data (Cmca; a = 6.733(1), b = 6.996(1), c = 6.474(1) Å; Z = 4; R_w = 0.050). The distance O? O (1.541(6) Å) is significantly larger than that one assumed for alkali metal peroxides, so far.     

Characteristics of Second Graders' Mathematical Writing

This study compared the characteristics of second graders' mathematical writing between an intervention and comparison group. Two six‐week Project M2 units were implemented with students in the intervention group. The units position students to communicate in ways similar to mathematicians, including engaging in verbal discourse where they themselves make sense of the mathematics through discussion and debate, writing about their reasoning on an ongoing basis, and utilizing mathematical vocabulary while communicating in any medium. Students in the comparison group learned from the regular school curriculum. Students in both the intervention and comparison groups conveyed high and low levels of content knowledge as indicated in archived data from an open‐response end‐of‐the‐year assessment. A multivariate analysis of variance indicated several differences favoring the intervention group. Both the high‐ and low‐level intervention subgroups outperformed the comparison group in their ability to (a) provide reasoning, (b) attempt to use formal mathematical vocabulary, and (c) correctly use formal mathematical vocabulary in their writing. The low‐level intervention subgroup also outperformed the respective comparison subgroup in their use of (a) complete sentences and (b) linking words. There were no differences between groups in their attempt at writing and attempts at and usage of informal mathematical vocabulary.     

Polynomial time approximation schemes for general multiprocessor job shop scheduling

We study preemptive and non-preemptive versions of the general multiprocessor job shop scheduling problem: Given a set of n tasks each consisting of at most μ ordered operations that can be processed on different (possibly all) subsets of m machines with different processing times, compute a schedule (preemptive or non-preemptive, depending on the model) with minimum makespan where operations belonging to the same task have to be scheduled according to the specified order. We propose algorithms for both preemptive and non-preemptive variants of this problem that compute approximate solutions of any positive ε accuracy and run in O(n) time for any fixed values of m, μ, and ε. These results include (as special cases) many recent developments on polynomial time approximation schemes for scheduling jobs on unrelated machines, multiprocessor tasks, and classical open, flow and job shops.     

Numerically stable,scalable formulas for parallel and online computation of higher-order multivariate central moments with arbitrary weights

Formulas for incremental or parallel computation of second order central moments have long been known, and recent extensions of these formulas to univariate and multivariate moments of arbitrary order have been developed. Such formulas are of key importance in scenarios where incremental results are required and in parallel and distributed systems where communication costs are high. We survey these recent results, and improve them with arbitrary-order, numerically stable one-pass formulas which we further extend with weighted and compound variants. We also develop a generalized correction factor for standard two-pass algorithms that enables the maintenance of accuracy over nearly the full representable range of the input, avoiding the need for extended-precision arithmetic. We then empirically examine algorithm correctness for pairwise update formulas up to order four as well as condition number and relative error bounds for eight different central moment formulas, each up to degree six, to address the trade-offs between numerical accuracy and speed of the various algorithms. Finally, we demonstrate the use of the most elaborate among the above mentioned formulas, with the utilization of the compound moments for a practical large-scale scientific application.     

On the analysis of a dynamic evolutionary algorithm

Evolutionary algorithms are applied as problem-independent optimization algorithms. They are quite efficient in many situations. However, it is difficult to analyze even the behavior of simple variants of evolutionary algorithms like the (1+1) EA on rather simple functions. Nevertheless, only the analysis of the expected run time and the success probability within a given number of steps can guide the choice of the free parameters of the algorithms. Here static (1+1) EAs with a fixed mutation probability are compared with dynamic (1+1) EAs with a simple schedule for the variation of the mutation probability. The dynamic variant is first analyzed for functions typically chosen as example-functions for evolutionary algorithms. Afterwards, it is shown that it can be essential to choose the suitable variant of the (1+1) EA. More precisely, functions are presented where each static (1+1) EA has exponential expected run time while the dynamic variant has polynomial expected run time. For other functions it is shown that the dynamic (1+1) EA has exponential expected run time while a static (1+1) EA with a good choice of the mutation probability has polynomial run time with overwhelming probability.     

Player splitting in extensive form games

By a player splitting we mean a mechanism that distributes the information sets of a player among so-called agents. A player splitting is called independent if each path in the game tree contains at most one agent of every player. Following Mertens (1989), a solution is said to have the player splitting property if, roughly speaking, the solution of an extensive form game does not change by applying independent player splittings. We show that Nash equilibria, perfect equilibria, Kohlberg-Mertens stable sets and Mertens stable sets have the player splitting property. An example is given to show that the proper equilibrium concept does not satisfy the player splitting property. Next, we give a definition of invariance under (general) player splittings which is an extension of the player splitting property to the situation where we also allow for dependent player splittings. We come to the conclusion that, for any given dependent player splitting, each of the above solutions is not invariant under this player splitting. The results are used to give several characterizations of the class of independent player splittings and the class of single appearance structures by means of invariance of solution concepts under player splittings. Received: December 1996/Revised Version: January 2000     

Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems

This paper provides an analysis of the polynomiality of primal-dual interior point algorithms for nonlinear complementarity problems using a wide neighborhood. A condition for the smoothness of the mapping is used, which is related to Zhu’s scaled Lipschitz condition, but is also applicable to mappings that are not monotone. We show that a family of primal-dual affine scaling algorithms generates an approximate solution (given a precision ε) of the nonlinear complementarity problem in a finite number of iterations whose order is a polynomial ofn, ln(1/ε) and a condition number. If the mapping is linear then the results in this paper coincide with the ones in Jansen et al., SIAM Journal on Optimization 7 (1997) 126–140. Research supported in part by Grant-in-Aids for Encouragement of Young Scientists (06750066) from the Ministry of Education, Science and Culture, Japan. Research supported by Dutch Organization for Scientific Research (NWO), grant 611-304-028     

Optimal production in a competitive market under yield uncertainty

Motivated by the U.S. influenza vaccine market, we study the impact of random yield and production capacity on the number of firms, total supply, consumer surplus and social welfare in a market with identical suppliers. We formulate a two-stage game with endogenous entry, where each entering firm aims to maximize its profit under yield uncertainty subject to a production capacity constraint. We show that if firms produce full capacity in the equilibrium, then there are fewer firms in the equilibrium compared to the social optimum even for small levels of yield uncertainty. Furthermore, we prove that if firms do not produce full capacity in the equilibrium, they will not produce full capacity in the social optimum.