{"title":"Genetic algorithm based global optimization algorithm used to solving System Analysis of Multi-Disciplinary Optimization","authors":"Chun-lin Gong, Liangxian Gu","doi":"10.1109/ICICISYS.2010.5658667","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658667","url":null,"abstract":"Multi-Disciplinary Feasible (MDF) is a promising solving architecture for Multi-Disciplinary Optimization (MDO) problem. But traditional iteration based solving method for System Analysis (SA) of MDF has poor computational performance. The solving trouble due to SA prevents its application in complex, tight-coupled system design. The intent of this research is to improve the computational performance of SA and MDF. By analyzing the characteristics of FPI and NRI method, the reasons of computational difficulties were summarized. Then, the requirements to SA solving method were presented. To meet these requirements, original formulation of SA was changed to a Non-Linear Programming (NLP) problem. The special requirements for this NLP necessitate a new optimization algorithm. Hence, two optimization algorithms, GA and DFP, were combined in series to GA-DFP. By a test example, GA-DFP has been validated in capabilities of global search and local convergence, and meets all requirements of SA. By introducing GA-DFP into MDF, a new architecture, BO-MDF, was established. The results of typical problem show that BO-MDF has better performance than other MDO solving architectures of MDF, IDF, AAO, and CO.","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":"132967343","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":"Design of perfect-reconstruction hybrid filter banks: A second-order cone programming approach","authors":"Zhenhao Cai, Hongyi Yu","doi":"10.1109/ICICISYS.2010.5658628","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658628","url":null,"abstract":"In this paper, we present a new convex programming design methodology for hybrid filter banks (HFB) by solving a linear equation system derived from the perfect reconstruction (PR) conditions. The relationship between the PR conditions and each different solution situations are discussed regarding the consistent and inconsistent equation case, the general solution and the lower bound to the error of reconstruction are given. A second order cone programming (SOCP) based algorithms for designing PR HFB is proposed to get the exact solution with the constrained of stopband energy minimum which can also be used to calculate the minimizing norm solution of the equation. Finally, we consider some design examples and evaluate their performance.","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":"129400982","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 new method of removing salt-and-pepper noise basing on grey system model in images","authors":"Tongli He, Jianhong Gan","doi":"10.1109/ICICISYS.2010.5658446","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658446","url":null,"abstract":"Focusing on the problem of image details losing while denoising image using Median filter method, the article proposes a salt and pepper noise filtering algorithm basing on grey system theory. The algorithm employs the idea of sorting out current pixel firstly and then filtering, where all the pixels are classified into two groups, according to the noise characteristics, one is suspicious noise and the other is signal pixel. For suspicious noises, the grey system model is adopted to filter noises, and there are nothing to be done for signal pixels in order to preserve more image details. The results of experimental show that the proposed method not only achieved better noise reduction properties, but also has strong ability to preserve details compared with the commonly used median filter algorithm.","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":"131227040","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 power and deflation method based kernel principal component analysis","authors":"Weiya Shi, Dexian Zhang","doi":"10.1109/ICICISYS.2010.5658803","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658803","url":null,"abstract":"Kernel principal component analysis (KPCA) is a popular nonlinear feature extraction method. It generally uses eigen-decomposition technique to extract the principal components in feature space. But the method is infeasible for large-scale data set because of the storage and computational problem. To overcome these disadvantages, an efficient iterative method of computing kernel principal components is proposed. First, the Power iteration is introduced to compute the first eigenvalue and corresponding eigenvector. Then the deflation method is repeatedly applied to achieve other higher order eigenvectors. In the process of computation, the kernel matrix needs not to compute and store in advance. The space and time complexity of the proposed method is greatly reduced. The effectiveness of proposed method is validated from experimental 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":"130905523","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":"Design synthesis of permanent magnet synchronous motor based on expert system","authors":"Xie Wei, Zhang Qiong, Tian Cheng","doi":"10.1109/ICICISYS.2010.5658716","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658716","url":null,"abstract":"The expert system technique is applied for the design synthesis of permanent magnet synchronous motor. The new frame of rule skeleton and rule body is adopted for the knowledge representation that pays equal attention to the symbol reasoning and numerical calculation. The forward inference network is built up on the base of the rule skeleton for the redesign, and the detailed design contents are set in the rule bodies respectively. The design results show that the developed expert system for the design synthesis of permanent magnet Synchronous motor is successful, and the proposed method can be used for the designs of other electric machines.","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":"130975490","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}
Zhang Yichi, Pang Jianmin, Zhao Rongcai, Guo Zhichang
{"title":"Artificial neural network for decision of software maliciousness","authors":"Zhang Yichi, Pang Jianmin, Zhao Rongcai, Guo Zhichang","doi":"10.1109/ICICISYS.2010.5658423","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658423","url":null,"abstract":"With the rapidly development of virus technology, the number of malicious code has continued to increase. So it is imperative to optimize the traditional manual analysis method by automatic maliciousness decision system. Motivated by the inference technique for detecting viruses, and a recent successful classification method, we explore Radux-an automatic software maliciousness decision system. It rests on artificial neural network based on behavior hidden in malicious code. Decompile technique is applied to characterize behavioral and structural properties of binary code, which creates more abstract descriptions of malware. Experiment shows that this system can decision software maliciousness efficiently.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"152 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":"131185177","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 of judging electromagnetic interference propagating way based on Multisim circuit simulation","authors":"Zhang Tao, Z. Ren, Guang Chen, Changcun Sun","doi":"10.1109/ICICISYS.2010.5658794","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658794","url":null,"abstract":"According to the problem of electromagnetic incompatibility between transmitting system and receiving system in active detection equipment, the research on propagating way of electromagnetic interference is taken as the breakthrough point. Aiming to eliminate the impact of conducted interference on radiated interference in practical tests, a method of judging electromagnetic interference propagating way based on Multisim circuit simulation is put forward. Firstly, the simulation platform of signal processing module in receiving system is set up in Multisim. When many signals are input into simulation platform and real system, the comparison of judging results indicates the correctness and feasibility of simulation platform. Secondly, when transmitting system is working, the interference signal is sampled by signal acquisition card, and is loaded to the simulation platform as signal source by LabVIEW. The simulation result shows that transmitting system can interfere with receiving system by radiated coupling.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"145 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":"132883712","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":"Optimization method for mixed constraints problem solving","authors":"Xiaohui Ji, Zhuo Huang","doi":"10.1109/ICICISYS.2010.5658781","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658781","url":null,"abstract":"This paper presents a new method that solves a mixed constraints problem by transforming it into a mixed integer programming problem. The method builds the connection between the feasibility of a mixed constraint problem and the solution to a mixed integer programming problem. The correctness of this method is proven. This method will be beneficial for the further integration of constraint programming and optimization methods.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"8 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":"133002787","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 bus passenger flow estimation method based on feature point's trajectory clustering","authors":"Yuan Hejin","doi":"10.1109/ICICISYS.2010.5658589","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658589","url":null,"abstract":"Based on the observation that motion of different pixels from the same target has very similar spatial-temporal properties in bus video surveillance images, a feature point's trajectory clustering method is proposed to estimate passenger flow in this paper. Firstly, the pyramid-based optical flow algorithm is utilized to tracking the feature point's movement in the images; then, their trajectories are pre-classified into passenger getting on, off the bus and others according their motion direction histogram; finally, the pre-classified trajectories are clustered by their spatial-temporal similarity and the cluster number is looked as the result of bus passenger flow estimation. Since it needn't to detect the head contour, face or other features of the passenger, our method is simple, fast and strong. The experiment results on multiple real bus surveillance videos show that it has high counting accuracy (>90%) in different illumination, background and even crowded conditions.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"2014 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":"132144274","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 minimax inequality in L-convex spaces and its applications","authors":"Qunwang Tong","doi":"10.1109/ICICISYS.2010.5658326","DOIUrl":"https://doi.org/10.1109/ICICISYS.2010.5658326","url":null,"abstract":"In this paper, by using a minimax inequality in L-convex spaces, we establish Ky Fan's section theorem and discuss its applications to minimax inequality, maximal element theorem in L-convex spaces. As applications, some new existent theorems for abstract generalized vector equilibrium are obtained in L-convex spaces.","PeriodicalId":339711,"journal":{"name":"2010 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"115 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":"132147058","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}