Being high restricted by the conditions of roads, places and facilities under emergency situations, the location problems of emergency supplies distribution centers are suitable to adopt scattered optimization location modeling. The paper firstly set up the objective function of the location problem of emergency supplies distribution centers based P-centre model. And for meeting the needs of quickly get the solutions under the emergency requirements, the paper proposed an optimizing location algorithm according to the principles of 0-1 programming and dynamic programming, which could simply the solving process and to get the solutions of the best number of distribution centers and the optimal supplies distributing schemes at the same time. The efficiency of the algorithm is then estimated, and it is proved to have the functions of effectively cutting down the complexity of the calculations and improving the speeds in solving this kind of problems. Finally, a calculating case is demonstrated and the practicability of the algorithm is validated.
{"title":"A Quick and Efficient Algorithm to the Emergency Supplies Distribution Centers Location Problem","authors":"Shengli Pan, Jun Tian, Yingluo Wang","doi":"10.1109/GCIS.2012.73","DOIUrl":"https://doi.org/10.1109/GCIS.2012.73","url":null,"abstract":"Being high restricted by the conditions of roads, places and facilities under emergency situations, the location problems of emergency supplies distribution centers are suitable to adopt scattered optimization location modeling. The paper firstly set up the objective function of the location problem of emergency supplies distribution centers based P-centre model. And for meeting the needs of quickly get the solutions under the emergency requirements, the paper proposed an optimizing location algorithm according to the principles of 0-1 programming and dynamic programming, which could simply the solving process and to get the solutions of the best number of distribution centers and the optimal supplies distributing schemes at the same time. The efficiency of the algorithm is then estimated, and it is proved to have the functions of effectively cutting down the complexity of the calculations and improving the speeds in solving this kind of problems. Finally, a calculating case is demonstrated and the practicability of the algorithm is validated.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"24 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124538672","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}
An approximate solution of dark soliton on a parabolic background has been given. The parabolic beam can self-similarly evolve through the nonlinear barrier. The fundamental dark soliton strips can propagate stably, but the 2-order dark soliton strips divide into a pair of gray solitons along the propagate distance. In addition, the interaction of two parallel and cross dark soliton are considered.
{"title":"Propagate Properties of (2+1)-D Spatial Dark-soliton Strips on a Parabolic Background","authors":"Liao Shuqing","doi":"10.1109/GCIS.2012.29","DOIUrl":"https://doi.org/10.1109/GCIS.2012.29","url":null,"abstract":"An approximate solution of dark soliton on a parabolic background has been given. The parabolic beam can self-similarly evolve through the nonlinear barrier. The fundamental dark soliton strips can propagate stably, but the 2-order dark soliton strips divide into a pair of gray solitons along the propagate distance. In addition, the interaction of two parallel and cross dark soliton are considered.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133400827","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, a study aiming to achieve both speed and accuracy of feature based multi-spectral image registration process was carried out. Then a new homogenized feature based image registration method was proposed. The method first use DOH operator to detect features, then a circular filter window is used to adaptively select features based on the spatial distribution and intensity while keeping the features' rotation invariance. The selected features are further described and matched. Experiments show that the selected features are more robust and more uniformly distributed and the method has great advantages in both speed and accuracy.
{"title":"A New Homogenized Feature Based Multi-spectral Image Registration Method","authors":"Chenyang Wu, H. Niu, W. Liang","doi":"10.1109/GCIS.2012.76","DOIUrl":"https://doi.org/10.1109/GCIS.2012.76","url":null,"abstract":"In this paper, a study aiming to achieve both speed and accuracy of feature based multi-spectral image registration process was carried out. Then a new homogenized feature based image registration method was proposed. The method first use DOH operator to detect features, then a circular filter window is used to adaptively select features based on the spatial distribution and intensity while keeping the features' rotation invariance. The selected features are further described and matched. Experiments show that the selected features are more robust and more uniformly distributed and the method has great advantages in both speed and accuracy.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134133268","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 network specific information search system based on mobile agent and optimal search theory is presented. The mobility of agents is exploited to solve the multi-site search problem, and an optimal allocation schema of search resources is designed to improve the system's performance. The simulation results show that the new system can improve the probability of finding the specific information and reduce the search time than the average strategy. The computer simulation verifies the validity of the proposed algorithm.
{"title":"A Network Specific Information Search System Based on Mobile Agent","authors":"Chu Yan-jie, Wei Qiang","doi":"10.1109/GCIS.2012.15","DOIUrl":"https://doi.org/10.1109/GCIS.2012.15","url":null,"abstract":"A network specific information search system based on mobile agent and optimal search theory is presented. The mobility of agents is exploited to solve the multi-site search problem, and an optimal allocation schema of search resources is designed to improve the system's performance. The simulation results show that the new system can improve the probability of finding the specific information and reduce the search time than the average strategy. The computer simulation verifies the validity of the proposed algorithm.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132240933","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}
Based on the bi-modulation mechanism in body, we present reinforcement and suppress intelligent controller (RSIC), and design its control algorithm in this paper. Corresponding to the relative physiological system, we design the structure of RSIC, which includes super management unit (SMU), reinforcement control unit (RCU), suppress control unit (SCU), and assistant control unit (ACU). When set point changes or great error appears, the RCU first takes an effect. And the RCU will output a high or low limit value with a bionic filter, which can accelerate the rise time of control system. After a set time, the SCU will be enabled and output a reverse output compare to output of RCU with another bionic filter, which may reduce or avoid the overshoot or vibration. The final comprehensive effect of RCU and SCU is the coming control stable output. When the control system gets a stable status, the ACU will work with the conventional PI law to improve the control accuracy. SMU can make RCU, SCU, and ACU cooperate with each other. The simulation results indicate that RSIC has better control performance than conventional PID control algorithm.
{"title":"The Design and Application for a Bio-inspired Nonlinear Intelligent Controller","authors":"Liu Bao, L. Fei, Wang Junhong","doi":"10.1109/GCIS.2012.80","DOIUrl":"https://doi.org/10.1109/GCIS.2012.80","url":null,"abstract":"Based on the bi-modulation mechanism in body, we present reinforcement and suppress intelligent controller (RSIC), and design its control algorithm in this paper. Corresponding to the relative physiological system, we design the structure of RSIC, which includes super management unit (SMU), reinforcement control unit (RCU), suppress control unit (SCU), and assistant control unit (ACU). When set point changes or great error appears, the RCU first takes an effect. And the RCU will output a high or low limit value with a bionic filter, which can accelerate the rise time of control system. After a set time, the SCU will be enabled and output a reverse output compare to output of RCU with another bionic filter, which may reduce or avoid the overshoot or vibration. The final comprehensive effect of RCU and SCU is the coming control stable output. When the control system gets a stable status, the ACU will work with the conventional PI law to improve the control accuracy. SMU can make RCU, SCU, and ACU cooperate with each other. The simulation results indicate that RSIC has better control performance than conventional PID control algorithm.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114081731","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}
The architecture of two tiered sensor networks, where storage nodes serve as an intermediate tier between sensors and a sink for storing and processing data, has aroused researchers' attention because of the benefits of power and storage saving. In a sensor network, multiple sensor data streams are correlated. Correlation tracking can describe the key trends and reduce the complexity of further data processing. However, the importance of storage nodes also makes them attractive to attackers. In this paper we propose a method to guarantee both the utility and privacy of data on storage nodes through correlation tracking. To preserve privacy, we add random noise on original data. To preserve utility, the additive noise is distributed along the direction of sensor data. We provide both a mathematical and experimental evaluation on real dataset to validate the effectiveness of our algorithm.
{"title":"Privacy Preservation in a Two-Tiered Sensor Network through Correlation Tracking","authors":"Songtao Ye, Junfei Liu, Jin Zhang","doi":"10.1109/GCIS.2012.108","DOIUrl":"https://doi.org/10.1109/GCIS.2012.108","url":null,"abstract":"The architecture of two tiered sensor networks, where storage nodes serve as an intermediate tier between sensors and a sink for storing and processing data, has aroused researchers' attention because of the benefits of power and storage saving. In a sensor network, multiple sensor data streams are correlated. Correlation tracking can describe the key trends and reduce the complexity of further data processing. However, the importance of storage nodes also makes them attractive to attackers. In this paper we propose a method to guarantee both the utility and privacy of data on storage nodes through correlation tracking. To preserve privacy, we add random noise on original data. To preserve utility, the additive noise is distributed along the direction of sensor data. We provide both a mathematical and experimental evaluation on real dataset to validate the effectiveness of our algorithm.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127136542","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, the concept of L-fuzzy soft sets based on complete Boolean lattices is introduced and the lattice structure of L-fuzzy soft sets is established. Some operations on L-fuzzy soft sets are discussed.
{"title":"The Lattice Structure of L-fuzzy Soft Sets","authors":"Zhaowen Li, Shijie Li","doi":"10.1109/GCIS.2012.57","DOIUrl":"https://doi.org/10.1109/GCIS.2012.57","url":null,"abstract":"In this paper, the concept of L-fuzzy soft sets based on complete Boolean lattices is introduced and the lattice structure of L-fuzzy soft sets is established. Some operations on L-fuzzy soft sets are discussed.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126741066","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}
Wang Huisong, L. Zhiying, Jiang Shuming, Zhang Yuanyuan
Rough Set Theory was used for data mining based on the characteristic database and can form a knowledge database for hailstone recognition to establish a single model for hailstone forecast. Thus the comprehensive hailstone forecasting model was formed. Firstly the rules discovered from Apriori algorithm were used to eliminate the interference, Secondly the integrated knowledge database was formed by the combination of the rules obtained from the Rough Set Theory and the FP-tree algorithm for the comprehensive forecast. Certainty factor model was adopted to solve the rule conflict which occurred as the number of the rule increased. The experimental results show that the comprehensive forecast model improved the accuracy of hailstone recognition and good results were achieved in practical operation.
{"title":"Research of the Comprehensive Forecast of Hailstone","authors":"Wang Huisong, L. Zhiying, Jiang Shuming, Zhang Yuanyuan","doi":"10.1109/GCIS.2012.67","DOIUrl":"https://doi.org/10.1109/GCIS.2012.67","url":null,"abstract":"Rough Set Theory was used for data mining based on the characteristic database and can form a knowledge database for hailstone recognition to establish a single model for hailstone forecast. Thus the comprehensive hailstone forecasting model was formed. Firstly the rules discovered from Apriori algorithm were used to eliminate the interference, Secondly the integrated knowledge database was formed by the combination of the rules obtained from the Rough Set Theory and the FP-tree algorithm for the comprehensive forecast. Certainty factor model was adopted to solve the rule conflict which occurred as the number of the rule increased. The experimental results show that the comprehensive forecast model improved the accuracy of hailstone recognition and good results were achieved in practical operation.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116691570","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 order to achieve the goal of higher accuracy of DDS, In this paper, we will concentrate to modify and improve pipelined accumulator and the ROM lookup table which is based on the Cordic algorithm on the base of traditional DDS. And compared with the advantages and disadvantages of traditional algorithm, experiments have proofed that the Cordic algorithm can solve the problems of disorder, decentralization, big truncation error and instability of the traditional DDS output signal and it can also save the hardware resources up to 30%. It has obvious advantages showed on the speed, accuracy and hardware resources of the system.
{"title":"High-Precision Design of DDS Based on FPGA","authors":"Xiaochu Wang, Qiujun Mei","doi":"10.1109/GCIS.2012.20","DOIUrl":"https://doi.org/10.1109/GCIS.2012.20","url":null,"abstract":"In order to achieve the goal of higher accuracy of DDS, In this paper, we will concentrate to modify and improve pipelined accumulator and the ROM lookup table which is based on the Cordic algorithm on the base of traditional DDS. And compared with the advantages and disadvantages of traditional algorithm, experiments have proofed that the Cordic algorithm can solve the problems of disorder, decentralization, big truncation error and instability of the traditional DDS output signal and it can also save the hardware resources up to 30%. It has obvious advantages showed on the speed, accuracy and hardware resources of the system.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116514186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This article discusses the basic principles of the universal asynchronous receiver/transmitter, and design and realize of universal asynchronous receiver/transmitter base on Alter a NIOSII Development Board integrated in EDA experiment platform. the main chip Model of the FPGA is EP1C12F324C8. Circuit design with VHDL hardware description language programming, developing software is the QuartusII9.0.
{"title":"Implementation of Asynchronous Receiver/ Transmitter Based on FPGA","authors":"Xiao-li Hu, Feng-ying Wang, Bo Chen","doi":"10.1109/GCIS.2012.16","DOIUrl":"https://doi.org/10.1109/GCIS.2012.16","url":null,"abstract":"This article discusses the basic principles of the universal asynchronous receiver/transmitter, and design and realize of universal asynchronous receiver/transmitter base on Alter a NIOSII Development Board integrated in EDA experiment platform. the main chip Model of the FPGA is EP1C12F324C8. Circuit design with VHDL hardware description language programming, developing software is the QuartusII9.0.","PeriodicalId":337629,"journal":{"name":"2012 Third Global Congress on Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131046706","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
扫码关注我们
求助内容：
应助结果提醒方式：