The Complete Solution of the Competitive Rank Selection Problem

Two decision-makers A and B observe sequentially a given permutation of n uniquely rankable options. A and B have one choice each (without recall) and both must make a choice. At each step only the relative ranks are known, and A has the priority of choice. At the end the (absolute) ranks are compared and the winner is the one who has chosen the better rank. Extending results by Enns and Ferenstein [6] and Berry et al. [1] this article gives, for both A and B , the optimal strategy and the corresponding winning probabilities. We show in particular that the limiting winning probabilities for A and B do exist, which closes a most important gap in the work of previous authors. This also provides an algorithm for numerically computing the limiting value of these probabilities. Although our proof is analytic in a strong sense, it is interesting to see that it would have been very hard to assemble it without the help of computer algebra. The reason is that the functions we have to investigate display subranges of indices which contrast considerably with respect to error terms when certain terms are replaced by approximations, and that computations were very helpful to locate those ranges where a particularly fine tuning of error estimates turned out to be indispensable. Received October 1997; revised March 15, 1998.     

Handling Updates and Crashes in VoD Systems

Though there have been several recent efforts to develop disk based video servers, these approaches have all ignored the topic of updates and disk server crashes. In this paper, we present a priority based model for building video servers that handle two classes of events: user events that could include enter, play, pause, rewind, fast-forward, exit, as well assystem events such as insert, delete, server-down, server-up that correspond to uploading new movie blocks onto the disk(s), eliminating existing blocks from the disk(s), and/or experiencing a disk server crash. We will present algorithms to handle such events. Our algorithms are provably correct, and computable in polynomial time. Furthermore, we guarantee that under certain reasonable conditions, continuing clients experience jitter free presentations. We further justify the efficiency of our techniques with a prototype implementation and experimental results.     

一类经济增长问题的控制理论研究

从影响经济增长的重要因素即人均资本着手，通过将社会经济系统划分为若干生产单元，根据经济增长运行过程的内在规律，建立了一个运用分布参数理论来描述和分析经济增长过程的机理模型，研究了该模型的系统解法和经济增长问题的最优控制问题。     

工业链条锅炉风煤比的优化控制

本文根据工业燃煤锅炉运行特点，在分析其数学模型的基础上提出了锅炉燃烧的一种优化控制方案。较好地解决了要求蒸汽压力稳定与节煤之间的矛盾，具有一定的实用价值。     

基于LonWorks总线的智能楼宇用电参数高精度采集节点设计

利用神经元芯片CY7C53120和单片机AT89S52设计了基于主机的智能楼宇用电参数采集Neuron节点,构成了LonWorks网络系统,采用AD637实现了电流与电压的真有效值高精度转换,给出了其硬件及软件模块。测试结果表明,系统实现了对楼宇中各用电参数的在线测量,误差控制在±1%以内。     

基于最优乘子潮流确定静态电压稳定临界点

给出了一种基于最优乘子潮流求静态电压稳定临界点的新方法.与连续潮流或直接法求解电压崩溃点不同,该方法从潮流的可行域外出发,利用潮流迭代过程中最优乘子的值和最小二乘解提供的信息,沿注入功率变化的方向逼近电压崩溃点.给出了判别和计算鞍结型和约束诱导型分岔点的方法,分析了逼近过程中的各种可能情况.对多个算例测试的结果表明:所提出的方法通过几次迭代即可收敛于静态电压稳定临界点,计算结果与应用连续潮流和直接法一致.     

基于动态投入产出控制系统的最优跟踪

研究动态投入产出系统的最优产出跟踪控制问题。根据实际产出需求,采用鲁棒消费策略,修正产出同时使消费过程中的目标函数达到最优。利用离散广义系统的控制的有关理论实现了产出的最优跟踪控制,并给出了具体的优化消费调整策略。算例表明:这种策略实现了对实际产出的渐近跟踪。     

基于设备可靠性分析的最优投资策略

定义了设备可靠性的概念，给出了设备可靠性的评价模型，对化工设备在固定时间内运行的可靠性进行了分析，提出了设备投资的最优化策略的数学模型和求解策略。结合实例给出了如何在满足系统可靠性要求的前提下实现设备最优投资的策略，并计算出了所需备用设备的最小数量。结果表明此策略可以广泛应用于工程实践中。     

多点随机搜索算法估计反应动力学参数

提出一种多点随机搜索算法，一方面它汲取随机搜索算法的优点以克服陷人局部最优点；另一方面它通过判断搜索过程目标函数变化趋势，从而能在响应曲面的下降方向上前进，加快寻优进程。与遗传算法相比较，多点随机搜索算法能以更快的速度找到全局最优解；与梯度下降算法相比较，它能以更高的概率找到全局最优解。本文将多点随机搜索算法应用于2-氯苯酚在超临界水中氧化反应动力学参数的估算，获得动力学模型对实验数据拟合的相对误差绝对值之和比文献报道降低了14．1％。     

多回路网络化控制系统中优化采样频率的确定

在多回路网络化控制系统中，通讯资源的共享和网络传输的时延为系统分析和设计带来新的问题．运用非线性规划理论，分析和推导了多回路网络化控制系统中采样频率优化问题，并由推导过程归纳出易于计算机编程实现的工程化求解方法．通过仿真示例验证了所提出方法的有效性．