楔形变截面钢-混凝土组合梁弯曲和自由振动的求积元分析

基于改进的Newmark组合梁模型和平面应力模型分别建立考虑界面滑移的楔形变截面钢-混凝土组合梁的一维和二维求积元单元。对组合梁的弯曲、自由振动问题进行计算分析,将两类单元的计算结果进行比较和讨论。结果表明,对于工程结构中常见的楔形变截面组合梁的弯曲问题,可以采用自由度较少,计算成本较低的一维模型;对于自由振动问题,一维模型可以较为准确地描述一阶振动模态;若需对高阶振动模态进行分析,可选用更为准确的二维模型。     

Clustered coverage orienteering problem of unmanned surface vehicles for water sampling

This study investigates a clustered coverage orienteering problem (CCOP), which is a generalization of the classical orienteering problem. The problem is widely motivated by the emerging unmanned techniques (eg, unmanned surface vehicles and drones) applied to environmental monitoring. Specifically, the unmanned surface vehicles (USVs) are used to monitor reservoir water quality by collecting samples. In the CCOP, the water sampling sites (ie, the nodes) are grouped into clusters, and a minimum number of nodes must be visited in each cluster. With each node representing a certain coverage area of the water, the objective of the CCOP is to monitor as much as possible the total coverage area in one tour of the USV, considering that overlapping areas provide no additional information. An integer programming model is first formulated through a linearization procedure that captures the overlapping feature. A two-stage exact algorithm is proposed to obtain an optimal solution to the problem. The efficiency and effectiveness of the two-stage exact algorithm are demonstrated through experiments on randomly generated instances. The algorithm can effectively solve instances with up to 60 sampling sites.     

基于双波段红外辐射信息的红外机动目标跟踪算法

利用双波段IRST系统测到的目标双波段红外辐射信息,推导出目标的伪距离量测信息,使得单站IRST系统变为可观测系统;在此基础上,构建了伪量测方程,采用改进的"当前"统计模型和基于最小偏度单形采样策略的UKF算法,提出了一种基于双波段红外辐射信息的IRST机动目标跟踪算法。理论分析与仿真结果表明,该算法能够有效地跟踪机动目标,具有良好的实际应用价值。     

加权随机模拟的时变可靠性分析方法

针对结构时变可靠性的随机模拟分析方法计算代价大的问题,在极值方法的基础上提出基于加权随机模拟的时变可靠性分析策略.时变可靠性分析需要计算在不同时间处的失效概率,通常需要进行多次可靠性分析,计算代价巨大.所提方法通过对常规静态可靠性的随机模拟方法进行改进拓展,运用加权策略分别发展了加权蒙特卡洛法和加权重要抽样法,使之能够...     

复杂网络波动扩展衍射欠定采样预测模型

复杂网络环境中对网络波动的准确预测可以有效监测网络环境,防范网络入侵和拥堵。由于在复杂网络受到干扰的可能性更大,其网络波动具有扩展衍射特征,不可预测性强。传统方法中采用自回归移动平均模型进行复杂网络波形预测算法设计,在波动信号的时频重叠调制过程中未能纳入杂波先验信息,波动序列的扩展衍射特征形成欠定采样,预测效果不好。提出基于空间扩展自回归移动平均模型的复杂网络波动欠定预测算法,采用LTE线性均衡滤波,进行降噪去除杂波干扰,提取波动序列的扩展衍射特征形成欠定采样样本序列,设计网络波动时空序列扩展衍射点阵,准确预测网络波动的参数信息。以病毒入侵,网络监听和拥塞堵塞等波动产生模型为实例,进行仿真实验,结果表明该算法具有较高预测精度,监测点波动误差较小,实现复杂网络波动状态的动态跟踪和评估。     

Bayesian inference for a Lanchester type combat model

We undertake inference for a stochastic form of the Lanchester combat model. In particular, given battle data, we assess the type of battle that occurred and whether or not it makes any difference to the number of casualties if an army is attacking or defending. Our approach is Bayesian and we use modern computational techniques to fit the model. We illustrate our method using data from the Ardennes campaign. We compare our results with previous analyses of these data by Bracken and Fricker. Our conclusions are somewhat different to those of Bracken. Where he suggests that a linear law is appropriate, we show that the logarithmic or linear‐logarithmic laws fit better. We note however that the basic Lanchester modeling assumptions do not hold for the Ardennes data. Using Fricker's modified data, we show that although his “super‐logarithmic” law fits best, the linear, linear‐logarithmic, and logarithmic laws cannot be ruled out. We suggest that Bayesian methods can be used to make inference for battles in progress. We point out a number of advantages: Prior information from experts or previous battles can be incorporated; predictions of future casualties are easily made; more complex models can be analysed using stochastic simulation techniques. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 541–558, 2000     

罗兰C信号模拟器的设计与实现

运用数控技术产生罗兰C信号 ;通过对罗兰C脉冲的傅立叶分析和采样分析 ,确定仪器所用的采样频率和滤波器 ,给出了设计及实现罗兰C信号模拟器的原理     

Sequential and systematic sampling plans for the Markov‐dependent production process

Acceptance sampling plans are used to assess the quality of an ongoing production process, in addition to the lot acceptance. In this paper, we consider sampling inspection plans for monitoring the Markov‐dependent production process. We construct sequential plans that satisfy the usual probability requirements at acceptable quality level and rejectable quality level and, in addition, possess the minimum average sample number under semicurtailed inspection. As these plans result in large sample sizes, especially when the serial correlation is high, we suggest new plans called “systematic sampling plans.” The minimum average sample number systematic plans that satisfy the probability requirements are constructed. Our algorithm uses some simple recurrence relations to compute the required acceptance probabilities. The optimal systematic plans require much smaller sample sizes and acceptance numbers, compared to the sequential plans. However, they need larger production runs to make a decision. Tables for choosing appropriate sequential and systematic plans are provided. The problem of selecting the best systematic sampling plan is also addressed. The operating characteristic curves of some of the sequential and the systematic plans are compared, and are observed to be almost identical. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 451–467, 2001     

Adaptive importance sampling for extreme quantile estimation with stochastic black box computer models

Quantile is an important quantity in reliability analysis, as it is related to the resistance level for defining failure events. This study develops a computationally efficient sampling method for estimating extreme quantiles using stochastic black box computer models. Importance sampling has been widely employed as a powerful variance reduction technique to reduce estimation uncertainty and improve computational efficiency in many reliability studies. However, when applied to quantile estimation, importance sampling faces challenges, because a good choice of the importance sampling density relies on information about the unknown quantile. We propose an adaptive method that refines the importance sampling density parameter toward the unknown target quantile value along the iterations. The proposed adaptive scheme allows us to use the simulation outcomes obtained in previous iterations for steering the simulation process to focus on important input areas. We prove some convergence properties of the proposed method and show that our approach can achieve variance reduction over crude Monte Carlo sampling. We demonstrate its estimation efficiency through numerical examples and wind turbine case study.     

在线学习的主用户仿冒攻击策略

在认知无线网络中,次用户通过频谱感知来学习频谱环境,从而接入那些没有被主用户占用的频谱空隙。事实上,多种恶意攻击的存在会影响次用户频谱感知的可靠性。只有深入研究恶意攻击策略,才能确保认知无线网络的安全。基于此,研究了一种认知无线网络中的欺骗性干扰策略,即主用户仿冒攻击策略,该攻击策略通过在信道上传输伪造的主用户信号来降低次用户频谱感知的性能。具体来说,将攻击策略问题建模为在线学习问题,并提出基于汤普森采样的攻击策略以实现在探索不确定信道和利用高性能信道间的权衡。仿真结果表明,与现有的攻击策略相比,提出的攻击策略能更好地通过在线学习优化攻击决策以适应非平稳的认知无线网络。