视频传输中非平衡与平衡转换研究

介绍了平衡式与非平衡式传输的概念,对非平衡与平衡转换的实现方法进行分析,在此基础上提出了一种基于集成电路AD8130和AD8131的解决方案。     

具有不完全信息语言多指标电子对抗计划优选方法

针对指标权重信息不完全且指标值为语言评价信息的电子对抗行动计划优选问题,给出了一种新的决策分析方法。首先建立并规范化了电子对抗行动计划的评价指标;其次给出了计划的优选步骤,其核心是通过计算理想点与计划值的距离、建立线性规划模型,确定指标权重;将语言评价信息转化为三角模糊数,相应地建立可能度,进而获得计划的综合评价值。最后通过算例分析说明了该方法的合理性和有效性。     

基于HLA-Virtools的某型便携式防空导弹武器系统仿真平台研究

针对武器系统模拟训练平台研发周期长、系统逼真度和沉浸感较差等问题,提出了基于分布交互仿真高层体系结构(HLA)与虚拟现实开发平台(Virtools)相结合的设计方法.在给出某型便携式防空导弹武器系统仿真平台的总体设计后,针对该仿真系统设计中的关键技术进行了深入探究,基于此方法设计了某型便携式防空导弹武器系统的仿真平台.     

THE MORAL PERMISSIBILITY OF AUTOMATED RESPONSES DURING CYBERWARFARE

Automated responses are an inevitable aspect of cyberwarfare, but there has not been a systematic treatment of the conditions in which they are morally permissible. We argue that there are three substantial barriers to the moral permissibility of an automated response: the attribution, chain reaction, and projection bias problems. Moreover, these three challenges together provide a set of operational tests that can be used to assess the moral permissibility of a particular automated response in a specific situation. Defensive automated responses will almost always pass all three challenges, while offensive automated responses typically face a substantial positive burden in order to overcome the chain reaction and projection bias challenges. Perhaps the most interesting cases arise in the middle ground between cyber-offense and cyber-defense, such as automated cyber-exploitation responses. In those situations, much depends on the finer details of the response, the context, and the adversary. Importantly, however, the operationalizations of the three challenges provide a clear guide for decision-makers to assess the moral permissibility of automated responses that could potentially be implemented.     

卫星通信新技术专题讲座(三) 第6讲 卫星移动通信系统中双Chirp同步方法

由于卫星和通信终端之间的相对运动,卫星移动通信系统中信号传播过程中会引入多普勒频移和传播时延,这些均要求系统必须能够快速实现同步。文章介绍了一种适用于卫星移动通信系统的,基于双Chirp的信号检测和同步方案。计算机仿真结果表明该方案能够迅速、准确地实现信号检测并估计出信号中的多普勒频移和传播时延,实现系统的快速同步,且工作门限较低。     

卫星通信系统中基于LDPC编码协同性能研究

文章提出在卫星移动通信系统中应用编码协同策略。分别建立卫星上、下行用户链路编码协同模型,仿真Rayleigh信道和Rician信道下基于LDPC编码的系统性能,并与单路未协同和传统两发一收分集系统进行性能比较。理论分析和仿真表明,采用LDPC编码协同策略相对于非协同时的系统性能有较大提升,虽然与分集系统性能有一定差距,但是其终端实现比较简单,在未来卫星移动通信系统中具有一定的应用前景。     

Book reviews

Frank Zimmer, Bismarcks Kampf gegen Kaiser Franz Joseph Konigsgratz und seine Folgen. Graz, Vienna, Cologne: Styria Verlag 1996. Pp.203,49 illus., 1 map. OS 350/DM 49. ISBN 3–222–12377–2.

Saul Zadka, Blood in Zion: How the Jewish Guerrillas drove the British out of Palestine. London and Washington: Brassey's, 1995. Pp.227, chron., illus., index. £19.95. ISBN 1–85753–136–1.

Theodore L. Gatchel, At the Water's Edge: Defending against the Modern Amphibious Assault. Annapolis, MD: Naval Institute Press, 1996. Pp.xvi+217, notes, biblio, index. $36.95. ISBN 1–55750–308–7.

Max G. Manwaring and William J. Olson (eds.) Managing Contemporary Conflict: Pillars of Success. Boulder, CO: Westview Press, 1996. Pp.269, no index. $65 (cloth); $25 (paper). ISBN 0–8133–8969 and 9978–5

Chris Seiple, The US Military/NGO Relationship in Humanitarian Interventions, Carlisle Barracks, PA: The

Richard L. Millett and Michael Gold‐Biss (eds.) Beyond Praetorianism: The Latin American Military in Transition. University of Miami: North/South Center Press; Boulder, CO: Lynne Rienner, 1996. Pp.xv +317, index. $24.95. ISBN 1–5745–000–9.

Rudolph C. Barnes Jr, Military Legitimacy: Might and Right in the New Millennium. London and Portland, OR: Frank Cass, 1996. Pp.199, select biblio., index. £27.50/$39.50, ISBN 0–714–4624–5.     

Limiting behavior of the stochastic sequential assignment problem

The stochastic sequential assignment problem (SSAP) considers how to allocate available distinct workers to sequentially arriving tasks with stochastic parameters such that the expected total reward obtained from the sequential assignments is maximized. Implementing the optimal assignment policy for the SSAP involves calculating a new set of breakpoints upon the arrival of each task (i.e., for every time period), which is impractical for large‐scale problems. This article studies two problems that are concerned with obtaining stationary policies, which achieve the optimal expected reward per task as the number of tasks approaches infinity. The first problem considers independent and identically distributed (IID) tasks with a known distribution function, whereas in the second problem tasks are derived from r different unobservable distributions governed by an ergodic Markov chain. The convergence rate of the expected reward per task to the optimal value is also obtained for both problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013