In this paper we overcome the restriction of conventional integrators and present a unified framework for general integral control (GIC). The necessary conditions and basic principles for designing a general integrator are proposed. All asymptotically stable controllers in conjunction with the limited conditions described can be directly used as integrators and all techniques for designing these controllers can be used to design a general integrator and analyze its stability. Many control laws can easily be transformed into GIC laws and many control theories can be used to design a GIC controller, analyze its stability and tune its parameters. Theoretical analysis and simulation results demonstrated that the general integrator has stronger capability, faster convergence and better flexibility than previous integrators and the windup phenomenon can be eliminated. Moreover, compared to previous integral control, GIC can remarkably improve transient performance by using the same maximum control action.
{"title":"General Integral Control","authors":"Bai-shun Liu, B. Tian","doi":"10.1109/ICACC.2009.30","DOIUrl":"https://doi.org/10.1109/ICACC.2009.30","url":null,"abstract":"In this paper we overcome the restriction of conventional integrators and present a unified framework for general integral control (GIC). The necessary conditions and basic principles for designing a general integrator are proposed. All asymptotically stable controllers in conjunction with the limited conditions described can be directly used as integrators and all techniques for designing these controllers can be used to design a general integrator and analyze its stability. Many control laws can easily be transformed into GIC laws and many control theories can be used to design a GIC controller, analyze its stability and tune its parameters. Theoretical analysis and simulation results demonstrated that the general integrator has stronger capability, faster convergence and better flexibility than previous integrators and the windup phenomenon can be eliminated. Moreover, compared to previous integral control, GIC can remarkably improve transient performance by using the same maximum control action.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"22 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123134891","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 presents an optimal design and its realization of poly-phase induction motor using Particle Swarm Optimization (PSO). The optimization algorithm considers the efficiency, starting torque and temperature rise as objective function (which are considered separately) and nine performance related items as constraints. The PSO algorithm was implemented on a test motor and the results are compared with the Simulated Annealing (SA) technique and normal design. From the test results PSO gave better results and more suitable to motor’s design optimization. Optimized variables are realized by PC-IMD (Induction Motor Drives) of SPEED (Scottish Power Electronics and Electric Drives) software. C++ code is used for implementing entire algorithms.
本文提出了一种基于粒子群算法的多相感应电动机优化设计与实现方法。优化算法以效率、起动转矩和温升为目标函数(单独考虑)，以9个性能相关项为约束条件。在一台测试电机上实现了粒子群算法，并与模拟退火(SA)技术和常规设计结果进行了比较。实验结果表明，粒子群优化算法效果较好，更适合于电机的设计优化。优化变量由SPEED (Scottish Power Electronics and Electric Drives)软件的PC-IMD(感应电机驱动)实现。c++代码用于实现整个算法。
{"title":"Realization on PSO Based Induction Motor Design Via SPEED/PC-IMD","authors":"C. T. Raj, S. P. Srivastava, P. Agarwal","doi":"10.1109/ICACC.2009.131","DOIUrl":"https://doi.org/10.1109/ICACC.2009.131","url":null,"abstract":"This paper presents an optimal design and its realization of poly-phase induction motor using Particle Swarm Optimization (PSO). The optimization algorithm considers the efficiency, starting torque and temperature rise as objective function (which are considered separately) and nine performance related items as constraints. The PSO algorithm was implemented on a test motor and the results are compared with the Simulated Annealing (SA) technique and normal design. From the test results PSO gave better results and more suitable to motor’s design optimization. Optimized variables are realized by PC-IMD (Induction Motor Drives) of SPEED (Scottish Power Electronics and Electric Drives) software. C++ code is used for implementing entire algorithms.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117175642","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}
Collaborative learning can bring many benefits when groups of students work together in writing, projects, or other activities. However, there are disadvantages of collaborative learning. One of the disadvantages is that the time spent on learning a topic could be unbelievable. To improve the efficiency of a collaborative learning activity, this study used computer-assisted test for the heterogeneous grouping stage. Unfortunately, any test may increase students’ learning anxiety. Therefore, the study aims to find out how to improve efficiency of collaborative learning activities in a classroom without losing the expected objectives. First, the Team-Game-Tournament (TGT) collaborative learning strategy was selected to complement the computer-assisted test. Then, we can use a questionnaire to show that there is no significant increase on learning anxiety after using computer-assisted testing. In other words, additional testing in collaborative learning is harmless to students’ learning anxiety. Finally, the time spent on learning a topic of experimental group was compared with control group to demonstrate the improvement of efficiency. The most interesting part of this study is showing computer-assisted test as a useful tool for computer-supported collaborative learning.
{"title":"Using Computer-Assisted Test to Harmlessly Improve the Efficiency of Heterogeneous Grouping in Collaborative Learning","authors":"Chih-Kai Chang, Chang-Shing Lee","doi":"10.1109/ICACC.2009.14","DOIUrl":"https://doi.org/10.1109/ICACC.2009.14","url":null,"abstract":"Collaborative learning can bring many benefits when groups of students work together in writing, projects, or other activities. However, there are disadvantages of collaborative learning. One of the disadvantages is that the time spent on learning a topic could be unbelievable. To improve the efficiency of a collaborative learning activity, this study used computer-assisted test for the heterogeneous grouping stage. Unfortunately, any test may increase students’ learning anxiety. Therefore, the study aims to find out how to improve efficiency of collaborative learning activities in a classroom without losing the expected objectives. First, the Team-Game-Tournament (TGT) collaborative learning strategy was selected to complement the computer-assisted test. Then, we can use a questionnaire to show that there is no significant increase on learning anxiety after using computer-assisted testing. In other words, additional testing in collaborative learning is harmless to students’ learning anxiety. Finally, the time spent on learning a topic of experimental group was compared with control group to demonstrate the improvement of efficiency. The most interesting part of this study is showing computer-assisted test as a useful tool for computer-supported collaborative learning.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126741931","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 the time-delay neural networks (TDNNs) have been implemented in detecting the damage in bridge structure using vibration signature analysis. A simulation study has been carried out for the incomplete measurement data. It has been observed that TDNNs have performed better than traditional neural networks in this application and the arithmetic of the TDNNs is simple.
{"title":"A Time-Delay Neural Networks Architecture for Structural Damage Detection","authors":"L. Niu","doi":"10.1109/ICACC.2009.75","DOIUrl":"https://doi.org/10.1109/ICACC.2009.75","url":null,"abstract":"In this paper the time-delay neural networks (TDNNs) have been implemented in detecting the damage in bridge structure using vibration signature analysis. A simulation study has been carried out for the incomplete measurement data. It has been observed that TDNNs have performed better than traditional neural networks in this application and the arithmetic of the TDNNs is simple.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126960605","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}
Decision tree based on hiberarchy decomposition is a kind of improved ID3 algorithm. It splits the training set by choosing different key attributes in different layers according to the correlation between classes and attributes. Compared with traditional ID3 algorithm, its rules are simpler and more general. This paper uses the hiberarchy decomposition methods as well as the C4.5 algorithm and makes some adjustments to deal with the recognition of off-line handwritten Chinese character by constructing a multi-level decision tree. At last, get a scheme of rough classification and analyze the results with different attributes. Compared with the single decision tree, the decision tree based on hiberarchy decomposition has more advantages when dealing with the multi-class problem. Experiment results show that this new method has better accuracy rate.
{"title":"Recognition of Off-Line Handwritten Chinese Character by Using Decision Tree Based on Hiberarchy Decomposition","authors":"Dong Liu, Xiangnian Huang","doi":"10.1109/ICACC.2009.21","DOIUrl":"https://doi.org/10.1109/ICACC.2009.21","url":null,"abstract":"Decision tree based on hiberarchy decomposition is a kind of improved ID3 algorithm. It splits the training set by choosing different key attributes in different layers according to the correlation between classes and attributes. Compared with traditional ID3 algorithm, its rules are simpler and more general. This paper uses the hiberarchy decomposition methods as well as the C4.5 algorithm and makes some adjustments to deal with the recognition of off-line handwritten Chinese character by constructing a multi-level decision tree. At last, get a scheme of rough classification and analyze the results with different attributes. Compared with the single decision tree, the decision tree based on hiberarchy decomposition has more advantages when dealing with the multi-class problem. Experiment results show that this new method has better accuracy rate.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115192518","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}
Distributed denial of service (DDoS) attacks have become a major threat to organizations and especially to internet and intranet. In DDoS attacks targets are overwhelmed by sending an enormous amount of traffic from a number of attack sites. The major tasks of any defense system are to detect these attacks accurately and early on, before it causes an unrecoverable loss. Most of the research in this regard has been focused on the detection techniques without exploiting spatial placement of detection system in a network. The ideal way to completely eliminate the DDoS threat is to run detection mechanism on every node in the network, which is not a practical solution. In this paper, we focus on the optimized placement of detection nodes in a network for distributed detection of DDoS attacks, which not only minimize the number of these node required but also reduce the cost, processing overheads and larger delays in identifying an attack. We examine the placement problem of finding a minimum cardinality set of nodes to detect DDoS attacks such that no attack traffic can reach the target without being monitored by these sensors. The placement problem is formulated as set packing.
{"title":"Optimal Placement of Detection Nodes against Distributed Denial of Service Attack","authors":"M. Islam, Kamran Nadeem, S. Khan","doi":"10.1109/ICACC.2009.114","DOIUrl":"https://doi.org/10.1109/ICACC.2009.114","url":null,"abstract":"Distributed denial of service (DDoS) attacks have become a major threat to organizations and especially to internet and intranet. In DDoS attacks targets are overwhelmed by sending an enormous amount of traffic from a number of attack sites. The major tasks of any defense system are to detect these attacks accurately and early on, before it causes an unrecoverable loss. Most of the research in this regard has been focused on the detection techniques without exploiting spatial placement of detection system in a network. The ideal way to completely eliminate the DDoS threat is to run detection mechanism on every node in the network, which is not a practical solution. In this paper, we focus on the optimized placement of detection nodes in a network for distributed detection of DDoS attacks, which not only minimize the number of these node required but also reduce the cost, processing overheads and larger delays in identifying an attack. We examine the placement problem of finding a minimum cardinality set of nodes to detect DDoS attacks such that no attack traffic can reach the target without being monitored by these sensors. The placement problem is formulated as set packing.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122466810","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}
The technology of Near-infrared Spectroscopy analysis plays a very important role in quality detection of farm produce. This thesis analyzed grainy wheat quality with 900nm-1700nm wave raster near-infrared spectroscopy analysis system, filtered signal with wavelet packet analyses system, disposed signal with second order differential equipment, built and contrasted models of Partial Least Square (PLS) and Support Vector Machines (SVM). The results showed that the Near-infrared Spectroscopy analysis system can suit farm produce quality analysis well.
{"title":"Study on Near-infrared Spectroscopy Signal Pre-processing and Model Building","authors":"Zhang Xiaochao, Z. Yinqiao, Wang Hui","doi":"10.1109/ICACC.2009.23","DOIUrl":"https://doi.org/10.1109/ICACC.2009.23","url":null,"abstract":"The technology of Near-infrared Spectroscopy analysis plays a very important role in quality detection of farm produce. This thesis analyzed grainy wheat quality with 900nm-1700nm wave raster near-infrared spectroscopy analysis system, filtered signal with wavelet packet analyses system, disposed signal with second order differential equipment, built and contrasted models of Partial Least Square (PLS) and Support Vector Machines (SVM). The results showed that the Near-infrared Spectroscopy analysis system can suit farm produce quality analysis well.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121835613","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}
Making full use of phase of separate channel and different echo information, array self-calibration of high-resolution was realized with the method of resolving equations for the nonlinear array of surface wave radar in this paper. The algorithm reduces computational quantity because which does not need to search optimal results, so it can be used for real-time tracking system. On the end of this paper, in spite of low SNR echoes and short data series for analyzing, experiments show the validity of this method and the applicability for practical projects.
{"title":"A New Method of Self-Calibration for Surface Wave Radar Antenna","authors":"Zhong Zhi-feng, Huang Jian","doi":"10.1109/ICACC.2009.87","DOIUrl":"https://doi.org/10.1109/ICACC.2009.87","url":null,"abstract":"Making full use of phase of separate channel and different echo information, array self-calibration of high-resolution was realized with the method of resolving equations for the nonlinear array of surface wave radar in this paper. The algorithm reduces computational quantity because which does not need to search optimal results, so it can be used for real-time tracking system. On the end of this paper, in spite of low SNR echoes and short data series for analyzing, experiments show the validity of this method and the applicability for practical projects.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"24 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116829977","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}
As the fuel price is the 2nd largest costs, in airline industry, it has become a real challenge recently to be decreased. While there are many factors contributing to this, Load & Balance plays an important role in the scene. TRIMA our recently-patented software can uniquely improve the Center of Gravity Management and increase the fuel efficiency sharply. It has been realized by means of Delphi in 18 months, with more than 180 thousand lines, and can be joined to Surface Thermometer and our recently made Cargo Handling Robots. A decrease, as great as 2 %, in overall fuel consumption was shown in our testing results over a year time.
{"title":"The Role of High-Tech TRIMA Software in B747-400 Fuel & Performance Efficiency","authors":"Arman Rezaee, M. Amin, J. Nazari","doi":"10.1109/ICACC.2009.34","DOIUrl":"https://doi.org/10.1109/ICACC.2009.34","url":null,"abstract":"As the fuel price is the 2nd largest costs, in airline industry, it has become a real challenge recently to be decreased. While there are many factors contributing to this, Load & Balance plays an important role in the scene. TRIMA our recently-patented software can uniquely improve the Center of Gravity Management and increase the fuel efficiency sharply. It has been realized by means of Delphi in 18 months, with more than 180 thousand lines, and can be joined to Surface Thermometer and our recently made Cargo Handling Robots. A decrease, as great as 2 %, in overall fuel consumption was shown in our testing results over a year time.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129436511","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}
A novel user equilibrium traffic assignment model in view of the drivers' different familiar levels with the network is presented in this paper. In the model, drivers are divided into classes according as their knowledge about the network traffic condition and travel-decision characteristics are the same within each class, but differ among classes. Some new concepts, such as OD perceived cost and familiar level with the traffic condition, are introduced based on $alpha-$cut of fuzzy set. The equilibrium principle is defined based on the similarity measure and can be regarded as a generalization of Wardrop's user equilibrium (UE). A proposed numerical example show that the new model obtains more realistic results than the other two models, UE and SUE.
{"title":"New Multiclass Traffic Equilibrium Assignment Model with Similarity Measure","authors":"Xingdong Deng, Xiaoceng Wu, Jian-min Xu","doi":"10.1109/ICACC.2009.68","DOIUrl":"https://doi.org/10.1109/ICACC.2009.68","url":null,"abstract":"A novel user equilibrium traffic assignment model in view of the drivers' different familiar levels with the network is presented in this paper. In the model, drivers are divided into classes according as their knowledge about the network traffic condition and travel-decision characteristics are the same within each class, but differ among classes. Some new concepts, such as OD perceived cost and familiar level with the traffic condition, are introduced based on $alpha-$cut of fuzzy set. The equilibrium principle is defined based on the similarity measure and can be regarded as a generalization of Wardrop's user equilibrium (UE). A proposed numerical example show that the new model obtains more realistic results than the other two models, UE and SUE.","PeriodicalId":380837,"journal":{"name":"2009 International Conference on Advanced Computer Control","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121334057","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
扫码关注我们
求助内容：
应助结果提醒方式：