Gamma-Gamma信道下OOK与DPSK调制误码性能分析

从理论和实验两方面对自由空间光通信中常用的两种调制方式进行性能比较分析,旨在找出一种最适合的调制方法抑制大气湍流。在分析Gamma-Gamma信道下OOK(开关键控)和DPSK(差分相移键控)调制的误码率时,将广义超几何方法引入分析。利用Matlab软件搭建系统,通过实验可知,采取相干及平衡探测的DPSK调制时性能要比基于OOK调制的直接探测高出3.21dB;通过对双管平衡探测和单管探测进行实验,结果表明,双管平衡探测的信噪比优于单管探测,约提高21.6dB。因此,基于DPSK平衡探测的相干通信方案具有可行性和优越性。     

SAC OCDMA系统FOC地址码设计及性能研究

设计了一种新的适合同步光谱幅度编码光码分变址(Spectral-amplitude coding optical code division multiple access,SAC OCDMA)系统的地址码,能够使多址干扰产生的误码率为0.且该地址码的互相关限为1,在给定码重和用户数的情况下能够得到较小码长,便于系统的编解码。利用OptiSys 7.0设计出仿真系统,分析比较用波分复用器和光纤光栅作为编解码器适用的不同系统,在考虑散弹噪声、相位引起的强度噪声(PIIN)和热噪声的情况下,根据该地址码的特点分析整个编解码系统的信噪比和误码率,并与现有的SAC地址码性能进行比较.结果表明:选用该地址码的SAC OCDMA系统得到的眼图更为理想,在系统误码率、编解码实现,及系统性能上都有了很大的提高。     

网络入侵检测系统中的漂移检测

目前基于机器学习的入侵检测系统大都建立在入侵数据始终保持统计平稳的假设之上,无法应对攻击者有意改变数据特性或新型攻击方式的出现,而导致的检测率下降的状况.对于上述问题,即攻击漂移,提出了加权Rényi距离的检测方法.在KDD Cup99数据集上的实验证明,Rényi距离可以有效地增强检测效果;在检测到漂移后,通过重新训练模型可以使得对攻击的识别率显著提高.     

Optimal Groomings with Grooming Ratios Six and Seven

Grooming uniform all‐to‐all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C‐groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C‐grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6‐grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7‐grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.     

The frequency of CFVD speed report for highway traffic

The control signals of cellular networks have been used to infer the traffic conditions of the road network. In particular, consecutive handover events are being used to estimate the traffic speed. During traffic congestion, consecutive handover events may be rare because vehicles move slowly, and thus very few or no speed reports would be generated from the congested area.However, the traffic speed report rate during traffic congestion has not been investigated in the literature. In this paper, we present an analytic model to estimate the speed report rate from cellular network signaling in steady traffic conditions, that is, the traffic speed and flow are assumed constant. Real field trial data were used to validate our analytic model. In addition, computer simulations were conducted to study how speed reports are generated in dynamic traffic conditions when traffic speed and flow change rapidly. Our study indicates that in a typical cell of length 1.5 km with a typical expected call holding time of 1 min, no speed report was generated from a congested three‐lane highway. Our study demonstrates that the lack of speed reports from consecutive handover events during rush hours indicates severe traffic congestion, and new methods that can estimate traffic speed from cellular network data during severe traffic congestion need to be developed. Copyright © 2013 John Wiley & Sons, Ltd.     

低频标准真空涨落的测量

采用自平衡零拍方案, 对低频段的标准量子真空涨落进行了测量. 实验确定了该系统的饱和光功率约为3.2 mW. 在10 Hz–400 kHz的频率范围内, 系统的共模抑制比平均为55 dB, 在100 Hz处高达63 dB, 对激光经典技术噪声具有很强的抑制作用. 当入射光功率为400 μ W 时, 真空涨落噪声达到11 dB. 此低频量子真空噪声探测系统可广泛应用于量子计量和量子光学等研究领域.     

互联网视听节目监测从业人员上网行为审计系统设计与实现

文章根据互联网视听节目监测从业人员的工作内容,提出上网行为审计系统的设计并加以实现,系统满足加强互联网信息安全的需求,同时规范上网行为、提高工作效率。系统通过用户准入、上网行为记录、流量控制、终端管理等技术手段,部署了一套完整的上网行为审计系统。本系统旨在解决互联网视听节目监测从业人员访问互联网所衍生的信息安全隐患、工作效率低等问题。     

基于阿秒抖动光纤锁模激光器的时钟同步

光纤锁模激光器结构简单, 运转稳定, 且输出的超短脉冲序列具有极高的时钟稳定性, 在抽运探测、脉冲相干合成等要求高精度时钟同步的前沿领域有着广阔的应用前景. 本文通过激光器腔内的电光调制器进行反馈控制, 实现了两台光纤锁模激光器之间的紧密时钟信号同步; 并且通过平衡光学互相关方法, 对残余的时钟误差信号进行了测量, 分辨率达到了13 as. 通过优化激光器的腔内动力学过程及反馈环路的参数, 在[1 Hz, 10 MHz]的积分区间内得到了109 as的残余时钟误差, 对应单台激光器的平均时间抖动为77 as.     

An efficient splitting technique for two‐layer shallow‐water model

We consider the numerical approximation of the weak solutions of the two‐layer shallow‐water equations. The model under consideration is made of two usual one‐layer shallow‐water model coupled by nonconservative products. Because of the nonconservative products of the system, which couple both one‐layer shallow‐water subsystems, the usual numerical methods have to consider the full model. Of course, uncoupled numerical techniques, just involving finite volume schemes for the basic shallow‐water equations, are very attractive since they are very easy to implement and they are costless. Recently, a stable layer splitting technique was introduced [Bouchut and Morales de Luna, M2AN Math Model Numer Anal 42 (2008), 683–698]. In the same spirit, we exhibit new splitting technique, which is proved to be well balanced and non‐negative preserving. The main benefit issuing from the here derived uncoupled method is the ability to correctly approximate the solution of very severe benchmarks. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 31: 1396–1423, 2015     

A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks

A G‐design of order n is a decomposition of the complete graph on n vertices into edge‐disjoint subgraphs isomorphic to G. Grooming uniform all‐to‐all traffic in optical ring networks with grooming ratio C requires the determination of graph decompositions of the complete graph on n vertices into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The existence spectrum problem of G‐designs for five‐vertex graphs is a long standing problem posed by Bermond, Huang, Rosa and Sotteau in 1980, which is closely related to traffic groomings in optical networks. Although considerable progress has been made over the past 30 years, the existence problems for such G‐designs and their related traffic groomings in optical networks are far from complete. In this paper, we first give a complete solution to this spectrum problem for five‐vertex graphs by eliminating all the undetermined possible exceptions. Then, we determine almost completely the minimum drop cost of 8‐groomings for all orders n by reducing the 37 possible exceptions to 8. Finally, we show the minimum possible drop cost of 9‐groomings for all orders n is realizable with 14 exceptions and 12 possible exceptions.