{"title":"Future projections of streamflow in the Songhuajiang River basin based on the artificial neural networks","authors":"X. Zeng, Jian-zhong Zhou, T. Jiang","doi":"10.1109/ICICISYS.2010.5658660","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658660","url":null,"abstract":"Based on observed climate data and climate projection in the Songhuajiang River basin, streamflows at Jiamusi hydrological station under three emission scenarios during 2011–2050 are projected by applying artificial neural networks. The results show that annual streamflow will not change significantly and its decadal variations are also small, but there are significant seasonal variations under three emission scenarios.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128519800","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":"Study of driving control for 4WD hybrid electric vehicle","authors":"Shirong Yan, Liang Hong","doi":"10.1109/ICICISYS.2010.5658523","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658523","url":null,"abstract":"Hybrid electric vehicles are now in fast development because of their energy saving and reduction of exhausting. 4WD hybrid electric vehicles can run on some wild lands and attracts many people. How to control 4WD hybrid electric vehicles is important both in energy saving and acceleration performance. In the paper, a driving control scheme is developed to get good driving performance and low energy required. Simulation studies in the paper show the method can get some good results.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128755437","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}
Haoran Guo, J. Pang, Yichi Zhang, F. Yue, Rongcai Zhao
{"title":"HERO: A novel malware detection framework based on binary translation","authors":"Haoran Guo, J. Pang, Yichi Zhang, F. Yue, Rongcai Zhao","doi":"10.1109/ICICISYS.2010.5658586","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658586","url":null,"abstract":"Malware has become one of the most serious threats to computer information system. In this paper, we describe HERO (Hybrid security extension of binary translation), a novel framework that exploits static and dynamic binary translation features to detect broad spectrum malware and prevent its execution. By operating directly on binary code without any assumption on the availability of source code, HERO is appropriate for translating low-level binary code to high-level proper representation, obtaining CFG (Control Flow Graph) and other high-level Control Structure by static binary translation-based analyzer. Then Critical API Graph based on CFG is generated to do sub-graph matching with the defined Malware Behavior Template. If static analysis cannot finish generating CFG because of code obfuscation used in malware, the dynamic binary translation based analyzer in HERO is called to undertake the process to take on the remaining code analysis. Compared with other detection approaches, HERO is found to be very efficient in terms of detection capability and false alarm rate.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128282030","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 double search mining algorithm in frequent neighboring class set","authors":"Cheng-Sheng Tu, G. Fang","doi":"10.1109/ICICISYS.2010.5658304","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658304","url":null,"abstract":"This paper addresses the existing problems that present frequent neighboring class set mining algorithms is inefficient to extract long frequent neighboring class set in spatial data mining, and introduces a double search mining algorithm in frequent neighboring class set, which is suitable for mining any frequent neighboring class set in large spatial data through down-top search strategy and top-down search strategy. Firstly, the algorithm turns neighboring class set of right instance into digit to create database of neighboring class set, and then generates candidate frequent neighboring class set via double search strategy, namely, one is that it gains (k+1)-neighboring class set as candidate frequent items by computing (k+1)-superset of k-frequent neighboring class set, the other is that it gains l-neighboring class set as candidate frequent item by computing l-subset of (l+1)-non frequent neighboring class set. The mining algorithm computes support of candidate frequent neighboring class set by AND operation. The algorithm improves mining efficiency through these methods. The result of experiment indicates that the algorithm is faster and more efficient than present algorithms when mining frequent neighboring class set in large spatial data.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128609240","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 energy characteristic prediction expert system for gun propellant","authors":"Bin Xu, Zhitao Liu, F. Nan, Xin Liao","doi":"10.1109/ICICISYS.2010.5658482","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658482","url":null,"abstract":"In order to estimate energy characteristics of gun propellant, which are hard to measure in experiments, an expert system for predicting the energy characteristic of gun propellant(ECPES) has been established based on a reasonable combustion model. The system has functions of energy characteristic estimation, knowledge management and formula optimization with characteristic constraints. ECPES is validated by experiments, and the result shows it could indicate energy characteristic of gun propellant, with an error less than 3%.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129927659","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":"Summary of intelligent algorithms in planning & scheduling of Earth observation satellite","authors":"Hong-fei Wang, Xu-zhi Li, Yurong Liu, Bing Zhou","doi":"10.1109/ICICISYS.2010.5658475","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658475","url":null,"abstract":"Mission planning system is the core part of Earth observation satellites ground management, and it is a complex NP hard problem. This paper summarized the advantages and disadvantages of various mathematical models of the planning system today. And papers also analyzed the adaptability and Optimization result of intelligent algorithms in many different situations. Finally, the article gives the current EOS satellite mission planning system's latest developments and trends in the future.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130113200","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":"Optimal design based on improved Simulated Annealing Algorithm for the induction motors with high-voltage","authors":"D. Meng, Yongming Xu, Jiabin Wen","doi":"10.1109/ICICISYS.2010.5658657","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658657","url":null,"abstract":"The optimization design based on the improved Simulated Annealing Algorithm was made for the induction motors with high voltage of YKK series according to the design rule in which several motors are of the same stator lamination. The lowest effective material cost and the highest efficiency for the every motor were taken for the mix objective, and the excellent results were achieved. The efficiencies of all motors in the series reach or excess the standards of the high-efficiency motors. The optimal design results have been applied in the practice engineering.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129022332","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 of the memory characteristics of P-set","authors":"Yufeng Qiu, Xuefang Ren","doi":"10.1109/ICICISYS.2010.5658366","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658366","url":null,"abstract":"P-set (packet sets) is a set pair which consists of interior P-set (interior packet set) and exterior P-set (exterior packet sets). By employing P-set and its structure, the concept of the ƒ -memory set of interior P-set, ƒ -memory measurement, and ƒ -variation measurement are presented in this article, further the relation theorems between the ƒ -memory and the ƒ -variation of interior P-set are proposed; similarly, the concept of the ƒ̅ -memory set of exterior P-set, the ƒ̅ -memory measurement of exterior P-set, and ƒ̅ -variation measurement are presented, moreover the relation theorem between the ƒ̅ -memory and the ƒ̅ -variation of exterior P-set is proposed. The memory characteristic is one of the important characteristics of P-set.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129052974","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":"Orthogonal U transform and its application in image compression","authors":"Fenhong Guo, Changzhen Xiong","doi":"10.1109/ICICISYS.2010.5658270","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658270","url":null,"abstract":"In this paper, a new unitary transform called U transform is constructed in recursion way. The U transform matrix contains piecewise constant basis vectors, piecewise linear basis vectors and piecewise second order polynomial basis vectors, and therefore U transform is a generalization of Walsh transform and Slant transform. A fast computational algorithm has been found for the transformation. The U transform is applied to digital image compression with quantization table based on Human Visual System (HVS). The experimental results indicate that U transform outperforms Slant transform in image compression.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128904117","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 method to generate the most similar path set based on given failure path","authors":"Junmin Ye, Yan Zeng, Cong Jin, Jinhua Wang","doi":"10.1109/ICICISYS.2010.5658831","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658831","url":null,"abstract":"Localizing a program fault is a key technology for the quality assurance of software. To achieve an effective method for fault location is to use similar path to determine the location of software failure, so how to find the similar paths is very important. A method for finding the most similar pa th based on the specified failure pa th is proposed in this paper. It is experimentally proved that the proposed algorithm can generate the most similar path set for a failure path.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"110 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130729427","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}