Pub Date : 2011-06-23DOI: 10.1109/INES.2011.5954768
D. Krokavec, A. Filasová, V. Hladký
One principle for designing fuzzy-observer-based fault residual generators for one class of continuous-time nonlinear MIMO system is treated in this paper. The problem addressed can be indicated as an approach given sufficient conditions for residual generator design based on fuzzy system state observers. The conditions are outlined in the terms of linear matrix inequalities to possess a stable structure closest to optimal asymptotic properties. Simulation results illustrate the design procedures and demonstrate the performance of the proposed residual generator.
{"title":"Design of stable fuzzy-observer-based residual generators for a class of nonlinear systems","authors":"D. Krokavec, A. Filasová, V. Hladký","doi":"10.1109/INES.2011.5954768","DOIUrl":"https://doi.org/10.1109/INES.2011.5954768","url":null,"abstract":"One principle for designing fuzzy-observer-based fault residual generators for one class of continuous-time nonlinear MIMO system is treated in this paper. The problem addressed can be indicated as an approach given sufficient conditions for residual generator design based on fuzzy system state observers. The conditions are outlined in the terms of linear matrix inequalities to possess a stable structure closest to optimal asymptotic properties. Simulation results illustrate the design procedures and demonstrate the performance of the proposed residual generator.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"53 21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115156429","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 : 2011-06-23DOI: 10.1109/INES.2011.5954745
C. Pozna, R. Precup
The paper gives new results related to the abduction process modeling. The results are based on a strategy that ensures, in minimum steps, the evidence necessary to deduce the correct hypothesis. An example that deals with two agents (robots), the Master and the Apprentice, that build a configuration of bricks, is inserted to exemplify the minimum length solution algorithm. The process of problem definition in this example involves both agents, and the cooperation between the agents is formalized in terms of decision trees.
{"title":"New results in abduction process modeling","authors":"C. Pozna, R. Precup","doi":"10.1109/INES.2011.5954745","DOIUrl":"https://doi.org/10.1109/INES.2011.5954745","url":null,"abstract":"The paper gives new results related to the abduction process modeling. The results are based on a strategy that ensures, in minimum steps, the evidence necessary to deduce the correct hypothesis. An example that deals with two agents (robots), the Master and the Apprentice, that build a configuration of bricks, is inserted to exemplify the minimum length solution algorithm. The process of problem definition in this example involves both agents, and the cooperation between the agents is formalized in terms of decision trees.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125816563","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 : 2011-06-23DOI: 10.1109/INES.2011.5954732
T. Sari, V. Cakir, S. Kilic, E. Ece
Basic elements of project planning are activity scheduling and resource allocation. In this study, meta-heuristic methods reviewed as an appropriate solution tool for resource-constrained project scheduling problem and the success of two meta-heuristic methods discussed. Resource constrained project scheduling problem which is an NP-hard problem solved with scatter search and genetic algorithm. Both algorithms do not disrupt the feasible search space during population generation. Algorithms compared in terms of resulting time and working principles.
{"title":"Evaluation of scatter search and genetic algorithm at resource constrained project scheduling problems","authors":"T. Sari, V. Cakir, S. Kilic, E. Ece","doi":"10.1109/INES.2011.5954732","DOIUrl":"https://doi.org/10.1109/INES.2011.5954732","url":null,"abstract":"Basic elements of project planning are activity scheduling and resource allocation. In this study, meta-heuristic methods reviewed as an appropriate solution tool for resource-constrained project scheduling problem and the success of two meta-heuristic methods discussed. Resource constrained project scheduling problem which is an NP-hard problem solved with scatter search and genetic algorithm. Both algorithms do not disrupt the feasible search space during population generation. Algorithms compared in terms of resulting time and working principles.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328823","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 : 2011-06-23DOI: 10.1109/INES.2011.5954779
Y. A. Durrani
In this paper, we present a power macromodeling technique for transistor level. The proposed technique is used to estimate the power dissipation on conventional metal-oxide-semiconductor (MOS) transistors. As the dynamic power is directly linked with the load capacitance (CL), it is also a lumped capacitance of all internal parasitic capacitances. In our model, we take an account of the parasitic capacitances with their dependence on channel width and the length. Suitable values of other factors (i.e. threshold voltage VT, gate voltage VGS, drain voltage VDD etc.) are used for the power consumption of the MOS transistors. The Preliminary results are effective and our macromodel provides the accurate power estimation.
{"title":"Power estimation technique for deep submicrometer conventional MOS transistors","authors":"Y. A. Durrani","doi":"10.1109/INES.2011.5954779","DOIUrl":"https://doi.org/10.1109/INES.2011.5954779","url":null,"abstract":"In this paper, we present a power macromodeling technique for transistor level. The proposed technique is used to estimate the power dissipation on conventional metal-oxide-semiconductor (MOS) transistors. As the dynamic power is directly linked with the load capacitance (CL), it is also a lumped capacitance of all internal parasitic capacitances. In our model, we take an account of the parasitic capacitances with their dependence on channel width and the length. Suitable values of other factors (i.e. threshold voltage VT, gate voltage VGS, drain voltage VDD etc.) are used for the power consumption of the MOS transistors. The Preliminary results are effective and our macromodel provides the accurate power estimation.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122317860","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 : 2011-06-23DOI: 10.1109/INES.2011.5954777
P. Semanco, V. Modrák
The paper introduces a proposal of three-metaheuristic versions to optimize flow-shop problem emphasized on total flow time criterion in Intelligent Manufacturing Systems. The approach employs constructive heuristic, namely CDS, Gupta's algorithm, and Palmer's Slope Index, in conjunction with GA-based metaheuristic. The approach is tested on Reeves' benchmark set of 21 flow-shop problems range from 20 to 75 jobs and 5 to 20 machines.
{"title":"Hybrid GA-based metaheuristics for production planning and scheduling optimization in intelligent flow-shop manufacturing systems","authors":"P. Semanco, V. Modrák","doi":"10.1109/INES.2011.5954777","DOIUrl":"https://doi.org/10.1109/INES.2011.5954777","url":null,"abstract":"The paper introduces a proposal of three-metaheuristic versions to optimize flow-shop problem emphasized on total flow time criterion in Intelligent Manufacturing Systems. The approach employs constructive heuristic, namely CDS, Gupta's algorithm, and Palmer's Slope Index, in conjunction with GA-based metaheuristic. The approach is tested on Reeves' benchmark set of 21 flow-shop problems range from 20 to 75 jobs and 5 to 20 machines.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128350158","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 : 2011-06-23DOI: 10.1109/INES.2011.5954720
L. Madarász, R. Andoga, L. Főző, T. Karol, J. Judičák
The paper deals with modeling and diagnostics of complex systems. In the area of modeling, the authors describe dynamic models of dependence of speed upon fuel flow supply of a small turbojet engine MPM-20. The first model is done with use of neural networks and the second is a linear model. Both models are then methodologically incorporated into the diagnostic and backup system of the optical sensor measuring the speed of the engine.
{"title":"Implementation of the majority method for engine speed diagnostics of the turbojet engine MPM-20","authors":"L. Madarász, R. Andoga, L. Főző, T. Karol, J. Judičák","doi":"10.1109/INES.2011.5954720","DOIUrl":"https://doi.org/10.1109/INES.2011.5954720","url":null,"abstract":"The paper deals with modeling and diagnostics of complex systems. In the area of modeling, the authors describe dynamic models of dependence of speed upon fuel flow supply of a small turbojet engine MPM-20. The first model is done with use of neural networks and the second is a linear model. Both models are then methodologically incorporated into the diagnostic and backup system of the optical sensor measuring the speed of the engine.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121410154","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 : 2011-06-23DOI: 10.1109/INES.2011.5954739
G. Hermann
The paper describes algorithms used for the determination of pitch distances in the calibration of optical scales. The algorithms are divided into two groups: the non-contextual and the contextual algorithms. The first group is used to calculate the position of the edges in the digital image captured by the camera is either based on the gradient or the so called Laplacian method without any prior knowledge of the shape of the object. The contextual group of algorithm make use of the of the a priori knowledge of the edge or shape. The information carried by gray level values of the pixels is used to reach subpixel resolution. As a result pixels are categorized as black, white or edge pixels. The algorithms in the second group calculate the centreline of the graduation or measuring line either using Gabor transformation or from the centre of gravity formed by the gray values of the individual pixels. The resistance of the algorithms to various distortions on the scale was investigated using real objects.
{"title":"Algorithms for pitch distance determination","authors":"G. Hermann","doi":"10.1109/INES.2011.5954739","DOIUrl":"https://doi.org/10.1109/INES.2011.5954739","url":null,"abstract":"The paper describes algorithms used for the determination of pitch distances in the calibration of optical scales. The algorithms are divided into two groups: the non-contextual and the contextual algorithms. The first group is used to calculate the position of the edges in the digital image captured by the camera is either based on the gradient or the so called Laplacian method without any prior knowledge of the shape of the object. The contextual group of algorithm make use of the of the a priori knowledge of the edge or shape. The information carried by gray level values of the pixels is used to reach subpixel resolution. As a result pixels are categorized as black, white or edge pixels. The algorithms in the second group calculate the centreline of the graduation or measuring line either using Gabor transformation or from the centre of gravity formed by the gray values of the individual pixels. The resistance of the algorithms to various distortions on the scale was investigated using real objects.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114072088","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 : 2011-06-23DOI: 10.1109/INES.2011.5954728
A. Riid, E. Rustern
This paper presents three very simple and computationally undemanding symbiotic algorithms for the identification of compact fuzzy rule-based classifiers from data. The problem of interpretability is specifically addressed, resulting in a conclusion that due to the characteristics of classification tasks a major well-known interpretability condition — distinguishability — can be discarded. It is shown that despite the interpretability-accuracy tradeoff, accuracy of identified classifiers stands out to comparison. All obtained properties can be very useful in practical problems. The proposed method is validated on Iris, Wine and Wisconsin Breast Cancer data sets.
{"title":"An integrated approach for the identification of compact, interpretable and accurate fuzzy rule-based classifiers from data","authors":"A. Riid, E. Rustern","doi":"10.1109/INES.2011.5954728","DOIUrl":"https://doi.org/10.1109/INES.2011.5954728","url":null,"abstract":"This paper presents three very simple and computationally undemanding symbiotic algorithms for the identification of compact fuzzy rule-based classifiers from data. The problem of interpretability is specifically addressed, resulting in a conclusion that due to the characteristics of classification tasks a major well-known interpretability condition — distinguishability — can be discarded. It is shown that despite the interpretability-accuracy tradeoff, accuracy of identified classifiers stands out to comparison. All obtained properties can be very useful in practical problems. The proposed method is validated on Iris, Wine and Wisconsin Breast Cancer data sets.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126434656","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 : 2011-06-23DOI: 10.1109/INES.2011.5954759
P. Várkonyi, D. Gontier, J. Burdick
Quasi-static robots supported by multiple contacts and Coulomb friction may be overturned by unwanted, arbitrarily small vibrations, under certain geometric conditions. The exact criteria of passive local dynamic stability for perfectly rigid objects (a natural idealization of robots) are currently unknown. In the present paper, we propose a minimalistic, robust, model-independent active stabilization scheme of planar objects via the manipulation of friction forces by wheels and brakes. The potential extensions of the new method to global stabilization, and to three dimensions are also discussed.
{"title":"Stabilization of rigid bodies with frictional supports against dynamic perturbations","authors":"P. Várkonyi, D. Gontier, J. Burdick","doi":"10.1109/INES.2011.5954759","DOIUrl":"https://doi.org/10.1109/INES.2011.5954759","url":null,"abstract":"Quasi-static robots supported by multiple contacts and Coulomb friction may be overturned by unwanted, arbitrarily small vibrations, under certain geometric conditions. The exact criteria of passive local dynamic stability for perfectly rigid objects (a natural idealization of robots) are currently unknown. In the present paper, we propose a minimalistic, robust, model-independent active stabilization scheme of planar objects via the manipulation of friction forces by wheels and brakes. The potential extensions of the new method to global stabilization, and to three dimensions are also discussed.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131588301","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 : 2011-06-23DOI: 10.1109/INES.2011.5954742
J. Zelenka
Currently, on optimization processes requirements focusing on several parameters are emphasized. Algorithms allowing to find an optimal (near-optimal) solution, are in most cases moving in the large area of possible solutions. Their running requires strong computational support and hunger solution programs to run on multi-core workstation, clusters, grid and clouds. In this article serial and parallel computing of the Job-Shop scheduling problem by using MATLAB distributed computing server is compared.
{"title":"Parallel computing application into the particle swarm optimization algorithm used to solve the Job-Shop scheduling problem","authors":"J. Zelenka","doi":"10.1109/INES.2011.5954742","DOIUrl":"https://doi.org/10.1109/INES.2011.5954742","url":null,"abstract":"Currently, on optimization processes requirements focusing on several parameters are emphasized. Algorithms allowing to find an optimal (near-optimal) solution, are in most cases moving in the large area of possible solutions. Their running requires strong computational support and hunger solution programs to run on multi-core workstation, clusters, grid and clouds. In this article serial and parallel computing of the Job-Shop scheduling problem by using MATLAB distributed computing server is compared.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130692654","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
扫码关注我们
求助内容：
应助结果提醒方式：