International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications最新文献
Pub Date : 2013-01-01DOI: 10.1109/ICNC.2013.6818279
Chunfang Zhou, Lingling Luo
{"title":"The Proceedings of the 2013 9th International Conference on Natural Computation (ICNC)","authors":"Chunfang Zhou, Lingling Luo","doi":"10.1109/ICNC.2013.6818279","DOIUrl":"https://doi.org/10.1109/ICNC.2013.6818279","url":null,"abstract":"","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"20 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74740821","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 Mobile Ad hoc Network (MANET) is a wireless network that consists of mobile nodes without the aid of base stations. Many routing protocols have been proposed for MANETs so that the routing protocol is appropriately selected according to various network environments. Therefore, nodes in heterogeneous MANETs cannot communicate with each other. In this paper, we propose an autonomous clustering-based dynamic network gateway selection for heterogeneous MANETs.
{"title":"An Autonomous Clustering-Based Dynamic Network Gateway Selection for Heterogeneous MANETs","authors":"Keisei Okano, T. Ohta, Y. Kakuda","doi":"10.1109/ICNC.2012.64","DOIUrl":"https://doi.org/10.1109/ICNC.2012.64","url":null,"abstract":"A Mobile Ad hoc Network (MANET) is a wireless network that consists of mobile nodes without the aid of base stations. Many routing protocols have been proposed for MANETs so that the routing protocol is appropriately selected according to various network environments. Therefore, nodes in heterogeneous MANETs cannot communicate with each other. In this paper, we propose an autonomous clustering-based dynamic network gateway selection for heterogeneous MANETs.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"56 1","pages":"332-333"},"PeriodicalIF":0.0,"publicationDate":"2012-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79439794","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.6234760
Guoliang Gong, Huaxiang Lu
The performance of the current sensor in power equipment may become worse affected by the environment. In this paper, a phase difference measurement method based on FastICA is proposed to calibrate the phase difference of the current sensor on-line. However, not all source components are mutually independent in our application. Additionally, due to limitations of the algorithm, the phase errors of the separated results are different in different test runs. In order to get an exact result, we have proposed an evaluation index to choose an optimal result from different runs. The index is based on the relationship of mapping components to observed signals. Simulation results indicate that the method presented in this paper is effective and feasible.
{"title":"Application of FastICA in on-line calibration of the current sensor's phase difference","authors":"Guoliang Gong, Huaxiang Lu","doi":"10.1109/ICNC.2012.6234760","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234760","url":null,"abstract":"The performance of the current sensor in power equipment may become worse affected by the environment. In this paper, a phase difference measurement method based on FastICA is proposed to calibrate the phase difference of the current sensor on-line. However, not all source components are mutually independent in our application. Additionally, due to limitations of the algorithm, the phase errors of the separated results are different in different test runs. In order to get an exact result, we have proposed an evaluation index to choose an optimal result from different runs. The index is based on the relationship of mapping components to observed signals. Simulation results indicate that the method presented in this paper is effective and feasible.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"15 1","pages":"330-334"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75266299","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.6234653
Peng Guan, Yun Qian
In this paper, let X a non—empty compact metric place and S a semi-group. By topological transitivity and sensitive dependence on the initial, we introduces a concept of Devaney's chaos. We prove that topologically strong mixing implies Devaney's chaos when semi-group S continuously acts on the compact metric space X. At the same time, we popularize the concept of sensitive dependence on initial.
{"title":"Sensitive dependence on initial of chaotic semi-group actions","authors":"Peng Guan, Yun Qian","doi":"10.1109/ICNC.2012.6234653","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234653","url":null,"abstract":"In this paper, let X a non—empty compact metric place and S a semi-group. By topological transitivity and sensitive dependence on the initial, we introduces a concept of Devaney's chaos. We prove that topologically strong mixing implies Devaney's chaos when semi-group S continuously acts on the compact metric space X. At the same time, we popularize the concept of sensitive dependence on initial.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"81 1","pages":"950-952"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76913384","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.6234517
Jie Guo, Shengjing Tang, Qian Xu
An improved particle swarm optimization algorithm with dynamic population mechanism is introduced in this paper aiming at the optimal design of the maneuvering flight scheme of the unmanned aerial vehicle system which confronts complex nonlinear flight characteristics. The control law of the typical S maneuver in vertical plane is parameterized through spline method and the constraints are disposed by the penalty function method in a weighted objective function. A practical design example of the unmanned aerial vehicle maneuvering scheme is given at last, and the simulation results show the availability of the method proposed in this paper and also a good application prospects in the flight scheme optimal design of the unmanned aerial vehicles.
{"title":"An improved particle swarm optimization and its application in maneuvering control laws design of the unmanned aerial vehicle","authors":"Jie Guo, Shengjing Tang, Qian Xu","doi":"10.1109/ICNC.2012.6234517","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234517","url":null,"abstract":"An improved particle swarm optimization algorithm with dynamic population mechanism is introduced in this paper aiming at the optimal design of the maneuvering flight scheme of the unmanned aerial vehicle system which confronts complex nonlinear flight characteristics. The control law of the typical S maneuver in vertical plane is parameterized through spline method and the constraints are disposed by the penalty function method in a weighted objective function. A practical design example of the unmanned aerial vehicle maneuvering scheme is given at last, and the simulation results show the availability of the method proposed in this paper and also a good application prospects in the flight scheme optimal design of the unmanned aerial vehicles.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"72 1","pages":"1107-1111"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85843466","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.6234622
Lian-Ming Mou, X. Dai
The one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD) is a generalization of the one-commodity pickup-and-delivery traveling salesman problem (1-PDTSP) and has many interesting applications. The 1-TSP-SELPD is known to be an NP-hard. In this paper, to solve effectively the 1-TSP-SELPD, we extend the ant colony system method from TSP to 1-TSP-SELPD. Meanwhile, to improve the quality of solution, the constrained local searching and neighborhood searching technique are introduced into this method to accelerate the convergence according to the characteristic of the 1-TSP-SELPD, and a novel mutation technique is also introduced into this method to avoid falling into local minima. Experimental results gathered from extensive simulations confirm that our proposed method is significantly superior to the state-of-the-art methods.
{"title":"A novel ant colony system for solving the one-commodity traveling salesman problem with selective pickup and delivery","authors":"Lian-Ming Mou, X. Dai","doi":"10.1109/ICNC.2012.6234622","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234622","url":null,"abstract":"The one-commodity traveling salesman problem with selective pickup and delivery (1-TSP-SELPD) is a generalization of the one-commodity pickup-and-delivery traveling salesman problem (1-PDTSP) and has many interesting applications. The 1-TSP-SELPD is known to be an NP-hard. In this paper, to solve effectively the 1-TSP-SELPD, we extend the ant colony system method from TSP to 1-TSP-SELPD. Meanwhile, to improve the quality of solution, the constrained local searching and neighborhood searching technique are introduced into this method to accelerate the convergence according to the characteristic of the 1-TSP-SELPD, and a novel mutation technique is also introduced into this method to avoid falling into local minima. Experimental results gathered from extensive simulations confirm that our proposed method is significantly superior to the state-of-the-art methods.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"23 1","pages":"1096-1101"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82712396","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.6234690
Y. Cai, Xue-mei Ye, Hongqiao Wang, Qinggang Fan
Support vector machine(SVM) is a new approach for probability density estimation problems. But there are some shortcomings in the SVM based method, for example, the method can only optimize the model directly, and the slack factors must belong to the optimized range of solutions. On this basis, an improved SVM model named single slack factor SVM probability density estimation model is proposed in the paper. In this model, the scale of object function is reduced, so the computation efficient is greatly enhanced. The experiment results on uncoupled mixture probability density estimation show the effectiveness and feasibility of the model.
{"title":"Uncoupled mixture probability density estimation based on an improved support vector machine model","authors":"Y. Cai, Xue-mei Ye, Hongqiao Wang, Qinggang Fan","doi":"10.1109/ICNC.2012.6234690","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234690","url":null,"abstract":"Support vector machine(SVM) is a new approach for probability density estimation problems. But there are some shortcomings in the SVM based method, for example, the method can only optimize the model directly, and the slack factors must belong to the optimized range of solutions. On this basis, an improved SVM model named single slack factor SVM probability density estimation model is proposed in the paper. In this model, the scale of object function is reduced, so the computation efficient is greatly enhanced. The experiment results on uncoupled mixture probability density estimation show the effectiveness and feasibility of the model.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"11 1","pages":"126-129"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81992860","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.6234755
Yuanyuan Gan
A conceptually new approach to evaluating on life satisfaction of left-behind junior high school children using learning vector quantization neural network was proposed. The paper gives an introduction of learning vector quantization and discussed how this technique can be applied to evaluate on life satisfaction. The results indicated the following: Choosing the proper training samples, it is appropriate to evaluate on the left-behind children's life satisfaction by the LVQ neural network. According to the training samples' total scores of the six subscales and the corresponding grades information of their life satisfaction level, the life satisfaction grades of left-behind children were estimated accurately. For it is not necessary to evaluate their life satisfaction from six aspects such as school, school work, family, environment, friendship, and freedom in the process of estimating their total level of life satisfaction, the workload of evaluating on life satisfaction are sharp shorten. So the learning vector quantization neural network as an new approach evaluating on life satisfaction of left-behind junior high school children was effective, reliable, and with less labor and time.
{"title":"Evaluation on life satisfaction of left-behind junior high school children based on LVQ network","authors":"Yuanyuan Gan","doi":"10.1109/ICNC.2012.6234755","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234755","url":null,"abstract":"A conceptually new approach to evaluating on life satisfaction of left-behind junior high school children using learning vector quantization neural network was proposed. The paper gives an introduction of learning vector quantization and discussed how this technique can be applied to evaluate on life satisfaction. The results indicated the following: Choosing the proper training samples, it is appropriate to evaluate on the left-behind children's life satisfaction by the LVQ neural network. According to the training samples' total scores of the six subscales and the corresponding grades information of their life satisfaction level, the life satisfaction grades of left-behind children were estimated accurately. For it is not necessary to evaluate their life satisfaction from six aspects such as school, school work, family, environment, friendship, and freedom in the process of estimating their total level of life satisfaction, the workload of evaluating on life satisfaction are sharp shorten. So the learning vector quantization neural network as an new approach evaluating on life satisfaction of left-behind junior high school children was effective, reliable, and with less labor and time.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"24 1","pages":"405-408"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90758555","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.6234735
Qing Liu, Zhifeng Li
Driver fatigue is an important reason that leads to a vicious accident, it has important practical significance to evaluate the ship driver's fatigue and reduce accidents caused by driver fatigue. On the basis of a comprehensive analysis of the factors that influenced driving fatigue, the paper proposed an evaluation on ship driving fatigue which using driver eye's closure time, the beat frequency of sight line, pupil diameter size as 3 indicators, building the evaluation model based on BP artificial neural network. Finally, combining with the experiment based on eye tracker SMI iView X HED, it verifies and analyses the evaluation model. The paper provides a feasible method for the evaluation on ship driving fatigue.
驾驶员疲劳是导致恶性事故发生的重要原因，对船舶驾驶员疲劳进行评估，减少驾驶员疲劳造成的事故具有重要的现实意义。在综合分析驾驶员驾驶疲劳影响因素的基础上，提出了以驾驶员闭眼时间、视线跳动频率、瞳孔直径大小为3个指标的船舶驾驶疲劳评价方法，建立了基于BP人工神经网络的船舶驾驶疲劳评价模型。最后，结合基于眼动仪SMI iView X HED的实验，对评价模型进行了验证和分析。本文为船舶驾驶疲劳评价提供了一种可行的方法。
{"title":"Evaluation studies on ship driving fatigue based on BP artificial neural network","authors":"Qing Liu, Zhifeng Li","doi":"10.1109/ICNC.2012.6234735","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234735","url":null,"abstract":"Driver fatigue is an important reason that leads to a vicious accident, it has important practical significance to evaluate the ship driver's fatigue and reduce accidents caused by driver fatigue. On the basis of a comprehensive analysis of the factors that influenced driving fatigue, the paper proposed an evaluation on ship driving fatigue which using driver eye's closure time, the beat frequency of sight line, pupil diameter size as 3 indicators, building the evaluation model based on BP artificial neural network. Finally, combining with the experiment based on eye tracker SMI iView X HED, it verifies and analyses the evaluation model. The paper provides a feasible method for the evaluation on ship driving fatigue.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"1 1","pages":"217-221"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89852143","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.6234580
Qiong Huang, Pengfei Yin, Qianbin Chen
Load-balance is one of the most important problems in the multipath routing. To this point, this paper proposed a new bio-inspired adaptive multipath routing (BAMR) protocol based on a mathematic biology model ARAS, which is inspired by the host Escherichia coli cells to regulate its metabolic synthesis to keep the high cell growth rate. The BAMR take the routing decision to imitate the adaptive behavior of biological systems. Firstly, BAMR integrates the round trip delay and the available bandwidth of path for calculating a new bio-inspired routing-decision metric, i.e., the path fitness, which can be equivalently regarded as the growth rate of cell volume. Then the fitness of each path is applied to the ARAS model to calculate its packet delivery gain, respectively, which is equivalent to the concentration of each nutrient in the bacterial cell. Finally, the source node chooses the path with the highest packet delivery gain for each packet. Through the proposed routing protocol, the source node can efficiently distributes traffic among multiple paths, and allocates more traffic to a less loaded path within the path capacity.
{"title":"A bio-inspired adaptive end-to-end network multi-path routing to achieve load-balance","authors":"Qiong Huang, Pengfei Yin, Qianbin Chen","doi":"10.1109/ICNC.2012.6234580","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234580","url":null,"abstract":"Load-balance is one of the most important problems in the multipath routing. To this point, this paper proposed a new bio-inspired adaptive multipath routing (BAMR) protocol based on a mathematic biology model ARAS, which is inspired by the host Escherichia coli cells to regulate its metabolic synthesis to keep the high cell growth rate. The BAMR take the routing decision to imitate the adaptive behavior of biological systems. Firstly, BAMR integrates the round trip delay and the available bandwidth of path for calculating a new bio-inspired routing-decision metric, i.e., the path fitness, which can be equivalently regarded as the growth rate of cell volume. Then the fitness of each path is applied to the ARAS model to calculate its packet delivery gain, respectively, which is equivalent to the concentration of each nutrient in the bacterial cell. Finally, the source node chooses the path with the highest packet delivery gain for each packet. Through the proposed routing protocol, the source node can efficiently distributes traffic among multiple paths, and allocates more traffic to a less loaded path within the path capacity.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"40 1","pages":"976-980"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81705102","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
扫码关注我们
求助内容：
应助结果提醒方式：