@conference {
	title = {A learning algorithm for Markov decision processes with adaptive state aggregation},
	author = {Baras, John S., Borkar, V.S, V. S. },
	year = {2000},
	month = {12/2000},
	abstract = {We propose a simulation-based algorithm for learning good policies for a Markov decision process with unknown transition law, with aggregated states. The state aggregation itself can be adapted on a slower time scale by an auxiliary learning algorithm. Rigorous justifications are provided for both algorithms.},
	address = {Sydney, Australia},
	booktitle = {Proceedings of the IEEE Conference on Decision and Control},
	pages = {pp.3351-3356}
}
@conference {
	title = {Performance Analysis Using a Hierarchical Loss Network Model},
	author = {Liu, Mingyan., Baras, John S.},
	year = {2000},
	month = {11/2000},
	abstract = {In this paper we present a hierarchical loss network model for estimating the end-to-end blocking probabilities of large networks. As networks grow in size, nodes tend to form clusters geographically and hierarchical routing schemes are more commonly used. Loss network and reduced load models are often used to approximate end-to-end call blocking probabilities and hence throughput. However so far all work being done in this area is for flat networks with flat routing schemes. We aim at developing a more efficient approximation method for networks that have a natural hierarchy and/or when some form of hierarchical routing policy is used. We present two hierarchical models in detail for fixed hierarchical routing and dynamic hierarchical routing policies, respectively, via the notion of network abstraction, route segmentation, traffic segregation and aggregation. Computation is done separately within each cluster (local) and among clusters (global), and the fixed point is obtained by iteration between local and global computations. We present results from both numerical experiments and discrete event simulations.},
	address = {San Fransisco, CA},
	booktitle = {IEEE Globecom 2000,Comunications: The Global Bridge},
	pages = {pp. 1793-1797}
}
@conference {
	title = {Maximum Likelihood Slow Frequency-Selective Fading Channel Estimation Using Frequency Domain approach},
	author = {Jiang, Yimin., Sun, Feng-Wen., Baras, John S.},
	year = {2000},
	month = {11/2000},
	abstract = {This paper addresses the channel estimation problem for slow frequency-selective fading channels using training sequences and the maximum likelihood (ML) approach. In the literature people usually assume a symbol period spaced delay-tapped-line model and additive white Gaussian noise (AWGN). Due to the pre-filtering in the receiver front end, if the sampling rate is larger than one sample per symbol or sampling epoch is unknown (Le., the timing information is unavailable), the AWGN model is not valid anymore. A more general ML channel estimation method using the discrete Fourier transform (DFT) is derived for colored Gaussian noise and over-sampling. A similar idea can be adopted to derive the ML joint carrier phase and timing offsets estimation algorithm.},
	address = {San Francisco, CA},
	booktitle = {IEEE Globecom2000, Communications:The Global Bridge},
	pages = {pp. 955-959}
}
@conference {
	title = {Generalized TCP Congestion Avoidance and Its Effect on Bandwidth Sharing and Variability},
	author = {Misra, Archan., Baras, John S., Ott, Teunis.},
	year = {2000},
	month = {11/2000},
	abstract = {To model possible suggested changes in TCP window adaptation in response to randomized feedback, such as ECN, we formulate a generalized verslon of the TCP congestion avoidance algorithm. We first consider multiple such generalized TCP flows sharing a bottleneck buffer under the Assured Service model and use a fixed point technique to obtain the mean window sizes and throughputs for the TCP flows. To further study how changes in the adaptation algorithm affect the variability in the throughput, we use an analytical-cum-numerical technique to derive the window distribution (and related statistics) of a single generalized flow under state-dependent randomized congestion feedback.},
	address = {San Francisco, California},
	booktitle = {IEEE Global Telecommunications Conference (GLOBECOM), Communications: The Global Bridge},
	pages = {pp. 329-337.}
}
@conference {
	title = {Using Drop{\textendash}Biasing to stabilize the Occupancy of Random-Drop Queues with TCP Traffic},
	author = {Misra, Archan., Ott, Teunis., Baras, John S.},
	year = {2000},
	month = {11/2000},
	abstract = {The paper describes how the use of {\textquoteleft}drop-biasing{\textquoteright}, a technique to control the distribution of the gap between consecutive packet losses in random drop queues (such as RED) can be used to reduce the variability of the queue occupancy with TCP traffic. Reducing the variance of the queue occupancy reduces delay jitter for buffered packets, as well as decreases the likelihood of buffer underflow. We find that modifying the packet drop probabilities to ensure a minimum separation between consecutive packet drops serves to decrease the variability in the queue occupancy. This is really achieved as a result of the increased negative correlation among the congestion windows of the constituent TCP flows. Such negative correlation explains why the use of simple drop-biasing strategies can reduce the queue variability without increasing the likelihood of bursts of packet losses. The results of our investigations have relevance for the design and deployment of RED-like algorithms for congestion control in the Internet.},
	address = {Singapore},
	booktitle = {IEEE International Conference on Communications Systems(ICCS)},
	pages = {pp. 1-9}
}
@conference {
	title = {Comparison of Run-to-Run Control Methods in Semiconductor Manufacturing Processes},
	author = {Zhang, Chang., Deng, Hao., Baras, John S.},
	year = {2000},
	month = {09/2000},
	abstract = {In this paper, RtR control methods are generalized. The set-valued RtR controllers with ellipsoid approximation are compared with other RtR controllers by simulation according to the following principles:

A good RtR controller should be able to compensate for various disturbances, such as small drifts and ~large step disturbances.~
	It should be able to deal with constraints, cost requirement, multiple targets,~time delays etc.
Preliminary results show the satisfactory performance of the set-valued RtR controller with ellipsoid approximation.~},
	address = {Lake Tahoe, Nevada},
	booktitle = {AEC/APC Symposium XII},
	pages = {pp. 889-896}
}
@conference {
	title = {The Set-Valued Run-to-Run Controller with Ellipsoid Approximation},
	author = {Zhang, Chang., Deng, Hao., Baras, John S.},
	year = {2000},
	month = {09/2000},
	address = {Lake Tahoe, Nevada},
	booktitle = {AEC/APC Symposium XII},
	pages = {pp. 167-178}
}
@conference {
	title = {Analysis of the Dynamics of TCP Congestion Avoidance: Random Drops and Random Marking of Queues},
	author = {Baras, John S.},
	year = {2000},
	month = {08/2000},
	address = {Sophia-Antipolis, France},
	organization = {INRIA}
}
@conference {
	title = {Internet and Web Metrology: The Keys to High Performance},
	author = {Baras, John S.},
	year = {2000},
	month = {06/2000},
	address = {Virginia},
	booktitle = {Research and Network Management Personnel },
	organization = {AOL Headquarters}
}
@conference {
	title = {Group Invariance and Symmetries in Nonliear Control and Estimation},
	author = {Baras, John S.},
	year = {2000},
	month = {06/2000},
	abstract = {We consider nonlinear filtering problems, nonlinear robust control problems and the partial differential equations that characterize their solutions. These include the Zakai equation, and in the robust control case two coupled Dynamic Programming equations. We then characterize equivalence between two such problems when we can compute the solution of one from the solution of the other using change of dependent, independent variables and solving an ordinary differential equation. We characterize the resulting transformation groups via their Lie Algebras. We illustrate the relationship of these results to symmetries and invariances in physics, Noether{\textquoteright}s theorem, and calculus of variations. We show how using these techniques one can solve nonlinear problems by reduction to linear ones.},
	address = {Paris, France},
	booktitle = {Proceedings of the Second Nonlinear Control Network (NCN) Workshop}
}
@conference {
	title = {Group Invariance and Symmetries in Nonlinear Control and Estimation},
	author = {Baras, John S.},
	year = {2000},
	month = {06/2000},
	abstract = {We consider nonlinear filtering problems, nonlinear robust control problems and the partial differential equations that characterize their solutions. These include the Zakai equation, and in the robust control case two coupled Dynamic Programming equations. We then characterize equivalence between two such problems when we can compute the solution of one from the solution of the other using change of dependent, independent variables and solving an ordinary differential equation. We characterize the resulting transformation groups via their Lie Algebras. We illustrate the relationship of these results to symmetries and invariances in physics, Noether{\textquoteright}s theorem, and calculus of variations. We show how using these techniques one can solve nonlinear problems by reduction to linear ones.},
	address = {Paris, France},
	booktitle = {Second Nonlinear Control Network (NCN) Workshop, Nonlinear Control in the Year 2000},
	pages = {pp. 01-30}
}
@conference {
	title = {On the True Cramer-Rao lower Bound for Data{\textendash}Aided Joint Estimation of Carrier phase and Timing Offsets},
	author = {Jiang, Yimin., Sun, Feng-Wen., Baras, John S.},
	year = {2000},
	month = {06/2000},
	abstract = {This paper concerns the Cramer-Rao lower bound (CRB) for the data-aided (DA) timing and/or phase recovery, i.e., the synchronization parameter acquisition is aided by a training sequence known to the receiver. For the DA parameter estimation, the CRB typically varies with the training sequence. This indicates that different training sequences offer fundamental different performance. In this manuscript, we derive a closed-form formula of the CRB for timing and phase recovery with respect to any particular training sequence. The bound illustrates the close relation between the training sequence and the fundamental limit on timing and phase synchronization. It provides additional insights on the training sequence design.},
	address = {New Orleans},
	booktitle = {IEEE International Conference on Communication (ICC\&rsquo;00)}
}
@conference {
	title = {Computational Micromagnetics for Magnetostrictive Actuators},
	author = {Tan, Xiaobo., Baras, John S., Krishnaprasad, P S.},
	year = {2000},
	month = {05/2000},
	abstract = {Computational micromagnetics plays an important role in design and control of magnetostrictive actuators. A systematic approach to calculate magnetic dynamics and magnetostriction is presented. A method is developed to solve the coupled Landau-Lifshitz-Gilbert equation for dynamics of magnetization and the 1-D elastic motion equation. A hierarchical algorithm using multipole approximation speeds up the evaluation of the demagnetizing eld, reducing computational cost from O(N2) to O(NlogN). A hybrid 3D-1D scheme is adopted to compute the magnetostriction. Numerical results include domain wall dynamics, hysteresis, magnetostriction, and applications to control of actuators.},
	address = {Philadelphia, Pennsylvania},
	booktitle = {3rd SIAM Conference on Mathematical aspects of Materials Science}
}
@conference {
	title = {A decision-process analysis of implicit coscheduling},
	author = {Poovendran, Radha., Keleher, P. , Baras, John S.},
	year = {2000},
	month = {05/2000},
	abstract = {This paper presents a theoretical framework based on Bayesian decision theory for analyzing recently reported results on implicit coscheduling of parallel applications on clusters of workstations. Using probabilistic modeling, we show that the approach presented can be applied for processes with arbitrary communication mixes. We also note that our approach can be used for deciding the additional spin times in the case of spin-yield. Finally, we present arguments for the use of a different notion of fairness than assumed by prior work.},
	address = {Cancun, Mexico},
	booktitle = {International Parallel and Distributed Processing Symposium, IPDPS}
}
@conference {
	title = {Vehicle Classification Using Acoustic Data Based on Biology Hearing Models and Multiscale Vector Quantization},
	author = {Depireux, Didier A., Varma, Sudhir., Baras, John S., Srour, N., Pham, T.},
	year = {2000},
	month = {03/2000},
	abstract = {The army is interested in using acoustic sensors in the battlefield to perform vehicle identification~ using passive microphone and seismic arrays. The main advantages of acoustic arrays are that they are non-line of sight, low cost, low power, can be made small and rugged and can provide 360o coverage. Their capability includes target detection, bearing, tracking, classification and identification, and can provide wake-up and cueing for other sensors.

Acoustic arrays can be deployed in an expandable tracking system: the outputs of a nework of acoustic arrays can detect, track, and identify ground targets at tactical range by triangulating the reports from several distributed arrays.

Here, we present a prototype of~ vehicle acoustic signal classification. To analyze the signature of the vehicle, we adopt biologically motivated feature extraction models. Several possible representations are used in a classification system. Different vector quantization(VQ) clustering algorithms are implemented and tested for real world vehicle acoustic signal, such as Learning VQ, Tree-Structured VQ and Parallel TSVQ. Experiments on the Acoustic-seismic Classification Identification Data Set~ (ACIDS) database show that both PTSVQ and LVQ achieve high classification rates.

The VQ schemes presented here have the advantage of not having to choose explicitly the features that distinguish~ the targets. The burden is shifted to having to choose the {\textquoteleft}{\textquoteleft}best{\textquoteright}{\textquoteright} representation for the classifier.},
	address = {College Park, MD},
	booktitle = {ARL Federated Laboratory 4th Annual Symposium}
}
@conference {
	title = {Analysis and Design of Robust Key Schemes for Multicast Communications},
	author = {Poovendran, Radha., Baras, John S.},
	year = {2000},
	month = {03/2000},
	abstract = {Recent literature presents several rooted tree based member deletion/revocation schemes [5,6,7,8,1,2] trying to simultaneously minimize the key storage while providing efficient member deletion /revocation. many of these approaches have different solutions and provide different values for the number of keys to be stored and distributed.In this paper we show these problems can be systematically studied using basic concepts from information theory.},
	booktitle = {ATIRP 4th Annual Conference},
	organization = {University of Maryland}
}
@conference {
	title = {Reliable Multicasting via Satellite : Delay Considerations},
	author = {Payne, Stephen Marshall., Baras, John S.},
	year = {2000},
	month = {03/2000},
	abstract = {Many different multicast protocols have been proposed and analysed in the current literature.Since satellites are naturally a broadcast medium,multicast communications have a potential to greatly benefit from their wide scale deployment. The performance of reliable multicast protocols needs to be studied and becomes better understood over networks including satellite links.},
	address = {College Park, MD},
	booktitle = {ATIRP 4th Annual Conference},
	organization = {University of Maryland}
}
@conference {
	title = {A Hierarchical Loss Network Model For Performance Evaluation},
	author = {Liu, Mingyan., Baras, John S.},
	year = {2000},
	month = {03/2000},
	abstract = {In this paper we present a hierarchical loss network model for estimating the end to end blocking probabilties for large networks .As network grows in size,nodes tend to form clusters geographically and hierarchical routing schemes are more commonly used. Loss networks are reduced load models are often used to approximate end to end call blocking probabilities and hence throughput.},
	address = {College Park, Maryland},
	booktitle = {ATIRP 4th Annual Conference},
	organization = {University of Maryland}
}
@conference {
	title = {Fast Evaluation of Demagetizing Field in Three Dimensional Micromagnetics Using Multipole Approximation},
	author = {Tan, Xiaobo., Baras, John S., Krishnaprasad, P S.},
	year = {2000},
	month = {03/2000},
	abstract = {Computational micromagnetics in three dimensions is of increasing interest with the development of magnetostrictive sensors and actuators. In solving the Landau-Lifshitz-Gilbert (LLG) equation, the governing equation of magnetic dynamics for ferromagnetic materials, we need to evaluate the effective field. The effective field consists of several terms, among which the demagnetizing field is of long-range nature. Evaluating the demagnetizing field directly requires work of O(N2) for a grid of N cells and thus it is the bottleneck in computational micromagnetics. A fast hierarchical algorithm using multipole approximation is developed to evaluate the demagnetizing field. We first construct a mesh hierarchy and divide the grid into boxes of different levels. The lowest level box is the whole grid while the highest level boxes are just cells. The approximate field contribution from the cells contained in a box is characterized by the box attributes, which are obtained via multipole approximation. The algorithm computes field contributions from remote cells using attributes of appropriate boxes containing those cells, and it computes contributions from adjacent cells directly. Numerical results have shown that the algorithm requires work of O(NlogN) and at the same time it achieves high accuracy. It makes micromagnetic simulation in three dimensions feasible},
	address = {Newport Beach, CA},
	booktitle = {7th SPIE International Symposium on Smart Structures and Materials},
	pages = {pp. 195-201}
}
@conference {
	title = {Computational Micromagnetics for Magnetostrictive Actuators},
	author = {Tan, Xiaobo., Baras, John S., Krishnaprasad, P S.},
	year = {2000},
	month = {03/2000},
	abstract = {Computational micromagnetics plays an important role in design and control of magnetostrictive actuators. A systematic approach to calculate magnetic dynamics and magnetostriction is presented. A method is developed to solve the coupled Landau-Lifshitz-Gilbert equation for dynamics of magnetization and the 1-D elastic motionequation.},
	address = {Newport Beach, CA},
	booktitle = {7th SPIE International Symposium on Smart Structures and Materials},
	pages = {pp. 162-173}
}
@conference {
	title = {Integrating AI Planning and Integer Programming for Use in Integrated Product and Process Design},
	author = {Nau, Dana S., Meyer, Jeff., Ball, Mike., Baras, John S., Chowdhury, Abdur., Lin, Edward., Rajamani, Ravi., Splain, John., Trichur, Vinai.},
	year = {2000},
	month = {01/2000},
	abstract = {This paper describes an Integrated Product and Process Design (IPPD) tool for the design and manufacture of microwave transmit/receive modules. The tool, which was developed as part of a contract with Northrop Grumman, was designed to combine high performance, ease of understandability by manufacturing personnel, ease of maintenance, and integration with other systems. It uses AI planning to generate process-plan elements, IP tradeoff analysis to select Pareto optimal combinations of design elements and plan elements, and a GUI for user control of the system{\textquoteright}s operation.},
	address = {Austin, Texas},
	booktitle = {2000 AAAI Workshop on Integration of AI and OR Techniques for Combinatorial Optimization}
}
