Pub Date : 2008-07-13DOI: 10.1109/INDIN.2008.4618115
M. Khalgui, H. Hanisch
This paper deals with the temporal verification and assignment into the execution environment of reconfigurable control systems following the component based international industrial standard IEC61499. A function block (denoted by FB) is an event triggered component owning data and a reconfigurable control application is specified by different FB networks such as each one has to be automatically loaded in memory when a particular reconfiguration scenario is followed. To verify the whole temporal behavior of the system, we check the feasibility of each FB network corresponding to a possible reconfiguration scenario by exploring reachability graphs which will be transformed into OS tasks of the execution environment. Therefore, the reconfigurable system is assigned into different sets of OS tasks such as each set corresponds to a particular reconfiguration scenario. We developed the tool X-Reconfig supporting the paper contribution that we apply on the FESTO production system available in our laboratory at the Martin Luther University.
{"title":"An execution semantic for reconfigurable manufacturing systems","authors":"M. Khalgui, H. Hanisch","doi":"10.1109/INDIN.2008.4618115","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618115","url":null,"abstract":"This paper deals with the temporal verification and assignment into the execution environment of reconfigurable control systems following the component based international industrial standard IEC61499. A function block (denoted by FB) is an event triggered component owning data and a reconfigurable control application is specified by different FB networks such as each one has to be automatically loaded in memory when a particular reconfiguration scenario is followed. To verify the whole temporal behavior of the system, we check the feasibility of each FB network corresponding to a possible reconfiguration scenario by exploring reachability graphs which will be transformed into OS tasks of the execution environment. Therefore, the reconfigurable system is assigned into different sets of OS tasks such as each set corresponds to a particular reconfiguration scenario. We developed the tool X-Reconfig supporting the paper contribution that we apply on the FESTO production system available in our laboratory at the Martin Luther University.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115401872","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 : 2008-07-13DOI: 10.1109/INDIN.2008.4618164
Wang Dong, Chen Shengjian, Zhang Yan, Chen Jian
Based on hierarchical-detection model, combined with the existing fault isolation strategies and the entropy theory, the essential of fault isolation process is expounded in this paper. It is concluded that the diagnostic strategies optimizing process is a dynamic test choice process, in order to get optimized fault isolation strategies, dynamic system entropy reduction should be considered, which is consists of failure candidates components variation and test selection. Then, based on this, a dynamic-entropy algorithm for the fault isolation is proposed. By the examination and analysis, the method is simple and could perform effective and fast fault isolation.
{"title":"A dynamic-entropy algorithm for fault isolation","authors":"Wang Dong, Chen Shengjian, Zhang Yan, Chen Jian","doi":"10.1109/INDIN.2008.4618164","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618164","url":null,"abstract":"Based on hierarchical-detection model, combined with the existing fault isolation strategies and the entropy theory, the essential of fault isolation process is expounded in this paper. It is concluded that the diagnostic strategies optimizing process is a dynamic test choice process, in order to get optimized fault isolation strategies, dynamic system entropy reduction should be considered, which is consists of failure candidates components variation and test selection. Then, based on this, a dynamic-entropy algorithm for the fault isolation is proposed. By the examination and analysis, the method is simple and could perform effective and fast fault isolation.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114771187","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 : 2008-07-13DOI: 10.1109/INDIN.2008.4618236
P. Radcliffe
Simulation of real systems such as communications protocols can prove a system will work before any implementation, and test all possible operational states faster and more cheaply than could be achieved with a real physical system. This checking is usually performed by creating a reachability tree that shows all possible outcomes starting from one initial state and checking that all sequences result in an acceptable outcome. Examining the full reachability tree of a system described by Finite State Machines (FSMs) or Petri nets can guarantee the discovery of all incorrect behavior, but can take excessive computing time. Unfolding the reachability tree of a system described by Petri nets has been shown to dramatically reduce the simulation time. This paper shows several advantages if this unfolding is applied to an FSM model of a system instead. Such an approach allows fast discovery of deadlock, and livelock caused by true livelock or by unfairness in the simulation The unfolding method is extended to show how a system can be tested for all possible ldquounexpected inputsrdquo and ldquoany initial staterdquo, both of which are essential when analyzing the robustness of real world protocols. The method is applied to a communications protocol called 2-wire TIA where the simulation speed up was estimated to be a factor of 1.8 billion.
{"title":"Unfolding enhancements speed FSM based simulation","authors":"P. Radcliffe","doi":"10.1109/INDIN.2008.4618236","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618236","url":null,"abstract":"Simulation of real systems such as communications protocols can prove a system will work before any implementation, and test all possible operational states faster and more cheaply than could be achieved with a real physical system. This checking is usually performed by creating a reachability tree that shows all possible outcomes starting from one initial state and checking that all sequences result in an acceptable outcome. Examining the full reachability tree of a system described by Finite State Machines (FSMs) or Petri nets can guarantee the discovery of all incorrect behavior, but can take excessive computing time. Unfolding the reachability tree of a system described by Petri nets has been shown to dramatically reduce the simulation time. This paper shows several advantages if this unfolding is applied to an FSM model of a system instead. Such an approach allows fast discovery of deadlock, and livelock caused by true livelock or by unfairness in the simulation The unfolding method is extended to show how a system can be tested for all possible ldquounexpected inputsrdquo and ldquoany initial staterdquo, both of which are essential when analyzing the robustness of real world protocols. The method is applied to a communications protocol called 2-wire TIA where the simulation speed up was estimated to be a factor of 1.8 billion.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115069234","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 : 2008-07-13DOI: 10.1109/INDIN.2008.4618258
Xinping Yan, Qiaohui Guo, Yongming Yang
In this paper, a wavelet network for the Electrocardiograph (ECG) data compression and the selection of its wavelet neuron are presented. The methods of the frequency-domain matching and the orthogonal least square (OLS) algorithm in selecting the wavelet basis and its quantity were discussed. We choose Morlet wavelet as the mother wavelet, and use the ECG signal for simulation. The result demonstrates that the number of Morlet wavelets whose spectrums locating at the ECG is up to 152. But after filtrated by the OLS algorithm, it reduces sharply. This method can make the size of the wavelet network driving to optimum and reduce the training time of the wavelet network significantly. The algorithm also can reconstruct the ECG signal very well. The results of simulation indicate that it can reflect the location and intensity of all waves correctly. Consequently, the algorithm has higher compression ratio and fidelity.
{"title":"Wavelet neuron selection method for ECG data compression","authors":"Xinping Yan, Qiaohui Guo, Yongming Yang","doi":"10.1109/INDIN.2008.4618258","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618258","url":null,"abstract":"In this paper, a wavelet network for the Electrocardiograph (ECG) data compression and the selection of its wavelet neuron are presented. The methods of the frequency-domain matching and the orthogonal least square (OLS) algorithm in selecting the wavelet basis and its quantity were discussed. We choose Morlet wavelet as the mother wavelet, and use the ECG signal for simulation. The result demonstrates that the number of Morlet wavelets whose spectrums locating at the ECG is up to 152. But after filtrated by the OLS algorithm, it reduces sharply. This method can make the size of the wavelet network driving to optimum and reduce the training time of the wavelet network significantly. The algorithm also can reconstruct the ECG signal very well. The results of simulation indicate that it can reflect the location and intensity of all waves correctly. Consequently, the algorithm has higher compression ratio and fidelity.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121682501","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 : 2008-07-13DOI: 10.1109/INDIN.2008.4618254
Sehyeong Cho, Chulan Ren
This paper proposes to adopt the goal-oriented computing as a paradigm of computing and software development for industrial ubiquitous computing. We analyze several planning techniques and conclude that partial conditional HTN is most appropriate for goal-oriented computing within the pervasive industrial environment, in view of software engineering. We propose the language and algorithm required for such goal-oriented computing.
{"title":"Using goal-oriented paradigm for community computing","authors":"Sehyeong Cho, Chulan Ren","doi":"10.1109/INDIN.2008.4618254","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618254","url":null,"abstract":"This paper proposes to adopt the goal-oriented computing as a paradigm of computing and software development for industrial ubiquitous computing. We analyze several planning techniques and conclude that partial conditional HTN is most appropriate for goal-oriented computing within the pervasive industrial environment, in view of software engineering. We propose the language and algorithm required for such goal-oriented computing.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121990462","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 : 2008-07-13DOI: 10.1007/978-3-540-85930-7_13
Guihua Hu, Wenhua Zhu, Tao Yu, Jin Yuan
{"title":"Numerical simulation and experimental study of liquid-solid two-phase flow in nozzle of DIA Jet","authors":"Guihua Hu, Wenhua Zhu, Tao Yu, Jin Yuan","doi":"10.1007/978-3-540-85930-7_13","DOIUrl":"https://doi.org/10.1007/978-3-540-85930-7_13","url":null,"abstract":"","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123856740","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 : 2008-07-13DOI: 10.1109/INDIN.2008.4618127
Zeng Bi, Yang Yimin, Yuan Wei
In view of the environment uncertainty of mobile robot navigating under the unknown and dynamic environments, the paper adopts hierarchical path planning ways which is two layers of global and the local optimization have been combined to implement autonomous mobile robot navigating. The genetic algorithm and the fuzzy theory were applied in the two layers separately, the genetic annealing algorithm is used to global path planning, and the hierarchical fuzzy coordinated strategy is used to local optimization procedure. It results in fewer rules, as well as much simplified and flexible design where new behaviors can be added easily. The simulation experiments indicate the effectiveness of the proposed methods.
{"title":"Hierarchical path planning approach for mobile robot navigation under the dynamic environment","authors":"Zeng Bi, Yang Yimin, Yuan Wei","doi":"10.1109/INDIN.2008.4618127","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618127","url":null,"abstract":"In view of the environment uncertainty of mobile robot navigating under the unknown and dynamic environments, the paper adopts hierarchical path planning ways which is two layers of global and the local optimization have been combined to implement autonomous mobile robot navigating. The genetic algorithm and the fuzzy theory were applied in the two layers separately, the genetic annealing algorithm is used to global path planning, and the hierarchical fuzzy coordinated strategy is used to local optimization procedure. It results in fewer rules, as well as much simplified and flexible design where new behaviors can be added easily. The simulation experiments indicate the effectiveness of the proposed methods.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123397019","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 : 2008-07-13DOI: 10.1109/INDIN.2008.4618253
Xiao-hu Zhao, Ke-ke Zhao
This paper studied on time series prediction, and proposes a new prediction algorithm of LS-SVM online learning against the shortcomings in the traditional online learning with least squares support vector machine. This algorithm was researched and used in coal mine gas prediction and had proved effective, compared with the actual data and other relative algorithms.
{"title":"Study of a new online Least Squares Support Vector Machine algorithm in gas prediction","authors":"Xiao-hu Zhao, Ke-ke Zhao","doi":"10.1109/INDIN.2008.4618253","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618253","url":null,"abstract":"This paper studied on time series prediction, and proposes a new prediction algorithm of LS-SVM online learning against the shortcomings in the traditional online learning with least squares support vector machine. This algorithm was researched and used in coal mine gas prediction and had proved effective, compared with the actual data and other relative algorithms.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124010347","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 : 2008-07-13DOI: 10.1109/INDIN.2008.4618260
Fei Gao, Jujang Lee
In this paper, a novel chaos control approach by differential evolution (DE) algorithm is proposed to control the inherent chaotic phenomenon in genetic algorithms. Firstly the new approach detects the dynamical behaviors of a new discrete chaos system with rational fraction in GA such as the extreme values and unstable periodic points. Secondly it directs the chaotic system to its unstable fix point from any initial point by global controlling factors {Uk} solved self-adaptively by DE. Thirdly it proposes a multi-model solution for chaos control through DE to stabilize the system on its unstable fix point. Simulation results are further presented to show the effectiveness and performance of the put method.
{"title":"A new approach in discrete chaos system control by differential evolution Algorithm","authors":"Fei Gao, Jujang Lee","doi":"10.1109/INDIN.2008.4618260","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618260","url":null,"abstract":"In this paper, a novel chaos control approach by differential evolution (DE) algorithm is proposed to control the inherent chaotic phenomenon in genetic algorithms. Firstly the new approach detects the dynamical behaviors of a new discrete chaos system with rational fraction in GA such as the extreme values and unstable periodic points. Secondly it directs the chaotic system to its unstable fix point from any initial point by global controlling factors {Uk} solved self-adaptively by DE. Thirdly it proposes a multi-model solution for chaos control through DE to stabilize the system on its unstable fix point. Simulation results are further presented to show the effectiveness and performance of the put method.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129775942","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 : 2008-07-13DOI: 10.1109/INDIN.2008.4618303
Dejun Chen, Heng Huang, C. Ji
The basic work process of virtual enterprise was extracted by analyzing the general process of the organization and operation of virtual enterprise in this paper. The method of large-scale workflow network be decomposed into small-scale workflow network was put forward through the introduction of SWF-net theory. Taking the collaborative product design and manufacturing in manufacturing virtual enterprise as an example, the workflow network was modeled and decomposed by using of workflow analysis method based on SWF-net, and the soundness of sub-workflow networks and joint workflow network were analyzed. This workflow analysis method provides a solution for the analysis of large-scale virtual enterprise workflow, which has great theoretical and practical significance.
{"title":"Research on the SWF-net-based modeling technology of Virtual Enterprise workflow","authors":"Dejun Chen, Heng Huang, C. Ji","doi":"10.1109/INDIN.2008.4618303","DOIUrl":"https://doi.org/10.1109/INDIN.2008.4618303","url":null,"abstract":"The basic work process of virtual enterprise was extracted by analyzing the general process of the organization and operation of virtual enterprise in this paper. The method of large-scale workflow network be decomposed into small-scale workflow network was put forward through the introduction of SWF-net theory. Taking the collaborative product design and manufacturing in manufacturing virtual enterprise as an example, the workflow network was modeled and decomposed by using of workflow analysis method based on SWF-net, and the soundness of sub-workflow networks and joint workflow network were analyzed. This workflow analysis method provides a solution for the analysis of large-scale virtual enterprise workflow, which has great theoretical and practical significance.","PeriodicalId":112553,"journal":{"name":"2008 6th IEEE International Conference on Industrial Informatics","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130981684","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
扫码关注我们
求助内容：
应助结果提醒方式：