基于Riccati方程的动态传感器分配算法

针对组网跟踪系统传感器分配算法计算量过大的问题,提出了一种基于Riccati方程的动态传感器分配算法。该算法通过Riccati方程离线计算各传感器组合跟踪下的稳态滤波协方差,根据稳态滤波协方差与期望协方差的接近程度动态分配传感器资源。仿真结果显示,与传统协方差控制和贪婪算法相比,基于Riccati方程的动态传感器分配算法在大大减少计算量的同时能够保持较好的跟踪性能。该方法能够更好地应用于大规模传感器组网目标协同跟踪系统。     

CGCS2000大地问题解算工程运用研究

军事信息系统研制中经常涉及CGCS2000坐标系下的大地问题解算,但直接采用韦森特公式进行软件设计存在一些问题。通过对韦森特公式在工程运用中的问题进行了分析,对正解、反解算法进行了补充完善并给出了相关的计算实例供编程检查。改进后的算法简单实用,适合军事信息系统软件的实现。     

基于Multi-agent协商的多干扰机资源管理

多干扰机协同是组网雷达对抗的一种重要方法。针对多干扰机协同中面临的数据传输率、时效性等因素所引起的干扰资源管理问题,建立了基于中心控制协商和公约协商的干扰资源管理模型,并给出了相应的协同算法与仿真。仿真结果表明：两种方法在组网雷达对抗中均能取得良好的干扰效果及较低的漏威胁目标信号脉冲比例。其中,基于公约的Multi?agent协商在组网干扰资源管理方面具有更好的可行性,其效果优于基于中心控制协商的方法。     

第19届国际信息融合会议及获奖论文评述

总结了第19届国际信息融合会议的总体情况和主要特点,通过对大会报告、分会场报告以及国际信息融合界一些著名专家团队发表论文情况的统计分析,提炼出国际信息融合界普遍关注的焦点和难点问题;通过对获奖论文的分析,了解到受大会评奖委员会一致认可的年度优秀成果和技术进步点;最后,面向高层信息融合中的不确定性处理,对信息融合领域的发展进行展望。     

指派问题的降阶优化算法

指派问题是运筹学中特殊线性规划中的一类问题。在现实生活中,指派问题非常普遍,常常可以见到各种各样的指派问题。通过对指派问题的数学模型进行分析,提出了与以往方法不同的求解指派问题的一种新的思路,通过对几个定理的研究,给出了一种新的求解方法——降阶优化算法。对求解指派问题提供了一种新的途径,在运筹学等领域有着较好的应用前景。     

奇型非线性抛物问题的有限元误差估计

引入带权的Sobolev空间 ,讨论了奇型非线性抛物问题的有限元方法 ,在a(u) ,f(u)均满足Lips chitz条件下 ,证明了相应椭圆投影算子Rhu与u之间误差估计式 ,并在一定的假设下 ,给出了奇型非线性抛物问题的广义解u及半离散问题的有限元解uh 误差估计式 .     

Balancing and optimizing a portfolio of R&D projects

A mathematical formulation of an optimization model designed to select projects for inclusion in an R&D portfolio, subject to a wide variety of constraints (e.g., capital, headcount, strategic intent, etc.), is presented. The model is similar to others that have previously appeared in the literature and is in the form of a mixed integer programming (MIP) problem known as the multidimensional knapsack problem. Exact solution of such problems is generally difficult, but can be accomplished in reasonable time using specialized algorithms. The main contribution of this paper is an examination of two important issues related to formulation of project selection models such as the one presented here. If partial funding and implementation of projects is allowed, the resulting formulation is a linear programming (LP) problem which can be solved quite easily. Several plausible assumptions about how partial funding impacts project value are presented. In general, our examples suggest that the problem might best be formulated as a nonlinear programming (NLP) problem, but that there is a need for further research to determine an appropriate expression for the value of a partially funded project. In light of that gap in the current body of knowledge and for practical reasons, the LP relaxation of this model is preferred. The LP relaxation can be implemented in a spreadsheet (even for relatively large problems) and gives reasonable results when applied to a test problem based on GM's R&D project selection process. There has been much discussion in the literature on the topic of assigning a quantitative measure of value to each project. Although many alternatives are suggested, no one way is universally accepted as the preferred way. There does seem to be general agreement that all of the proposed methods are subject to considerable uncertainty. A systematic way to examine the sensitivity of project selection decisions to variations in the measure of value is developed. It is shown that the solution for the illustrative problem is reasonably robust to rather large variations in the measure of value. We cannot, however, conclude that this would be the case in general. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 18–40, 2001     

火炮火控系统命中解的分布和存在性

定义了火控系统中问题联立方程应满足的“基本假设”,从理论上讨论了在“基本假设”条件下诸命中解的分布特性 ,证明临近的命中解 (如果存在的话 )是唯一的 ,给出了临近解存在的充分必要条件。用一个简单的实例表出不同目标速度下诸命中解分布的实验数据     

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.     

Pricing and capacity allocation strategies: Implications for manufacturers with product sharing

Emerging sharing modes, like the consumer-to-consumer (C2C) sharing of Uber and the business-to-consumer (B2C) sharing of GoFun, have considerably affected the retailing markets of traditional manufacturers, who are motivated to consider product sharing when making pricing and capacity decisions, particularly electric car manufacturers with limited capacity. In this paper, we examine the equilibrium pricing for a capacity-constrained manufacturer under various sharing modes and further analyze the impact of capacity constraint on the manufacturer's sharing mode selection as well as equilibrium outcomes. We find that manufacturers with low-cost products prefer B2C sharing while those with high-cost products prefer C2C sharing except when the sharing price is moderate. However, limited capacity motivates manufacturers to enter into the B2C sharing under a relatively low sharing price, and raise the total usage level by sharing high-cost products. We also show that the equilibrium capacity allocated to the sharing market with low-cost products first increases and then decreases. Finally, we find that sharing low-cost products with a high limited capacity leads to a lower retail price under B2C sharing, which creates a win-win situation for both the manufacturer and consumers. However, sharing high-cost products with a low limited capacity creates a win-lose situation for them.