作战系统的序参量及其演化方程

"新三论"(包括耗散结构论、协同学和突变论)作为一种新的世界观,给研究作战系统这个复杂的非线性系统提供了新的视角。运用"新三论"的思想和方法指出作战系统的序参量,建立序参量方程,分析序参量演化稳定性与途径,得出一些有价值的结论,对于探索作战系统发展演变的规律具有重要意义。     

基于LWT的纹理特征提取方法

介绍了一种利用局部沃尔什变换(LWT)提取图像纹理特征的新方法,给出LWT的定义,并分析了LWT系数的统计特性及其各阶矩的纹理鉴别性能。结果表明:自然纹理图像的LWT系数一般不服从正态分布,其偶数阶矩具有较好的纹理鉴别性能,奇数阶矩的纹理鉴别性能较差,因此选取LWT系数的偶数阶(2、4、6阶)矩作为纹理特征。与Haralick[1]、Wang和He[2,3],以及HuiYu[5]等人提出的纹理特征相比,基于LWT的纹理特征具有更好的鉴别性能,并且计算简单。     

关于学校定位的理性思考

每一所学校的建设与发展,都离不开先进、准确、合理的学校定位。学校定位的准确与否,直接关系着学校办学的前途和命运。学校定位对学校办学行为起着规范、约束和自我评估的作用。能否为自己的学校建设与发展找准定位,是衡量一所学校高层决策水平高低和教学工作水平优劣的重要依据。所以,要准确把握学校定位的含义、依据、内容及特征。     

古建筑火灾危险性分析及预防对策

古建筑具有重要的历史价值,保护好古建筑免受火灾损害意义重大。针对古建筑严峻的火灾形势,分析其火灾危险性及火灾特点,并提出防范对策。     

Efficient sequential decision‐making algorithms for container inspection operations

Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Allocating capacity in parallel queues to improve their resilience to deliberate attack

We develop models that lend insight into how to design systems that enjoy economies of scale in their operating costs, when those systems will subsequently face disruptions from accidents, acts of nature, or an intentional attack from a well‐informed attacker. The systems are modeled as parallel M/M/1 queues, and the key question is how to allocate service capacity among the queues to make the system resilient to worst‐case disruptions. We formulate this problem as a three‐level sequential game of perfect information between a defender and a hypothetical attacker. The optimal allocation of service capacity to queues depends on the type of attack one is facing. We distinguish between deterministic incremental attacks, where some, but not all, of the capacity of each attacked queue is knocked out, and zero‐one random‐outcome (ZORO) attacks, where the outcome is random and either all capacity at an attacked queue is knocked out or none is. There are differences in the way one should design systems in the face of incremental or ZORO attacks. For incremental attacks it is best to concentrate capacity. For ZORO attacks the optimal allocation is more complex, typically, but not always, involving spreading the service capacity out somewhat among the servers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于神经网络的地形匹配方法研究

提出了基于神经网络实现多特征融合的地形匹配算法,充分利用地形的各种不同的统计特征和几何特征,构造了一种地形匹配网络模型.通过对实时图和基准图的分析,给出了计算网络节点之间的权值函数,建立了网络系统能量方程,通过求系统的最小能量得到最佳匹配位置.由于网络能融合地形的不同统计特征和几何特征,所以算法大大提高了系统的抗干扰能力和定位精度,适合于实时图容易发生畸变的地形匹配领域.实验结果表明,定位精度和抗干扰能力均优于传统的地形匹配方法.     

Capacity allocation with traditional and Internet channels

In this paper we study a capacity allocation problem for two firms, each of which has a local store and an online store. Customers may shift among the stores upon encountering a stockout. One question facing each firm is how to allocate its finite capacity (i.e., inventory) between its local and online stores. One firm's allocation affects the decision of the rival, thereby creating a strategic interaction. We consider two scenarios of a single‐product single‐period model and derive corresponding existence and stability conditions for a Nash equilibrium. We then conduct sensitivity analysis of the equilibrium solution with respect to price and cost parameters. We also prove the existence of a Nash equilibrium for a generalized model in which each firm has multiple local stores and a single online store. Finally, we extend the results to a multi‐period model in which each firm decides its total capacity and allocates this capacity between its local and online stores. A myopic solution is derived and shown to be a Nash equilibrium solution of a corresponding “sequential game.” © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

中文分词与命名实体识别的联合学习

将卷积结构引入循环神经网络,从而构建卷积循环神经网络。以此为基础,研究构建了面向中文分词与实体识别联合学习的序列标注模型。该模型依托卷积循环神经网络构建特征编码层,实现中文字序列局部空间特征和长距离时序依赖特征的联合提取;依托改进的循环神经网络构建标签解码层,实现标签序列长距离时序依赖的有效建模;依托统一的分词与实体识别序列标注模式实现分词信息与实体信息的联合学习,避免传统流水线法的误差传播问题。在人民日报语料和微软标注语料上的实验结果显示,该框架较传统统计模型和神经网络模型有显著的性能提升,尤其是在识别字数较多的命名实体时,其效果明显优于其他方法。     

落点散布鉴定中Bayes序贯截尾方法的运用

本文研究再入飞行器落点散布的鉴定方法。构造了 Ｂａｙｅｓ 序贯截尾方案；分析了可能冒的风险，给出了计算方法； 对于 Ｂａｙｅｓ 方法运用中的关键问题——验前信息的运用及验前概率的计算， 作了较详细的论述。文中提出的方法， 适用于小子样场合下的试验鉴定问题。