Smart Power and Japan’s Self-Defense Forces

Abstract

From Iraq to the Gulf of Aden and the South Pacific, this paper evaluates how far theoretical ideas about smart power manifest in operational missions of the Japan Self-Defense Forces (JSDF). To function within a ‘smart’ power context, this paper suggests that JSDF operates in ‘assisting’ mode, rather than the ‘threatening’ behavior of ‘hard’ power. JSDF also deployed alongside other Japanese ‘soft’ power tools – diplomatic, cultural, developmental, and NGOs, using tailored programs for different cultural and geographical contexts. Given constitutional constraints and public sensitivity towards coercive force, JSDF missions could be integrated more into a ‘whole-of-government’ approach advancing foreign policy goals through ‘smart power’.     

水下地形辅助导航技术的研究与应用进展

在简要介绍水下地形辅助导航基本概念的基础上,从地形辅助导航算法、水下数字地图技术、水下地形辅助导航试验等方面,详细介绍了水下地形辅助导航所涉及各方面的主要问题及研究进展,并对下一步研究方向及应用做出指引与展望。     

AISI H13钢表面改性技术研究进展

用于加工铝合金、镁合金零部件的AISI H13热作模具钢因其恶劣的服役环境,现已表现出低寿命的致命缺陷.激光加热淬火工艺因兼有表面强化、残余应力低及与基底保持高的结合之特性,使AISI H13热作模具钢具有广阔的应用前景;激光熔覆合金化工艺因具有较强的表面可设计性与使用可靠性,使AISI H13热作模具钢具有巨大的发展潜力;热喷涂工艺具有流程短且涂层可设计性等优势,但因涂层与基底呈弱结合之状态,因此应在成分与工艺上进行涂层与基底之间热匹配设计,以满足工程应用的高性能化与长寿命化之需.     

UHMWPE纤维织物复合靶板抗弹性能研究

为研究不同织物结构的高性能纤维材料复合时的抗弹性能,采用超高分子量聚乙烯(Ultra-high Molecular Weight Polyethylene,UHMWPE)纤维单向无纬(Unidirectional,UD)布及2维(2D)织物制备UD布/2D织物复合靶板,并根据GA141-2010标准对其进行靶试试验。结果表明:UD布/2D织物的复合结构能够有效抵御7.62 mm手枪弹侵彻,且2D织物部分在弹丸侵彻之后纤维并未被严重破坏,将其与UD布复合后,有利于抵御多发弹的侵彻。     

一种基于OFDM的星载交换技术

正交频分复用(OFDM)是卫星通信中备受关注的新技术之一,文章提出了一种全新的基于OFDM的星载交换技术,该星载交换中将有利于地面无线通信系统与卫星通信系统的融合,并具有频谱利用率高、适应性强等特点。文中介绍了此星载交换技术的基本方案,并对实现此星载交换技术需要面临的主要问题以及针对这些问题的解决方案进行了讨论。     

基于灰色决策的地形辅助导航区域选取方法

为避免仅利用单一地形特征参量对匹配区域可导航能力评判的不全面性,提出了一种基于灰色决策的多指标综合选取方法。首先,计算待选地形区域的地形标准差、地形熵、粗糙度及地形相关系数等表征地形特征的统计参量;然后,利用计算结果构建地形可导航性指标矩阵,通过无量纲化和归一化去除重叠信息;最后,求解理想决策并将决策向量投影于其上,得到地形可导航性评价。仿真表明:基于灰色决策的匹配区域选取方法能够兼顾不同特征参量所表征的地形固有属性,给出正确评价,且评价结果不受待选区域数目的限制。     

基于水下地形匹配的捷联系统误差估计方法

潜器进入匹配区时捷联系统已积累了一定的误差,有效利用匹配信息对误差进行修正是保证后续航行精度的基础;通过建立水下地形匹配辅助导航系统误差模型,以地形匹配模块和深度压力传感器测量的位置信息和深度作为量测量,设计了卡尔曼滤波器。仿真研究证明:所设计的滤波器具有良好的估计精度;同时,通过设计潜器航行动作证明了相关误差量的估计效果与潜器运动激励有关,为匹配区内进行误差估计时潜器所采用的运动状态提供了参考。     

体目标条件下反潜鱼雷命中目标模型

针对反潜鱼雷末弹道精确仿真要求,提出将反潜鱼雷与其攻击目标同时作为体目标的方法.通过确定3个基本坐标系,建立了反潜鱼雷与其攻击对象相应的三维体目标模型,在此基础上推导了基本坐标系之间的坐标变换矩阵.通过分析反潜鱼雷末弹道特性,推导了命中目标的判断过程与实现流程,同时定义了相关命中目标要素.仿真计算结果表明:该模型能够真...     

三维交互模拟系统动态数据实时管理研究

针对三维交互模拟系统常用数据管理方式存在的系统资源开销大、属性数据不能动态修改等问题,将XML运用到三维交互模拟系统的数据管理中,能够很好地解决在三维交互全景漫游中对动态数据的实时修改难题。以所研制的油库三维交互模拟系统为例,提出了基于Java编程实现对XML文档进行解析的技术方案,分析了设备设施类型维护、设备设施名称及对应属性名增加、设备设施属性值实时修改的实现方法。该方法能够扩展三维交互模拟系统的功能和应用范围。     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016