X波段六腔渡越管振荡器的高频特性研究

 从麦克斯韦方程出发，采用时域有限差分法（FDTD）和离散傅里叶变换（DFFT）相结合的方法，通过数值计算得出了六腔开放式谐振腔中前四个谐振频率和场分布，计算出的谐振频率与实验测量结果基本相同。比较了开放腔和封闭腔谐振频率，验证了TEM波吸收边界条件，并在实际编程计算中得以应用。计算结果为六腔渡越管振荡器的机理研究提供了依据。     

铁路主要干线提速有关问题的研究

在对列车提速的必要性、原则和有限目标进行论述的基础上，就列车提速对运输技术设备的要求和运输组织方面的若干问题进行了初步探讨，分析了多速度客货列车混跑时，不同速度配比的组合方案对线路通过能力的影响，为干线提速的方案选定提供了基础     

On Discrete Zariski-Dense Subgroups of Algebraic Groups

We investigate under which conditions an algebraic group G defined over a locally compact field k admitr a subgroup Γ? G(k) which is dense in the Zariski topology, but discerte in the topology induced by the locally compact topology on k. For non—solvable groups we provide a complete answer.     

Modeling of radiative heat transfer in an axisymmetric cylindrical enclosure with participating medium

Radiative heat transfer in an axisymmetric enclosure with absorbing, emitting, and scattering medium is studied here by using the different methods such as MDOM, FVM, and MFVM with emphasis on the treatment of angular derivative term, which appears in curvilinear coordinates due to angular redistribution. After final discretization equation for MFVM is introduced by using the step scheme and directional weights, the present approach is validated by applying it to three different benchmarking problems with absorbing, emitting, and scattering medium. All of the results presented here support its accuracy as well as moderate efficiency. Finally, the present approaches are applied to a truncated cone-shaped enclosure as a body-fitted geometry case.     

Necessary conditions for multistationarity in discrete dynamical systems

R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation.     

原子的吸收光谱和发射光谱的演示

介绍了利用光学多道分析仪和投影仪在课堂上实时演示原子的吸收光谱和发射光谱的实验方法。     

Discrete global descent method for discrete global optimization and nonlinear integer programming

A novel method, entitled the discrete global descent method, is developed in this paper to solve discrete global optimization problems and nonlinear integer programming problems. This method moves from one discrete minimizer of the objective function f to another better one at each iteration with the help of an auxiliary function, entitled the discrete global descent function. The discrete global descent function guarantees that its discrete minimizers coincide with the better discrete minimizers of f under some standard assumptions. This property also ensures that a better discrete minimizer of f can be found by some classical local search methods. Numerical experiments on several test problems with up to 100 integer variables and up to 1.38 × 10¹⁰⁴ feasible points have demonstrated the applicability and efficiency of the proposed method.     

Rn上的非初等变换群及其极限集

该文对高维非初等Mò'bius变换群进行了研究,得到了一些重要性质,给出了几个关于离散准则和代数收敛性的定理.     

A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search

Decisions concerning a project’s expedition, traditionally involved considerations regarding time and cost tradeoff. It was recently suggested that the quality of a project should also be taken into considerations. In this paper, we propose a meta-heuristic solution procedure for the discrete time, cost and quality tradeoff problem. This problem involves the scheduling of project activities in order to minimize the total cost of the project while maximizing the quality of the project and also meeting a given deadline. We apply a so called electromagnetic scatter search to solve this problem. In this process, we initially generate a population of feasible solutions. In so doing, we use frequency memory to well sample the feasible region. A number of these solutions are then selected and improved locally. The improved solutions are then combined to generate new set of solutions. The combination process utilizes attraction–repulsion mechanisms borrowed from the electromagnetism theory. The whole process is stopped when no significant improvement in the set of solutions are observed. The validity of the proposed solution procedure is demonstrated, and its applicability is tested on a randomly generated large and complex problem having 19,900 activities.     

Diameter graphs of polygons and the proof of a conjecture of Graham

We show that for an n-gon with unit diameter to have maximum area, its diameter graph must contain a cycle, and we derive an isodiametric theorem for such n-gons in terms of the length of the cycle. We then apply this theorem to prove Graham's 1975 conjecture that the diameter graph of a maximal 2m-gon (m?3) must be a cycle of length 2m−1 with one additional edge attached to it.