无线局域网安全问题研究

为了提供相当于有线局域网的数据安全,IEEE802.11定义了有线等价保密(WEP)协议。然而,最近的研究发现WEP存在严重的缺陷。介绍了无线局域网存在的安全隐患,分析了WEP的结构以及WEP协议的缺陷以及可能遭受的攻击,并探讨了改进方案。     

基于数字机顶盒的电子选单的设计和实现

基于CATV和PSTN的VOD多媒体数字机顶盒，提出了几种实现双向通信以完成电子节目指南的设计方案，对各种方案的优缺点进行了详细的讨论，并介绍了所采用方案的实现方法。     

Optimality of the double exponential formula – functional analysis approach –

Summary. In the light of the functional analysis theory we establish the optimality of the double exponential formula. The argument consists of the following three ingredients: (1) introduction of a number of spaces of functions analytic in a strip region about the real axis, each space being characterized by the decay rate of their elements (functions) in the neighborhood of the infinity; (2) proof of the (near-) optimality of the trapezoidal formula in each space introduced in (1) by showing the (near-) equality between an upper estimate for the error norm of the trapezoidal formula and a lower estimate for the minimum error norm of quadratures; (3) nonexistence theorem for the spaces, the characterizing decay rate of which is more rapid than the double exponential. Received September 15, 1995 / Accepted December 14, 1995     

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     

HIRFL–CSR加速器中束流与真空中剩余气体的碰撞损失

研究了重离子加速器中束流与真空中剩余气体的碰撞损失过程和碰撞截面,在依据大量实验数据的基础上,提出了一组计算离子一原子的电荷交换截面的经验公式.以兰州重离子加速器HDRFL及冷却储存环CSR为例,给出了依据碰撞截面的公式计算束流在加速器真空中的传输效率的方法,并计算了在不同真空度下HIRFL的ECR源轴向注入束运线、注入器SFC、前束运线、主加速器SSC和后束运线等不同加速阶段及CSR的传输效率,并提出合理的真空度要求.HIRFL的真空分布测量和束流的损失测量证明了该计算方法的可靠性.     

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     

Numerical methods for finding multiple eigenvalues of matrices depending on parameters

Summary. Let be a square matrix dependent on parameters and , of which we choose as the eigenvalue parameter. Many computational problems are equivalent to finding a point such that has a multiple eigenvalue at . An incomplete decomposition of a matrix dependent on several parameters is proposed. Based on the developed theory two new algorithms are presented for computing multiple eigenvalues of with geometric multiplicity . A third algorithm is designed for the computation of multiple eigenvalues with geometric multiplicity but which also appears to have local quadratic convergence to semi-simple eigenvalues. Convergence analyses of these methods are given. Several numerical examples are presented which illustrate the behaviour and applications of our methods. Received December 19, 1994 / Revised version received January 18, 1996