瑞典Giraffe高架机动雷达的发展概况及趋势

主要概括了瑞典Giraffe系列雷达的发展状况,对Giraffe 40,Giraffe 50AT,Giraffe 75,Gi-raffe 100,Giraffe AMB,Giraffe S雷达的特点、主要性能指标及市场销售情况做了简要的介绍,最后总结了"Giraffe"高架机动雷达的发展趋势.     

适应任务的模块化卫星快速构建优化决策方法

如何根据应急航天任务,在满足各种约束的前提下,从型号众多、能力各异的卫星平台及有效载荷中快速决策效费比最佳的卫星构造方案引起了越来越多的关注,这就是适应任务的模块化卫星快速构建优化决策问题.在深入分析该问题特点的基础上,建立优化决策数学模型,提出基于遗传算法的优化决策方法,为处理遗传算法迭代过程中产生的不可行解引入基于...     

基因短序列模式分析及其在5'剪接位点识别中的应用

短序列模式分析是基因序列分析的一个重要组成部分,在进行生物信号识别的时候,一般都会利用到短序列模式的信息。通常短序列模式的数目很多,如果每个都应用到生物信号识别中,会产生大量的参数,而且无法体现信号的主要特征。为了找出在识别信号位点中起关键作用的短序列模式,以信息增益作为评价依据,按照逐步选择的策略,将模式进行排队。根据排队结果,选取信息增益突出的短序列模式作为识别生物信号的关键依据,这样可以用较少的模式得到较好的结果。结合选取的短序列模式,用最大熵模型作为信号序列真实分布的估计,从而对给定序列进行识别。最后将这个方法用于5’剪接位点的识别,得到了满意的结果。     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

Spatial pricing and product allocation in online retailing

Spatial pricing means a retailer price discriminates its customers based on their geographic locations. In this article, we study how an online retailer should jointly allocate multiple products and facilitate spatial price discrimination to maximize profits. When deciding between a centralized product allocation ((i.e., different products are allocated to the same fulfillment center) and decentralized product allocation (ie, different products are allocated to different fulfillment centers), the retailer faces the tradeoff between shipment pooling (ie, shipping multiple products in one package), and demand localization (ie, stocking products to satisfy local demand) based on its understanding of customers' product valuations. In our basic model, we consider two widely used spatial pricing policies: free on board (FOB) pricing that charges each customer the exact amount of shipping cost, and uniform delivered (UD) pricing that provides free shipping. We propose a stylized model and find that centralized product allocation is preferred when demand localization effect is relatively low or shipment pooling benefit is relatively high under both spatial pricing policies. Moreover, centralized product allocation is more preferred under the FOB pricing which encourages the purchase of virtual bundles of multiple products. Furthermore, we respectively extend the UD and FOB pricing policies to flat rate shipping (ie, the firm charges a constant shipping fee for each purchase), and linear rate shipping (ie, the firm sets the shipping fee as a fixed proportion of firm's actual fulfillment costs). While similar observations from the basic model still hold, we find the firm can improve its profit by sharing the fulfillment cost with its customers via the flat rate or linear rate shipping fee structure.     

BP网络在火灾形势预测中的应用

分析将BP网络应用于火灾预测研究的可行性与优势 ,并将神经网络与时间序列分析相结合 ,对火灾形势预测进行探讨     

基于决策树的空中目标威胁分类研究

将决策树ID3算法应用到空中目标威胁程度分类问题。分析了现有威胁评估的常用方法及其局限性,论述了ID3算法在此问题上的适用性。以28批典型目标的威胁程度为例,对数据进行概化处理后,利用weka平台进行仿真,构造决策树,并从中挖掘出隐含的24条规则,这对决策支持系统知识库的构建是非常必要的,也为指挥员定下作战决心提供重要参考。     

不确定性作战任务形式化描述方法

针对复杂作战环境下作战任务的不可预知性特点,对不确定性任务的形式化描述方法进行了深入研究。分析不确定环境导致的任务分解和执行过程中存在的不确定性因素,从任务本身的不确定性、任务之间关系不确定性以及作战单元执行不确定性等方面,对不确定性任务进行了形式化描述,提出了不确定性任务形式化描述流程,最后通过一个实例对所提方法进行了验证。     

温升热源条件油气热着火关键因素探究

通过对影响油气受热着火的关键因素进行研究,为发展主动防护技术提供理论依据。基于系统的实验和分析,探究了快速氧化现象、热源加热速度、热源面积与爆燃空间比例对热着火发生时临界浓度、着火概率和着火延迟期的影响,提出了温升热源条件受限空间能否发生热着火的综合判据。该判据认为：如果油气体积分数低于2.4％,受限空间体积与热源面积比值小于0．64m,那么即使温度达到873K,湿度降低到18％～21％,着火也不会发生。     

基于稀疏表示和非参数判别分析的降维算法

针对人脸识别问题提出一种新的监督降维算法。算法首先基于稀疏表示理论,利用同类样本间的稀疏重构来构建图。此方案不仅可以克服传统图构造方法中参数选择的困难,而且能够更好地刻画类内信息。然后,算法采用非参数类间离差来刻画类间信息,非参数类间离差在处理复杂分布数据时相比于参数类间离差更具判别力。最后,算法通过保持类内稀疏重构关系的同时最大化非参数类间离差来求得最优的投影矩阵。在ORL和Extended Yale B公共人脸数据库的实验表明,该算法能够获得较好的识别结果。