Pub Date : 2020-12-23DOI: 10.37394/23205.2020.19.27
Burak Kaan Özbek, M. Turan
Navigation, which most people have an idea about, is often known as information about how to get from one point to another on the land. Navigation is an interest area for both civil and military aviation. Therefore, we get help from various sensors in order to trace the aircraft route. The most used sensor among them is GPS. It is a sensor that can be out of use although it has high accuracy rates. This research focused on being able to maintain the navigation of an aircraft in the environments where GPS is out of use. There are two visual-inertial navigation systems VINS-Mono and ORB-SLAM3, which are the best known algorithms in the literature, were examined and compared in terms of performance. It has been observed that ORB-SLAM3 outperformed almost twice the VINS-Mono system in various situations.
{"title":"Research on the Availability of VINS-Mono and ORB-SLAM3 Algorithms for Aviation","authors":"Burak Kaan Özbek, M. Turan","doi":"10.37394/23205.2020.19.27","DOIUrl":"https://doi.org/10.37394/23205.2020.19.27","url":null,"abstract":"Navigation, which most people have an idea about, is often known as information about how to get from one point to another on the land. Navigation is an interest area for both civil and military aviation. Therefore, we get help from various sensors in order to trace the aircraft route. The most used sensor among them is GPS. It is a sensor that can be out of use although it has high accuracy rates. This research focused on being able to maintain the navigation of an aircraft in the environments where GPS is out of use. There are two visual-inertial navigation systems VINS-Mono and ORB-SLAM3, which are the best known algorithms in the literature, were examined and compared in terms of performance. It has been observed that ORB-SLAM3 outperformed almost twice the VINS-Mono system in various situations.","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114532547","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 : 2020-12-18DOI: 10.37394/23205.2020.19.38
Suboh Alkhushayni, T. Choi, Du’a Alzaleq
This work aims to expand the knowledge of the area of data analysis through both persistence homology, as well as representations of directed graphs. To be specific, we looked for how we can analyze homology cluster groups using agglomerative Hierarchical Clustering algorithms and methods. Additionally, the Wine data, which is offered in R studio, was analyzed using various cluster algorithms such as Hierarchical Clustering, K-Means Clustering, and PAM Clustering. The goal of the analysis was to find out which cluster's method is proper for a given numerical data set. By testing the data, we tried to find the agglomerative hierarchical clustering method that will be the optimal clustering algorithm among these three; K-Means, PAM, and Random Forest methods. By comparing each model's accuracy value with cultivar coefficients, we came with a conclusion that K-Means methods are the most helpful when working with numerical variables. On the other hand, PAM clustering and Gower with random forest are the most beneficial approaches when working with categorical variables. All these tests can determine the optimal number of clustering groups, given the data set, and by doing the proper analysis. Using those the project, we can apply our method to several industrial areas such that clinical, business, and others. For example, people can make different groups based on each patient who has a common disease, required therapy, and other things in the clinical society. Additionally, for the business area, people can expect to get several clustered groups based on the marginal profit, marginal cost, or other economic indicators.
{"title":"Data Analysis Using Representation Theory and Clustering Algorithms","authors":"Suboh Alkhushayni, T. Choi, Du’a Alzaleq","doi":"10.37394/23205.2020.19.38","DOIUrl":"https://doi.org/10.37394/23205.2020.19.38","url":null,"abstract":"This work aims to expand the knowledge of the area of data analysis through both persistence homology, as well as representations of directed graphs. To be specific, we looked for how we can analyze homology cluster groups using agglomerative Hierarchical Clustering algorithms and methods. Additionally, the Wine data, which is offered in R studio, was analyzed using various cluster algorithms such as Hierarchical Clustering, K-Means Clustering, and PAM Clustering. The goal of the analysis was to find out which cluster's method is proper for a given numerical data set. By testing the data, we tried to find the agglomerative hierarchical clustering method that will be the optimal clustering algorithm among these three; K-Means, PAM, and Random Forest methods. By comparing each model's accuracy value with cultivar coefficients, we came with a conclusion that K-Means methods are the most helpful when working with numerical variables. On the other hand, PAM clustering and Gower with random forest are the most beneficial approaches when working with categorical variables. All these tests can determine the optimal number of clustering groups, given the data set, and by doing the proper analysis. Using those the project, we can apply our method to several industrial areas such that clinical, business, and others. For example, people can make different groups based on each patient who has a common disease, required therapy, and other things in the clinical society. Additionally, for the business area, people can expect to get several clustered groups based on the marginal profit, marginal cost, or other economic indicators.","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133960234","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 : 2020-11-16DOI: 10.37394/23205.2020.19.25
S. A. Al-Mawsawi, A. Haider, Q. Alfaris
Neural Network Model Predictive Control (NNMPC) is like almost like the model predictive control but the used inboard plant is designed based on using the concept of the artificial neural network to predict the behavior of the plant. The predicted values are fed to the optimizer in order to obtain better control variables. This type of controller will be used instead of the conventional controller in the most versatile FACTS devices, which is the Unified Power Flow Controller (UPFC). UPFC has the capability of controlling the transmission line parameters and consequently the flow of the active and reactive power in the transmission line. So, this type of adaptive controller, which is based on Artificial Neural Network (ANN) concept, will be implemented in UPFC, and will be investigated to ensure its robustness, effectiveness and the capability to accommodate any sudden load change in the system of Single Machine to Infinite Bus (SMIB). In addition, the dynamic performance of NNMPC will be compared with another type of adaptive controller scheme called Model Productive Controller (MPC).
神经网络模型预测控制(Neural Network Model Predictive Control, NNMPC)与模型预测控制非常相似，但所使用的机载目标是基于人工神经网络的概念来预测目标的行为。为了获得更好的控制变量，将预测值输入优化器。这种类型的控制器将用于取代最通用的FACTS设备中的传统控制器，即统一潮流控制器(UPFC)。UPFC具有控制输电线路参数的能力，从而控制输电线路中有功功率和无功功率的流动。因此，这种基于人工神经网络(ANN)概念的自适应控制器将在UPFC中实现，并将对其进行研究，以确保其鲁棒性，有效性以及适应单机到无限总线(SMIB)系统中任何突然负载变化的能力。此外，将NNMPC的动态性能与另一种称为模型生产控制器(MPC)的自适应控制器方案进行比较。
{"title":"Neural Network Model Predictive Control (NNMPC) Design for UPFC","authors":"S. A. Al-Mawsawi, A. Haider, Q. Alfaris","doi":"10.37394/23205.2020.19.25","DOIUrl":"https://doi.org/10.37394/23205.2020.19.25","url":null,"abstract":"Neural Network Model Predictive Control (NNMPC) is like almost like the model predictive control but the used inboard plant is designed based on using the concept of the artificial neural network to predict the behavior of the plant. The predicted values are fed to the optimizer in order to obtain better control variables. This type of controller will be used instead of the conventional controller in the most versatile FACTS devices, which is the Unified Power Flow Controller (UPFC). UPFC has the capability of controlling the transmission line parameters and consequently the flow of the active and reactive power in the transmission line. So, this type of adaptive controller, which is based on Artificial Neural Network (ANN) concept, will be implemented in UPFC, and will be investigated to ensure its robustness, effectiveness and the capability to accommodate any sudden load change in the system of Single Machine to Infinite Bus (SMIB). In addition, the dynamic performance of NNMPC will be compared with another type of adaptive controller scheme called Model Productive Controller (MPC).","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132277418","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 : 2020-11-12DOI: 10.37394/23205.2020.19.24
Kellee Farris, Subhashini Ganapathy, Mary E. Fendley
Petrochemical operators view the distributed control system process through operating graphics that are displayed on four or more cathode ray tube displays that are monitored 24/7. The graphics vary in both design and content, however there has not been extensive research done on the ability of vector arrows to display this trend information. The purpose of this study was to understand the current trend representation methods and to develop efficient trend representation displays. Results indicate that providing vector arrows for trend representation can be effective in getting the attention of the user and can help in reducing change blindness. Results also indicate that between 10 and 20 degrees of change a participant notices change and that any rate of change increase beyond that does not improve their recognition, illustrating the importance of capturing the rate of change within this range in representing trend data. We were able to demonstrate that use of vector arrows for at-a-glance initial trend analysis was easy to use and effective in petrochemical industry systems.
{"title":"Presenting Trends In Petrochemical Process Control Systems","authors":"Kellee Farris, Subhashini Ganapathy, Mary E. Fendley","doi":"10.37394/23205.2020.19.24","DOIUrl":"https://doi.org/10.37394/23205.2020.19.24","url":null,"abstract":"Petrochemical operators view the distributed control system process through operating graphics that are displayed on four or more cathode ray tube displays that are monitored 24/7. The graphics vary in both design and content, however there has not been extensive research done on the ability of vector arrows to display this trend information. The purpose of this study was to understand the current trend representation methods and to develop efficient trend representation displays. Results indicate that providing vector arrows for trend representation can be effective in getting the attention of the user and can help in reducing change blindness. Results also indicate that between 10 and 20 degrees of change a participant notices change and that any rate of change increase beyond that does not improve their recognition, illustrating the importance of capturing the rate of change within this range in representing trend data. We were able to demonstrate that use of vector arrows for at-a-glance initial trend analysis was easy to use and effective in petrochemical industry systems.","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123829274","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 : 2020-10-27DOI: 10.37394/23205.2020.19.22
N. Ruzgar, Clare Chua
In the real world, the class imbalance problem is a common issue in which classifier gives more importance to the majority class whereas less importance to the minority class. In class imbalance, imbalance metrics would not be suitable to evaluate the performance of classifiers with error rate or predictive accuracy. One type of imbalance data -handling method is resampling. In this paper, three resampling methods, oversampling, under-sampling and hybrid, methods are used with different approaches for in class imbalance of two different financial data to see the impact of class imbalance ratios on performance measures of nine different classification algorithms. Aiming to achieve better change classification performance, the performance of the classification algorithms, Bayes Net, Navie Bayes, J48, Random Forest Meta-Attribute Selected Classifier, MetaClassification via Regression, Meta-Logitboost, Logistic Regression, and Decision Tree, are measured on two Canadian Banks multiclass imbalance data with the performance measures, Precision, Recall, ROC Area and Kappa Statistic, by using WEKA software. The outcome of these performance measurements compared with three different resampling methods. The results provide us with a clear picture on the overall impact of class imbalance on the classification dataset and they indicate that proposed resampling methods can also be used for in class imbalance problems
在现实世界中，类不平衡问题是分类器对多数类重视程度高而对少数类重视程度低的常见问题。在类不平衡的情况下，不平衡指标不适合用来评价具有错误率或预测准确率的分类器的性能。一种不平衡数据处理方法是重采样。本文采用过采样、欠采样和混合三种重采样方法，采用不同的方法对两种不同的金融数据进行类内失衡，观察类失衡比例对九种不同分类算法性能指标的影响。为了获得更好的变化分类性能，利用WEKA软件，对贝叶斯网络、纳维贝叶斯、J48、随机森林元属性选择分类器、meta - classification via Regression、Meta-Logitboost、Logistic回归和决策树等分类算法在两家加拿大银行多类失衡数据上的性能指标Precision、Recall、ROC Area和Kappa Statistic进行了测量。这些性能测量的结果与三种不同的重采样方法进行了比较。结果为我们提供了类不平衡对分类数据集的总体影响的清晰图像，并表明所提出的重采样方法也可用于类不平衡问题
{"title":"Data Level Approach for Multiclass Imbalance Financial Data","authors":"N. Ruzgar, Clare Chua","doi":"10.37394/23205.2020.19.22","DOIUrl":"https://doi.org/10.37394/23205.2020.19.22","url":null,"abstract":"In the real world, the class imbalance problem is a common issue in which classifier gives more importance to the majority class whereas less importance to the minority class. In class imbalance, imbalance metrics would not be suitable to evaluate the performance of classifiers with error rate or predictive accuracy. One type of imbalance data -handling method is resampling. In this paper, three resampling methods, oversampling, under-sampling and hybrid, methods are used with different approaches for in class imbalance of two different financial data to see the impact of class imbalance ratios on performance measures of nine different classification algorithms. Aiming to achieve better change classification performance, the performance of the classification algorithms, Bayes Net, Navie Bayes, J48, Random Forest Meta-Attribute Selected Classifier, MetaClassification via Regression, Meta-Logitboost, Logistic Regression, and Decision Tree, are measured on two Canadian Banks multiclass imbalance data with the performance measures, Precision, Recall, ROC Area and Kappa Statistic, by using WEKA software. The outcome of these performance measurements compared with three different resampling methods. The results provide us with a clear picture on the overall impact of class imbalance on the classification dataset and they indicate that proposed resampling methods can also be used for in class imbalance problems","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128111702","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 : 2020-10-23DOI: 10.37394/23205.2021.20.11
Merve Nur Cakir, M. Saleemi, K. Zimmermann
Dynamic programming is a mathematical optimization method and a computer programming method as well. In this paper, the notion of sheaf programming in topological spaces is introduced and it is demonstrated that it relates very well to the concept of dynamic programming.
{"title":"Dynamic Programming in Topological Spaces","authors":"Merve Nur Cakir, M. Saleemi, K. Zimmermann","doi":"10.37394/23205.2021.20.11","DOIUrl":"https://doi.org/10.37394/23205.2021.20.11","url":null,"abstract":"Dynamic programming is a mathematical optimization method and a computer programming method as well. In this paper, the notion of sheaf programming in topological spaces is introduced and it is demonstrated that it relates very well to the concept of dynamic programming.","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114327161","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 : 2020-10-15DOI: 10.37394/23205.2020.19.21
Moulay Youssef Smaili, H. Hachimi
In direct marketing campaigns, the optimization of targeted offers problem is a big business concern. The main goal is to maximize the company’s profit by reaching the right clients. The main challenge faced by companies when advertising, is to configure properly a campaign by choosing the appropriate target, so it is guaranteed a high acceptance of users to advertisements. When dealing with an important size of data, the important specification to consider is the combinatorial aspect of the problem and the limitation of the approach based on mathematical programming methods. In this article, and since this problem belongs to the class of NP-hard problems, the use of metaheuristic, instead of exact methods, is essential; the Bat Algorithm which is a new inspired algorithm is proposed after hybridization with Genetic Algorithm. Computational experiments show that the proposed algorithm was able to give good and competitive solutions
{"title":"Population-based Method for Optimizing Targeted Offers Problem in Direct Marketing Campaigns","authors":"Moulay Youssef Smaili, H. Hachimi","doi":"10.37394/23205.2020.19.21","DOIUrl":"https://doi.org/10.37394/23205.2020.19.21","url":null,"abstract":"In direct marketing campaigns, the optimization of targeted offers problem is a big business concern. The main goal is to maximize the company’s profit by reaching the right clients. The main challenge faced by companies when advertising, is to configure properly a campaign by choosing the appropriate target, so it is guaranteed a high acceptance of users to advertisements. When dealing with an important size of data, the important specification to consider is the combinatorial aspect of the problem and the limitation of the approach based on mathematical programming methods. In this article, and since this problem belongs to the class of NP-hard problems, the use of metaheuristic, instead of exact methods, is essential; the Bat Algorithm which is a new inspired algorithm is proposed after hybridization with Genetic Algorithm. Computational experiments show that the proposed algorithm was able to give good and competitive solutions","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123914344","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 : 2020-08-17DOI: 10.37394/23205.2020.19.20
Hager Hussein, A. Younes, W. Abdelmoez
Test Suite Minimization problem is a nondeterministic polynomial time (NP) complete problem insoftware engineering that has a special importance in software testing. In this problem, a subset with a minimalsize that contains a number of test cases that cover all the test requirements should be found. A bruteforceapproach to solving this problem is to assume a size for the minimal subset and then search to find if there is asubset of test cases with the assumed size that solves the problem. If not, the assumed minimal size is graduallyincremented, and the search is repeated. In this paper, a quantuminspired genetic algorithm (QIGA) will beproposed to solve this problem. In it, quantum superposition, quantum rotation and quantum measurement willbe used in an evolutionary algorithm. The paper will show that the adopted quantum techniques can speed upthe convergence of the classical genetic algorithm. The proposed method has an advantage in that it reduces theassumed minimal number of test cases using quantum measurements, which makes it able to discover the minimalnumber of test cases without any prior assumptions.
{"title":"Quantum-Inspired Genetic Algorithm for Solving the Test Suite Minimization Problem","authors":"Hager Hussein, A. Younes, W. Abdelmoez","doi":"10.37394/23205.2020.19.20","DOIUrl":"https://doi.org/10.37394/23205.2020.19.20","url":null,"abstract":"Test Suite Minimization problem is a nondeterministic polynomial time (NP) complete problem insoftware engineering that has a special importance in software testing. In this problem, a subset with a minimalsize that contains a number of test cases that cover all the test requirements should be found. A bruteforceapproach to solving this problem is to assume a size for the minimal subset and then search to find if there is asubset of test cases with the assumed size that solves the problem. If not, the assumed minimal size is graduallyincremented, and the search is repeated. In this paper, a quantuminspired genetic algorithm (QIGA) will beproposed to solve this problem. In it, quantum superposition, quantum rotation and quantum measurement willbe used in an evolutionary algorithm. The paper will show that the adopted quantum techniques can speed upthe convergence of the classical genetic algorithm. The proposed method has an advantage in that it reduces theassumed minimal number of test cases using quantum measurements, which makes it able to discover the minimalnumber of test cases without any prior assumptions.","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131129458","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 : 2020-07-23DOI: 10.37394/23205.2020.19.19
T. Atar, T. McCabe, E. Erdogmus, B. Pulatsu
This study presents a numerical investigation of the dynamic behavior of dry-joint unreinforced semi-circular masonry arches using the discrete element method (DEM). Masonry arches are analyzed as a system of rigid blocks, mechanically interacting with each other through relative contact displacements. First, the applied modeling strategy is validated using a small-scale tilting experiment performed on a 3D printed arch model and a custom-made rotatable platform. Then, quasi-static and dynamic analysis analyses are performed on computational models to better understand the seismic capacity of the masonry arches depending on the frequency content of the excitations, thickness-to-radius ratios, scale of the arch, and the contact stiffness values. The results of the analyses reveal the capabilities of the discrete element models on the simulation of masonry arches. Particular findings include these types of arches’ vulnerability to excitations lower than 2 Hz dominant frequency. Furthermore, the impact of scale and slenderness become more pronounced for frequencies greater than 2 Hz. Finally, it is observed that once contact stiffness values are larger than 10 GPa/m, the effect of this parameter is negligible; but it should be carefully selected at lower values.
{"title":"Dynamic Analysis of Semi-Circular Dry-Joint Masonry Arches: Small-Scale Experiment and Discrete Element Modeling","authors":"T. Atar, T. McCabe, E. Erdogmus, B. Pulatsu","doi":"10.37394/23205.2020.19.19","DOIUrl":"https://doi.org/10.37394/23205.2020.19.19","url":null,"abstract":"This study presents a numerical investigation of the dynamic behavior of dry-joint unreinforced semi-circular masonry arches using the discrete element method (DEM). Masonry arches are analyzed as a system of rigid blocks, mechanically interacting with each other through relative contact displacements. First, the applied modeling strategy is validated using a small-scale tilting experiment performed on a 3D printed arch model and a custom-made rotatable platform. Then, quasi-static and dynamic analysis analyses are performed on computational models to better understand the seismic capacity of the masonry arches depending on the frequency content of the excitations, thickness-to-radius ratios, scale of the arch, and the contact stiffness values. The results of the analyses reveal the capabilities of the discrete element models on the simulation of masonry arches. Particular findings include these types of arches’ vulnerability to excitations lower than 2 Hz dominant frequency. Furthermore, the impact of scale and slenderness become more pronounced for frequencies greater than 2 Hz. Finally, it is observed that once contact stiffness values are larger than 10 GPa/m, the effect of this parameter is negligible; but it should be carefully selected at lower values.","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134162161","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 : 2020-05-11DOI: 10.37394/23205.2020.19.18
Nada Zine Laabidine, A. Errarhout, Chakib El Bakkali, K. Mohammed, B. Bossoufi
In this work, we are developing a new control strategy for wind systems based on the permanent magnet synchronous generator (PMSG). The SMC sliding mode technique is based on the principle of Lyapunov stability in order to make a nonlinear system close to linearity. the use of such a technique with an improvement in regulators to suppress the Chattering phenomenon shows a great improvement in the performance of wind systems. The performance and robustness of the PMSG and the wind turbine are analyzed and compared by simulation based on Matlab / Simulink.
{"title":"Robust Power Control for Wind Power Generation system based on PMSG","authors":"Nada Zine Laabidine, A. Errarhout, Chakib El Bakkali, K. Mohammed, B. Bossoufi","doi":"10.37394/23205.2020.19.18","DOIUrl":"https://doi.org/10.37394/23205.2020.19.18","url":null,"abstract":"In this work, we are developing a new control strategy for wind systems based on the permanent magnet synchronous generator (PMSG). The SMC sliding mode technique is based on the principle of Lyapunov stability in order to make a nonlinear system close to linearity. the use of such a technique with an improvement in regulators to suppress the Chattering phenomenon shows a great improvement in the performance of wind systems. The performance and robustness of the PMSG and the wind turbine are analyzed and compared by simulation based on Matlab / Simulink.","PeriodicalId":332148,"journal":{"name":"WSEAS TRANSACTIONS ON COMPUTERS","volume":"277 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762302","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
扫码关注我们
求助内容：
应助结果提醒方式：