An improved Particle Swarm Optimization Algorithm is proposed in this article. Inspired by the existence of Intermolecular Forces in physics, we bring particles that are influenced by repulsion in this Algorithm to keep the population active at all the stages. Meanwhile, the convergence speed can be assured because of the existence of particles that implement Standard Particle Swarm Optimization. Experimental results show that this improved algorithm can effectively solve the local optimal problems.
{"title":"A Modified PSO Algorithm with the Concept of Intrinsic Repulsive Field","authors":"Zhang Wei, Wang Jing-chun, Xiong Zhi-hua","doi":"10.1109/ISCID.2013.27","DOIUrl":"https://doi.org/10.1109/ISCID.2013.27","url":null,"abstract":"An improved Particle Swarm Optimization Algorithm is proposed in this article. Inspired by the existence of Intermolecular Forces in physics, we bring particles that are influenced by repulsion in this Algorithm to keep the population active at all the stages. Meanwhile, the convergence speed can be assured because of the existence of particles that implement Standard Particle Swarm Optimization. Experimental results show that this improved algorithm can effectively solve the local optimal problems.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133534320","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 paper analyzed the process of optimal design of accelerating structure and described the method of optimal design of accelerating structure based on genetic algorithm (GA). We performed the simulation experiment which is optimal design of the accelerating structure with a nose cone shape using the C++ programming language to write GA program. It proved that the algorithm was feasible and it gave a set of geometric parameter with higher shunt impedance for accelerating structure.
{"title":"Optimal Design of Accelerating Structure with Nose Cone Shape Based on Genetic Algorithm","authors":"Zhenxing Tang, Y. Pei","doi":"10.1109/ISCID.2013.52","DOIUrl":"https://doi.org/10.1109/ISCID.2013.52","url":null,"abstract":"This paper analyzed the process of optimal design of accelerating structure and described the method of optimal design of accelerating structure based on genetic algorithm (GA). We performed the simulation experiment which is optimal design of the accelerating structure with a nose cone shape using the C++ programming language to write GA program. It proved that the algorithm was feasible and it gave a set of geometric parameter with higher shunt impedance for accelerating structure.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122124277","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}
miRNAs have been regarded as the key regulator in post transcriptional modification involved in broad biological process. Identifying miRNA targets is one of the core challenges in studying miRNA function. Previous miRNA target prediction algorithms are mainly based on physical interaction mechanism such as sequence match and free energy. In our paper, we proposed SVM ensemble classifier based method to integrate functional information from Gene Ontology with sequence information. To supplement our method, we constructed comprehensive positive data and high quality negative data from micro-array data. Performance evaluation shows significant improvement of the proposed method in both prediction performance and the coverage of miRNA-mRNA pairs. Further analysis of the GO features used for prediction suggests they appropriately represent the functional information of miRNA target genes.
{"title":"miRNA Target Prediction Based on Gene Ontology","authors":"Ning Wang, Y. Wang, Yaodong Yang, Yi Shen, Ao Li","doi":"10.1109/ISCID.2013.113","DOIUrl":"https://doi.org/10.1109/ISCID.2013.113","url":null,"abstract":"miRNAs have been regarded as the key regulator in post transcriptional modification involved in broad biological process. Identifying miRNA targets is one of the core challenges in studying miRNA function. Previous miRNA target prediction algorithms are mainly based on physical interaction mechanism such as sequence match and free energy. In our paper, we proposed SVM ensemble classifier based method to integrate functional information from Gene Ontology with sequence information. To supplement our method, we constructed comprehensive positive data and high quality negative data from micro-array data. Performance evaluation shows significant improvement of the proposed method in both prediction performance and the coverage of miRNA-mRNA pairs. Further analysis of the GO features used for prediction suggests they appropriately represent the functional information of miRNA target genes.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122270011","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 we present an approach for the illumination invariant face recognition, which combines 2D spatial whitening filter with the LBP descriptor. Firstly, we preprocess each face image by applying whitening filter in the logarithm domain. Then LBP features are extracted based on the filtered images. After representing image with a LBP operator, the image will be divided into non-overlapped blocks and histograms are used to represent each block. Finally the concatenated histograms are used for recognition. The experimental results on the Yale B and Extended Yale B prove the out performance of the proposed method compared to other existing methods.
{"title":"Illumination Invariant Face Recognition with Whitening Filter and Local Binary Patterns","authors":"Shun Li, Fei Long, Xuefeng Cheng","doi":"10.1109/ISCID.2013.42","DOIUrl":"https://doi.org/10.1109/ISCID.2013.42","url":null,"abstract":"In this paper we present an approach for the illumination invariant face recognition, which combines 2D spatial whitening filter with the LBP descriptor. Firstly, we preprocess each face image by applying whitening filter in the logarithm domain. Then LBP features are extracted based on the filtered images. After representing image with a LBP operator, the image will be divided into non-overlapped blocks and histograms are used to represent each block. Finally the concatenated histograms are used for recognition. The experimental results on the Yale B and Extended Yale B prove the out performance of the proposed method compared to other existing methods.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130267625","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 self-tuning fuzzy logic controller (STFLC) is proposed to maintain the evaporator superheat via an electronic expansion valve (EEV) in a vapor compression chiller system. The output scaling factor (SF) of the STFLC is tuned in an on-line manner by fuzzy rules according to the current condition of the process. To verify the performance of the proposed control scheme, real-time experiments have been conducted on a pilot vapor compression chiller system. The results demonstrate that the controller design outperforms its conventional counterpart in keeping the evaporator superheat at a desired value even when the refrigeration load is changed over a wide range.
{"title":"A Self-Tuning Fuzzy Logic Controller for Superheat of Evaporator by Using Electronic Expansion Valve","authors":"H. Tian, Jiangang Lu, Qinmin Yang","doi":"10.1109/ISCID.2013.76","DOIUrl":"https://doi.org/10.1109/ISCID.2013.76","url":null,"abstract":"In this paper, a self-tuning fuzzy logic controller (STFLC) is proposed to maintain the evaporator superheat via an electronic expansion valve (EEV) in a vapor compression chiller system. The output scaling factor (SF) of the STFLC is tuned in an on-line manner by fuzzy rules according to the current condition of the process. To verify the performance of the proposed control scheme, real-time experiments have been conducted on a pilot vapor compression chiller system. The results demonstrate that the controller design outperforms its conventional counterpart in keeping the evaporator superheat at a desired value even when the refrigeration load is changed over a wide range.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129713632","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 important problem that arises in the area of fault diagnosis and circuit testing is the analog test point selection (ATPS), which is known to be NP-hard. In this paper, we present a new approach for the ATPS problem based on greedy randomized adaptive search procedure (GRASP), with the objective of overcoming the shortcoming of the greedy algorithms which are easily getting trapped into local optima. The proposed method first generates a feasible test point set by introducing randomness into greedy algorithm, and then a local search algorithm is designed to further improve the quality of the test point set got before. The efficiency of the proposed algorithm is demonstrated by a benchmark circuit. Results indicate that the proposed method, compared with other ATPS methods, more efficiently and more accurately finds the optimum set of test points.
{"title":"An Effective and Simple Heuristic for Analog Test Point Selection","authors":"Huajun Lei, Kaiyu Qin","doi":"10.1109/ISCID.2013.14","DOIUrl":"https://doi.org/10.1109/ISCID.2013.14","url":null,"abstract":"An important problem that arises in the area of fault diagnosis and circuit testing is the analog test point selection (ATPS), which is known to be NP-hard. In this paper, we present a new approach for the ATPS problem based on greedy randomized adaptive search procedure (GRASP), with the objective of overcoming the shortcoming of the greedy algorithms which are easily getting trapped into local optima. The proposed method first generates a feasible test point set by introducing randomness into greedy algorithm, and then a local search algorithm is designed to further improve the quality of the test point set got before. The efficiency of the proposed algorithm is demonstrated by a benchmark circuit. Results indicate that the proposed method, compared with other ATPS methods, more efficiently and more accurately finds the optimum set of test points.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129458006","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}
Pengqiang Zhang, Xuchu Yu, Qiongying Fu, Jinchun Qin, Ming Yang
A new corner feature extraction and matching algorithm using trinocular epipolar line geometry from image sequences is presented. In this algorithm the third adjacent image is introduced to extract matching corner features procedure between the two images indirectly. Experimental results validated that the extracted features using the proposed algorithm are uniform essentially to those extracted from the two images directly.
{"title":"Corner Feature Extraction and Matching for Image Sequences Using Trinocular Geometry Approach","authors":"Pengqiang Zhang, Xuchu Yu, Qiongying Fu, Jinchun Qin, Ming Yang","doi":"10.1109/ISCID.2013.196","DOIUrl":"https://doi.org/10.1109/ISCID.2013.196","url":null,"abstract":"A new corner feature extraction and matching algorithm using trinocular epipolar line geometry from image sequences is presented. In this algorithm the third adjacent image is introduced to extract matching corner features procedure between the two images indirectly. Experimental results validated that the extracted features using the proposed algorithm are uniform essentially to those extracted from the two images directly.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127897918","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}
Changnian Liu, Yafei Tian, Qiang Zhang, Jie Yuan, Binbin Xue
Firefly Algorithm (FA) originates from the swarm behavior which is inspired by natural fireflies through the fluorescence to exchange information. As a novel bionic swarm intelligent optimization algorithm, it has advantages of simple operation, high calculation efficiency, less parameters and so on, but it also exists defects of slow convergence speed and low optimization accuracy. In order to solve the above problems, this paper proposes the adaptive firefly optimization algorithm based on stochastic inertia weight (AFA). The improved optimization algorithm has feasibility and superiority. The results of the test consisting of five functions' optimization and PID parameters tuning further show that the algorithm optimization ability is better than the original FA and the genetic algorithm (GA).
{"title":"Adaptive Firefly Optimization Algorithm Based on Stochastic Inertia Weight","authors":"Changnian Liu, Yafei Tian, Qiang Zhang, Jie Yuan, Binbin Xue","doi":"10.1109/ISCID.2013.90","DOIUrl":"https://doi.org/10.1109/ISCID.2013.90","url":null,"abstract":"Firefly Algorithm (FA) originates from the swarm behavior which is inspired by natural fireflies through the fluorescence to exchange information. As a novel bionic swarm intelligent optimization algorithm, it has advantages of simple operation, high calculation efficiency, less parameters and so on, but it also exists defects of slow convergence speed and low optimization accuracy. In order to solve the above problems, this paper proposes the adaptive firefly optimization algorithm based on stochastic inertia weight (AFA). The improved optimization algorithm has feasibility and superiority. The results of the test consisting of five functions' optimization and PID parameters tuning further show that the algorithm optimization ability is better than the original FA and the genetic algorithm (GA).","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121499515","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}
Cloud computing is a business model accessed by services and it integrates a variety of resources via specified methods through the internet, so it has excellent prospect. Agent technology has unmatched intelligence compared with other techniques, and have been widely used in various fields. To build Agent Cloud platform and provide it as a service is already a trend, but from IaaS (Infrastructure as a Service) to AaaS (Agent as a Service), it requires a lot of heavy and difficult work. Nowadays Agent software system's development and deployment is still using the traditional technology solutions that is already unable to quickly adapt to various characteristics of cloud computing. Therefore this paper proposes ADT (Agent Development Toolkit) to overcome the technical problems and further achieve a smooth transition from IaaS to AaaS, in this way Agent cloud platform could be constructed fast.
云计算是一种以服务为访问对象的商业模式，它通过互联网将各种资源以特定的方式进行整合，具有很好的应用前景。智能体技术具有其他技术无法比拟的智能，已广泛应用于各个领域。构建Agent Cloud平台并将其作为服务提供已经是一种趋势，但从IaaS (Infrastructure as a service)到AaaS (Agent as a service)，需要大量繁重而艰巨的工作。目前Agent软件系统的开发和部署仍然采用传统的技术解决方案，已经无法快速适应云计算的各种特点。为此，本文提出ADT (Agent Development Toolkit)来克服技术难题，进一步实现从IaaS到AaaS的平稳过渡，从而快速构建Agent云平台。
{"title":"Research and Implementation of Agent as a Service","authors":"Jingjing Liu, Zhiyong Jin, Ping Xu","doi":"10.1109/ISCID.2013.203","DOIUrl":"https://doi.org/10.1109/ISCID.2013.203","url":null,"abstract":"Cloud computing is a business model accessed by services and it integrates a variety of resources via specified methods through the internet, so it has excellent prospect. Agent technology has unmatched intelligence compared with other techniques, and have been widely used in various fields. To build Agent Cloud platform and provide it as a service is already a trend, but from IaaS (Infrastructure as a Service) to AaaS (Agent as a Service), it requires a lot of heavy and difficult work. Nowadays Agent software system's development and deployment is still using the traditional technology solutions that is already unable to quickly adapt to various characteristics of cloud computing. Therefore this paper proposes ADT (Agent Development Toolkit) to overcome the technical problems and further achieve a smooth transition from IaaS to AaaS, in this way Agent cloud platform could be constructed fast.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121547423","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}
With the development of Internet, people can use their computer to make calls instead of telephone. Many Internet calls take place without any protection. TLS and SRTP could keep the callee and caller from third party's malicious action. However, both methods could do little when the reliability of VoIP server is under suspicion. In this paper, we present a server irrelevant security mechanism for VoIP system based on SIP and RTP. This mechanism implements safety handshake in media channel. User gets certificate from third party CA. Caller and callee exchange PKI or IBE information during the call. As long as the server keeps media data unchanged, this mechanism could ensure the safety of the call against server eavesdropping. It is flexible because the user could utilize different CA to obtain suitable safety demand with the same VoIP server. Cooperating with other protective methods, it can provide a more reliable environment for Internet telephone.
{"title":"A Proxy-Based Server Irrelevant Security Mechanism for VoIP","authors":"Yun Zhao, Jianxin Wang, Xingjun Wang","doi":"10.1109/ISCID.2013.35","DOIUrl":"https://doi.org/10.1109/ISCID.2013.35","url":null,"abstract":"With the development of Internet, people can use their computer to make calls instead of telephone. Many Internet calls take place without any protection. TLS and SRTP could keep the callee and caller from third party's malicious action. However, both methods could do little when the reliability of VoIP server is under suspicion. In this paper, we present a server irrelevant security mechanism for VoIP system based on SIP and RTP. This mechanism implements safety handshake in media channel. User gets certificate from third party CA. Caller and callee exchange PKI or IBE information during the call. As long as the server keeps media data unchanged, this mechanism could ensure the safety of the call against server eavesdropping. It is flexible because the user could utilize different CA to obtain suitable safety demand with the same VoIP server. Cooperating with other protective methods, it can provide a more reliable environment for Internet telephone.","PeriodicalId":297027,"journal":{"name":"2013 Sixth International Symposium on Computational Intelligence and Design","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132419066","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
扫码关注我们
求助内容：
应助结果提醒方式：