数据处理的实用方法和算法

通过对正交多项式的构造和逼近准则的研究,得到了一类数据处理问题的一种较理想的逼近准则和算法。理论分析和模拟计算表明,用本文方法处理这类问题有较高的拟合精度并容易计算。     

保形插值的样条函数方法

对于给定的任何型值数组,本文通过插入新结点构造了Ｃ１连续的保形插值二次和三次样条函数Ｓ（ｘ）,最后还讨论了单调保形的插值样条函数。     

火炮射表数据处理程序及使用说明

在文献［１－４］的基础上,给出火炮射表数据处理用ＴｒｕｅＢＡＳＩＣＣｏｍｐｉｌｅｒ实现的程序清单和与之相关的使用说明。并介绍该程序的组成、设计特点、主要变量和使用注意事项,以及数据文件的命名法。另外还详细讨论了程序故障诊断及维护问题。     

载荷识别及其精度改善

本文系统地建立了载荷识别方法,详细探讨了提高载荷识别精度的途径,得到了载荷识别过程中信号处理加窗原则和试验的一般技术要求,使识别精度明显提高。     

带模糊约束的非平衡运输问题

本文首次提出了两类带模糊约束的非平衡运输问题,并建立了相应的数学模型。此外,研究了它们的表上求解法。最后,给出了一个具体实例。     

用填充函数法解决舰炮武器系统性能参数最佳化问题

本文研究的是舰炮武器系统的性能参数在满足一定的约束条件下,以什么样的匹配,可使舰炮武器系统的射击效力最佳,我们以多发射弹对目标的毁伤概率R_s(X)为目标函数,建立了数学模型。为了求解这样一个总体最优化问题,我们应用了填充函数的理论和方法,建立了算法,并扩充了一类填充函数的理论。通过在VA×11/780机上实际计算,获得了满意的结果,较好地解决了舰炮武器系统性能、参数的最佳化问题。     

对越轨功能的新认识

对越轨功能的认识具有重要意义,但以往对越轨功能的认识仅停留在现象层面,深入到人类发展的内在过程和社会运行机制层次加以分析,可以发现越轨有若干独特的积极功能。由对越轨的这种认识,可以恰当地确定我们对越轨的态度和应对策略。     

铁路区间信号系统测试评估平台——信息传输通道的建模及仿真研究

铁路区间信号系统测试评估平台的研究是为了实现对信号系统的功能、可靠性及安全性的自动测试和评估,并为区间信号系统的研发或维护提供测试手段.铁路区间信号系统信息传输通道,作为铁路区间信号传输的途径,是铁路区间信号系统测试评估平台的重要研究对象,因此,信息传输通道仿真子系统是测试平台的一个关键子系统.针对移频自动闭塞系统信息传输通道的仿真,提出一种新的差分方程建模方法,并进行了仿真实现.     

维恩位移定律2种表述之间的关系

讨论了维恩位移定律2种表述之间的关系,并与麦克斯韦分子分布函数的峰值相关量进行对比,说明原始的维恩表述是由实验决定的.并对2种表述的物理意义作了阐述.     

Appointment scheduling at a multidisciplinary outpatient clinic using stochastic programming

The purpose of this paper is to investigate the problem of constructing an appointment template for scheduling patients at a specific type of multidisciplinary outpatient clinic called an integrated practice unit (IPU). The focus is on developing and solving a stochastic optimization model for a back pain IPU in the face of random arrivals, an uncertain patient mix, and variable service times. The deterministic version of the problem is modeled as a mixed integer program with the objective of minimizing a weighted combination of clinic closing time (duration) and total patient waiting time (length of stay). A two‐stage stochastic program is then derived to account for the randomness and the sequential nature of the decisions. Although it was not possible to solve the two‐stage problem for even a limited number of scenarios, the wait‐and‐see (WS) problem was sufficiently tractable to provide a lower bound on the stochastic solution. The introduction of valid inequalities, limiting indices, and the use of special ordered sets helped to speed up the computations. A greedy heuristic was also developed to obtain solutions much more quickly. Out of practical considerations, it was necessary to develop appointment templates with time slots at fixed intervals, which are not available from the WS solution. The first to be derived was the expected value (EV) template that is used to find the expected value of the EV solution (EEV). This solution provides an upper bound on the objective function value of the two‐stage stochastic program. The average gap between the EEV and WS solutions was 18%. Results from extensive computational testing are presented for the EV template and for our adaptation of three other templates found in the literature. Depending on the relative importance of the two objective function metrics, the results demonstrate the trade‐off that exists between them. For the templates investigated, the “closing time” ranged from an average of 235 to 275 minutes for a 300‐minute session, while the corresponding “total patient time in clinic” ranged from 80 to 71 minutes.