More on the search for an infiltrator

We have asymptotically solved a discrete search game on an array of n ordered cells with two players: infiltrator (hider) and searcher, when the probability of survival approaches 1. The infiltrator wishes to reach the last cell in finite time, and the searcher has to defend that cell. When the players occupy the same cell, the searcher captures the infiltrator with probability 1 ? z. The payoff to the hider is the probability that the hider reaches the last cell without getting captured. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 1–14, 2002; DOI 10.1002/nav.1047     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

基于差分法的二阶微分方程的模糊边值问题

本文讨论二阶微分方程的两点边值具有模糊不确定性时 ,运用模糊仿真原理和差分方法 ,求其边值问题的数值解法。     

最大避障圆问题的提出与初探

提出了一个在有界区域内求对已知各障碍物的最大避障圆问题。首先给出此问题的数学描述,然后分析了当有界区域为圆域,并将各障碍物看成一个有限点集时,避障圆的基本性质,从而得到一种求最大避障圆的有效算法。     

冲激电源作用于动态电路后初始值的求法

总结了冲激电源作用于动态电路后初始值求法的一些常见算法。针对这些算法的不足,论述了一种新的算法。     

关于细鞍点与细焦点的一般变换

各种变换在平面多项式系统的定性研究中是非常重要的。通过对鞍点量和焦点量计算时常用的变换进行研究,得到了两类把细鞍点化为细焦点的一般变换,并利用其中的一类推导出了不含二次项的三次系统的鞍点量和可积条件。     

平面图形对象拾取算法研究

介绍了在图形处理中,利用面向对象技术实现的平面图形对象拾取算法。与传统的以大量图像信息的存储为基础的位图存储方式下的图形对象拾取算法相比,本算法不但包括单个图形对象的拾取,而且也探讨了在复杂的图形组合下,如在图形重叠与覆盖的情况下进行多个图形对象拾取所需解决的算法难点。本算法对提高图像信息的存储效率和图形对象拾取的质量,对图像科学与面向对象技术的发展具有实际意义。     

高阶累积量自适应波束形成的改进算法

针对线性约束最小方差(LCMV)算法在自适应波束形成时,存在的对噪声敏感、信噪比(SNR)较高时波束形成受小特征值扰动影响较大的情况。在基于高阶累积量的LCMV算法的基础上提出改进方法。该方法首先计算阵列接收数据的高阶累积量,然后对高阶累积量构造数据增广矩阵,进行奇异值分解求出伪逆,再用伪逆修正LCMV算法的权值,形成波束。仿真结果表明,相比于传统LCMV算法与基于高阶累积量的LCMV算法。算法能够有效地克服信噪比升高时小特征值扰动对波束形成的不良影响,且在较低快拍数下仍能有效形成波束。     

学者的人间情怀——古代文学研究中的“冷”与“热”

经济全球化的趋势使民族文化传统遭遇到一种普遍的危机。目前，我国高等学校的古代文学研究与教学已经面临这种危机与挑战。本文认为转变古代文学研究中“纯学术”立场，关注精神价值，强化生命意识，多一些人间情怀，注重古典文学中的情感、心态等精神价值方面的研究，对传承文明，重塑华夏民族精神，具有重要意义。     

基于模糊多属性决策的反装甲目标战场价值评估

信息化战场反装甲目标层出不穷,指挥员决策难度增大。针对反装甲目标信息的复杂性,应用模糊多属性决策理论,提出坦克分队进攻战斗中敌反装甲目标战场价值评估的方法。并通过确定各决策因素指标值和计算加权值,构建价值评估多属性决策模型,快速有效地确定分队本级范畴内的敌反装甲目标的战场价值,有利于分队指挥员迅速果断地实现其作战指挥决策。