@conference {
	title = {Adaptive Classification Based on Compressed Data Using Learning Vector Quantization},
	author = {Baras, John S., Dey, Subhrakanti.},
	year = {1999},
	month = {12/1999},
	abstract = {Classification problems using compressed data are becoming increasingly important in many applications with large amounts of sensory data and large sets of classes. These applications range from Aided Target~Recognition (ATR), to medical diagnosis, to speech recognition, to fault detection and identification in manufacturing systems. In this paper, we develop and analyze a learning vector quantization (LVQ) based algorithm for the combined compression and classification problem. We show convergence of the algorithm using techniques from stochastic approximation, namely, the ODE method.},
	address = {Phoenix, Arizona},
	booktitle = {38th IEEE Conference on Decision and Control},
	pages = {pp. 3677-3683}
}
@conference {
	title = {At the Gates of the Millennium: Are We in Control?},
	author = {Baras, John S., Doyle, John C., Y-C. Ho, Johnson, Timothy L.},
	year = {1999},
	month = {12/1999},
	address = {Phoenix, Arizona},
	booktitle = {38th IEEE Conference on Decision and Control},
	pages = {pp. 1721-1724}
}
@conference {
	title = {At the Gates of the Millenium: Are we in Control?},
	author = {Baras, John S.},
	year = {1999},
	month = {12/1999},
	address = {Phoenix, Arizona},
	booktitle = {38th IEEE Conference on Decision and Control},
	pages = {pp. 1721-1724}
}
@conference {
	title = {The Window Distribution of Multiple TCPs with Random Loss Queues},
	author = {Misra, Archan., Ott, Teunis., Baras, John S.},
	year = {1999},
	month = {12/1999},
	abstract = {Two approximate techniques for analyzing the window size distribution of TCP flows sharing an RED-like bottleneck queue are presented. Both methods presented first to use a fixed point algorithm to obtain the mean window sizes of the flows, and the mean queue length in the bottleneck buffer. The simpler of the two methods then uses the {\textquoteleft}square root formula{\textquoteright} for TCP; the other method is more complicated. More often than not, the simpler method is slightly more accurate; this is probably due to the fact that window sizes of the different flows are negatively correlated.},
	address = {Rio de Janeiro, Brazil},
	booktitle = {1999 IEEE Global Telecommunications Conference (GLOBECOM)},
	pages = {pp.  1714-1726}
}
@conference {
	title = {Data-Aided ML Parameter Estimators of PSK Burst Modems and their Systolic VLSI Implementations},
	author = {Jiang, Yimin., Verahrami, Farhad., Ting, Wen-Chun., Richmond, Robert L., Baras, John S.},
	year = {1999},
	month = {12/1999},
	abstract = {A high-performance Universal Modem ASIC that supports several modulation~types and burst mode frame formats is under development. Powerful and generic data-aided (DA) parameter estimators are necessary to accommodate many modes. In this paper, we present an approximated maximum likelihood (ML) carrier frequency offset estimator and their systolic VLSI implementations for PSK burst modems. The performances are close to the Cramer-Rao lower bounds (CRLB) as low SNRs. Compared with theoretical solutions the estimators proposed here are much simpler and easier to implement by the current VLSI technology. The CRLB for DA estimations is discussed in some depth, some issues on training sequence design are also addressed in the work.~},
	address = {Rio de Janeiro, Brazil},
	booktitle = {1999 IEEE Global Telecommunications Conference (GLOBECOM)},
	pages = {pp. 2177-2182}
}
@conference {
	title = {Object-Relational Databases and Telecommunication Network Management},
	author = {Baras, John S.},
	year = {1999},
	month = {11/1999},
	address = {Link{\"o}ping, Sweden},
	booktitle = {Annual Review Workshop, ISIS Competence Center},
	organization = {Link{\"o}ping University}
}
@conference {
	title = {Classification and Control from Compressed Data},
	author = {Baras, John S.},
	year = {1999},
	month = {11/1999},
	address = {London, UK},
	organization = {Imperial College}
}
@conference {
	title = {A Video Transmission System Based on Human Visual Model},
	author = {Jiang, Yimin., Gu, Junfeng., Baras, John S.},
	year = {1999},
	month = {09/1999},
	abstract = {This paper presents a joint source-channel coding scheme of digital video broadcasting over satellite channel. The video compression is based on human visual model. Perceptual distortion model the just-noticeable-distortion (JND) is applied to improve the subjective quality of compressed videos. 3-D wavelet decomposition can remove spatial and temporal redundancy and provide scalability of video quality. In order to conceal the errors occurred under bad channel conditions, a novel slicing method and a joint source channel coding scenario that combines RCPC with CRC and utilizes the distortion information to allocate convolutional coding rates are presented. A new performance index based on JND is proposed and used to evaluate the overall performance at different signal-to-noise ratios(SNR). Our system uses OQPSK modulation scheme.},
	address = {Amsterdam, Netherlands},
	booktitle = {IEEE VTC 1999},
	pages = {pp. 868-873}
}
@conference {
	title = {VLSI Implemented Data-Aided ML Parameter Estimators of PSK Burst Modems},
	author = {Jiang, Yimin., Ting, Wen-Chun., Verahrami, Farhad., Richmond, Robert L., Baras, John S.},
	year = {1999},
	month = {09/1999},
	abstract = {A high-performance universal modem ASIC that supports several modulation types and burst mode frame formats are under development. The ASIC is designed to work under stringent conditions such as large carrier frequency offset (up to 13\% symbol rate) and low signal-to-noise ratio (SNR). Powerful and generic data-aided parameter estimators are necessary to accommodate many modes. In this paper, we present an approximated maximum likelihood (ML) carrier frequency offset estimator, ML joint carrier phase, and timing offsets estimator and their systolic VLSI implementations for PSK burst modems. The performances are close to the Cramer-Rao lower bounds at low SNRs. Compared with theoretical solutions the estimators proposed here are much simpler and easier to implement by the current VLSI technology.},
	address = {Amsterdam, Netherlands},
	booktitle = {1999 Vehicular Technology Conference},
	pages = {pp.733-738}
}
@conference {
	title = {Caching and Multicasting in DBS systems},
	author = {Liu, Mingyan., Karir, Manish., Baras, John S.},
	year = {1999},
	month = {09/1999},
	abstract = {The use of caching and multicasting has been studied extensively in the context of terrestrial networks. However, the use of these technologies in a Direct Broadcast Satellite (DBS) system remains unclear. In this paper, we discuss possible choices of caching and multicasting schemes, motivated by current applications in the terrestrial Internet, that could be considered for a DBS system. We examine their advantages and disadvantages as well as the tradeoffs involved in combinations of different approaches. We also propose some uses of these technologies and describe an architecture that enhances the performance and efficiency of a DBS system.},
	address = {Aizu, Japan},
	booktitle = {1999 International Workshop on Group Communications},
	pages = {pp. 56-61}
}
@conference {
	title = {VLSI implemented ML joint carrier phase and timing offsets estimator for QPSK/OQPSK burst modems},
	author = {Jiang, Yimin., Verahrami, Farhad., Ting, Wen-Chun., Richmond, Robert L., Baras, John S.},
	year = {1999},
	month = {09/1999},
	abstract = {A high-performance ASIC supporting multiple modulation, error correction, and frame formats is under development at Hughes Network Systems, Inc. Powerful and generic data-aided (DA) estimators are needed to accommodate operation in the required modes. A simplified DA maximum likelihood (ML) joint estimator for carrier phase and symbol timing offset for QPSK/OQPSK burst modems and a sample systolic VLSI implementation for the estimator are presented. Furthermore, the Cramer-Rao lower bound (CRLB) for DA case is investigated. The performance of the estimator is shown through simulation to meet the CRLB even at low signal-to-noise ratios (SNR). Compared with theoretical solutions, the proposed estimator is less computationally intensive and is, therefore, easier to implement using current VLSI technology},
	address = {New Orleans, Louisiana},
	booktitle = {Proceedings of Wireless Communications and Networking Conference},
	pages = {pp. 742-746}
}
@conference {
	title = {Hybrid Internet Simulation Testbed},
	author = {Liu, Mingyan., Karir, Manish., Raissi-Dekhordi, Majid., Baras, John S.},
	year = {1999},
	month = {08/1999},
	abstract = {Internet technology as a widely accepted modern telecommunication standard has been widely extended to combine with numerous other technologies, e.g..,satellite, ATM, wireless. This is what we term as Hybrid Internet. Along with this technology emerging, various enhancements and alterations of standard TCP/IP for different purposes have been proposed and studied in-tensively. More and more frequently we are facing the question of how to choose from these different schemes to design a system for a particular purpose, which would inevitably involve the interaction and trade-of study. We believe that simulation is a powerful tool for this type of work. In this paper, we describe our implementation of a Hybrid Internet testbed which includes a series of traffic models and TCP/IP enhancements. The goal of our work is to make a set of reusable modules upon which we can build complex systems to study the standard protocols and their variations. We also present application examples using these module components.},
	address = {Washington DC},
	booktitle = {Proceedings of the 1999 OPNET Annual Technology Conference (OPNETWORK)},
	pages = {pp. 1-6}
}
@conference {
	title = {A Simulation Study of Enhanced TCP/IP Gateways for Broadband Internet over satellite},
	author = {Karir, Manish., Liu, Mingyan., Barrett, Bradley A., Baras, John S.},
	year = {1999},
	month = {08/1999},
	abstract = {The demand for Internet bandwidth has been growing rapidly over the years and the use of high bandwidth satellites has been proposed as one possible solution to meet the increasing demand. However, there are certain performance problems with providing Internet over satellite due to the nature of TCP/IP protocol suite and the satellite link characteristics. In this paper we describe a simulation study of architecture for improving the performance of TCP/IP over satellite links. On each end of satellite link, there are gateways that split the TCP ~connection so that the satellite link is transparent to the end hosts. The split TCP connection over the satellite segment is then optimized. TCP connection control is maintained on each segment of the split connection. We simulated such an architecture in OPNET and present results showing improved throughput over the satellite link.~},
	address = {Washington DC},
	booktitle = {OPNETWORK \&rsquo;99},
	pages = {pp. 1-6}
}
@conference {
	title = {An Information Theoretic Analysis of Rooted Tree Based Multicast Key Distribution Schemes},
	author = {Poovendran, Radha., Baras, John S.},
	year = {1999},
	month = {08/1999},
	abstract = {Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18 ,19,20,21] .In this paper we show that by assigning Probabilities for member revocations,the optimality correctness and the system requirements of some these schemes [18,19,20,21 ] can be systematically studied using information theoretic concepts. Specifically, we show that the optimal average number of keys per member in a rooted tree is related to the entropy of the member revocation event. Using our derivation we show that (a) the key assignments in [18, 21, 20, 19] corresponds to the maximum entropy solution, (b) and direct application of source coding will lead to member collusion (we present recently proposed solutions [21, 20] as examples of this) and a general criteria that admits member collusion. We also show the relationship between entropy of member revocation event and key length.},
	address = {Santa Barbara, CA},
	booktitle = {Crypto\&rsquo;99: 19th Annual IACR Crypto Conference},
	pages = {pp.624-638}
}
@conference {
	title = {An Information Theoretic approach to Secure Multicast Key Management},
	author = {Poovendran, Radha., Baras, John S.},
	year = {1999},
	month = {06/1999},
	abstract = {New results are presented for recently proposed rooted tree based secure multicast key revocation scheme [1,2] by studying the information theoretic properties of member revocation events .It is shown that the optimal average number of keys per person is given by the entropy of the member revocation event and the currently available solution correspond to the worst case or the maximum entropy scenario. It is shown that the proposed key assignment in [2] corresponds to optimal source coding and is susceptible to attack by compromise or collusion of multiple members.},
	address = {Metsovo, Greece},
	booktitle = {1999 IEEE International Symposium on Information Theory},
	pages = {pp.36}
}
@conference {
	title = {A Private Scheme for distributed ,Shared Secret Generation},
	author = {Poovendran, Radha., Corson, Scott M., Baras, John S.},
	year = {1999},
	month = {06/1999},
	abstract = {We present a scheme for shared secret generations by n members that combines the contributions the members in a fashion such that the individual contribution of each member is not exposed to anyone- including other members. We note that for an external attacker trying to break the n L-bit secrets of the members, the effective search space dimension is~nL, meaning that all n keys must be broken simultaneously in order to crack system integrity. We also note that the scheme provides "Unconditional Secrecy"[1].},
	address = {Kruger National Park, South Africa},
	booktitle = {1999 IEEE Information Theory and Communications Workshop},
	pages = {pp.8}
}
@conference {
	title = {Optimal Scaleable Security Architectures in the presence of Colluding Mobile Traitors},
	author = {Poovendran, Radha., Baras, John S.},
	year = {1999},
	month = {04/1999},
	abstract = {We present the issues related to secure multicast communication,in the presence of members who may collaborate to compromise the integrity of the system{\textquoteright}s security. We also show that the ability to compartmentalize the system compromise depends on the availability of trusted intermediate nodes.We also note that some variations of the recently proposed tree based schemes don{\textquoteright}t provide the required level of security and may be compromised if two appropriate members are compromised. We present the analysis of the weakness of these schemes here. We further note that the currently available tree based key distribution schemes are not optimal, and choose the worst case solution for key assignment. We note that the claims, including the collusion, can be formally proved using basic concepts from source coding theory and entropy as in [4].},
	address = {Richardson, Texas},
	booktitle = {1999 Emerging Technologies Symposium on Wireless Communications and Wireless systems},
	pages = {pp.1-5}
}
@conference {
	title = {A Carrier Frequency Estimation Method of MPSK Signals and its Systolic VLSI Implementation},
	author = {Y. Jiang, Ting, Wen-Chun., Verahrami, Farhad., Richmond, Robert L., Baras, John S., Hughes Network Systems, Inc.},
	year = {1999},
	month = {03/1999},
	abstract = {In this paper we present an autocorrelation-based method for estimating the carrier frequency offset of an MPSK signal with random data modulation. Although autocorrelation based techniques imply heavy usage of hardware resourses this technique is scalable and lends itself to systolic VLSI implementations. The performance of the open-loop estimator presented is close to Cramer-Rao lower bound (CRLB) for the frequency estimation from a block of random MPSK symbols at low signal-to-noise ratios (SNR). The estimator can be used in frequency acquisition of burst and continuous modems operating under low SNR and large frequency offset conditions.},
	address = {Baltimore, MD},
	booktitle = {CISS\&rsquo;99 : 33rd Annual Conference on Information Sciences and Systems},
	pages = {pp.142-146},
	organization = {John Hopkins University}
}
@conference {
	title = {Modeling and Simulation of Large Hybrid Networks},
	author = {Liu, Mingyan., Baras, John S., Payne, Stephen Marshall., Harrelson, Hal.},
	year = {1999},
	month = {02/1999},
	abstract = {This paper describes a modeling and simulation framework for large Hybrid networks that includes satellites framework for large hybrid networks that include satellites, terrestrial wireless and mobile and ad hoc networks. The purpose of simulation framework is to parallel the actual implementation of a testbed network currently being constructed at ARL. The modelling framework uses the performance measures generated by simulation to analytically study larger scaled versions of the testbed networks. The combination of two methodologies allows the feasibility of the testbed architecture{\textquoteright}s widespread implementation to be studied without the associated costs of performing such experiments with actual equipment. Additionally, technological tradeoffs and interoperability issues can be studied so that informed decisions can be made about the implementation of future military communication networks.

~

~

~

,terrestrial wireless and mobile Ad Hoc networks.The purpose of simulation framework is to parallel the actual implementation of the test bed network currently being constructed at ARL.},
	address = {College Park, Maryland},
	booktitle = {3rd Annual Conference on Advanced Telecommunications and Information Distribution Research Program(ATIRP)},
	pages = {pp. 201-206},
	organization = {University of Maryland}
}
@conference {
	title = {Delay Monitoring in ATM networks},
	author = {Arora, Anubhav., Baras, John S., Mykoniatis, George.},
	year = {1999},
	month = {02/1999},
	abstract = {ATM Network provide end-to-end QoS guarntees to connections for their lifetime,in the form of bounds on delays,errors and losses. Performance Management invloves measurement of these parameters accurately and taking control measures if required,to improve performance.This is very important for real time connections in which losses are irrecoverable and delays cause interruptions in service. In this paper, we concentrate on delay monitoring mechanisms. After presenting the OAM standards for ATM and a few sloutions in the literature, problems still remaining are formulated and directions being pursued to obtain solutions are indicated.},
	address = {College Park, MD},
	booktitle = {3rd Annual Conference on Advanced Telecommunications and Information Distribution Research Program(ATIRP)},
	pages = {pp. 259-263},
	organization = {University of Maryland}
}
@conference {
	title = {Dynamic Elgamal Public Key Generation with Tight Binding},
	author = {Poovendran, Radha., Corson, Scott M., Baras, John S.},
	year = {1999},
	month = {02/1999},
	abstract = {We present a new distributed ,group ElGamal public key generation algorithm which also permits maintenance of a group specific, dynamic,individual ElGamal public key infrastructure. We parameterize the group with a time varying quantity that serves as a distributed mechansim for controlling key generation privilege. Our scheme can be viewed as an alternative to polynomial schemes where, at the time of secret construction step,there has to be a thrid party or black box to combine the shares. Also, in polynomial schemes, at the time of combining, the individual shares of the secret have to be revealed the third party. In our scheme, the common secret can be generated without ever exposing the individual shares constructing it. We note that many of the ~proposed distributed key management [2-4] schemes need such group keys for certification and signing process.},
	booktitle = {3rd Annual Conference on Advanced Telecommunications and Information Distribution Research Program(ATIRP)},
	pages = {pp. 471-475}
}
@conference {
	title = {An Automated, Distributed, Intelligent Fault Management System for Communication Networks},
	author = {Li, Hongjun., Baras, John S., Mykoniatis, George.},
	year = {1999},
	month = {02/1999},
	abstract = {In this paper we present a Distributed Intelligent Fault Management (DIFM) system for communication networks. The overall architecture of the proposed system is based on a distributed cooperative multi-agent paradigm, with probabilistic networks as the framework for knowledge representation and evidence inferencing. We adopt the management by delegation paradigm [5] for network monitoring and integrate both hard and soft faults.},
	address = {College Park, MD},
	booktitle = {3rd Annual Conference on Advanced Telecommunications and Information Distribution Research Program(ATIRP)},
	pages = {pp. 253-257},
	organization = {University of Maryland}
}
@conference {
	title = {Broadband Internet and Satellite Technologies},
	author = {Baras, John S.},
	year = {1999},
	month = {01/1999},
	address = {Dallas, Texas},
	booktitle = {Sixth Annual Mobile Communications Conference and Exhibition}
}
