Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357788
D. Kresic
In this paper we present a syntax-directed approach to the verification of timing properties in systems like control systems, real-time systems, communication networks etc. Such systems, if modelled as timed automata [1], can be easily described through formal grammars (automata are transformed into grammars) and then analyzed by a parsing algorithm. In order to optimize the verification process, we embedded this approach in the constraint logic programming paradigm where the implementation of the grammar and of the parsing method can be specified as a set of deductive rules. Furthermore, we report about the possibility of using a special class of such rules - called propagation rules - in the verification of real-time properties.
{"title":"Verifying real-time properties by intelligent parsing","authors":"D. Kresic","doi":"10.1109/ICICISYS.2009.5357788","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357788","url":null,"abstract":"In this paper we present a syntax-directed approach to the verification of timing properties in systems like control systems, real-time systems, communication networks etc. Such systems, if modelled as timed automata [1], can be easily described through formal grammars (automata are transformed into grammars) and then analyzed by a parsing algorithm. In order to optimize the verification process, we embedded this approach in the constraint logic programming paradigm where the implementation of the grammar and of the parsing method can be specified as a set of deductive rules. Furthermore, we report about the possibility of using a special class of such rules - called propagation rules - in the verification of real-time properties.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115068834","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358075
W. Jiekang, Han Junfeng, Jiang Cheng
Considering distinct locations and inhomogeneous power plants playing different roles and effecting on the interconnected power system, as well as the purpose of pursuing best efficiency and stability for the whole interconnected power system, this paper presents a new method based on sensitivity analysis and neural network to solve the power regulation on tie-line in the interconnected power system. The sensitivity coefficients for the power plants relating to tie-line can be calculated and simulated by back propagation neural network, before which the appropriate samples setting of power plants should be acquired adequately from operating BPA software. The effectiveness of the proposed method is demonstrated on IEEE 30-bus system comprising of plants units of actual power grid in different regions and compared with some conventional approaches. The simulation results show that the proposed new approach is able to obtain higher quality solutions efficiently than the conventional approaches.
{"title":"Research on tie-line power adjustment of interconnected power system based on sensitivity analysis and neural network","authors":"W. Jiekang, Han Junfeng, Jiang Cheng","doi":"10.1109/ICICISYS.2009.5358075","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358075","url":null,"abstract":"Considering distinct locations and inhomogeneous power plants playing different roles and effecting on the interconnected power system, as well as the purpose of pursuing best efficiency and stability for the whole interconnected power system, this paper presents a new method based on sensitivity analysis and neural network to solve the power regulation on tie-line in the interconnected power system. The sensitivity coefficients for the power plants relating to tie-line can be calculated and simulated by back propagation neural network, before which the appropriate samples setting of power plants should be acquired adequately from operating BPA software. The effectiveness of the proposed method is demonstrated on IEEE 30-bus system comprising of plants units of actual power grid in different regions and compared with some conventional approaches. The simulation results show that the proposed new approach is able to obtain higher quality solutions efficiently than the conventional approaches.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116283294","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357741
Zhiwen Wang, Shaozi Li, Qixian Cai, Songzhi Su, Meizhen Liu
A multi-spectrum image fusion algorithm with weighted bi-orthogonal self-adaptive wavelet transform is put forward in this paper, which can make up for defects that there are faintness of image details in multi-spectrum image fusion of lower contrast image. The self-adaptive method of wavelet coefficient local model maximum which is weighted is used to fuse the high frequency components and the syncretism adaptive method is also chosen in the course of fusing low frequency coefficient. The capability of multi-spectrum image fusion is evaluated by calculating mean grads of image. The experimental results show that the fusion rule of our proposed method is more effective.
{"title":"Multi-spectrum image fusion algorithm based on weighted and improved wavelet transform","authors":"Zhiwen Wang, Shaozi Li, Qixian Cai, Songzhi Su, Meizhen Liu","doi":"10.1109/ICICISYS.2009.5357741","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357741","url":null,"abstract":"A multi-spectrum image fusion algorithm with weighted bi-orthogonal self-adaptive wavelet transform is put forward in this paper, which can make up for defects that there are faintness of image details in multi-spectrum image fusion of lower contrast image. The self-adaptive method of wavelet coefficient local model maximum which is weighted is used to fuse the high frequency components and the syncretism adaptive method is also chosen in the course of fusing low frequency coefficient. The capability of multi-spectrum image fusion is evaluated by calculating mean grads of image. The experimental results show that the fusion rule of our proposed method is more effective.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116460736","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357803
Li Zheng, Luo Fei-lu
Aerial in-situ test is an important constituent of modern aerial maintenance and repairing technology, which can detect the performance of aircraft structure quickly. Aiming at the low efficiency of the present in-situ test methods, the paper proposed a novel method named PSO-SVM which combined the improved particle swarm optimization (PSO) with support vector machine (SVM). The method could classify different defects accurately. The relationship between key parameter C and σ of SVM and the classification accuracy were calculated, therefore the optimized results were got. Experiments of classification were made and the results illustrated that the method could classify typical aircraft defects effectively, which had its special advantages on the short training time cost. This would have a promising application in rapid in-situ aircraft test.
{"title":"Flaw identification of undercarriage based on particle swarm optimization algorithm and support vector machine","authors":"Li Zheng, Luo Fei-lu","doi":"10.1109/ICICISYS.2009.5357803","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357803","url":null,"abstract":"Aerial in-situ test is an important constituent of modern aerial maintenance and repairing technology, which can detect the performance of aircraft structure quickly. Aiming at the low efficiency of the present in-situ test methods, the paper proposed a novel method named PSO-SVM which combined the improved particle swarm optimization (PSO) with support vector machine (SVM). The method could classify different defects accurately. The relationship between key parameter C and σ of SVM and the classification accuracy were calculated, therefore the optimized results were got. Experiments of classification were made and the results illustrated that the method could classify typical aircraft defects effectively, which had its special advantages on the short training time cost. This would have a promising application in rapid in-situ aircraft test.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123614021","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357930
Changcheng Zhou, C. Li
In this paper, the deformation, internal forces and stress of single throttle slice of shock absorber was analyzed, the formula of the stresses of its were established. Studied the pressure and the stresses on each slice, the analytic stresses formulas of multi-slices were established. Followed a practical example for stresses computation of multi-slices with this new analytic method, and it was simulated and verified by ANSYS software. The results show that the stress computation method for multi-slices is accurate enough.
{"title":"Analytic calculation of stress of multi-throttle-slices for twin tubes shock absorber","authors":"Changcheng Zhou, C. Li","doi":"10.1109/ICICISYS.2009.5357930","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357930","url":null,"abstract":"In this paper, the deformation, internal forces and stress of single throttle slice of shock absorber was analyzed, the formula of the stresses of its were established. Studied the pressure and the stresses on each slice, the analytic stresses formulas of multi-slices were established. Followed a practical example for stresses computation of multi-slices with this new analytic method, and it was simulated and verified by ANSYS software. The results show that the stress computation method for multi-slices is accurate enough.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123685436","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358077
Nianpeng Wang, Li-min Liu, Yan-jun Pang, Fachao Li
In this paper, studying from the structure of fuzzy numbers, we proposed quasi-linear fuzzy number, and proved that quasi-linear fuzzy number can approach to any forms fuzzy number under Lp -metric; further, we discuss the properties of quasi-linear fuzzy number.
{"title":"Study on quasi-linear fuzzy number and its properties","authors":"Nianpeng Wang, Li-min Liu, Yan-jun Pang, Fachao Li","doi":"10.1109/ICICISYS.2009.5358077","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358077","url":null,"abstract":"In this paper, studying from the structure of fuzzy numbers, we proposed quasi-linear fuzzy number, and proved that quasi-linear fuzzy number can approach to any forms fuzzy number under Lp -metric; further, we discuss the properties of quasi-linear fuzzy number.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123716833","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357654
Guo Ming, Yanmin Wang, Youshan Zhao, Junzhao Zhou
This paper proposes efficient data structures for point-based rendering and a real-time and high quality rendering algorithm for large-scale point models. As a preprocessing, large-scale point model is subdivided into multiple blocks and a hierarchical structure with Minimal Bounding Box (MBB) property is built for each block. A 3D R-tree index is constructed by those MBB properties. A linear binary tree is created in every block data. During rendering, the model is deal with block by block. Fast view-frustum detection based on respective MBB and 3D R-tree index are first performed to determine invisible data blocks. For visibility detection, this project proposes three algorithms which are back point visibility detection, view point-dependent visibility detection and depth-dependent visibility detection. Visible blocks are then rendered by choosing appropriate rendering model and view point-dependent level-of-detail. For determined level-of-detail, corresponding point geometry is accessed from the 3D R-tree and the linear binary tree (K-D tree). Adaptive distance-dependent rendering is accomplished to select point geometry, yielding better performance without loss of quality. The experiment system is developed in C# program language and CSOpenGL 3D graphic library. The point-cloud data sampled from several great halls of Forbidden City are used in experiment. Experimental results show that our approach can not only design to allow easy access to point data stored in Oracle databases, but also realize real-time rendering for huge datasets in consumer PCs. Those are the grounds for the modeling and computer simulation with point-cloud data.
{"title":"Modeling of large-scale point model","authors":"Guo Ming, Yanmin Wang, Youshan Zhao, Junzhao Zhou","doi":"10.1109/ICICISYS.2009.5357654","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357654","url":null,"abstract":"This paper proposes efficient data structures for point-based rendering and a real-time and high quality rendering algorithm for large-scale point models. As a preprocessing, large-scale point model is subdivided into multiple blocks and a hierarchical structure with Minimal Bounding Box (MBB) property is built for each block. A 3D R-tree index is constructed by those MBB properties. A linear binary tree is created in every block data. During rendering, the model is deal with block by block. Fast view-frustum detection based on respective MBB and 3D R-tree index are first performed to determine invisible data blocks. For visibility detection, this project proposes three algorithms which are back point visibility detection, view point-dependent visibility detection and depth-dependent visibility detection. Visible blocks are then rendered by choosing appropriate rendering model and view point-dependent level-of-detail. For determined level-of-detail, corresponding point geometry is accessed from the 3D R-tree and the linear binary tree (K-D tree). Adaptive distance-dependent rendering is accomplished to select point geometry, yielding better performance without loss of quality. The experiment system is developed in C# program language and CSOpenGL 3D graphic library. The point-cloud data sampled from several great halls of Forbidden City are used in experiment. Experimental results show that our approach can not only design to allow easy access to point data stored in Oracle databases, but also realize real-time rendering for huge datasets in consumer PCs. Those are the grounds for the modeling and computer simulation with point-cloud data.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123926216","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357934
Cai Bao-ping, L. Yonghong, Lin Qiang, Zhang Haifeng
The basid principle of space vector pulse width modulation (SVPWM) is analyzed, and a algorithm of SVPWM based on wavelet neural network (WNN-SVPWM) is proposed. The comparative study between BP neural network space vector pulse width modulation (BP-SVPWM) and WNN-SVPWM is done. The simulation results show that the permanent magnet synchronous motor (PMSM) controlled by WNN-SVPWM has less total current harmonic distortion and pulsating torque than BP-SVPWM. The closed-loop PMSM control system controlled by WNN-SVPWM is researched, and the experimental results show that the voltage and current waves are perfect, and the motor works well.
{"title":"The research of PMSM drive based on wavelet neural network space vector PWM","authors":"Cai Bao-ping, L. Yonghong, Lin Qiang, Zhang Haifeng","doi":"10.1109/ICICISYS.2009.5357934","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357934","url":null,"abstract":"The basid principle of space vector pulse width modulation (SVPWM) is analyzed, and a algorithm of SVPWM based on wavelet neural network (WNN-SVPWM) is proposed. The comparative study between BP neural network space vector pulse width modulation (BP-SVPWM) and WNN-SVPWM is done. The simulation results show that the permanent magnet synchronous motor (PMSM) controlled by WNN-SVPWM has less total current harmonic distortion and pulsating torque than BP-SVPWM. The closed-loop PMSM control system controlled by WNN-SVPWM is researched, and the experimental results show that the voltage and current waves are perfect, and the motor works well.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"36 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124509171","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5357731
Jian Liu, Nanli Wang
The question of finding the community structure of a complex network has been addressed in many different ways. Here we utilize a clustering method called affinity propagation, associating with some existent measures on graphs, such as the shortest path, the diffusion distance and the dissimilarity index, to solve the network partitioning problem. This method considers all nodes as potential exemplars, and transmits real valued messages between nodes until a high quality set of exemplars and corresponding communities gradually emerges. It is demonstrated by simulation experiments that the algorithms can not only identify the community structure of a network, but also determine the number of communities automatically during the model selection. Moreover, they are successfully applied to several real-world networks, including the karate club network and the dolphins network.
{"title":"Detecting community structure of complex networks by affinity propagation","authors":"Jian Liu, Nanli Wang","doi":"10.1109/ICICISYS.2009.5357731","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5357731","url":null,"abstract":"The question of finding the community structure of a complex network has been addressed in many different ways. Here we utilize a clustering method called affinity propagation, associating with some existent measures on graphs, such as the shortest path, the diffusion distance and the dissimilarity index, to solve the network partitioning problem. This method considers all nodes as potential exemplars, and transmits real valued messages between nodes until a high quality set of exemplars and corresponding communities gradually emerges. It is demonstrated by simulation experiments that the algorithms can not only identify the community structure of a network, but also determine the number of communities automatically during the model selection. Moreover, they are successfully applied to several real-world networks, including the karate club network and the dolphins network.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125897394","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}
Pub Date : 2009-12-28DOI: 10.1109/ICICISYS.2009.5358313
E. S. Solano Charris, J. Montoya-Torres, Carlos D. Paternina-Arboleda
This paper presents the application Ant Colony Optimization (ACO) to slve multi-criteria combinatorial optimization problems. The proposed decision support technique is validated on the Hybrid Flowshop Scheduling Problem with minimization of both the makespan and the total completion time of jobs. This problem is considered to be strongly NP-hard and has been little studied literature. Our algorithm is compared against other well-known heuristics from the literature adapted to solve this problem and experimental results show that our algorithm outperforms them.
{"title":"Multi-criteria optimization evolving artificial ants as a computational intelligence technique","authors":"E. S. Solano Charris, J. Montoya-Torres, Carlos D. Paternina-Arboleda","doi":"10.1109/ICICISYS.2009.5358313","DOIUrl":"https://doi.org/10.1109/ICICISYS.2009.5358313","url":null,"abstract":"This paper presents the application Ant Colony Optimization (ACO) to slve multi-criteria combinatorial optimization problems. The proposed decision support technique is validated on the Hybrid Flowshop Scheduling Problem with minimization of both the makespan and the total completion time of jobs. This problem is considered to be strongly NP-hard and has been little studied literature. Our algorithm is compared against other well-known heuristics from the literature adapted to solve this problem and experimental results show that our algorithm outperforms them.","PeriodicalId":206575,"journal":{"name":"2009 IEEE International Conference on Intelligent Computing and Intelligent Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126010438","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
扫码关注我们
求助内容：
应助结果提醒方式：