基于盲源分离的抗密集假目标干扰技术研究

密集假目标干扰会严重影响雷达检测目标的性能。针对此问题,提出一种基于盲源分离的密集假目标抗干扰的方法。该方法可有效从密集欺骗式假目标中检测出目标回波信号,并分析比较了JADE和Fast ICA两种盲源分离方法对密集欺骗式假目标和回波信号的分离效果。理论分析和仿真结果表明:JADE盲源分离较Fast ICA盲源分离抗密集假目标干扰较更有效。     

隋唐东北亚的地缘环境与政治博弈——以隋唐东征军事活动为中心的考察

从政治地理学理论视角看,隋唐东征军事活动反映了大陆地带、边缘地带和海洋地带三个地带上的军事政治力量角逐。隋唐王朝、高句丽和日本分别成为这三个地带的主导性力量,其中朝鲜半岛及其周边海域是东北亚的战略重心,而半岛西南部和黄海及对马海峡是这个重心区域的战略枢纽,当时的百济国则占据着边缘地带战略枢纽位置。正是在唐朝发展强大海上军事力量并控制百济之后,才实现了东征之役的战略突破,这也反映了海上力量对当地的战略影响举足轻重,在东北亚地缘环境中起到了特殊作用。     

求解CVRP问题的一种改进启发式蚁群算法

针对蚁群算法求解CVRP问题时收敛速度慢、求解质量不高的缺点,提出了一种改进启发式蚁群算法。该算法借鉴蚁群系统和基于排列的蚂蚁系统的优点设计信息素更新策略,既加强了对每次迭代最好解的利用,又避免了陷入局部最优;按一定比例使用基本方法和基于PFIH方法构造路径,扩大了算法的搜索空间;采用一种混合局部搜索算子,增强了算法局部寻优能力。实验结果表明,改进启发式蚁群算法可以大幅度减少车辆运行成本,具有较快的收敛速度。     

海水集料混凝土抗压强度及配合比试验研究

海水集料混凝土利用球形SAP形成内部球孔,是一种基于内部孔结构的新型混凝土。对水泥用量、球形SAP体积分数、水胶比和复合外加剂质量分数4个因素,各取4个水平进行正交试验,采用极差分析和方差分析归纳各因素对海水集料混凝土抗压强度的影响。结果表明:球形SAP体积分数对抗压强度的影响最大,其次是水泥用量和水胶比,复合外加剂质量分数的影响最小。在正交试验的基础上,将海水集料混凝土中球形SAP体积率视为孔隙率,得到一系列抗压强度的回归关系式,提出基于经验公式的海水集料混凝土配合比设计方法。     

三维均匀化理论预测多孔混凝土等效弹性模量

应用多尺度渐进展开的均匀化理论,推导三维均匀化理论的有限元解法,求解复合材料等效弹性系数。假设多孔混凝土由光滑均匀一致的球孔与水泥石基质组成,提出改进的随机投放方法,生成三维均匀化理论求解的随机单胞模型。以聚苯乙烯泡沫(EPS)混凝土为数值算例,生成6组不同体积分数的EPS混凝土随机单胞模型,通过三维均匀化理论的有限元法计算得到其等效弹性模量。计算结果表明:随机单胞模型能反映细观的非均质性,三维均匀化理论的有限元法计算得到的等效弹性模量变化趋势比较符合Miled的试验结果。     

传统建筑语言在现代观演建筑中的运用——以重庆人民大礼堂和美国肯尼迪表演艺术中心为例

多元文化冲击下,中国当代建筑创作更加注重对传统的继承。以重庆人民大礼堂和美国肯尼迪表演艺术中心为例,从建设背景、传统建筑语言的来源与运用手法、传统建筑语言与建筑功能的结合以及传统建筑语言对建构的表达4个方面进行分析,探讨传统建筑语言在现代观演建筑中运用面临的主要问题,以期为当今中国建筑师的设计实践提供参考。     

水顶油顺序输送油水混合模型研究

顺序输送是利用一条管道输送多种油品,因其可最大限度发挥管道输送潜能而被广泛应用。按照前后行液体不同可分为水顶油、油顶水和不同油品间顺序输送等,其中水顶油顺序输送主要用于管道撤收前的排空作业。对水顶油顺序输送油水混合过程进行了分析,建立了油水混合模型,利用CFD对其进行数值求解,并将仿真结果与前期理论分析进行了对比,两者吻合较好。所得结论可为机动管线水顶油排空作业提供科学指导。     

助飞鱼雷机动区域射击法攻潜能力研究

以飞航式助飞鱼雷为例,在分析助飞鱼雷攻潜过程的基础上,针对机动目标提出了在无指令修正情况下助飞鱼雷的机动区域射击法,并运用解析法对射击诸元进行解算。在建立助飞鱼雷作战能力仿真模型时,围绕捕获概率、鱼雷仿真和目标仿真等方面进行模型的构建,并采用蒙特卡罗方法进行仿真计算,分析采用机动区域射击方法时影响助飞鱼雷攻潜能力的主要因素及其规律,为更好发挥武器对机动目标的打击能力提供理论参考。     

Layers of Experiments with Adaptive Combined Design

In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015