基于圆形滤波器HOG特征的航拍图像车辆快速检测算法

航拍图像中车辆一般近似为矩形结构,因此通过统计检测窗口中的梯度方向直方图并根据梯度主方向估计车辆朝向,然后将检测窗口旋转到相应方向进行分类器判别。车辆检测采用级联boosting分类器和梯度方向直方图特征(HOG,Histograms of Orient Gradient),针对旋转窗口中HOG特征的计算,设计了一种基于圆形滤波器的HOG(Circle Filter based HOG,CFHOG)特征,与传统基于积分直方图的HOG特征提取方法相比,显著提高了旋转窗口中HOG特征的计算效率,此外在计算每个像素的梯度时采用查找表代替梯度向量的求模和角度计算也减小了计算量。使用真实图像进行的实验表明本文车辆检测算法快速高效。     

基于警报关联的威胁行为检测技术综述

基于警报关联的网络威胁行为检测技术因其与网络上大量部署的安全产品耦合,且能充分挖掘异常事件之间的关联关系以提供场景还原证据,正成为复杂威胁行为检测的研究热点。从威胁行为和网络安全环境的特点出发,引出威胁行为检测的应用需求和分类,介绍基于警报关联的威胁行为检测的基本概念和系统模型;重点论述作为模型核心的警报关联方法,并分类介绍了各类典型算法的基本原理和特点,包括基于因果逻辑的方法、基于场景的方法、基于相似性的方法和基于数据挖掘的方法;并结合实例介绍了威胁行为检测系统的三种典型结构,即集中式结构、层次式结构和分布式结构;基于当前研究现状,提出了对未来研究趋势的一些认识。     

Assessing the value of demand sharing in supply chains

We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014     

利用时间窗权重进行航迹关联

提出一种利用传感器测量数据的时间窗权重进行航迹关联的方法,将目标运动状态的多维向量(如距离、方位角、俯仰角等)分解为多个一维状态标量;根据每个状态标量与时间的关系,提取两条航迹的共同测量时间区间,将其划分为若干个时间窗,计算对应时间窗内的权重;根据时间窗权重差计算每一个状态标量的航迹相似度;应用DS理论或Bayes理论进行航迹关联决策。     

基于网络演算理论计算车电系统总线的最大时延

以车电系统总线为研究对象,以网络演算理论为数学工具,提出一种基于网络演算理论的车电系统总线的最大时延计算模型.通过仿真实验得到了车电系统总线中各个信息帧的到达曲线、高优先级的信息帧集合的到达曲线、服务曲线和最大时延的数值结果.与相关研究相比,所建模型输入参数少,计算量小,可以快速求解车电系统总线的最大时延,具有良好的适应性和通用性,可以作为车电系统总线分析、设计与优化的理论支持工具.     

氦原子1S, 3S, 1P, 3P态的电子关联计算

本文从二次量子化公式出发,选取广义Laguerre多项式乘以γ~lcxp(-alγ)作为单电子径向函数完全集,这里a_l是依赖于轨道角动量l的变分参数,用组态相互作用方法计算了氨原子~1S,~3S,~1P,~3P态的能量和波函数。当组态限于主量子数n≤4,计算的能量相对精度约为99.9%;当组态限于%≤6,能量相对精度约为99.99%;而Hartree Fock方法的能量相对精度约为99%,利用原子波函数计算了一些原子参数,其结果与其他作者的结果符合很好。     

A note on scheduling parallel machines subject to breakdown and repair

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ C_j, the makespan C_max, and the maximum lateness L_max. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

非平稳高斯序列最大值的几乎处处中心极限定理

在较弱的条件下,研究了一类非平稳高斯序列的几乎处处中心极限定理.设{Xa,n≥1}为一非平稳高斯序列,记其协方差为rij=Cov(Xi,Xj).假设该序列满足如下条件:对充分大的n,若存在0<α<1当|i-j|>nα时,rijlog|j-i|(l0glog|j-i|)1+ε一致有界.在这一条件下,通过利用概率极限理论,...     

一种网络设备告警事件纵向关联方法的设计与实现

现有的网络事件关联系统主要存在以下不足:各被管设备感知的大量告警事件全部传送到管理端处理,会带来很多传输与事件管理问题;现有的网络事件关联方法很不成熟,一般只涉及底层协议告警事件的关联.在分析网络告警与故障关系的基础上,提出了一种在设备这一级驻留代理,采用贝叶斯网络推理技术完成包括应用层告警事件在内的本地告警事件纵向关联方法.并在描述协议栈各层协议实体模型的基础上,给出了利用AdventNet API和ebayes进行系统具体实现的方法.     

基于二进小波变换的噪声图像自适应增强新算法

针对图像增强算法通常会放大原图像中噪声分量的问题,提出了一种基于二进小波变换的图像增强新算法。该算法充分利用了二进小波变换的平移不变性和各尺度上小波系数间的相关性,有效改善了增强过程中噪声放大和边缘失真问题。此外,算法具有高度的自适应能力,适用性更强。实验结果表明,与目前已有的各类多尺度图像增强算法相比,该算法在抑制噪声和凸显图像特征两方面均有明显改进。