Train pathing is a typical problem which is to assign the train trips on the sets of rail segments, such as rail tracks and links. This paper focuses on the train pathing problem, determining the paths of the train trips in emergencies. We analyze the influencing factors of train pathing, such as transferring cost, running cost, and social adverse effect cost. With the overall consideration of ...

Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it is required that a schedule (including the path) be determined for it so as to minimize the time taken without affecting the schedules for the old trains. In the standard formulations of this single train pathing prob...

We present a left to right incremental algorithm for the processing of Lambek categorial grammar by proof net construction. A simple metric of complexity, the profile in time of the number of unresolved valencies, correctly predicts a wide variety of performance phenomena: garden pathing, left to right quantifier scope preference, centre embedding unacceptability, preference for lower attachmen...

In a railroad system, train pathing is concerned with the assignment of trains to links and tracks, and train timetabling allocates time slots to trains. In this paper, we present an optimization heuristic to solve the train pathing and timetabling problem. This heuristic allows the dwell time of trains in a station or link to be dependent on the assigned tracks. It also allows the minimum clea...

This article examines cognitive process models of human sentence comprehension based on the idea of informed search. These models are rational in the sense that they strive to find a good syntactic analysis quickly. Informed search derives a new account of garden pathing that handles traditional counterexamples. It supports a symbolic explanation for local coherence as well as an algorithmic ac...

3-D prestack common-azimuth depth migration has strong potential for accurately imaging complex media and correctly handling multi-pathing. Here, we apply the technique to a North Sea real data containing a salt dome. The results obtained demonstrate the suitability of the method for complex media. A detailed analysis of associated angle-domain common-image gathers shows opportunities for impro...

3-D prestack common-azimuth depth migration has a strong potential for imaging accurately complex media and handling multi-pathing. We apply the technique to North Sea real data for imaging a salt dome. The results obtained demonstrate the efficiency of the method in complex media. A detailed analysis of common-image gathers shows opportunities for improving the velocity model.

Individual tree extraction from terrestrial laser scanning (TLS) data is a prerequisite for tree-scale estimations of forest biophysical properties. This task currently undertaken through laborious and time-consuming manual assistance quality control. study presents new fully automatic approach to extract single trees large-area TLS data. data-driven method operates exclusively on point cloud g...