流量管理中信息重发问题的研究

信息重发在通信网络中广泛存在。通过对信息重发问题的研究，建立了概率模型，分析了信息到达流的各种性质，得到了到达间隔时间的分布及平均到达速率等重要性能指标，利用数值实验对理论结论进行了验证。所得结果对网络流量管理和拥塞控制有一定的参考价值。     

A Survivable Wavelength Division Multiplexing Passive Optical Network with Both Point-to-Point Service and Broadcast Service Delivery

Abstract

A survivable wavelength division multiplexing passive optical network enabling both point-to-point service and broadcast service is presented and demonstrated. This architecture provides an automatic traffic recovery against feeder and distribution fiber link failure, respectively. In addition, it also simplifies the protection design for multiple services transmission in wavelength division multiplexing passive optical networks.     

短时交通流混沌预测模型的比较研究

短时交通流预测是实现交通流诱导的关键技术之一.针对目前短时交通混沌预测模型预测结果差异较大的问题,归纳了4种基于混沌理论的短时交通流预测模型:RBF神经网络模型、最大Lyapunov指数模型、局域线性模型和Volterra滤波器自适应预测模型,并对这4种预测模型进行了比较研究.应用4种预测模型对几个典型的非线性系统进行预测,验证了算法的准确性.然后用这4种预测模型对微观实测交通流的时间序列进行实证分析.仿真结果表明,4种预测模型对典型混沌时间序列具有很好的预测效果;而对实测交通流预测,其预测精度和稳定性较差,但可以满足实时交通流预测的需要.     

基于BP网络分类器的交通标志识别

针对中国全部3大类116个交通标志,即禁令标志、指示标志、警告标志,用BP网络实现分类功能.实验中使用了3种测试集,即加高斯噪声、水平扭曲和日本交通标志实景图,对BP网络的分类性能进行了测试.实验结果表明:用BP网络实现交通标志粗分类功能的效果是比较理想的,对交通标志的颜色失真和形状失真均具有较好的容错性和鲁棒性.     

The Law of the Iterated Logarithm for Extreme Waiting Time in Multiphase Queueing Systems

The objective of this research in the queueing theory is the law of the iterated logarithm (LIL) under the conditions of heavy traffic in multiphase queueing systems (MQS). In this paper, the LIL is proved for the extreme values of some important probabilistic characteristics of the MQS, namely, maxima and minima of the summary waiting time of a customer, and maxima and minima of the waiting time of a customer.     

Dynamic routing in open queueing networks: Brownian models,cut constraints and resource pooling

We present an introductory review of recent work on the control of open queueing networks. We assume that customers of different types arrive at a network and pass through the system via one of several possible routes; the set of routes available to a customer depends on its type. A route through the network is an ordered set of service stations: a customer queues for service at each station on its route and then leaves the system. The two methods of control we consider are the routing of customers through the network, and the sequencing of service at the stations, and our aim is to minimize the number of customers in the system. We concentrate especially on the insights which can be obtained from heavy traffic analysis, and in particular from Harrison's Brownian network models. Our main conclusion is that in many respects dynamic routingsimplifies the behaviour of networks, and that under good control policies it may well be possible to model the aggregate behaviour of a network quite straightforwardly.Supported by SERC grant GR/F 94194.     

Continuum modeling for two-lane traffic flow

In this paper, we study the continuum modeling of traffic dynamics for two-lane freeways. A new dynamics model is proposed, which contains the speed gradient-based momentum equations derived from a car-following theory suited to two-lane traffic flow. The conditions for securing the linear stability of the new model are presented. Numerical tests are carried out and some nonequilibrium phenomena are observed, such as small disturbance instability, stop-and-go waves, local clusters and phase transition. The project supported by the National Natural Science Foundation of China (70521001) The English text was polished by Yunming Chen.     

城市主干道交通信号灯模糊线控制的探讨

本文首先提出城市交通系统线控制的两级递阶结构：第一级，用模糊逻辑控制器确定单路口交通信号灯的周期和绿信比；第二级，用模糊相位控制器确定相邻两路口的相位差；两级间用模糊转换开关协调；然后，提出具体的实现方法。     

Structure-reversibility and departure functions of queueing networks with batch movements and state dependent routing

We consider characterizations of departure functions in Markovian queueing networks with batch movements and state-dependent routing in discrete-time and in continuous-time. For this purpose, the notion of structure-reversibility is introduced, which means that the time-reversed dynamics of a queueing network corresponds with the same type of queueing network. The notion is useful to derive a traffic equation. We also introduce a multi-source model, which means that there are different types of outside sources, to capture a wider range of applications. Characterizations of the departure functions are obtained for any routing mechanism of customers satisfying a recurrent condition. These results give a unified view to queueing network models with linear traffic equations. Furthermore, they enable us to consider new examples as well as show limited usages of this kind of queueing networks. This revised version was published online in June 2006 with corrections to the Cover Date.     

关联规则向量化挖掘算法及其在车险精算中的应用

本文首先回顾了关联规则的基本概念和传统的Apriori算法，然后利用关联规则的数据库是布尔型数据库的特点，在计算关联规则的支持度和置信度的时候引进向量数乘和向量内积的概念，得到关联规则向量化挖掘算法ARVDA，避免全数据库逐条记录模式匹配和属性分层，提高算法的速度．最后，本文利用提升度量关联规则的重要性，采用单独追踪和对比分析方法，衡量车险精算中风险因子的有效性．结果表明把车辆使用性质作为车险定价的分级因素是比较合理的，对于非运营车辆需要合理的费用附加．