Innovative Stereo Vision-Based Approach to Generate Dense Depth Map of Transportation Infrastructure

Three-dimensional (3-D) spatial data of a transportation infrastructure contain useful information for civil engineering applications, including as-built documentation, on-site safety enhancements, and progress monitoring. Several techniques have been developed for acquiring 3-D point coordinates of infrastructure, such as laser scanning. Although the method yields accurate results, the high device costs and human effort required render the process infeasible for generic applications in the construction industry. A quick and reliable approach, which is based on the principles of stereo vision, is proposed for generating a depth map of an infrastructure. Initially, two images are captured by two similar stereo cameras at the scene of the infrastructure. A Harris feature detector is used to extract feature points from the first view, and an innovative adaptive window-matching technique is used to compute feature point correspondences in the second view. A robust algorithm computes the nonfeature point correspondences. Thus, the correspondences of all the points in the scene are obtained. After all correspondences have been obtained, the geometric principles of stereo vision are used to generate a dense depth map of the scene. The proposed algorithm has been tested on several data sets, and results illustrate its potential for stereo correspondence and depth map generation.

Travel behaviour applied in freight transportation using intelligent products

The route planning problem for an order in freight transportation involves the selection of the best route for its transportation given a set of options that the network can offer. In its adaptive (or dynamic) version, the problem deals with the planning of a new route for an order while it is actually in transit typically because part or all of its pre-selected route is blocked or disrupted. In the intelligent product approach we are proposing, an order would be capable of identifying and evaluating such new routes in an automated manner and choosing the most preferable one without the intervention of humans. Because such approaches seek to mirror (and then automate) human decision making, in this paper we seek to identify new ways for dynamic route planning in industrial logistics inspired by the way people make similar decisions about their journey when they travel in multi-modal networks. We propose a new simulation game as a methodological tool for capturing their travel behaviour and we use it in this study. The results show that a simulation game can be used for capturing strategies and tactics of travellers and that intelligent products can provide a proper platform for the usage of such strategies in freight logistics. © 2012 IEEE.

A novel nanometer-scale "gold electrode-molecular wires-silver" junction: An efficient test bed for electrochemical investigation of electron transportation through molecular wires in self-assembled monolayers

A novel "gold electrode-molecular wires-silver" junction was facilely fabricated for electrochemical study on the electron transportation through molecular wires. Rapid electron transportation through this sandwich-like structure was indeed observed by cyclic voltammograms and ac impedance measurements. Since rather reproducible and reliable results are easily available by electrochemical techniques, it would be an efficient and reliable test bed for electrochemical investigation of charge transportation through molecular wires in self-assembled monolayers on electrodes.

Metal-containing molecular wires and their electron transportation properties

Metal-containing conjugated bisthioester 1 was synthesized. It was fabricated into "gold electrode - molecular wires monolayers - gold nanoparticles" junction using self-assembly and nanoparticles deposition techniques. The junction is suitable for investigating the electron transportation property of molecular wires.

Determinants of port centrality in maritime container transportation.

This paper adapts Freeman’s measures of degree, closeness and betweenness centrality and applies them to assessing: port centrality in relation to direct connectivity; accessibility to all ports in the network (direct and indirect routes) and; as an intermediary between other ports. An additional parameter added to the formulae ensures that the relative importance of available shipping capacity and foreland market coverage are also accounted for. Validation of this adapted measure is provided by the results obtained from an empirical application. These reveal that foreland market coverage exerts a particularly strong influence on a port’s demand and closeness centrality

Impact of postponement on transportation: An environmental perspective

Yang, Ying, Yang, Biao, and Wijngaard, Jacob, ' Impact of postponement on transportation: An environmental perspective', International Journal of Logistics Management (2005) 16(2) pp.192-204 RAE2008

Two-machine open shop scheduling with special transportation times

The paper considers a problem of scheduling n jobs in a two-machine open shop to minimise the makespan, provided that preemption is not allowed and the interstage transportation times are involved. In general, this problem is known to be NP-hard. We present a linear time algorithm that finds an optimal schedule if no transportation time exceeds the smallest of the processing times. We also describe an algorithm that creates a heuristic solution to the problem with job-independent transportation times. Our algorithm provides a worst-case performance ratio of 8/5 if the transportation time of a job depends on the assigned processing route. The ratio reduces to 3/2 if all transportation times are equal.

A heuristic for the two-machine open-shop scheduling problem with transportation times

The paper considers a problem of scheduling n jobs in a two-machine open shop to minimize the makespan, provided that preemption is not allowed and the interstage transportation times are involved. This problem is known to be unary NP-hard. We present an algorithm that requires O (n log n) time and provides a worst-case performance ratio of 3/2.