{"title":"Chaos control of a memristor-based Chua's oscillator via backstepping method","authors":"Yinfang Song, Yi Shen, Yi Chang","doi":"10.1109/ICIST.2011.5765158","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765158","url":null,"abstract":"In this paper, the problem of controlling chaos in a forth-order memristor-based Chua's oscillator is considered. Based on the backstepping method, we design two state feedback controllers to suppress chaos and guarantee the global asymptotical stability of the system. Simulation results show the effectiveness of the method and the accuracy of the statements proved.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"23 1","pages":"1081-1084"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78159095","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}
{"title":"Positive irregular solutions for a semilinear elliptic equation","authors":"Fen Yang, Bao-sheng Lian","doi":"10.1109/ICIST.2011.5765106","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765106","url":null,"abstract":"The singularity at zero of the positive radial irregular solution of the equation Δu + a|x|<sup>l</sup>u<sup>p</sup> + b|x|<sup>λ</sup>u<sup>q</sup> = 0, x ∈ ℝ<sup>n</sup>/{0} (0:1) are obtained and the structure of separation property of positive irregular solutions of Eq. (0.1) with different infinite asymptootic data ϑ are discussed.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"55 1","pages":"821-824"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76194138","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}
{"title":"Improved reachability analysis on retiming of Dsp algorithms with an efficient cell enumeration method","authors":"Shenshen Gu","doi":"10.1109/ICIST.2011.5765315","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765315","url":null,"abstract":"Retiming is a very important technology to DSP because it can optimize hardware circuits by reallocating registers without affecting the function. When applying the DSP technology, marked graph is used as a model of computation, and retiming indeed is a transformation that changes the distribution of tokens on arcs in marked graph. The theoretical base for the retiming transformation is finding the set of functionally equivalent initial markings. This process is called reachability analysis. For this reason, reachability analysis is one of the most important problem on retiming of DSP. The reachability analysis in marked graph can be performed by finding a integer solution to a set of linear equation, which is known to be NP-complete. In this paper, a novel approach for finding the integer solution is introduced with a complexity bound of O((nu)n−m), where n is the number of nodes, m is the number of arcs and u is the upper bound of the number of firings for all individual arcs. By reconstructing the marked graph that makes n − m equals to one, this algorithm can provide a very efficient approach to retiming of DSP.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"177 1","pages":"572-576"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77369731","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}
{"title":"Discovering mainstream knowledge in source codes of programming learners","authors":"G. Zhu, Zhishou Zhang","doi":"10.1109/ICIST.2011.5765263","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765263","url":null,"abstract":"There are lots of archives of problems for programming practice on the Internet. The problems in these archives, however, are not organized effectively for programming tutoring. To select the problems suitable for students to exercise, it is required to know the knowledge necessary to solve the problems and the knowledge that students have mastered. This can be done by discovering the problem-solving knowledge in the program source codes that the students have submitted. We propose a method based on Formal Concept Analysis (FCA) to discover the knowledge behind source codes of problem solutions. By constructing a formal context from many source codes for a given problem, the FCA is applied to building a formal concept lattice, from which the mainstream knowledge for solving the problem can be discovered. 60 problems were mined by the proposed method, which analyzed 2710 source codes submitted by 51 students. We found that on average each mainstream method had about 50% students employing it while other methods had only about 5%.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"48 1","pages":"333-338"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77513519","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}
{"title":"A RFID data cache structure based on Dual T Tree for spatio-temporal query","authors":"Yongli Wang, Gongxuan Zhang, Feng Sheng, Min Xu","doi":"10.1109/ICIST.2011.5765267","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765267","url":null,"abstract":"RFID technology provides a powerful ability of perceiving the world for human and it produces vast amounts of data. how to store and analyze the mass information has become a new challenge. A novel data structure for management and storage of RFID data is proposed in this paper, which uses a improvement form of the T tree - T list of trees (Dual T tree) and a path encoding technique to build spatio-temporal memory structure efficiently. Based on the memory structure, this paper introduces the event processing and query analysis algorithms, called DTTSTQ, and analyzes the time complexity of the algorithm. Experiments on real and synthetical data prove the validity and correctness of the proposed structure and algorithms.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"11 1","pages":"357-362"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82098936","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}
{"title":"Research on integrated drugs advertising information system","authors":"Wenming Zuo, Qiuping Huang, Chang Fan","doi":"10.1109/ICIST.2011.5765092","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765092","url":null,"abstract":"In this paper, the current status of drugs advertising management and the process in drugs advertising management system are analyzed. Issues about loose connection between each node and information asymmetry in the current drugs advertising management system are pointed out. Based on these analyses, integrated drugs advertising information system as the core of new drugs advertising management system is proposed. Then functions structure, technology applied and processing logic of this system are analyzed. In this new drugs advertising management system, integration of drugs advertising information will benefits effective control on the flow of advertising information, great improvement of efficiency in competent department and effective administration of behavior of related subjects. And then management of drugs advertising market can be regulated.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"8 1","pages":"1371-1376"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82152019","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}
{"title":"Enhancement of the security of RBS for wireless sensor networks","authors":"Liang Tao, Junjie Chen, W. Ge, Ting Lin","doi":"10.1109/ICIST.2011.5765300","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765300","url":null,"abstract":"Time synchronization is one of the fundamental techniques for the wireless sensor networks to obtain the real-time effective information. The security of this technology is becoming increasingly important. In this paper, we analyze the security of RBS, the synchronization algorithm in WSN, point out the potential vulnerabilities existing in the algorithm, and propose optimization on security for the algorithm. Simulation result shows improved algorithm not only defends external attacks effectively, but greatly reduces the effects of internal attack.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"26 1","pages":"500-505"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82217611","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}
{"title":"Distribution service restoration using chaotic optimization and immune algorithm","authors":"Shaolan Lei, Shan Li, Jing Yang, Dongrong Jiang","doi":"10.1109/ICIST.2011.5765169","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765169","url":null,"abstract":"A method of chaotic optimization and immune algorithm is presented for service restoration after faults in distribution system in this paper, which might improve the probability for optimal solution, and have the characteristic of chaotic optimization and artificial immunity algorithm. In the proposed algorithm, chaotic optimization is used to initialize the antibody of immune algorithm firstly in order to improve convergence speed by the excellent global search ability, which is regarded as thick search. Then artificial immune algorithm is applied by local search to complete thin search in the chaotic optimization, in order to make the population diversity and avoid getting to stuck in local minima to a certain degree. The effectiveness of the proposed method is demonstrated with actual system taken from a certain district distribution grid in Chongqing. The result shows that chaos immune optimization algorithm in the paper might improve convergence speed and precision of restoration and avoid premature convergence.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"56 1","pages":"1129-1133"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86832139","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}
Yiyang Xiong, M. Cheng, Yuchun Gao, Bai Li, Jing Wang
{"title":"Simulation research on the use of phase encoding algorithm in correcting range ambiguity for Doppler weather radar","authors":"Yiyang Xiong, M. Cheng, Yuchun Gao, Bai Li, Jing Wang","doi":"10.1109/ICIST.2011.5765356","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765356","url":null,"abstract":"The theory of SZ phase encoding correcting range ambiguity algorithm is analyzed. Based on the Matlab radar signal simulation platform, the meteorological echo signals are simulated with different parameters. Furthermore, the range ambiguity correcting is performed in frequency domain with the improved SZ method. It is indicated that SZ phase encoding algorithm is capable to restore the parameters of overlapped echoes and estimate the average velocity accurately. It is proved to be applicable in actual observations. This algorithm shows better effect in restoring the weak echo spectrum matrix when the echo power ratio is in a certain range. The error of the estimated second echo spectrum matrix increases with the power ratio.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"104 1","pages":"761-765"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87616443","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}
{"title":"Chinese question answering system based on question classification and similarity","authors":"Guo Dongwei, Jia Chenhui, Liu Miao, Wang Kangping","doi":"10.1109/ICIST.2011.5765271","DOIUrl":"https://doi.org/10.1109/ICIST.2011.5765271","url":null,"abstract":"In this paper, a Chinese question answering system is designed and implemented. Firstly, the overall structure of Chinese question answering system is introduced. Secondly, the question classification algorithm based on improved rules and answer extraction algorithm using semantic matching similarity comparison based on dependency trees are presented. Finally, experiments and tests on the system are carried out, results are analyzed and shown that the system is effective.","PeriodicalId":6408,"journal":{"name":"2009 International Conference on Environmental Science and Information Application Technology","volume":"10 1","pages":"377-380"},"PeriodicalIF":0.0,"publicationDate":"2011-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87788146","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}