Pub Date : 2010-12-03DOI: 10.1109/ICISS.2010.5657062
Hong Yuehua, Xu Shuang, Wu Huajian
Aiming at the severe energy and computing resource constraints of Wireless Sensor Network (WSN), based on rough set theory and ART2 network, a distributed data mining model for WSN is proposed. This model poses a three-layer MLP for data aggregation in the clustered sensor network. And the input layer neuron and the first layer neuron are located in every cluster member, while the second layer neuron and the output layer neuron are located in every cluster head. The features of the training samples were extracted to build up the decision table; the rough set theory was applied to reduce the decision table. Finally, the reduced decision attributes were used to construct ART2 neural network classification data. Constructed data mining algorithm can be integrated in each sensor network node. Simulation results prove data dimension is reduced and data redundancy is eliminated after the raw-data is processed by data mining algorithm, and the communication traffic is decreased and the life of WSN is extended.
{"title":"Study on distributed data mining model in Wireless Sensor Networks","authors":"Hong Yuehua, Xu Shuang, Wu Huajian","doi":"10.1109/ICISS.2010.5657062","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5657062","url":null,"abstract":"Aiming at the severe energy and computing resource constraints of Wireless Sensor Network (WSN), based on rough set theory and ART2 network, a distributed data mining model for WSN is proposed. This model poses a three-layer MLP for data aggregation in the clustered sensor network. And the input layer neuron and the first layer neuron are located in every cluster member, while the second layer neuron and the output layer neuron are located in every cluster head. The features of the training samples were extracted to build up the decision table; the rough set theory was applied to reduce the decision table. Finally, the reduced decision attributes were used to construct ART2 neural network classification data. Constructed data mining algorithm can be integrated in each sensor network node. Simulation results prove data dimension is reduced and data redundancy is eliminated after the raw-data is processed by data mining algorithm, and the communication traffic is decreased and the life of WSN is extended.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116984740","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5657100
Zhiyun Zhang
This article based on the basic situation of college students' current performance management and elective guidance, introduce the knowledge of data mining, and select the association rules mining algorithm using in the analysis of students failed courses. Find the Associated factors affecting students achievement factors, and provide decision support information for educators. So promote to carry out the intervention scientifically, and improve education quality and the scientific level of University Students work.
{"title":"Study and analysis of data mining technology in college courses students failed","authors":"Zhiyun Zhang","doi":"10.1109/ICISS.2010.5657100","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5657100","url":null,"abstract":"This article based on the basic situation of college students' current performance management and elective guidance, introduce the knowledge of data mining, and select the association rules mining algorithm using in the analysis of students failed courses. Find the Associated factors affecting students achievement factors, and provide decision support information for educators. So promote to carry out the intervention scientifically, and improve education quality and the scientific level of University Students work.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127184724","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5656735
Huan Zhang, Ruhua Cai
In order to realize the scrambling aim of combination of pixels position substitution and the pixels values change, and moreover, in order to make up this deficiency which the low security of image encryption using one-dimensional chaotic system to encrypt digital image, a digital image encryption algorithm based on bit plane scrambling and multiple chaotic systems combination is proposed. Firstly, we generate integer sequence which as parameters and iteration times of general Arnold map to shuffle the positions of each bit-plane pixels by using 4D hyper-chaotic system. Then we generate random integer vectors to shuffle the positions of the rows and columns for each bit-plane image by using two dimensional Logistic map. Finally, the scrambled gray image is reconstructed from those shuffled bit-plane images. The experiment results demonstrate that the proposed image encryption algorithm has the advantages of large key space and very sensitivity with respect to the secret key and original image. The encryption system possesses perfect confusion properties and it can resist the various attacks. It shows that the proposed scheme is of high security.
{"title":"Image encryption algorithm based on bit-plane scrambling and multiple chaotic systems combination","authors":"Huan Zhang, Ruhua Cai","doi":"10.1109/ICISS.2010.5656735","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5656735","url":null,"abstract":"In order to realize the scrambling aim of combination of pixels position substitution and the pixels values change, and moreover, in order to make up this deficiency which the low security of image encryption using one-dimensional chaotic system to encrypt digital image, a digital image encryption algorithm based on bit plane scrambling and multiple chaotic systems combination is proposed. Firstly, we generate integer sequence which as parameters and iteration times of general Arnold map to shuffle the positions of each bit-plane pixels by using 4D hyper-chaotic system. Then we generate random integer vectors to shuffle the positions of the rows and columns for each bit-plane image by using two dimensional Logistic map. Finally, the scrambled gray image is reconstructed from those shuffled bit-plane images. The experiment results demonstrate that the proposed image encryption algorithm has the advantages of large key space and very sensitivity with respect to the secret key and original image. The encryption system possesses perfect confusion properties and it can resist the various attacks. It shows that the proposed scheme is of high security.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116573079","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5655004
Yong-qiang Liang, Xiao-shu Zhu, Miao Xie
In order to ensure every feasible assembly sequence is included in the searching space of genetic algorithm, this paper proposes an improved genetic encoding method. In this method, every chromosome is encoded by a permutation of integer. Although the final form of chromosome is the same as the existing form, the decoding process is different. In our decoding process, every permutation of integer is transformed into an ordered set of all edges in the stability-directed graph, and then the ordered set of edges is transform into an ordered set of assembly states. The correctness of this method is proved, the combination of this method and the existing genetic algorithm is discussed, and an example is presented to show the effectiveness of our encoding method.
{"title":"Improved chromosome encoding for genetic-algorithm-based assembly sequence planning","authors":"Yong-qiang Liang, Xiao-shu Zhu, Miao Xie","doi":"10.1109/ICISS.2010.5655004","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5655004","url":null,"abstract":"In order to ensure every feasible assembly sequence is included in the searching space of genetic algorithm, this paper proposes an improved genetic encoding method. In this method, every chromosome is encoded by a permutation of integer. Although the final form of chromosome is the same as the existing form, the decoding process is different. In our decoding process, every permutation of integer is transformed into an ordered set of all edges in the stability-directed graph, and then the ordered set of edges is transform into an ordered set of assembly states. The correctness of this method is proved, the combination of this method and the existing genetic algorithm is discussed, and an example is presented to show the effectiveness of our encoding method.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"808 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114582126","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5657031
Rui Wang, Ting-lei Huang, Z. Liao, Guo-ning Gan
With regard to the research on MANET mobile model and routing protocol issues, according to the behaviors of community mobile nodes, a community wireless mobile model based on AOC. Autonomous system was established by making use of AOC-by-prototyping combining with trial-and-Error process. This paper does simulation experiment through NS-2 simulation platform, showing that in this model DSR and AODV routing protocols are relatively stable in the aspect of routing overhead; however in the window size DSR routing protocol is the best.
{"title":"Wireless mobile community model based on AOC","authors":"Rui Wang, Ting-lei Huang, Z. Liao, Guo-ning Gan","doi":"10.1109/ICISS.2010.5657031","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5657031","url":null,"abstract":"With regard to the research on MANET mobile model and routing protocol issues, according to the behaviors of community mobile nodes, a community wireless mobile model based on AOC. Autonomous system was established by making use of AOC-by-prototyping combining with trial-and-Error process. This paper does simulation experiment through NS-2 simulation platform, showing that in this model DSR and AODV routing protocols are relatively stable in the aspect of routing overhead; however in the window size DSR routing protocol is the best.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116997503","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5656076
Zhou Qing-hua, Zhang Yu-xian, Y. Ping, Xia Ji-jun
Today, the common expression of the bending moment equation is an expression of piecewise function, which causes heavy work in its theoretic research. The bending moment equation is often used when the bend of girder is being studied. Under the action of the concentrative loads, the expression of piecewise function of the equation of bending moment can be expressed with a monolithic equation by unit-step function, and then the calculative workload will be simplified when bend distortion is solved. And at the same time it also has a certain theoretic value.
{"title":"The Analysis about the unit-step function of the bending moment equation of girder","authors":"Zhou Qing-hua, Zhang Yu-xian, Y. Ping, Xia Ji-jun","doi":"10.1109/ICISS.2010.5656076","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5656076","url":null,"abstract":"Today, the common expression of the bending moment equation is an expression of piecewise function, which causes heavy work in its theoretic research. The bending moment equation is often used when the bend of girder is being studied. Under the action of the concentrative loads, the expression of piecewise function of the equation of bending moment can be expressed with a monolithic equation by unit-step function, and then the calculative workload will be simplified when bend distortion is solved. And at the same time it also has a certain theoretic value.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128478710","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5655323
Shaoying Liu
Development of a dependable software requires a variety of techniques to be used in a coherent and systematic process, since it is required to take the reliability, safety, and security of the system into account. In this paper, we describe a framework for developing dependable software systems using the SOFL formal engineering method, and demonstrate its applicability by a case study developing and ATM system using the framework
{"title":"A framework for developing dependable software systems using the SOFL formal engineering method","authors":"Shaoying Liu","doi":"10.1109/ICISS.2010.5655323","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5655323","url":null,"abstract":"Development of a dependable software requires a variety of techniques to be used in a coherent and systematic process, since it is required to take the reliability, safety, and security of the system into account. In this paper, we describe a framework for developing dependable software systems using the SOFL formal engineering method, and demonstrate its applicability by a case study developing and ATM system using the framework","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128616786","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5656043
Huihua Yang, Fengchai Wang
A novel multi-objective optimization method to ensuring the inter-batch quality uniformity by blending different batches of Traditional Chinese Medicine (TCM) herbs or natural products is presented. Multiple objectives are often preferred by users; however they cannot be attained in a single objective optimization problem. To conquering this drawback, evaluation function is introduced to incorporate multiples objectives so that a new single objective is only needed to be solved. As a demonstration, 10 batches of Radix isatidis with 5 indicative components are used to set a multiobjective optimization problem achieving the goal of the lowest cost and the best quality simultaneously, and results show that an efficient solution can be obtained.
{"title":"Application of multiobjective optimization to the blending of Traditional Chinese Medicine herbs","authors":"Huihua Yang, Fengchai Wang","doi":"10.1109/ICISS.2010.5656043","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5656043","url":null,"abstract":"A novel multi-objective optimization method to ensuring the inter-batch quality uniformity by blending different batches of Traditional Chinese Medicine (TCM) herbs or natural products is presented. Multiple objectives are often preferred by users; however they cannot be attained in a single objective optimization problem. To conquering this drawback, evaluation function is introduced to incorporate multiples objectives so that a new single objective is only needed to be solved. As a demonstration, 10 batches of Radix isatidis with 5 indicative components are used to set a multiobjective optimization problem achieving the goal of the lowest cost and the best quality simultaneously, and results show that an efficient solution can be obtained.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129156028","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5656846
Wang Dong, T. Shijie, Lv Yuanchang
In order to achieve two 3D face mesh automatic transform, two 3D face with different topological structures are regarded as two point sets and then an automatic mesh transform method based on point matching is proposed. Firstly iterative closest point is used to align two 3D face vertex sets, then the TPS(thin-plate spline) and deterministic annealing algorithm can be used for point registration to implement automatic mesh transform, at last Kriging interpolation is applied to enhance similarity between resulted mesh and source mesh. In the end, we implement the system in VC++6.0 and OpenGL environments, and transform the default face mesh to a realistic image in Second Life using the system we established.
{"title":"An automatic 3D face mesh transform based on point matching and its application","authors":"Wang Dong, T. Shijie, Lv Yuanchang","doi":"10.1109/ICISS.2010.5656846","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5656846","url":null,"abstract":"In order to achieve two 3D face mesh automatic transform, two 3D face with different topological structures are regarded as two point sets and then an automatic mesh transform method based on point matching is proposed. Firstly iterative closest point is used to align two 3D face vertex sets, then the TPS(thin-plate spline) and deterministic annealing algorithm can be used for point registration to implement automatic mesh transform, at last Kriging interpolation is applied to enhance similarity between resulted mesh and source mesh. In the end, we implement the system in VC++6.0 and OpenGL environments, and transform the default face mesh to a realistic image in Second Life using the system we established.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130669577","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 : 2010-12-03DOI: 10.1109/ICISS.2010.5656040
Wang Huiyong, Wang Jikui, T. Shijie
Dealing with multi-attribute decision making (MADM) problems, the comprehensive weighted model is a simple tool. But how to determine weights is a critical problem in this method. In this paper, beginning with a discussion of the term “weight”, we discuss present variable weighting methods. Then we propose an idea of denoting weights by a fuzzy set as well as a corresponding weight aggregate model. Finally, we prove the effectiveness of the model by a numerical experiment.
{"title":"Variable weights in MADM","authors":"Wang Huiyong, Wang Jikui, T. Shijie","doi":"10.1109/ICISS.2010.5656040","DOIUrl":"https://doi.org/10.1109/ICISS.2010.5656040","url":null,"abstract":"Dealing with multi-attribute decision making (MADM) problems, the comprehensive weighted model is a simple tool. But how to determine weights is a critical problem in this method. In this paper, beginning with a discussion of the term “weight”, we discuss present variable weighting methods. Then we propose an idea of denoting weights by a fuzzy set as well as a corresponding weight aggregate model. Finally, we prove the effectiveness of the model by a numerical experiment.","PeriodicalId":356702,"journal":{"name":"2010 International Conference on Intelligent Computing and Integrated Systems","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123801422","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
扫码关注我们
求助内容：
应助结果提醒方式：