时间序列季节调整方法在中国的发展:PBC版X-12-ARIMA

中国人民银行(PBc)版X-12-ARIMA软件是基于中国特点而定制的时间序列季节调整软件.通过总结时间序列季节调整方法的特点以及相应软件在国外的发展,针对我国应用的特点,尤其是春节因素的考虑,在解剖X-12-ARIMA方法原理的基础上,在春节因素计算方法、软件应用界面以及用户使用帮助等3个主要方面加以改进,具有数据导入、调整设置文件、运行方式以及结果输出4方面的特色.     

新形势下对设计教育方法的思考

在信息化社会里,设计专业与社会需求之间有着非常紧密的联系,为了使学生在大量信息面前,对所学习的专业知识与技能,展开独立的思考,多向思维、多种角度去认识同一事物,并能根据自己的需要进行分类和整理,培养学生捕捉信息的敏锐感受和理解的能力,要求教师积极主动调整知识结构、增加新的教育方法来改善我们的设计教育,使每一个学生的潜能都能得到充分发展,并获得更直接、更实际的专业知识。     

探索新体系 形成新特色──编写《电力系统分析》教材的体会和作法

本文介绍了作者在总结教学改革和课程建设成果的基础上编写《电力系统分析》教材的体会和作法。指导思想是‘探索新体系,形成新特色”。针对课程本身的任务和学科的系统性,将全书分为三篇：电力系统的基础知识;电力系统的基本计算和电力系统的运行分析。特色为：注重学生能力的培养;少而精;适时反映学科的发展与进步。配套：思考题、习题及计算机辅助教学软件包（ＣＡＩ）。     

Recent development and applications of an optical method for measurements of thermophysical properties

The experimental determination of thermophysical properties has been greatly improved by the introduction of laser technology. The laser beam is used for sensing and also for heating (or exciting) the specimen. The advantage of using a laser beam is most strongly felt in the measurement of the thermal conductivity or the thermal diffusivity, which are some of the most difficult properties to measure. Interesting features of new techniques for investigating various aspects of thermal conductivity in fluids and solids are reviewed. An optical method, the so-called forced Rayleigh scattering method, or the laser-induced optical-grating method, has been developed and used extensively by the present author's group. The method is a high-speed remote-sensing method which can also quantitatively detect anisotropy, namely, direction dependence of heat conduction in the material. It was used for determination of the thermal diffusivity and its anisotropic behavior for high-temperature materials such as molten salts, liquid crystals, extended polymer samples, and flowing polymer melts under shear. Interesting applications of the method were demonstrated also for thermal diffusivity mapping and microscale measurement.Invited paper presented at the Twelfth symposium on Thermophysical Properties, June 19–24, 1994, Boulder, Colorado, U.S.A.     

The method of fundamental solutions for problems in static thermo-elasticity with incomplete boundary data

An inverse problem in static thermo-elasticity is investigated. The aim is to reconstruct the unspecified boundary data, as well as the temperature and displacement inside a body from over-specified boundary data measured on an accessible portion of its boundary. The problem is linear but ill-posed. The uniqueness of the solution is established but the continuous dependence on the input data is violated. In order to reconstruct a stable and accurate solution, the method of fundamental solutions is combined with Tikhonov regularization where the regularization parameter is selected based on the L-curve criterion. Numerical results are presented in both two and three dimensions showing the feasibility and ease of implementation of the proposed technique.     

A modified teaching–learning-based optimisation algorithm for bi-objective re-entrant hybrid flowshop scheduling

In this paper, a modified teaching–learning-based optimisation (mTLBO) algorithm is proposed to solve the re-entrant hybrid flowshop scheduling problem (RHFSP) with the makespan and the total tardiness criteria. Based on the simple job-based representation, a novel decoding method named equivalent due date-based permutation schedule is proposed to transfer an individual to a feasible schedule. At each generation, a number of superior individuals are selected as the teachers by the Pareto-based ranking phase. To enhance the exploitation ability in the promising area, the insertion-based local search is embedded in the search framework as the training phase for the TLBO. Due to the characteristics of the permutation-based discrete optimisation, the linear order crossover operator and the swap operator are adopted to imitate the interactions among the individuals in both the teaching phase and the learning phase. To store the non-dominated solutions explored during the search process, an external archive is used and updated when necessary. The influence of the parameter setting on the mTLBO in solving the RHFSP is investigated, and numerical tests with some benchmarking instances are carried out. The comparative results show that the proposed mTLBO outperforms the existing algorithms significantly.     

关于搞好士官学员思想教育的几点思考

本文着重从士官学员的思想特点及其发展变化规律入手,研究如何针对这些特点和规律搞好思想教育工作。     

土地利用效益评估与在南部的实践

本文简要讨论了土地利用效益评价的内涵与原则,提出了两类评估方法,即专家估计效益综合指数法与土地直接产出法。在南部的实践说明两种方法的结果高度正相关。     

A relativistic extension of the complex scaling method using oscillator basis functions

We develop the complex scaling method within the relativistic framework by expanding the Dirac spinors in the complete set of eigensolutions of a harmonic oscillator potential, and present the theoretical formalism of describing the discrete bound and resonant states on the same footing. Based on a well established and frequently used model, we demonstrate the utility and applicability of the extended method and examine the stability of the results with respect to the variations of the parameters of the model. Satisfactory agreements are found for all the calculated results in comparison with some other calculations in references. Especially, the present calculation in the nonrelativistic limit gives a consistent result with that in the nonrelativistic calculation.     

Betweenness parameterized above tight lower bound

We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the Betweenness problem parameterized above its tight lower bound, which is stated as follows. For a set V of variables and set C of constraints “vi is between vj and vk”, decide whether there is a bijection from V to the set {1,…,|V|} satisfying at least |C|/3+κ of the constraints in C. Our result solves an open problem attributed to Benny Chor in Niedermeier's monograph “Invitation to Fixed-Parameter Algorithms”. The betweenness problem is of interest in molecular biology. An approach developed in this paper can be used to determine parameterized complexity of a number of other optimization problems on permutations parameterized above or below tight bounds.