Pub Date : 2001-07-04DOI: 10.1109/EURCON.2001.938131
S. Krile
A deterministic expansion model for sizing of N satellite links in mobile networks during exploitation is being developed. The model is applied to short- or medium-term planning with finite number of discrete time periods. In the planning process it can help the Land Earth Station Operator (LESO) to find the optimal capacity-expansion policy for new constructions and conversions of channel equipment that minimizes the total cost. The model for the capacity expansion problem with shortages (CEPS) allows capacity conversions from one satellite link to another in both directions, but limitations can be imposed. Furthermore, upper bounds on shortages and idle capacities can be imposed. The traffic demand increments for additional capacity in any time period and for any link can be negative. All cost functions are assumed to be piecewise concave and non-decreasing away from zero. Using a network flow approach the paper develops an efficient dynamic-programming algorithm to minimize the total expansion cost. An heuristic algorithm is tested on many examples, and its efficiency is compared with an algorithm based on an exact approach.
{"title":"The efficient algorithm for optimal capacity expansion of satellite links in mobile networks","authors":"S. Krile","doi":"10.1109/EURCON.2001.938131","DOIUrl":"https://doi.org/10.1109/EURCON.2001.938131","url":null,"abstract":"A deterministic expansion model for sizing of N satellite links in mobile networks during exploitation is being developed. The model is applied to short- or medium-term planning with finite number of discrete time periods. In the planning process it can help the Land Earth Station Operator (LESO) to find the optimal capacity-expansion policy for new constructions and conversions of channel equipment that minimizes the total cost. The model for the capacity expansion problem with shortages (CEPS) allows capacity conversions from one satellite link to another in both directions, but limitations can be imposed. Furthermore, upper bounds on shortages and idle capacities can be imposed. The traffic demand increments for additional capacity in any time period and for any link can be negative. All cost functions are assumed to be piecewise concave and non-decreasing away from zero. Using a network flow approach the paper develops an efficient dynamic-programming algorithm to minimize the total expansion cost. An heuristic algorithm is tested on many examples, and its efficiency is compared with an algorithm based on an exact approach.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124441882","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 : 2001-07-04DOI: 10.1109/EURCON.2001.938127
B. Zrnic, A. Zejak, I. Simic
Eclipse effect analysis is performed for the chirp radar using the chirp signal ambiguity function. A new approach to sidelobe suppression for the radar compression filter response is proposed, which enables better detection and tracking of the targets within the eclipsing zone.
{"title":"The eclipsing zone problem in the chirp radar","authors":"B. Zrnic, A. Zejak, I. Simic","doi":"10.1109/EURCON.2001.938127","DOIUrl":"https://doi.org/10.1109/EURCON.2001.938127","url":null,"abstract":"Eclipse effect analysis is performed for the chirp radar using the chirp signal ambiguity function. A new approach to sidelobe suppression for the radar compression filter response is proposed, which enables better detection and tracking of the targets within the eclipsing zone.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116356696","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 : 2001-07-04DOI: 10.1109/EURCON.2001.937800
F. Kasumagić, V. Glavinic
The paper outlines a methodology for the selection of functional profiles to be used in developing information infrastructures for transition countries, which should ensure end-to-end connectivity along with full user interoperability. Basic activities are defined, which encompass classification, analysis, comparison and assessment, while emphasis is given particularly to the definition of criteria for the selection of functional profiles along with the respective conformance issues. The place and role of this approach within information infrastructure conceptualization is defined, too, thus paving the way for the evolution of the information society.
{"title":"A methodological approach to definition of functional profiles for information infrastructures","authors":"F. Kasumagić, V. Glavinic","doi":"10.1109/EURCON.2001.937800","DOIUrl":"https://doi.org/10.1109/EURCON.2001.937800","url":null,"abstract":"The paper outlines a methodology for the selection of functional profiles to be used in developing information infrastructures for transition countries, which should ensure end-to-end connectivity along with full user interoperability. Basic activities are defined, which encompass classification, analysis, comparison and assessment, while emphasis is given particularly to the definition of criteria for the selection of functional profiles along with the respective conformance issues. The place and role of this approach within information infrastructure conceptualization is defined, too, thus paving the way for the evolution of the information society.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116490055","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 : 2001-07-04DOI: 10.1109/EURCON.2001.938120
I. Grellneth, M. Orávik
The contribution of this paper proposes a modified hybrid ARQ scheme for reliable transport services. The stress is in the analysis of the throughput performance, comparison and simulation of hybrid ARQ type I and type II in our scheme.
{"title":"Analysis of throughput performance of a modified hybrid ARQ scheme for reliable transport services","authors":"I. Grellneth, M. Orávik","doi":"10.1109/EURCON.2001.938120","DOIUrl":"https://doi.org/10.1109/EURCON.2001.938120","url":null,"abstract":"The contribution of this paper proposes a modified hybrid ARQ scheme for reliable transport services. The stress is in the analysis of the throughput performance, comparison and simulation of hybrid ARQ type I and type II in our scheme.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"652 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120861740","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 : 2001-07-04DOI: 10.1109/EURCON.2001.938176
I. Simic, A. Zejak, B. Zrnic
Digital radio communications in the heavily distorted indoor environment are limited by the communication channel characteristics. We propose a new method for self intersymbol interference reduction in chirp spread spectrum (SS) systems. The method is based on the design of compression filters with low sidelobes and preserved mainlobe width.
{"title":"Self intersymbol interference reduction in chirp spread spectrum communication systems","authors":"I. Simic, A. Zejak, B. Zrnic","doi":"10.1109/EURCON.2001.938176","DOIUrl":"https://doi.org/10.1109/EURCON.2001.938176","url":null,"abstract":"Digital radio communications in the heavily distorted indoor environment are limited by the communication channel characteristics. We propose a new method for self intersymbol interference reduction in chirp spread spectrum (SS) systems. The method is based on the design of compression filters with low sidelobes and preserved mainlobe width.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128463967","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 : 2001-07-04DOI: 10.1109/EURCON.2001.938162
P. Motlícek, G. Baudoin, J. Černocký
The aim of our effort is to reach higher quality of the resulting speech coded by a very low bit rate (VLBR) segmental coder. The basic units are found automatically in a training database using temporal decomposition and vector quantization. They are modeled by HMM. Then two methods of re-segmentation are used in order to find new longer units. In the first approach borders are set to the centers of previous units. In the second, borders are fixed to the centers of middle HMM states of previous units. The number of frames in new units is conditioned to be bigger than a fixed constant. Hence, new units can consist of several previous segments. Decreasing transition noise of the resultant speech was obtained using these techniques.
{"title":"Diphone-like units without phonemes - option for very low bit rate speech coding","authors":"P. Motlícek, G. Baudoin, J. Černocký","doi":"10.1109/EURCON.2001.938162","DOIUrl":"https://doi.org/10.1109/EURCON.2001.938162","url":null,"abstract":"The aim of our effort is to reach higher quality of the resulting speech coded by a very low bit rate (VLBR) segmental coder. The basic units are found automatically in a training database using temporal decomposition and vector quantization. They are modeled by HMM. Then two methods of re-segmentation are used in order to find new longer units. In the first approach borders are set to the centers of previous units. In the second, borders are fixed to the centers of middle HMM states of previous units. The number of frames in new units is conditioned to be bigger than a fixed constant. Hence, new units can consist of several previous segments. Decreasing transition noise of the resultant speech was obtained using these techniques.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128428307","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 : 2001-07-04DOI: 10.1109/EURCON.2001.938143
Joseph K. Liu, Victor K. Wei, C. Siu, Roy L. Chan, T. Choi
One of the main barriers to the development of multi-application smart card is the limitation of the memory size and processing power. This paper gives a solution to it by using an elliptic curve cryptosystem (ECC) as the public key scheme. The basic mathematics principles of ECC are discussed. Based on the ECC, we also put a digital certificate inside the smart card. This paper presents a prototype of a multi-application smart card system using the ECC certificate. Several security issues are also discussed.
{"title":"Multi-application smart card with elliptic curve cryptosystem certificate","authors":"Joseph K. Liu, Victor K. Wei, C. Siu, Roy L. Chan, T. Choi","doi":"10.1109/EURCON.2001.938143","DOIUrl":"https://doi.org/10.1109/EURCON.2001.938143","url":null,"abstract":"One of the main barriers to the development of multi-application smart card is the limitation of the memory size and processing power. This paper gives a solution to it by using an elliptic curve cryptosystem (ECC) as the public key scheme. The basic mathematics principles of ECC are discussed. Based on the ECC, we also put a digital certificate inside the smart card. This paper presents a prototype of a multi-application smart card system using the ECC certificate. Several security issues are also discussed.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"822 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126960019","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 : 2001-07-04DOI: 10.1109/EURCON.2001.938154
D. Gvozdanovic, D. Simic, U. Vizek, M. Matijasevic, K. Valavanis, D. Huljenic
The immense public interest in Internet multimedia, and particularly World Wide Web applications, has also triggered a lot of research towards better understanding of networking requirements of such applications. We propose a Petri net model that addresses traffic generation patterns of Internet-based real-time block-transfer applications. The proposed model is based on the Web's native hypertext transport protocol, and consists of three modules: client, server, and real channel. The model flexibility is achieved through adjustable system parameters. Formal validation results demonstrate the correctness of the proposed model.
{"title":"Petri net based modeling of application layer traffic characteristics","authors":"D. Gvozdanovic, D. Simic, U. Vizek, M. Matijasevic, K. Valavanis, D. Huljenic","doi":"10.1109/EURCON.2001.938154","DOIUrl":"https://doi.org/10.1109/EURCON.2001.938154","url":null,"abstract":"The immense public interest in Internet multimedia, and particularly World Wide Web applications, has also triggered a lot of research towards better understanding of networking requirements of such applications. We propose a Petri net model that addresses traffic generation patterns of Internet-based real-time block-transfer applications. The proposed model is based on the Web's native hypertext transport protocol, and consists of three modules: client, server, and real channel. The model flexibility is achieved through adjustable system parameters. Formal validation results demonstrate the correctness of the proposed model.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132407186","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 : 2001-07-04DOI: 10.1109/EURCON.2001.937765
S. Gunes, N. Yilmaz, N. Allahverdi
In this study, a multicast routing algorithm based on a parallel branching method has been developed for a faulty hypercube parallel processing system. The routing from the source to the destination nodes is guaranteed in the shortest time with this algorithm. Going through to the destinations from the source is a parallel process at each step. The superiority of the developed algorithm over previous studies is that the routing from the source to the destination is achieved in minimal steps without restriction to the number of faulty nodes. This means that the algorithm is running independently from the number of faulty nodes. The algorithm is simulated with a hypercube routing simulator.
{"title":"A multicast routing algorithm based on parallel branching method for faulty hypercubes","authors":"S. Gunes, N. Yilmaz, N. Allahverdi","doi":"10.1109/EURCON.2001.937765","DOIUrl":"https://doi.org/10.1109/EURCON.2001.937765","url":null,"abstract":"In this study, a multicast routing algorithm based on a parallel branching method has been developed for a faulty hypercube parallel processing system. The routing from the source to the destination nodes is guaranteed in the shortest time with this algorithm. Going through to the destinations from the source is a parallel process at each step. The superiority of the developed algorithm over previous studies is that the routing from the source to the destination is achieved in minimal steps without restriction to the number of faulty nodes. This means that the algorithm is running independently from the number of faulty nodes. The algorithm is simulated with a hypercube routing simulator.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132444432","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 : 2001-07-04DOI: 10.1109/EURCON.2001.938110
C. Qu, J. Gamper, W. Nejdl
Teaching and learning is naturally an interactive, recursive, and iterative process. Consequently, the courseware is almost always changing during the whole teaching and learning process, which makes courseware authoring and publishing more complicated. In addition, with today's use of Web-enabled global cooperation in education, courseware authoring and publishing is further becoming a collaborative process due to the necessary cooperation among geographically dispersed partner universities. In this paper, we present a courseware authoring and publishing system which has been practically applied in a joint course held both at the University of Hannover and the Free University of Bozen. We adopt a recent collaboration-friendly Internet protocol, WebDAV, to support collaborative courseware authoring, the markup-language XML to represent meta-data of course contents, and the stylesheet language XSLT to accomplish courseware presentation. With its simple syntax, XML can, on the one hand, simplify the courseware authoring and structuring process. On the other hand, as a neutral meta-language, it can also separate course contents from courseware presentation when used with XSLT.
{"title":"Collaborative courseware authoring and publishing based on WebDAV, XML, and XSLT","authors":"C. Qu, J. Gamper, W. Nejdl","doi":"10.1109/EURCON.2001.938110","DOIUrl":"https://doi.org/10.1109/EURCON.2001.938110","url":null,"abstract":"Teaching and learning is naturally an interactive, recursive, and iterative process. Consequently, the courseware is almost always changing during the whole teaching and learning process, which makes courseware authoring and publishing more complicated. In addition, with today's use of Web-enabled global cooperation in education, courseware authoring and publishing is further becoming a collaborative process due to the necessary cooperation among geographically dispersed partner universities. In this paper, we present a courseware authoring and publishing system which has been practically applied in a joint course held both at the University of Hannover and the Free University of Bozen. We adopt a recent collaboration-friendly Internet protocol, WebDAV, to support collaborative courseware authoring, the markup-language XML to represent meta-data of course contents, and the stylesheet language XSLT to accomplish courseware presentation. With its simple syntax, XML can, on the one hand, simplify the courseware authoring and structuring process. On the other hand, as a neutral meta-language, it can also separate course contents from courseware presentation when used with XSLT.","PeriodicalId":205662,"journal":{"name":"EUROCON'2001. International Conference on Trends in Communications. Technical Program, Proceedings (Cat. No.01EX439)","volume":"464 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131953728","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
扫码关注我们
求助内容：
应助结果提醒方式：