Method of producing a plug-type heat flux gauge

A method of making a plug-type heat flux gauge in a material specimen in which a thermoplug is integrally formed in the specimen is disclosed. The thermoplug and concentric annulus are formed in the material specimen by electrical discharge machining and trepanning procedures. The thermoplug is surrounded by a concentric annulus through which thermocouple wires are routed. The end of each thermocouple wire is welded to the thermoplug, with each thermocouple wire welded at a different location along the length of the thermoplug

Plug-type heat flux gauge

A plug-type heat flux gauge formed in a material specimen and having a thermoplug integrally formed in the material specimen, and a method for making the same are disclosed. The thermoplug is surrounded by a concentric annulus, through which thermocouple wires are routed. The end of each thermocouple wire is welded to the thermoplug, with each thermocouple wire welded at a different location along the length of the thermoplug. The thermoplug and concentric annulus may be formed in the material specimen by electrical discharge machining and trepanning procedures

Locating a robber with multiple probes

We consider a game in which a cop searches for a moving robber on a connected graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt, Erickson and West showed that for any $n$-vertex graph $G$ there is a winning strategy for the cop on the graph $G^{1/m}$ obtained by replacing each edge of $G$ by a path of length $m$, if $m\geq n$. The present authors showed that, for all but a few small values of $n$, this bound may be improved to $m\geq n/2$, which is best possible. In this paper we consider the natural extension in which the cop probes a set of $k$ vertices, rather than a single vertex, at each turn. We consider the relationship between the value of $k$ required to ensure victory on the original graph and the length of subdivisions required to ensure victory with $k=1$. We give an asymptotically best-possible linear bound in one direction, but show that in the other direction no subexponential bound holds. We also give a bound on the value of $k$ for which the cop has a winning strategy on any (possibly infinite) connected graph of maximum degree $\Delta$, which is best possible up to a factor of $(1-o(1))$.Comment: 16 pages, 2 figures. Updated to show that Theorem 2 also applies to infinite graphs. Accepted for publication in Discrete Mathematic

Subdivisions in the Robber Locating Game

We consider a game in which a cop searches for a moving robber on a graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi, Delcourt, Erickson and West showed that for any n-vertex graph $G$ there is a winning strategy for the cop on the graph $G^{1/m}$ obtained by replacing each edge of $G$ by a path of length $m$, if $m \geqslant n$. They conjectured that this bound was best possible for complete graphs, but the present authors showed that in fact the cop wins on $K^{1/m}$ if and only if $m \geqslant n/2$, for all but a few small values of $n$. In this paper we extend this result to general graphs by proving that the cop has a winning strategy on $G^{1/m}$ provided $m \geqslant n/2$ for all but a few small values of $n$; this bound is best possible. We also consider replacing the edges of $G$ with paths of varying lengths.Comment: 13 Page

The Influence of the Thirty Years War on the German Lutheran Hymnists of that Perod

The writer will endeavour to show by the presentation of pertinent material that it seems highly probable that the Thirty Years War had a definite influence on the German Lutheran hymnists in the themes which they stressed

Mild pro-2-groups and 2-extensions of Q with restricted ramification

Using the mixed Lie algebras of Lazard, we extend the results of the first author on mild groups to the case p=2. In particular, we show that for any finite set S_0 of odd rational primes we can find a finite set S of odd rational primes containing S_0 such that the Galois group of the maximal 2-extension of Q unramified outside S is mild. We thus produce a projective system of such Galois groups which converge to the maximal pro-2-quotient of the absolute Galois group of \Q unramified at 2 and $\infty$. Our results also allow results of Alexander Schmidt on pro-p-fundamental groups of marked arithmetic curves to be extended to the case p=2 over a global field which is either a function field of odd characteristic or a totally imaginary number field

The Affective Presidency

This dissertation explores the relationship between affect, political emotions, and presidential rhetoric. In examining the political philosophy and presidency of Woodrow Wilson, this dissertation explores how presidential rhetoric captures, channels, and/or directs the passions of the people. Drawing on research by Sarah Ahmed and Brian Masummi, this dissertation argues that presidential rhetoric intervenes into the affective process by directing the passions of citizens towards promises of happiness and investment in presidential power. Two case studies, one focusing on Wilson’s tour in support of the League of Nations and the other on presidential museums, highlight the affective function of presidential rhetoric. The dissertation concludes with an examination of how Donald Trump’s campaign can be understood through the lens of the affective presidency and the state of American Democracy in 2016

A hybrid sensor network for watershed monitoring

This thesis discusses the Hydrological Hybrid Communication Sensor Network (HHCSN), which is designed for in situ measurement of various hydrological properties of a watershed. HHCSN is comprised of a network of sensor strings, each of which connects up to 100 sensing nodes on a communication line as long as 100 m. Each node includes sensors that measure soil attributes of interest, as well as a microcontroller with basic communication and processing capabilities. A relay point at the surface compresses data from the nodes and wirelessly transmits it to a base station that serves as a gateway to the outside world. The base station compresses data from multiple strings and utilizes the GSM cellular infrastructure to communicate the data to a remote server and to receive software updates to be disseminated to the sensor strings. Ultra-low power design and remote maintenance result in an unattended eld life of over ve years. The system is scalable in area and sensor design modality, as covering a larger area would only entail the addition of sensor strings, and the nodes are designed to facilitate the interfacing of additional sensors. The system is robust, as the only exposed portion is the relay point. Data collection and transmission can be event-driven or time-driven. Battery power, which is supplemented by solar harvesting, and wireless short- and long-range communication, eliminate the need for surface wiring, signicantly reducing the cost of system deployment. Currently, the estimate is a cost of less than $40 for each sensor string, which compares very favorably to the price of existing systems, most of which oer very limited in situ measurement capabilities, yet cost tens of thousands of dollars --Abstract, page iii