Modeling chain collisions in vehicular networks with variable penetration rates

The vehicular ad hoc network has great potential in improving traffic safety. One of the most important and interesting issues in the research community is the safety evaluation with limited penetration rates of vehicles equipped with inter-vehicular communications. In this paper, a stochastic model is proposed for analyzing the vehicle chain collisions. It takes into account the influences of different penetration rates, the stochastic nature of inter-vehicular distance distribution, and the different kinematic parameters related to driver and vehicle. The usability and accuracy of this model is tested and proved by comparative experiments with Monte Carlo simulations. The collision outcomes of a platoon in different penetration rates and traffic scenarios are also analyzed based on this model. These results are useful to provide theoretical insights into the safety control of a heterogeneous platoon.     

An integrated modelling approach for the bicriterion vehicle routing and scheduling problem with environmental considerations

The consideration of pollution in routing decisions gives rise to a new routing framework where measures of the environmental implications are traded off with business performance measures. To address this type of routing decisions, we formulate and solve a bi-objective time, load and path-dependent vehicle routing problem with time windows (BTL-VRPTW). The proposed formulation incorporates a travel time model representing realistically time varying traffic conditions. A key feature of the problem under consideration is the need to address simultaneously routing and path finding decisions. To cope with the computational burden arising from this property of the problem we propose a network reduction approach. Computational tests on the effect of the network reduction approach on determining non-dominated solutions are reported. A generic solution framework is proposed to address the BTL-VRPTW. The proposed framework combines any technique that creates capacity-feasible routes with a routing and scheduling method that aims to convert the identified routes to problem solutions. We show that transforming a set of routes to BTL-VRPTW solutions is equivalent to solving a bi-objective time dependent shortest path problem on a specially structured graph. We propose a backward label setting technique to solve the emerging problem that takes advantage of the special structure of the graph. The proposed generic solution framework is implemented by integrating the routing and scheduling method into an Ant Colony System algorithm. The accuracy of the proposed algorithm was assessed on the basis of its capability to determine minimum travel time and fuel consumption solutions. Although the computational results are encouraging, there is ample room for future research in algorithmic advances on addressing the proposed problem.     

Experimental evaluation of CAM and DENM messaging services in vehicular communications

The Cooperative Awareness Basic Service and Decentralized Environmental Notification Basic Service have been standardized by the European Telecommunications Standards Institute (ETSI) to support vehicular safety and traffic efficiency applications needing continuous status information about surrounding vehicles and asynchronous notification of events, respectively. These standard specifications detail not only the packet formats for both the Cooperative Awareness Message (CAM) and Decentralized Environmental Notification Message (DENM), but also the general message dissemination rules. These basic services, also known as facilities, have been developed as part of a set of standards in which both ISO and ETSI describe the Reference Communication Architecture for future Intelligent Transportation Systems (ITS). By using a communications stack that instantiates this reference architecture, this paper puts in practice the usage of both facilities in a real vehicular scenario. This research work details implementation decisions and evaluates the performance of CAM and DENM facilities through a experimental testbed deployed in a semi-urban environment that uses IEEE 802.11p (ETSI G5-compliant), which is a WiFi-like communication technology conceived for vehicular communications. On the one hand, this validation considers the development of two ITS applications using CAM and DENM functionalities for tracking vehicles and disseminating traffic incidences. In this case, CAM and DENM have demonstrated to be able to offer all the necessary functionality for the study case. On the other hand, both facilities have been also validated in a extensive testing campaign in order to analyze the influence in CAM and DENM performance of aspects such as vehicle speed, signal quality or message dissemination rules. In these tests, the line of sight, equipment installation point and hardware capabilities, have been found as key variables in the network performance, while the vehicle speed has implied a slight impact.     

Stochastic prediction of train delays in real-time using Bayesian networks

In this paper we present a stochastic model for predicting the propagation of train delays based on Bayesian networks. This method can efficiently represent and compute the complex stochastic inference between random variables. Moreover, it allows updating the probability distributions and reducing the uncertainty of future train delays in real time under the assumption that more information continuously becomes available from the monitoring system. The dynamics of a train delay over time and space is presented as a stochastic process that describes the evolution of the time-dependent random variable. This approach is further extended by modelling the interdependence between trains that share the same infrastructure or have a scheduled passenger transfer. The model is applied on a set of historical traffic realisation data from the part of a busy corridor in Sweden. We present the results and analyse the accuracy of predictions as well as the evolution of probability distributions of event delays over time. The presented method is important for making better predictions for train traffic, that are not only based on static, offline collected data, but are able to positively include the dynamic characteristics of the continuously changing delays.     

移动学习系统在操作系统课程中的应用研究

移动学习在无线网络和移动技术飞速发展的今天,作为一种全新的学习方式,正被越来越多的人认识和接受.通过选择以移动环境下学习系统为研究内容,从移动学习的所需要的理论知识和相关技术角度出发,讨论和构建了移动学习系统的结构框架,并根据该框架设计了移动环境下的学习系统,应用到操作系统课程中.     

移动式装卸臂在液体粮油码头装卸系统中的应用

根据天津临港工业区某粮油码头工程实例,着重分析在粮油码头上应用移动式装卸臂的可行性,结合粮油码头装卸工艺系统的总体布置情况．介绍移动式装卸臂的主要技术参数和移动式装卸臂的配置情况,并通过与软管装卸方式的对比论述采用移动式装卸臂的优势．可供同类码头工程参考。     

基于正交设计与 BP -GA 算法的船体结构耐撞性能优化设计

船体结构耐撞性优化设计的主要目的是在船舶碰撞研究的基础上对结构进行优化设计,提高船体结构的耐撞性能。基于正交试验设计、BP神经网络和遗传算法,形成了船体结构耐撞性能优化设计方法。提出了一种耐撞性综合指标,并以此指标作为优化的目标函数,以结构质量为约束条件,利用MSC/Dytran有限元软件对船舶碰撞进行数值仿真,完成对某船舷侧结构进行耐撞性优化设计,结果表明优化过后结构耐撞性能有较大提高,这为结构耐撞性能优化设计提供了一种新的思路和方法。     

基于马尔科夫链的60 GHz 点对点通信移动性优化

由于60 GHz通信在空气中可能会有高达20 dB的信号衰减,因此通信的范围和质量都可能受到影响．为此,IEEE 802.11 ad标准引入了能够定向增强信号和控制信号传播方向的波束成形技术来提高通信质量．然而,设备位置移动对波束成形的影响较大,它可能会导致通信质量下降甚至中断．为保证通信通畅,文中针对IEEE 802.11ad定义的点对点场景提出了波束成形优化算法．该算法基于马尔科夫链模型预测下一时刻设备的位置,并且提前调整相应的波束方向．该算法利用动态设备的相对位置和波束转动角度信息,代替了原波束成形方法中的波束扫描等过程．在仿真实验中,通过信息交互次数验证了该算法的有效性,提高了波束成形过程的效率,并且使该过程中的能量消耗降低了60％．     

基于货物时间价值的物流网络最优配送路径模型研究

本文构建了物流配送网络中货物时间价值相关的最小配送费用路径模型,并研究了其算法。模型把整个配送过程分为运输过程和装卸过程,并且考虑了由于运输过程和装卸过程时间延迟造成的货物价值损失,这也是和其它类似成本路径模型最大的区别。该模型算法可以利用计算机自动完成,不受物流配送网络大小和节点的限制,并保证算法的正确性。     

The polarization of global container flows by interoceanic canals: geographic coverage and network vulnerability

It is widely acknowledged that the two major interoceanic canals of Suez and Panama play a central role in global shipping flows. However, this role has rarely been measured with precision both in terms of the geographic coverage and network topological properties of canal-dependent flows. Based on vessel movement data for containerships, this research clarifies the weight and share of canal-dependent flows globally and at the level of world regions, routes, and ports. It also estimates and maps the effects of removing canal-dependent flows from the network by means of graph-theoretical methods. While main results converge in showing a decreasing importance of canal shipping in the context of growing south-south trade exchanges, certain areas remain more dependent than others, such as Asia, Europe, and North America. The research also underlines factors of port vulnerability across the globe in relation with the two canals.