Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682568
S. Shah-Heydari, T. Le-Ngoc
The paper presents a study on the use of Markov-modulated Poisson processes (MMPPs) in modeling aggregate ATM traffic in order to evaluate the queueing performance. Performance of various techniques for matching a 2-state MMPP to a superposition of on-off sources is compared. The applicability of the 2-state MMPP and its corresponding parameter matching techniques to model an arbitrary aggregate ATM traffic in evaluating its queueing performance are examined by simulation. A refined matching technique for a 2-state MMPP model is proposed. A procedure to estimate the four parameters of a 2-state MMPP from the measured arrivals suitable for the moment-based matching technique is presented. Test cases are given to illustrate the accuracy of the proposed estimation procedure. An approximation for the survivor function is derived.
{"title":"MMPP modeling of aggregated ATM traffic","authors":"S. Shah-Heydari, T. Le-Ngoc","doi":"10.1109/CCECE.1998.682568","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682568","url":null,"abstract":"The paper presents a study on the use of Markov-modulated Poisson processes (MMPPs) in modeling aggregate ATM traffic in order to evaluate the queueing performance. Performance of various techniques for matching a 2-state MMPP to a superposition of on-off sources is compared. The applicability of the 2-state MMPP and its corresponding parameter matching techniques to model an arbitrary aggregate ATM traffic in evaluating its queueing performance are examined by simulation. A refined matching technique for a 2-state MMPP model is proposed. A procedure to estimate the four parameters of a 2-state MMPP from the measured arrivals suitable for the moment-based matching technique is presented. Test cases are given to illustrate the accuracy of the proposed estimation procedure. An approximation for the survivor function is derived.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124361546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685543
M. Kamel, C. Trudeau
This paper describes project Springfield, a real-time distributed simulation of a mobile telecommunications network. Springfield permits real-time viewing and modification of the simulation and its parameters, which is ideal for capacity planning and performance modeling. An object-oriented, distributed simulator was implemented in Java and speedups of up to three times were obtained.
{"title":"Springfield: a real-time parallel simulation of mobile telecommunications","authors":"M. Kamel, C. Trudeau","doi":"10.1109/CCECE.1998.685543","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685543","url":null,"abstract":"This paper describes project Springfield, a real-time distributed simulation of a mobile telecommunications network. Springfield permits real-time viewing and modification of the simulation and its parameters, which is ideal for capacity planning and performance modeling. An object-oriented, distributed simulator was implemented in Java and speedups of up to three times were obtained.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126013027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685618
I. Lian, R. Hornsey, S. Chamberlain
Electron transport in reverse-biased amorphous silicon Schottky diodes has been studied by Monte Carlo simulation. These simulations have been applied to a time of flight geometry at various temperatures, and the results have been found to agree well with those from the literature. Simulations have also been used to investigate the response of the diode to step changes of bias. This case is of importance for the application of Schottky diodes to large-area X-ray sensors.
{"title":"Monte Carlo simulation of electron transport in amorphous silicon Schottky diodes","authors":"I. Lian, R. Hornsey, S. Chamberlain","doi":"10.1109/CCECE.1998.685618","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685618","url":null,"abstract":"Electron transport in reverse-biased amorphous silicon Schottky diodes has been studied by Monte Carlo simulation. These simulations have been applied to a time of flight geometry at various temperatures, and the results have been found to agree well with those from the literature. Simulations have also been used to investigate the response of the diode to step changes of bias. This case is of importance for the application of Schottky diodes to large-area X-ray sensors.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"345 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132339622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682563
S. Ho, W. Loucks, A. Singh
This paper describes a conceptual framework for building a software tool that can be used to record the behavior of a Web service. The objective here is to facilitate the building of Web monitoring tools that are flexible, portable, and easy to use. An example implementation using the framework is described. Some measurements provided by the example implementation are also presented.
{"title":"Monitoring the performance of a Web service","authors":"S. Ho, W. Loucks, A. Singh","doi":"10.1109/CCECE.1998.682563","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682563","url":null,"abstract":"This paper describes a conceptual framework for building a software tool that can be used to record the behavior of a Web service. The objective here is to facilitate the building of Web monitoring tools that are flexible, portable, and easy to use. An example implementation using the framework is described. Some measurements provided by the example implementation are also presented.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130129879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682539
D. Popescu, Z. Gajic
The problem of estimating the state x of a linear system in the presence of a constant, but unknown bias vector b is considered. Applying results derived for optimal filtering of singularly perturbed systems, the reduced order filters for state and bias are obtained. The presented approach completely decouples state and bias filters, both of them being driven by the systems measurements, thus allowing parallel computations.
{"title":"Reduced order decomposition for steady state biased Kalman filters","authors":"D. Popescu, Z. Gajic","doi":"10.1109/CCECE.1998.682539","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682539","url":null,"abstract":"The problem of estimating the state x of a linear system in the presence of a constant, but unknown bias vector b is considered. Applying results derived for optimal filtering of singularly perturbed systems, the reduced order filters for state and bias are obtained. The presented approach completely decouples state and bias filters, both of them being driven by the systems measurements, thus allowing parallel computations.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134554051","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682571
E. Aboelela, C. Douligeris
Routing algorithms are required to guarantee the various quality of service (QoS) characteristics requested by the wide range of applications supported by broadband integrated services digital networks (B-ISDN). However, it is known that such a routing problem, with two or more additive or multiplicative QoS metrics in any possible combination is NP-complete. In this paper, we propose a heuristic approach based on fuzzy logic. For each metric, a fuzzy membership function is defined to reflect the QoS requirements from that metric. A fuzzy-inference rule base is implemented to generate the fuzzy cost of each path based on the crisp values of the different metrics possibly used in the network links.
{"title":"Fuzzy inference system for QoS routing in B-ISDN","authors":"E. Aboelela, C. Douligeris","doi":"10.1109/CCECE.1998.682571","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682571","url":null,"abstract":"Routing algorithms are required to guarantee the various quality of service (QoS) characteristics requested by the wide range of applications supported by broadband integrated services digital networks (B-ISDN). However, it is known that such a routing problem, with two or more additive or multiplicative QoS metrics in any possible combination is NP-complete. In this paper, we propose a heuristic approach based on fuzzy logic. For each metric, a fuzzy membership function is defined to reflect the QoS requirements from that metric. A fuzzy-inference rule base is implemented to generate the fuzzy cost of each path based on the crisp values of the different metrics possibly used in the network links.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133930924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682758
K. Sakkay, D. Massicotte, A. Barwicz
This paper presents a VLSI implementation of a systolic array architecture for spectrometric measurement data correction using Kalman-spline and LMS filters. The simplicity and regularity of such architecture make it very attractive for VLSI implementation. The design of the processing element and the decision block is explicitly addressed. Synthetic data is used to validate the design and evaluate performance with respect to computing time and accuracy.
{"title":"A systolic architecture for spectrometric data correction based on Kalman-spline and LMS filters","authors":"K. Sakkay, D. Massicotte, A. Barwicz","doi":"10.1109/CCECE.1998.682758","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682758","url":null,"abstract":"This paper presents a VLSI implementation of a systolic array architecture for spectrometric measurement data correction using Kalman-spline and LMS filters. The simplicity and regularity of such architecture make it very attractive for VLSI implementation. The design of the processing element and the decision block is explicitly addressed. Synthetic data is used to validate the design and evaluate performance with respect to computing time and accuracy.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131498651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685583
M. Ghazel, A. Khandani, E. Vrscay
We explore the transform coefficients of various fractal-based schemes for statistical dependence and exploit correlations to improve the compression capabilities of these schemes. In most of the standard fractal-based schemes, the transform coefficients exhibit a degree of linear dependence that can be exploited by using an appropriate vector quantizer such as the LBG algorithm. Additional compression is achieved by lossless Huffman coding of the quantized coefficients.
{"title":"Improving fractal image compression schemes through quantization and entropy coding","authors":"M. Ghazel, A. Khandani, E. Vrscay","doi":"10.1109/CCECE.1998.685583","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685583","url":null,"abstract":"We explore the transform coefficients of various fractal-based schemes for statistical dependence and exploit correlations to improve the compression capabilities of these schemes. In most of the standard fractal-based schemes, the transform coefficients exhibit a degree of linear dependence that can be exploited by using an appropriate vector quantizer such as the LBG algorithm. Additional compression is achieved by lossless Huffman coding of the quantized coefficients.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132826594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.685553
E. Yang, Zhen Zhang
We extend the fixed slope lossy algorithm derived from the kth order arithmetic codeword length function to the case of trellis structured decoders and, as a result, get a new coding method, namely, the so-called variable rate trellis source encoding which aims to jointly optimize the resulting distortion, compression rate, and selected encoding path. It is shown both theoretically and experimentally that properly designed variable rate trellis source codes are very efficient in low rate regions (below 0.8 bits/sample). With k=8 and the number of states in the decoder =32, the mean squared error encoding performance at the rate 1/2 bits/sample for memoryless Laplacian sources is about 1 dB better than that afforded by the trellis coded quantizers with 256 states. With k=8 and the number of states in the decoder =256, the mean squared error encoding performance at the rates of a fraction of 1 bit/sample for highly dependent Gauss Markov sources with correlation coefficient 0.9 is within about 0.6 dB of the distortion rate function. Note that at such low rates, predictive coders usually perform poorly.
{"title":"On the analysis and design of variable rate trellis source codes","authors":"E. Yang, Zhen Zhang","doi":"10.1109/CCECE.1998.685553","DOIUrl":"https://doi.org/10.1109/CCECE.1998.685553","url":null,"abstract":"We extend the fixed slope lossy algorithm derived from the kth order arithmetic codeword length function to the case of trellis structured decoders and, as a result, get a new coding method, namely, the so-called variable rate trellis source encoding which aims to jointly optimize the resulting distortion, compression rate, and selected encoding path. It is shown both theoretically and experimentally that properly designed variable rate trellis source codes are very efficient in low rate regions (below 0.8 bits/sample). With k=8 and the number of states in the decoder =32, the mean squared error encoding performance at the rate 1/2 bits/sample for memoryless Laplacian sources is about 1 dB better than that afforded by the trellis coded quantizers with 256 states. With k=8 and the number of states in the decoder =256, the mean squared error encoding performance at the rates of a fraction of 1 bit/sample for highly dependent Gauss Markov sources with correlation coefficient 0.9 is within about 0.6 dB of the distortion rate function. Note that at such low rates, predictive coders usually perform poorly.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132709914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-05-24DOI: 10.1109/CCECE.1998.682541
N. Fayyaz, S. Safavi-Naeini, E. Shin, N. Hodjat
A novel design for a microstrip antenna with a large tuning range is presented. The layout of this antenna consists of a rectangular patch antenna divided into two sections and connected using varactor diodes (or capacitors). A sample microstrip antenna using the new design is fabricated and tested. The experimental results of the resonant frequency is similar to the theoretical values, and the radiation pattern is also similar to that of a simple rectangular patch antenna.
{"title":"A novel electronically tunable rectangular patch antenna with one octave bandwidth","authors":"N. Fayyaz, S. Safavi-Naeini, E. Shin, N. Hodjat","doi":"10.1109/CCECE.1998.682541","DOIUrl":"https://doi.org/10.1109/CCECE.1998.682541","url":null,"abstract":"A novel design for a microstrip antenna with a large tuning range is presented. The layout of this antenna consists of a rectangular patch antenna divided into two sections and connected using varactor diodes (or capacitors). A sample microstrip antenna using the new design is fabricated and tested. The experimental results of the resonant frequency is similar to the theoretical values, and the radiation pattern is also similar to that of a simple rectangular patch antenna.","PeriodicalId":177613,"journal":{"name":"Conference Proceedings. IEEE Canadian Conference on Electrical and Computer Engineering (Cat. No.98TH8341)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131869193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：