Twin-Width VIII: Delineation and Win-Wins

We introduce the notion of delineation. A graph class C is said delineated by twin-width (or simply, delineated) if for every hereditary closure D of a subclass of C, it holds that D has bounded twin-width if and only if D is monadically dependent. An effective strengthening of delineation for a class C implies that tractable FO model checking on C is perfectly understood: On hereditary closures of subclasses D of C, FO model checking on D is fixed-parameter tractable (FPT) exactly when D has bounded twin-width. Ordered graphs [BGOdMSTT, STOC \u2722] and permutation graphs [BKTW, JACM \u2722] are effectively delineated, while subcubic graphs are not. On the one hand, we prove that interval graphs, and even, rooted directed path graphs are delineated. On the other hand, we observe or show that segment graphs, directed path graphs (with arbitrarily many roots), and visibility graphs of simple polygons are not delineated. In an effort to draw the delineation frontier between interval graphs (that are delineated) and axis-parallel two-lengthed segment graphs (that are not), we investigate the twin-width of restricted segment intersection classes. It was known that (triangle-free) pure axis-parallel unit segment graphs have unbounded twin-width [BGKTW, SODA \u2721]. We show that K_{t,t}-free segment graphs, and axis-parallel H_t-free unit segment graphs have bounded twin-width, where H_t is the half-graph or ladder of height t. In contrast, axis-parallel H?-free two-lengthed segment graphs have unbounded twin-width. We leave as an open question whether unit segment graphs are delineated. More broadly, we explore which structures (large bicliques, half-graphs, or independent sets) are responsible for making the twin-width large on the main classes of intersection and visibility graphs. Our new results, combined with the FPT algorithm for first-order model checking on graphs given with O(1)-sequences [BKTW, JACM \u2722], give rise to a variety of algorithmic win-win arguments. They all fall in the same framework: If p is an FO definable graph parameter that effectively functionally upperbounds twin-width on a class C, then p(G) ? k can be decided in FPT time f(k) ? |V(G)|^O(1). For instance, we readily derive FPT algorithms for k-Ladder on visibility graphs of 1.5D terrains, and k-Independent Set on visibility graphs of simple polygons. This showcases that the theory of twin-width can serve outside of classes of bounded twin-width

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

Wind profiler signal detection improvements

Research is described on potential improvements to the software used with the NASA 49.25 MHz wind profiler located at Kennedy Space Center. In particular, the analysis and results are provided of a study to (1) identify preferred mathematical techniques for the detection of atmospheric signals that provide wind velocities which are obscured by natural and man-made sources, and (2) to analyze one or more preferred techniques to demonstrate proof of the capability to improve the detection of wind velocities

Hierarchical Poly Tree Configurations for the Solution of Dynamically Refined Finte Element Models

This paper demonstrates how a multilevel substructuring technique, called the Hierarchical Poly Tree (HPT), can be used to integrate a localized mesh refinement into the original finite element model more efficiently. The optimal HPT configurations for solving isoparametrically square h-, p-, and hp-extensions on single and multiprocessor computers is derived. In addition, the reduced number of stiffness matrix elements that must be stored when employing this type of solution strategy is quantified. Moreover, the HPT inherently provides localize 'error-trapping' and a logical, efficient means with which to isolate physically anomalous and analytically singular behavior

Determination of the masses of the Moon and Venus and the astronomical unit from radio tracking data of the Mariner II SPACECRAFT

Masses of Venus and Moon, and astronomical unit determined by Mariner II radio tracking dat