面向上海国际航运中心的洋山综合信息服务平台

介绍了洋山深水港面向国际航运中心,建设洋山综合信息服务平台的现实要求和建设基础,并详尽地叙述了洋山综合信息服务平台的主要功能和建设内容,以及洋山综合信息服务平台的积极意义和重要作用。     

村通工程交换网网管改造方案

从村通工程的实际背景出发，立足于甘肃省本地电话网的现状，结合目前本地电话网组建方案的利弊及其发展进程进行分析，得出了一个扩大本地网网管系统的方案。     

基于Petri网的临床路径诊治系统仿真

提出了基于Petri网的临床路径诊治信息系统的开发方法和功能要求，设计了基于Petri网的临床路径诊治信息系统模型CPN．通过对CPN模型优化与可靠性论证，准确定义了临床诊治行为的控制过程，有效地解决了临床路径的特殊问题，最后通过系统的正常运行验证了设计模型的准确性．     

对铁路客站概算编制几个问题的探讨

铁路站房一般具有跨度大、空间大、荷载重等特点,他不同于一般的工业与民用建筑,在编制概预算时如果直接套用地方定额,会存在一定的不合理性.此文从站房基坑土方开挖、大体积混凝土支撑系统、大型钢结构安装工程、建筑装修支撑体系等方面,分析对编制项目概算的影响.通过分析与对比,提出采用地方定额的建议,以供在今后编制站房概算中借鉴.     

基于SJA1000的CAN总线通信系统的设计

介绍CAN总线主要技术特性,简述基于SJA1000的CAN总线接口电路的软、硬件设计方法,给出CAN总线接口电路、SJA1000初始化程序、接收及发送数据的程序框图,满足CAN通信的各项要求。     

CTCS-3级列控系统RBC切换过程分析

RBC根据轨道电路、联锁进路等信息生成行车许可,通过GSM-R无线通信系统传输给车载设备。受单套RBC控制能力限制,在相邻RBC控制范围的边界处必须实现对列车控制权的安全可靠切换。分别对车载设备采用2部或1部车载电台时的RBC切换过程进行了深入分析,并在详细分析RBC切换过程的基础上,用着色Petri网的支持工具CPNTools对该过程进行了形式化建模,对所建立的模型进行了仿真,对用自然语言描述的RBC切换过程进行了形式化表示和验证。     

基于随机Petri网的GSM-R双层网络建模与性能分析

利用随机Petri网,综合信道降质、链路中断、越区切换、灾害等因素,建立GSM-R的同站址网络与交织站址网络的故障模型,针对同站址与交织站址两种不同的网络结构,给出利用马尔可夫链求解可靠性与可用性的方法。通过马尔可夫链的有关概率分别计算:不同网络结构的可靠性;不同列车运行速度对应不同网络结构的可用性。分析计算结果表明:同站址网络的可靠性与可用性远高于交织站址网络,主要原因是同站址网络中一层基站业务中断时不会导致系统失效,交织站址网络中一层基站业务中断时,并联的另一层相邻两个基站均可以提供业务才不会导致系统失效。另外,同站址网络中越区切换速率较小,有效减小了列车越区切换对可靠性与可用性的影响。     

电站600 MW机组P91三通的设计制造

采用压力面积法对电站 6 0 0MW机组主蒸汽管道P91材质三通进行设计 ,应用有限元对设计模型进行验证 ,通过改进常规径向补偿热压工艺 ,成功制造出 6 0 0MW机组P91钢 90°热挤压三通。通过检验和试验 ,表明其可替代进口锻制 6 0 0MW机组P91钢 90°三通。     

Continuum theory for pedestrian traffic flow: Local route choice modelling and its implications

This contribution puts forward a novel multi-class continuum model that captures some of the key dynamic features of pedestrian flows. It considers route choice behaviour on both the strategic (pre-trip) and tactical (en-route) level. To achieve this, we put forward a class-specific equilibrium direction relation of the pedestrians, which is governed by two parts: one part describing the global route choice, which is pre-determined based on the expectations of the pedestrians, and one part describing the local route choice, which is a density-gradient dependent term that reflects local adaptations based on prevailing flow conditions.Including the local route choice term in the multi-class model causes first of all dispersion of the flow: pedestrians will move away from high density areas in order to reduce their overall walking costs. Second of all, for the crossing flow and bi-directional flow cases, local route choice causes well known self-organised patterns to emerge (i.e. diagonal stripes and bi-directional lanes). We study under which demand conditions self-organisation occurs and fails, as well as what the impact is of the choices of the different model parameters. In particular, the differences in the weights reflecting the impact of the own and the other classes appear to have a very strong impact on the self-organisation process.     

The load-dependent vehicle routing problem and its pick-up and delivery extension

The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet.