Optimal expansion of an existing network

Given an existing network, a list of arcs which could be added to the network, the arc costs and capacities, and an available budget, the problem considered in this paper is one of choosing which arcs to add to the network in order to maximize the maximum flow from a sources to a sinkt, subject to the budgetary constraint. This problem appears in a large number of practical situations which arise in connection with the expansion of electricity or gas supply, telephone, road or rail networks. The paper describes an efficient tree-search algorithm using bounds calculated by a dynamic programming procedure which are very effective in limiting the solution space explicitly searched. Computational results for a number of medium sized problems are described and computing times are seen to be very reasonable.     

Photoelectron spectra of bis-cyclopentadienyl metal dihalides

He(I) and HE(II) photoelectron spectra are reported for (η-C₅H₅)₂MX₂ (M = Ti; X = F, Cl, Br, I: M = Zr, Hf; X = Cl, Br: M = Ta; X = Cl, Br) and (η-MeC₅H₄)₂MX₂ (M = Nb, X = Cl: M = Mo; X = Cl, Br, I). A substantial variation is found in the ordering of the halogen and cyclopentadienyl ionizations, the order being dependent on the metal as well as on the halogen. The compounds may be divided into three classes, namely, those in which the electrons in cyclopentadienyl e₁ orbitals ionize at a lower energy than those occupying halogen pπ orbitals, those in which halogen pπ electrons have lower ionization energy than cyclopentadienyl e₁ electrons and those in which the corresponding electrons arise from extensively delocalized molecular orbitals with significant contributions from both these categories of fragment orbital.     

Correcting Statistics for Delayed Data

Journal of the Operational Research Society - This note indicates an approach to adjusting the statistical records of the number of basic operations of an organisation to allow for delays in...     

A 2.5-D dynamic model for a saturated porous medium: Part I. Green’s function

Based on Biot’s theory, the dynamic 2.5-D Green’s function for a saturated porous medium is obtained using the Fourier transform and the potential decomposition methods. The 2.5-D Green’s function corresponds to the solutions for the following two problems: the point force applied to the solid skeleton, and the dilatation source applied within the pore fluid. By performing the Fourier transform on the governing equations for the 3-D Green’s function, the governing differential equations for the two parts of the 2.5-D Green’s function are established and then solved to obtain the dynamic 2.5-D Green’s function. The derived 2.5-D Green’s function for saturated porous media is verified through comparison with the existing solution for 2.5-D Green’s function for the elastodynamic case and the closed-form 3-D Green’s function for saturated porous media. It is further demonstrated that a simple form 2-D Green’s function for saturated porous media can be been obtained using the potential decomposition method.     

Verification and validation of a winter driving simulator

A full vehicle dynamics simulator was constructed in SimCreator^® for the Cold Regions Research and Engineering Laboratory (CRREL) Instrumented Vehicle (CIV) and was used to investigate and validate the newly developed Vehicle Terrain Interaction (VTI) code. The VTI code replaces the tire component of the simulated vehicle, in the Driver and Motion Simulator (DMS), allowing it to report back realistic values while driving on various types of terrain surfaces such as mud, snow, ice, and pavement. The validation effort within this paper is focused on the winter (snow and ice) parts of the VTI code. The outputs from the Engineering Research and Development Center (ERDC) and the DMS VTI codes were validated through field experiments and against the North Atlantic Treaty Organization (NATO) Reference Mobility Model (NRMM). The DMS VTI code can be used with different vehicle models, providing the US. Army with a valuable asset that will allow simulation of existing or conceptual, manned or autonomous, ground vehicle performance for acquisition, planning, or training. This information, along with some basic terrain information, will allow troops to plan the fastest and most effective way of getting to a desired location, while minimizing the possibility of being delayed because of the terrain conditions.     

Online Scheduling with Hard Deadlines

We study non-preemptive, online admission control in the hard deadline model: each job must either be serviced prior to its deadline or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource and a delay indicating the maximum time it can wait for the service to be started. The goal is to maximize total resource utilization. The jobs are non-preemptive and exclusive, meaning once a job begins, it runs to completion, and at most one job can use the resource at any time. We obtain a series of results, under varying assumptions of job lengths and delays.