Pub Date : 2019-02-01DOI: 10.1109/KBEI.2019.8734903
M. Navabi, N. Davoodi
In this paper focused on design of a second order sliding mode controller for a fixed wing airplane using real twisting algorithm. Simple sliding mode controller creates chattering in the system. Therefore, to avoid this problem, higher order sliding mode controllers as a robust controller is preferred. The design of this controller has two steps. At first, a suitable sliding manifold will be selected. Then, the controller is designed using real twisting algorithm which is a method for second order sliding mode controller design. In this algorithm the states of the system twist around the sliding surface and remain on it. Moreover, to compare the performance of the controller, a first order sliding mode controller is designed. Results demonstrate that, with real twisting method, states of the system converge to trim point in a finite time and system has good performance under this controller.
{"title":"Design of a Robust Controller Using Real Twisting Algorithm for a Fixed Wing Airplane","authors":"M. Navabi, N. Davoodi","doi":"10.1109/KBEI.2019.8734903","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8734903","url":null,"abstract":"In this paper focused on design of a second order sliding mode controller for a fixed wing airplane using real twisting algorithm. Simple sliding mode controller creates chattering in the system. Therefore, to avoid this problem, higher order sliding mode controllers as a robust controller is preferred. The design of this controller has two steps. At first, a suitable sliding manifold will be selected. Then, the controller is designed using real twisting algorithm which is a method for second order sliding mode controller design. In this algorithm the states of the system twist around the sliding surface and remain on it. Moreover, to compare the performance of the controller, a first order sliding mode controller is designed. Results demonstrate that, with real twisting method, states of the system converge to trim point in a finite time and system has good performance under this controller.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125333414","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8735001
Sara Nazififard, S. Jafari, H. Z. Matin, H. Yazdani
In learning contexts, gamification is a technique to motivate learners and enhance their participation in learning activities by applying game elements and components. But it still pays little attention to using gamification in Adult learning activities. Through a systematic literature review, this study investigates the literature on the motivational and behavioral theories underlying gamification in the context of learning to synthesize the essential factors to improve learning outcomes. This paper presents a conceptual model of gamification in a learning context. A theory-driven model was created in order to categorize into a multi-dimensional model. In addition, this model can be extended to any kind of games not only educational games because the whole gaming experience is based on the same theory as human learning. It originates from behavioral science and it has progressed well-stablished learning algorithm. By investigating and synthesizing the earlier studies and categorizing them in accordance with a contemporary approach, a conceptual model for gamification of adult learning has been proposed. Then in order to validate and test this theory-driven model should be implemented and tested in experimental studies involving organization employees.
{"title":"A Model for Utilizing the Potential of Gamification in Learning","authors":"Sara Nazififard, S. Jafari, H. Z. Matin, H. Yazdani","doi":"10.1109/KBEI.2019.8735001","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8735001","url":null,"abstract":"In learning contexts, gamification is a technique to motivate learners and enhance their participation in learning activities by applying game elements and components. But it still pays little attention to using gamification in Adult learning activities. Through a systematic literature review, this study investigates the literature on the motivational and behavioral theories underlying gamification in the context of learning to synthesize the essential factors to improve learning outcomes. This paper presents a conceptual model of gamification in a learning context. A theory-driven model was created in order to categorize into a multi-dimensional model. In addition, this model can be extended to any kind of games not only educational games because the whole gaming experience is based on the same theory as human learning. It originates from behavioral science and it has progressed well-stablished learning algorithm. By investigating and synthesizing the earlier studies and categorizing them in accordance with a contemporary approach, a conceptual model for gamification of adult learning has been proposed. Then in order to validate and test this theory-driven model should be implemented and tested in experimental studies involving organization employees.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126050762","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8735026
Razieh Moradi, H. Nezamabadi-pour, Mohadeseh Soleimanpour
In this paper, we propose a modified distributed bee algorithm (MDBA) for task allocation in a swarm of robots. In MDBA, a tournament selection mechanism is proposed to improve the selection ability of the algorithm. In the proposed scenario, task allocation is to assign the robots to the found targets in a 2-D arena. The expected distribution is obtained from the targets’ qualities that are represented as scalar values. We tested the scalability of the proposed MDBA algorithm in terms of number of robots and number of targets. The simulation results show that by increasing the robot swarm’s size, the distribution error is decreased. The results obtained confirm the ability of the proposed MDBA.
{"title":"Modified Distributed Bee Algorithm in Task Allocation of Swarm Robotic","authors":"Razieh Moradi, H. Nezamabadi-pour, Mohadeseh Soleimanpour","doi":"10.1109/KBEI.2019.8735026","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8735026","url":null,"abstract":"In this paper, we propose a modified distributed bee algorithm (MDBA) for task allocation in a swarm of robots. In MDBA, a tournament selection mechanism is proposed to improve the selection ability of the algorithm. In the proposed scenario, task allocation is to assign the robots to the found targets in a 2-D arena. The expected distribution is obtained from the targets’ qualities that are represented as scalar values. We tested the scalability of the proposed MDBA algorithm in terms of number of robots and number of targets. The simulation results show that by increasing the robot swarm’s size, the distribution error is decreased. The results obtained confirm the ability of the proposed MDBA.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121835816","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8735036
Arman Yanpi, M. Taheri
Multi label classification is a challenging task in machine learning concerned with assigning a sample to a subset of available label set. Meaning, a sample can belong to multiple labels. Furthermore, high dimensionality of data and complex correlation between labels makes it even more interesting. For this reason, it attracted many researchers in recent years. classifier-chains (CC), one of well-known methods for multi label classification which is based on binary relevance (BR) method, incorporates label correlation by assuming an order for labels and inserting previous label outputs in feature space and achieves higher performance while still retaining relatively low time complexity. But using predicted labels as features might not be very interpretable with regards to integrating label correlation into the model, especially considering there could be different types of features in a dataset. In this paper, we propose an approach for using correlation among labels based on structure of CC by defining a large-margin model between two predicted labels. Thus directly exploiting the correlation between them in a more interpretable way. The proposed approach is evaluated using 9 multi label datasets and 2 evaluation metrics. Empirical experiments show promising results and demonstrate the effectiveness of proposed method against classifier chains algorithm.
{"title":"A Large-Margin Approach for Multi-Label Classification Based on Correlation Between Labels","authors":"Arman Yanpi, M. Taheri","doi":"10.1109/KBEI.2019.8735036","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8735036","url":null,"abstract":"Multi label classification is a challenging task in machine learning concerned with assigning a sample to a subset of available label set. Meaning, a sample can belong to multiple labels. Furthermore, high dimensionality of data and complex correlation between labels makes it even more interesting. For this reason, it attracted many researchers in recent years. classifier-chains (CC), one of well-known methods for multi label classification which is based on binary relevance (BR) method, incorporates label correlation by assuming an order for labels and inserting previous label outputs in feature space and achieves higher performance while still retaining relatively low time complexity. But using predicted labels as features might not be very interpretable with regards to integrating label correlation into the model, especially considering there could be different types of features in a dataset. In this paper, we propose an approach for using correlation among labels based on structure of CC by defining a large-margin model between two predicted labels. Thus directly exploiting the correlation between them in a more interpretable way. The proposed approach is evaluated using 9 multi label datasets and 2 evaluation metrics. Empirical experiments show promising results and demonstrate the effectiveness of proposed method against classifier chains algorithm.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133218324","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8734918
R. Besharati, Mohammad Hossein Rezvani
One of the significant issues in fog computing environments is computation offloading. In order to do this process, the communications between the fog and cloud nodes should be investigated. In the literature, a great body of research exists in which the researchers proposed numerous optimization methods regard the subject of offloading in fog networks. These proposals have been implemented taking into account service level agreements (SLAs). In this paper, we propose an optimization method for modeling the interactions of offloading process using rich theory of microeconomics. We model the offloading interactions based on auction mechanism. Then, we modelled and formulated the communications between fog nodes and the cloud entity. Our model takes into account the specifications and limitations of the underlying physical infrastructure such as paths and capacity of each path. These paths are used during computation offloading operations. In our proposed auction economy, the bandwidth of physical links plays the role of the commodity. Finally, the auction is run between the cloud and fog nodes as provider and consumer respectively.
{"title":"A Prototype Auction-based Mechanism for Computation Offloading in Fog-cloud Environments","authors":"R. Besharati, Mohammad Hossein Rezvani","doi":"10.1109/KBEI.2019.8734918","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8734918","url":null,"abstract":"One of the significant issues in fog computing environments is computation offloading. In order to do this process, the communications between the fog and cloud nodes should be investigated. In the literature, a great body of research exists in which the researchers proposed numerous optimization methods regard the subject of offloading in fog networks. These proposals have been implemented taking into account service level agreements (SLAs). In this paper, we propose an optimization method for modeling the interactions of offloading process using rich theory of microeconomics. We model the offloading interactions based on auction mechanism. Then, we modelled and formulated the communications between fog nodes and the cloud entity. Our model takes into account the specifications and limitations of the underlying physical infrastructure such as paths and capacity of each path. These paths are used during computation offloading operations. In our proposed auction economy, the bandwidth of physical links plays the role of the commodity. Finally, the auction is run between the cloud and fog nodes as provider and consumer respectively.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133682538","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8735040
B. Mohammadi, J. Nourinia, C. Ghobadi, F. Alizadeh, Seyed Vahid Masuminia
A novel broadband reflectarray (RA) antenna for 3U CubeSat applications is investigated. A novel frequency selective surface (FSS) in the RA as ground plane for reducing radar cross section (RCS) and signals interference with other communication systems working in other frequency bands is applied. The RA divided to three panels and folded on the sides of the CubeSat to reduce the stowed volume. A novel circular polarization (CP) feed antenna with two stacked patches on two thick substrates with lossy dielectric constant is used to extend the 3dB axial ratio.
{"title":"Novel Broadband 3U CubeSat Reflectarray Antenna","authors":"B. Mohammadi, J. Nourinia, C. Ghobadi, F. Alizadeh, Seyed Vahid Masuminia","doi":"10.1109/KBEI.2019.8735040","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8735040","url":null,"abstract":"A novel broadband reflectarray (RA) antenna for 3U CubeSat applications is investigated. A novel frequency selective surface (FSS) in the RA as ground plane for reducing radar cross section (RCS) and signals interference with other communication systems working in other frequency bands is applied. The RA divided to three panels and folded on the sides of the CubeSat to reduce the stowed volume. A novel circular polarization (CP) feed antenna with two stacked patches on two thick substrates with lossy dielectric constant is used to extend the 3dB axial ratio.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114572753","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8735022
Sara Sadat Hoseininasab, Hooman Nikmehr
Decimal multiplication is one of the most extensively used and complex computations in many commercial and financial applications. This paper presents a novel design for a single constant decimal multiplier with constant coefficients of 10 to 19. The parallel generation of partial products is performed using BCD-8421 or BCD-4221 encodings. Decimal multioperand addition has been used for partial product reduction stage. Also, a redundant to none-redundant converter for the last stage of the multiplier is proposed. To evaluate the architecture, a VHDL model is presented and synthesized in TSMC 130nm technology. The results of the implementation show that the parallel single constant decimal multiplier has an interesting delay, area, power consumption, and PDP compared to others decimal multipliers.
{"title":"A Method for Single Radix-10 constant multiplication","authors":"Sara Sadat Hoseininasab, Hooman Nikmehr","doi":"10.1109/KBEI.2019.8735022","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8735022","url":null,"abstract":"Decimal multiplication is one of the most extensively used and complex computations in many commercial and financial applications. This paper presents a novel design for a single constant decimal multiplier with constant coefficients of 10 to 19. The parallel generation of partial products is performed using BCD-8421 or BCD-4221 encodings. Decimal multioperand addition has been used for partial product reduction stage. Also, a redundant to none-redundant converter for the last stage of the multiplier is proposed. To evaluate the architecture, a VHDL model is presented and synthesized in TSMC 130nm technology. The results of the implementation show that the parallel single constant decimal multiplier has an interesting delay, area, power consumption, and PDP compared to others decimal multipliers.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134179463","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8734960
T. Gandomani, H. Faraji, Mahsa Radnejad
Software cost estimation has been always a serious concern among the software experts. Although, a few estimation models and techniques have been provided in disciplined based software methodologies, Agile methodologies most often use Planning Poker technique for software cost estimation. This technique promotes coming to consensus when suggesting size of each user requirement (known as User Story). However, most often software experts ask whether it is necessary to reach to a consensus or not. They also, offer considering the average of the suggested sizes (cost) of User Stories instead of focusing on consensus on them. The main aim of this paper is to present the results of a case study research which has been carried out to compare the accuracy of both disciplines. The results show less accuracy when team get an average size of the User Stories compared to coming to consensus about the size of User Stories.
{"title":"Planning Poker in cost estimation in Agile methods: Averaging Vs. Consensus","authors":"T. Gandomani, H. Faraji, Mahsa Radnejad","doi":"10.1109/KBEI.2019.8734960","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8734960","url":null,"abstract":"Software cost estimation has been always a serious concern among the software experts. Although, a few estimation models and techniques have been provided in disciplined based software methodologies, Agile methodologies most often use Planning Poker technique for software cost estimation. This technique promotes coming to consensus when suggesting size of each user requirement (known as User Story). However, most often software experts ask whether it is necessary to reach to a consensus or not. They also, offer considering the average of the suggested sizes (cost) of User Stories instead of focusing on consensus on them. The main aim of this paper is to present the results of a case study research which has been carried out to compare the accuracy of both disciplines. The results show less accuracy when team get an average size of the User Stories compared to coming to consensus about the size of User Stories.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134314878","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8735019
Negar Nazem Bokaei, Mohammad Reza Keyvanpour
Mutation testing is a powerful and expensive method in software testing context. It is used as a test criterion to assess the quality of test suites or generate test suites which are able to kill mutants created by seeding artificial defects in the original program code. These test suites are high-quality tests with good ability to find probable faults in the program under test. Mutation testing has gained high attention recently through its superiority over other testing criteria in different aspects and is the main topic of researches in software testing area. As well as powerfulness of mutation testing, it has challenges and difficulties which are great barriers for industrial utilization. This paper provides a comprehensive classification of mutation testing issues and challenges. Furthermore, a comparative study is conducted on researches that made an effort to investigate issues and resolve challenges of mutation testing along with presenting a classification of these proposed approaches. This comparative structure suggests different research topics and makes a guideline for researchers interested in mutation testing context. This also can be used for the purpose of comparing the existing methods, selecting the best one and improving selected methods.
{"title":"A Comparative Study of Whole Issues and Challenges in Mutation Testing","authors":"Negar Nazem Bokaei, Mohammad Reza Keyvanpour","doi":"10.1109/KBEI.2019.8735019","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8735019","url":null,"abstract":"Mutation testing is a powerful and expensive method in software testing context. It is used as a test criterion to assess the quality of test suites or generate test suites which are able to kill mutants created by seeding artificial defects in the original program code. These test suites are high-quality tests with good ability to find probable faults in the program under test. Mutation testing has gained high attention recently through its superiority over other testing criteria in different aspects and is the main topic of researches in software testing area. As well as powerfulness of mutation testing, it has challenges and difficulties which are great barriers for industrial utilization. This paper provides a comprehensive classification of mutation testing issues and challenges. Furthermore, a comparative study is conducted on researches that made an effort to investigate issues and resolve challenges of mutation testing along with presenting a classification of these proposed approaches. This comparative structure suggests different research topics and makes a guideline for researchers interested in mutation testing context. This also can be used for the purpose of comparing the existing methods, selecting the best one and improving selected methods.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"272 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133887342","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 : 2019-02-01DOI: 10.1109/KBEI.2019.8735041
S. Hajiaghasi, Z. Rafiee, A. Salemnia, M. Aghamohammadi, Tohid Soleymaniaghdam
Broken rotor bar faults cause of motor malfunction and reduction of the life cycle. For the safe and appropriate performance of induction motors, the motor fault detection is a critical issue. This paper presents a new strategy for the broken rotor bar fault detection of the induction motors. Finite element method (FEM) is used for accurate fault modelling and the flux density under broken rotor bar faults has been comprehensively analyzed. Moreover, a new rotor bar fault detection method based on probabilistic neural network (PNN) and wavelet transform is presented. The proposed approach uses the stator current signal amplitude samples in the time-frequency domain to extract the appropriate coefficients where they are considered as inputs to a PNN. The output of the PNN classifies the status of the rotor to a healthy or faulty condition. The performance of the proposed method is verified using numerical simulation.
{"title":"A New Strategy for Induction Motor Fault Detection Based on Wavelet Transform and Probabilistic Neural Network","authors":"S. Hajiaghasi, Z. Rafiee, A. Salemnia, M. Aghamohammadi, Tohid Soleymaniaghdam","doi":"10.1109/KBEI.2019.8735041","DOIUrl":"https://doi.org/10.1109/KBEI.2019.8735041","url":null,"abstract":"Broken rotor bar faults cause of motor malfunction and reduction of the life cycle. For the safe and appropriate performance of induction motors, the motor fault detection is a critical issue. This paper presents a new strategy for the broken rotor bar fault detection of the induction motors. Finite element method (FEM) is used for accurate fault modelling and the flux density under broken rotor bar faults has been comprehensively analyzed. Moreover, a new rotor bar fault detection method based on probabilistic neural network (PNN) and wavelet transform is presented. The proposed approach uses the stator current signal amplitude samples in the time-frequency domain to extract the appropriate coefficients where they are considered as inputs to a PNN. The output of the PNN classifies the status of the rotor to a healthy or faulty condition. The performance of the proposed method is verified using numerical simulation.","PeriodicalId":339990,"journal":{"name":"2019 5th Conference on Knowledge Based Engineering and Innovation (KBEI)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133924675","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
扫码关注我们
求助内容：
应助结果提醒方式：