Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

Development of a quantitative FI-MS technique for the characterization of high- and nonboiling saturated hydrocarbon mixtures

Summary Using a saturated non-boiling hydrocarbon mixture, the influence of two parameters on the results of field ionization mass spectrometry (FI-MS) measurements was studied: (a) the potential difference between the FI emitter and the counterelectrode; (b) the emitter temperature.Variation of the potential difference had only a minor effect on the average molecular mass measured and had no evident effect on the relative ring number distribution in the sample. In contrast, when the emitter temperature was increased, higher average molecular masses were recorded. Moreover, the average molecular masses shifted to higher ring numbers. In order to control the relationship between the described influences during mixture analysis, measuring instructions have been developed that enable the quantitative analysis of unknown saturated samples. However, average molecular mass of the mixture must be known.

---

Entwicklung einer quantitativen FI-MS-Methode zur Charakterisierung von gesättigten hoch- und nichtsiedenden Kohlenwasserstoffgemischen

     

Inverse Problem for a Mathematical Model of Adsorption Dynamics

A mixed problem is considered for a system of partial differential equations modeling the process of adsorption dynamics. An existence and uniqueness theorem is proved for this problem, and the solution properties are investigated. The inverse problem is posed, involving the determination of the system coefficient given additional information about the solution. A uniqueness theorem is proved for the solution of the inverse problem.__________Translated from Prikladnaya Matematika i Informatika, No. 16, pp. 5 – 14, 2004.     

Vascular morphology by three-dimensional magnetic resonance imaging

A three-dimensional examination of blood vessels is provided using MR data from seven cases. The vascular surfaces are constructed with an algorithm that automatically follows the selected artery or vein and generates a projected three-dimensional gradient shaded image. Fast 3DFT pulse sequences were optimized to enhance the time-of-flight contrast of the intravascular region. By increasing the surface threshold value in a three-dimensional head study, the flesh of a patient's face was peeled away to demonstrate the superfacial temporal artery. Gated cardiac images show the great vessels and cardiac chambers. A three-dimensional view of the aorta shows an irregular surface in the vicinity of an adrenal tumor. 3D MR exams provide a non-invasive technique for assessing vascular morphology in a clinical setting.     

Patterns—a fundamental idea of mathematical thinking and learning

Taking advantage of patterns is typical of our everyday experience as well as our mathematical thinking and learning. For example a working day or a morning at school displays a certain structure, which can be described in terms of patterns. On the one hand regular structures give us the feeling of permanence and enable us to make predictions. On the other hand they also provide a chance to be creative and to vary common procedures. School students usually encounter patterns in math classes either as number patterns or geometric patterns. There are also patterns that teachers can find in analyzing the errors students make during their calculations (error patterns) as well as patterns that are inherent to mathematical problems. One could even go so far as to say that identifying and describing patterns is elementary for mathematics (cf. Devlin 2003). Practising good interacting with patterns supports not only the active learning of mathematics but also a deeper understanding of the world in general. Patterns can be explored, identified, extended, reproduced, compared, varied, represented, described and created. This paper provides some examples of pattern utilization and detailed analyses thereof. These ideas serve as “hooks” to encourage the good use of patterns to facilitate active learning processes in mathematics.     

Convex Hamiltonian energy surfaces and their periodic trajectories

In this paper we introduce symplectic invariants for convex Hamiltonian energy surfaces and their periodic trajectories and show that these quentities satisfy several nontrivial relations. In particular we show that they can be used to prove multiplicity results for the number of periodic trajectories.This paper represents results obtained while holding a visiting position at the Courant Institute for Mathematical Sciences, New YorkResearch partially supported by NSF Grant No. DMS-8603149 and a Rutgers University Research Council Grant     

Untersuchungen zur Wechselwirkung von gasf?rmigem molekularem Iod mit Silberoberfl?chen mittels XPS und AES

Summary The adsorption of gaseous molecular iodine on clean silver surfaces proceeds in the first stage by dissociative chemisorption. After the formation of half a monolayer of chemisorbed iodine atoms the formation of silver iodide begins, which forms a very regular overlayer on top of the substrate. Both iodine species can be distinguished due to a difference in chemical shift of the M₄N₄, ₅N₄, ₅-Auger transitions. After completion of this overlayer further iodine uptake is slowed down significantly. Above an overlayer thickness of about 10 nm a further progress of the reaction cannot be followed anymore due to the limited information depth of XPS.     

Construction algorithms for polynomial lattice rules for multivariate integration

We introduce a new construction algorithm for digital nets for integration in certain weighted tensor product Hilbert spaces. The first weighted Hilbert space we consider is based on Walsh functions. Dick and Pillichshammer calculated the worst-case error for integration using digital nets for this space. Here we extend this result to a special construction method for digital nets based on polynomials over finite fields. This result allows us to find polynomials which yield a small worst-case error by computer search. We prove an upper bound on the worst-case error for digital nets obtained by such a search algorithm which shows that the convergence rate is best possible and that strong tractability holds under some condition on the weights.

We extend the results for the weighted Hilbert space based on Walsh functions to weighted Sobolev spaces. In this case we use randomly digitally shifted digital nets. The construction principle is the same as before, only the worst-case error is slightly different. Again digital nets obtained from our search algorithm yield a worst-case error achieving the optimal rate of convergence and as before strong tractability holds under some condition on the weights. These results show that such a construction of digital nets yields the until now best known results of this kind and that our construction methods are comparable to the construction methods known for lattice rules.

We conclude the article with numerical results comparing the expected worst-case error for randomly digitally shifted digital nets with those for randomly shifted lattice rules.