Pub Date : 1997-09-09DOI: 10.1109/ICICS.1997.652135
S. Sunil, Supriyo Palit, T. Sreenivas
The problem of discriminating keyword and non-keyword speech which is important in wordspotting applications is addressed. We have shown that garbage models cannot reduce both the rejection and false alarm rates simultaneously. To achieve this we have proposed a new scoring and search method for HMM based wordspotting without garbage models. This is a simple forward search method which incorporates the duration modelling of the keyword for efficient discrimination of keyword and non-keyword speech. This method is computationally fast, which makes it suitable for real-time implementation. The results are reported on a speaker independent database containing 10 keywords embedded in 150 carrier sentences.
{"title":"HMM based fast keyworld spotting algorithm with no garbage models","authors":"S. Sunil, Supriyo Palit, T. Sreenivas","doi":"10.1109/ICICS.1997.652135","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652135","url":null,"abstract":"The problem of discriminating keyword and non-keyword speech which is important in wordspotting applications is addressed. We have shown that garbage models cannot reduce both the rejection and false alarm rates simultaneously. To achieve this we have proposed a new scoring and search method for HMM based wordspotting without garbage models. This is a simple forward search method which incorporates the duration modelling of the keyword for efficient discrimination of keyword and non-keyword speech. This method is computationally fast, which makes it suitable for real-time implementation. The results are reported on a speaker independent database containing 10 keywords embedded in 150 carrier sentences.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"64 1","pages":"1020-1023 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90893376","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.652146
Yueh-Min Huang, Shiao-Li Tsao, Jen-Wen Ding, Chien-Wen Huang, Wen-Wei Chiang, G. Lu
A crucial QoS parameter, initial response time for a new request, was often neglected while designing or evaluating the storage subsystem of a video server in previous studies. For different types of services such as interactive video-on-demand, near video-on-demand, and pay-per-view systems, the initial delay of a new request can vary from 0.5 seconds to 5 minutes. This issue has a deep impact on choosing an efficient disk scheduling and data placement scheme for a particular type of video service. In this paper, a new performance model is proposed to evaluate the efficiency of a disk-based video server, in which both factors, number of supported streams and allowable response time, for new requests are considered simultaneously. According to the proposed model, the most efficient storage configuration can be easily obtained under the given parameters.
{"title":"Performance analysis of data placement and retrieval schemes for video servers based on response time guaranteed","authors":"Yueh-Min Huang, Shiao-Li Tsao, Jen-Wen Ding, Chien-Wen Huang, Wen-Wei Chiang, G. Lu","doi":"10.1109/ICICS.1997.652146","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652146","url":null,"abstract":"A crucial QoS parameter, initial response time for a new request, was often neglected while designing or evaluating the storage subsystem of a video server in previous studies. For different types of services such as interactive video-on-demand, near video-on-demand, and pay-per-view systems, the initial delay of a new request can vary from 0.5 seconds to 5 minutes. This issue has a deep impact on choosing an efficient disk scheduling and data placement scheme for a particular type of video service. In this paper, a new performance model is proposed to evaluate the efficiency of a disk-based video server, in which both factors, number of supported streams and allowable response time, for new requests are considered simultaneously. According to the proposed model, the most efficient storage configuration can be easily obtained under the given parameters.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"100 1","pages":"1073-1077 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76597503","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.652304
Yu Hu, Bo Lan, Fan Lu, Teng Joon Lim
With the appearance of the microcell and in-building systems, the cellular mobile networks and the personal communication systems (PCS) have been established in the three-dimensional space. A traffic model and analysis for both the cubic and proposed body-centered-cubic (BCC) cells with handoff are examined. The blocking probability and the handoff attempt failure probability are derived and presented. In this study, three schemes for call traffic handling are considered. One is nonprioritized and two are priority oriented. Fixed channel assignment is considered. In the nonprioritized scheme, the base stations make no distinction between new call attempts and handoff attempts. Attempts which find all channels occupied are cleared. In the two priority schemes, a fixed number of channels in each cell are reserved exclusively for handoff calls. Appropriate analytical models and criteria are developed and used to derive the performance characteristics.
{"title":"The call performance for body-centered-cubic cell and cubic cell in 3-dimensional personal communication system","authors":"Yu Hu, Bo Lan, Fan Lu, Teng Joon Lim","doi":"10.1109/ICICS.1997.652304","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652304","url":null,"abstract":"With the appearance of the microcell and in-building systems, the cellular mobile networks and the personal communication systems (PCS) have been established in the three-dimensional space. A traffic model and analysis for both the cubic and proposed body-centered-cubic (BCC) cells with handoff are examined. The blocking probability and the handoff attempt failure probability are derived and presented. In this study, three schemes for call traffic handling are considered. One is nonprioritized and two are priority oriented. Fixed channel assignment is considered. In the nonprioritized scheme, the base stations make no distinction between new call attempts and handoff attempts. Attempts which find all channels occupied are cleared. In the two priority schemes, a fixed number of channels in each cell are reserved exclusively for handoff calls. Appropriate analytical models and criteria are developed and used to derive the performance characteristics.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"7 1","pages":"1790-1794 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76889311","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.647117
Z. Fan, P. Mars
In this paper, we propose a neural network (NN) approach for adaptive bandwidth allocation in ATM networks. This method is essentially based on the dynamic time-slice (DTS) scheme proposed by K. Sriram (1993) which guarantees a required bandwidth for each traffic class and/or virtual circuit (VC). Instead of using analytical static traffic tables to allocate bandwidth, we use NNs to adaptively estimate the effective bandwidths of different call types to reflect the time-varying nature of traffic conditions. Simulation results show that the neural estimation is more accurate and hence leads to higher resource utilization. The NN approach also provides faster response in reallocation of bandwidth to meet the stringent delay requirements.
{"title":"An NN-based dynamic time-slice scheme for bandwidth allocation in ATM networks","authors":"Z. Fan, P. Mars","doi":"10.1109/ICICS.1997.647117","DOIUrl":"https://doi.org/10.1109/ICICS.1997.647117","url":null,"abstract":"In this paper, we propose a neural network (NN) approach for adaptive bandwidth allocation in ATM networks. This method is essentially based on the dynamic time-slice (DTS) scheme proposed by K. Sriram (1993) which guarantees a required bandwidth for each traffic class and/or virtual circuit (VC). Instead of using analytical static traffic tables to allocate bandwidth, we use NNs to adaptively estimate the effective bandwidths of different call types to reflect the time-varying nature of traffic conditions. Simulation results show that the neural estimation is more accurate and hence leads to higher resource utilization. The NN approach also provides faster response in reallocation of bandwidth to meet the stringent delay requirements.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"66 1","pages":"345-350 vol.1"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77000411","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.652141
M. Zhao, M. Rodd
The development of computer and communication technologies has reached a point where automation becomes a versatile tool for solving crucial problems relating to process control, plant supervision and information management. However, though, automation is powerful for solving control problems, it is short of capability to handle coordination and cooperation issues, therefore, requiring the incorporation of appropriate CSCW (computer-supported cooperative work) tools. This paper introduces a simple, but effective, CSCW architecture-the "virtual whiteboard", which is able to facilitate multimedia information, such as text, graphics and images. The paper also presents the construction of such a whiteboard prototype system which, written in C, which currently runs in an X-Windows environment, using communication based on TCP/IP protocols and Ethernet/ATM LANs. Another prototype system which runs on Window NT and telephone networks is under development.
{"title":"Computer-supported cooperative work in industrial automation","authors":"M. Zhao, M. Rodd","doi":"10.1109/ICICS.1997.652141","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652141","url":null,"abstract":"The development of computer and communication technologies has reached a point where automation becomes a versatile tool for solving crucial problems relating to process control, plant supervision and information management. However, though, automation is powerful for solving control problems, it is short of capability to handle coordination and cooperation issues, therefore, requiring the incorporation of appropriate CSCW (computer-supported cooperative work) tools. This paper introduces a simple, but effective, CSCW architecture-the \"virtual whiteboard\", which is able to facilitate multimedia information, such as text, graphics and images. The paper also presents the construction of such a whiteboard prototype system which, written in C, which currently runs in an X-Windows environment, using communication based on TCP/IP protocols and Ethernet/ATM LANs. Another prototype system which runs on Window NT and telephone networks is under development.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"33 1","pages":"1050-1054 vol.2"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78139844","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.652270
Hai Lin, B. Qiu
In a paper published earlier by Lin and Qiu (see Proc. International Conference of Telecommunications (ICT), p.117-22, 1997), the authors discussed some issues related to the TES modelling of hybrid coded VBR video sources in the context of transmission in a high speed digital network and ATM based networks in particular. It has been shown that the (transform-expand-sample) TES traffic models are capable of analysing and matching the statistical characteristics of hybrid coded VBR video sources. This paper investigates some further correlation issues (autocorrelation, cross correlation) related with TES modelling of hybrid coded VBR video.
在Lin和Qiu早些时候发表的一篇论文中(参见Proc. International Conference of Telecommunications (ICT)， p.117-22, 1997)，作者讨论了在高速数字网络和基于ATM的网络中传输的背景下，混合编码VBR视频源的TES建模相关的一些问题。结果表明，(变换-扩展-样本)TES流量模型能够分析和匹配混合编码VBR视频源的统计特征。本文进一步研究了混合编码VBR视频的TES建模相关问题(自相关、互相关)。
{"title":"Correlation issues in TES modelling of hybrid coded VBR video","authors":"Hai Lin, B. Qiu","doi":"10.1109/ICICS.1997.652270","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652270","url":null,"abstract":"In a paper published earlier by Lin and Qiu (see Proc. International Conference of Telecommunications (ICT), p.117-22, 1997), the authors discussed some issues related to the TES modelling of hybrid coded VBR video sources in the context of transmission in a high speed digital network and ATM based networks in particular. It has been shown that the (transform-expand-sample) TES traffic models are capable of analysing and matching the statistical characteristics of hybrid coded VBR video sources. This paper investigates some further correlation issues (autocorrelation, cross correlation) related with TES modelling of hybrid coded VBR video.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"100 1","pages":"1627-1631 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78228805","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.652305
J. O. Kim, Chan Park, H. Choi, Jong Hyup Lee, Hyup-Jong Kim
The IETF RFC1577 "Classical IP and ARP over ATM" specification supports IP services on the ATM network configured as an LIS (logical IP subnetwork) using the ATMARP protocol. However the IPOA method based on the RFC1577 requires that the router should be used between different LISs. Also communication across the LISs needs one or more IP routers and results in an unnecessary hop-by-hop delay. Therefore the classical IPOA mechanism can not make full use of the ATM network performance. We have investigated a method where the RFC1577 can support a direct connection for communication between two endpoints in different LISs without the help of intermediate routers. This means that the resolution server on the current domain gets to know the ATM address of the destination somehow though the destination belongs to a different LIS. To do this, we propose an advanced IPOA mechanism using the LAG (local address group) instead of the traditional LIS model. We present the IP network configuration using the LAG model over an ATM network. We also present the simple address resolution protocol which uses the ATMARP packets defined in the RFC1577 to resolve the ATM address of the IP entity regardless of their address group.
{"title":"IPOA with LAG model: for easy implementation and guaranteeing high performance","authors":"J. O. Kim, Chan Park, H. Choi, Jong Hyup Lee, Hyup-Jong Kim","doi":"10.1109/ICICS.1997.652305","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652305","url":null,"abstract":"The IETF RFC1577 \"Classical IP and ARP over ATM\" specification supports IP services on the ATM network configured as an LIS (logical IP subnetwork) using the ATMARP protocol. However the IPOA method based on the RFC1577 requires that the router should be used between different LISs. Also communication across the LISs needs one or more IP routers and results in an unnecessary hop-by-hop delay. Therefore the classical IPOA mechanism can not make full use of the ATM network performance. We have investigated a method where the RFC1577 can support a direct connection for communication between two endpoints in different LISs without the help of intermediate routers. This means that the resolution server on the current domain gets to know the ATM address of the destination somehow though the destination belongs to a different LIS. To do this, we propose an advanced IPOA mechanism using the LAG (local address group) instead of the traditional LIS model. We present the IP network configuration using the LAG model over an ATM network. We also present the simple address resolution protocol which uses the ATMARP packets defined in the RFC1577 to resolve the ATM address of the IP entity regardless of their address group.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"2 1","pages":"1795-1799 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78513666","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.652218
Do-Nyeon Kim, I. Cha, D. Youn
A new method for computing an estimate of the time-varying magnitude squared coherence (MSC) between two data sequences is presented. The method estimates the time-varying MSC function by using a modulator and a lowpass filter and is compared with a method using a bandpass filter and the Hilbert transform through computer simulation.
{"title":"Estimation of time-varying magnitude squared coherence functions","authors":"Do-Nyeon Kim, I. Cha, D. Youn","doi":"10.1109/ICICS.1997.652218","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652218","url":null,"abstract":"A new method for computing an estimate of the time-varying magnitude squared coherence (MSC) between two data sequences is presented. The method estimates the time-varying MSC function by using a modulator and a lowpass filter and is compared with a method using a bandpass filter and the Hilbert transform through computer simulation.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"11 1 1","pages":"1389-1392 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77898269","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.652276
Junbiao Zhang, J. Hui
We present two resource reservation schemes which are intended for different real-time VBR video application scenarios with different resource requirements. The static scheme makes a CBR reservation based on a target rate while the dynamic scheme relies on the RCBR service to achieve an efficient resource utilization. In each scheme, a traffic smoothing process is employed to regulate the video traffic such that it ensures video display continuity and meets the resource restrictions imposed by the application or the network. The smoothing algorithms are directly adapted from some smoothing optimization methods for stored videos with additional considerations of the real-time requirements. Quantization controls are initiated only when the smoothing results are known or are likely to violate the resource restrictions in the future.
{"title":"Static and dynamic resource allocation algorithms for real-time VBR video transmissions in multimedia networks","authors":"Junbiao Zhang, J. Hui","doi":"10.1109/ICICS.1997.652276","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652276","url":null,"abstract":"We present two resource reservation schemes which are intended for different real-time VBR video application scenarios with different resource requirements. The static scheme makes a CBR reservation based on a target rate while the dynamic scheme relies on the RCBR service to achieve an efficient resource utilization. In each scheme, a traffic smoothing process is employed to regulate the video traffic such that it ensures video display continuity and meets the resource restrictions imposed by the application or the network. The smoothing algorithms are directly adapted from some smoothing optimization methods for stored videos with additional considerations of the real-time requirements. Quantization controls are initiated only when the smoothing results are known or are likely to violate the resource restrictions in the future.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"49 1","pages":"1657-1662 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77998638","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.652266
Chunqi Chang, S. Yau, P. Kwok, F. K. Lam, F. Chan
A general result on identifiability for the blind source separation problem, based on second order statistics only, is presented. The separation principle using second order statistics is first proposed. This is followed by a discussion on a number of algorithms to separate the sources one by one.
{"title":"Sequential approach to blind source separation using second order statistics","authors":"Chunqi Chang, S. Yau, P. Kwok, F. K. Lam, F. Chan","doi":"10.1109/ICICS.1997.652266","DOIUrl":"https://doi.org/10.1109/ICICS.1997.652266","url":null,"abstract":"A general result on identifiability for the blind source separation problem, based on second order statistics only, is presented. The separation principle using second order statistics is first proposed. This is followed by a discussion on a number of algorithms to separate the sources one by one.","PeriodicalId":71361,"journal":{"name":"信息通信技术","volume":"8 2 1","pages":"1608-1612 vol.3"},"PeriodicalIF":0.0,"publicationDate":"1997-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78332769","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
扫码关注我们
求助内容：
应助结果提醒方式：