Institute for Systems Research Technical Reports

Permanent URI for this collectionhttp://hdl.handle.net/1903/4376

This archive contains a collection of reports generated by the faculty and students of the Institute for Systems Research (ISR), a permanent, interdisciplinary research unit in the A. James Clark School of Engineering at the University of Maryland. ISR-based projects are conducted through partnerships with industry and government, bringing together faculty and students from multiple academic departments and colleges across the university.

Browse

Search Results

Now showing 1 - 10 of 1169
  • Thumbnail Image
    Item
    On the Converse to Pompeiu's Problem
    (1997) Berenstein, Carlos A.; ISR
    This is a reprint of a 1976 paper that appears in an inaccessible Brazilian journal and has become very looked after. It deals with the problem of determining a convex plane domain from the existence of infinitely many over determined Neumann eigenvalues. Recent related work in magneto hydrodynamics of Vogelius and other applications are closely related to this result. The more general result appears in J. Analyse Math 1980 and Crelle l987. See Zalcmain's bibliographic survey of pompeiu problem for other references.
  • Thumbnail Image
    Item
    Logistic Mixtures of Generalized Linear Model Times Series
    (1998) Jeffries, Neal O.; Kedem, B.; ISR
    In this dissertation we propose a class of time series models for mixture data. We call these logistic mixtures. In such models the mixture's component densities have a generalized linear model (GLM) form. The regime probabilities are allowed to change over time and are modeled with a logistic regression structure. The regressors of both the component GLM distributions and the logistic probabilities may include covariates as well as past values of the process. We develop an EM algorithm for estimation, give conditions for consistency and asymptotic normality, examine the model through simulations, and apply it to rain rate data. Finally, we consider a likelihood ratio-based test for determining if the data arise from a logistic mixture versus the null hypothesis of the data coming from a single distribution (i.e. no mixture). Because the mixture probabilities are not constant, we are able to develop a test that avoids some of the problems associated with likelihood ratio tests of mixtures.
  • Thumbnail Image
    Item
    Dynamics of Neural Responses in Ferret Primary Auditory Cortex: I. Spectro-Temporal Response Field Characterization by Dynamic Ripple Spectra
    (1999) Depireux, Didier A.; Simon, J.Z.; Klein, David J.; Shamma, S.A.; ISR; CAAR
    To understand the neural representation of broadband, dynamic sounds in Primary Auditory Cortex (AI), we characterize responses using the Spectro-Temporal Response Field (STRF). The STRF describes and predicts the linear response of neurons to sounds with rich spectro-temporal envelopes. It is calculated here from the responses to elementary "ripples," a family of sounds with drifting, sinusoidal, spectral envelopes--the complex spectro-temporal envelope of any broadband, dynamic sound can expressed as the linear sum of individual ripples.

    The collection of responses to all elementary ripples is the spectro-temporal transfer function. Previous experiments using ripples with downward drifting spectra suggested that the transfer function is separable, i.e., it is reducible into a product of purely temporal and purely spectral functions.

    Here we compare the responses to upward and downward drifting ripples, assuming separability within each direction, to determine if the total bi-directional transfer function is fully separable. In general, the combined transfer function for two directions is not symmetric, and hence units in AI are not, in general, fully separable. Consequently, many AI units have complex response properties such as sensitivity to direction of motion, though most inseparable units are not strongly directionally selective.

    We show that for most neurons the lack of full separability stems from differences between the upward and downward spectral cross-sections, not from the temporal cross-sections; this places strong constraints on the neural inputs of these AI units.

  • Thumbnail Image
    Item
    Spectro-Temporal Modulation Transfer Functions and Speech Intelligibility
    (1999) Chi, Taishih; Gao, Yujie; Guyton, Matthew C.; Ru, Powen; Shamma, Shihab; ISR; CAAR
    Detection thresholds for spectral and temporal modulations are measuredusing broadband spectra with sinusoidally rippled profiles that drift up or down the log-frequency axis at constant velocities. Spectro-temporal Modulation Transfer Functions (MTF) are derived as a function of ripple peak density (cycles/octave) and drifting velocity (Hz). MTFs exhibit a lowpass function with respect to both dimensions, with 50 percent bandwidths ofabout 16 Hz and 2 cycles/octave. The data replicate (as special cases) previously measured purely temporal MTFs [Viemeister, 1979] and purely spectral MTFs [Green, 1986].

    We present a computational auditory model that exhibits spectro-temporal MTFs consistent with the salient trends in the data.The model is used to demonstrate the potential relevance of these MTFsto the assessment of speech intelligibility in noise and reverberantconditions.

  • Thumbnail Image
    Item
    Robust Spectro-Temporal Reverse Correlation for the Auditory System: Optimizing Stimulus Design
    (1999) Klein, David J.; Depireux, Didier A.; Simon, J.Z.; Shamma, S.A.; ISR; CAAR
    The spectro-temporal receptive field (STRF) is a functionaldescriptor of the linear processing of time-varying acoustic spectra by theauditory system. By cross-correlating sustained neuronal activity with the"dynamic spectrum" of a spectro-temporally rich stimulus ensemble, oneobtains an estimate of the STRF.

    In this paper, the relationship betweenthe spectro-temporal structure of any given stimulus and the quality ofthe STRF estimate is explored and exploited. Invoking the Fouriertheorem, arbitrary dynamic spectra are described as sums of basicsinusoidal components, i.e., "moving ripples." Accurate estimation isfound to be especially reliant on the prominence of components whosespectral and temporal characteristics are of relevance to the auditorylocus under study, and is sensitive to the phase relationships betweencomponents with identical temporal signatures.

    These and otherobservations have guided the development and use of stimuli withdeterministic dynamic spectra composed of the superposition of many"temporally orthogonal" moving ripples having a restricted, relevant rangeof spectral scales and temporal rates.

    The method, termedsum-of-ripples, is similar in spirit to the "white-noise approach," butenjoys the same practical advantages--which equate to faster and moreaccurate estimation--attributable to the time-domain sum-of-sinusoidsmethod previously employed in vision research. Application of the methodis exemplified with both modeled data and experimental data from ferretprimary auditory cortex (AI).

  • Thumbnail Image
    Item
    The Static Stochastic Ground Holding Problem with Aggregate Demands
    (1999) Ball, Michael O.; Hoffman, Robert L.; Odoni, A.; Rifkin, R.; Ball, Michael O.; ISR; NEXTOR
    The ground delay program is a mechanism used to decrease the rate of incoming flights into an airport when it is projected that arrival demand into the airport will exceed capacity. In this paper, we present an integer programming model for plannning ground delay programs. The model considers a stochastic capacity profile which is represented by a set of airport capacity scenarios and their probabilities. Both the demand on the airport and the output of the model are represented at an aggregate level in terms of number of flights per unit time. This allows the model to be used in conjunction with arbitrarily complex preprocesses for allocating individual flights to slots. It was specifically designed to be used in the Collaborative Decision Making setting where individual flight assignments result from an iterative process involving both the airlines and traffic flow managers. We show that the linear programming dual of the model can be transformed into a network flow problem. This implies that the integer program can be solved efficiently using linear programming or network flow models.
  • Thumbnail Image
    Item
    Approximate Matrix Diagonalization for Use in Distributed Control Networks
    (1999) Kantor, George A.; Krishnaprasad, P.S.; ISR; CDCSS
    Distributed control networks are rapidly emerging as aviable and important alternative to centralized control. In a typical distributed control network, a number of spatially distributed nodescomposed of "smart" sensors and actuators are used to take measurements and apply control inputs to some physical plant. The nodes have local processing power and the ability to communicate with the other nodes via a network. The challenge is to compute and implement a feedback law for the resulting MIMO system in a distributed manner on the network.

    Our approach to this problem is based on plant diagonalization.To do this, we search for basis transformations for the vector of outputs coming from the sensors and the vector of inputs applied to the actuators so that, in the new bases, the MIMOsystem becomes a collection of decoupled SISO systems.This formulation provides a number of advantages for the synthesis and implementation of a feedback control law,particularly for systems where the number of inputs and outputs is large.

    Of course, in order for this idea to be feasible,the required basis transformations must have properties which allow them to be implemented on a distributed control network. Namely, they must be computed in a distributed manner which respects the spatial distribution of the data(to reduce communication overhead) and takes advantage of the massive parallel processing capability of the network (to reduce computation time).

    In this thesis, we present some tools which can be used to find suitable transforms which achieve "approximate"plant diagonalization. We begin by showing how to search the large collection of orthogonal transforms which are contained in the wavelet packet to find the one which most nearly, or approximately, diagonalizes a given real valued matrix.Wavelet packet transforms admit a natural distributed implementation,making them suitable for use on a control network.We then introduce a class of linear operators called recursive orthogonal transforms (ROTs) which we have developed specifically for the purpose of signal processing on distributed control networks.

    We show how to use ROTs to approximately diagonalize fixed real and complex matricesas well as transfer function matrices which exhibit a spatial invariance property. Numerical examples of allproposed diagonalization methods are presented and discussed.

  • Thumbnail Image
    Item
    Modeling and Reduction with Applications to Semiconductor Processing
    (1999) Newman, Andrew J.; Krishnaprasad, P.S.; ISR; CDCSS
    This thesis consists of several somewhat distinct but connected parts, withan underlying motivation in problems pertaining to control and optimizationof semiconductor processing. The first part (Chapters 3 and 4) addressesproblems in model reduction for nonlinear state-space control systems. In1993, Scherpen generalized the balanced truncation method to the nonlinearsetting. However, the Scherpen procedure is not easily computable and hasnot yet been applied in practice.

    We offer a method for computing a workingapproximation to the controllability energy function, one of the mainobjects involved in the method. Moreover, we show that for a class ofsecond-order mechanical systems with dissipation, under certain conditionsrelated to the dissipation, an exact formula for the controllabilityfunction can be derived. We then present an algorithm for a numericalimplementation of the Morse-Palais lemma, which produces a local coordinatetransformation under which a real-valued function with a non-degeneratecritical point is quadratic on a neighborhood of the critical point.

    Application of the algorithm to the controllabilty function plays a key rolein computing the balanced representation. We then apply our methods andalgorithms to derive balanced realizations for nonlinear state-space modelsof two example mechanical systems: a simple pendulum and a double pendulum.

    The second part (Chapter 5) deals with modeling of rapid thermal chemicalvapor deposition (RTCVD) for growth of silicon thin films, viafirst-principles and empirical analysis. We develop detailedprocess-equipment models and study the factors that influence depositionuniformity, such as temperature, pressure, and precursor gas flow rates,through analysis of experimental and simulation results. We demonstratethat temperature uniformity does not guarantee deposition thicknessuniformity in a particular commercial RTCVD reactor of interest.

    In thethird part (Chapter 6) we continue the modeling effort, specializing to acontrol system for RTCVD heat transfer. We then develop and apply ad-hocversions of prominent model reduction approaches to derive reduced modelsand perform a comparative study.

  • Thumbnail Image
    Item
    The Performance of a Deformable-Membrane Tactile Sensor: Basic Results on Geometrically-Defined Tasks
    (1999) Hristu, Dimitrios; Ferrier, Nicola J.; Brockett, Roger W.; ISR; CDCSS
    The limitations of rigid fingertips in the precise andalgorithmic study of manipulation have been discussed in many works,some dating back more than a decade. Despite that fact, much of thework in dexterous manipulation has continued to use the"point-contact" model for finger-object interactions. In fact, mostexsisting tactile sensing technologies are not adaptable todeformable fingertips.

    In this work we report on experimentalresults obtained with a deformable tactile sensor whose properties arewell-suited to manipulation. The results presented here show that thesensor described provides a rich set of tactile data.

  • Thumbnail Image
    Item
    Stabilization of LTI Systems with Communication Constraints
    (1999) Hristu, Dimitrios; ISR; CDCSS
    This work is directed towards exploring interactions ofcommunication and control in systems with communication constraints.Examples of such systems include groups of autonomousvehicles, MEMS arrays and systems whose sensors and actuators aredistributed across a network. We extend some recent results involvingthe stabilization of LTI systems under limited communication andaddress a class of feed-forward control problems for the systems ofinterest.