滑坡监测无线传感器网络基于事件的信道分配方案

在高速铁路沿线的山体斜坡上部署无线传感器网络,用于监测山体斜坡变化情况。综合考虑传感器节点能量有限性和对采集信息的实时性需求,提出一个基于事件的信道分配方案用于滑坡监测信息的传输。以是否有列车经过山体斜坡区域作为事件,当无列车经过时,为节点分配活跃周期和睡眠周期,采用TDMA的方式唤醒节点并分配一个可用信道进行数据传输,从而在保证数据传输的前提下节省节点能量,延长网络寿命;当有列车即将经过时,节点完全进入活跃周期,采用多个信道并行传输的方式传输数据,减少传输过程中由于信息碰撞造成的信息丢失和重传,从而降低传输时延,提高信息传输的实时性。最后,通过仿真实验分析系统性能,证明所提方案的有效性。     

城际快速铁路通过能力研究

城际铁路通过能力的计算和实现在城际铁路运营组织和设计中起着十分重要的作用。对城际铁路通过能力计算进行了分析研究，并利用数理统计的方法分析了城际铁路通过能力计算值的概率实现和置信水平，进而提出了城际铁路区段通过能力计算值的可信度。     

DEADBEAT COVARIANCE CONTROLLER DESIGN FOR SAMPLED-DATA SYSTEMS

ＭＰＬＥＤ－ＤＡＴＡ ＳＹＳＴＥＭＳTX＠霍沛军＠王子栋ＩｎｔｒｏｄｕｃｔｉｏｎＳａｍｐｌｅｄ－ｄａｔａｆｅｅｄｂａｃｋｃｏｎｔｒｏｌｈａｓｒｅｃｅｉｖｅｄｍｕｃｈａｔｅｎｔｉｏｎｉｎｔｈｅａｒｅａｏｆｃｏｎｔｒｏｌｓｙｓｔｅｍｄｅ－ｓｉｇｎｂｅｃａｕｓｅｏ...     

时程分析法在大蒲春河特大桥主桥抗震验算中的应用

采用时程分析法对大蒲春河特大桥进行抗震分析,对主桥控制部位E1概率和E2概率地震作用下的响应进行验算,并利用验算结果指导该桥的抗震设计.     

随机风浪中舰船横摇倾覆概率分析

以路径积分法为基础,采用Gauss-Legendre公式探讨了随机风浪作用下舰船的运动及其倾覆概率计算。考虑阻尼力矩、复原力矩的非线性及风浪的随机性,建立了随机风浪中舰船运动的非线性微分方程,应用路径积分法给出白噪声随机扰动和定常风倾力矩作用时横摇角概率密度函数随时间的演变,按照现有的倾覆准则给出舰船倾覆概率的表达式。通过算例,验证了路径积分法的准确性,分析了各个参数对横摇角概率密度的影响,计算得出了不同风速、不同航速下的倾覆概率,以及倾覆概率随时间的变化。研究表明,此方法简便可行,并能在数量上预报舰船在随机风浪下的倾覆概率。     

精确制导武器对地面目标毁伤效能研究

从对地攻击靶场效能评估的角度出发,讨论了制导武器毁伤地面目标效能的模型、所采用的效能指标及效能指标的计算方法,最后给出了一个对单个目标毁伤效能的算例分析。     

A generic class of first order node models for dynamic macroscopic simulation of traffic flows

Node models for macroscopic simulation have attracted relatively little attention in the literature. Nevertheless, in dynamic network loading (DNL) models for congested road networks, node models are as important as the extensively studied link models. This paper provides an overview of macroscopic node models found in the literature, explaining both their contributions and shortcomings. A formulation defining a generic class of first order macroscopic node models is presented, satisfying a list of requirements necessary to produce node models with realistic, consistent results. Defining a specific node model instance of this class requires the specification of a supply constraint interaction rule and (optionally) node supply constraints. Following this theoretical discussion, specific macroscopic node model instances for unsignalized and signalized intersections are proposed. These models apply an oriented capacity proportional distribution of the available supply over the incoming links of a node. A computationally efficient algorithm to solve the node models exactly is included.     

Schedule-based transit assignment model with vehicle capacity and seat availability

In this paper, we propose a new schedule-based equilibrium transit assignment model that differentiates the discomfort level experienced by sitting and standing passengers. The notion of seat allocation has not been considered explicitly and analytically in previous schedule-based frameworks. The model assumes that passengers use strategies when traveling from their origin to their destination. When loading a vehicle, standing on-board passengers continuing to the next station have priority to get available seats and waiting passengers are loaded on a First-Come-First-Serve (FCFS) principle. The stimulus of a standing passenger to sit increases with his/her remaining journey length and time already spent on-board. When a vehicle is full, passengers unable to board must wait for the next vehicle to arrive. The equilibrium conditions can be stated as a variational inequality involving a vector-valued function of expected strategy costs. To find a solution, we adopt the method of successive averages (MSA) that generates strategies during each iteration by solving a dynamic program. Numerical results are also reported to show the effects of our model on the travel strategies and departure time choices of passengers.     

Frequency-based transit assignment considering seat capacities

This paper proposes a frequency-based assignment model that considers travellers probability of finding a seat in their perception of route cost and hence also their route choice. The model introduces a “fail-to-sit” probability at boarding points with travel costs based on the likelihood of travelling seated or standing. Priority rules are considered; in particular it is assumed that standing on-board passengers will occupy any available seats of alighting passengers before newly boarding passengers can fill any remaining seats. At the boarding point passengers are assumed to mingle, meaning that FIFO is not observed, as is the case for many crowded bus and metro stops, particularly in European countries. The route choice considers the common lines problem and an user equilibrium solution is sought through a Markov type network loading process and the method of successive averages. The model is first illustrated with a small example network before being applied to the inner zone of London’s underground network. The effect of different values passengers might attach to finding a seat are illustrated. Applications of the model for transit planning as well as for information provision at the journey planner stage are discussed.     

��������ʱ��ֲ��Ŀ������ģ�ͪ�

在城市轨道交通的线路网络形成、实行一票换乘并伴随投资主体多元化时,需要建立公平公正的票务清分机制,本文提出一个基于乘客旅行实际时间分布计算各路径上乘客比例的新方法.根据交通卡中的进出站的时间记录,计算出在一段时间内在一对出入站之间完成旅行的所有乘客的时间分布,以这个分布为依据计算在这段时间里各路径上的乘客比例.采用数值模拟的方法在一对有两条有效路径的出入站间产生乘客旅行时间的数据,然后根据这些数据进行客流比例计算.结果表明,即使两条路径的运营时间差异很小也能实现较准确的比例划分,这种动态计算客流分布的方法能更准确地反映实际客流分布.