数学物理方程中的通解问题

通过例证说明,通解法对于偏微分方程而言,其适用范围要比通常认为的大.并表明,只要适当变通,行波法就可用于有界情况.     

Lie Symmetry and Conserved Quantities for Nonholonomic Vacco Dynamical Systems

In this paper the Lie symmetry and conserved quantities for nonholonomic Vacco dynamical systems are studied. The determining equation of the Lie symmetry for the system is given. The general Hojman conserved quantity and the Lutzky conserved quantity deduced from the symmetry are obtained.     

有Edgeworth展式的分布的随机加权逼近的重对数律

本文研究了未知分布的逼近问题，利用随机加权法，给出了有Edgeworth展式的一类（未知）分布的模拟分布，证明了在一定条件下，模拟分布与未知分布的逼近精度达到O(n^-1√lnlnn），称之为随机加权逼近的重对数律。     

Minimum boundary touching tilings of polyominoes

We study the problem of tiling a polyomino P with as few squares as possible such that every square in the tiling has a non‐empty intersection with the boundary of P . Our main result is an algorithm which given a simply connected polyomino P computes such a tiling of P . We indicate how one can improve the running time of this algorithm for the more restricted row‐column‐convex polyominoes. Finally we show that a related decision problem is in NP for rectangular polyominoes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

几类数列通项的矩阵求法

本利用矩阵给出了几类数列的通项公式的求法，把数列通项公式的求法转化为矩阵幂的计算，思路简单、计算简便，并能判别其敛散性。     

分析非轴对称腔的复光线数值迭代法

将像散光束的复光线表示法用于分析非轴对称腔，并对有复杂像散的折迭腔作了数值迭代计算以说明方法的应用．     

Correlation between gravitational-wave detectors and particle detectors during SN1987A

Summary A review of the correlations between gravitational-wave detectors and particle detectors during SN1987A is given. The correlation between the Maryland and Rome g.w. detectors with the Mont Blanc neutrino detector is illustrated. This correlation extends during a period of one or two hours centred at 2∶45 UT of 23 February 1987, with the ?neutrino? signals delayed by (1.1±0.5) s and with a probability of the order of 10⁻⁵ to be accidental. Using the data obtained with the Kamiokande and IMB detectors, with the same statistical choices and procedures for the data analysis used previously, the above result is confirmed with a probability of the order of 10⁻³ or 10⁻⁴ that the additional correlation be accidental. Paper presented at the V Cosmic Physics National Conference, S. Miniato, November 27–30, 1990.     

An adaptive filter for gravitational-wave antennas

Summary We report on the development of an adaptive optimum filter for processing the data of a resonant bar gravitational-wave detector. This filter, based on the matched-filter theory, is adaptive in the sense that the function it realizes is derived from the actual noise spectrum of the data being analysed (instead from an idealized model of the noise). Its implementation is mostly based on frequency domain techniques. We also report on the application of the new filter to the data of the cryogenic antenna Explorer of the Rome group, with particular reference to the comparison between its performance and that of an otpimum filter with fixed values of the parameters.     

Cyclic networks with general blocking and starvation

We introducegeneral starvation and consider cyclic networks withgeneral blocking and starvation (GBS). The mechanism of general blocking allows the server to process a limited number of jobs when the buffer downstream is full, and that of general starvation allows the server to perform a limited number of services in anticipation of jobs that are yet to arrive. The two main goals of this paper are to investigate how the throughput of cyclic GBS networks is affected by varying (1) the total number of jobsJ, and (2) the buffer allocationk=(k₁..., k_m) subject to a fixed total buffer capacityK=k ₁ +... + k_m. In particular, we obtain sufficient conditions for the throughput to be symmetric inJ and to be maximized whenJ=K/2. We also show that the equal buffer allocation is optimal under the two regimes of light or heavy usage. In order to establish these results, we obtain several intermediate structural properties of the throughput, using duality, reversibility, and concavity, which are of independent interest.Research supported in part by NSF Grant No. ECS-8919818.     

A note on an SOR-like method for augmented systems

Golub et al. (2001, BIT, 41, 71–85) gave a generalizedsuccessive over-relaxation method for the augmented systems.In this paper, the connection between the SOR-like method andthe preconditioned conjugate gradient (PCG) method for the augmentedsystems is investigated. It is shown that the PCG method isat least as accurate (fast) as the SOR-like method. Numericalexamples demonstrate that the PCG method is much faster thanthe SOR-like method.