{"title":"Mouth Shape Sequence Recognition Based on Speech Phoneme Recognition","authors":"M. Xu, R. Hu","doi":"10.1109/CHINACOM.2006.344672","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344672","url":null,"abstract":"As part of the effort to realize human face cartoon automatic synthesization, we explored the mouth shape sequence recognition techniques for continuous natural speech. In this paper we introduce such a method based on speech phoneme recognition. The method consists of five major parts, namely, triphone modeling, search space organization, Viterbi searching, speech phoneme recognition, and path tracking back. At the end of this paper, outputs of such a system are illustrated.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114282414","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}
{"title":"An 802.11 Based Location-Aware Computing: Intelligent Guide System","authors":"Chun-Dong Wang, Ming Gao, Xiu-Feng Wang","doi":"10.1109/CHINACOM.2006.344846","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344846","url":null,"abstract":"Context-aware computing are gaining increasing attention due to the value they add to wireless networks. We described the innards of IGS (intelligent guide system), an 802.11 location-based tour guide system. Our objective is to empower mobile devices to recognize the context when the tourists visit some scenic spots and provide corresponding services. In our work, we proposed BAFO (be away from obstacles) algorithm to deploy access points (APs), and proposed a received signal strength (RSS) based algorithm MNNSS (modified nearest neighbor in signal space) to position mobile terminals. We divided the whole IGS system into four parts, and each part can do its job independently. We also used a friendly user interface so that the user can easily get the information they need. These proposed techniques can be further extended to the indoor guiding and tracing system.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121898305","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}
{"title":"UWB-based sensor networks and the IEEE 802.15.4a standard - a tutorial","authors":"A. Molisch, P. Orlik, Z. Sahinoglu, Jin Zhang","doi":"10.1109/CHINACOM.2006.344917","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344917","url":null,"abstract":"This paper gives a tutorial overview of ultrawide-band communications systems for sensor networks. In particular, we describe the IEEE 802.15.4a standard, which is currently being developed. While most nodes (reduced-function devices) in sensor networks usually have to consume little energy, and are constrained with respect to the complexity of the processing they can perform, some nodes (full-function devices) do not show these restrictions. We describe a hybrid modulation, coding, and multiple access scheme that is particularly suited for heterogeneous networks that contain both FFDs and RFDs. The scheme is a generalization of the well-known time-hopping impulse radio (TH-IR). It employs systematic coding, joint pulse-position modulation and phase shift keying, as well as a combination of polarity scrambling and time-hopping. We also describe two-way ranging algorithms that serve as the basis for geolocation in 802.15.4a, and we discuss the methods for how the ranging information can be kept secret from snoopers.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129365655","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}
{"title":"A Multi-Policy Exception Handling System for BPEL Process","authors":"Wn Jiajia, Junliang Chen, Peng Yong, Xu Meng","doi":"10.1109/CHINACOM.2006.344856","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344856","url":null,"abstract":"Business process execution language for Web services (BPEL4WS) has been proposed for composing Web services into a new one. A BPEL4WS description requires the specification of both the normal flow and the possible variations due to exceptional situations that can be anticipate and monitored. Nevertheless, defining exception handling is often in ad hoc way, it is up to the service developers to define how to deal with these exceptions. This paper uses policy to capture the common part of exception handling and presents a multi-policy exception handling system (MPEHS) to provide system level solution. These policy can be reused in different BPEL processes and simplify the work of BPEL process developer.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129672318","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}
{"title":"A TCAM Index Scheme for IP Address Lookup","authors":"Yi Tang, Wei Lin, Bin Liu","doi":"10.1109/CHINACOM.2006.344849","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344849","url":null,"abstract":"The rapidly increasing number of hosts on the Internet has caused a significant growth of the number of entries in the routing table, which greatly exacerbates the pressure on TCAM space requirement. In this paper, we propose a novel lookup algorithm: TCAM index scheme (TIS) for IP lookup. The algorithm fully considers the discrepancies among different parts of the prefix tree, and divides the whole prefix tree into several different sub-trees. For each sub-tree, only a single prefix will be stored in the TCAM, while the information of other prefixes (in the sub-tree) is preserved in the correlated SRAM. Hence, the space demand for TCAM is extremely reduced. Meanwhile, bitmap compression is utilized to maximize the compression ratio and minimize average SRAM requirement. Viable implementations on software and hardware plane respectively are also provided. The simulation result shows that for a real-world IPv4 routing table containing 190k prefixes, our scheme can realize line-speed lookup with only 40k 72 bits TCAM entries and 1 MB SRAM. The compression ratio is even higher under IPv6 routing table. What's more, updating is more effective than traditional TCAM-based methods.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130487542","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}
{"title":"Scheduling Based Controllable Interference Coordination in OFDMA Systems","authors":"Renshui Zhu, Xing Zhang, Wenbo Wang","doi":"10.1109/CHINACOM.2006.344874","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344874","url":null,"abstract":"OFDMA system with frequency re-use of 1 suffers from poor cell edge performance because of serious inter-cell interference in both downlink and uplink. In this paper, a novel method called scheduling based controllable interference coordination (SBCIC) which adapts to different system load distribution and its variation is proposed to mitigate inter-cell interference and hence increases SIR at cell edge. Simulation results show that performance at the cell edge is much improved and that of cell center is also improved in some extent with the proposed method in OFDMA system, but these improvements are not limited by the inter-cell and/or intra-cell load variation, which is very important to meet future wireless communication system's requirements. Also, reduced signalling overhead will improve system efficiency. Furthermore, the proposed method can also improve real-time service support with fast efficient HARQ mechanism because of simplified RAN architecture and protocols compared with macro diversity.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126687403","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}
{"title":"Hybrid Scheduling for Aggregated Data Delivery in Wireless Networks","authors":"Ilias Michalarias, Vasilis Boucharas, H. Lenz","doi":"10.1109/CHINACOM.2006.344685","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344685","url":null,"abstract":"Wireless networks have long ago surpassed their infancy, becoming eligible for sophisticated applications beyond common Web browsing. As the volume of data managed by such applications relentlessly grows over time, the underlying network infrastructure has to keep up with the escalating demand. The multidimensional data modeling is extensively used in data warehouses, in order to facilitate decision making. Since ubiquitous access has become a critical success factor in most enterprises, wireless networks are expected to host data warehousing applications. In this paper, we propose a hybrid scheduling algorithm, explicitly suited for on demand delivery of aggregated data in wireless networks. By selecting between highly compressed data structures, the size of data transmitted into the network is minimized, however without any loss of semantic information. In this way, not only users posing multidimensional queries experience reduced access time and device energy consumption, but generated traffic is minimized too","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126959081","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}
{"title":"Traffic Splitting over ECMPs using ACC Scheme","authors":"Wei Lin, Yi Tang, Bin Liu","doi":"10.1109/CHINACOM.2006.344703","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344703","url":null,"abstract":"In order to reduce network congestion, when equal-cost-multi-paths (ECMPs) are between a forwarding node and a destination subnet, traffic should be balanced among ECMPs and packets of the same TCP flow should reach destination host in the same order. An algorithm called ARC-based caching with counting (ACC) is proposed. Packet length differentiation is considered to achieve load balance. UDP packets are only concerned to achieve load balance. Furthermore, flow access recency and frequency are considered when redirecting a flow to a new path. Simulation shows that when delay differentiation among ECMPs is not significant, storage requirement is small, only one cycle is needed for each cache lookup, load balance is near optimal, and only 1% of packets are out of order.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123965616","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}
Yongming Liang, Han-wen Luo, Renmao Liu, Chong-guang Yan
{"title":"RLS Channel Estimation and Data Detection in Space-Time Coded MIMO-OFDM Systems","authors":"Yongming Liang, Han-wen Luo, Renmao Liu, Chong-guang Yan","doi":"10.1109/CHINACOM.2006.344760","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344760","url":null,"abstract":"Multiple-input and multiple-out (MIMO) can increase the channel capacity. Orthogonal frequency division multiplexing (OFDM) can mitigate the effects of delay spread in the frequency selective-fading channels. And space-time coding techniques can improve the system performance. So the combination of MIMO, OFDM and space-time coding techniques (space-time coded MIMO-OFDM) is an attractive method for high-data-rate wireless applications. Moreover, accurate channel state information is essential to diversity combination, coherent detection and decoding in a space-time coded MIMO-OFDM system. Therefore, a method of RLS (recursive least squares) channel estimation and maximum likelihood (ML) data detection is proposed in this paper. The RLS filter is employed in proposed channel estimation method. Simulation results confirm that this proposed RLS channel estimation method has better performances than the LMS (least mean square) or LS (least square) channel estimation method at the cost of moderate computational complexity.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114067642","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}
{"title":"SACK+/CHOKe+: making a tradeoff between Efficiency and Fairness in Satellite Networks","authors":"Chengbo Jiao, Ruiyu Dou, Julong Lan","doi":"10.1109/CHINACOM.2006.344890","DOIUrl":"https://doi.org/10.1109/CHINACOM.2006.344890","url":null,"abstract":"Making a satellite system a fully functional Internet router has challenges because the characteristics of satellite communication networks are mismatched to most common Internet link technologies in several important ways. Under some error conditions, \"multiple segment losses within a single window\" happens frequently and traditional selective acknowledgment (SACK) implementation may force the TCP sender to retransmit packets that have already been received successfully by the receiver. This paper puts forward a proposed SACK+ implementation to prevent unwanted retransmission in satellite communication networks. On the other hand, in order to provide a fair bandwidth allocation to each of n flows that share the outgoing link of a congested router and to overcome low efficiency when the number of high-volume sources is small, we propose CHOKe+ (choose and keep for responsive flows, choose and kill for unresponsive flows+) as the fair queuing policy in satellite communication networks. We show that the proposed implementation of SACK+/CHOKe+ makes a good tradeoff between \"efficiency\" and \"fairness\" by NS2 simulations.","PeriodicalId":408368,"journal":{"name":"2006 First International Conference on Communications and Networking in China","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114824323","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}