Congruence criteria for finite subsets of complex projective and complex hyperbolic spaces

We investigate congruence classes and direct congruence classes of m-tuples in the complex projective space ℂP ⁿ . For direct congruence one allows only isometries which are induced by linear (instead of semilinear) mappings. We establish a canonical bijection between the set of direct congruence classes of m-tuples of points in ℂP ⁿ and the set of equivalence classes of positive semidefinite Hermitean m×m-matrices of rank at most n+1 with 1's on the diagonal. As a corollary we get that the direct congruence class of an m-tuple is uniquely determined by the direct congruence classes of all of its triangles, provided that no pair of points of the m-tuple has distance π/2. Examples show that the situation changes drastically if one replaces direct congruence classes by congruence classes or if distances π/2 are allowed. Finally we do the same kind of investigation also for the complex hyperbolic space ℂH ⁿ . Most of the results are completely analogous, however, there are also some interesting differences. Received: 15 January 1996     

A dual graph-norm refinement indicator for finite volume approximations of the Euler equations

Summary. We generalise and apply a refinement indicator of the type originally designed by Mackenzie, Süli and Warnecke in [15] and [16] for linear Friedrichs systems to the Euler equations of inviscid, compressible fluid flow. The Euler equations are symmetrized by means of entropy variables and locally linearized about a constant state to obtain a symmetric hyperbolic system to which an a posteriori error analysis of the type introduced in [15] can be applied. We discuss the details of the implementation of the refinement indicator into the DLR--Code which is based on a finite volume method of box type on an unstructured grid and present numerical results. Received May 15, 1995 / Revised version received April 17, 1996     

岸基光电探测系统

论述两类岸基光电探测系统；岸基光电跟踪仪和岸基红外监视系统。阐述其典型实例、特点及发展方向。     

Comparative studies on the mechanism of uridine phosphorolysis

We have used quantum mechanical method to study the transition states(TSs) of uridine phosphorolysis reaction. Comparing the four different reaction pathways and the five transition states obtained, we conclude that enzymatic uridine phosphorolysis takes place mainly according to acid-catalyzed SN2 mechanism. The proposed reaction pathway is consistent with many experimental results.     

一类非线性抛物型变分不等方程的全局吸引子及弱近似惯性流形

对由一类非线性抛物型变分不等方程所描述的无穷维动力系统，给出了存在全局吸引子及弱近似惯性流形的充分条件．     

关于混合型多项式Hammerstein积分方程正解迭代求法

本文给出了混合型多项式Ｈａｍｍｅｒｓｔｅｉｎ积分方程正解的迭代求法，并将所得结果应用到二阶非线性常微分方程的边值问题     

Phasenbeziehungen und Natriumionenleitung im quasi-binären System Na2SiF6/Na3AlF6

Phase Relations and Sodium Ion Conductivity within the Quasi-binary System Na₂SiF₆/Na₂AIF₆ . The phase diagram of the Na₂SiF₆/Na₃AlF₆ system has been determined by means of x-ray powder diffraction, thermal analysis and conductivity measurements in the sub-solidus region. Na₃AlF₆ accomodates up to 73 mol.-% Na₂SiF₆ maintaining the crystal structure type. The sodium ion conductivity increases by about five orders of magnitude upon doping Na₃AlF₆ with Na₂SiF₆.     

A semi-analytical numerical method for time-dependent radiative transfer problems in slab geometry with coherent isotropic scattering

We describe a semi-analytical numerical method for coherent isotropic scattering time-dependent radiative transfer problems in slab geometry. This numerical method is based on a combination of two classes of numerical methods: the spectral methods and the Laplace transform (LTS_N) methods applied to the radiative transfer equation in the discrete ordinates (S_N) formulation. The basic idea is to use the essence of the spectral methods and expand the intensity of radiation in a truncated series of Laguerre polynomials in the time variable and then solve recursively the resulting set of “time-independent” S_N problems by using the LTS_N method. We show some numerical experiments for a typical model problem.     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.     

Exploiting the diversity of time scales in the immune system: A B-cell antibody model

Using the continuous shape space formalism, we develop an immune system model involving both B lymphocytes and antibody molecules. The binding and cross-linking of receptors on B cells stimulates the cells to divide and, with a lag, to secrete antibody. Using the method of multiple scales, we show how to correctly formulate long-time-scale equations for the population dynamics of B cells, the total antibody concentration, and rate of antibody secretion. We compare our model with previous phenomenological formulations.