منابع مشابه
The Locomotive Routing Problem
Given a schedule of trains, the locomotive planning (or scheduling) problem (LPP) is to determine the minimum cost assignment of locomotive types to trains that satisfies a number of business and operational constraints. Once this is done, the railroad has to determine the sequence of trains to which each locomotive is assigned by unit number so that it can be fueled and serviced as necessary. ...
متن کاملGrafting Locomotive Motions
The notion of transplanting limbs to enhance a motion capture database is appealing and has been recently introduced [Sha04], [Ike04]. A key difficulty in the process is identifying believable combinations. Not all transplantations are successful; we also need to identify appropriate frames in the different clips that are “cutpasted.” In this paper, we describe motion grafting, a method to synt...
متن کاملLocomotive Crashworthiness Research
NOTICE This document is disseminated under the sponsorship of the Department of Transportation in the interest of information exchange. The United States Government assumes no liability for its contents or use thereof. NOTICE The United States Government does not endorse products or manufacturers. Trade or manufacturers' names appear herein solely because they are considered essential to the ob...
متن کاملCapturing a Speeding Locomotive
Book Review virtually any target RNA, providing a potentially powerful extension of the antisense approach to gene inactiva-tion. Subsequent advances in RNA synthesis methods allowed large scale preparation of catalytic RNAs for RNA Catalysis. structural studies, the introduction of nucleotide modifications to stabilize antisense ribozymes against intra-Berlin: Springer-Verlag. (1996). 417 pp. ...
متن کاملLocomotive Scheduling Under Uncertain Demand
Each day, railroads face the problem of allocating power to trains. Often, power requirements for each train are not known with certainty, and the fleet of locomotives may not be homogeneous. To deal with both of these complications, we formulate a multicommodity flow problem with convex objective function on a timespace network. The convex objective allows us to minimize expected cost under un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Minutes of the Proceedings of the Institution of Civil Engineers
سال: 1838
ISSN: 1753-7843
DOI: 10.1680/imotp.1838.24757