The complex network theory is applied to manufacturing, manufacturing of complex networks have been proposed fault model construction methods. According to the four different manufacturing network, based on the performance of a large number of experimental data of successive failure model is analyzed.
{"title":"Analysis and Research on Dynamic Models of Complex Manufacturing Network Cascading Failures","authors":"G. Zhan, Zhu Qingbo, Song Tingxin","doi":"10.1109/IHMSC.2014.101","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.101","url":null,"abstract":"The complex network theory is applied to manufacturing, manufacturing of complex networks have been proposed fault model construction methods. According to the four different manufacturing network, based on the performance of a large number of experimental data of successive failure model is analyzed.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115465412","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 wide deployment of flow monitoring in IP networks, flow data has been more and more applied on abnormal traffic detection. In practice, anomalies should be detected as fast as possible from giant quantity of flow data, while, at present, some classical anomalies detecting methods can not achieve this goal. In this paper, we propose and implement a distributed streaming computing system which aims to perform real-time anomalies detection by leveraging Apache Storm, a stream-computing platform. Based on this efficient system, we can uninterruptedly monitor the mutation of flow data and locate the source of anomalies or attacks in real-time by finding the specific abnormal IP addresses. A typical application example proved the capability and benefits of our system and we also have a detailed discussion in performance measurements and scalability.
{"title":"A Real-Time Anomalies Detection System Based on Streaming Technology","authors":"Y. Du, Jun Liu, Fang Liu, Luying Chen","doi":"10.1109/IHMSC.2014.168","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.168","url":null,"abstract":"With the wide deployment of flow monitoring in IP networks, flow data has been more and more applied on abnormal traffic detection. In practice, anomalies should be detected as fast as possible from giant quantity of flow data, while, at present, some classical anomalies detecting methods can not achieve this goal. In this paper, we propose and implement a distributed streaming computing system which aims to perform real-time anomalies detection by leveraging Apache Storm, a stream-computing platform. Based on this efficient system, we can uninterruptedly monitor the mutation of flow data and locate the source of anomalies or attacks in real-time by finding the specific abnormal IP addresses. A typical application example proved the capability and benefits of our system and we also have a detailed discussion in performance measurements and scalability.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125369147","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 Software license is an agreement between a user and the owner of a software program that permits a user to do certain things that would otherwise be an infringement of copyright law. Typically, a software license agreement is based on set of rules that a user has to comply with while using the software. Sometimes, the price of the software and licensing fees is also discussed in the licensing agreement, but usually it's described elsewhere. However, typically used catchphrases in software License Agreement make the text of the agreement complex for a common user. However, the people think it necessary to understand the Software License Agreement before they sign it. In this study we propose a system for automatic generation of catchphrases from software License Agreement to make interpretation of the agreement easy and straightforward.
{"title":"Automatic Extraction of Catchphrases from Software License Agreement","authors":"F. Zahoor, Imran Sarwar Bajwa","doi":"10.1109/IHMSC.2014.148","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.148","url":null,"abstract":"A Software license is an agreement between a user and the owner of a software program that permits a user to do certain things that would otherwise be an infringement of copyright law. Typically, a software license agreement is based on set of rules that a user has to comply with while using the software. Sometimes, the price of the software and licensing fees is also discussed in the licensing agreement, but usually it's described elsewhere. However, typically used catchphrases in software License Agreement make the text of the agreement complex for a common user. However, the people think it necessary to understand the Software License Agreement before they sign it. In this study we propose a system for automatic generation of catchphrases from software License Agreement to make interpretation of the agreement easy and straightforward.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126859540","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}
Aiming at the nonlinear of the dead zone of electro-hydraulic proportional valve controlled cylinder system, a self-regulating dynamic compensation algorithm is proposed in this paper. Firstly, the mathematical model of the system is established and the causes of the system dead zone are analyzed. Finally, a control algorithm which can self-regulate the amount of compensation from the dead zone is proposed and the experimental verification is finished. Also, the comparison between the experimental results and the traditional static compensation algorithm results is made. Experimental results show that, compared with the static compensation, the step response is greatly improved by using the dynamic compensation algorithm and the interference from the dead zone to system control is reduced. The target that system can be quickly located with high accuracy is achieved.
{"title":"A Self-Regulating Dynamic Compensation Algorithm for Electro-hydraulic Proportional Valve Controlled Cylinder System","authors":"Rui Mao, Xiwei Peng","doi":"10.1109/IHMSC.2014.195","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.195","url":null,"abstract":"Aiming at the nonlinear of the dead zone of electro-hydraulic proportional valve controlled cylinder system, a self-regulating dynamic compensation algorithm is proposed in this paper. Firstly, the mathematical model of the system is established and the causes of the system dead zone are analyzed. Finally, a control algorithm which can self-regulate the amount of compensation from the dead zone is proposed and the experimental verification is finished. Also, the comparison between the experimental results and the traditional static compensation algorithm results is made. Experimental results show that, compared with the static compensation, the step response is greatly improved by using the dynamic compensation algorithm and the interference from the dead zone to system control is reduced. The target that system can be quickly located with high accuracy is achieved.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"746 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122961587","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}
Nowadays, the partially observable Markov decision processes (POMDPs) is widely used in many fields. The solutions to POMDP suffer from prohibitive computational complexity due to curse of dimensionality, but MCVI for POMDP is envisioned as a promising approach to break the curse. Although MCVI is a great breakthrough toward solving this problem, it still has some defects, such as the slow convergence rate and the continuous growth of nodes' number of policy graph. To this end, the purpose of this paper is to provide a fast MCVI based on improved NSGA2. Different from the general NSGA2, the improved NSGA2 initializes the population by experiential knowledge and uses a self-adjustable value as the probability of cross and mutation. Before executing the MCVI, the algorithm will set a series of thresholds. When the algorithm gets a temporary policy graph which reaches one of the thresholds, it will use a discount operator to update the threshold and use the improved NSGA2 to update policy graph. After that, the algorithm will execute the MCVI again and repeat this process until the end. Numerical experiments show that the fast MCVI achieves about 8% increase in convergence rate over original MCVI, and about 60% decrease in nodes' number of policy graph, for the classic problem of corridor.
{"title":"Fast MCVI Based on Improved NSGA2","authors":"Yin Liu, Yingping Zhou, Shuai Chen","doi":"10.1109/IHMSC.2014.38","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.38","url":null,"abstract":"Nowadays, the partially observable Markov decision processes (POMDPs) is widely used in many fields. The solutions to POMDP suffer from prohibitive computational complexity due to curse of dimensionality, but MCVI for POMDP is envisioned as a promising approach to break the curse. Although MCVI is a great breakthrough toward solving this problem, it still has some defects, such as the slow convergence rate and the continuous growth of nodes' number of policy graph. To this end, the purpose of this paper is to provide a fast MCVI based on improved NSGA2. Different from the general NSGA2, the improved NSGA2 initializes the population by experiential knowledge and uses a self-adjustable value as the probability of cross and mutation. Before executing the MCVI, the algorithm will set a series of thresholds. When the algorithm gets a temporary policy graph which reaches one of the thresholds, it will use a discount operator to update the threshold and use the improved NSGA2 to update policy graph. After that, the algorithm will execute the MCVI again and repeat this process until the end. Numerical experiments show that the fast MCVI achieves about 8% increase in convergence rate over original MCVI, and about 60% decrease in nodes' number of policy graph, for the classic problem of corridor.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122053520","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}
For multi-UAV cooperative reconnaissance to enemy's multi-task points, because of multi-task, reasonable clustering is needed and the task clustering model should be established. In this paper, the task planning model is established according to task clustering of each UAV, and the sequence of task execution is determined. Reasonable task clustering optimization index is put forward. Task allocation is proposed based on improved K-means clustering algorithm of simulated annealing. The shortest path task planning is designed using the simulated annealing algorithm, which makes multi-UAV relatively balanced in the assignments, the task group in the group centralized distribution, inter-group distribution scattered and the total cruise time shortest. Simulation results show that the task clustering is well achieved and the optimum task planning program is obtained. The validity of the model and algorithm is verified and the algorithm has certain theoretical and practical value.
{"title":"Study on Multi-UAV Task Clustering and Task Planning in Cooperative Reconnaissance","authors":"Zhao Junwei, Zhao Jianjun","doi":"10.1109/IHMSC.2014.196","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.196","url":null,"abstract":"For multi-UAV cooperative reconnaissance to enemy's multi-task points, because of multi-task, reasonable clustering is needed and the task clustering model should be established. In this paper, the task planning model is established according to task clustering of each UAV, and the sequence of task execution is determined. Reasonable task clustering optimization index is put forward. Task allocation is proposed based on improved K-means clustering algorithm of simulated annealing. The shortest path task planning is designed using the simulated annealing algorithm, which makes multi-UAV relatively balanced in the assignments, the task group in the group centralized distribution, inter-group distribution scattered and the total cruise time shortest. Simulation results show that the task clustering is well achieved and the optimum task planning program is obtained. The validity of the model and algorithm is verified and the algorithm has certain theoretical and practical value.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117086843","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 main steam temperature of power plant is a time-varying, large time delay and big interference thermodynamic objects. It is difficult to control the temperature of the supercritical main steam efficiently through the traditional PID control scheme. A fuzzy-PID control scheme is proposed in this paper. The proposed main steam temperature control system based on fuzzy-PID control scheme was built with Simulink blocks and verified by the simulation results. The simulation results indicate that the proposed fuzzy-PID control scheme can work well and achieve better performances than traditional cascade PID control scheme.
{"title":"Main Steam Temperature Control System Based on Fuzzy Control Scheme","authors":"Hongyu Wang","doi":"10.1109/IHMSC.2014.125","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.125","url":null,"abstract":"The main steam temperature of power plant is a time-varying, large time delay and big interference thermodynamic objects. It is difficult to control the temperature of the supercritical main steam efficiently through the traditional PID control scheme. A fuzzy-PID control scheme is proposed in this paper. The proposed main steam temperature control system based on fuzzy-PID control scheme was built with Simulink blocks and verified by the simulation results. The simulation results indicate that the proposed fuzzy-PID control scheme can work well and achieve better performances than traditional cascade PID control scheme.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"456 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124550902","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}
Harmonic drive (HD) systems benefit from their high transmission ratio and extremely low transmission error, therefore, they are widely applied to robotic and space sciences. High stable HD gains pupolarity in space drive mechanism. Flexspline plays an important role in HD, however, the high stable HD has a special flexspline different from the conventional one. The requirement of weight and volume is strict for space agencies, and hence it is necessary to optimize the structural dimensions of the special flexspline. This paper presents an optimization of the different flexspline by using response surface method. A finite element equivalent model of the flexspline was built. In addition, the optimized design points and response surface were provided to achieve an optimum flexspline, and Von-Mises stress sensitivity was obtained. Those lead to the conclusion that response surface method is effective when used to design the flexspline.
{"title":"Optimization Design of High Stable Flexspline for Harmonic Drive System","authors":"Jutao Wang, Chunjie Wang","doi":"10.1109/IHMSC.2014.56","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.56","url":null,"abstract":"Harmonic drive (HD) systems benefit from their high transmission ratio and extremely low transmission error, therefore, they are widely applied to robotic and space sciences. High stable HD gains pupolarity in space drive mechanism. Flexspline plays an important role in HD, however, the high stable HD has a special flexspline different from the conventional one. The requirement of weight and volume is strict for space agencies, and hence it is necessary to optimize the structural dimensions of the special flexspline. This paper presents an optimization of the different flexspline by using response surface method. A finite element equivalent model of the flexspline was built. In addition, the optimized design points and response surface were provided to achieve an optimum flexspline, and Von-Mises stress sensitivity was obtained. Those lead to the conclusion that response surface method is effective when used to design the flexspline.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124579874","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 order to meet the demands of centralized processing and evaluation of training data from multi target-scoring systems under a background of large-scale military training in digital range, a multi-grade remote target-scoring systems is proposed based on integration of McWiLL and RS-485 Networks. A multithreaded remote control and data exchange are achieved by using TCP/IP and McWiLL technology. Synchronous data sharing is realized by using multi-machine control in RS-485 network. The requirements of remote monitoring and automatic evaluation as well as centralized display are met in live-ammunition training. Based on this system, to realize remote monitoring and location under the salvo bomb mode, a image processing algorithm based on time division and epipolar constraint is raised based on the characteristics of multi-explosion points and the same characteristics.
{"title":"Research on Explosion Points Location of Remote Target-Scoring Systems Based on McWiLL and RS-485 Networks","authors":"Wang Xin, Feng Dengchao, Zhang Jie, Y. Fangfang","doi":"10.1109/IHMSC.2014.188","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.188","url":null,"abstract":"In order to meet the demands of centralized processing and evaluation of training data from multi target-scoring systems under a background of large-scale military training in digital range, a multi-grade remote target-scoring systems is proposed based on integration of McWiLL and RS-485 Networks. A multithreaded remote control and data exchange are achieved by using TCP/IP and McWiLL technology. Synchronous data sharing is realized by using multi-machine control in RS-485 network. The requirements of remote monitoring and automatic evaluation as well as centralized display are met in live-ammunition training. Based on this system, to realize remote monitoring and location under the salvo bomb mode, a image processing algorithm based on time division and epipolar constraint is raised based on the characteristics of multi-explosion points and the same characteristics.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124647954","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 actual industrial systems are usually high order system with long time delay. These characteristics will bring a lot of troubles in building the models. Sometimes we need to know the pure delay of the system when designing the controller and at the same time we hope the model has low order. The traditional methods like unit step response and pade approximation to estimate time delay have some limitations. In this paper, we will use LMS(Least mean square) adaptive method to estimate time delay first and then use ARMAX model to reduced the order. The simulation has been conducted using the actual industrial data. The industrial system's order is very high even can reach 30 while we want to use this new method to reduce its order to about 10. At last, by comparing the performance index of 3 models, we prove this method can achieve the desired purpose.
{"title":"The Application of LMS Adaptive Method in Time Delay Estimation for Order Reduction Identification","authors":"Pu Wang, Hongxin Li, Yancun Leng, Zhaohui Qiao","doi":"10.1109/IHMSC.2014.169","DOIUrl":"https://doi.org/10.1109/IHMSC.2014.169","url":null,"abstract":"The actual industrial systems are usually high order system with long time delay. These characteristics will bring a lot of troubles in building the models. Sometimes we need to know the pure delay of the system when designing the controller and at the same time we hope the model has low order. The traditional methods like unit step response and pade approximation to estimate time delay have some limitations. In this paper, we will use LMS(Least mean square) adaptive method to estimate time delay first and then use ARMAX model to reduced the order. The simulation has been conducted using the actual industrial data. The industrial system's order is very high even can reach 30 while we want to use this new method to reduce its order to about 10. At last, by comparing the performance index of 3 models, we prove this method can achieve the desired purpose.","PeriodicalId":370654,"journal":{"name":"2014 Sixth International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130587792","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
扫码关注我们
求助内容：
应助结果提醒方式：