Pub Date : 2012-05-19DOI: 10.1109/ICSAI.2012.6223368
Weifang Zhu, Heming Zhao, Xiaoping Chen
Empirical mode decomposition (EMD) is an adaptive method for analyzing non-stationary time series derived from linear and nonlinear systems. But the upper and lower envelopes fitted by cubic spline (CS) interpolation may often occur overshoots. In this paper, a novel envelope fitting method based on the optimized piecewise cubic Hermite (OPCH) interpolation is developed. Taking the difference between extreme as the cost function, chaos particle swarm optimization (CPSO) method is used to optimize the derivatives of the interpolation nodes. The flattest envelope with the optimized derivatives can overcome the overshoots well. Some numerical experiments conclude this paper, and comparisons are carried out with the classical EMD.
{"title":"Improving empirical mode decomposition with an optimized piecewise cubic Hermite interpolation method","authors":"Weifang Zhu, Heming Zhao, Xiaoping Chen","doi":"10.1109/ICSAI.2012.6223368","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223368","url":null,"abstract":"Empirical mode decomposition (EMD) is an adaptive method for analyzing non-stationary time series derived from linear and nonlinear systems. But the upper and lower envelopes fitted by cubic spline (CS) interpolation may often occur overshoots. In this paper, a novel envelope fitting method based on the optimized piecewise cubic Hermite (OPCH) interpolation is developed. Taking the difference between extreme as the cost function, chaos particle swarm optimization (CPSO) method is used to optimize the derivatives of the interpolation nodes. The flattest envelope with the optimized derivatives can overcome the overshoots well. Some numerical experiments conclude this paper, and comparisons are carried out with the classical EMD.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129954994","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223585
Shihong Yue, Jian Pan, Lijun Cui
C-means clustering algorithms have proven effective for image segmentation, but are limited by the following aspects: 1) the determination of a priori number of clusters. If the number of clusters can be incorrectly determined, a good-quality segmented image cannot be assured; 2) the poor real-time performances due to great time-consuming, and 3) the poor typicality of each cluster represented by the clustering prototype. In this paper, a grid-based C-means algorithm is applied to image segmentation, whose advantages over the existing C-means algorithm have demonstrated in some typical datasets. The convergence domain of the grid-based C-means algorithm has further been analyzed as well. Experiments show that the grid-based C-means algorithm outperforms the original C-means algorithm in some typical image segmentation applications.
{"title":"Application of grid-based C-means clustering algorithm for image segmentation","authors":"Shihong Yue, Jian Pan, Lijun Cui","doi":"10.1109/ICSAI.2012.6223585","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223585","url":null,"abstract":"C-means clustering algorithms have proven effective for image segmentation, but are limited by the following aspects: 1) the determination of a priori number of clusters. If the number of clusters can be incorrectly determined, a good-quality segmented image cannot be assured; 2) the poor real-time performances due to great time-consuming, and 3) the poor typicality of each cluster represented by the clustering prototype. In this paper, a grid-based C-means algorithm is applied to image segmentation, whose advantages over the existing C-means algorithm have demonstrated in some typical datasets. The convergence domain of the grid-based C-means algorithm has further been analyzed as well. Experiments show that the grid-based C-means algorithm outperforms the original C-means algorithm in some typical image segmentation applications.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128380278","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223604
Guohui He, Yujing Yang
According to the current domestic regional medical information construction situation, the construction thinking of medical information collaborative service platform is presented in this paper. On the basis of the data in hospital information system, centralized and distributed storage are combined, regional collaborative medical data centers are established to achieve integration among hospital information. Then, the interaction interface between hospital information system and collaborative medical data center through Web Service are set up. Therefore, the platform possesses modularization and extensibility. In the meantime, the system stability and usability are increased.
{"title":"The research and implementation of medical information collaborative service platform based on the Web Service","authors":"Guohui He, Yujing Yang","doi":"10.1109/ICSAI.2012.6223604","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223604","url":null,"abstract":"According to the current domestic regional medical information construction situation, the construction thinking of medical information collaborative service platform is presented in this paper. On the basis of the data in hospital information system, centralized and distributed storage are combined, regional collaborative medical data centers are established to achieve integration among hospital information. Then, the interaction interface between hospital information system and collaborative medical data center through Web Service are set up. Therefore, the platform possesses modularization and extensibility. In the meantime, the system stability and usability are increased.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129363245","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223141
Xiaohui Kuang, Yan Wen, Fei Xu, Xiang Li
With the large-scale distributed system plays an increasingly important role in such fields as national security, critical infrastructure and social life, its vulnerability analysis problem has become a growing focus nowadays. As a vulnerability analysis object, a multi-layer model is put forward firstly, and then a multi-dimension vulnerability analysis framework of large-scale distributed system is proposed, which provides an overview of vulnerability analysis research area and method in three aspects, namely vulnerability analysis phase, lifecycle process and taxonomy of vulnerability. From the view of lifecycle process, the challenge and research method is analysis by vulnerability analysis phase.
{"title":"A multi-dimension vulnerability analysis framework for large-scale distributed system","authors":"Xiaohui Kuang, Yan Wen, Fei Xu, Xiang Li","doi":"10.1109/ICSAI.2012.6223141","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223141","url":null,"abstract":"With the large-scale distributed system plays an increasingly important role in such fields as national security, critical infrastructure and social life, its vulnerability analysis problem has become a growing focus nowadays. As a vulnerability analysis object, a multi-layer model is put forward firstly, and then a multi-dimension vulnerability analysis framework of large-scale distributed system is proposed, which provides an overview of vulnerability analysis research area and method in three aspects, namely vulnerability analysis phase, lifecycle process and taxonomy of vulnerability. From the view of lifecycle process, the challenge and research method is analysis by vulnerability analysis phase.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124756516","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223341
Zhi-yuan Xie, Xiao-yan Wu, Jian-ning Liu, Zhen-gang Gong, Zheng-wei Hu
This paper gives the analysis of the feature of the medium voltage powerline communication in the view of reliability, investment and flexibility and the discussion of the necessity of routing automatically, compares the advantages and shortcomings of the bionic algorithms people research on a lot. It proposed an improved automatically dynamic routing algorithm for medium voltage powerline communication based on a project. The algorithm based on the communication optimality theory and non-overlapping clustering-based routing algorithm, combined with the corresponding communication protocol to achieve automatic network. Using the master and slave stations as network nodes, it decides logic layer according to the communication mode, creates the initial routing table, optimizes the communication quality, updates and sets reconstruction strategy. Simulation of the algorithm in Matlab and analysis of the communication quality and time-consuming are given. The simulation results show that the algorithm can achieve the automatically routing for medium voltage powerline carrier and improve the reliability and invulnerability of the network.
{"title":"Study on automatic routing algorithm for medium voltage powerline communication","authors":"Zhi-yuan Xie, Xiao-yan Wu, Jian-ning Liu, Zhen-gang Gong, Zheng-wei Hu","doi":"10.1109/ICSAI.2012.6223341","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223341","url":null,"abstract":"This paper gives the analysis of the feature of the medium voltage powerline communication in the view of reliability, investment and flexibility and the discussion of the necessity of routing automatically, compares the advantages and shortcomings of the bionic algorithms people research on a lot. It proposed an improved automatically dynamic routing algorithm for medium voltage powerline communication based on a project. The algorithm based on the communication optimality theory and non-overlapping clustering-based routing algorithm, combined with the corresponding communication protocol to achieve automatic network. Using the master and slave stations as network nodes, it decides logic layer according to the communication mode, creates the initial routing table, optimizes the communication quality, updates and sets reconstruction strategy. Simulation of the algorithm in Matlab and analysis of the communication quality and time-consuming are given. The simulation results show that the algorithm can achieve the automatically routing for medium voltage powerline carrier and improve the reliability and invulnerability of the network.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126668099","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223357
Fangkun Jia, En Cheng, Fei Yuan
With the characteristics of high ambient noise level, very narrow bandwidth, low carrier frequency, enormous propagation latency and time-space-frequency variant multipath effect, the stochastic ocean channel is very complex and difficult to achieve reliable UWA communications. The study of transmission characteristics is an important but weak link in underwear acoustic communication technology, so the study of underwater acoustic channel model has a very important practical significance. In this paper, based on conventional ray theory we have established N-path deterministic model, while taking advantage of BELLHOP, and introducing WSSUS channel model for shallow UWA channel transmission characteristics, and also have improved a shallow UWA time-variant channel model testing system performance. Comparing with the deterministic model, Simulation results show that the model is more intuitive and realistic.
{"title":"The study on time-variant characteristics of under water acoustic channels","authors":"Fangkun Jia, En Cheng, Fei Yuan","doi":"10.1109/ICSAI.2012.6223357","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223357","url":null,"abstract":"With the characteristics of high ambient noise level, very narrow bandwidth, low carrier frequency, enormous propagation latency and time-space-frequency variant multipath effect, the stochastic ocean channel is very complex and difficult to achieve reliable UWA communications. The study of transmission characteristics is an important but weak link in underwear acoustic communication technology, so the study of underwater acoustic channel model has a very important practical significance. In this paper, based on conventional ray theory we have established N-path deterministic model, while taking advantage of BELLHOP, and introducing WSSUS channel model for shallow UWA channel transmission characteristics, and also have improved a shallow UWA time-variant channel model testing system performance. Comparing with the deterministic model, Simulation results show that the model is more intuitive and realistic.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"510 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127041515","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223255
X. Hong, K. Huang, Qingwan Hu
Bifurcation of limit cycles of a perturbed integrable non-Hamiltonian system is investigated by using both qualitative analysis and numerical exploration. The investigation is based on detection functions which are particularly effective for the perturbed integrable non-Hamiltonian system. The study reveals that the system has 4 limit cycles. By using method of numerical simulation, the distributed orderliness of the 4 limit cycles is observed, and their nicety places are determined. The study also indicates that each of the 4 limit cycles passes the corresponding nicety point.
{"title":"Simulation analysis of limit cycles of a perturbed integrable non-Hamiltonian system","authors":"X. Hong, K. Huang, Qingwan Hu","doi":"10.1109/ICSAI.2012.6223255","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223255","url":null,"abstract":"Bifurcation of limit cycles of a perturbed integrable non-Hamiltonian system is investigated by using both qualitative analysis and numerical exploration. The investigation is based on detection functions which are particularly effective for the perturbed integrable non-Hamiltonian system. The study reveals that the system has 4 limit cycles. By using method of numerical simulation, the distributed orderliness of the 4 limit cycles is observed, and their nicety places are determined. The study also indicates that each of the 4 limit cycles passes the corresponding nicety point.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130593163","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223278
Yongbo Jiang, Ruili Zhang
The phenomenon of information overloading is increasingly severe with the development of e-commerce websites. It is an urgent issue that how to make users find information they need efficiently in the huge information space and at the same time make e-commerce enterprises enhance their websites' attraction and sales effectively. The personalized e-commerce recommendation system is an effective method to solve the above problem. The coordinated filtering technology is one of the techniques that are most often used in recommendation systems. But traditional recommendation techniques still have many limitations in practice, such as data sparseness, cold start-up and scalability. In this paper, we prompt a new mixed recommendation model based on the analysis of the traditional coordinated filtering. We combine the item-based coordinated filtering with the item similarity analysis which based on items' attributes to find their near neighbors. Then we try to find the user's near neighbors in the items near neighbors. At last, the target user's interest is predicted according to his near neighbors' interest to the target item to get the top-K recommendation.
{"title":"Personalized e-commerce system","authors":"Yongbo Jiang, Ruili Zhang","doi":"10.1109/ICSAI.2012.6223278","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223278","url":null,"abstract":"The phenomenon of information overloading is increasingly severe with the development of e-commerce websites. It is an urgent issue that how to make users find information they need efficiently in the huge information space and at the same time make e-commerce enterprises enhance their websites' attraction and sales effectively. The personalized e-commerce recommendation system is an effective method to solve the above problem. The coordinated filtering technology is one of the techniques that are most often used in recommendation systems. But traditional recommendation techniques still have many limitations in practice, such as data sparseness, cold start-up and scalability. In this paper, we prompt a new mixed recommendation model based on the analysis of the traditional coordinated filtering. We combine the item-based coordinated filtering with the item similarity analysis which based on items' attributes to find their near neighbors. Then we try to find the user's near neighbors in the items near neighbors. At last, the target user's interest is predicted according to his near neighbors' interest to the target item to get the top-K recommendation.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123957904","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223173
J. Choi, Hui-Gon Kim, S. Han, S. Hwang
We Propose a 2K/4K/8K point FFT (Fast Fourier Transform) for OFDM (Orthogonal Frequency Division Multiplexing) of DVB-H (Digital Video Broadcast Terrestrial) Receiver. The proposed FFT architecture utilizes cascaded radix-4 single path feedback (SDF) structure based on the Radix-2/Radix-4 FFT algorithm.[11] We use block floating point scaling technique in order to increase SQNR. The 2K/8K FFT consists of 5 cascaded stages of radix-4 and 3 stages of radix-2 butterfly units. The SQNR of 58dB is achieved with 10-bit data input, 14-bit internal data and twiddle factors, and 18-bit data output. The core has 75,804 gates with 204,672 bits of RAM and 33,572 bits of ROM using 0.18um CMOS technology.
{"title":"Variable 2K/4K/8K-point FFT/IFFT with compact memory for OFDM-based DVB-T system","authors":"J. Choi, Hui-Gon Kim, S. Han, S. Hwang","doi":"10.1109/ICSAI.2012.6223173","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223173","url":null,"abstract":"We Propose a 2K/4K/8K point FFT (Fast Fourier Transform) for OFDM (Orthogonal Frequency Division Multiplexing) of DVB-H (Digital Video Broadcast Terrestrial) Receiver. The proposed FFT architecture utilizes cascaded radix-4 single path feedback (SDF) structure based on the Radix-2/Radix-4 FFT algorithm.[11] We use block floating point scaling technique in order to increase SQNR. The 2K/8K FFT consists of 5 cascaded stages of radix-4 and 3 stages of radix-2 butterfly units. The SQNR of 58dB is achieved with 10-bit data input, 14-bit internal data and twiddle factors, and 18-bit data output. The core has 75,804 gates with 204,672 bits of RAM and 33,572 bits of ROM using 0.18um CMOS technology.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123606211","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 : 2012-05-19DOI: 10.1109/ICSAI.2012.6223183
Zhu Wang, De Wei
The existing RNs placement algorithms always ignore communication capacity and networks' energy consumption. So we introduce many constraint conditions into the existing RN placement model, such as irreversible factor in the forwarding communication paths and RN's communication capacity. And we present a new evaluation standard based on the minimum distance factor. A hybrid RNs placement algorithm was implemented in solutions, and it is based on enumeration and greedy optimization algorithm. The simulation results demonstrate our algorithm can conveniently limit RN's communication capacity. Compared with other algorithms, improvement of energy-efficiencies and practicality in our new algorithm is obvious.
{"title":"Constrained RN placement algorithm in two-tiered wireless sensor networks","authors":"Zhu Wang, De Wei","doi":"10.1109/ICSAI.2012.6223183","DOIUrl":"https://doi.org/10.1109/ICSAI.2012.6223183","url":null,"abstract":"The existing RNs placement algorithms always ignore communication capacity and networks' energy consumption. So we introduce many constraint conditions into the existing RN placement model, such as irreversible factor in the forwarding communication paths and RN's communication capacity. And we present a new evaluation standard based on the minimum distance factor. A hybrid RNs placement algorithm was implemented in solutions, and it is based on enumeration and greedy optimization algorithm. The simulation results demonstrate our algorithm can conveniently limit RN's communication capacity. Compared with other algorithms, improvement of energy-efficiencies and practicality in our new algorithm is obvious.","PeriodicalId":164945,"journal":{"name":"2012 International Conference on Systems and Informatics (ICSAI2012)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121217201","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
扫码关注我们
求助内容：
应助结果提醒方式：