Chen Xuemei, Gao Li, Wang Xi, Wei Zhonghua, Z. Zhenhua, Liao Zhigao
The traditional K-Means algorithm is sensitive to outliers, outliers traction and easy off-center, and overlap of classes can not very well show their classification. This paper introduces a variant of the probability distribution theory, K-Means clustering algorithm - Gaussian mixture model to part of the customer data randomly selected of Volkswagen dealer in a Beijing office in 2008, for example, and carry out empirical study based on the improved clustering algorithm model. The results showed that: data mining clustering algorithm in active demand management and market segmentation has important significance.
{"title":"The Research on the Data Mining Technology in the Active Demand Management","authors":"Chen Xuemei, Gao Li, Wang Xi, Wei Zhonghua, Z. Zhenhua, Liao Zhigao","doi":"10.1109/ICICIS.2011.125","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.125","url":null,"abstract":"The traditional K-Means algorithm is sensitive to outliers, outliers traction and easy off-center, and overlap of classes can not very well show their classification. This paper introduces a variant of the probability distribution theory, K-Means clustering algorithm - Gaussian mixture model to part of the customer data randomly selected of Volkswagen dealer in a Beijing office in 2008, for example, and carry out empirical study based on the improved clustering algorithm model. The results showed that: data mining clustering algorithm in active demand management and market segmentation has important significance.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116309945","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}
Indexing is a fundamental technique used by the administrator to reduce the cost of processing complex queries defined on a data warehouse. However, selecting a suitable configuration of indexes is a difficult problem to solve. The problem is classified as NP-hard. Automatic index selection has received significant attention in the databases field. Most works have focused on providing tools and algorithms to help data bases administrators in the choice of a configuration of indexes. Some of these works have been adapted for the data warehouse context. The idea, recently introduced, of using data mining techniques to resolve this problem remains a promising approach. In this paper, we propose a maximal frequent pattern based approach to generate a configuration of indexes from a given workload. The proposed approach was tested on APB-1 benchmark under Oracle. The results obtained show that the proposed approach generates indexes that improve the performance of the workload.
{"title":"Improving Star Join Queries Performance: A Maximal Frequent Pattern Based Approach for Automatic Selection of Indexes in Relational Data Warehouses","authors":"B. Ziani, Y. Ouinten","doi":"10.1109/ICICIS.2011.36","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.36","url":null,"abstract":"Indexing is a fundamental technique used by the administrator to reduce the cost of processing complex queries defined on a data warehouse. However, selecting a suitable configuration of indexes is a difficult problem to solve. The problem is classified as NP-hard. Automatic index selection has received significant attention in the databases field. Most works have focused on providing tools and algorithms to help data bases administrators in the choice of a configuration of indexes. Some of these works have been adapted for the data warehouse context. The idea, recently introduced, of using data mining techniques to resolve this problem remains a promising approach. In this paper, we propose a maximal frequent pattern based approach to generate a configuration of indexes from a given workload. The proposed approach was tested on APB-1 benchmark under Oracle. The results obtained show that the proposed approach generates indexes that improve the performance of the workload.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121288831","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}
In view of the artificial neural network weights training problem, this paper proposed a method to optimize the network's structure parameters and regularization coefficient using two-layer Particle Swarm Optimization (PSO). This algorithm was applied to train Adaline network. Compared with fixed regularization coefficient method and Sliding Mode Variable Structure optimization method, the result showed that it had the advantages of high precision and strong ability of generalization.
{"title":"Neural Network Research Using Particle Swarm Optimization","authors":"Yahui Wang, Zhifeng Xia, Yifeng Huo","doi":"10.1109/ICICIS.2011.106","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.106","url":null,"abstract":"In view of the artificial neural network weights training problem, this paper proposed a method to optimize the network's structure parameters and regularization coefficient using two-layer Particle Swarm Optimization (PSO). This algorithm was applied to train Adaline network. Compared with fixed regularization coefficient method and Sliding Mode Variable Structure optimization method, the result showed that it had the advantages of high precision and strong ability of generalization.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124074688","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 algorithm applied to video watermark based on HVS is rare recently , but adaptively selecting the embedding position and the embedding strength according to the host(such as videos, images etc.) is necessary, which can make robustness and invisibility best balanced. This article gives a new algorithm about digital video watermarking based on HVS, which makes digital video watermark greatly improved.
{"title":"A New Digital Video Watermark Algorithm Based on the HVS","authors":"Lufang Liao, Xiaoshi Zheng, Yanling Zhao, G. Liu","doi":"10.1109/ICICIS.2011.116","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.116","url":null,"abstract":"The algorithm applied to video watermark based on HVS is rare recently , but adaptively selecting the embedding position and the embedding strength according to the host(such as videos, images etc.) is necessary, which can make robustness and invisibility best balanced. This article gives a new algorithm about digital video watermarking based on HVS, which makes digital video watermark greatly improved.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"308 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124286625","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}
In this paper, a new method for estimating multivariate density functions is proposed based on Support Vector Machine (SVM) technique and copulas. It is well-known that the SVM method can result in a sparse and accurate estimate of a density function, however, the knowledge of marginal densities of a multivariate density are not employed directly although they may be known in some applications such as multi-sensor systems. Benefitted from Sklar's theorem, in which a joint distribution function is characterized by its margins through a copula, the proposed approach can incorporate efficiently the knowledge of the margins and dependence structure of random samples into density estimation so that more accurate estimates are obtained. Some numerical examples are given to demonstrate that our approach can result in more accurate estimates than both direct SVM method and multivariate kernel density method based on copulas.
{"title":"Support Vector Machine Method for Multivariate Density Estimation Based on Copulas","authors":"Xiaoqin Shan, Jie Zhou, Feng Xiao","doi":"10.1109/ICICIS.2011.41","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.41","url":null,"abstract":"In this paper, a new method for estimating multivariate density functions is proposed based on Support Vector Machine (SVM) technique and copulas. It is well-known that the SVM method can result in a sparse and accurate estimate of a density function, however, the knowledge of marginal densities of a multivariate density are not employed directly although they may be known in some applications such as multi-sensor systems. Benefitted from Sklar's theorem, in which a joint distribution function is characterized by its margins through a copula, the proposed approach can incorporate efficiently the knowledge of the margins and dependence structure of random samples into density estimation so that more accurate estimates are obtained. Some numerical examples are given to demonstrate that our approach can result in more accurate estimates than both direct SVM method and multivariate kernel density method based on copulas.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125426726","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}
Mathematical model of the attitude control system of Flapping Wing Micro Aerial Vehicle(FWMAV) is presented, and a novel multi-variable Active Disturbance Rejection Control(ADRC) scheme is proposed. The design of attitude controller is challenging owing to the complex flight process. The heavy difficulty is that the system embodies uncertainties, nonlinearities, coupled multi-variableness, and all kinds of disturbances(such as gust). Because ADRC does not depend on the accurate mathematical model of plant, the disturbances and uncertainties are taken as one state matrix vector to design Extended State Observe (ESO) and nonlinear PD (proportional derivative)controller. The controlled attitude angles can reach the desired results simultaneously if the relevant parameters are tuned harmoniously. Simulation results are presented to verify the effectiveness of the proposed method.
{"title":"Attitude Control of Flapping-wing Micro Aerial Vehicle Based on Active Disturbance Rejection Control","authors":"Hongjun Duan, Qingwei Li","doi":"10.1109/ICICIS.2011.103","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.103","url":null,"abstract":"Mathematical model of the attitude control system of Flapping Wing Micro Aerial Vehicle(FWMAV) is presented, and a novel multi-variable Active Disturbance Rejection Control(ADRC) scheme is proposed. The design of attitude controller is challenging owing to the complex flight process. The heavy difficulty is that the system embodies uncertainties, nonlinearities, coupled multi-variableness, and all kinds of disturbances(such as gust). Because ADRC does not depend on the accurate mathematical model of plant, the disturbances and uncertainties are taken as one state matrix vector to design Extended State Observe (ESO) and nonlinear PD (proportional derivative)controller. The controlled attitude angles can reach the desired results simultaneously if the relevant parameters are tuned harmoniously. Simulation results are presented to verify the effectiveness of the proposed method.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128230961","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}
Prediction of library borrowing flow plays an important role in controlling the quality of book collection and cataloging work in library. Traditional time series prediction methods are hard to model the library borrowing flow because it is a nonlinear dynamical process and has nonstationary and stochastic character. Based on support vector machine and the theory of chaotic time series prediction, a new method is proposed to model and predict the library borrowing flow. The experiments show this method is reasonable to solve the nonlinear problem in library borrowing flow and is of certain value in both theory and practice.
{"title":"Application of Chaotic Time Series Prediction in Forecasting of Library Borrowing Flow","authors":"Mei Tian","doi":"10.1109/ICICIS.2011.147","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.147","url":null,"abstract":"Prediction of library borrowing flow plays an important role in controlling the quality of book collection and cataloging work in library. Traditional time series prediction methods are hard to model the library borrowing flow because it is a nonlinear dynamical process and has nonstationary and stochastic character. Based on support vector machine and the theory of chaotic time series prediction, a new method is proposed to model and predict the library borrowing flow. The experiments show this method is reasonable to solve the nonlinear problem in library borrowing flow and is of certain value in both theory and practice.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125465446","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}
Wang et al. [6] proposed a scheme of allowing granter nodes to allocate multiple mini-slots to improve the data scheduling efficiency of the three-way handshake procedure, however, the size of the availability mini-slots is no considered. In fact, the available mini-slot space may not be contiguous but can include many windows of several slots in the actual data scheduling. To address this problem, we propose a novel data scheduling scheme, which is based on our proposed optimal model of mini-slots allocation, to reduce the number of mini-slot segments and to keep continuous mini-slots as long as possible. Simulation results show that our proposed scheduling schemes can achieve low transmission delay of data packets and high utilization ratio of mini-slots of all network nodes.
{"title":"Coordinated Distributed Data Scheduling Scheme in IEEE 802.16 Mesh Networks","authors":"Limin Peng, Suyun Sun","doi":"10.1109/ICICIS.2011.101","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.101","url":null,"abstract":"Wang et al. [6] proposed a scheme of allowing granter nodes to allocate multiple mini-slots to improve the data scheduling efficiency of the three-way handshake procedure, however, the size of the availability mini-slots is no considered. In fact, the available mini-slot space may not be contiguous but can include many windows of several slots in the actual data scheduling. To address this problem, we propose a novel data scheduling scheme, which is based on our proposed optimal model of mini-slots allocation, to reduce the number of mini-slot segments and to keep continuous mini-slots as long as possible. Simulation results show that our proposed scheduling schemes can achieve low transmission delay of data packets and high utilization ratio of mini-slots of all network nodes.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126390942","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}
In this paper, a kind of Birkhoff type 2-Periodic trigonometric and Para trigonometric interpolation problems with equidistant nodes for 2Ĉ -periodic and antiperiodic functions are discussed. We give the necessary and sufficient conditions for the solvable case of these interpolation problems. The expressions of the interpolation basis are constructed.
{"title":"On a Kind of Birkhoff Type 2-Periodic Trigonometric and Paratrigonometric Interpolation","authors":"Jin Guoxiang, Zhang Li, Ding Yong","doi":"10.1109/ICICIS.2011.97","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.97","url":null,"abstract":"In this paper, a kind of Birkhoff type 2-Periodic trigonometric and Para trigonometric interpolation problems with equidistant nodes for 2Ĉ -periodic and antiperiodic functions are discussed. We give the necessary and sufficient conditions for the solvable case of these interpolation problems. The expressions of the interpolation basis are constructed.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127532376","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}
A new wavelength detection technology about fiber Bragg grating(FBG) is reported, which is combined with the wavelet analysis. It can be used in wavelength multiplexing techniques, which can increased the degree of automatic calculation and the objectivity. By using this method, the spectrum of light wave is obtained better, thus, the influence of the side lobe voltage is solved by this method in wave processing, also the calculation speed is improved. The results of the experiments show that reflective signature is reconstructed preferable, and in addition, the influence on of the real peak detection which is caused by the side lobe voltage is wiped off.
{"title":"Fiber Bragg Grating Peak Wavelength Detection Technique Based on Wavelet Analysis","authors":"Wu Zhaoxia, Yu Haili","doi":"10.1109/ICICIS.2011.121","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.121","url":null,"abstract":"A new wavelength detection technology about fiber Bragg grating(FBG) is reported, which is combined with the wavelet analysis. It can be used in wavelength multiplexing techniques, which can increased the degree of automatic calculation and the objectivity. By using this method, the spectrum of light wave is obtained better, thus, the influence of the side lobe voltage is solved by this method in wave processing, also the calculation speed is improved. The results of the experiments show that reflective signature is reconstructed preferable, and in addition, the influence on of the real peak detection which is caused by the side lobe voltage is wiped off.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129494291","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
扫码关注我们
求助内容：
应助结果提醒方式：