@conference {
	title = {Output Feedback Risk-Sensitive Control and Differential Games for Continuous-Time Nonlinear Systems},
	author = {James, Matthew R., Baras, John S., Elliott, Robert J.},
	year = {1993},
	month = {12/1993},
	abstract = {In this paper, we carry out a formal analysis of an output feedback risk-sensitive~stochastic control problem. Using large derivation limits this problem is related to a deterministic differential game. Both problems are solved using appropriate information states. The use of an information state~for the game problem is new and is the principal contribution of our work. Our results have important~implications for the nonlinear robust stabilization problem.},
	address = {San Antonio, Texas},
	booktitle = {The 1993 32nd  IEEE Conference on Decision and Control},
	pages = {pp. 3357-3360},
	organization = {Marriott rivercenter}
}
@conference {
	title = {Robust Output Feedback Control for Discrete-Time Nonlinear Systems:  The Finite Time Case},
	author = {Baras, John S., James, Matthew R.},
	year = {1993},
	month = {12/1993},
	abstract = {In this paper we present a new approach to the solution of the output feedback robust control problem. We employ the recently developed concept of information state for output feedback dynamic games and obtain necessary and sufficient conditions for the solution to the robust control problem expressed in terms of the information state. The resulting controller is an information state feedback controller~and is intrinsically infinite dimensional.},
	address = {San Antonio, Texas},
	booktitle = {The 1993 32nd  IEEE Conference on Decision and Control},
	pages = {pp. 51-55},
	organization = {Marriott rivercenter}
}
@conference {
	title = {Implementation of a Dynamic Game Controller for Partially Observed Discrete-Time Nonlinear Systems},
	author = {Teolis, Carole A., James, Matthew R., Baras, John S.},
	year = {1993},
	month = {12/1993},
	abstract = {In this paper we describe an implementation of a certainty equivalence controller for a discrete time partially observed dynamic game problem.},
	address = {San Antonio, Texas},
	booktitle = {The 1993 32nd  IEEE Conference on Decision and Control},
	pages = {pp. 2997-2998},
	organization = {Marriott rivercenter}
}
@conference {
	title = {VLSI Architectures for Orthonormal Wavelets Without Multipliers},
	author = {Frantzeskakis, Emmanuel., Baras, John S.},
	year = {1993},
	month = {11/1993},
	abstract = {The Discrete Wavelet Transform (DWT) is proving to be a highly effective tool in progressive coding of audio and video data. Due to the advances in ISDN network and high definition television (HDTV) technology, a high speed computation of the DWT has become very desirable. Since the algorithmic implementations on programmable DSP chips can not match the high throughput requirements of these applications, the use of Specialized VLSI designs has emerged. The wavelet transform can be implemented by a tree structured digital filter bank. In particular, for an orthogonal wavelet basis this filter bank exhibits the para unitarity property, thus it can be realized by using the Givens rotation as the basic building block. A complete parameterization for this class of Systems is known.

In this paper, we consider the architectural implementation of the DWT that is associated with an Orthonormal wavelet basis. We discuss the trade-offs involved in the use of distributed arithmetic and CORDIC processors for the implementation of the Givens rotation. The resulted circuits are modular, regular and they require only local communication. Furthermore, they involve only adders and ROM lookup tables and no multipliers. Consequently, they are very appropriate for VLSI implementation. The question of the on-line adaptation of the parameters of the circuit is also addressed. This feature is very important in adaptive signal processing applications. Although our discussion is focused on the one dimensional dyadic DWT, Our conclusions are projected to the M-band orthonormal wavelets and the two-dimensional DWT with quincunx subsampling.},
	address = {Pacific Grove, California},
	booktitle = {The 27th Annual Asilomar Conference on Signals, Systems and Computers}
}
@conference {
	title = {Efficient Organization of Large Ship Radar Databases Using Wavelets and Structured Vector Quantization},
	author = {Baras, John S., Wolk, Sheldon I.},
	year = {1993},
	month = {11/1993},
	abstract = {We investigate the problem of efficient representations of large databases of pulsed radar returns froTn naval vessels in order to economize memory and minimize search time. We use synthetic radar returns from ships as the experimental data. The results extend to real ISAR returns. We develop a novel algorithm for organizing the database, which utilizes a ~multiresolution wavelet representation working in synergy with a Tree Structured Vector Quantizer (TSWQ), utilized in its clustering mode. The tree Structure is induced by the multiresolution decomposition of the pulses. The TSVQ design algorithm is of the "greedy" type.~Our experiments todate indicate that the combined algorithm results in orders of magnitude faster data search time, with negligible performance degradation from the full search vector quantization. The combined algorithm provides an efficient indexing scheme (with respect to variations in aspect, elevation and pulse width) for radar data which can facilitate the development of ATR, surveillance and multi-sensor fusion systems.},
	address = {Pacific Grove, California},
	booktitle = {The 27th Annual Asilomar Conference on Signals, Systems and Computers},
	pages = {pp. 491-498}
}
@conference {
	title = {An Architectural Framework for Parallel Time-Recursive Computation},
	author = {Frantzeskakis, Emmanuel., Baras, John S., Liu, Ray K J.},
	year = {1993},
	month = {10/1993},
	abstract = {The time-recursive computation model has been proven particularly useful for the real-time evaluation of one and two-dimensional block transforms. Unlike the FFT based architectures, time-recursive ones require only local communication. Also, they are modular and regular, thus they are very appropriate for VLSI implementation and they allow high degree of parallelism.

In this paper, we establish an architectural framework for parallel time-recursive computation. We consider a class of linear operators that consists of the discrete time, time invariant, compactly supported, but otherwise arbitrary kernel functions. We specify the properties of the linear operators that can be implemented efficiently in a time-recursive way. Based on these properties, we develop a routine that produces a time-recursive architectural implementation for a given operator. This routine is instructive for the design of a CAD tool that will facilitate the derivation of time-recursive architectures. The design of architectures for the Discrete Cosine Transform and the Modulated Lapped Transform based on this routine is reported.},
	address = {Athens, Greece},
	booktitle = {The 4th Conference on Informatics , organized by the Greek Computer Society},
	pages = {pp. 1-12}
}
@conference {
	title = {Time-Recursive Computation and Real-Time Parallel Architectures, with Application on the Modulated Lapped Transform},
	author = {Frantzeskakis, Emmanuel., Baras, John S., Liu, Ray K J.},
	year = {1993},
	month = {07/1993},
	abstract = {The time-recursive computation has been proved particularly useful for the real-time evaluation of one and two-dimensional block transforms. Unlike the FFT based ones, time-recursive architectures require only local communication. Also, they are modular and regular, thus they are very appropriate for VLSI implementation and they allow high degree of parallelism.

In this paper, we establish an architectural framework for parallel time-recursive computation. We consider a class of linear operators that consists of the discrete time, time invariant, compactly supported, but otherwise arbitrary kernel functions. We specify the properties of the linear operators that can be implemented efficiently in a time-recursive way. Based on these properties, we develop a routine that produces a time-recursive architectural implementation for a given operator. This routine is instructive for the design of a CAD tool that will facilitate the architecture derivation.

Using this background, we design an architecture for the Modulated Lapped Transform (commonly called Modified Discrete Cosine Transform), which has linear cost in operator counts.},
	address = {San Diego, California},
	booktitle = {The 1993 SPIE International Symposium on Optical Science and Engineering},
	pages = {pp. 100-111}
}
@conference {
	title = {Time Series Modeling by Perceptrons: A Likelihood Approach},
	author = {Sonmez, Kemal M., Baras, John S.},
	year = {1993},
	month = {07/1993},
	abstract = {We consider neural network learning problems in which the objective is to learn the relationship between the inputs and the probability distribution of a proposition. We regard successive truth values of the proposition as a dependent binary time series whose instantaneous probability of truth is a function of the past behavior of the joint process between the analog inputs and binary output truth values. In this context, we identify the gradient descent learning algorithm using the Kullback-Leibler relative entropy cost function on a perceptron with a Maximum~Partial Likelihood (MPL) estimator of the perceptron model for the probability of a binary event in terms of its covariates. The implications of this result are: (i) The neural network models obtained by relative entropy learning are shown to have the nice large sample (i.e. training set size) characteristics of MPL estimates: consistency and asymptotic normality. (ii) An important and widely used statistical inference technique, logistic regression, can efficiently be implemented on analog perceptrons for time series modeling and prediction.},
	address = {Portland, Oregon},
	booktitle = {The World Congress on Neural Networks},
	pages = {pp. 601-604}
}
@conference {
	title = {Optimal Design of Distributed Sensors and Actuators Made of Smart Materials for Active Vibration Control},
	author = {Zhuang, Yan., Baras, John S.},
	year = {1993},
	month = {05/1993},
	abstract = {We describe a design technique for optimal control in active structural vibration damping using smart materials. The vibration of a cantilever beam is stabilized by using distributed sensors and actuators. We model the beam by the Timoshenko beam model together with the distributed sensors and actuators. A control law using the weighted integration of vibration velocity is incorporated in the closed loop system. We propose a method to find the optimal layout design of the smart material so as to maximize the damping effect. An objective functional is defined based on the vibration energy of the system. The optimal shapes of the sensor and actuator are determined through minimizing the energy functional of the beam over the admissible shape function space subject to certain geometric constraints. An algorithm has been developed to determine the optimal sensor and actuator layout. This method can be generalized to the plate damping problem and more complicated structures as well.},
	address = {Thousand Oaks, CA},
	booktitle = {The 1993 IEEE Regional Conference on Aerospace Control Systems},
	pages = {pp. 65-69},
	organization = { Rockwell Science Center}
}
@conference {
	title = {Time-Recursive Architectures and Wavelet Transform},
	author = {Frantzeskakis, Emmanuel., Baras, John S., Liu, Ray K J.},
	year = {1993},
	month = {04/1993},
	abstract = {The time-recursive computation has been proved as a particularly useful tool in real-time data compression and in transform domain adaptive filtering, with applications in the areas of audio, radar, sonar and video. Unlike the FFT based ones, the time-recursive architectures require only local communication. Also, they are modular and regular, thus they are very appropriate for VLSI implementation and they allow high degree of parallelism. In this paper, we propose an architectural framework for parallel time-recursive computation. We consider a class of linear operators that consists of the discrete time, time invariant, compactly supported, but otherwise arbitrary kernel functions. We define a shift property of the linear operators and reveal its relation with the time-recursive implementation. We demonstrate the potential of the proposed framework by designing a time-recursive architecture for the Discrete Wavelet Transform.},
	address = {Minneapolis, Minnesota},
	booktitle = {The 1993 International Conference on Acoustics, Speech and Signal Processing},
	pages = {pp. I-445 - I-448}
}
@conference {
	title = {Robustness Study of Free-Text Speaker Identification and Verification},
	author = {Kao, Yu-Hung., Baras, John S., Rajasekaran, P K. },
	year = {1993},
	month = {04/1993},
	abstract = {Usable free-text speaker identification and voice verification systems must exhibit robustness under varying operational conditions. We study the degree of robustness provided by various signal processing techniques [1] [2] [3] by experimenting on a widely used long distance telephone data base [4] [5] [6]. This data base consists of data recorded at two different sites, with data from one site much poorer in quality than the other; further, the recording equipment had been inadvertly changed for the later half of the sessions resulting in a significantly changed environment. Our study identifies the combination of techniques that provide consistent and significant improvements; our results surpass other published results [4] [5] [6] on the same task. Specifically, in the task of identifying 16 speakers, with training data from the recording prior to equipment change and testing on data from a set after the change(the most challenging condition), we obtain a correct identification rate of 87.5\% with an average rank of 1.12; [4] obtains the hitherto best result of 75\% correct identification with an average rank of 1.56: without any robustness processing, the rate was only 12\%. Detailed results on exhaustive experimentation are presented along with appropriate discussions.},
	address = {Minneapolis, Minnesota},
	booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
	pages = {pp. 379-382}
}
@conference {
	title = {More About Wavelet Maxima Representations},
	author = {Berman, Zeev., Baras, John S.},
	year = {1993},
	month = {04/1993},
	abstract = {Results regarding reconstruction and modifications of multiscale (wavelet) maxima and zero-crossings representations are presented. The work is based on a general signal description, called an inherently bounded Adaptive Quasi Linear Representation (AQLR), motivated by two important examples: the wavelet zero-crossings representation. The convergence of two new reconstruction algorithms is guaranteed for all inherently bounded AQLR. As a consequence, we describe modifications in the basic multiscale maxima representation. The modifications allow to trade-off between the amount of required information and the reconstruction quality.},
	address = {Minneapolis, Minnesota},
	booktitle = {1993 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP 2011)},
	pages = {pp. 662-665},
	organization = {Minneapolis Convention Center}
}
@conference {
	title = {Design of the MANDATE MIB},
	author = {Haritsa, Jayant., Ball, Mike., Roussopoulos, Nick., Baras, John S., Datta, Anindya.},
	year = {1993},
	month = {04/1993},
	abstract = {A management information database is the heart of a network management system - it provides the interface between all functions of the network management system, and therefore has to provide sophisticated functionality allied with high performance. In this paper, we introduce the design of MANDATE, a database system that is designed to effectively support the management of large enterprise networks. MANDATE proposes to use special characteristics of network management data and transactions, together with recent advances in database technology, to efficiently derive its functionality.},
	address = {San Francisco, California},
	booktitle = {The 3rd International Symposium on Integrated Network Management},
	pages = {pp. 85-96}
}
@conference {
	title = {Maximum Partial Likelihood Estimation with Perceptrons},
	author = {Sonmez, Kemal M., Baras, John S.},
	year = {1993},
	month = {03/1993},
	abstract = {We show the equivalence of two techniques of time series modeling/prediction; (ii) perceptron learning of probability distribution of the truth value of a proposition from first order stochastic density approximations, (ii) Maximum Partial Likelihood (MPL) estimation of the parameters of a logistic regressive model for binary time series. This result provides large training set characteristics for the approximate Kullback-Leibler relative entropy learning scheme.},
	address = {Baltimore, Maryland},
	booktitle = { The 1993 Conference on Information Sciences and Systems},
	pages = {pp. 812-817},
	organization = {Johns Hopkins University}
}
@conference {
	title = {Convergence of a Neural Network Classifier},
	author = {Baras, John S., Chen, Shihwei.},
	year = {1993},
	month = {03/1993},
	abstract = {In this paper, we consider mixed-media networks with multi-media traffic to find the optimal splitting ratios between satellite network ~and terrestrial network for data and voice traffic dynamically. We constantly monitor the traffic and measure the arrival rate and occupancy of every link. Based on these data, we optimize data traffic delay in a suitable time-frame under the constraints of voice traffic blocking probabilities of voice transmission links being less than specified values, which is up to system{\textquoteright}s design or user{\textquoteright}s requirements. A dynamic routing algorithm is presented.~},
	address = {Baltimore, Maryland},
	pages = {pp. 1-10},
	organization = {John Hopkins University}
}
@conference {
	title = {A New Deterministic Codebook Structure for CELP Speech Coding},
	author = {Kao, Yu-Hung., Baras, John S.},
	year = {1993},
	month = {01/1993},
	abstract = {Low bit rate, high quality speech coding is a vital part in voice telecommunication systems. The introduction of CELP (1984) (Codebook Excited Linear Prediction) speech coding provided a feasible way to compress speech data to 4.8 kbps with high quality, but the formidable computational complexity required for real-time processing has prevented its wide application. Using the new deterministic codebook, we reduce the computational complexity of codebook search, which originally accounted for 2/3 of the computational complexity, to negligible. Based on this reduction, we produce an algorithm with complexity about 5 MIPS. It can be implemented in even inexpensive DSP chips, while maintaining the same high quality. In addition to extremely simple encoding and decoding schemes, this codebook also provides optimal error tolerance and it doesn{\textquoteright}t require codebook storage. We hope that this contribution can finally make CELP speech coding a widely applicable and practical technology.},
	address = {San Antonio, Texas},
	booktitle = {The 1993 IEEE International Symposium on Information Theory},
	pages = {pp. 340}
}
