Directional Field-Dependence of Magnetoimpedance Effect on Integrated YIG/Pt-Stripline System

We investigated the magnetization dynamics through the magnetoimpedance effect in an integrated YIG/Pt-stripline system in the frequency range of 0.5 up to 2.0 GHz. Specifically, we explore the dependence of the dynamic magnetic behavior on the field orientation by analyzing beyond the traditional longitudinal magnetoimpedance effect of the transverse and perpendicular setups. We disclose here the strong dependence of the effective damping parameter on the field orientation, as well as verification of the very-low damping parameter values for the longitudinal and transverse configurations. We find considerable sensitivity results, bringing to light the facilities to integrate ferrimagnetic insulators in current and future technological applications.

1.2 kV, 10 A, 4H-SiC Bi-Directional Field Effect Transistor (BiDFET) with Low On-State Voltage Drop

Bidirectional power switches are used in matrix-or cyclo-converters and in multistage inverter circuits to facilitate high-frequency AC-to-AC conversion. A new 1.2 kV bidirectional MOSFET (BiDFET) with low on-resistance is achieved and demonstrated using two discrete SiC power MOSFET bare die chips, packaged within a four-terminal custom-designed module. Static and dynamic characterization has been carried out to inspect the on-state and switching behaviour of the BiDFET. The BiDFET is shown to have a low forward voltage drop of 0.6 V at a current of 10 A, which is more than 2.5x smaller than previous Si IGBT and SiC MOSFET based bidirectional switch implementations.

Complete and optimal visibility-based pursuit-evasion

This paper computes a minimum-length pursuer trajectory that solves a visibility-based pursuit-evasion problem in which a single pursuer moving through a simply-connected polygonal environment seeks to locate an evader which may move arbitrarily fast, using an omni-directional field-of-view that extends to the environment boundary. We present a complete algorithm that computes a minimum-cost pursuer trajectory that ensures that the evader is captured, or reports in finite time that no such trajectory exists. This result improves upon the known algorithm of Guibas, Latombe, LaValle, Lin, and Motwani, which is complete but makes no guarantees about the quality of the solution. Our algorithm employs a branch-and-bound forward search that considers pursuer trajectories that could potentially lead to an optimal pursuer strategy. The search is performed on an exponential graph that can generate an infinite number of unique pursuer trajectories, so we must conduct meticulous pruning during the search to quickly discard pursuer trajectories that are demonstrably suboptimal. We describe an implementation of the algorithm, along with experiments that measure its performance in several environments with a variety of pruning operations.