High Resolution Microimaging with Pulsed Electrically-Detected Magnetic Resonance

The investigation of paramagnetic species (such as point defects, dopants, and impurities) in solid-state electronic devices is significant because of their effect on device performance. Conventionally, these species are detected and imaged using the electron spin resonance (ESR) technique. In many instances, ESR is not sensitive enough to deal with miniature devices having small numbers of paramagnetic species and high spatial heterogeneity. This limitation can in principle be overcome by employing a more sensitive method called electrically-detected magnetic resonance, which is based on measuring the effect of paramagnetic species on the electric current of the device while inducing electron spin-flip transitions. However, up until now, measurement of the current of the device could not reveal the spatial heterogeneity of its paramagnetic species. We provide here, for the first time, high resolution microimages of paramagnetic species in operating solar cells obtained through electrically-detected magnetic resonance. The method is based on unique microwave pulse sequences for excitation and detection of the electrical signal under a static magnetic field and powerful pulsed magnetic field gradients that spatially encode the electrical current of the sample. The approach developed here can be widely used in the nondestructive three-dimensional inspection and characterization of paramagnetic species in a variety of electronic devices.Comment: 19 pages, 4 figures +S

COVID-19 symptoms at hospital admission vary with age and sex: results from the ISARIC prospective multinational observational study

Background: The ISARIC prospective multinational observational study is the largest cohort of hospitalized patients with COVID-19. We present relationships of age, sex, and nationality to presenting symptoms. Methods: International, prospective observational study of 60 109 hospitalized symptomatic patients with laboratory-confirmed COVID-19 recruited from 43 countries between 30 January and 3 August 2020. Logistic regression was performed to evaluate relationships of age and sex to published COVID-19 case definitions and the most commonly reported symptoms. Results: ‘Typical’ symptoms of fever (69%), cough (68%) and shortness of breath (66%) were the most commonly reported. 92% of patients experienced at least one of these. Prevalence of typical symptoms was greatest in 30- to 60-year-olds (respectively 80, 79, 69%; at least one 95%). They were reported less frequently in children (≤ 18 years: 69, 48, 23; 85%), older adults (≥ 70 years: 61, 62, 65; 90%), and women (66, 66, 64; 90%; vs. men 71, 70, 67; 93%, each P < 0.001). The most common atypical presentations under 60 years of age were nausea and vomiting and abdominal pain, and over 60 years was confusion. Regression models showed significant differences in symptoms with sex, age and country. Interpretation: This international collaboration has allowed us to report reliable symptom data from the largest cohort of patients admitted to hospital with COVID-19. Adults over 60 and children admitted to hospital with COVID-19 are less likely to present with typical symptoms. Nausea and vomiting are common atypical presentations under 30 years. Confusion is a frequent atypical presentation of COVID-19 in adults over 60 years. Women are less likely to experience typical symptoms than men

Improvements on Bottleneck Matching and Related Problems Using Geometry

Let A and B be two sets of n objects in R d , and let M be a (one-to-one) matching between A and B. Let min(M ), max(M ), and \Sigma(M ) denote the length of the shortest edge, the length of the longest edge, and the sum of the lengths of the edges of M respectively. Bottleneck matching---a matching that minimizes max(M )---is suggested as a convenient way for measuring the resemblance between A and B. Several algorithms for computing, as well as approximating, this resemblance are proposed. The running time of all the algorithms involving planar objects is close to O(n 1:5 ). For instance, if the objects are points in the plane, the running time of the exact algorithm is O(n 1:5 log n). A semi-dynamic data-structure for answering containment problems for a set of congruent disks in the plane is developed. This data structure may be of independent interest. Next, the problem of finding a translation of B that maximizes the resemblance to A under the bottleneck matching criterion..

A Multi-Touch Surface Using Multiple Cameras

Abstract. In this project we present a framework for a multi-touch surface using multiple cameras. With an overhead camera and side-mounted camera we determine the three dimensional coordinates of the fingertips and detect touch events. We interpret these events as hand gestures which can be generalized into commands for manipulating applications. We offer an example application of a multi-touch finger painting program.

Path-based System Level Stimuli Generation

Abstract. Over the last few years, there has been increasing emphasis on integrating ready-made components (IP, cores) into complex System on a Chip (SoC) designs. The verification of such designs poses new challenges. At the heart of these challenges lies the requirement to verify the integration of several previously designed components in a relatively short time. Simulation-based methods are the main verification vehicle used for system-level functional verification of SoC designs; therefore, stimuli generation plays an important role in this field. Our work offers a solution for efficiently dealing with the verification of systems with multiple configurations and derivative systems, a common challenge in the context of system verification. We present a generation scheme in which the system behavior is defined using a combination of transaction-based modeling, local component behavior, and the topology of the system. We show how this approach allows the implementation of the verification plan using high level constructs and promotes the reuse of verification IP between systems. The ideas described below were implemented as part of X-Gen, a system-level test-case generator developed and used in IBM. 1

Geometry Helps in Bottleneck Matching and Related Problems

Let A and B be two sets of n objects in R d , and let Match be a (one-to-one) matching between A and B. Let min(Match), max(Match), and \Sigma(Match) denote the length of the shortest edge, the length of the longest edge, and the sum of the lengths of the edges of Match respectively. Bottleneck matching---a matching that minimizes max(Match)---is suggested as a convenient way for measuring the resemblance between A and B. Several algorithms for computing, as well as approximating, this resemblance are proposed. The running time of all the algorithms involving planar objects is roughly O(n 1:5 ). For instance, if the objects are points in the plane, the running time of the exact algorithm is O(n 1:5 log n). A semi-dynamic data-structure for answering containment problems for a set of congruent disks in the plane is developed. This data structure may be of independent interest. Next, the problem of finding a translation of B that maximizes the resemblance to A under the bottlenec..