旺村电站至桂江河口河段设计最低通航水位分析

文章依托旺村电站至桂江河口河段航道工程,介绍了设计最低通航水位的确定方法和思路,并基于西江（干流）水位顶托对旺村电站至桂江河口（支流河口段）水位的影响分析,确定了相关设计最低通航水位指标值,提出了该河段设计最低通航水位分析的要点及注意事项。     

巧设CTC路由器ACL降低网络安全风险

铁路CTC网络均采用了带访问控制功能的路由器，正确地设置ACL（访问控制列表），将起到防火墙的作用，降低网络安全风险。在CTC网络路由器上进行规则设定，可阻挡不匹配安全规则的数据包，确保CTC网络安全。     

The train platforming problem: The infrastructure management company perspective

If railway companies ask for station capacity numbers, their underlying question is in fact one about the platformability of extra trains. Train platformability depends not only on the infrastructure, buffer times, and the desired departure and arrival times of the trains, but also on route durations, which depend on train speeds and lengths, as well as on conflicts between routes at any given time. We consider all these factors in this paper. We assume a current train set and a future one, where the second is based on the expected traffic increase through the station considered. The platforming problem is about assigning a platform to each train, together with suitable in- and out-routes. Route choices lead to different route durations and imply different in-route-begin and out-route-end times. Our module platforms the maximum possible weighted sum of trains in the current and future train set. The resulting number of trains can be seen as the realistic capacity consumption of the schedule. Our goal function allows for current trains to be preferably allocated to their current platforms.Our module is able to deal with real stations and train sets in a few seconds and has been fully integrated by Infrabel, the Belgian Infrastructure Management Company, in their application called Ocapi, which is now used to platform existing and projected train sets and to determine the capacity consumption.     

珠三角城际铁路折返方案探讨

在城际铁路CTCS2+ATO列控系统技术方案基础上,通过对几种折返作业方式进行分析、比较,探讨适合珠三角城际铁路的折返方案。     

Mining missing train logs from Smart Card data

This paper shows how to recover the arrival times of trains from the gate times of metro passengers from Smart Card data. Such technique is essential when a log, the set of records indicating the actual arrival and departure time of each bus or train at each station and also a critical component in reliability analysis of a transportation system, is missing partially or entirely. The procedure reconstructs each train as a sequence of the earliest exit times, called S-epochs, among its alighting passengers at each stations. The procedure first constructs a set of passengers, also known as reference passengers, whose routing choices are easily identifiable. The procedure then computes, from the exit times of the reference passengers, a set of tentative S-epochs based on a detection measure whose validity relies on an extreme-value characteristic of the platform-to-gate movement of alighting passengers. The tentative S-epochs are then finalized to be a true one, or rejected, based on their consistencies with bounds and/or interpolation from prescribed S-epochs of adjacent trains and stations. Tested on 12 daily sets of trains, with varying degrees of missing logs, from three entire metro lines, the method restored the arrival times of 95% of trains within the error of 24 s even when 100% of logs was missing. The mining procedure can also be applied to trains operating under special strategies such as short-turning and skip-stop. The recovered log seems precise enough for the current reliability analysis performed by the city of Seoul.     

Analyzing the theoretical capacity of railway networks with a radial-backbone topology

In this work we propose a mechanism to optimize the capacity of the main corridor within a railway network with a radial-backbone or X-tree structure. The radial-backbone (or X-tree) structure is composed of two types of lines: the primary lines that travel exclusively on the common backbone (main corridor) and radial lines which, starting from the common backbone, branch out to individual locations. We define possible line configurations as binary strings and propose operators on them for their analysis, yielding an effective algorithm for generating an optimal design and train frequencies. We test our algorithm on real data for the high speed line Madrid–Seville. A frequency plan consistent with the optimal capacity is then proposed in order to eliminate the number of transfers between lines as well as to minimize the network fleet size, determining the minimum number of vehicles needed to serve all travel demand at maximum occupancy.     

Experimental evaluation of the efficiency of trenches for the mitigation of train-induced vibrations

In this work, the efficiency of absorbing barriers for the mitigation of ground vibrations induced by railway traffic has been evaluated by means of two different experimental campaigns conducted in situ, along the newly-built, high-speed railway line that connects the Italian cities of Milan and Bologna. In the first stage of testing, a series of ideal barriers created from unsupported empty trenches were tested to assess the effects of barrier depth on their efficiency in reducing vertical ground accelerations. The second stage of testing was performed to investigate the efficiency of a full-scale prototype barrier, made of a 2-meter-deep trench supported by two precast reinforced concrete plates connected by steel bars, during transit of an ETR 500 train at a speed of 120 km/h.     

地理信息系统中数据库间数据交换技术的研究

鉴于地理信息系统中数据交换信息量巨大,提出利用数据交换通信平台(DECP)作为中间层,来实现异构数据库之间的数据传输和交换。DECP由数据访问层、业务逻辑层、安全代理、数据传送代理、客户代理、消息层、事务管理器七个部分组成。DECP所采用的关键技术是基于代理的安全技术、系统调度、异构数据库的访问和事务的调度和管理。     

基于路段交换的多基地动车组运用计划的编制算法

多个基地的动车组共同完成某一运行图规定的任务 ,是动车组运用的一种较为普遍的方式 ,开发该种运用方式的编制算法 ,是研究动车组编制算法的重要组成部分。基于路段交换的思想开发了编制算法 :首先利用已有算法构造出较好的初始解 ,然后利用路段交换不断改进解的质量。利用实际线路数据进行实验 ,证明算法有效。     

大号码道岔应用在信号系统中的解决方案

随着我国铁路的不断提速，大号码道岔在铁路建设中的应用越来越普遍，与之有关的转换、列车运行安全控制等问题也随之而来。本文主要阐述了在信号系统设计中应注意处理好大号码道岔的相关问题，并提出了解决方案。