Fast Response Exhaust Gas Temperature Measurement in IC Engines

The harsh environment presented by engines, particularly in the exhaust systems, often necessitates the use of robust and therefore low bandwidth temperature sensors. Consequently, high frequencies are attenuated in the output. One technique for addressing this problem involves measuring the gas temperature using two sensors with different time-constants and mathematically reconstructing the true gas temperature from the resulting signals. Such a technique has been applied in gas turbine, rocket motor and combustion research. A new reconstruction technique based on difference equations has been developed and its effectiveness proven theoretically. The algorithms have been successfully tested and proven on experimental data from a rig that produces cyclic temperature variations. These tests highlighted that the separation of the thermocouple junctions must be very small to ensure that both sensors are subjected to the same gas temperatures. Exhaust gas temperatures were recorded by an array of thermocouples during transient operation of a high performance two-stroke engine. The results show that the increase in bandwidth arising from the dual sensor technique allowed accurate measurement of exhaust gas temperature with relatively robust thermocouples. Finally, an array of very fine thermocouples (12.5 - 50 microns) was used to measure the in-cycle temperature variation in the exhaust.

Artificial magnetic conductor surfaces and their application to low-profile high-gain planar antennas

Planar periodic metallic arrays behave as artificial magnetic conductor (AMC) surfaces when placed on a grounded dielectric substrate and they introduce a zero degrees reflection phase shift to incident waves. In this paper the AMC operation of single-layer arrays without vias is studied using a resonant cavity model and a new application to high-gain printed antennas is presented. A ray analysis is employed in order to give physical insight into the performance of AMCs and derive design guidelines. The bandwidth and center frequency of AMC surfaces are investigated using full-wave analysis and the qualitative predictions of the ray model are validated. Planar AMC surfaces are used for the first time as the ground plane in a high-gain microstrip patch antenna with a partially reflective surface as superstrate. A significant reduction of the antenna profile is achieved. A ray theory approach is employed in order to describe the functioning of the antenna and to predict the existence of quarter wavelength resonant cavities.

Ultrafast Low-Loss 40-70 GHz SPST Switch

The design and characterizations of an ultrafast single-pole single-throw (SPST) absorptive differential switch are presented. The switch exhibits low insertion loss less than 1 dB, and isolation better than 16 dB from 40 to 70 GHz. Sub-nanosecond switching time is achieved by adopting a differential current-steering technique. The total measured rise and fall time are 75 ps envisaging that switching rates up to 13 Gb/s are achievable. To our best knowledge, this is the fastest, lowest insertion loss V-band SPST switch yet reported that can operate over a wide bandwidth of 30 GHz.

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick “repairs,” which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions, without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been l in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most l log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degree would have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network.

The Forgiving Graph:A distributed data structure for low stretch under adversarial attack

We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that, over a sequence of rounds, an adversary either inserts a node with arbitrary connections or deletes an arbitrary node from the network. The network responds to each such change by quick "repairs," which consist of adding or deleting a small number of edges. These repairs essentially preserve closeness of nodes after adversarial deletions,without increasing node degrees by too much, in the following sense. At any point in the algorithm, nodes v and w whose distance would have been - in the graph formed by considering only the adversarial insertions (not the adversarial deletions), will be at distance at most - log n in the actual graph, where n is the total number of vertices seen so far. Similarly, at any point, a node v whose degreewould have been d in the graph with adversarial insertions only, will have degree at most 3d in the actual graph. Our distributed data structure, which we call the Forgiving Graph, has low latency and bandwidth requirements. The Forgiving Graph improves on the Forgiving Tree distributed data structure from Hayes et al. (2008) in the following ways: 1) it ensures low stretch over all pairs of nodes, while the Forgiving Tree only ensures low diameter increase; 2) it handles both node insertions and deletions, while the Forgiving Tree only handles deletions; 3) it requires only a very simple and minimal initialization phase, while the Forgiving Tree initially requires construction of a spanning tree of the network. © Springer-Verlag 2012.

Compact Low-Profile Antenna for Wireless Medical Vital Sign Monitors at 868 MHz

A low-profile wearable antenna suitable for integration into low-cost, disposable medical vital signs monitors is presented. Simulated and measured antenna performance was characterized on a layered human tissue phantom, representative of the thorax region of a range of human bodies. The wearable antenna has sufficient bandwidth for the 868 MHz Industrial, Scientific and Medical frequency band. Wearable radiation efficiency of up to 30 % is reported when mounted in close proximity to the novel human tissue phantom antenna test-bed at 868 MHz.

Comprehensive numerical modelling of the performance of a second harmonic generation stage coupled with a low-gain optical parametric amplifier

We present a comprehensive model for predicting the full performance of a second harmonic generation-optical parametric amplification system that aims at enhancing the temporal contrast of laser pulses. The model simultaneously takes into account all the main parameters at play in the system such as the group velocity mismatch, the beam divergence, the spectral content, the pump depletion, and the length of the nonlinear crystals. We monitor the influence of the initial parameters of the input pulse and the interdependence of the two related non-linear processes on the performance of the system and show its optimum configuration. The influence of the initial beam divergence on the spectral and the temporal characteristics of the generated pulse is discussed. In addition, we show that using a crystal slightly longer than the optimum length and introducing small delay between the seed and the pump ensures maximum efficiency and compensates for the spectral shift in the optical parametric amplification stage in case of chirped input pulse. As an example, calculations for bandwidth transform limited and chirped pulses of sub-picosecond duration in beta barium borate crystal are presented.