光顺样条函数的再生核表示与计算

光顺样条是散乱数据拟合的理想函数,是噪声数据最优平滑的重要工具。因此,光顺样条的数学表示和计算的研究具有重要的意义。本文在一般的线性微分算子和线性泛函的情况下讨论光顺样条函数的构造和计算,通过构造一个适当的再生核Hilbert空间,使得所讨论的微分算子光顺样条成为该空间中的最小范数问题,再利用投影理论建立了光顺样条函数的再生核表示方法,并得到了插值偏差表达式。作为特例,还给出了奇次多项式光顺样条函数新的简洁的计算方法。     

基于模糊-组合神经网络的信息系统安全风险评估

针对信息系统的安全风险评估问题,提出了一种将模糊理论与神经网络进行"浅层次"结合的评估方法。通过对信息系统所涉及的风险因素分别从资产影响、威胁频度、脆弱性严重程度三方面进行分析,建立了信息系统的安全风险层次化结构,并构造了各因素所对应评判集的隶属度矩阵;综合运用模糊推理算法与神经网络仿真技术,对信息系统的安全风险进行评估,进而判定信息系统安全风险等级。最后,通过实例分析说明了算法的应用,并借助误差分析检测了模型的有效性。     

基于方位量测的舰艇对潜定位技术研究*

结合舰艇拖曳线列阵声纳实际搜潜装备,利用舰载线列阵声纳测得的潜艇目标方位信息,建立了基于方位量测的舰艇对潜艇目标定位的数学模型,给出求解潜艇运动参数的定位算法,并对定位误差进行了分析,在定位模型及算法的基础上,仿真研究了潜艇与舰艇之间的初始距离、舰艇测得潜艇目标初始方位角、潜艇航向等因素对定位性能的影响,给出仿真结果并进行了分析,该结果对于指导实际反潜具有一定的实用价值.     

城市消防远程监控系统建设过程中的几点体会

通过对国内自动消防设施设备存在问题的归纳,结合城市消防远程监控系统实际功能的实现,从监控终端、通信网络、信息中心三个方面提高系统的容错能力,阐述了实际建设和调试过程中的解决办法,并对系统的可靠性和安全性进行了讨论。     

基于扩展Petri网的防空C~4ISRK系统建模分析

针对地空导弹武器系统防空中的火力分配问题,建立了战术级防空C4ISRK系统的Petri网模型。对其进行扩展,即联合谓词Petri网和赋色Petri网,建立旅级火力分配的改进模型,给出了具体的前置谓词公式。为有效分析战术决策的正确性提供了依据和思路。     

基于垂直线列阵的深海被动目标定深误差

首先研究了在深海环境下,采用三阵元垂直线列阵水声探测系统进行被动目标定深的基本原理。然后分别从随机误差、阵元配置偏差和相干多途水声信道干扰的角度,对被动目标定深的误差源进行了理论分析,并推导了相关公式。通过仿真实验,总结出各误差源对被动目标定深精度影响的规律,为进一步开展被动目标定深研究、提高被动目标定深精度奠定了基础。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A search game taking account of attributes of searching resources

This article deals with a two‐person zero‐sum game called a search allocation game (SAG), in which a searcher and a target participate as players. The searcher distributes his searching resources in a search space to detect the target. The effect of resources lasts a certain period of time and extends to some areas at a distance from the resources' dropped points. On the other hand, the target moves around in the search space to evade the searcher. In the history of search games, there has been little research covering the durability and reachability of searching resources. This article proposes two linear programming formulations to solve the SAG with durable and reachable resources, and at the same time provide an optimal strategy of distributing searching resources for the searcher and an optimal moving strategy for the target. Using examples, we will analyze the influences of two attributes of resources on optimal strategies. © 2007 Wiley Periodicals, Inc. Naval Research Logistics 2008     

A generic model of motor‐carrier fuel optimization

Fuel optimizers are decision models (software products) that are increasingly recognized as effective fuel management tools by U.S. truckload carriers. Using the latest price data of every truck stop, these models calculate the optimal fueling schedule for each route that indicates: (i) which truck stop(s) to use, and (ii) how much fuel to buy at the chosen truck stop(s) to minimize the refueling cost. In the current form, however, these models minimize only the fuel cost, and ignore or underestimate other costs that are affected by the models' decision variables. On the basis of the interviews with carrier managers, truck drivers, and fuel‐optimizer vendors, this article proposes a comprehensive model of motor‐carrier fuel optimization that considers all of the costs that are affected by the model's decision variables. Simulation results imply that the proposed model not only attains lower vehicle operating costs than the commercial fuel optimizers, but also gives solutions that are more desirable from the drivers' viewpoint. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008