On efficient algorithms for finding efficient salvo policies

We consider the salvo policy problem, in which there are k moments, called salvos, at which we can fire multiple missiles simultaneously at an incoming object. Each salvo is characterized by a probability p_i: the hit probability of a single missile. After each salvo, we can assess whether the incoming object is still active. If it is, we fire the missiles assigned to the next salvo. In the salvo policy problem, the goal is to assign at most n missiles to salvos in order to minimize the expected number of missiles used. We consider three problem versions. In Gould's version, we have to assign all n missiles to salvos. In the Big Bomb version, a cost of B is incurred when all salvo's are unsuccessful. Finally, we consider the Quota version in which the kill probability should exceed some quota Q. We discuss the computational complexity and the approximability of these problem versions. In particular, we show that Gould's version and the Big Bomb version admit pseudopolynomial time exact algorithms and fully polynomial time approximation schemes. We also present an iterative approximation algorithm for the Quota version, and show that a related problem is NP-complete.     

Simple paths with exact and forbidden lengths

We study new decision and optimization problems of finding a simple path between two given vertices in an arc weighted directed multigraph such that the path length is equal to a given number or it does not fall into the given forbidden intervals (gaps). A fairly complete computational complexity classification is provided and exact and approximation algorithms are suggested.     

原始变量守恒形式控制方程的时间准确性分析

基于压力、速度和温度的原始变量为自变量的守恒形式的控制方程可应用于定常流动问题，但是在求解非定常问题，例如某一典型激波管问题时，激波后温度出现过冲现象，即使通过细化网格、提高空间格式精度或者换用其他通量格式仍不能消除，这表明误差可能来自该方法本身。采用一维Euler方程对该方法进行数值分析。分析结果表明，数值误差来自时间项。通过构造相应的双时间步方程，虚拟时间项采用原始变量，而物理时间项采用守恒变量，并在两个相邻物理时间步内作为定常问题求解，可以收敛到相应的守恒形式，消除上述误差，得到准确的非定常数值解。     

舰艇协同作战导弹防御模型研究

舰艇协同作战是未来战争的主要作战形式,导弹防御是其主要的作战职责.运用信息论的方法对舰艇协同作战中敌方导弹发射策略的不确定性进行建模,运用可靠性理论对协作效果进行建模,并引进知识的概念作为其度量,同时用边的函数对网络复杂性进行建模,综合这两种因素在以最大化防御时间为总的决策目标,以己方导弹储备和敌方来袭速率为决策因素对导弹防御作出辅助决策.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Zodiac算法新的不可能差分攻击

重新评估了Zodiac算法抵抗不可能差分攻击的能力。通过分析Zodiac算法的线性层,给出了Zodiac算法两条新的14轮不可能差分。利用新的不可能差分,结合Early-Abort技术对完整16轮的Zodiac算法进行了不可能差分攻击。攻击过程中一共恢复6个字节的密钥,其时间复杂度只有2_32.6次加密,数据复杂度约为2_85.6个明文,该攻击结果与已有最好的结果相比,时间复杂度降低了一个因子2₃₃。结果表明由于Zodiac算法线性层的扩散性差,使得该算法对不可能差分分析是不免疫的。     

Zodiac算法新的不可能差分攻击

#重新评估了Zodiac算法抵抗不可能差分攻击的能力。通过分析Zodiac算法的线性层,给出了Zodiac算法两条新的14轮不可能差分。利用新的不可能差分,结合Early-Abort技术对完整16轮的Zodiac算法进行了不可能差分攻击。攻击过程中一共恢复6个字节的密钥,其时间复杂度只有2_32.6次加密,数据复杂度约为2_85.6个明文,该攻击结果与已有最好的结果相比,时间复杂度降低了一个因子2₃₃。结果表明由于Zodiac算法线性层的扩散性差,使得该算法对不可能差分分析是不免疫的。     

GENDER AWARENESS IN RESEARCH AND POLICY MAKING

Abstract

There is an assumption that we can enhance peacebuilding by improving the tools that we use for assessments, planning and evaluation. However, the focus on tools creates the impression that peacebuilding challenges are technical. Improving tools is not meaningless, but our preoccupation with tools has a negative effect when it becomes a front for avoiding dealing with the deeper inherent contradictions in peacebuilding. There are limits to our knowledge and our ability to engineer specific outcomes in complex systems. There are unrealistically high expectations of coherence, unity of purpose and cooperation among peacebuilding actors. Peacebuilding agents are interconnected, but that does not imply that they have the same objectives, mandates, principles and values. Interconnected problems call for interconnected responses, not for one coherent response. Coherence should not be about negotiating a common position, and then promoting it regardless of changing dynamics. Coherence should be about continuously managing competing interests and interdependencies. The interaction between dissention, competition for resources, and the tension between different approaches and policy choices is not only normal but necessary to ensure the optimal functioning of the system.     

水下航行体惯性类水动力系数的计算方法

为了系统地计算水下航行体全套惯性类水动力系数,提高计算效率和计算精度,通过基于无粘模型的计算方法对水下航行体的运动进行了预报;通过UDF及动网格技术,对匀速运动和匀加速运动的SUBOFF模型进行了分析.设计了单方向速度线性变化的匀加速直线运动和匀加速回转运动,并通过换算和数值拟合处理得到了潜艇所受的惯性力和惯性类水动力系数.该系数与试验误差保证在6％之内,验证了所提方法的可行性及准确性.     

短路故障的测试产生方法

在PCB上,两个不相邻的芯片管脚或引线发生短路是实际应用当中最常见的故障。通过分析固定型故障和桥接故障之间的关系,给出桥接故障测试序列产生的系统计算方法。该方法已应用在一个PCB故障测试系统中。