对比式离心现象实验装置

为了弥补现行教科书中,离心运动的演示实验装置及离心现象产生实质的知识呈现不足,设计了符合学生认知规律的离心实验装置.该装置通过对比2个物体在相同的角速度下产生相反的运动状态,说明物体做离心运动,不是由角速度产生,而是只有合外为突然消失或是合外力不足以提供向心力时,才能产生离心运动.     

Asymptotics in the Baum—Katz formula for random fields

In 1996, D. Deng established an analog of the Baum—Katz theorem on the convergence rate in the law of large numbers for multi-indexed random variables. The series describing the convergence rate depends, in a natural way, on the parameter characterizing the excess of the normalized sums over some level. In this paper, we find the precise asymptotics of the sum of this series with respect to the above-mentioned parameter. Thus, a generalization of a recent result due to A. Gut and A. Spataru is obtained.     

论浮力的计算

通过讨论物体下表面不与液体接触时浮力的计算,总结浮力计算的一般方法.     

A family of skew Hadamard difference sets

In 1933 a family of skew Hadamard difference sets was described by Paley using matrix language and was called the Paley-Hadamard difference sets in the literature. During the last 70 years, no new skew Hadamard difference sets were found. It was conjectured that there are no further examples of skew Hadamard difference sets. This conjecture was proved to be true for the cyclic case in 1954, and further progress in favor of this conjecture was made in the past 50 years. However, the conjecture remains open until today. In this paper, we present a family of new perfect nonlinear (also called planar) functions, and construct a family of skew Hadamard difference sets using these perfect nonlinear functions. We show that some of the skew Hadamard difference sets presented in this paper are inequivalent to the Paley-Hadamard difference sets. These new examples of skew Hadamard difference sets discovered 70 years after the Paley construction disprove the longstanding conjecture on skew Hadamard difference sets. The class of new perfect nonlinear functions has applications in cryptography, coding theory, and combinatorics.     

Colliding stacks: A large deviations analysis

We analyze the performance of a prototypical scheme for shared storage allocation: two initially empty stacks evolving in a contiguous block of memory of size m. We treat the case in which the stacks are more likely to shrink than grow, but with the probabilities of insertion and deletion allowed to depend arbitrarily on stack height as a fraction of m. New results are obtained on the m → ∞ asymptotics of the stack collision time, and of the final stack heights. The results of Wentzell and Freidlin on the large deviations of Markov chains are used, and the relation of their formalism to the Hamiltonian formulation of classical mechanics is emphasized. Certain results on higher-order asymptotics follow from WKB expansions.     

二阶半线性中立型差分方程的振动性准则

考虑二阶半线性中立型差分方程给出了方程(1)的解的振动性的充分条件．所有结果推广和改进了关于中立和时滞差分方程已有结果．     

对G.Ladas的一个开问题的解答

本文获得了一个高阶非线性差分方程具有无界正解的充分条件，所得结果解决了G.Ladas提出的一个开问题。     

Computing Aviation Sparing Policies: Solving a Large Nonlinear Integer Program

Deployed US Navy aircraft carriers must stock a large number of spare parts to support the various types of aircraft embarked on the ship. The sparing policy determines the spares that will be stocked on the ship to keep the embarked aircraft ready to fly. Given a fleet of ten or more aircraft carriers and a cost of approximately 50 million dollars per carrier plus the cost of spares maintained in warehouses in the United States, the sparing problem constitutes a significant portion of the Navy’s resources. The objective of this work is to find a minimum-cost sparing policy that meets the readiness requirements of the embarked aircraft. This is a very large, nonlinear, integer optimization problem. The cost function is piecewise linear and convex while the constraint mapping is highly nonlinear. The distinguishing characteristics of this problem from an optimization viewpoint are that a large number of decision variables are required to be integer and that the nonlinear constraint functions are essentially “black box” functions; that is, they are very difficult (and expensive) to evaluate and their derivatives are not available. Moreover, they are not convex. Integer programming problems with a large number of variables are difficult to solve in general and most successful approaches to solving nonlinear integer problems have involved linear approximation and relaxation techniques that, because of the complexity of the constraint functions, are inappropriate for attacking this problem. We instead employ a pattern search method to each iteration of an interior point-type algorithm to solve the relaxed version of the problem. From the solution found by the pattern search on each interior point iteration, we begin another pattern search on the integer lattice to find a good integer solution. The best integer solution found across all interations is returned as the optimal solution. The pattern searches are distributed across a local area network of non-dedicated, heterogeneous computers in an office environment, thus, drastically reducing the time required to find the solution.     

Successive column correction algorithms for solving sparse nonlinear systems of equations

This paper presents two algorithms for solving sparse nonlinear systems of equations: the CM-successive column correction algorithm and a modified CM-successive column correction algorithm. Aq-superlinear convergence theorem and anr-convergence order estimate are given for both algorithms. Some numerical results and the detailed comparisons with some previously established algorithms show that the new algorithms have some promise of being very effective in practice.This research was partially supported by contracts and grants: DOE DE-AS05-82ER1-13016, AFOSR 85-0243 at Rice University, Houston, U.S.A. and Natural Sciences and Engineering Research Council of Canada grant A-8639.     

椭圆型问题一类广义差分法的L~2模误差估计

1.引 言 广义差分法作为处理偏微分方程的离散技术,能够保持质量,动量,能量等物理量的守恒.广义差分法（有些文献称为box method[3];finite volume element method[4],[5],[6]）利用在对偶剖分体积单元积分原始方程,并将近似解限制于某一有限元空间而得到离散方程.因此,它在局部区域保持了原始方程的物理守恒性和其他重要特性.从而被广泛地应用于数值求解数学物理方程,特别是计算流体力学和热传导问题[11]. 对广义差分法的研究已有许多文献,专著[10]有详细的介绍.早期的工作主要考虑标准的重心对偶剖分.近年来Cai et,al[4],[5],[6],在某些假定下对较一般的对偶剖分给出了能量模误差估计,Huang and Xi[9]去掉了文献[6]中的这些限制.Chou,Li[8]和Li,