圆柱形容器爆炸焊接数值模拟与实验

针对深空探测采样容器的特殊要求,进行爆炸焊接严实密封技术研究。利用非线性动力学软件进行铝质柱形容器爆炸焊接数值模拟,得到各种焊接初始参数的影响规律,确定较佳焊接初始参数及容器结构尺寸,并进行实验验证。实验结果表明:外盖角度为7°时,1mm壁厚外盖配4mm壁厚内圆柱或2mm壁厚外盖配6mm壁厚内圆柱,配以较合适炸药厚度,密实焊接效果较理想。研究结果为深空探测采样容器结构设计提供了较好的参考。     

适用于共架武器的通用筒弹模拟系统应用研究

针对通用发控单元的维护需求和共架武器系统的训练需求,设计了通用筒弹模拟系统.该系统通过1553B总线与通用发控单元通信,实现了筒弹功能模拟和筒弹故障模拟.经测试,该系统运行稳定可靠,各项功能满足设计指标.     

液压水锤效应引起液体喷溅特性及其影响因素试验研究

为研究液压水锤效应引起的液体喷溅特性及其影响因素,进行了高速破片撞击充液容器的试验,测试了液体内的空腔振荡特性、压力分布特性和容器外的液体喷溅特性。试验结果表明:液压水锤效应引起的液体喷溅有两个不同的阶段。第一个阶段发生在空腔生长到最大体积后的400~700 μs内,喷溅液体的头部呈箭状;在第二个阶段出现多次形状相似的脉动喷溅,且单次脉动均发生在每次空腔溃灭之后,喷溅液体具有伞状头部与线状尾部。液体内的压力和侵彻孔的形态共同影响液体的喷溅速度,相对喷溅速度与破片的撞击速度成反比。喷溅液体在运动过程中存在速度波动,且随着喷溅次数的增加,液体喷溅速度逐渐下降,速度拐点出现的位置逐渐接近侵彻孔。     

面向大规模容器集群的网络控制技术

针对容器技术在网络层面缺乏控制的问题,设计一套面向大规模容器集群的网络控制架构,分别从容器集群网络的灵活组网、智能适配以及安全隔离三个方向进行研究,主要解决大规模容器集群部署中的网络适配和隔离控制等关键问题。实验结果表明,设计的网络控制架构可以根据网络特点有针对性地实现虚拟局域网的快速划分、网络节点的稳定迁移和节点通信的精确隔离控制。     

海港口岸犯罪分子利用集装箱偷渡的预防与控制

随着我国集装箱进出口贸易的迅猛增长和各地对偷渡活动严厉打击,不法分子开始尝试利用集装箱组织大规模偷渡,并渐呈上升和蔓延趋势,严重干扰了口岸正常的出入境秩序。从集装箱运输流程主要环节（装货、施封、存放、运输、装船）入手,通过分析当前海港口岸集装箱偷渡活动的特点及在集装箱管理过程中存在的问题,提出预防与控制集装箱偷渡的对策。     

Using container inspection history to improve interdiction logistics for illicit nuclear materials

Strengthening the United States' ability to prevent adversaries from smuggling nuclear materials into the country is a vital and ongoing issue. The prospect of additional countries, such as Iran, obtaining the know‐how and equipment to produce these special nuclear materials in the near future underscores the need for efficient and effective inspection policies at ports and border crossings. In addition, the reduction of defense and homeland security budgets in recent years has made it increasingly important to accomplish the interdiction mission with fewer funds. Addressing these complications, in this article, we present a novel two‐port interdiction model. We propose using prior inspection data as a low‐cost way of increasing overall interdiction performance. We provide insights into two primary questions: first, how should a decision maker at a domestic port use detection data from the foreign port to improve the overall detection capability? Second, what are potential limitations to the usefulness of prior inspection data—is it possible that using prior data actually harms decision making at the domestic port? We find that a boundary curve policy (BCP) that takes into account both foreign and domestic inspection data can provide a significant improvement in detection probability. This BCP also proves to be surprisingly robust, even if adversaries are able to infiltrate shipments during transit. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 433‐448, 2013     

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     

Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Optimally scheduling interfering and non‐interfering cranes

This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail‐mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium‐sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.