PLC与组态王十字路口交通灯控制系统设计

使用欧姆龙PLC控制器设计十字路口交通灯控制系统。在设计硬件接线图与软件功能图的基础上,编写出相应的梯形图程序．采用CX—Programmer软件和Kingview 6．53组态软件进行模拟仿真。实验结果表明,该交通灯控制系统界面友好。运行正常,具有较好的控制效果。     

车联网仿真测试评价技术研究综述

智能化和网联化是汽车发展的重要方向,车联网技术作为智能网联汽车体系架构的重要组成部分,近年来成为业界的研究热点之一。车联网的大规模部署及其在智能汽车领域的广泛应用前需要对其性能及功能进行全面、深入的测试评价,然而在真实环境下进行车联网的测试与评估存在成本高、难度大的问题,因此通过仿真手段对其进行评价分析是当前的主流测试手段。本文总结了主流的网络仿真器和交通仿真器,对现有车联网仿真平台进行了分类,研究并对比分析了典型的车联网仿真平台;针对车联网的应用特性,研究并归纳了影响车联网仿真性能的车辆移动模型、信道传播模型及驾驶员行为等;从网络仿真指标、车联网应用相关指标归纳了车联网功能及性能测试的典型评价指标。     

信号交叉口展宽车道交通运行特性

为了解信号交叉口展宽车道的交通运行特性,采用现场调查和统计分析相结合的方法,对设置展宽车道的平面交叉口进行现场观测,选取交通量、车头时距、车道使用率和事故类型4项指标作为特征参数,分析各参数的变化规律,进而获得展宽车道的交通运行特性.研究表明:展宽车道在提高信号交叉口通行能力的同时,其车头时距具有明显的"两阶段"性,同时具有车道使用率低、刮擦事故多的特征.展宽车道设置时,需配合交通标志标线布设措施,做好渐变段、视距及下游长度优化设计.     

十字路口处长车交通状态相图

如今,相图被广泛用于交通科学领域的研究,取得了重要成果。根据理论分析和计算机模拟,本文构建了十字路口处交通流量相图。该相图是由五个基本区域构成的,本文分析并推导出每个区域的具体流量公式。在周期边界条件下,采用确定性 Fukui－Ishibashi元胞自动机交通模型进行数值模拟,其模拟结果与理论分析精确一致。     

拟阵交构约束的下模函数最大值问题的近似算法及其分析

下模函数的最大值问题是组合优化中的核心问题,然而求解下模函数最大值问题是一个NP-难问题,故人们降低要求,求解它的最优近似解。在拟阵约束的基础上,进一步研究拟阵交构成的独立系统下求解下模函数最大值问题,运用了近似领域算法,得到下模函数的近似最优解,并讨论给出了近似算法的性能分析,得出近似解的近似度≤（αm＋1）。     

一种基于GPS轨迹的道路拓扑生成方法

复杂路网拓扑的自动生成建立在道路提取和交叉路口识别的基础之上,是智能交通控制和自动导航服务等领域的研究热点之一,基于浮动车或出租车的GPS轨迹可以反映交通路网的拓扑结构。为此,提出了一种基于GPS轨迹的道路拓扑生成方法,即在无道路地图辅助的情况下,该方法基于大规模GPS轨迹,能够快速提取路口交叉点,自动构建具有地理位置信息的拓扑结构和计算相邻路口的网络距离。实验结果表明,该方法能够提取出各个道路交叉点并建立各点之间的拓扑关系。在提取主干道路拓扑实验中,在设置路宽为55米的情况下提取路口交叉点的正确率达到了87.08%,各路口之间的平均网络距离误差率为8.87%,并且能够正确地得到交叉点之间的连通关系。     

Toward an efficient and scalable feature selection approach for internet traffic classification

There is significant interest in the network management and industrial security community about the need to identify the “best” and most relevant features for network traffic in order to properly characterize user behaviour and predict future traffic. The ability to eliminate redundant features is an important Machine Learning (ML) task because it helps to identify the best features in order to improve the classification accuracy as well as to reduce the computational complexity related to the construction of the classifier. In practice, feature selection (FS) techniques can be used as a preprocessing step to eliminate irrelevant features and as a knowledge discovery tool to reveal the “best” features in many soft computing applications. In this paper, we investigate the advantages and disadvantages of such FS techniques with new proposed metrics (namely goodness, stability and similarity). We continue our efforts toward developing an integrated FS technique that is built on the key strengths of existing FS techniques. A novel way is proposed to identify efficiently and accurately the “best” features by first combining the results of some well-known FS techniques to find consistent features, and then use the proposed concept of support to select a smallest set of features and cover data optimality. The empirical study over ten high-dimensional network traffic data sets demonstrates significant gain in accuracy and improved run-time performance of a classifier compared to individual results produced by some well-known FS techniques.     

异平台雷达和ESM的高精度协同估计方法

随着网络的应用,不同平台的协同作战成为一种趋势,该趋势促成了异类平台间的数据融合需求.作为典型的协同模式,异平台的雷达和ESM观测的坐标系不同,无法直接融合,且二维ESM数据和三维雷达数据直接融合的精度较低.论文提出将雷达距离及方差转换到ESM坐标系下,转换得到虚假的距离量测结合ESM的角度量测,在三维坐标下进行Kalman滤波,获得ESM的估计及协方差矩阵,再进行协方差交集估计处理,可以较大的提高估计精度.     

Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors

Traditional ant colony optimization (ACO) algorithms have difficulty in addressing dynamic optimization problems (DOPs). This is because once the algorithm converges to a solution and a dynamic change occurs, it is difficult for the population to adapt to a new environment since high levels of pheromone will be generated to a single trail and force the ants to follow it even after a dynamic change. A good solution to address this problem is to increase the diversity via transferring knowledge from previous environments to the pheromone trails using immigrants schemes. In this paper, an ACO framework for dynamic environments is proposed where different immigrants schemes, including random immigrants, elitism-based immigrants, and memory-based immigrants, are integrated into ACO algorithms for solving DOPs. From this framework, three ACO algorithms, where immigrant ants are generated using the aforementioned immigrants schemes and replace existing ants in the current population, are proposed and investigated. Moreover, two novel types of dynamic travelling salesman problems (DTSPs) with traffic factors, i.e., under random and cyclic dynamic environments, are proposed for the experimental study. The experimental results based on different DTSP test cases show that each proposed algorithm performs well on different environmental cases and that the proposed algorithms outperform several other peer ACO algorithms.     

基于NetFlow的网络流量采集系统设计

网络流量是网络运行状态的风向标,对网络流量的相关情况进行监测分析与研究是网络管理的重要环节.从网络安全视角,详细介绍流量分析中主要使用的NetFlow技术,并根据NetFlow的特点,给出了一个基于NetFlow的网络流量采集系统设计实例.