{"title":"An improved ant colony clustering algorithm based on dynamic neighborhood","authors":"Li Mao, M. Shen","doi":"10.1109/ICICISYS.2010.5658498","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658498","url":null,"abstract":"To solve the problems of the excessive clustering time consumption and the redundant numbers of the resulting clusters, commonly encountered with the ant-based clustering algorithms, an improved ant colony clustering algorithm based on dynamic neighborhood is proposed in this paper. The algorithm seeks for pure neighborhoods by performing auto-adaptive adjustments of dynamic neighborhood, and enhances ant's memory by additionally storing the sizes of the pure neighborhoods. The ant can exchange information with other ants, load multiple similar objects at once, and merge the similar neighborhoods to form the final clusters efficiently. Experimental results indicate that this algorithm significantly improves the efficiency and quality of ant colony clustering.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"154 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":"115778884","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":"Nonlinear internal model based attitude tracking and disturbance rejection of rigid spacecraft","authors":"Xuxi Zhang, Xianping Liu","doi":"10.1109/ICICISYS.2010.5658267","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658267","url":null,"abstract":"In this paper, we consider the attitude tracking and disturbance rejection problem of rigid spacecraft subject to a class of nonharmonic periodic disturbances generated by nonlinear exosystems, which can not be handled by linear internal model. A nonlinear internal model is designed to deal with such disturbances. Numerical simulations illustrate the performance of the proposed control algorithms.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"52 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":"115784880","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 dynamic convexized method for the TSP","authors":"Miaoling Wu, Wen-xing Zhu","doi":"10.1109/ICICISYS.2010.5658682","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658682","url":null,"abstract":"This paper describes a dynamic convexized method for solving the symmetric traveling salesman problem (TSP). We construct an auxiliary function and design an algorithm based on this function. The possibility of sinking into a previous local minimizer can be reduced by adjusting the value of the parameter in the auxiliary function. We have verified the correctness of this approach both in theory and experiment. Computational tests show that the algorithm is effective.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"180 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":"132155054","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":"Notice of RetractionOptimization design for structured light system","authors":"X. Li, L. Yaping","doi":"10.1109/ICICISYS.2010.5658413","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658413","url":null,"abstract":"In order to advance measuring accuracy of structured light system, optimization analysis is discussed in the paper. The analysis are based on structural parameters on measuring precision. Those analysis are to guide optimization design for structured light system, and it can lay the foundation for a wide range of its applications. Quantitative result shows that this optimization analysis can help the system to acquire higher measuring accuracy with 0.3334mm at measuring distance of 1000mm.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"66 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":"132363533","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":"Automatic extraction signature sequence of unknown network application","authors":"Bianqin Wang, Shunzheng Yu","doi":"10.1109/ICICISYS.2010.5658448","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658448","url":null,"abstract":"This paper presents a novel approach to automatically extract network application signature sequence from sessions of any application to identify the application accurately. Performance metrics such as identification rate and precision rate are applied to verity the extracted signature sequences. Experiment results show that this method is effective and the extracted signature sequences are subtle. Therefore it can be used to accurately identify the corresponding application.","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":"130056244","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":"Maximum Entropy framework used in text classification","authors":"Hui Wang, Lin Wang, Lixia Yi","doi":"10.1109/ICICISYS.2010.5658639","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658639","url":null,"abstract":"In this paper, Maximum Entropy (ME) framework is used to classify text documents. The ME framework has a lot of advantages when compared with other supervised learning algorithms, such as naive Bayes classifier. For example, it makes no inherent conditional independence assumptions between terms. With four labeled data sets, extensive experiments are made to compare the accuracy of ME algorithm with those of naive Bayes and Support Vector Machine (SVM), which are two popular and accurate algorithms in the domain of text classification. The final result is that ME method consistently outperforms naive Bayes and SVM algorithms in accuracy. On the WebKB and Industry Vector data sets, the accuracy of ME algorithm increases from 81.38% to 85.52% and from 85.73% to 89.78% respectively. On the third 20 Newsgroups data set, our experimental result is opposite to that of Nigam et al. For the last Reuters-21578 data set, the accuracy of ME algorithm increases from 94.76% to 96.16%.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"2 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":"130152196","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":"The modeling and Evolvement Analysis Method of operation system of systems based on extension space","authors":"Jincai Huang, Shidong Qiao, Zhong Liu, Qing Cheng","doi":"10.1109/ICICISYS.2010.5658712","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658712","url":null,"abstract":"Extension theory is the framework for modeling and problem-solving of complex decision problems. Based on extension modeling theory, the paper studies the modeling and evolvement analysis method of operation system of systems(OSoS). First, the conception of extension space is introduced based on extension theory, and the formalization definition of extension space is given. And then, based on FINC conception model of OSoS, the paper presents the Extension Modeling Method of OSoS(EMM-OSoS), and formalizes the matter elements(ME), the relation elements(RE), the action elements(AE) of EMM-OSoS. And at last, after defining seven operators based on extension space, the paper gives the Evolvement Analysis Method(EAM-OSoS). The contribution of paper to modeling and analysis of network-centric OSoS is referenced.","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":"130170008","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}
Hao Zhang, Fuchao Li, Hui Zhang, Zhihui Feng, Lei Xi, Xinming Ma
{"title":"Design and implementation of crop potential model system based on knowledge model and componentware technology","authors":"Hao Zhang, Fuchao Li, Hui Zhang, Zhihui Feng, Lei Xi, Xinming Ma","doi":"10.1109/ICICISYS.2010.5658547","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658547","url":null,"abstract":"The study of crop potential model system based on knowledge model and componentware technology may effectively improve the independence of the model system and quantify crop potential. Firstly, based on the statistical models on crop potential output, the paper utilized knowledge model and componentware method to design the model system of crop potential output under distributed computing network environment. Secondly, the paper implemented crop potential model components at all levels by using componentware technology. Finally, with the abstraction mechanism of interface, the paper designed the potential interfaces and integrated all kinds of crop potential output models. The results show that as a component container about crop potential output model, the model system may integrate statistical models and mechanism models, and provide a dynamic management for crop potential output models and dynamic methods call. It solves the difficult issues such as integration and expansion, and provides technical support for analyzing and evaluating crop potential output.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"2672 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":"134529342","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":"Risk model in fuzzy random environments","authors":"Tao Huang, Jinghua Diao","doi":"10.1109/ICICISYS.2010.5658344","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658344","url":null,"abstract":"In this paper, we consider a risk model in which the claim number process is characterized as a fuzzy random Poisson process and the individual claim amount is assumed to be a fuzzy random variable. The mean chance of the ultimate ruin is researched. The expressions of the mean chance of the ultimate ruin are obtained for zero initial surplus and arbitrary initial surplus. The results obtained in this paper coincide with those in stochastic case when the fuzzy random variables degenerate to random variables. Finally, a numerical example is presented. Keywords: Risk model; Mean chance; Ruin; Aggregate claims; Fuzzy variable; Fuzzy random variable","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"10 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":"134601930","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":"Framework towards developing a stability heuristic for cluster computation in MANETs","authors":"Gaurav Saxena, A. Singhal","doi":"10.1109/ICICISYS.2010.5658273","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658273","url":null,"abstract":"Hierarchical routing schemes in an ad-hoc environment outperform the flat routing schemes. Several algorithms like Lowest ID, LCC, Highest in-degree, WCA, IWCA, neural network based etc. have been proposed for clustering of nodes but none of them take into account the environment specific dynamic nature of a heterogenous ad-hoc network. They do not examine the combined effect of parameters like battery power, degree of node and mobility on cluster formation. Although these factors can be considered as inputs to a neural network, training the network and choosing the training algorithm is a computationally intensive hence time consuming step. In this letter we address this issue by computing a Stability factor for deciding cluster-heads. This factor is independent of the underlying environment, computationally un-intensive and takes into account environmental changes. It involves no GPS like schemes to measure mobility which clearly assumes a pre-existing facility in every computing device acting as a member of an ad-hoc network to measure the position of another node or relies on an external device to convey the position. The Stability factor also takes care of the interference anomaly - which we define as a false alarm resulting in change of a cluster-head due to a decrease in the received power levels at a node. This change in cluster-head is not due to any relative motion between them. The stability factor calculation could easily be built into a software and can be deployed for cluster-head calculation in any ad-hoc environment with no underlying assumptions.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"23 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":"133975409","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}