@conference {
	title = {Two Competing Queues with Linear Costs and Geometric Service Requirements},
	author = {Baras, John S., Dorsey, Arthur J., Makowski, Armand M.},
	year = {1983},
	month = {12/1983},
	abstract = {A discrete-time model is presented for a system of two queues cmompeting for the service attention of a single server with infinite buffer capacity. The service requirements are geometrically distributed and independent from customer to customer as well as from the arrivals. The allocation of service attention is governed by feedback policies which are based on past decisions and buffer content histories. The cost of operation per unit time is a linear function of queue sizes. Under the model assumptions, a fixed prioritization scheme known as the~{\textmu}c-rule, is shown to be optimal for the long run average criterion and for the expected discounted-criterion, over both finite and infinite horizons. Two different approaches are proposed to solve these problems. One is based on dynamic programming methodology for markov decision processes, and assumes the arrival to be i.i.d. The other is valid under no additional assumptions on the arrival streams and uses direct comparision arguments. In both cases the sample path properties of the adopted state-space model are exploited.},
	address = {San Antonio, Texas},
	booktitle = {22nd IEEE Conference on Decision and Control},
	pages = {pp. 1173-1178}
}
@conference {
	title = {Two Competing Queues with Linear Costs: The  μc-rule is Often Optimal},
	author = {Baras, John S., Dorsey, Arthur J., Makowski, Armand M.},
	year = {1983},
	month = {12/1983},
	abstract = {A discrete-time model is presented for a system of two queues competing for the service attention of a single server with infinite buffer capacity. The service requirements are geometrically distributed and independent from customer to customer as well as from the arrivals. The allocation of service attention is governed by feedback policies which are based on past decisions and buffer content histories. The cost of operation per unit time is a linear function of the queue sizes. Under the model assumptions, a fixed prioritization scheme, known as the uc-rule, is shown to be optimal for the expected long-run average criterion and for the expected discounted criterion, over both finite and infinite horizons. Two different approaches are proposed for solving these problems. One is based on the dynamic programming methodology for Markov decision processes, and assumes the arrivals to be i.i.d. The other is valid under no additional assumption on the arrival stream and uses direct comparison arguments. In both cases, the sample path properties of the adopted state-space model are exploited.},
	address = {San Antonio, Texas},
	booktitle = {22nd IEEE Conference on Decision and Control},
	pages = {pp. 186-209}
}
@conference {
	title = {Simultaneous Detection and Estimation for Diffusion Process Signals},
	author = {Baras, John S.},
	year = {1983},
	month = {09/1983},
	abstract = {We consider the problem of simultaneous detection and estimation when the~signals corresponding to the M different hypotheses can be modelled as outputs of M distinct stochastic dynamical systems of the Ito type. Under very mild assumptions on the models and on the cost structure we show that there exist a set of sufficient statistics for the simultaneous detection-estimation problem that can be computed recursively by linear equations. Furthermore we show that the structure of the~detector and estimator is completely determined by the cost structure. The methodology used ~employes recent advances in nonlinear filtering and stochastic control of partially observed stochastic systems of the Ito type. Specific examples and applications in radar tracking and discrimination problems are given.},
	address = {St. Jovite, Quebec, Canada},
	booktitle = {The 1983 IEEE International Symposium on Information Theory},
	pages = {pp. 104-105}
}
@conference {
	title = {Adaptive Control of Two Competing Queues},
	author = {Baras, John S., Dorsey, Arthur J.},
	year = {1983},
	month = {04/1983},
	abstract = {The adaptive control of two queues competing for the services of a single server is treated. The arrival rates and service rates are considered constant but unknown. Convergence results for certainty-equivalence type, adaptive control schemes are established. Several possible extensions of the results are discussed briefly.},
	address = {San Diego, California},
	booktitle = {1983  IEEE International Conference on Computer Communications (INFOCOM)},
	pages = {pp. 427-435}
}
@conference {
	title = {Adaptive Control of Two Competing Queues},
	author = {Baras, John S., Dorsey, Arthur J.},
	year = {1983},
	month = {04/1983},
	abstract = {We consider the problem of optimally all locating the time of a server to two parallel queues. "First we consider the problem when the queue sizes are observed, although the arrival and departure rates are not available, but have to be estimated. We next consider the problem when the arrival process is observed, but its rate is unknown, while the departure process is not observed and its rate known within certain bounds. In both cases adaptive control schemes are developed. The performance criterion used is aggregate delay .},
	address = {Chicago, Illinois},
	booktitle = {The 1983 Institute for Operations Research and the Management Sciences Joint ORSA/TIMS Meeting (INFORMS)},
	pages = {pp. 104}
}
@conference {
	title = {Decentralized Stabilization of Large Scale Systems by Frequency Domain Methods},
	author = {Bennett, William H., Baras, John S.},
	year = {1983},
	month = {03/1983},
	abstract = {A notion of weak coupling between subsystem~of a large-scale~system is developed based on a sufficient condition for a linear, time-invariant MIMO systems. The weak coupling measure provides a frequency dependent requirement on the system response for stability of a decentralized controller for the system. An abstract notion of a generalized Nyquist criterion for MIMO systems (as discussed in Brockett and byrnes [7]~)~is extended for decentralized feedback control. Computational methods are provided which exploit a connection between a gap-metric and the principal angles between pairs of subspaces. The principal angles are shown to be related to the singular values of an easily conputed matrix.},
	address = {Baltimore, Maryland},
	booktitle = {The 1983 Conference on Information Sciences and Systems},
	pages = {pp. 599-606},
	organization = {Johns Hopkins University}
}
@conference {
	title = {Transfer Function Classes Appearing in Linear Distributed Systems: Applications to Feedback Compensation},
	author = {Baras, John S.},
	year = {1983},
	month = {01/1983},
	address = {Norfolk, Virginia},
	booktitle = {SIAM 1983 Fall Meeting}
}
