Covering Paths and Trees for Planar Grids

Given a set of points in the plane, a covering path is a polygonal path that visits all the points. In this paper we consider covering paths of the vertices of an n x m grid. We show that the minimal number of segments of such a path is $2\min(n,m)-1$ except when we allow crossings and $n=m\ge 3$, in which case the minimal number of segments of such a path is $2\min(n,m)-2$, i.e., in this case we can save one segment. In fact we show that these are true even if we consider covering trees instead of paths. These results extend previous works on axis-aligned covering paths of n x m grids and complement the recent study of covering paths for points in general position, in which case the problem becomes significantly harder and is still open

Time controlled descent guidance algorithm for simulation of advanced ATC systems

Concepts and computer algorithms for generating time controlled four dimensional descent trajectories are described. The algorithms were implemented in the air traffic control simulator and used by experienced controllers in studies of advanced air traffic flow management procedures. A time controlled descent trajectory comprises a vector function of time, including position, altitude, and heading, that starts at the initial position of the aircraft and ends at touchdown. The trajectory provides a four dimensional reference path which will cause an aircraft tracking it to touchdown at a predetermined time with a minimum of fuel consumption. The problem of constructing such trajectories is divided into three subproblems involving synthesis of horizontal, vertical, and speed profiles. The horizontal profile is constructed as a sequence of turns and straight lines passing through a specified set of waypoints. The vertical profile consists of a sequence of level flight and constant descent angle segments defined by altitude waypoints. The speed profile is synthesized as a sequence of constant Mach number, constant indicated airspeed, and acceleration/deceleration legs. It is generated by integrating point mass differential equations of motion, which include the thrust and drag models of the aircraft

Fission of Halving Edges Graphs

In this paper we discuss an operation on halving edges graph that we call fission. Fission replaces each point in a given configuration with a small cluster of k points. The operation interacts nicely with halving edges, so we examine its properties in detail.Comment: 17 pages, 10 figure

Investigation of continuously traversing microphone system for mode measurement

The continuously Traversing Microphone System consists of a data acquisition and processing method for obtaining the modal coefficients of the discrete, coherent acoustic field in a fan inlet duct. The system would be used in fan rigs or full scale engine installations where present measurement methods, because of the excessive number of microphones and long test times required, are not feasible. The purpose of the investigation reported here was to develop a method for defining modal structure by means of a continuously traversing microphone system and to perform an evaluation of the method, based upon analytical studies and computer simulated tests. A variety of system parameters were examined, and the effects of deviations from ideal were explored. Effects of traverse speed, digitizing rate, run time, roundoff error, calibration errors, and random noise background level were determined. For constant fan operating speed, the sensitivity of the method to normal errors and deviations was determined to be acceptable. Good recovery of mode coefficients was attainable. Fluctuating fan speed conditions received special attention, and it was concluded that by employing suitable time delay procedures, satisfactory information on mode coefficients can be obtained under realistic conditions. A plan for further development involving fan rig tests was prepared