Monolithic microwave integrated circuits: Interconnections and packaging considerations

Monolithic microwave integrated circuits (MMIC's) above 18 GHz were developed because of important potential system benefits in cost reliability, reproducibility, and control of circuit parameters. The importance of interconnection and packaging techniques that do not compromise these MMIC virtues is emphasized. Currently available microwave transmission media are evaluated to determine their suitability for MMIC interconnections. An antipodal finline type of microstrip waveguide transition's performance is presented. Packaging requirements for MMIC's are discussed for thermal, mechanical, and electrical parameters for optimum desired performance

Light Nonaqueous-Phase Liquid Hydrocarbon Weathering at some JP-4 Fuel Release Sites

A fuel weathering study was conducted for database entries to estimate natural light, nonaqueousphase liquid weathering and source-term reduction rates for use in natural attenuation models. A range of BTEX weathering rates from mobile LNAPL plumes at eight field sites with known release dates was documented. Freephase fuel BTEX weathering rates varied among sites and were influenced by many factors. First-order weathering rate for five JP-4 fuel sites was 16%/year. Benzene and toluene exhibited higher weathering rates than ethylbenzene and xylene, as expected, because of higher water solubility. The primary weathering mechanism of mobile LNAPL was dissolution. Meaningful determination of mobile LNAPL weathering rates for BTEX in the fuels was difficult because of the large ranges of initial BTEX values

The parameterized complexity of some geometric problems in unbounded dimension

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in \Rd, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in \Rd, decide whether they can be separated by two hyperplanes. iii) Given a system of $n$ linear inequalities with $d$ variables, find a maximum-size feasible subsystem. We show that (the decision versions of) all these problems are W[1]-hard when parameterized by the dimension $d$. %and hence not solvable in ${O}(f(d)n^c)$ time, for any computable function $f$ and constant $c$ %(unless FPT=W[1]). Our reductions also give a $n^{\Omega(d)}$-time lower bound (under the Exponential Time Hypothesis)

Fixed parameter tractable algorithms in combinatorial topology

To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an exponential-time enumeration. However, asymptotically most graphs do not result in any 3-manifold triangulation, which leads to significant "wasted time" in topological enumeration algorithms. Here we give a new algorithm to determine whether a given face pairing graph supports any 3-manifold triangulation, and show this to be fixed parameter tractable in the treewidth of the graph. We extend this result to a "meta-theorem" by defining a broad class of properties of triangulations, each with a corresponding fixed parameter tractable existence algorithm. We explicitly implement this algorithm in the most generic setting, and we identify heuristics that in practice are seen to mitigate the large constants that so often occur in parameterised complexity, highlighting the practicality of our techniques.Comment: 16 pages, 9 figure

On Structural Parameterizations of Hitting Set: Hitting Paths in Graphs Using 2-SAT

Hitting Set is a classic problem in combinatorial optimization. Its input consists of a set system F over a finite universe U and an integer t; the question is whether there is a set of t elements that intersects every set in F. The Hitting Set problem parameterized by the size of the solution is a well-known W[2]-complete problem in parameterized complexity theory. In this paper we investigate the complexity of Hitting Set under various structural parameterizations of the input. Our starting point is the folklore result that Hitting Set is polynomial-time solvable if there is a tree T on vertex set U such that the sets in F induce connected subtrees of T. We consider the case that there is a treelike graph with vertex set U such that the sets in F induce connected subgraphs; the parameter of the problem is a measure of how treelike the graph is. Our main positive result is an algorithm that, given a graph G with cyclomatic number k, a collection P of simple paths in G, and an integer t, determines in time 2^{5k} (|G| +|P|)^O(1) whether there is a vertex set of size t that hits all paths in P. It is based on a connection to the 2-SAT problem in multiple valued logic. For other parameterizations we derive W[1]-hardness and para-NP-completeness results.Comment: Presented at the 41st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2015. (The statement of Lemma 4 was corrected in this update.

Moderate Resolution Spectroscopy For The Space Infrared Telescope Facility (SIRTF)

A conceptual design for an infrared spectrometer capable of both low resolution (λ/Δ-λ = 50; 2.5-200 microns) and moderate resolution (1000; 4-200 microns) and moderate resolution (1000; 4-200 microns) has been developed. This facility instrument will permit the spectroscopic study in the infrared of objects ranging from within the solar system to distant galaxies. The spectroscopic capability provided by this instrument for SIRTF will give astronomers orders of magnitude greater sensitivity for the study of faint objects than had been previously available. The low resolution mode will enable detailed studies of the continuum radiation. The moderate resolution mode of the instrument will permit studies of a wide range of problems, from the infrared spectral signatures of small outer solar system bodies such as Pluto and the satellites of the giant planets, to investigations of more luminous active galaxies and QS0s at substantially greater distances. A simple design concept has been developed for the spectrometer which supports the science investigation with practical cryogenic engineering. Operational flexibility is preserved with a minimum number of mechanisms. The five modules share a common aperture, and all gratings share a single scan mechanism. High reliability is achieved through use of flight-proven hardware concepts and redundancy. The design controls the heat load into the SIRTF cryogen, with all heat sources other than the detectors operating at 7K and isolated from the 4K cold station. Two-dimensional area detector arrays are used in the 2.5-120μm bands to simultaneously monitor adjacent regions in extended objects and to measure the background near point sources

Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms

The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted to bipartite graphs. Regarding the upper bound, we show that for any graph of order n, its local minimum degree is at most 3n/8+o(n) and n/4+o(n) for bipartite graphs, improving the known n/2 upper bound. We also prove that the local minimum degree is smaller than half of the vertex cover number (up to a logarithmic term). The local minimum degree problem is NP-Complete and hard to approximate. We show that this problem, even when restricted to bipartite graphs, is in W[2] and FPT-equivalent to the EvenSet problem, which W[1]-hardness is a long standing open question. Finally, we show that the local minimum degree is computed by a O*(1.938^n)-algorithm, and a O*(1.466^n)-algorithm for the bipartite graphs

Model for floodplain management in urbanizing areas

A target land use pattern found using a dynamic programming model is shown to be a useful reference for comparing the success of floodplain management policies. At least in the test case, there is interdependence in the land use allocation for floodplain management--that is, a good solution includes some reduction of current land use in the floodplain and some provision of detention storage. For the test case, current floodplain management policies are not sufficient; some of the existing floodplain use should be removed. Although specific land use patterns are in part sensitive to potential error in land value data and to inaccuracy in the routing model, the general conclusion that some existing use must be removed is stable within the range of likely error. Trend surface analysis is shown to be a potentially useful way of generating bid price data for use in land use allocation models. Sensitivity analysis of the dynamic programming model with respect to routing of hydrographs is conducted through simulation based on expected distributions of error.U.S. Geological SurveyU.S. Department of the InteriorOpe

STS in management education: connecting theory and practice

This paper explores the value of science and technology studies (STS) to management education. The work draws on an ethnographic study of second year management undergraduates studying decision making. The nature and delivery of the decision making module is outlined and the value of STS is demonstrated in terms of both teaching method and module content. Three particular STS contributions are identified and described: the social construction of technological systems; actor network theory; and ontological politics. Affordances and sensibilities are identified for each contribution and a discussion is developed that illustrates how these versions of STS are put to use in management education. It is concluded that STS has a pivotal role to play in critical management (education) and in the process offers opportunities for new forms of managin