Pub Date : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348192
Yongbin Yu, Qishui Zhong, Kang Li, Juebang Yu, X. Liao
This paper represents a systematic framework for the stability and design of nonlinear fuzzy control chaotic systems. Based on Takagi-Sugeno(T-S) fuzzy model and parallel distributed compensation (PDC) design technique considering current state and delayed state feedback control, we propose delay-dependent chaos control criterion and stability corollary expressed in terms of linear matrix inequalities(LMIs). The design method is conceptually natural and effective for chaotic systems.
{"title":"An LMI-based Fuzzy Control Method of Chaotic Systems","authors":"Yongbin Yu, Qishui Zhong, Kang Li, Juebang Yu, X. Liao","doi":"10.1109/ICCCAS.2007.4348192","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348192","url":null,"abstract":"This paper represents a systematic framework for the stability and design of nonlinear fuzzy control chaotic systems. Based on Takagi-Sugeno(T-S) fuzzy model and parallel distributed compensation (PDC) design technique considering current state and delayed state feedback control, we propose delay-dependent chaos control criterion and stability corollary expressed in terms of linear matrix inequalities(LMIs). The design method is conceptually natural and effective for chaotic systems.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127800619","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348207
Zhang Zheng, Haibo Wang
In this paper, aim at the inefficient problem of the a priori algorithms, we design a new matrix data structure, called cooccurrence matrix, in short COM, to store the data information instead of directly using the transactional database. In COM, any item sets can be randomly accessed and counted without many times full scan of the original transactional database. Based on COM, we first divide association rule into two kinds of rule and then we present an efficient algorithms (COM_mining) to find the valid association rules among the frequent items. Finally we apply COM_mining algorithm and a priori algorithm simultaneously to analyze up-down association relationship between various industry stock blocks of China A stock market. From analytical result we can find that in China A stock market, there are indeed up-down association relationship between various industry stock blocks. At the same time, through comparing COM_mining algorithm and a priori algorithm in this application, we can see, COM_mining is more efficient than a priori.
{"title":"An Efficient Association Rule Mining Algorithm and Business Application","authors":"Zhang Zheng, Haibo Wang","doi":"10.1109/ICCCAS.2007.4348207","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348207","url":null,"abstract":"In this paper, aim at the inefficient problem of the a priori algorithms, we design a new matrix data structure, called cooccurrence matrix, in short COM, to store the data information instead of directly using the transactional database. In COM, any item sets can be randomly accessed and counted without many times full scan of the original transactional database. Based on COM, we first divide association rule into two kinds of rule and then we present an efficient algorithms (COM_mining) to find the valid association rules among the frequent items. Finally we apply COM_mining algorithm and a priori algorithm simultaneously to analyze up-down association relationship between various industry stock blocks of China A stock market. From analytical result we can find that in China A stock market, there are indeed up-down association relationship between various industry stock blocks. At the same time, through comparing COM_mining algorithm and a priori algorithm in this application, we can see, COM_mining is more efficient than a priori.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121451975","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348205
Bin Wu, Luo Qi, Xiong Feng
With the development of the E-commerce, personalized product and service have become a developing trend gradually .To meet the personalized needs of customers in E-commerce, a new personalized recommendation algorithm based on support vector machine was proposed in the paper. First, user profile was organized hierarchically into field information and atomic information needs, considering similar information needs in the group users. Support vector machine was adopted for collaborative recommendation in classification mode, and then Vector Space Model was used for content-based recommendation according to atomic information needs. The algorithm had overcome the demerit of using collaborative or content-based recommendation solely, which improved the precision and recall in a large degree. It also fits for large scale group recommendation. The algorithm could also used in personalized recommendation service system based on E-commerce.
{"title":"Personalized Recommendation Algorithm based on SVM","authors":"Bin Wu, Luo Qi, Xiong Feng","doi":"10.1109/ICCCAS.2007.4348205","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348205","url":null,"abstract":"With the development of the E-commerce, personalized product and service have become a developing trend gradually .To meet the personalized needs of customers in E-commerce, a new personalized recommendation algorithm based on support vector machine was proposed in the paper. First, user profile was organized hierarchically into field information and atomic information needs, considering similar information needs in the group users. Support vector machine was adopted for collaborative recommendation in classification mode, and then Vector Space Model was used for content-based recommendation according to atomic information needs. The algorithm had overcome the demerit of using collaborative or content-based recommendation solely, which improved the precision and recall in a large degree. It also fits for large scale group recommendation. The algorithm could also used in personalized recommendation service system based on E-commerce.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115904064","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6250060
Daifeng Zha
This paper considers the beamforming problem with radial-basis function network in alpha stable noise environment. In the new noise environment, a novel training method is proposed based on covariation. Comparing the output of the network with the analytical solution, it is found that they are very consistent. Then, it is reasonable to perform beamforming by using radial-basis function network.
{"title":"New beamforming method based on radial- basis function neural network processing in SαSG distribution noise environments","authors":"Daifeng Zha","doi":"10.1109/ICCCAS.2007.6250060","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6250060","url":null,"abstract":"This paper considers the beamforming problem with radial-basis function network in alpha stable noise environment. In the new noise environment, a novel training method is proposed based on covariation. Comparing the output of the network with the analytical solution, it is found that they are very consistent. Then, it is reasonable to perform beamforming by using radial-basis function network.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115382278","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348166
Qin Liu, S. Hiratsuka, S. Goto, T. Ikenaga
Motion estimation plays a key role in the H.264/AVC. It is the most computationally intensive module. Although many fast motion estimation algorithms have been proposed to reduce the huge calculation complexity instead of full search, the motion estimation time still can not satisfy the critical real-time applications' needs. This paper proposes a fast search based on a two-steps coarse to line strategy by cross and diamond search patterns. And we also combines some motion vector predictors and early terminations technique to reduce search points. The experiment results shows that this fast search algorithm has reduced 60% search points and 20% motion estimation time compared with UMHexagonS algorithm, with only less than 0.04 dB loss in the video quality.
{"title":"Two-Steps Cross-Diamond Fast Search Algorithm on Motion Estimation in H.264","authors":"Qin Liu, S. Hiratsuka, S. Goto, T. Ikenaga","doi":"10.1109/ICCCAS.2007.4348166","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348166","url":null,"abstract":"Motion estimation plays a key role in the H.264/AVC. It is the most computationally intensive module. Although many fast motion estimation algorithms have been proposed to reduce the huge calculation complexity instead of full search, the motion estimation time still can not satisfy the critical real-time applications' needs. This paper proposes a fast search based on a two-steps coarse to line strategy by cross and diamond search patterns. And we also combines some motion vector predictors and early terminations technique to reduce search points. The experiment results shows that this fast search algorithm has reduced 60% search points and 20% motion estimation time compared with UMHexagonS algorithm, with only less than 0.04 dB loss in the video quality.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402422","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.4348215
Yuh-Shyan Hwang, Z. Huang, Jiann-Jong Chen, Wen-Ta Lee
In this paper, a current-mode linear transformation (CMLT) filter based on current differencing buffered amplifier (CDBA) is presented. The systematic method is developed to realize CMLT CDBA-based filters efficiently. Based on the proposed design procedures, we can synthesize high-order current-mode filters with CDBAs, grounded resistors and capacitors. A third-order Chebychev lowpass filter is demonstrated. The proposed circuit has been designed with TSMC 0.35 um 2P4M CMOS processes. Simulation results that confirm the theoretical analysis are obtained. Furthermore, the proposed circuits can be extended to high-order filters.
提出了一种基于差分缓冲放大器(CDBA)的电流型线性变换滤波器。为有效实现基于CMLT cba的滤波器，提出了系统的方法。根据提出的设计程序，我们可以用cdba、接地电阻和电容合成高阶电流模式滤波器。介绍了一种三阶切比切夫低通滤波器。该电路采用台积电0.35 um 2P4M CMOS工艺设计。仿真结果证实了理论分析的正确性。此外，所提出的电路可以扩展到高阶滤波器。
{"title":"High-Order Current-Mode Filters Based on Current Differencing Buffered Amplifiers","authors":"Yuh-Shyan Hwang, Z. Huang, Jiann-Jong Chen, Wen-Ta Lee","doi":"10.1109/ICCCAS.2007.4348215","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348215","url":null,"abstract":"In this paper, a current-mode linear transformation (CMLT) filter based on current differencing buffered amplifier (CDBA) is presented. The systematic method is developed to realize CMLT CDBA-based filters efficiently. Based on the proposed design procedures, we can synthesize high-order current-mode filters with CDBAs, grounded resistors and capacitors. A third-order Chebychev lowpass filter is demonstrated. The proposed circuit has been designed with TSMC 0.35 um 2P4M CMOS processes. Simulation results that confirm the theoretical analysis are obtained. Furthermore, the proposed circuits can be extended to high-order filters.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115141253","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}
The traditional entropy is an efficient method for high-level power estimation, but it doesn't work when the input signals are temporal correlated, as is always the case for video and audio streams. In this paper, we put forward an improved definition of entropy for the application of power estimation to take into account the temporal correlated signals. The theoretical proofs and the benchmark experimental results verified the efficiency of our algorithm on both the accuracy and the time complexity.
{"title":"High-level Power Estimation with Improved Entropy for Considering the Temporal Correlated Signals","authors":"Wu Yipin, Zhou Feng, Chen Hua, Niu Qi, Li Shun, Chen Chunhong","doi":"10.1109/ICCCAS.2007.4348222","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.4348222","url":null,"abstract":"The traditional entropy is an efficient method for high-level power estimation, but it doesn't work when the input signals are temporal correlated, as is always the case for video and audio streams. In this paper, we put forward an improved definition of entropy for the application of power estimation to take into account the temporal correlated signals. The theoretical proofs and the benchmark experimental results verified the efficiency of our algorithm on both the accuracy and the time complexity.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127417878","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6250068
Guocai Li, Y. Gong
A digital beam forming (DBF) approach is presented to overcome the Line of sight (LOS) interference for wide band MIMO system. An external stage for LOS interference rejection is involved in the scheme. The performance of the wide band MIMO in various interference scenarios are examined by analyses and simulations. Since the LOS interference has been removed, the multiple receivers can effectively utilize the diversity, leading to performance enhancement. Numerical results are given to demonstrate that the proposed DBF approach exhibits robustness against the LOS interference.
{"title":"A NBI suppression approach based on space-domain DBF processing for wideband MIMO system","authors":"Guocai Li, Y. Gong","doi":"10.1109/ICCCAS.2007.6250068","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6250068","url":null,"abstract":"A digital beam forming (DBF) approach is presented to overcome the Line of sight (LOS) interference for wide band MIMO system. An external stage for LOS interference rejection is involved in the scheme. The performance of the wide band MIMO in various interference scenarios are examined by analyses and simulations. Since the LOS interference has been removed, the multiple receivers can effectively utilize the diversity, leading to performance enhancement. Numerical results are given to demonstrate that the proposed DBF approach exhibits robustness against the LOS interference.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127471591","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6247595
Nie Sai-Lan, Chen Ji-zhong, JI Chao-wen
This paper presents an efficient architecture of digital channelized receiver based on IDFT poly-phase filter bank. The proposed architecture has broadband instantaneous frequency coverage, small amounts of calculation, high frequency resolution, and strong capability to distinguish simultaneous signals. This architecture also provides a good model for accurate instantaneous frequency measurement. The simulation results by Matlab indicate that it is highly efficient.
{"title":"Modelling and simulation of digital channelized receiver based on IDFT poly-phase filter architecture","authors":"Nie Sai-Lan, Chen Ji-zhong, JI Chao-wen","doi":"10.1109/ICCCAS.2007.6247595","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6247595","url":null,"abstract":"This paper presents an efficient architecture of digital channelized receiver based on IDFT poly-phase filter bank. The proposed architecture has broadband instantaneous frequency coverage, small amounts of calculation, high frequency resolution, and strong capability to distinguish simultaneous signals. This architecture also provides a good model for accurate instantaneous frequency measurement. The simulation results by Matlab indicate that it is highly efficient.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124353430","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 : 2007-07-11DOI: 10.1109/ICCCAS.2007.6251618
Jun-yan Li, Sheng Wang, Xiong Wang
In all-optical wavelength-division multiplexing (WDM) networks, splitters are used to realize multicast. The multicast-capable cross-connects are the cross-connects with passive power splitters in the all-optical network. Placing splitters at all of the nodes is considered to be expensive in the all-optical WDM network. Optimally selecting a subset of nodes to place the splitters can reduce the cost and this placement problem is called the splitter placement problem. The multicast demands of splitter placement problem are deemed to be static in previous researches, but the demands of real network are uncertain. In this paper, a robust optimization strategy is proposed to optimally solve the splitter placement problem with uncertain demands and a fixed number of multicast-capable cross-connects. The different multicast demands are described as a set of scenarios each with a known probability in a demand forecast. The robust optimization strategy is modeled as an Integer Programming model, whose primary objective is to minimize a regret function. Regret function of the robust solution models the over resource provisioning of all the possible scenarios in the network, which is the difference between the resource provisioning really used in scenario and the optimal resource provisioning that could be used. Using robust optimization strategy to solve the splitter placement, an optimal placement of splitters can be gained, which make the resource provisioning of each possible scenario close to the optimal resource consumption and robust for all-optical multicast.
{"title":"Robust solution for splitter placement in all-optical WDM networks","authors":"Jun-yan Li, Sheng Wang, Xiong Wang","doi":"10.1109/ICCCAS.2007.6251618","DOIUrl":"https://doi.org/10.1109/ICCCAS.2007.6251618","url":null,"abstract":"In all-optical wavelength-division multiplexing (WDM) networks, splitters are used to realize multicast. The multicast-capable cross-connects are the cross-connects with passive power splitters in the all-optical network. Placing splitters at all of the nodes is considered to be expensive in the all-optical WDM network. Optimally selecting a subset of nodes to place the splitters can reduce the cost and this placement problem is called the splitter placement problem. The multicast demands of splitter placement problem are deemed to be static in previous researches, but the demands of real network are uncertain. In this paper, a robust optimization strategy is proposed to optimally solve the splitter placement problem with uncertain demands and a fixed number of multicast-capable cross-connects. The different multicast demands are described as a set of scenarios each with a known probability in a demand forecast. The robust optimization strategy is modeled as an Integer Programming model, whose primary objective is to minimize a regret function. Regret function of the robust solution models the over resource provisioning of all the possible scenarios in the network, which is the difference between the resource provisioning really used in scenario and the optimal resource provisioning that could be used. Using robust optimization strategy to solve the splitter placement, an optimal placement of splitters can be gained, which make the resource provisioning of each possible scenario close to the optimal resource consumption and robust for all-optical multicast.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123497177","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
扫码关注我们
求助内容：
应助结果提醒方式：