针对应急救援路径规划的一种改进蚁群算法

针对不返回起始点、多个待救援点的应急救援路径规划问题,提出了一种应急救援路径规划的改进蚁群算法,设计了一种新的路径构造方法,为蚁群算法求解该类问题打下了基础。为提高收敛性,改进了信息素更新规则,构造了一种与蚁群算法有效结合的局部搜索算法,提高了算法快速寻优的能力。仿真结果表明:改进蚁群算法能够快速找到一条从救援中心到多个待救援点的优化路径,且收敛速度和最短路径较同类算法更优。     

多基准站相对定位算法及先验基线向量偏差影响分析

为提高单基准站短基线相对定位解算的可靠性,研究了多基准站约束的相对定位算法。将基准站间可提前测量的先验基线信息融入观测模型中,给出了多基准站相对定位的函数模型和随机模型,在此基础上推导了模糊度精度因子的解析表达式,揭示了基准站数量的增加对模糊度浮点解精度提升的作用;从理论上分析了基准站间先验基线信息中的偏差对模糊度解算的影响,分析表明,当先验基线各分量偏差的绝对值之和小于5 cm时,模糊度解算几乎不受影响;通过仿真和实测数据进行了验证。试验结果表明,增加基准站数量不仅能有效提升模糊度解算成功率和收敛速度,并且对先验基线信息中的偏差具有较好的抑制作用,当基线各分量偏差均增加到4 cm时,实测数据模糊度解算成功率仍能达到92%以上。研究结论为特殊场景下多基准站间的快速非精确标定提供了理论依据。     

一种改进的证据理论合成规则

随着证据理论在信息融合领域中的广泛应用,对冲突证据的处理成为证据理论和应用研究热点。提出了一种基于证据重要度和聚焦度的新的合成规则,首先根据各个证据的重要度对冲突证据进行修正,再对冲突进行细化并考虑证据焦元的基数对D-S合成法则的影响,将冲突信息提取后加入组合规则中。通过实验比较和分析,结果说明该方法不仅能够处理一般性冲突问题,也能处理"一票否决"和"鲁棒性"问题。     

基于博弈论和灰色关联分析的雷达抗干扰评估

首先,将基于博弈论的组合权重确定方法引入到雷达抗干扰评估指标的权重确定之中,克服了单一方法确定权重的片面性。然后,介绍了灰色关联分析,对确定指标权重后的雷达抗干扰能力进行了综合评估。最后,利用所建方法对国外7部雷达的抗干扰能力进行排序,验证了模型的正确性。     

基于多模型的模拟电路软故障诊断

针对电子装备模拟电路故障诊断过分依赖专业技术人员和诊断专家的不足,提出利用信息融合技术,综合极限学习机(ELM,Extreme Learning Machine)、支持向量机(SVM,Support Vector Machine)以及BP(Back Propagation)神经网络等智能故障诊断模型,对模拟电路软故障进行诊断的故障诊断方法。通过对不同模型分别输入不同频率的电压信号,得到每个模型的诊断结果;采用DS(Dempster-Shafe)证据理论对每个模型诊断结果的可信度进行评估,确立每个模型诊断结果的组合置信度。通过不同模型诊断结果的决策层融合,最终获得诊断结果。以某型装备滤波电路的故障诊断为例,多模型融合诊断结果的准确率比单一方法模型的诊断准确率有了明显的提高,证明了该方法的有效性。     

From adversity to prosperity

This article interrogates the continuing relevance of the contractarian governance paradigm to resource governance and the impact of exploitation on the local population and environment in the Democratic Republic of Congo (DRC), Zimbabwe and Ghana. It highlights the susceptibilities of their governance processes, particularly the roles of the elites of the host communities, the multinational corporations, and the governing authorities in appropriating resources for their personal interests, resulting in tensions and conflicts. This scenario is borne out of inept leadership, as well as the defective and compromised administrative mechanisms operational in these countries. In view of this, the article underscores the need for a ‘new governance management paradigm’ anchored on a communitarian framework, which incorporates all stakeholders, to guarantee sustainable peace and prosperity, particularly in conflict zones. The article therefore concludes that achieving a nexus between forestry, mining activities and economic development in these countries will require a restructuring of the existing governance mechanisms; and advocates for a new governance model capable of curbing the excesses of local and foreign hegemony, including a total overhaul of the seemingly compromised supervising authority.     

“Disarmament Market” Effects of Information Disclosures

In yet another wave of discussion on nuclear disarmament among political scientists and practitioners, one of the topical issues concerns the problem of transparency, its mechanisms, costs, and benefits. Numerous—though often abstract—calls for greater transparency of nuclear arsenals and postures when promoting the idea of nuclear disarmament, however, do not give a clear rationale for states possessing nuclear weapons to pursue greater transparency. Meanwhile, many other research fields—such as economics and psychology—attempt to address problems related to the lack of exact information on the counterpart's activities and intentions. Economics offers one probable analog for the transparency problem: the issue of information asymmetry and its consequences. This article is an attempt to apply the classical model of a market with information asymmetry to the analysis of the transparency problem within the nuclear disarmament process. Such an approach could help pave the way for closer cooperation between economic and political scientists in the nuclear disarmament field.     

基于变步长LMS的谐波电流检测方法的研究

能否快速准确检测出三相电力系统中谐波电流是决定有源滤波器整体滤波性能的关键.基于瞬时无功功率的谐波电流检测理论,提出了一种改进的自适应滤波器谐波检测算法,通过构造步长因子与误差信号的非线性函数,调整步长参数,使权向量达到最优,在确保稳态误差的前提下,提高了系统的收敛速度.仿真实验验证了该算法的正确性和有效性.     

Optimal patrol to uncover threats in time when detection is imperfect

Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014     

Evaluating the potential effects from probabilistic selling of similar products

In this article, we consider an online retailer who sells two similar products (A and B) over a finite selling period. Any stock left at the end of the period has no value (like clothes going out of fashion at the end of a season). Aside from selling the products at regular prices, he may offer an additional option that sells a probabilistic good, “A or B,” at a discounted price. Whenever a customer buys a probabilistic good, he needs to assign one of the products for the fulfillment. Considering the choice behavior of potential customers, we model the problem using continuous‐time, discrete‐state, finite‐horizon dynamic programming. We study the optimal admission decisions and devise two scenarios, whose value functions can be used as benchmarks to evaluate the demand induction effect and demand dilution effect of probabilistic selling (PS). We further investigate an extension of the base MDP (Markov Decision Process) model in which the fulfillment of probabilistic sales is uncontrollable by the retailer. A special case of the extended model can be used as a benchmark to quantify the potential inventory pooling effect of PS. Finally, numerical experiments are conducted to evaluate the overall profit improvement, and the effects from adopting the PS strategy. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 604–620, 2014