Intrusion detection system (IDS) is based on data mining technology in this paper. Association rule mining which is a method of data mining will make the boundaries of intervals hard. It will increase the information loss. In this paper, a novel framework based on data mining techniques is proposed for designing IDS. In this framework, the classification engine, which is actually the core of the IDS, uses fuzzy association rules for building classifiers. Particularly, the fuzzy association rule sets are exploited as descriptive models of different classes. Generally, the proposed approach outperforms other methods, especially in terms of false positive rate.
{"title":"Application of Fuzzy Association Rules in Intrusion Detection","authors":"Kaixing Wu, Juan Hao, Chunhua Wang","doi":"10.1109/ICICIS.2011.72","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.72","url":null,"abstract":"Intrusion detection system (IDS) is based on data mining technology in this paper. Association rule mining which is a method of data mining will make the boundaries of intervals hard. It will increase the information loss. In this paper, a novel framework based on data mining techniques is proposed for designing IDS. In this framework, the classification engine, which is actually the core of the IDS, uses fuzzy association rules for building classifiers. Particularly, the fuzzy association rule sets are exploited as descriptive models of different classes. Generally, the proposed approach outperforms other methods, especially in terms of false positive rate.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"15 6 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":"130611313","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}
One method of obtaining the Taylor Series Expansion Coefficients, which are suitable for engineering application, are presented: Artificial neural network(ANN) , by virtue of its high nonlinear and learning abilities. The Taylor Series ( TS ) can be represented as a standard 3-layers feed-forward neural network after transforming in which the weights are correspond to the Taylor Coefficients. Therefore, the Taylor Coefficients can be determined by using Back Propagation (BP) algorithm. In the methods, we only need the sample space of the original function. So the method have the value of application in industries.
{"title":"An Engineering Solution to Taylor Series Expansion Coefficients Based on BP Neural Network","authors":"Zhongzhong Hu, Helei Wu, Shuyun Zhu","doi":"10.1109/ICICIS.2011.128","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.128","url":null,"abstract":"One method of obtaining the Taylor Series Expansion Coefficients, which are suitable for engineering application, are presented: Artificial neural network(ANN) , by virtue of its high nonlinear and learning abilities. The Taylor Series ( TS ) can be represented as a standard 3-layers feed-forward neural network after transforming in which the weights are correspond to the Taylor Coefficients. Therefore, the Taylor Coefficients can be determined by using Back Propagation (BP) algorithm. In the methods, we only need the sample space of the original function. So the method have the value of application in industries.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"145 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":"121397498","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}
Server virtualization technology is the core of the dynamic resource scheduling, also is an effective solution of disaster recovery. Currently, the number of spreading servers in the data room is ever-increasing, data were heavily concentrated, the load on the server can not be understood, and can not b adjusted, it is difficult to make full use of server resources. This article from the perspective of server virtualization to discuss the dynamic allocaton of server CPU, memory, hard drives and other resources based on application load. As virtualized servers can be activated, and can be restarted within a limited time to create an important server, virtualization server in a short time has quickly become one of the more cost-effective solutions of disaster recovery management capabilities.
{"title":"Application of Server Virtualization Technology in Enterprise Information","authors":"Xianmin Wei","doi":"10.1109/ICICIS.2011.13","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.13","url":null,"abstract":"Server virtualization technology is the core of the dynamic resource scheduling, also is an effective solution of disaster recovery. Currently, the number of spreading servers in the data room is ever-increasing, data were heavily concentrated, the load on the server can not be understood, and can not b adjusted, it is difficult to make full use of server resources. This article from the perspective of server virtualization to discuss the dynamic allocaton of server CPU, memory, hard drives and other resources based on application load. As virtualized servers can be activated, and can be restarted within a limited time to create an important server, virtualization server in a short time has quickly become one of the more cost-effective solutions of disaster recovery management capabilities.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"22 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":"115945649","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, we propose a forecasting model of electric power equipment statement assembled by core vector machines and particle swarm algorithm to improve the accuracy of electric equipment maintenance. The electric power equipment condition forecasting model improves parameter selection problems of nuclear vector regression by particle swarm algorithm, optimizes parameters of kernel function and reduces the artificial factors in the forecasting process, accordingly reduces the blindness in the process of training and improves the accuracy of the prediction, while core vector regression have the advantages of high precision, suitable for power equipment maintenance process.
{"title":"Application of Core Vector Regression in Condition-Based Maintenance for Electric Power Equipments","authors":"Junhua Qu, Wenjuan Wang, Chao Wei","doi":"10.1109/ICICIS.2011.141","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.141","url":null,"abstract":"In this paper, we propose a forecasting model of electric power equipment statement assembled by core vector machines and particle swarm algorithm to improve the accuracy of electric equipment maintenance. The electric power equipment condition forecasting model improves parameter selection problems of nuclear vector regression by particle swarm algorithm, optimizes parameters of kernel function and reduces the artificial factors in the forecasting process, accordingly reduces the blindness in the process of training and improves the accuracy of the prediction, while core vector regression have the advantages of high precision, suitable for power equipment maintenance process.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"207 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":"121246318","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}
According to the requirement of "Educational Technology Competency Standards for Teachers", teaching staff should master the basic skills of the methods of common instructional media selection and development. The skills are common teaching priorities of "Modern Educational Technology" course. This thesis, using the web quest template to design the teaching contents of" Instructional Media Selection and Development", combined with the characteristics of professional and future career of students. This study has certain reference value on teaching design under the information technology environment and training normal school students' educational technology capacity.
{"title":"Instructional Design on \"Selection of Instructional Media\" Based on Webquest","authors":"Cui Jian, Xu Lei, W. Feng","doi":"10.1109/ICICIS.2011.146","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.146","url":null,"abstract":"According to the requirement of \"Educational Technology Competency Standards for Teachers\", teaching staff should master the basic skills of the methods of common instructional media selection and development. The skills are common teaching priorities of \"Modern Educational Technology\" course. This thesis, using the web quest template to design the teaching contents of\" Instructional Media Selection and Development\", combined with the characteristics of professional and future career of students. This study has certain reference value on teaching design under the information technology environment and training normal school students' educational technology capacity.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"14 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":"122585192","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}
currently, the World Wide Web is a medium for storing and sharing data. Search based on keyword matching and content classified are two methods of the traditional search, however, their performance of processing exponential growth data is unsatisfactory. The concept of the Semantic Web, which was proposed to solve the shortage of network intelligence in 2001, provided the feasibility solutions of retrieving. The Semantic Web application could become a reality since XML (Extensible Markup Language), RDF (Resource Description Framework) and OWL (Web Ontology Language) are improved and the emergence of Jena which is the Semantic Web [1] development tools. So the concept of semantic retrieval with Semantic Web technology and search engine technology comes up, we aim to propose a system Architecture based on Semantic Web.
{"title":"Research on a Retrieval System Based on Semantic Web","authors":"Junhua Qu, Chao Wei, Wenjuan Wang, Fei Liu","doi":"10.1109/ICICIS.2011.142","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.142","url":null,"abstract":"currently, the World Wide Web is a medium for storing and sharing data. Search based on keyword matching and content classified are two methods of the traditional search, however, their performance of processing exponential growth data is unsatisfactory. The concept of the Semantic Web, which was proposed to solve the shortage of network intelligence in 2001, provided the feasibility solutions of retrieving. The Semantic Web application could become a reality since XML (Extensible Markup Language), RDF (Resource Description Framework) and OWL (Web Ontology Language) are improved and the emergence of Jena which is the Semantic Web [1] development tools. So the concept of semantic retrieval with Semantic Web technology and search engine technology comes up, we aim to propose a system Architecture based on Semantic Web.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"59 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":"122668183","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}
Evolutionary algorithms (EAs) are a type of complex systems which mimic biological evolution in nature to solve real world problems. In this paper, we propose to use complex networks theory to characterize the topological properties of evolutionary algorithms (EAs). A case study on Guo's algorithm is given as an example to show how to use our method. In our method, we represent the evolutionary process of Guo's algorithm as a directed network, directed evolutionary algorithm network (DEAN). Many aspects of DEAN are analyzed, such as degree distribution, average path length, assortativity coefficient, and clustering coefficient. Our results imply that DEAN is a small-world and scare-free type network. Our results give great insight into the underlining regularities in EAs.
{"title":"Characterizing Evolutionary Algorithm Using Complex Networks Theory: A Case Study","authors":"Yan Liu, Yi Zeng","doi":"10.1109/ICICIS.2011.129","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.129","url":null,"abstract":"Evolutionary algorithms (EAs) are a type of complex systems which mimic biological evolution in nature to solve real world problems. In this paper, we propose to use complex networks theory to characterize the topological properties of evolutionary algorithms (EAs). A case study on Guo's algorithm is given as an example to show how to use our method. In our method, we represent the evolutionary process of Guo's algorithm as a directed network, directed evolutionary algorithm network (DEAN). Many aspects of DEAN are analyzed, such as degree distribution, average path length, assortativity coefficient, and clustering coefficient. Our results imply that DEAN is a small-world and scare-free type network. Our results give great insight into the underlining regularities in EAs.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"6 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":"126106002","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}
With the development of modern education, and considering the shortcoming of current online exam system, a new projection of online exam system based on data mining is given, and the key implementation techniques and methods are also described.
{"title":"Design and Implementation of Online Exam System Based on Data Mining","authors":"Huiping Wang, Ruowu Zhong","doi":"10.1109/ICICIS.2011.59","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.59","url":null,"abstract":"With the development of modern education, and considering the shortcoming of current online exam system, a new projection of online exam system based on data mining is given, and the key implementation techniques and methods are also described.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"71 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":"127334628","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, we provide a method of constructing pairing-friendly elliptic curves on which the optimal pairing can be defined and the resulting curves have small ¦Ñ value approximate to 1. Our algorithm is explicit and works for arbitrary embedding degree k and large prime subgroup order r.
{"title":"Constructing Pairing-friendly Elliptic Curves with Small rho","authors":"Mingqiang Wang, Cai Jie","doi":"10.1109/ICICIS.2011.56","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.56","url":null,"abstract":"In this paper, we provide a method of constructing pairing-friendly elliptic curves on which the optimal pairing can be defined and the resulting curves have small ¦Ñ value approximate to 1. Our algorithm is explicit and works for arbitrary embedding degree k and large prime subgroup order r.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"32 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":"125750342","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}
This paper is concerned with weighted pseudo almost auto orphic functions, which is associated with the optimal control problem of distributed parameter system, especially in the nonlinear evolution equation. Applying the Banach fixed point theorem, we prove some existence results for weighted pseudo almost automorphic mild solution to a class of integro differential equations in Banach space.
{"title":"Weighted Pseudo Almost Automorphic Solution to a Class of Integrodifferential Equations","authors":"Chou-li Lu, Xiaoqiu Song, Li-li Zhou","doi":"10.1109/ICICIS.2011.42","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.42","url":null,"abstract":"This paper is concerned with weighted pseudo almost auto orphic functions, which is associated with the optimal control problem of distributed parameter system, especially in the nonlinear evolution equation. Applying the Banach fixed point theorem, we prove some existence results for weighted pseudo almost automorphic mild solution to a class of integro differential equations in Banach space.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"32 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":"117067802","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
扫码关注我们
求助内容：
应助结果提醒方式：