International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications最新文献
Pub Date : 2012-05-29DOI: 10.1109/ICNC.2012.6234666
Xianmin Ma, J. Liu
A novel fault diagnosis method for 10KV rural electrical power grids based on Petri net theory is proposed in the paper. The structure of the 10KV rural power system network is built, the fault reasons are analyzed, the fault diagnosis models are established using the Petri net matrix analysis method, the decision-making strategies based on Petri net theory are presented for different fault types in order to ensure the stability of power grids and avoid accidents expanding. The feasibility using the Petri net theory in 10kv rural distribution power system for fault diagnosis is demonstrated with the practice case.
{"title":"Application of petri net theory in fault diagnosis for rural electrical grid","authors":"Xianmin Ma, J. Liu","doi":"10.1109/ICNC.2012.6234666","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234666","url":null,"abstract":"A novel fault diagnosis method for 10KV rural electrical power grids based on Petri net theory is proposed in the paper. The structure of the 10KV rural power system network is built, the fault reasons are analyzed, the fault diagnosis models are established using the Petri net matrix analysis method, the decision-making strategies based on Petri net theory are presented for different fault types in order to ensure the stability of power grids and avoid accidents expanding. The feasibility using the Petri net theory in 10kv rural distribution power system for fault diagnosis is demonstrated with the practice case.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"20 4 1","pages":"1161-1165"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78035317","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-29DOI: 10.1109/ICNC.2012.6234631
Yuehua Wu, Y. Wen, Li Wang
Emergence describes the macroscopic dynamic phenomena of complex systems with mutual effects of local members on each other. At present, emergent mechanism needs to be further studied, and types of researched emergence computation model are limited. The study method of well-known Swarm model also lacks of generality. A different emergent model which is improved from Aihara chaotic neural network is proposed in this paper to give the diversity of the current emergent model. Firstly, considering the features of emergent model and based on characteristics of Aihara chaotic neural network, the connection mechanism of cellular automata is introduced to the chaotic neural networks to improve it. By comparing with existing network model, there is an obvious emergency for the interaction rules and forms in our new model. Then, by calculating dynamic index of the model emergency of the model is verified. Finally, the emergence and chaos characteristics of improved model are proved via emergence analysis methods.
{"title":"An improved Aihara chaotic neural network and its dynamic characteristics","authors":"Yuehua Wu, Y. Wen, Li Wang","doi":"10.1109/ICNC.2012.6234631","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234631","url":null,"abstract":"Emergence describes the macroscopic dynamic phenomena of complex systems with mutual effects of local members on each other. At present, emergent mechanism needs to be further studied, and types of researched emergence computation model are limited. The study method of well-known Swarm model also lacks of generality. A different emergent model which is improved from Aihara chaotic neural network is proposed in this paper to give the diversity of the current emergent model. Firstly, considering the features of emergent model and based on characteristics of Aihara chaotic neural network, the connection mechanism of cellular automata is introduced to the chaotic neural networks to improve it. By comparing with existing network model, there is an obvious emergency for the interaction rules and forms in our new model. Then, by calculating dynamic index of the model emergency of the model is verified. Finally, the emergence and chaos characteristics of improved model are proved via emergence analysis methods.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"33 1","pages":"914-918"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78108824","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-01DOI: 10.1109/ICNC.2012.6234599
Haixia Li, Junling Li
This paper proposes the Split Common Fixed Point problem, this type of problem requires finding a type of operator's Common Fixed Point in space, meanwhile, and the image of the Fixed Point under the Linear Transformation is also the Common Fixed Point of another type of operator's image in space. This paper also provides the solution to solve the split common fixed point problem by using the directed operators.
{"title":"By using the directed operators to find a solution to the Split Common Fixed Point problem","authors":"Haixia Li, Junling Li","doi":"10.1109/ICNC.2012.6234599","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234599","url":null,"abstract":"This paper proposes the Split Common Fixed Point problem, this type of problem requires finding a type of operator's Common Fixed Point in space, meanwhile, and the image of the Fixed Point under the Linear Transformation is also the Common Fixed Point of another type of operator's image in space. This paper also provides the solution to solve the split common fixed point problem by using the directed operators.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"69 1","pages":"1031-1034"},"PeriodicalIF":0.0,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICNC.2012.6234599","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72530809","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-01DOI: 10.1109/ICNC.2012.6234523
Shuhua Su, Shuhua Yuan
In order to investigate the relationship of prospective monitory(the accuracy of judgment of learning as an indicator), retrospective monitory (the judgment of confidence as an indicator)and memory performance, we selected 85 senior high school students that are investigated through RJR paradigm and materials (meaningful and meaningless associated Chinese word-pairs). The results show that: (1) Memory performance is moderately related to the accuracy of judgment of learning (JOL) and judgment of confidence (JOC) (r=0.557, p<;0.01; r=0.595, p<;0.01);(2) The accuracy of judgment of learning and judgment of confidence have significant positive prediction of memory performance. Conclusion:There is closed relationships between σσmetamemory monitory and memory performance.
{"title":"A study of the relationship among prospective monitory, retrospective monitory and memory performance","authors":"Shuhua Su, Shuhua Yuan","doi":"10.1109/ICNC.2012.6234523","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234523","url":null,"abstract":"In order to investigate the relationship of prospective monitory(the accuracy of judgment of learning as an indicator), retrospective monitory (the judgment of confidence as an indicator)and memory performance, we selected 85 senior high school students that are investigated through RJR paradigm and materials (meaningful and meaningless associated Chinese word-pairs). The results show that: (1) Memory performance is moderately related to the accuracy of judgment of learning (JOL) and judgment of confidence (JOC) (r=0.557, p<;0.01; r=0.595, p<;0.01);(2) The accuracy of judgment of learning and judgment of confidence have significant positive prediction of memory performance. Conclusion:There is closed relationships between σσmetamemory monitory and memory performance.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"41 1","pages":"550-552"},"PeriodicalIF":0.0,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81268710","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-01DOI: 10.1109/ICNC.2012.6234637
M. Wang, Xinlai Tang
This paper proposes a special Chinese automatic summarization method based on Concept-Obtained and Hybrid Parallel Genetic Algorithm. The idea of our approach is to obtain concepts of words using HowNet as tool, and use concepts as feature, not words. We construct conceptual vector space model and use Hybrid Parallel Genetic Algorithm to form summary of documents. The automatic evaluation of document's summaries with n-gram score shows the system's effectiveness and feasibility.
{"title":"Extract summarization using Concept-Obtained and Hybrid Parallel Genetic Algorithm","authors":"M. Wang, Xinlai Tang","doi":"10.1109/ICNC.2012.6234637","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234637","url":null,"abstract":"This paper proposes a special Chinese automatic summarization method based on Concept-Obtained and Hybrid Parallel Genetic Algorithm. The idea of our approach is to obtain concepts of words using HowNet as tool, and use concepts as feature, not words. We construct conceptual vector space model and use Hybrid Parallel Genetic Algorithm to form summary of documents. The automatic evaluation of document's summaries with n-gram score shows the system's effectiveness and feasibility.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"31 1","pages":"662-664"},"PeriodicalIF":0.0,"publicationDate":"2012-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74170194","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-03-12DOI: 10.1109/ICCNC.2012.6167514
Hugo E. T. Carvalho, N. Fernandes, O. Duarte, G. Pujolle
In this paper we propose SLAPv, an efficient control system for service level agreements (SLAs) in virtual network environments. SLAPv fills a gap in the design of SLA enforcers by introducing the following set of control features: (i) verification of physical resource usage, (ii) retrieval of real-time profiles of virtual routers, and (iii) enforcement of the adequate usage of resources. Furthermore, SLAPv punishes virtual networks that do not respect their contracts. The control relies on fuzzy logic to enforce resource allocation according to usage profile of routers and the system load. The punishment depends on the exceeding violating value, and on the system load. Results obtained from a developed prototype show the efficiency of the proposed system under different conditions and strategic policies. Tests performed with RIPv2 running on virtual networks show that, for high load scenarios, misbehaving routers are forced to rapidly enter in conformity to their SLAs in less than five seconds.
{"title":"SLAPv: A service level agreement enforcer for virtual networks","authors":"Hugo E. T. Carvalho, N. Fernandes, O. Duarte, G. Pujolle","doi":"10.1109/ICCNC.2012.6167514","DOIUrl":"https://doi.org/10.1109/ICCNC.2012.6167514","url":null,"abstract":"In this paper we propose SLAPv, an efficient control system for service level agreements (SLAs) in virtual network environments. SLAPv fills a gap in the design of SLA enforcers by introducing the following set of control features: (i) verification of physical resource usage, (ii) retrieval of real-time profiles of virtual routers, and (iii) enforcement of the adequate usage of resources. Furthermore, SLAPv punishes virtual networks that do not respect their contracts. The control relies on fuzzy logic to enforce resource allocation according to usage profile of routers and the system load. The punishment depends on the exceeding violating value, and on the system load. Results obtained from a developed prototype show the efficiency of the proposed system under different conditions and strategic policies. Tests performed with RIPv2 running on virtual networks show that, for high load scenarios, misbehaving routers are forced to rapidly enter in conformity to their SLAs in less than five seconds.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"71 1","pages":"708-712"},"PeriodicalIF":0.0,"publicationDate":"2012-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80419843","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 : 2011-09-19DOI: 10.1109/ICNC.2011.6022350
Kun Yuan, Wenjie Jia, Han Zhang, Tao Wang
In this paper, several basic models of complex networks be studied, and I improve the BA scale-free network model. According to the characteristics of transmission of the virus in real network, I take some experiments, and get the experimental data. According to experimental results, I put forward a specific containment strategy, and do the simulations. Find that this containment strategy plays a very good deterrent in the early spread of the virus.
{"title":"Study about the computer virus dissemination model based on complex network","authors":"Kun Yuan, Wenjie Jia, Han Zhang, Tao Wang","doi":"10.1109/ICNC.2011.6022350","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022350","url":null,"abstract":"In this paper, several basic models of complex networks be studied, and I improve the BA scale-free network model. According to the characteristics of transmission of the virus in real network, I take some experiments, and get the experimental data. According to experimental results, I put forward a specific containment strategy, and do the simulations. Find that this containment strategy plays a very good deterrent in the early spread of the virus.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"5 1","pages":"1570-1573"},"PeriodicalIF":0.0,"publicationDate":"2011-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81587169","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 : 2011-07-26DOI: 10.1109/ICNC.2011.6022185
Zhou Shenpei, W. Chaozhong
A new recognition method for driver's intention is proposed in this study. Genetic algorithm (GA) has strong adaptability, robustness and quick global searching ability. It has such disadvantages as premature convergence, low convergence speed and so on. Ant colony optimization (ACO) converges on the optimization path through pheromone accumulation and renewal. It has the ability of parallel processing and global searching and the characteristic of positive feedback. But the convergence speed of ACO is lower at the beginning for there is only little pheromone difference on the path at that time. The hybrid algorithm of genetic algorithm and ant colony optimization adopts genetic algorithm to give pheromone to distribute. And then it makes use of ant colony optimization to give the precision of the solution. It develops enough advantage of the two algorithms. The comparative analysis on optimal performance is made by using the Camel function. Finally, the method is used for the optimized the decision tree of driver's intention recognition. The experimental result shows that the recognition method and the hybrid algorithm are feasible and effective.
{"title":"A recognition method for driver's intention based on genetic algorithm and ant colony optimization","authors":"Zhou Shenpei, W. Chaozhong","doi":"10.1109/ICNC.2011.6022185","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022185","url":null,"abstract":"A new recognition method for driver's intention is proposed in this study. Genetic algorithm (GA) has strong adaptability, robustness and quick global searching ability. It has such disadvantages as premature convergence, low convergence speed and so on. Ant colony optimization (ACO) converges on the optimization path through pheromone accumulation and renewal. It has the ability of parallel processing and global searching and the characteristic of positive feedback. But the convergence speed of ACO is lower at the beginning for there is only little pheromone difference on the path at that time. The hybrid algorithm of genetic algorithm and ant colony optimization adopts genetic algorithm to give pheromone to distribute. And then it makes use of ant colony optimization to give the precision of the solution. It develops enough advantage of the two algorithms. The comparative analysis on optimal performance is made by using the Camel function. Finally, the method is used for the optimized the decision tree of driver's intention recognition. The experimental result shows that the recognition method and the hybrid algorithm are feasible and effective.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"26 1","pages":"1033-1037"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74446656","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 : 2011-07-26DOI: 10.1109/ICNC.2011.6022504
R. Xiao, Tinggui Chen
Project management is a complex decision making process involving the unrelenting pressures of time and cost. Firstly, the paper points out that multi-mode resource constrained multi-project scheduling problem(MRCMPSP) is one of typical multimodal optimization problems through analyzing its characteristics. The algorithm used to solving this problem should have powerful global and local searching abilities. Secondly, problem description conceptual model is presented. Then, enhancing artificial bee colony (ABC) optimization with artificial immune network algorithm (ai-Net) used to solve MRCMPSP is proposed. Finally, a numerical experiment derived from the project generator ProGen is given to test its performances. The results show the improved ABC proposed in this paper is superior to other algorithms.
{"title":"Enhancing ABC Optimization with Ai-Net Algorithm for solving project scheduling problem","authors":"R. Xiao, Tinggui Chen","doi":"10.1109/ICNC.2011.6022504","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022504","url":null,"abstract":"Project management is a complex decision making process involving the unrelenting pressures of time and cost. Firstly, the paper points out that multi-mode resource constrained multi-project scheduling problem(MRCMPSP) is one of typical multimodal optimization problems through analyzing its characteristics. The algorithm used to solving this problem should have powerful global and local searching abilities. Secondly, problem description conceptual model is presented. Then, enhancing artificial bee colony (ABC) optimization with artificial immune network algorithm (ai-Net) used to solve MRCMPSP is proposed. Finally, a numerical experiment derived from the project generator ProGen is given to test its performances. The results show the improved ABC proposed in this paper is superior to other algorithms.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"12 1","pages":"1284-1288"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74816178","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 : 2011-07-26DOI: 10.1109/ICNC.2011.6022312
Ma Chongxiao, Wang Jin-jia, Zhou Li-na
The Magnetoencephalography (MEG) can be used as a control signal for brain computer (BCI), which contains the pattern information of the hand movement direction. In the MEG signal classification, the feature extraction based on signal processing and linear classification are usually used. The recognition rate has been difficult to improve. The principal component analysis (PCA) and linear discriminant analysis (LDA) method has been proposed for the feature extraction, and the non-linear nearest neighbor classification is introduced for the classifier. Based on the analysis of the confusion matrix, a data-dependent kernel optimization also studied for the nonlinear nearest neighbor classifier, which effect is better than the non-linear nearest neighbor classifier. The experimental results show that the PCA + LDA method is effective in the analysis of multi-channel MEG signals, and improve the recognition rate. The average recognition rate is better than the recognition rate in the BCI competition IV.
{"title":"The nonlinear classification methods in MEG-based brain computer interface","authors":"Ma Chongxiao, Wang Jin-jia, Zhou Li-na","doi":"10.1109/ICNC.2011.6022312","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022312","url":null,"abstract":"The Magnetoencephalography (MEG) can be used as a control signal for brain computer (BCI), which contains the pattern information of the hand movement direction. In the MEG signal classification, the feature extraction based on signal processing and linear classification are usually used. The recognition rate has been difficult to improve. The principal component analysis (PCA) and linear discriminant analysis (LDA) method has been proposed for the feature extraction, and the non-linear nearest neighbor classification is introduced for the classifier. Based on the analysis of the confusion matrix, a data-dependent kernel optimization also studied for the nonlinear nearest neighbor classifier, which effect is better than the non-linear nearest neighbor classifier. The experimental results show that the PCA + LDA method is effective in the analysis of multi-channel MEG signals, and improve the recognition rate. The average recognition rate is better than the recognition rate in the BCI competition IV.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"513 1","pages":"1696-1699"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77849277","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}
International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：