Real-time decoding of question-and-answer speech dialogue using human cortical activity.

Natural communication often occurs in dialogue, differentially engaging auditory and sensorimotor brain regions during listening and speaking. However, previous attempts to decode speech directly from the human brain typically consider listening or speaking tasks in isolation. Here, human participants listened to questions and responded aloud with answers while we used high-density electrocorticography (ECoG) recordings to detect when they heard or said an utterance and to then decode the utterance's identity. Because certain answers were only plausible responses to certain questions, we could dynamically update the prior probabilities of each answer using the decoded question likelihoods as context. We decode produced and perceived utterances with accuracy rates as high as 61% and 76%, respectively (chance is 7% and 20%). Contextual integration of decoded question likelihoods significantly improves answer decoding. These results demonstrate real-time decoding of speech in an interactive, conversational setting, which has important implications for patients who are unable to communicate

Deuterium concentration by chemically-refluxed ammonia-hydrogen exchange : Supplementary reports

Statement of responsibility on title-page reads M. Benedict, E.A. Mason, E.R. Chow, J.S. Baron"June 1969.""MIT-D15."Includes bibliographical referencesU.S. Atomic Energy Commission Subcontract AX-210280MIT DSR- 7067

Deuterium concentration by chemically-refluxed ammonia-hydrogen exchange : Final report

Statement of responsibility on title-page reads E.A. Mason, M. Benedict, E.R. Chow, J.S. Baron"June 1969.""MIT-D14."Includes bibliographical references (leaves 89-92)Final report; June 1969U.S. Atomic Energy Commission Subcontract AX-210280MIT DSR- 7067

The decontamination of radioactive ion exchange resins using neutral salts as elutriants

Includes bibliographical references (leaves 124-126

Development of utility system simulation model

"Worked preformed for Commonwealth Edison Company, Chicago, Illinois."Includes bibliographical references (leaf 28)MIT DSR Project 7210

Luminosity Function of Faint Globular Clusters in M87

We present the luminosity function to very faint magnitudes for the globular clusters in M87, based on a 30 orbit \textit{Hubble Space Telescope (HST)} WFPC2 imaging program. The very deep images and corresponding improved false source rejection allow us to probe the mass function further beyond the turnover than has been done before. We compare our luminosity function to those that have been observed in the past, and confirm the similarity of the turnover luminosity between M87 and the Milky Way. We also find with high statistical significance that the M87 luminosity function is broader than that of the Milky Way. We discuss how determining the mass function of the cluster system to low masses can constrain theoretical models of the dynamical evolution of globular cluster systems. Our mass function is consistent with the dependence of mass loss on the initial cluster mass given by classical evaporation, and somewhat inconsistent with newer proposals that have a shallower mass dependence. In addition, the rate of mass loss is consistent with standard evaporation models, and not with the much higher rates proposed by some recent studies of very young cluster systems. We also find that the mass-size relation has very little slope, indicating that there is almost no increase in the size of a cluster with increasing mass.Comment: 22 pages, 5 figures, Accepted for publication in Ap

Manned maneuvering unit applications for automated rendezvous and capture

Automated Rendezvous and Capture (AR&C) is an important technology to multiple National Aeronautics and Space Administration (NASA) programs and centers. The recent Johnson Spacecraft Center (JSC) AR&C Quality Function Deployment (QFD) has listed on-orbit demonstration of related technologies as a near term priority. Martin Marietta has been evaluating use of the Manned Maneuvering Unit (MMU) for a low cost near term on-orbit demonstration of AR&C technologies such as control algorithms, sensors, and processors as well as system level performance. The MMU Program began in 1979 as the method of repairing the Space Shuttle (STS) Thermal Protection System (the tiles). The units were not needed for this task, but were successfully employed during three Shuttle flights in 1984: a test flight was flown in in February as proof of concept, in April the MMU participated in the Solar Max Repair Mission, and in November the MMU's returned to space to successfully rescue the two errant satellites, Westar and Palapa. In the intervening years, the MMU simulator and MMU Qualification Test Unit (QTU) have been used for Astronaut training and experimental evaluations. The Extra-Vehicular Activities (EVA) Retriever has used the QTU, in an unmanned form, as a free-flyer on the Johnson Space Center (JSC) Precision Air Bearing Floor (PABF). Currently, the MMU is undergoing recertification for flight. The two flight units were removed from storage in September, 1991 and evaluation tests were performed. The tests demonstrated that the units are in good shape with no discrepancies that would preclude further use. The Return to Flight effort is currently clearing up recertification issues and evaluating the design against the present Shuttle environments

An Asymptotically-Optimal Sampling-Based Algorithm for Bi-directional Motion Planning

Bi-directional search is a widely used strategy to increase the success and convergence rates of sampling-based motion planning algorithms. Yet, few results are available that merge both bi-directional search and asymptotic optimality into existing optimal planners, such as PRM*, RRT*, and FMT*. The objective of this paper is to fill this gap. Specifically, this paper presents a bi-directional, sampling-based, asymptotically-optimal algorithm named Bi-directional FMT* (BFMT*) that extends the Fast Marching Tree (FMT*) algorithm to bi-directional search while preserving its key properties, chiefly lazy search and asymptotic optimality through convergence in probability. BFMT* performs a two-source, lazy dynamic programming recursion over a set of randomly-drawn samples, correspondingly generating two search trees: one in cost-to-come space from the initial configuration and another in cost-to-go space from the goal configuration. Numerical experiments illustrate the advantages of BFMT* over its unidirectional counterpart, as well as a number of other state-of-the-art planners.Comment: Accepted to the 2015 IEEE Intelligent Robotics and Systems Conference in Hamburg, Germany. This submission represents the long version of the conference manuscript, with additional proof details (Section IV) regarding the asymptotic optimality of the BFMT* algorith