基于Bell态与Two-qutrit态无信息泄漏的量子对话协议

基于Einistein-Podolsky-Rosen纠缠对与量子安全直接通信(QSDC),提出了一个新的基于Bell态的量子对话协议.通信双方Alice和Bob只需要进行一次通信即可实现双方之间秘密的同时交换.该方案利用一个随机比特串和检测光子来实现安全性,能够抵抗截获/重放攻击、特洛伊木马攻击和纠缠攻击等典型攻击.很多近期提出的协议中存在严重的信息泄漏,也就是说任何窃听者都可以从合法通信者的公开声明中提取到部分秘密信息,我们的方案很好地克服了这一问题.协议的效率较高,可以达到66.7％,同时由于纠缠态粒子只需要进行一次传输,该方案更简单易行.将该协议推广到two-qutrit态,其安全性仍能得到保证.     

LDPC编码跳频通信系统中的迭代抗干扰抑制算法研究

文中讨论 LDPC 码在抗干扰跳频通信中的应用问题。在接收机几乎没有任何信道先验知识(包括信噪比/信干扰比,部分频带干扰信息等)的假设下,推导了一种新的鲁棒检测算法。该鲁棒检测算法与最小和迭代解码算法结合可成功用于 LDPC 码的有效接收,性能逼近理想不可实现条件下的最佳检测算法。     

电磁信息泄漏研究及进展

分析了电磁信息泄漏的机理,介绍了电磁信息泄漏的发展历史和趋势,阐述了电磁信息泄漏的基本概念和主要研究内容。针对P89C668单片机实现的DES密码系统,采用差分电磁分析的方法对其进行密码破译实验,获得了DES第16轮48 bit子密钥。     

武器系统电磁信息泄漏与防护初探

在论述了电磁泄漏所带来的影响的基础上,初步探讨了武器系统的电磁信息泄漏机理,论述了进行电磁泄漏防护的相关方法,展望了下一步需要继续研究的相关内容。     

单向拓扑下基于DMPC与改进APF的水面无人艇编队运动控制算法

多水面无人艇编队运动控制是多水面无人艇智能化的核心技术,也是当前研究的热点。重点讨论了编队部分成员无法获得编队平衡先验信息条件下的水面无人艇编队运动控制问题。首先,针对编队先验信息不平衡条件下无人艇编队保持困难的问题,将领航–跟随结构与分布式模型预测控制算法结合,通过设定通信优先级和单向拓扑结构,在分布式模型预测控制算法中引入假设状态空间和平衡状态空间,以实现部分跟随者无法获取编队平衡先验信息情况下的无人艇编队保持;其次,针对编队航行过程中障碍物规避安全性不足的问题,将改进的人工势场法与模型预测控制相结合,设计了无人艇自主避障控制器,提升了编队航行过程的安全性;最后,通过仿真平台对所提方案的可行性进行了验证。所提方法可以为进一步研究复杂环境下多水面无人艇编队运动控制提供参考。     

密码芯片电磁信息泄漏评估方法研究

基于半定制集成电路设计流程,提出一种对CMOS集成电路进行电磁信息泄漏评估的方法。该方法首先利用综合工具生成电路的门级网表,将门级网表中的普通单元替换为防护逻辑单元,然后利用电磁辐射仿真模型和电磁信息泄漏评估模型对集成电路进行电磁辐射仿真和信息泄漏分析。该方法能够在设计阶段对密码芯片的抗电磁旁路攻击能力进行评估,可提高密码芯片的设计效率,减少资源浪费。     

机动通信中信息传输质量保证方法

文章针对机动通信中各业务信息传输质量问题,提出了一种信息传输QoS体系结构,并通过对QoS需求分析及参数映射,给出了适用于机动通信条件下信息交换的信息传输服务的管理与控制方法。     

一体化联合作战中的信息动员

未来一体化联合作战,是一场信息化程度很高的局部战争,信息领域对抗异常激烈。只有充分利用信息动员优势,充分发挥地方信息资源潜力,增强信息作战和信息保障能力,才能在一体化联合作战中夺取制信息权。 一、信息网络资源动员 一体化联合作战,作战空间广阔,作战力量多元,指挥协同复杂,既设的国防信息网络无法也不可能完全覆盖整个战场。因此,要确保联合作战指挥通信顺畅,必须开展信息网络资源动员。一是要实现军地通信网络互联互通。民用固定通信设施覆盖面广,通信容量大,网络密度高,应充分加以利用。可将军用信息枢纽与民用信息枢纽相连接…     

军事战术数据链信息传输技术研究

对军事战术数据链信息传输技术进了研究,从"无线通信系统"角度论述数据链信息的传输与通信技术。介绍了数据链信息传输频段与信号传播方式;给出了数据链通信系统的一般模型,论述了数据链通信传输中涉及的编解码技术、调制解调技术、复用复接技术、通信安全与抗干扰等技术;并对战术数据链发展趋势进行讨论。     

作战飞机信息通信方法

通过对作战飞机信息通信方法的研究,指出了作战飞机进行信息通信的两种方法-语音通信和数码通信;并分析了数码通信的硬件结构和机载通信的硬件设备的工作原理.探讨了未来的网络中心战中基于网络化数码通信的方法,为未来空战基于网络中心战技术的实际应用奠定基础.     

Statistical decision analysis of stochastic linear programming problems

This paper presents a statistical decision analysis of a one-stage linear programming problem with deterministic constraints and stochastic criterion function. Procedures for obtaining numerical results are given which are applicable to any problem having this general form. We begin by stating the statistical decision problems to be considered, and then discuss the expected value of perfect information and the expected value of sample information. In obtaining these quantities, use is made of the distribution of the optimal value of the linear programming problem with stochastic criterion function, and so we discuss Monte Carlo and numerical integration procedures for estimating the mean of this distribution. The case in which the random criterion vector has a multivariate Normal distribution is discussed separately, and more detailed methods are offered. We discuss dual problems, including some relationships of this work with other work in probabilistic linear programming. An example is given in Appendix A showing application of the methods to a sample problem. In Appendix B we consider the accuracy of a procedure for approximating the expected value of information.     

Adjacency‐based local top‐down search method for finding maximal efficient faces in multiple objective linear programming

It is well‐known that the efficient set of a multiobjective linear programming (MOLP) problem can be represented as a union of the maximal efficient faces of the feasible region. In this paper, we propose a method for finding all maximal efficient faces for an MOLP. The new method is based on a condition that all efficient vertices (short for the efficient extreme points and rays) for the MOLP have been found and it relies on the adjacency, affine independence and convexity results of efficient sets. The method uses a local top‐down search strategy to determine maximal efficient faces incident to every efficient vertex for finding maximal efficient faces of an MOLP problem. To our knowledge, the proposed method is the first top‐down search method that uses the adjacency property of the efficient set to find all maximal efficient faces. We discuss this and other advantages and disadvantages of the algorithm. We also discuss some computational experience we have had with our computer code for implementing the algorithm. This computational experience involved solving several MOLP problems with the code.     

临近空间拦截弹最优弹道跟踪制导律

针对拦截临近空间高超声速飞行器的弹道跟踪过程,基于线性二次型调节器理论和高斯伪谱法设计一种跟踪制导律。为了对标称弹道进行精确跟踪,考虑线性二次型跟踪问题,应用最优控制理论推导最优解的充要条件,得到带时变增益的线性状态反馈控制量的表达式;基于高斯伪谱法,在离散的勒让德-高斯点上利用标称弹道数据计算差分矩阵和系数矩阵,求得状态扰动反馈控制律。仿真结果表明,与基于求解矩阵黎卡提方程的方法相比,该方法选取较少的节点即可获得高精度的反馈控制量,且运算效率大幅提高,满足在线实施要求。     

多元线性模型的广义逆诊断问题

在实际问题中,经常需要考虑多个因变量对多个自变量的相互依赖关系,但在运算过程中经常会碰到奇异矩阵不能求逆的问题.通过推导任意2矩阵的差的广义逆,解决了这一问题,继而得出多元线性模型的参数估计,最后推出数据删除模型异常点的判断依据.     

战略导弹制导系统精度评估方法及应用研究

本文论述了战略导弹制导系统精度评估方法,并分析了影响制导精度的各种因素;在定性分析的基础上,建立了制导系统的误差模型,并将此模型归纳为线性回归模型;最后,对目前所采用的误差分离方法进行了分析和比较,并将模型参考自适应思想与岭估计方法相结合,形成了模型参考自适应广义岭估计方法,为解决制导系统误差分离问题提供了一条有效途径。     

Progressive Type‐II censoring and coherent systems

A new connection between the distribution of component failure times of a coherent system and (adaptive) progressively Type‐II censored order statistics is established. Utilizing this property, we develop inferential procedures when the data is given by all component failures until system failure in two scenarios: In the case of complete information, we assume that the failed component is also observed whereas in the case of incomplete information, we have only information about the failure times but not about the components which have failed. In the first setting, we show that inferential methods for adaptive progressively Type‐II censored data can directly be applied to the problem. For incomplete information, we face the problem that the corresponding censoring plan is not observed and that the available inferential procedures depend on the knowledge of the used censoring plan. To get estimates for distributional parameters, we propose maximum likelihood estimators which can be obtained by solving the likelihood equations directly or via an Expectation‐Maximization‐algorithm type procedure. For an exponential distribution, we discuss also a linear estimator to estimate the mean. Moreover, we establish exact distributions for some estimators in the exponential case which can be used, for example, to construct exact confidence intervals. The results are illustrated by a five component bridge system. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 512–530, 2015     

对战场信息优势的定量分析*

战场信息优势是一个非常复杂和抽象的概念,也是信息作战研究中的一个重要的课题。首先论述了战场信息优势的定义及内涵。在此基础上,利用信息熵的概念建立了感知态势的定量模型。从位置探测入手,运用信息度量及信息熵的方法,从定量的角度对战场信息优势和制信息权进行了初步的探讨。     

潜艇线式巡逻的最佳对策研究

本文先用面积法求出线式巡逻潜艇发现目标的概率,然后对潜艇发现目标距离作了分析。在此基础上,建立了潜艇线式巡逻的矩阵对策模型,并用计算机对此模型进行求解,得到了潜艇线式巡逻的最佳对策。最后,对最佳对策作了讨论。本文建立的矩阵对策模型和求得的结果以及求解方法可为组织潜艇进行线式巡逻提供决策的科学依据。     

Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance

The machine scheduling literature does not consider the issue of tool change. The parallel literature on tool management addresses this issue but assumes that the change is due only to part mix. In practice, however, a tool change is caused most frequently by tool wear. That is why we consider here the problem of scheduling a set of jobs on a single CNC machine where the cutting tool is subject to wear; our objective is to minimize the total completion time. We first describe the problem and discuss its peculiarities. After briefly reviewing available theoretical results, we then go on to provide a mixed 0–1 linear programming model for the exact solution of the problem; this is useful in solving problem instances with up to 20 jobs and has been used in our computational study. As our main contribution, we next propose a number of heuristic algorithms based on simple dispatch rules and generic search. We then discuss the results of a computational study where the performance of the various heuristics is tested; we note that the well‐known SPT rule remains good when the tool change time is small but deteriorates as this time increases and further that the proposed algorithms promise significant improvement over the SPT rule. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

维修性试验验前信息融合方法

针对小子样维修性试验因数据异总体而导致验前信息融合精度低的问题,提出了基于信息可用度的验前信息折合模型,解决了因数据异总体无法融合的问题;利用随机加权法对验前分布参数进行了拟合,准确地表述了验前分布;提出了基于支持度的融合权值确定方法,提高了各验前分布融合权值分配的合理性;最后,通过某装备维修性试验验前信息融合实例,表明了该方法具有一定的工程应用价值。