This paper makes a comparison between two control methods for maximum power point tracking (MPPT) of a photovoltaic (PV) system under varying irradiation and temperature conditions: the fuzzy logic and the neural network control. Both techniques have been simulated and analyzed by using Matlab/Simulink software. The power transitions at varying irradiation and temperature conditions have been simulated and the power tracking time realized by the fuzzy logic controller against the neural network controller has been evaluated.
{"title":"Maximum Power Point Tracking of Photovoltaic Modules: Comparison of Fuzzy Logic and Artificial Network Controllers' Performances","authors":"J. Aymen, Zarrad Ons, M. Nejib, A. Craciunescu","doi":"10.1109/MCSI.2016.027","DOIUrl":"https://doi.org/10.1109/MCSI.2016.027","url":null,"abstract":"This paper makes a comparison between two control methods for maximum power point tracking (MPPT) of a photovoltaic (PV) system under varying irradiation and temperature conditions: the fuzzy logic and the neural network control. Both techniques have been simulated and analyzed by using Matlab/Simulink software. The power transitions at varying irradiation and temperature conditions have been simulated and the power tracking time realized by the fuzzy logic controller against the neural network controller has been evaluated.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121279030","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}
Mode-mixing, boundary effects and necessary extrema lacking and etc. are the main problems involved in empirical mode decomposition (EMD). The paper presents an improved empirical mode decomposition based on assisted signals: Gaussian noises. Firstly, the given 1D Gaussian noise and its negative counterpart are added to the original respectively to construct the two s to be decomposed. Secondly, the decomposed IMFs from the two signals are added together to get the IMFs, in which the added noises are canceled out with less mode-mixing and boundary effects. Lastly, the efficiency and performance of the method are given through theoretical analysis and experiments.
{"title":"Fast Empirical Mode Decomposition Based on Gaussian Noises","authors":"Risheng Wang, Jianjun Zhou, Jie Chen, Yanjie Wang","doi":"10.1109/MCSI.2016.059","DOIUrl":"https://doi.org/10.1109/MCSI.2016.059","url":null,"abstract":"Mode-mixing, boundary effects and necessary extrema lacking and etc. are the main problems involved in empirical mode decomposition (EMD). The paper presents an improved empirical mode decomposition based on assisted signals: Gaussian noises. Firstly, the given 1D Gaussian noise and its negative counterpart are added to the original respectively to construct the two s to be decomposed. Secondly, the decomposed IMFs from the two signals are added together to get the IMFs, in which the added noises are canceled out with less mode-mixing and boundary effects. Lastly, the efficiency and performance of the method are given through theoretical analysis and experiments.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115626763","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}
V. Zolotarev, G. Ovechkin, P. Ovechkin, D. Satybaldina, N. Tashatov, D. Sankibayev
Multithreshold decoder (MTD) is the simplest type of majority decoder that decodes self-orthogonal codes. Low computational complexity and simple decoding hardware implementation of multithreshold decoders allow using them in high speed communication systems and data storage systems that require decoding information at speeds above 1 Gbit/s. A high-speed software binary multithreshold decoder using a modern computing power of the graphics processing unit (GPU) is considered. Such software implementation of MTD helps to decode several hundred blocks received from the channel completely parallel and independent from each other. It is shown that the speed of software MTD based on GPU GTX 970 can reach 350 Mbit/s.
{"title":"High Throughput Software Multithreshold Decoder on GPU","authors":"V. Zolotarev, G. Ovechkin, P. Ovechkin, D. Satybaldina, N. Tashatov, D. Sankibayev","doi":"10.1109/MCSI.2016.039","DOIUrl":"https://doi.org/10.1109/MCSI.2016.039","url":null,"abstract":"Multithreshold decoder (MTD) is the simplest type of majority decoder that decodes self-orthogonal codes. Low computational complexity and simple decoding hardware implementation of multithreshold decoders allow using them in high speed communication systems and data storage systems that require decoding information at speeds above 1 Gbit/s. A high-speed software binary multithreshold decoder using a modern computing power of the graphics processing unit (GPU) is considered. Such software implementation of MTD helps to decode several hundred blocks received from the channel completely parallel and independent from each other. It is shown that the speed of software MTD based on GPU GTX 970 can reach 350 Mbit/s.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129579777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper a mathematical model for the whole control system (vehicle, steering gear and controller) is presented. The system was subjected to a few different optimization methods: Ultimate Sensitivity Tuning Method, Systematic Tuning Method, as well as a cost function (integral of quadratic dynamic error). This criterion is used to minimize a fuel consumption. Selection of the controller is examined and defined. Optimal parameters have been investigated and analyzed. To analyze stability of the system analytical and graphical methods are used (Routh's criteria and Root-Locus). Simulation of the system is performed by using Simulink and Matlab. Non-linear elements are added to the system to protect the mechanical component from being damaged. The presence of external disturbance is pointed out. Further improvement of the model is suggested.
{"title":"Heading Control of Unmanned Submersible Vehicle","authors":"N. Popovich, R. Singh","doi":"10.1109/MCSI.2016.017","DOIUrl":"https://doi.org/10.1109/MCSI.2016.017","url":null,"abstract":"In this paper a mathematical model for the whole control system (vehicle, steering gear and controller) is presented. The system was subjected to a few different optimization methods: Ultimate Sensitivity Tuning Method, Systematic Tuning Method, as well as a cost function (integral of quadratic dynamic error). This criterion is used to minimize a fuel consumption. Selection of the controller is examined and defined. Optimal parameters have been investigated and analyzed. To analyze stability of the system analytical and graphical methods are used (Routh's criteria and Root-Locus). Simulation of the system is performed by using Simulink and Matlab. Non-linear elements are added to the system to protect the mechanical component from being damaged. The presence of external disturbance is pointed out. Further improvement of the model is suggested.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125693813","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}
Assurance (Security and Safety) Case is a proven-in-use methodology to demonstrate a system compliance with security and safety critical requirements. An advance approach to improve Assurance Case is proposed in a view of Assurance Case Driven Design (AC DD). A practical using of AC DD lays in cost-effectiveness improvement of certification and licensing processes Assurance Case is based on graphical notations. These graphical notations are a part of formal methods, which originally are developed from classical mathematical models and methods. In this article we propose turn back to the set theory and graph theory which are the original fundamentals of Assurance Case. That allows as us to implement a kind of reverse engineering for a formal notation. We analyze basic mathematical models and methods to improve a known formal notation at the top level. As a result we develop Claim-Argument-Evidence-Criteria (CAEC) notation as well as Development-Verification & Validation-Assurance Case (DVA) notation for AC DD implementation.
{"title":"Assurance Case Driven Design for Computer Systems: Graphical Notations versus Mathematical Methods","authors":"Vladimir V. Sklyar, V. Kharchenko","doi":"10.1109/MCSI.2016.063","DOIUrl":"https://doi.org/10.1109/MCSI.2016.063","url":null,"abstract":"Assurance (Security and Safety) Case is a proven-in-use methodology to demonstrate a system compliance with security and safety critical requirements. An advance approach to improve Assurance Case is proposed in a view of Assurance Case Driven Design (AC DD). A practical using of AC DD lays in cost-effectiveness improvement of certification and licensing processes Assurance Case is based on graphical notations. These graphical notations are a part of formal methods, which originally are developed from classical mathematical models and methods. In this article we propose turn back to the set theory and graph theory which are the original fundamentals of Assurance Case. That allows as us to implement a kind of reverse engineering for a formal notation. We analyze basic mathematical models and methods to improve a known formal notation at the top level. As a result we develop Claim-Argument-Evidence-Criteria (CAEC) notation as well as Development-Verification & Validation-Assurance Case (DVA) notation for AC DD implementation.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127309305","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}
This paper deals with the modelling and flow simulation in the combustion chamber of a turbojet engine in order to find the optimal velocity, pressure and temperature distributions in the flame tube and in front of the turbine. The Arrhenius relationship, which describes the basic dependencies of the reaction rate on pressure, temperature and concentration has been used. Also, combustion efficiency has been defined and related to both the exhaust temperature and species concentration. The main focus of this paper consists in finding a new geometrical model of the aircraft engine combustion chamber with an optimal distribution of gas parameters in front of the turbine, that could allow a lower engine rotational speed, a lower temperature in front of the first stage of the turbine and the possibility to increase the turbine pressure ratio. Also, a higher thermodynamic cycle efficiency and thrust in comparison to traditional constant-pressure combustion gas turbine engines could be obtained.
{"title":"Aspects Regarding Aerodynamic Shape of Turbojet Combustion Chamber","authors":"C. Rotaru","doi":"10.1109/MCSI.2016.020","DOIUrl":"https://doi.org/10.1109/MCSI.2016.020","url":null,"abstract":"This paper deals with the modelling and flow simulation in the combustion chamber of a turbojet engine in order to find the optimal velocity, pressure and temperature distributions in the flame tube and in front of the turbine. The Arrhenius relationship, which describes the basic dependencies of the reaction rate on pressure, temperature and concentration has been used. Also, combustion efficiency has been defined and related to both the exhaust temperature and species concentration. The main focus of this paper consists in finding a new geometrical model of the aircraft engine combustion chamber with an optimal distribution of gas parameters in front of the turbine, that could allow a lower engine rotational speed, a lower temperature in front of the first stage of the turbine and the possibility to increase the turbine pressure ratio. Also, a higher thermodynamic cycle efficiency and thrust in comparison to traditional constant-pressure combustion gas turbine engines could be obtained.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130684900","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}
We study the problem of control over the temperature conditions in industrial hothouses. We consider a model based on the one-dimensional parabolic equation on a bounded interval with quadratic cost functional, prove the existence and the uniqueness of a control function from a prescribed set, and study the structure of the set of accessible temperature functions.
{"title":"On One Model of Temperature Control in Hothouses","authors":"I. Astashova, A. Filinovskiy, D. Lashin","doi":"10.1109/MCSI.2016.048","DOIUrl":"https://doi.org/10.1109/MCSI.2016.048","url":null,"abstract":"We study the problem of control over the temperature conditions in industrial hothouses. We consider a model based on the one-dimensional parabolic equation on a bounded interval with quadratic cost functional, prove the existence and the uniqueness of a control function from a prescribed set, and study the structure of the set of accessible temperature functions.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"222 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132337515","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}
We propose some modified versions of the mirror descent algorithm for the two-armed bandit problem which allow parallel processing of data. Using Monte-Carlo simulations, we estimate the minimax risk for this versions.
{"title":"Parallel Version of the Mirror Descent Algorithm for the Two-Armed Bandit Problem","authors":"A. Kolnogorov, D. Shiyan","doi":"10.1109/MCSI.2016.052","DOIUrl":"https://doi.org/10.1109/MCSI.2016.052","url":null,"abstract":"We propose some modified versions of the mirror descent algorithm for the two-armed bandit problem which allow parallel processing of data. Using Monte-Carlo simulations, we estimate the minimax risk for this versions.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122628942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we describe how to use the dihedral group theory to detect symmetry on Facial Key Points (FKP) to recognize real emotions. We present an algorithm for symmetry detection with the dihedral group and deploy it for finding symmetry (rotation and reflection) on FKP. The method can be applied in many areas which have the same data texture. The method used for real emotion recognition and experimental results shows that using the dihedral group concept can reach it better in the subject area which contains symmetry in nature because of its robustness.
{"title":"Real Emotion Recognition by Detecting Symmetry Patterns with Dihedral Group","authors":"M. Ghayoumi, A. Bansal","doi":"10.1109/MCSI.2016.041","DOIUrl":"https://doi.org/10.1109/MCSI.2016.041","url":null,"abstract":"In this paper, we describe how to use the dihedral group theory to detect symmetry on Facial Key Points (FKP) to recognize real emotions. We present an algorithm for symmetry detection with the dihedral group and deploy it for finding symmetry (rotation and reflection) on FKP. The method can be applied in many areas which have the same data texture. The method used for real emotion recognition and experimental results shows that using the dihedral group concept can reach it better in the subject area which contains symmetry in nature because of its robustness.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"121-124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114152556","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we present mathematical models of the failure probabilities of individual MOS transistors. We use the models to characterize the failures of a few common CMOS logic cells. The failure models for the cells accurately represent the probabilities by considering the transistor dimensions, the supply voltage level, the input voltage level, and the variations in threshold voltages. We also demonstrate how the models can be utilized to analyze the sensitivities of cells' failure probabilities to their transistor sizes. Using scatter-plots, we observed a strong correlation between individual transistors' probabilities and their sizes, the cells, however, exhibited mixed sets of correlations, i.e., strong and weak. The presented modeling and analysis techniques are applicable to any CMOS logic cell operating between nearthreshold and nominal voltages.
{"title":"Modeling the Probabilities of Failures of 22 nm CMOS Logic Cells","authors":"A. Beg","doi":"10.1109/MCSI.2016.028","DOIUrl":"https://doi.org/10.1109/MCSI.2016.028","url":null,"abstract":"In this paper, we present mathematical models of the failure probabilities of individual MOS transistors. We use the models to characterize the failures of a few common CMOS logic cells. The failure models for the cells accurately represent the probabilities by considering the transistor dimensions, the supply voltage level, the input voltage level, and the variations in threshold voltages. We also demonstrate how the models can be utilized to analyze the sensitivities of cells' failure probabilities to their transistor sizes. Using scatter-plots, we observed a strong correlation between individual transistors' probabilities and their sizes, the cells, however, exhibited mixed sets of correlations, i.e., strong and weak. The presented modeling and analysis techniques are applicable to any CMOS logic cell operating between nearthreshold and nominal voltages.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129474430","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
扫码关注我们
求助内容：
应助结果提醒方式：