Experiments of the bioelectricity in four species of standing trees in Beijing Forestry University have been carried out. According to the experiments, no correlation between bioelectricity and electrode position on the trunk was found. Clear correlation between bioelectricity and tree species was found. Based on the experimental results, a circuit for harvesting bioelectricity has been proposed. The testing results and feasibility analysis showed that 0.387 J bioelectricity energy from 20 outputs of bioelectricity of a ginkgo tree in parallel could be stored in a lithium battery during 3.8 hours, except the energy consumption of energy harvesting circuit and sensor node. The results showed that it is feasible to harvest bioelectricity of standing trees for powering the sensor nodes in forests.
{"title":"Research on Characteristics and Harvesting Circuit of Standing Tree Bioelectricity","authors":"Fengyuan Yin, Wenbin Li","doi":"10.12733/JICS20105666","DOIUrl":"https://doi.org/10.12733/JICS20105666","url":null,"abstract":"Experiments of the bioelectricity in four species of standing trees in Beijing Forestry University have been carried out. According to the experiments, no correlation between bioelectricity and electrode position on the trunk was found. Clear correlation between bioelectricity and tree species was found. Based on the experimental results, a circuit for harvesting bioelectricity has been proposed. The testing results and feasibility analysis showed that 0.387 J bioelectricity energy from 20 outputs of bioelectricity of a ginkgo tree in parallel could be stored in a lithium battery during 3.8 hours, except the energy consumption of energy harvesting circuit and sensor node. The results showed that it is feasible to harvest bioelectricity of standing trees for powering the sensor nodes in forests.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"316 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132878720","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}
For the problem of sub-region division about regional tra‐c in urban tra‐c network. This paper uses fuzzy control theory to solve the problem, and deflnes adjacent intersections coordination coe‐cient to indicates the degree of association of adjacent intersections, the coe‐cient considers flve factors, they are the intersection distance, signal cycle, tra‐c ∞ow, tra‐c ∞ow impact factor and the queue length. The paper elaborated the in∞uence degree of each in∞uence factor and calculating method. In the end selects the tra‐c network to simulation, and makes intersection average delay time as evaluation index, then uses the adaptive genetic algorithm sub-region agent to control the sub-region, to demonstrate the efiectiveness of the division method.
{"title":"Research on Sub-region Division of Regional Traffic by Fuzzy Theory","authors":"Jie Cao, Ling Zhang","doi":"10.12733/JICS20105728","DOIUrl":"https://doi.org/10.12733/JICS20105728","url":null,"abstract":"For the problem of sub-region division about regional tra‐c in urban tra‐c network. This paper uses fuzzy control theory to solve the problem, and deflnes adjacent intersections coordination coe‐cient to indicates the degree of association of adjacent intersections, the coe‐cient considers flve factors, they are the intersection distance, signal cycle, tra‐c ∞ow, tra‐c ∞ow impact factor and the queue length. The paper elaborated the in∞uence degree of each in∞uence factor and calculating method. In the end selects the tra‐c network to simulation, and makes intersection average delay time as evaluation index, then uses the adaptive genetic algorithm sub-region agent to control the sub-region, to demonstrate the efiectiveness of the division method.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130898918","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}
Regional coverage reconnaissance is a signiflcant means of obtaining the important targets in the region and a prerequisite for the precision strike. The research status of LAVs (Loitering Air Vehicles) regional coverage is analyzed in his paper, and the detector model is built which is applicable to LAV. By analyzing the difierent ways how circular target region should be divided, a conclusion is obtained that the total distance is shortest and the total turning number is least in the parallel split manner; according to the indicators requirements of turning radius and reconnaissance radius, LAV turning method is appropriately given; the objective function of this problem is established and the constraints are determined correspondingly, then this problem had been optimized with MOPSOA (Multi-object Particle Swarm Optimization Algorithm); the obtained path plan after optimization is ideal.
{"title":"Research on Regional Coverage with LAVs Based on MOPSOA","authors":"Yehong Du, Bing Li, Jie Li","doi":"10.12733/JICS20105763","DOIUrl":"https://doi.org/10.12733/JICS20105763","url":null,"abstract":"Regional coverage reconnaissance is a signiflcant means of obtaining the important targets in the region and a prerequisite for the precision strike. The research status of LAVs (Loitering Air Vehicles) regional coverage is analyzed in his paper, and the detector model is built which is applicable to LAV. By analyzing the difierent ways how circular target region should be divided, a conclusion is obtained that the total distance is shortest and the total turning number is least in the parallel split manner; according to the indicators requirements of turning radius and reconnaissance radius, LAV turning method is appropriately given; the objective function of this problem is established and the constraints are determined correspondingly, then this problem had been optimized with MOPSOA (Multi-object Particle Swarm Optimization Algorithm); the obtained path plan after optimization is ideal.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126634699","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, an batch mode active learning algorithm combining with the beneflts of self-training for solving the multiclass Brain-computer Interface (BCI) problem, which initially only needs a small set of labeled samples to train classiflers. The algorithm applied active learning to select the most informative samples and self-training to select the most high confldence samples, respectively, according to the proposed novel uncertainty criterion and confldence criterion for boosting the performance of the classifler. Experiments on the Dataset 2a of the BCI Competition IV, which demonstrate our method achieves more improvement than Active Learning (AL) and Random Sampling (RS) when the same amount of human efiort is sacriflced.
{"title":"Batch Mode Active Learning Algorithm Combining with Self-training for Multiclass Brain-computer Interfaces ?","authors":"Min-You Chen, Xuemin Tan","doi":"10.12733/JICS20105675","DOIUrl":"https://doi.org/10.12733/JICS20105675","url":null,"abstract":"In this paper, an batch mode active learning algorithm combining with the beneflts of self-training for solving the multiclass Brain-computer Interface (BCI) problem, which initially only needs a small set of labeled samples to train classiflers. The algorithm applied active learning to select the most informative samples and self-training to select the most high confldence samples, respectively, according to the proposed novel uncertainty criterion and confldence criterion for boosting the performance of the classifler. Experiments on the Dataset 2a of the BCI Competition IV, which demonstrate our method achieves more improvement than Active Learning (AL) and Random Sampling (RS) when the same amount of human efiort is sacriflced.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134407658","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}
Hole-fllling is a common problem in 3D laser-scanner technology. To solve this problem, we propose an advanced MLS based triangulation algorithm to detect and flll holes, achieving better efiect on curve with uneven curvature. Experimental results demonstrate that our method performs quite well in matching to the original objects.
{"title":"An Improved Hole-filling Technology Based on MLS","authors":"Jun Chen, Zhengyang Luo, Chengying Gao","doi":"10.12733/JICS20105471","DOIUrl":"https://doi.org/10.12733/JICS20105471","url":null,"abstract":"Hole-fllling is a common problem in 3D laser-scanner technology. To solve this problem, we propose an advanced MLS based triangulation algorithm to detect and flll holes, achieving better efiect on curve with uneven curvature. Experimental results demonstrate that our method performs quite well in matching to the original objects.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114795756","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}
Lingxiao Ma, Yi Li, Hancong Tang, Weilai Chi, Depeng Dang
With the enlarging volumes of datasets in various areas and the rapid development of distributed technologies, parallel clustering is becoming increasingly important. To cluster large-scale data of various shapes, this paper proposes a parallel Chameleon clustering algorithm. The key idea is using a parallel minimum spanning tree algorithm to generate the initial clusters after obtaining the k-nearest neighbor graph of the original dataset in a parallel way inspired by matrix multiplication, and then using strategies suggested by the primary Chameleon clustering to combine clusters and obtain the final clusters. Finally, we design the parallel Chameleon clustering based on MapReduce. Experiments show that this algorithm is efficient and well-performed.
{"title":"Parallel Chameleon Clustering Based on MapReduce","authors":"Lingxiao Ma, Yi Li, Hancong Tang, Weilai Chi, Depeng Dang","doi":"10.12733/JICS20105661","DOIUrl":"https://doi.org/10.12733/JICS20105661","url":null,"abstract":"With the enlarging volumes of datasets in various areas and the rapid development of distributed technologies, parallel clustering is becoming increasingly important. To cluster large-scale data of various shapes, this paper proposes a parallel Chameleon clustering algorithm. The key idea is using a parallel minimum spanning tree algorithm to generate the initial clusters after obtaining the k-nearest neighbor graph of the original dataset in a parallel way inspired by matrix multiplication, and then using strategies suggested by the primary Chameleon clustering to combine clusters and obtain the final clusters. Finally, we design the parallel Chameleon clustering based on MapReduce. Experiments show that this algorithm is efficient and well-performed.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117006696","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}
Y. Xi, K. Cheng, Xiao Tao, Lou Xitong, Lei Cheng, Yanjuan Hu
Based on the analysis of structural parameters, the flow field of reverse blowing pickup mouth was calculated with CFD. The dust collection efficiency was validated with gas-solid phrase flow. The results show that the diameter of outlet or the dip angle increases respectively when iD1B ≤ 0:45 or ≤ 110 ◦ . Airflow velocities of four narrow slots (front, rear, left and right) increase; With the sweeper-traveling speed increasing overall removal efficiency and grade efficiency decrease. Especially for grade efficiency, sweeper-traveling speed has great effects on large size particles, while it has slight effects on small size particles under the same operating conditions.
{"title":"Parametric Design of Reverse Blowing Pickup Mouth Based on Flow Simulation","authors":"Y. Xi, K. Cheng, Xiao Tao, Lou Xitong, Lei Cheng, Yanjuan Hu","doi":"10.12733/JICS20105653","DOIUrl":"https://doi.org/10.12733/JICS20105653","url":null,"abstract":"Based on the analysis of structural parameters, the flow field of reverse blowing pickup mouth was calculated with CFD. The dust collection efficiency was validated with gas-solid phrase flow. The results show that the diameter of outlet or the dip angle increases respectively when iD1B ≤ 0:45 or ≤ 110 ◦ . Airflow velocities of four narrow slots (front, rear, left and right) increase; With the sweeper-traveling speed increasing overall removal efficiency and grade efficiency decrease. Especially for grade efficiency, sweeper-traveling speed has great effects on large size particles, while it has slight effects on small size particles under the same operating conditions.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132699159","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}
Similarity measure in Chinese short text is an important prerequisite for many content-based texts or documents retrieval tasks. In this paper, we propose a fast method for representing Chinese short texts to calculate the similarity between texts. The method is based on the representation of Chinese words. First, Chinese word representation is learned by a deep neural network with local context embedding and global context. Then, the words in short text are replaced by the learned representations of Chinese words and the short text is represented by dynamic average-weighted function depending on target text. Next, the cosine similarity method is used for the similarity measurement between texts. Last, experiment shows the semantic by visualizing the result of Chinese word representation learning and the experiment on similarity measure demonstrates the effectiveness of our short text representation method.
{"title":"Similarity Measures for Chinese Short Text Based on Representation Learning","authors":"Yan Li, Xu-Cheng Yin, Yinghua Zhang, Hongwei Hao","doi":"10.12733/JICS20105746","DOIUrl":"https://doi.org/10.12733/JICS20105746","url":null,"abstract":"Similarity measure in Chinese short text is an important prerequisite for many content-based texts or documents retrieval tasks. In this paper, we propose a fast method for representing Chinese short texts to calculate the similarity between texts. The method is based on the representation of Chinese words. First, Chinese word representation is learned by a deep neural network with local context embedding and global context. Then, the words in short text are replaced by the learned representations of Chinese words and the short text is represented by dynamic average-weighted function depending on target text. Next, the cosine similarity method is used for the similarity measurement between texts. Last, experiment shows the semantic by visualizing the result of Chinese word representation learning and the experiment on similarity measure demonstrates the effectiveness of our short text representation method.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128199452","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}
Xiaojian You, Xiaohai He, Xuemei Han, Chun Wu, Hong Jiang
To improve the adaptive parameter adjustment function of the cognitive radio, a novel cognitive radio decision engine based on chaotic quantum bee colony optimized algorithm is proposed. First, the population was initialized by quantum coding and logistic mapping. Then, fast quantum rotation angle adjusting strategy, based on social cognitive, was used to conduct the neighborhood search of employed bees and onlooker bees. Finally, the new solution was generated by chaotic disturbing the solution that has reached the limit times of cycles. According to the simulated experiments under a multi-carrier system, the results indicate that the novel engine show a much better convergence and e‐ciency than the one based on quantum genetic algorithm or binary artiflcial bee colony algorithm, and the results of parameters reconflguration is consistent with user demands.
{"title":"A Novel Cognitive Radio Decision Engine Based on Chaotic Quantum Bee Colony Algorithm","authors":"Xiaojian You, Xiaohai He, Xuemei Han, Chun Wu, Hong Jiang","doi":"10.12733/JICS20105768","DOIUrl":"https://doi.org/10.12733/JICS20105768","url":null,"abstract":"To improve the adaptive parameter adjustment function of the cognitive radio, a novel cognitive radio decision engine based on chaotic quantum bee colony optimized algorithm is proposed. First, the population was initialized by quantum coding and logistic mapping. Then, fast quantum rotation angle adjusting strategy, based on social cognitive, was used to conduct the neighborhood search of employed bees and onlooker bees. Finally, the new solution was generated by chaotic disturbing the solution that has reached the limit times of cycles. According to the simulated experiments under a multi-carrier system, the results indicate that the novel engine show a much better convergence and e‐ciency than the one based on quantum genetic algorithm or binary artiflcial bee colony algorithm, and the results of parameters reconflguration is consistent with user demands.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114429462","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}
DV-Hop is a range-free localization algorithm widely applied in wireless sensor network. Wormhole attack is one of the most serious attacks on DV-Hop. Previous solutions are mainly based on location leash and time leash which need hardware support, while the rest of the mechanisms without hardware support often require a higher ratio of beacon nodes and very complex operations. In this paper, we have analyzed the impact of the wormhole attack on the DV-Hop location algorithm. When the DV-Hop is invaded by the wormhole attack, the probability of the wormhole attack tunnel to be the shortest path is the biggest of all. Then we put forward the PDWA wormhole attack detection algorithm based on the Unique Preorder Node (UPN). It analyses the number of UPN and relationship through the statistics, detects the wormhole attack nodes without hardware support, and its computational complexity is also not high. The simulation results show that our proposed location scheme can fully detect the wormhole attacker. The obtained positioning accuracy is almost the same as the DV-Hop without a wormhole attack. What’s more, after it is applied to the improved MHDV-Hop algorithm, we also achieved a perfect effect. So the results fully show that our proposed scheme can resist the influence of the wormhole attack on DV-Hop.
{"title":"Unique-preorder-node Based DV-Hop Localization against Wormhole Attack for Wireless Sensor Networks","authors":"Jiu-hu Zheng, Huan-yan Qian, Jiguang Chen, Jiang-Hu Xu","doi":"10.12733/JICS20105716","DOIUrl":"https://doi.org/10.12733/JICS20105716","url":null,"abstract":"DV-Hop is a range-free localization algorithm widely applied in wireless sensor network. Wormhole attack is one of the most serious attacks on DV-Hop. Previous solutions are mainly based on location leash and time leash which need hardware support, while the rest of the mechanisms without hardware support often require a higher ratio of beacon nodes and very complex operations. In this paper, we have analyzed the impact of the wormhole attack on the DV-Hop location algorithm. When the DV-Hop is invaded by the wormhole attack, the probability of the wormhole attack tunnel to be the shortest path is the biggest of all. Then we put forward the PDWA wormhole attack detection algorithm based on the Unique Preorder Node (UPN). It analyses the number of UPN and relationship through the statistics, detects the wormhole attack nodes without hardware support, and its computational complexity is also not high. The simulation results show that our proposed location scheme can fully detect the wormhole attacker. The obtained positioning accuracy is almost the same as the DV-Hop without a wormhole attack. What’s more, after it is applied to the improved MHDV-Hop algorithm, we also achieved a perfect effect. So the results fully show that our proposed scheme can resist the influence of the wormhole attack on DV-Hop.","PeriodicalId":213716,"journal":{"name":"The Journal of Information and Computational Science","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127585399","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
扫码关注我们
求助内容：
应助结果提醒方式：