Pub Date : 1997-09-09DOI: 10.1109/ICICS.1997.647060
S. Kwon, H. Jeon, K. Cho
In this paper, in order to increase the probability of soft handoff at the time of handoff, an optimum reserved resource allocation scheme for handoff in a CDMA cellular system is proposed, which allocates reserved resource to each frequency channel according to the number of neighbor cells using the same frequency channel. According to performance analysis, allocating reserved resources for handoff according to the number of frequency channels being used by neighbor cells show superior performance characteristics compared to allocating reserved resources irrelevantly to frequency channels being used by neighbor cells.
{"title":"Optimum reserved resource allocation scheme for handoff in CDMA cellular system","authors":"S. Kwon, H. Jeon, K. Cho","doi":"10.1109/ICICS.1997.647060","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647060","url":null,"abstract":"In this paper, in order to increase the probability of soft handoff at the time of handoff, an optimum reserved resource allocation scheme for handoff in a CDMA cellular system is proposed, which allocates reserved resource to each frequency channel according to the number of neighbor cells using the same frequency channel. According to performance analysis, allocating reserved resources for handoff according to the number of frequency channels being used by neighbor cells show superior performance characteristics compared to allocating reserved resources irrelevantly to frequency channels being used by neighbor cells.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"17 1","pages":"74-78 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81790536","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 : 1997-09-09DOI: 10.1109/ICICS.1997.647114
H. Asjadi, Mohammad Ababafha
A new adaptive algorithm is introduced for echo cancelling. In this method, we employ the third order cumulant to update the adaptive filter coefficients. We demonstrate, by means of simulations that the third order cumulant-based adaptive algorithm performs more effectively than the LMS algorithm particularly when the input signal is accompanied with Gaussian uncorrelated noise. Moreover, the proposed algorithm shows robustness to the variations of the step-size and input signal statistics.
{"title":"Adaptive echo cancellation based on third order cumulant","authors":"H. Asjadi, Mohammad Ababafha","doi":"10.1109/ICICS.1997.647114","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647114","url":null,"abstract":"A new adaptive algorithm is introduced for echo cancelling. In this method, we employ the third order cumulant to update the adaptive filter coefficients. We demonstrate, by means of simulations that the third order cumulant-based adaptive algorithm performs more effectively than the LMS algorithm particularly when the input signal is accompanied with Gaussian uncorrelated noise. Moreover, the proposed algorithm shows robustness to the variations of the step-size and input signal statistics.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"17 1","pages":"331-335 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83802992","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 : 1997-09-09DOI: 10.1109/ICICS.1997.647086
C. J. Hu
It is proved analytically that, whenever the input-output mapping of a one-layered, hard-limited perceptron satisfies a positive, linear independency (PLI) condition, the connection matrix A to meet this mapping can be obtained noniteratively in one step from an algebraic matrix equation containing an N/spl times/M input matrix U. Each column of U is a given standard pattern vector, and there are M standard patterns to be classified. It is also analytically proved that sorting out all nonsingular submatrices U/sup k/ in U can be used as an automatic feature extraction process in this noniterative-learning system. This paper reports the theory, the design, and the experiments of a superfast-learning, optimally-robust, neural network pattern recognition system derived from this novel noniterative learning theory. An unedited video movie showing the speed of learning and the robustness in recognition of this novel pattern recognition system is demonstrated. Comparison to other neural network pattern recognition and feature extraction systems are discussed.
{"title":"An optimally robust, fast-learning, pattern recognizer derived from a noniterative neural network learning theory","authors":"C. J. Hu","doi":"10.1109/ICICS.1997.647086","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647086","url":null,"abstract":"It is proved analytically that, whenever the input-output mapping of a one-layered, hard-limited perceptron satisfies a positive, linear independency (PLI) condition, the connection matrix A to meet this mapping can be obtained noniteratively in one step from an algebraic matrix equation containing an N/spl times/M input matrix U. Each column of U is a given standard pattern vector, and there are M standard patterns to be classified. It is also analytically proved that sorting out all nonsingular submatrices U/sup k/ in U can be used as an automatic feature extraction process in this noniterative-learning system. This paper reports the theory, the design, and the experiments of a superfast-learning, optimally-robust, neural network pattern recognition system derived from this novel noniterative learning theory. An unedited video movie showing the speed of learning and the robustness in recognition of this novel pattern recognition system is demonstrated. Comparison to other neural network pattern recognition and feature extraction systems are discussed.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"1 1","pages":"195-199 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83829029","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652061
N. Shenoy
This paper presents certain preliminary performance results obtained using a scheme called deterministic quantised rate based flow control for data type traffic in ATM networks. The scheme has been based on a new paradigm of congestion control for data traffic in ATM networks, which tries to guarantee a certain QoS for such services as well, while trying not to effect the QoS of other services supported within the network. The performance of such a scheme has been evaluated using the OPNET simulation tool using a simple model of 2 VBR video sources and 2 ABR data sources. The results indicate an improvement in the traffic pattern within in the network at the same time providing a better environment for other services.
{"title":"Performance of a deterministic flow control scheme for data traffic in ATM networks","authors":"N. Shenoy","doi":"10.1109/ICICS.1997.652061","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652061","url":null,"abstract":"This paper presents certain preliminary performance results obtained using a scheme called deterministic quantised rate based flow control for data type traffic in ATM networks. The scheme has been based on a new paradigm of congestion control for data traffic in ATM networks, which tries to guarantee a certain QoS for such services as well, while trying not to effect the QoS of other services supported within the network. The performance of such a scheme has been evaluated using the OPNET simulation tool using a simple model of 2 VBR video sources and 2 ABR data sources. The results indicate an improvement in the traffic pattern within in the network at the same time providing a better environment for other services.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"1 1","pages":"669-673 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80188327","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652180
Young-Suk Shin, Youngwha Kim, S. Cho
The concept of service creation environment (SCE) has emerged as a solution to rapid development of intelligent network service software. This paper describes the general procedure for service creation and describes the structure of components of ETRI SCE based on the general service creation process. In particular, this paper focuses on the simulation environment which is used for verifying whether a service logic created by using SCE operates correctly and matches the user's intention.
{"title":"The simulation of intelligent network service logic created by service creation environment","authors":"Young-Suk Shin, Youngwha Kim, S. Cho","doi":"10.1109/ICICS.1997.652180","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652180","url":null,"abstract":"The concept of service creation environment (SCE) has emerged as a solution to rapid development of intelligent network service software. This paper describes the general procedure for service creation and describes the structure of components of ETRI SCE based on the general service creation process. In particular, this paper focuses on the simulation environment which is used for verifying whether a service logic created by using SCE operates correctly and matches the user's intention.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"28 1","pages":"1231-1234 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80790467","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652159
S. Calabrò, M. Campanella, G. Garbo
A new class of group codes suitable for N/spl times/M-PSK constellations is introduced. We describe a low complexity bounded distance decoding algorithm and a simple implementation of a differential encoder for these codes. Furthermore some relations for the evaluation of their performance are derived.
{"title":"Binary decomposable codes over N/spl times/N-PSK constellations","authors":"S. Calabrò, M. Campanella, G. Garbo","doi":"10.1109/ICICS.1997.652159","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652159","url":null,"abstract":"A new class of group codes suitable for N/spl times/M-PSK constellations is introduced. We describe a low complexity bounded distance decoding algorithm and a simple implementation of a differential encoder for these codes. Furthermore some relations for the evaluation of their performance are derived.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"44 4 1","pages":"1134-1137 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77723734","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652069
M.U. Chowdhury, S. M. Rahman, R.J. Bignall, B. Nath
This paper presents a performance evaluation of linear filtering techniques for reducing blocking artifacts in the reconstructed image of block-based DCT-coded images. The performance of filters is measured in terms of the peak signal-to-noise ratio (PSNR) for different quantisation (q) and confidence (/spl alpha/) levels.
{"title":"Performance evaluation of linear filters for reducing blocking artifacts in transform video coded images","authors":"M.U. Chowdhury, S. M. Rahman, R.J. Bignall, B. Nath","doi":"10.1109/ICICS.1997.652069","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652069","url":null,"abstract":"This paper presents a performance evaluation of linear filtering techniques for reducing blocking artifacts in the reconstructed image of block-based DCT-coded images. The performance of filters is measured in terms of the peak signal-to-noise ratio (PSNR) for different quantisation (q) and confidence (/spl alpha/) levels.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"65 1","pages":"708-712 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77810377","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 : 1997-09-09DOI: 10.1109/ICICS.1997.647089
J. Leskela
Mobile communication can in general be divided into two categories. Centralised mobile communication interfaces the mobile terminals through base stations that are connected to a fixed network. A good example of a centralised mobile system is GSM. Decentralised mobile communication does not have the concept of a base station but the messages are relayed towards their destinations through other mobile terminals. This kind of approach has been considered, for example, in disaster information systems that cannot rely on the fixed infrastructures. This paper presents one routing solution to a wireless low-power picocell network where the flexibility of decentralised communication systems is required, together with the good connectivity brought by centralised and authorised networks. These features are applied in order to provide flexible communication between augmented reality services embedded to electromechanical products and the users wearing light weight virtual reality user interfaces. A routing mechanism that quickly adapts itself with low overhead is a key factor for the success of such an environment.
{"title":"Partially decentralised wireless routing for distributed augmented reality applications","authors":"J. Leskela","doi":"10.1109/ICICS.1997.647089","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647089","url":null,"abstract":"Mobile communication can in general be divided into two categories. Centralised mobile communication interfaces the mobile terminals through base stations that are connected to a fixed network. A good example of a centralised mobile system is GSM. Decentralised mobile communication does not have the concept of a base station but the messages are relayed towards their destinations through other mobile terminals. This kind of approach has been considered, for example, in disaster information systems that cannot rely on the fixed infrastructures. This paper presents one routing solution to a wireless low-power picocell network where the flexibility of decentralised communication systems is required, together with the good connectivity brought by centralised and authorised networks. These features are applied in order to provide flexible communication between augmented reality services embedded to electromechanical products and the users wearing light weight virtual reality user interfaces. A routing mechanism that quickly adapts itself with low overhead is a key factor for the success of such an environment.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"16 1","pages":"210-214 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81316146","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 : 1997-09-09DOI: 10.1109/ICICS.1997.652238
A. S. Bavan, E. Illingworth, M. Milankovic-Atkinson, M. J. Walker
Major problems with parallel languages are concerned with the complexity and lack of expressive power which makes it difficult to produce efficient code and the ease of mapping onto parallel hardware. Also, a parallel language must be independent of specific hardware features as well as the underlying run-time support for it to be manned efficiently on a range of hardware. This paper presents a parallel language (LIPS) which allows the programs to be mapped onto a range of parallel hardware in an efficient manner. LIPS encourages a pipelining effect to occur onboard each processor in a parallel system, with data becoming available to each node once the pipe is full. LIPS uses an asynchronous communication subsystem so that synchronisation delays can be avoided. The communication dynamics being of a dataflow nature, where variables are passed from one process to another as the values become available. LIPS offers facilities for representation of data, flow of control and the manipulation of the network of processes in a practical form suitable for constructing programs for MIMD computing.
{"title":"Parallel processing in LIPS","authors":"A. S. Bavan, E. Illingworth, M. Milankovic-Atkinson, M. J. Walker","doi":"10.1109/ICICS.1997.652238","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652238","url":null,"abstract":"Major problems with parallel languages are concerned with the complexity and lack of expressive power which makes it difficult to produce efficient code and the ease of mapping onto parallel hardware. Also, a parallel language must be independent of specific hardware features as well as the underlying run-time support for it to be manned efficiently on a range of hardware. This paper presents a parallel language (LIPS) which allows the programs to be mapped onto a range of parallel hardware in an efficient manner. LIPS encourages a pipelining effect to occur onboard each processor in a parallel system, with data becoming available to each node once the pipe is full. LIPS uses an asynchronous communication subsystem so that synchronisation delays can be avoided. The communication dynamics being of a dataflow nature, where variables are passed from one process to another as the values become available. LIPS offers facilities for representation of data, flow of control and the manipulation of the network of processes in a practical form suitable for constructing programs for MIMD computing.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"8 1","pages":"1480-1483 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81545108","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 : 1997-09-09DOI: 10.1109/ICICS.1997.647167
A. Verhoeven, K. Warendorf
Hypermedia has become an increasingly applied paradigm in applications for training, education, and complex information retrieval. To support hypermedia users in applications where unguided browsing is unproductive, adaptive hypermedia environments are needed. Currently, WWW browsers are the cornerstones of most hypermedia applications targeted at Internet users. However, for certain applications, WWW hypermedia can not meet the high requirements for adaptive user support. We propose a spatial hypermedia environment to overcome limitations in graphical layout and adaptivity of HTML-based hypermedia. A prototype browser named HyperMap illustrates a browser user interface based on spatial navigation implemented in Java.
{"title":"Hypermedia on the map: Spatial hypermedia in HyperMap","authors":"A. Verhoeven, K. Warendorf","doi":"10.1109/ICICS.1997.647167","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647167","url":null,"abstract":"Hypermedia has become an increasingly applied paradigm in applications for training, education, and complex information retrieval. To support hypermedia users in applications where unguided browsing is unproductive, adaptive hypermedia environments are needed. Currently, WWW browsers are the cornerstones of most hypermedia applications targeted at Internet users. However, for certain applications, WWW hypermedia can not meet the high requirements for adaptive user support. We propose a spatial hypermedia environment to overcome limitations in graphical layout and adaptivity of HTML-based hypermedia. A prototype browser named HyperMap illustrates a browser user interface based on spatial navigation implemented in Java.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"50 1","pages":"589-592 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80905778","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
扫码关注我们
求助内容：
应助结果提醒方式：