Raman and FTIR spectra of [Cu(H2O)6](BrO3)2 and [Al(H2O)6](BrO3)3 · 3H2O

Raman and FTIR spectra of [Cu(H2O)6](BrO3)2 and [Al(H2O)6](BrO3)3 · 3H2O are recorded and analyzed. The observed bands are assigned on the basis of BrO3 − and H2O vibrations. Additional bands obtained in the region of 3 and 1 modes in [Cu(H2O)6](BrO3)2 are due to the lifting of degeneracy of 3 modes, since the BrO3 − ion occupies a site of lower symmetry. The appearance 1 mode of BrO3 − anion at a lower wavenumber (771 cm−1) is attributed to the attachment of hydrogen to the BrO3 − anion. The presence of three inequivalent bromate groups in the [Al(H2O)6](BrO3)3 · 3H2O structure is confirmed. The lifting of degeneracy of 4 mode indicates that the symmetry of BrO3 − anion is lowered in the above crystal from C3v to C1. The appearance of additional bands in the stretching and bonding mode regions of water indicates the presence of hydrogen bonds of different strengths in both the crystals. Temperature dependent Raman spectra of single crystal [Cu(H2O)6](BrO3)2 are recorded in the range 77–523 K for various temperatures. A small structural rearrangement takes place in BrO3 − ion in the crystal at 391 K. Hydrogen bounds in the crystal are rearranging themselves leading to the loss of one water molecule at 485 K. This is preceded by the reorientation of BrO3 − ions causing a phase transition at 447 K. Changes in intensities and wavenumbers of the bands and the narrowing down of the bands at 77 K are attributed to the settling down of protons into ordered positions in the crystal

Restarting automata with restricted utilization of auxiliary symbols

The restarting automaton is a restricted model of computation that was introduced by Jancar et al. to model the so-called analysis by reduction, which is a technique used in linguistics to analyze sentences of natural languages. The most general models of restarting automata make use of auxiliary symbols in their rewrite operations, although this ability does not directly correspond to any aspect of the analysis by reduction. Here we put restrictions on the way in which restarting automata use auxiliary symbols, and we investigate the influence of these restrictions on their expressive power. In fact, we consider two types of restrictions. First, we consider the number of auxiliary symbols in the tape alphabet of a restarting automaton as a measure of its descriptional complexity. Secondly, we consider the number of occurrences of auxiliary symbols on the tape as a dynamic complexity measure. We establish some lower and upper bounds with respect to these complexity measures concerning the ability of restarting automata to recognize the (deterministic) context-free languages and some of their subclasses.

Asymptotics of number fields and the Cohen-Lenstra heuristics

We study the asymptotics conjecture of Malle for dihedral groups Dl of order 2l, where l is an odd prime. We prove the expected lower bound for those groups. For the upper bounds we show that there is a connection to class groups of quadratic number fields. The asymptotic behavior of those class groups is predicted by the Cohen-Lenstra heuristics. Under the assumption of this heuristic we are able to prove the expected upper bounds.

Root parametrized differential equations

The present thesis is about the inverse problem in differential Galois Theory. Given a differential field, the inverse  problem asks which linear algebraic groups can be realized as differential Galois groups of Picard-Vessiot extensions of this field.   In this thesis we will concentrate on the realization of the classical groups as differential Galois groups. We introduce a method for a very general realization of these groups. This means that we present for the classical groups of Lie rank $l$ explicit linear differential equations where the coefficients are differential polynomials in $l$ differential indeterminates over an algebraically closed field of constants $C$, i.e. our differential ground field is purely differential transcendental over the constants.   For the groups of type $A_l$, $B_l$, $C_l$, $D_l$ and $G_2$ we managed to do these realizations at the same time in terms of Abhyankar's program 'Nice Equations for Nice Groups'. Here the choice of the defining matrix is important. We found out that an educated choice of $l$ negative roots for the parametrization together with the positive simple roots leads to a nice differential equation and at the same time defines a sufficiently general element of the Lie algebra. Unfortunately for the groups of type $F_4$ and $E_6$ the linear differential equations for such elements are of enormous length. Therefore we keep in the case of $F_4$ and $E_6$ the defining matrix differential equation which has also an easy and nice shape.   The basic idea for the realization is the application of an upper and lower bound criterion for the differential Galois group to our parameter equations and to show that both bounds coincide. An upper and lower bound criterion can be found in literature. Here we will only use the upper bound, since for the application of the lower bound criterion an important condition has to be satisfied. If the differential ground field is $C_1$, e.g., $C(z)$ with standard derivation, this condition is automatically satisfied. Since our differential ground field is purely differential transcendental over $C$, we have no information whether this condition holds or not.   The main part of this thesis is the development of an alternative lower bound criterion and its application. We introduce the specialization bound. It states that the differential Galois group of a specialization of the parameter equation is contained in the differential Galois group of the parameter equation. Thus for its application we need a differential equation over $C(z)$ with given differential Galois group. A modification of a result from Mitschi and Singer yields such an equation over $C(z)$ up to differential conjugation, i.e. up to transformation to the required shape. The transformation of their equation to a specialization of our parameter equation is done for each of the above groups in the respective transformation lemma.

Die aeroelastische Stabilitätsanalyse – ein praxisnaher Ansatz zur intervalltheoretischen Betrachtung von Modellierungsunsicherheiten am Flugzeug

Die Untersuchung des dynamischen aeroelastischen Stabilitätsverhaltens von Flugzeugen erfordert sehr komplexe Rechenmodelle, welche die wesentlichen elastomechanischen und instationären aerodynamischen Eigenschaften der Konstruktion wiedergeben sollen. Bei der Modellbildung müssen einerseits Vereinfachungen und Idealisierungen im Rahmen der Anwendung der Finite Elemente Methode und der aerodynamischen Theorie vorgenommen werden, deren Auswirkungen auf das Simulationsergebnis zu bewerten sind. Andererseits können die strukturdynamischen Kenngrößen durch den Standschwingungsversuch identifiziert werden, wobei die Ergebnisse Messungenauigkeiten enthalten. Für eine robuste Flatteruntersuchung müssen die identifizierten Unwägbarkeiten in allen Prozessschritten über die Festlegung von unteren und oberen Schranken konservativ ermittelt werden, um für alle Flugzustände eine ausreichende Flatterstabilität sicherzustellen. Zu diesem Zweck wird in der vorliegenden Arbeit ein Rechenverfahren entwickelt, welches die klassische Flatteranalyse mit den Methoden der Fuzzy- und Intervallarithmetik verbindet. Dabei werden die Flatterbewegungsgleichungen als parameterabhängiges nichtlineares Eigenwertproblem formuliert. Die Änderung der komplexen Eigenlösung infolge eines veränderlichen Einflussparameters wird mit der Methode der numerischen Fortsetzung ausgehend von der nominalen Startlösung verfolgt. Ein modifizierter Newton-Iterations-Algorithmus kommt zur Anwendung. Als Ergebnis liegen die berechneten aeroelastischen Dämpfungs- und Frequenzverläufe in Abhängigkeit von der Fluggeschwindigkeit mit Unschärfebändern vor.

Risk Bounds for Mixture Density Estimation

In this paper we focus on the problem of estimating a bounded density using a finite combination of densities from a given class. We consider the Maximum Likelihood Procedure (MLE) and the greedy procedure described by Li and Barron. Approximation and estimation bounds are given for the above methods. We extend and improve upon the estimation results of Li and Barron, and in particular prove an $O(\\frac{1}{\\sqrt{n}})$ bound on the estimation error which does not depend on the number of densities in the estimated combination.

Understanding mathematics for young children : a guide for Foundation Stage and Lower Primary Teachers.

Guía para tener una comprensión más clara de las matemáticas y de los materiales que se utilizan en el aula con niños de tres a ocho años. Muestra cómo ayudarlos en el desarrollo y la comprensión de las matemáticas por sí mismos, en lugar de aprender recetas y rutinas. Al final de cada capítulo se incluyen algunos ejemplos de actividades que pueden ser utilizadas en las distintas edades. Contiene estrategias para el cálculo mental.

Error and complexity of random walk Monte Carlo radiosity

The author studies the error and complexity of the discrete random walk Monte Carlo technique for radiosity, using both the shooting and gathering methods. The author shows that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an O(n log n) complexity. The author gives and compares three unbiased estimators for each method, and obtains closed forms and bounds for their variances. The author also bounds the expected value of the mean square error (MSE). Some of the results obtained are also shown

The Influence of Body Condition on the Stopover Ecology of Least Sandpipers in the Lower Mississippi Alluvial Valley during Fall Migration

Many shorebirds are long-distance migrants and depend on the energy gained at stopover sites to complete migration. Competing hypotheses have described strategies used by migrating birds; the energy-selection hypothesis predicts that shorebirds attempt to maximize energy gained at stopover sites, whereas the time-selection hypothesis predicts that shorebirds attempt to minimize time spent at stopover sites. The energy- and time-selection hypotheses both predict that birds in better condition will depart sites sooner. However, numerous studies of stopover duration have found little support for this prediction, leading to the suggestion that migrating birds operate under energy and time constraints for only a small portion of the migratory season. During fall migration 2002, we tested the prediction that birds in better condition depart stopover sites sooner by examining the relationship between stopover duration and body condition for migrating Least Sandpipers (Calidris minutilla) at three stopover sites in the Lower Mississippi Alluvial Valley. We also tested the assumption made by the Lower Mississippi Alluvial Valley Migratory Bird Science Team that shorebirds stay in the Mississippi Valley for 10 d. The assumption of 10 d was used to estimate the amount of habitat required by shorebirds in the Mississippi Valley during fall migration; a period longer than 10 d would increase the estimate of the amount habitat required. We used multiple-day constancy models of apparent survival and program MARK to estimate stopover duration for 293 individually color-marked and resighted Least Sandpipers. We found that a four-day constancy interval and a site x quadratic time trend interaction term best modeled apparent survival. We found only weak support for body condition as a factor explaining length of stopover duration, which is consistent with findings from similar work. Stopover duration estimates were 4.1 d (95% CI = 2.8–6.1) for adult Least Sandpipers at Bald Knob National Wildlife Refuge, Arkansas, 6.5 d (95% CI = 4.9–8.7) for adult and 6.1 d (95% CI =4.2–9.1) for juvenile Least Sandpipers at Yazoo National Wildlife Refuge, Mississippi, and 6.9 d (95% CI = 5.5–8.7) for juvenile Least Sandpipers at Morgan Brake National Wildlife Refuge, Mississippi. Based on our estimates of stopover duration and the assumption made by the Lower Mississippi Alluvial Valley Migratory Bird Science Team, there is sufficient habitat in the lower Mississippi Valley to support shorebirds during fall migration.