保密通信中同相和正交通道失衡对干扰抑制性能的影响

针对同时存在恶意干扰与非法窃听的通信环境,提出一种协作干扰(cooperative jamming, CJ)掩护的保密通信架构,收发信机之间采用跳频技术躲避恶意干扰,并采用协作干扰技术阻塞非法窃听。但该架构的通信带宽较大,会在收发频率振荡器中引起显著的同相和正交(in-phase and quadrature, IQ)通道失衡。鉴于此,对收发IQ通道失衡引起的信号失真进行数学建模,给出接收机处信干噪比的数学表达式,并给出干扰抑制比的闭合表达式。仿真结果表明,收发IQ通道失衡引起的信号失真的功率远大于热噪声功率。随着收发IQ通道失衡加剧,所提架构的信干噪比和干扰抑制比性能均会急剧下降,当幅度和相位失衡分别达到0.95和π/50时,信干噪比和干扰抑制比均损失了47 dB。     

潜艇上浮运动数值计算方法的研究与验证

预报潜艇上浮运动是探索研究潜艇上浮运动控制规律以及潜艇安全上浮的前提。就潜艇上浮运动的数值计算方法和计算流程进行了详细介绍,对数值计算方法中的湍流模型及离散格式等进行了优选。基于模型上浮试验结果,对数值计算的不确定度进行了分析且对数值计算结果进行了验证。证明了该数值计算的可靠性,并发现数值计算结果与试验结果很接近,验证了该数值计算方法的可行性,说明该数值计算方法和试验可为潜艇上浮运动的研究提供参考和借鉴。     

一类不确定大系统的分散变结构模型跟随控制

针对一类具有不确定参数和外界扰动的非线性大系统 ,在子系统互连项上界具有多项式形式的条件下 ,提出了一种分散变结构模型跟随控制器设计方案。该控制器不需要未知参数变化、外界扰动以及子系统互连上界的先验信息 ,能够通过自适应率对上述信息进行在线估计。在保证闭环大系统渐近稳定的条件下 ,同时实现了各个子系统滑动模态的存在性和可达性。理论分析和仿真结果验证了本文所提方案的有效性     

基因表达缺失值的加权回归估计算法

在基因芯片实验中,数据缺失客观存在,并在一定程度上影响芯片数据后续分析结果的准确性。在不增加实验次数的情况下,缺失值估计是降低缺失数据对后续分析影响的有效方法。利用相似性信息的核加权函数来实现缺失值回归估计的局部化,提出了基于加权回归估计的基因表达缺失值估计算法。在两个不同类型的基因芯片数据上,将新方法与几种已知的方法进行了比较分析。实验结果表明,新的估计算法具有比传统缺失值估计算法更好的稳定性和估计准确度。     

对辐射源信号到达角的自适应跟踪估计

为提高信号到达角(AOA)的测量精度,采用修正的窗函数加权平均算法和基于机动加速度的非零均值时间相关模型的自适应卡尔曼滤波算法,将信号到达角的变化轨迹看作是一种做加速度机动的运动,实现对连续变化信号到达角的参数估计.计算机仿真验证了算法的有效性和可行性,证明该方法有一定的应用价值.     

多输出性能下的重要性测度指标及其求解方法

针对基于马氏距离的重要性测度存在的问题,提出了基于谱分解加权摩尔彭罗斯马氏距离的重要性测度指标,通过构造多输出协方差阵的广义逆矩阵以及谱分解的策略,有效解决了协方差阵求逆奇异情况以及由于未能充分考虑多输出之间的相互关系而导致的错误识别重要变量的问题,克服了基于马氏距离指标的局限性。数值算例与工程算例结果表明:所提重要性测度可以更加准确地获得输入变量对结构系统多输出性能随机取值特征贡献的排序,从而为可靠性设计提供充分的信息。     

Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness

We study a parallel machine scheduling problem, where a job j can only be processed on a specific subset of machines M_j, and the M_j subsets of the n jobs are nested. We develop a two‐phase heuristic for minimizing the total weighted tardiness subject to the machine eligibility constraints. In the first phase, we compute the factors and statistics that characterize a problem instance. In the second phase, we propose a new composite dispatching rule, the Apparent Tardiness Cost with Flexibility considerations (ATCF) rule, which is governed by several scaling parameters of which the values are determined by the factors obtained in the first phase. The ATCF rule is a generalization of the well‐known ATC rule which is very widely used in practice. We further discuss how to improve the dispatching rule using some simple but powerful properties without requiring additional computation time, and the improvement is quite satisfactory. We apply the Sequential Uniform Design Method to design our experiments and conduct an extensive computational study, and we perform tests on the performance of the ATCF rule using a real data set from a large hospital in China. We further compare its performance with that of the classical ATC rule. We also compare the schedules improved by the ATCF rule with what we believe are Near Optimal schedules generated by a general search procedure. The computational results show that especially with a low due date tightness, the ATCF rule performs significantly better than the well‐known ATC rule generating much improved schedules that are close to the Near Optimal schedules. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 249–267, 2017     

用非概率理论分析混合不确定性结构的可靠性

针对不确定性结构可靠性分析中的输入变量分布参数具有不确定性和输入变量为区间模型的混合不确定性结构展开研究。考虑到可用信息最少的情况,将分布参数的不确定性描述为区间模型。通过等概率转换方法将随机变量与其分布参数进行分离,使问题转化为随机与区间变量混合的可靠性问题,建立了混合不确定性问题的可靠性分析模型。基于非概率可靠性理论,建立混合不确定结构分析模型的二级极限状态函数并结合Kriging代理模型建立了高效的求解方法。将所建立的混合不确定模型应用于飞行器结构的不确定性分析中,验证了所建模型的合理性和所提方法的高效性和准确性。     

Stochastic scheduling subject to machine breakdowns: The preemptive‐repeat model with discounted reward and other criteria

We consider the problem of scheduling a set of jobs on a single machine subject to random breakdowns. We focus on the preemptive‐repeat model, which addresses the situation where, if a machine breaks down during the processing of a job, the work done on the job prior to the breakdown is lost and the job will have to be started from the beginning again when the machine resumes its work. We allow that (i) the uptimes and downtimes of the machine follow general probability distributions, (ii) the breakdown process of the machine depends upon the job being processed, (iii) the processing times of the jobs are random variables following arbitrary distributions, and (iv) after a breakdown, the processing time of a job may either remain a same but unknown amount, or be resampled according to its probability distribution. We first derive the optimal policy for a class of problems under the criterion to maximize the expected discounted reward earned from completing all jobs. The result is then applied to further obtain the optimal policies for other due date‐related criteria. We also discuss a method to compute the moments and probability distributions of job completion times by using their Laplace transforms, which can convert a general stochastic scheduling problem to its deterministic equivalent. The weighted squared flowtime problem and the maintenance checkup and repair problem are analyzed as applications. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment

The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP‐hard, even without machine breakdowns; a branch‐and‐bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011