工科物理实验课程改革与实践

针对21世纪实验教学的要求,介绍了开展工科物理实验教学体系与教学内容改革的经验。     

用Java实现网上结构图实验仿真

基于线性系统仿真的连接矩阵方法，用Java语言开发面向结构图的实验仿真程序，以Applet小应用程序的形式插入网页中运行，实现了信号与系统网上实验教学中的结构图实验仿真。经试用，程序在浏览器中运行正常，可以完成一般线性系统仿真，与以MATLAB，LABView等程序开发的实验仿真程序相比，该程序运行环境简单，几乎所有常用的Web浏览器都支持Java运行，不需另行安装相应组件。对于线性系统结构图，实现了所见即所得的图形化编程环境，具有较好的人机交互性。     

Dynamic complexities in predator–prey ecosystem models with age-structure for predator

Natural populations, whose generations are non-overlapping, can be modelled by difference equations that describe how the populations evolve in discrete time-steps. In the 1970s ecological research detected chaos and other forms of complex dynamics in simple population dynamics models, initiating a new research tradition in ecology. However, in former studies most of the investigations of complex population dynamics were mainly concentrated on single populations instead of higher dimensional ecological systems. This paper reports a recent study on the complicated dynamics occurring in a class of discrete-time models of predator–prey interaction based on age-structure of predator. The complexities include (a) non-unique dynamics, meaning that several attractors coexist; (b) antimonotonicity; (c) basins of attraction (defined as the set of the initial conditions leading to a certain type of an attractor) with fractal properties, consisting of pattern of self-similarity and fractal basin boundaries; (d) intermittency; (e) supertransients; and (f) chaotic attractors.     

Q过程的不变分布(Ⅱ)

设E为一个可数集,Q=（qi,j;i,j∈E）为E×E上的矩阵,满足m为E上的概率分布满足何时存在Q过程,使得m是它的不变分布? 这个问题由Williams（1979）作为一个开问题提出.文[15]对全稳定情形,解决了这个问题;本文对单瞬时情形,完整地解决了该问题.     

A Language for Teaching Discrete-event Simulation

Courses which teach discrete-event simulation are based on many different simulation languages. The requirements for a language to support teaching simulation are discussed. In particular, it is recommended that such languages separate into distinct modules those aspects of simulation which are taught as separate topics. Implementation of the separation is discussed. The SEESIM language, developed as a teaching aid, is described, and examples of its use are given. Straightforward use of SEESIM can be learned quickly, yet the language provides facilities for a staged introduction to advanced concepts of simulation.     

The operational performance of the Yale ESTU

The ESTU began operation in 1988 and achieved the design voltage of 20 MV in 1990. Since that time, improvements to the gas handling system, negative ion injector, accelerator terminal and control system have greatly increased its capability and reliability. Today, the ESTU can efficiently produce an extensive assortment of stable ions at wide-ranging energies in support of low-energy nuclear physics.     

Application of pressure sensitive paint measurement to a low-solidity cascade diffuser of a transonic centrifugal compressor

A pressure sensitive paint (PSP) measurement has been known as a pressure field measurement technique based on the oxygen quenching phenomenon of luminescence of specific luminophores. A PSP measurement was applied for pressure field measurement in a low-solidity circular cascade diffuser of a single-stage transonic centrifugal compressor with 5 in pressure ratio for HFC134a gas. The oxygen concentration was about 500 ppm. Ru (bath-phen) was adsorbed on a silica-gel thinlayer chromatography sheet, and the sheet was pasted onto the side-wall between the cascade vanes. A drastic change in luminescent intensity was recognized during a surge condition. Also the pressure variations based on luminescent intensity agreed well with the pressure fluctuations measured using a semiconductor pressure sensor with high-frequency-response. It was shown that a PSP measurement worked well to investigate the unsteady pressure fields in a circular cascade diffuser of a transonic centrifugal compressor. Moreover, the time response of PSP becomes clear as a problem to be overcome for the present.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.