Pub Date : 1900-01-01DOI: 10.1109/SAMI.2019.8782732
M. Frigura-Iliasa, Mirela Iorga, L. Dolga, H. Filipescu
This paper presents a simple algorithm, forwarded by an adequate software, performed in order to obtain an optimisation of the engineering graph developed for a real 400 kV Over Head Power Line, located in the West Region of Romania. The Critical Path of the whole construction sequence was determined by using the Ford Algorithm. We obtained a more accurate operation overview for all major phases on the construction site, by emphasizing the time relations between all these phases/operations. The newly applied software could be useful for other engineering applications, in all domains.
{"title":"Computer Based Algorithm for Optimizing Design and Construction of Large Industrial Power System Industrial Objectives","authors":"M. Frigura-Iliasa, Mirela Iorga, L. Dolga, H. Filipescu","doi":"10.1109/SAMI.2019.8782732","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782732","url":null,"abstract":"This paper presents a simple algorithm, forwarded by an adequate software, performed in order to obtain an optimisation of the engineering graph developed for a real 400 kV Over Head Power Line, located in the West Region of Romania. The Critical Path of the whole construction sequence was determined by using the Ford Algorithm. We obtained a more accurate operation overview for all major phases on the construction site, by emphasizing the time relations between all these phases/operations. The newly applied software could be useful for other engineering applications, in all domains.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125225004","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782767
Mariia Martynova, Ondrej Kaas
This paper presents experiments in the preprocessing area for Radial Basic Function Neural Network (RBF NN). The main ideas of it are to find optimal pre-processing methods and algorithms, which can optimize input parameters and expedite the processing of neural network. The proposed methods are some novel experiments with flexible shape parameters and automated determination of the neural network initial parameters.
{"title":"A Novel Methods Based on Clustering Algorithms as The Neural Network Preprocessing","authors":"Mariia Martynova, Ondrej Kaas","doi":"10.1109/SAMI.2019.8782767","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782767","url":null,"abstract":"This paper presents experiments in the preprocessing area for Radial Basic Function Neural Network (RBF NN). The main ideas of it are to find optimal pre-processing methods and algorithms, which can optimize input parameters and expedite the processing of neural network. The proposed methods are some novel experiments with flexible shape parameters and automated determination of the neural network initial parameters.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116978767","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782721
Roland Bartók, J. Vásárhelyi
Multicore systems need a new point of view of software engineering when using parallel computing methods. In this case the processor core cache handling was examined in multicore systems for embedded system application. The upper limit of number of rule bases for the FIVE (Fuzzy Interpolation in Vague Environment) method per processor core was determined according to the cache size. The upper limit gives the rulebase size, which can be computed without reading of the system external memory. This can reduce computing time and can help to reach a higher speed-up on a multi core system. The speed-up was calculated with the Amdahl formula.
多核系统在使用并行计算方法时需要一种新的软件工程观点。在这种情况下，研究了多核嵌入式系统的处理器核心缓存处理。根据缓存大小，确定了每个处理器核心的五(Fuzzy Interpolation in Vague Environment)方法的规则库数量上限。上限给出了规则库大小，它可以在不读取系统外部内存的情况下计算。这可以减少计算时间，并有助于在多核系统上实现更高的加速。加速是用阿姆达尔公式计算出来的。
{"title":"Examining Cache Handling of the FIVE Method on Multicore Systems","authors":"Roland Bartók, J. Vásárhelyi","doi":"10.1109/SAMI.2019.8782721","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782721","url":null,"abstract":"Multicore systems need a new point of view of software engineering when using parallel computing methods. In this case the processor core cache handling was examined in multicore systems for embedded system application. The upper limit of number of rule bases for the FIVE (Fuzzy Interpolation in Vague Environment) method per processor core was determined according to the cache size. The upper limit gives the rulebase size, which can be computed without reading of the system external memory. This can reduce computing time and can help to reach a higher speed-up on a multi core system. The speed-up was calculated with the Amdahl formula.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116054163","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782738
Rim Zarrouk, I. Bennour, A. Jemai
Particle swarm optimization (PSO) is a population-based stochastic algorithm designed to solve complex optimization problems such as the Flexible Job Shop Scheduling Problem (FJSP). As a metaheuristic, the performance of the PSO is heavily affected by two elements: the size of the search-space and the way of its exploration. In this paper, we present a specific PSO algorithm for the FJSP that use Lower-bounds to bypass regions not containing optimal solutions. The proposed algorithm is a two-level PSO. The upper-level handles the mapping of operations to machines while the lower-level handles the ordering of operations. The performance gain in terms of solution optimality and CPU time, obtained by our method, has been validated by external FJSP benchmarks.
{"title":"Toward a Two-Level PSO for FJS Problem","authors":"Rim Zarrouk, I. Bennour, A. Jemai","doi":"10.1109/SAMI.2019.8782738","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782738","url":null,"abstract":"Particle swarm optimization (PSO) is a population-based stochastic algorithm designed to solve complex optimization problems such as the Flexible Job Shop Scheduling Problem (FJSP). As a metaheuristic, the performance of the PSO is heavily affected by two elements: the size of the search-space and the way of its exploration. In this paper, we present a specific PSO algorithm for the FJSP that use Lower-bounds to bypass regions not containing optimal solutions. The proposed algorithm is a two-level PSO. The upper-level handles the mapping of operations to machines while the lower-level handles the ordering of operations. The performance gain in terms of solution optimality and CPU time, obtained by our method, has been validated by external FJSP benchmarks.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129053419","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782765
Nawar Al-Hemeary, G. Szederkényi
The temperature control of the fuel tank of a small satellite (CubeSat) model is proposed in this paper. The control goal is to track a constant reference temperature to avoid fluctuations caused by the periodic disturbances. The thermal model is given in the form of nonlinear time-varying differential equations. The surface coating of the satellite is chosen specifically to support the active control design. The simulation results show that the design requirements can be satisfied by an appropriately tuned PID controller using an anti-windup scheme.
{"title":"Fuel tank temperature control of a time-varying CubeSat model","authors":"Nawar Al-Hemeary, G. Szederkényi","doi":"10.1109/SAMI.2019.8782765","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782765","url":null,"abstract":"The temperature control of the fuel tank of a small satellite (CubeSat) model is proposed in this paper. The control goal is to track a constant reference temperature to avoid fluctuations caused by the periodic disturbances. The thermal model is given in the form of nonlinear time-varying differential equations. The surface coating of the satellite is chosen specifically to support the active control design. The simulation results show that the design requirements can be satisfied by an appropriately tuned PID controller using an anti-windup scheme.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124246763","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782780
Szidónia Lefkovits, László Lefkovits
Biometrics provides a wide range of methods for the reliable identification of individuals. Many biometric features are known, but the most reliable among them is the iris texture. It has several advantages, such as uniqueness, durability, stability, collectability and unforgeability. The iris biometric has undergone significant progress in the last few years. Many state-of-the-art methods and approaches are known. This paper presents an iris segmentation and recognition system. The segmentation part is solved by a retrained version of SegNet CNN. It uses the raw image features or Gabor filter responses as input images and applies subspace methods such as PCA and LDA for dimensionality reduction. The final decision in identification is made by a multi-class one-against-one SVM. The performances measured are compared to the CASIA Internal and UPOL databases. The system foreshadows a fusion identification framework applying several types of biometrics.
{"title":"Combining Subspace Methods and CNN Segmentation for Iris Identification","authors":"Szidónia Lefkovits, László Lefkovits","doi":"10.1109/SAMI.2019.8782780","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782780","url":null,"abstract":"Biometrics provides a wide range of methods for the reliable identification of individuals. Many biometric features are known, but the most reliable among them is the iris texture. It has several advantages, such as uniqueness, durability, stability, collectability and unforgeability. The iris biometric has undergone significant progress in the last few years. Many state-of-the-art methods and approaches are known. This paper presents an iris segmentation and recognition system. The segmentation part is solved by a retrained version of SegNet CNN. It uses the raw image features or Gabor filter responses as input images and applies subspace methods such as PCA and LDA for dimensionality reduction. The final decision in identification is made by a multi-class one-against-one SVM. The performances measured are compared to the CASIA Internal and UPOL databases. The system foreshadows a fusion identification framework applying several types of biometrics.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131024667","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782718
Emil Lazarescu, E. Cazacu, M. Frigura-Iliasa, F. Frigura-Iliasa
In low-voltage electrical installations, power issues having the highest incidence are related to the presence of higher harmonics in the waveform spectrum of the absorbed currents and also to the imbalances in the three-phase distributions. The deforming (non-sinusoidal) regime becomes even more undesirable for networks having a low short-circuit response factor (high impedance systems) and, normally, it also causes distortion of waveforms of the supply voltage. Current unbalance (more rarely) is typically seen in networks that supply single-phase consumers (where virtually no balancing is possible on each phase) causing unwanted effects in installations. In this paper, we will investigate how the neutral conductor should be dimensioned inside low-voltage three-phase electric installations, where these deforming modes and / or load imbalances may occur. A new algorithm, easy to implement in any software environment, dedicated for dimensioning the neutral conductor of that installation, will be also described.
{"title":"Computational Model for the Dimensioning of Neutral Conductor in Low Voltage Power Networks Operating in Various Regimes","authors":"Emil Lazarescu, E. Cazacu, M. Frigura-Iliasa, F. Frigura-Iliasa","doi":"10.1109/SAMI.2019.8782718","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782718","url":null,"abstract":"In low-voltage electrical installations, power issues having the highest incidence are related to the presence of higher harmonics in the waveform spectrum of the absorbed currents and also to the imbalances in the three-phase distributions. The deforming (non-sinusoidal) regime becomes even more undesirable for networks having a low short-circuit response factor (high impedance systems) and, normally, it also causes distortion of waveforms of the supply voltage. Current unbalance (more rarely) is typically seen in networks that supply single-phase consumers (where virtually no balancing is possible on each phase) causing unwanted effects in installations. In this paper, we will investigate how the neutral conductor should be dimensioned inside low-voltage three-phase electric installations, where these deforming modes and / or load imbalances may occur. A new algorithm, easy to implement in any software environment, dedicated for dimensioning the neutral conductor of that installation, will be also described.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116576877","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782782
M. Kenyeres, J. Kenyeres, I. Budinská
The usage of mechanisms for data aggregation becomes an important part of many real-life applications due to a reduction of negatives factors. In this paper, we examine the applicability of average consensus with a varying mixing parameter for distributed summing in wireless sensor networks. A stopping criterion proposed for these networks is assumed to be implemented in order to bound the algorithm execution. The parameters of the implemented stopping criterion and the mixing parameter of average consensus are varied in order to find their most suitable initial configuration in terms of the estimation precision and the convergence rate over 60 random geometric graphs with either a dense or a sparse connectivity.
{"title":"Distributed Linear Summing in Wireless Sensor Networks","authors":"M. Kenyeres, J. Kenyeres, I. Budinská","doi":"10.1109/SAMI.2019.8782782","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782782","url":null,"abstract":"The usage of mechanisms for data aggregation becomes an important part of many real-life applications due to a reduction of negatives factors. In this paper, we examine the applicability of average consensus with a varying mixing parameter for distributed summing in wireless sensor networks. A stopping criterion proposed for these networks is assumed to be implemented in order to bound the algorithm execution. The parameters of the implemented stopping criterion and the mixing parameter of average consensus are varied in order to find their most suitable initial configuration in terms of the estimation precision and the convergence rate over 60 random geometric graphs with either a dense or a sparse connectivity.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116605575","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782724
L. Hanakova, V. Socha, L. Socha, A. Lališ, J. Kraus, Tomáš Malich
This study presents the issue of fatigue and its quantification by the means of psychophysiological indicators. For the purpose of the study, 24 hours experiment was proposed consisting of eight about an hour long simulated IFR flights. Eight students of the Department of Air Transport, Faculty of Transportation Sciences, Czech Technical University in Prague participated in the study, all with comparable theoretical and practical skills. During individual flights, ECG curve was recorded as a heart activity signal. From the ECG signal, individual RR intervals were extracted and subsequently an analysis in three areas was performed: time and frequency analysis and analysis by the means of Pointcaré plot. The acquired data were statistically evaluated and compared. Based on Friedman ANOVA and subsequent post-hoc analysis, statistically significant differences between first and sixth measurement were identified, which corresponded to the circadian low. It is also possible to claim that Pointcaré plot appears as a suitable means for fatigue quantification.
{"title":"The influence of fatigue on psychophysiological indicators during 24 hours testing of pilots","authors":"L. Hanakova, V. Socha, L. Socha, A. Lališ, J. Kraus, Tomáš Malich","doi":"10.1109/SAMI.2019.8782724","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782724","url":null,"abstract":"This study presents the issue of fatigue and its quantification by the means of psychophysiological indicators. For the purpose of the study, 24 hours experiment was proposed consisting of eight about an hour long simulated IFR flights. Eight students of the Department of Air Transport, Faculty of Transportation Sciences, Czech Technical University in Prague participated in the study, all with comparable theoretical and practical skills. During individual flights, ECG curve was recorded as a heart activity signal. From the ECG signal, individual RR intervals were extracted and subsequently an analysis in three areas was performed: time and frequency analysis and analysis by the means of Pointcaré plot. The acquired data were statistically evaluated and compared. Based on Friedman ANOVA and subsequent post-hoc analysis, statistically significant differences between first and sixth measurement were identified, which corresponded to the circadian low. It is also possible to claim that Pointcaré plot appears as a suitable means for fatigue quantification.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124575129","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 : 1900-01-01DOI: 10.1109/SAMI.2019.8782771
Bence Dávid, Gergő Láncz, Gergely Hunyady
Considering the major participants in the automotive industry, it is hard to find one without development connected to autonomous driving. This study provides insight to our work we did in collaboration with the Commercial Vehicle Systems Division of Knorr-Bremse Fékrendszerek Kft. Given the profile of the company, our topic focused on heavy duty commercial vehicles, although the discussed algorithms are not truck-specific. Behaviour planning for autonomous vehicles is complicated and versatile task. From both strategic and tactical aspects, the most secure and optimal series of manoeuvres must be found taking into account the given traffic scenario and vehicle state, while adapting continuously to the constant change of circumstances. In this paper we will outline an algorithm concept for behaviour planning using probabilistic and decision networks.
考虑到汽车产业的主要参与者，很难找到一个没有与自动驾驶相关的开发的公司。这项研究为我们与Knorr-Bremse f krendszerek Kft商用车系统部门合作所做的工作提供了见解。鉴于该公司的概况，我们的主题集中在重型商用车上，尽管所讨论的算法并不是针对卡车的。自动驾驶汽车的行为规划是一项复杂而通用的任务。从战略和战术两方面来看，必须考虑到给定的交通场景和车辆状态，同时不断适应不断变化的环境，找到最安全和最优的一系列演习。在本文中，我们将概述使用概率和决策网络进行行为规划的算法概念。
{"title":"Real-time Behaviour Planning Concept for Autonomous Vehicles","authors":"Bence Dávid, Gergő Láncz, Gergely Hunyady","doi":"10.1109/SAMI.2019.8782771","DOIUrl":"https://doi.org/10.1109/SAMI.2019.8782771","url":null,"abstract":"Considering the major participants in the automotive industry, it is hard to find one without development connected to autonomous driving. This study provides insight to our work we did in collaboration with the Commercial Vehicle Systems Division of Knorr-Bremse Fékrendszerek Kft. Given the profile of the company, our topic focused on heavy duty commercial vehicles, although the discussed algorithms are not truck-specific. Behaviour planning for autonomous vehicles is complicated and versatile task. From both strategic and tactical aspects, the most secure and optimal series of manoeuvres must be found taking into account the given traffic scenario and vehicle state, while adapting continuously to the constant change of circumstances. In this paper we will outline an algorithm concept for behaviour planning using probabilistic and decision networks.","PeriodicalId":240256,"journal":{"name":"2019 IEEE 17th World Symposium on Applied Machine Intelligence and Informatics (SAMI)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133348768","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
扫码关注我们
求助内容：
应助结果提醒方式：