全新登场

双门霸王；法式三厢；完美小车；粉墨登场；四驱TL；旧貌换新颜；完美中和     

新闻集锦

智能交通；轨道交通；交通规划；公共交通；停车系统；交通管理。     

车坛趣话

闯红灯杀手；菲亚特“脑残”系列广告；原力与你同在；劳斯莱斯的游艇；太安静也不行；“car2go”汽车共享计划；阿斯顿马丁版丰田iQ。     

汽车新闻

新款沃尔沃S40；新BMW 5系长轴距版；风行景逸；福特蒙迪欧致胜；雪佛兰科帕奇；新威乐；[编者按]     

信息选编

我国高速公路已逾3．4万公里；2004年物流业十件大事；中国列世界环境指数倒数14位；信息化程度全球最新排名公布中国升至第41位；2005年我国经济自由度居全球112位香港居首位；上海排堵保畅的总体目标；上海欲重振纺织业；我国物流总额已达38．4万亿元；允许外商投资汽车维修在内的道路运输经营；……     

关于沈大高速公路改扩建工程SMA-16L目标配合比设计

主要阐述了高温抗车辙；低温抗开裂；水损害；抗滑性能好；耐疲劳；能够延长路面的使用寿。     

世界万象

国外对付违章停车的“绝招儿”；国外公路弯道安全标志；爱管闲事的丹麦人；国外驾照上的忠告；英女王表弟超速驾车受罚；英环保摩托车“悄悄”上路；不开空调的德国司机。     

车族时尚

任天堂II；“戒指”闹钟；宠物旅行空调房；LEVI’S手机；“海盗”主题液乱电视；Naviroho汽车导航器；[第一段]     

提高沥青路面平整度的几项措施

根据沥青路面施工监理实践，总结提高沥青路面平整度的10项措施：1．重视基层平整度；2．铺油前基层的处理；3．沥青混合料供料与摊铺速度相协调；4．选择合理的基准线；5．准确悬挂基准线；6．保持摊铺机状态良好；7．划出准确的摊铺线；8．优化摊铺工艺；9．处理好横向接茬；10．确保碾压质量。     

外刊速览

纽约地铁系统扩建充满挑战；法国RFF描出高速线前景图；轨顶润滑的作用及优势；运输系统利用各种资源提高应急能力；ASLRRA年会指明PTC发展方向；     

树形结构在关系数据库中的压缩存储研究

讨论在关系数据库中压缩存放树形数据结构的方法;数据一致性的保证;分析存储、检索算法的时空复杂度.     

Bi-slotted binary tree algorithm with stack for radio frequency identification tag anti-collision

A radio frequency identification (RFID) reader will fail to identify tags if a collision occurs. This paper proposes a bi-slotted binary tree algorithm (BSBTA) with stack for RFID tag anti-collision to improve the performance of binary tree algorithm (BTA). In BSBTA, the reader detects collisions by Manchester code and stores colliding prefixes in a stack. The query is composed of a two-bit prefix and an index value. Following every reader query, there are two timeslots for tags whose pointers and identities (IDs) match the query to respond, one for the tag whose next bit is 0 and the other for the tag with 1 as its next bit. Performance analysis and evaluation are also given. The time complexity and the communication complexity of BTA and BSBTA are derived. The simulation results compare the performance of BSBTA with several related anti-collision algorithms. It is shown that BSBTA outperforms BTA in terms of the average number of responded bits and timeslots for one tag identification.     

A study on the degree of barrier coverage in wireless sensor networks

Recently, the barrier coverage was proposed and received much attention in wireless sensor network (WSN), and the degree of the barrier coverage, one of the critical parameters of WSN, must be re-studied due to the difference between the barrier coverage and blanket coverage. In this paper, we propose two algorithms, namely,local tree based no-way and back (LTNWB) algorithm and sensor minimum cut sets (SMCS) algorithm, for the opened and closed belt regions to determine the degree of the barrier coverage of WSN. Our main objective is to minimize the complexity of these algorithms. For the opened belt region, both algorithms work well, and for the closed belt region, they will still come into existence while some restricted conditions are taken into consideration.Finally, the simulation results demonstrate the feasibility of the proposed algorithms.     

WDM全光网络中的多播路由与波长分配算法

研究了全光网络中的多播路由和波长分配问题，结合波长图模型，提出了一种波长可变WDM全光网络的多播路由和波长分配算法，算法将路由和波长分配统一进行，通过动态调整节点与当前树的代价值构造时延受限低代价多播树，避免了同类算法的较高复杂性。     

决策树剪枝方法的比较

为在决策树剪枝中正确选择剪枝方法，基于理论分析和算例详细地比较了当前主要的4种剪枝方法的计算复杂性、剪枝方式、误差估计和理论基础．与PEP相比，MEP产生的树精度较小且树较大；REP是最简单的剪枝方法之一，但需要独立剪枝集；在同样精度情况下，CCP比REP产生的树小．如果训练数据集丰富，可以选择REP，如果训练数据集较少且剪枝精度要求较高，则可以选用PEP．     

Solving the euclidean steiner minimum tree using cellular stochastic diffusion search algorithm

The Euclidean Steiner minimum tree problem is a classical NP-hard combinatorial optimization problem. Because of the intrinsic characteristic of the hard computability, this problem cannot be solved accurately by efficient algorithms up to now. Due to the extensive applications in real world, it is quite important to find some heuristics for it. The stochastic diffusion search algorithm is a newly population-based algorithm whose operating mechanism is quite different from ordinary intelligent algorithms, so this algorithm has its own advantage in solving some optimization problems. This paper has carefully studied the stochastic diffusion search algorithm and designed a cellular automata stochastic diffusion search algorithm for the Euclidean Steiner minimum tree problem which has low time complexity. Practical results show that the proposed algorithm can find approving results in short time even for the large scale size, while exact algorithms need to cost several hours.     

基于事故树分析的4．28铁路事故安全管理对策

介绍我国行车安全及国内外行车事故研究现状,阐述事故树分析方法的原理。针对4．28铁路事故,建立用于定性分析的事故树,应用布尔代数法,通过计算得出该事故树的最小割集、最小径集与基本事件的结构重要度,找出事故发生的原因,从安全管理上采取具有针对性的防范措施,达到预防同类事故再次发生的日的。     

解决路网检测器布局问题的数形结合方法

为了获取各路段的交通流量,本文提出一种解决任意路网中检测器布局优化 问题的数形结合方法.首先基于交通网络的拓扑结构与代数关联矩阵间的联系定义平衡 矩阵和基本平衡矩阵;然后根据基本平衡矩阵的特点,找到n -1阶数（比网络节点数少 1）可逆矩阵M ,该矩阵所对应的路段集合就构成路网的一个支撑树(不需要安装检测器 的路段集合);最后根据流量守恒原理进行矩阵运算,全面、准确、快速地推算出未安装检 测器路段的交通流量.该方法揭示了路网中各路段流量间的数形联系,并避免了单独利用 代数或图论方法的操作复杂性,以及获取交通信息不及时性.通过具体算例验证了此方法 的可行性和有效性.     

基于Petri 网模型的铁路快捷货运产品可靠性评价

为准确评价及预测铁路快捷货运产品的可靠性,在全面分析铁路快捷货运产品可靠性影响因素的基础上,建立用于产品可靠性评价的故障树模型,并采用下行法求取故障树的最小割集;结合Petri 网建模方法与故障树基本理论,将产品故障树转化为 Petri 网仿真模型,并证明两者的等价性;利用Matlab 仿真软件进行基于关联矩阵的Petri 网模型求解,并以北京-上海间特快货物班列为例,得到该产品的可靠度及故障因素重要度排序.实证结果显示,应用Petri 网模型来求解产品可靠性评价问题,不仅能够有效提升求解过程的效率,而且准确易行.研究成果可以为提高铁路快捷货运产品可靠性和市场竞争力提供科学依据和必要支撑.     

Topology-aware overlay multicast over IP multicast networks

Most existing overlay multicast approaches refuse to consider any network layer support no matter whether it is available or not. This design principle greatly increases the complexity of the routing algorithms and makes the overlay topologies incompatible with the underlying network. To address these issues, topologyaware overlay multicast over IP multicast networks （TOMIMN） was proposed as a novel overlay multicast protocol, which exploits the cooperation between end-hosts and IP multicast routers to construct a topologyaware overlay tree. Through a little modification to protocol independent multicast sparse mode （PIM-SM）, a multicast router is able to receive registration from nearby group members and redirect passing-by join requests to them. Due to the multicast router＇s support, TOMIMN organizes its group members into an overlay multicast tree efficiently, which matches the physical network topology well.