Pub Date : 2020-11-25DOI: 10.1109/EnT50437.2020.9431264
Martvel George
The problem of the high complexity of calculating the series of spherical functions included in the expansion of the Earth's gravitational potential is considered. To solve this problem, an interpolation model is proposed, which makes it possible to substantially optimize the process of calculating the geopotential with insignificant losses in accuracy.
{"title":"Geopotential Calculations Optimisation","authors":"Martvel George","doi":"10.1109/EnT50437.2020.9431264","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431264","url":null,"abstract":"The problem of the high complexity of calculating the series of spherical functions included in the expansion of the Earth's gravitational potential is considered. To solve this problem, an interpolation model is proposed, which makes it possible to substantially optimize the process of calculating the geopotential with insignificant losses in accuracy.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123634780","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-25DOI: 10.1109/EnT50437.2020.9431269
Huu Loc Pham
We consider method to compute term rank of a matrix based on the construction a bipartite graph. The term rank of a matrix $A$ is defined to be the minimum number of rows and columns that contain all non-zero elements of the matrix. In this article, we will discuss the Ford-Fulkerson algorithm for the maximum flow problem. Next, we propose modeling the algorithm in the MATLAB environment. The application of this algorithm for evaluating the characteristics of codes in a term-rank metric is considered.
本文研究了基于二部图构造的矩阵项秩的计算方法。矩阵$ a $的秩被定义为包含矩阵中所有非零元素的最小行数和列数。在本文中，我们将讨论最大流量问题的Ford-Fulkerson算法。接下来，我们提出在MATLAB环境下对算法进行建模。研究了该算法在项秩度量中码的特征评价中的应用。
{"title":"Algorithm to compute term rank of a matrix based on the construction a bipartite graph","authors":"Huu Loc Pham","doi":"10.1109/EnT50437.2020.9431269","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431269","url":null,"abstract":"We consider method to compute term rank of a matrix based on the construction a bipartite graph. The term rank of a matrix $A$ is defined to be the minimum number of rows and columns that contain all non-zero elements of the matrix. In this article, we will discuss the Ford-Fulkerson algorithm for the maximum flow problem. Next, we propose modeling the algorithm in the MATLAB environment. The application of this algorithm for evaluating the characteristics of codes in a term-rank metric is considered.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126926777","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-25DOI: 10.1109/EnT50437.2020.9431243
Son Le, E. Likhobabin
In this paper, we propose a “bit duplication” design method for rate-compatible low-density parity-check codes (LDPC). The main idea of the method is to change the structure of codewords during its transmission over the communication system. This method can be effectively applied to create a set of codes, allowing to obtain lower-rate codes from the mother codes. To evaluate the proposed method, the dependence of the bit error probability on the signal-to-noise ratio (SNR) was simulated in Matlab. The result shows that the proposed method is superior to the conventional method of puncturing information bits.
{"title":"Design of Rate-Compatible Low-Density Parity-Check Codes with Constant Check Matrix","authors":"Son Le, E. Likhobabin","doi":"10.1109/EnT50437.2020.9431243","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431243","url":null,"abstract":"In this paper, we propose a “bit duplication” design method for rate-compatible low-density parity-check codes (LDPC). The main idea of the method is to change the structure of codewords during its transmission over the communication system. This method can be effectively applied to create a set of codes, allowing to obtain lower-rate codes from the mother codes. To evaluate the proposed method, the dependence of the bit error probability on the signal-to-noise ratio (SNR) was simulated in Matlab. The result shows that the proposed method is superior to the conventional method of puncturing information bits.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134556816","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}
China's Convergent Digital Radio (CDR) and Rus-sia's Real-time Audio Visual Information System (RAVIS) are two digital audio broadcasting systems in Frequency Modulation band. Due to the two countries' unique geographic locations and their long shared broader, the efficiency of both systems in the coexistence of the other is required to be evaluated. This paper discusses the compatibility of CDR and RAVIS by conducting a number of tests and demonstrating the working efficiency of both systems under interference of the other. In the tests, Carrier-to-Noise-Threshold (C/N) for RAVIS under different channel models were tested. Signal-to-interference ratio (S/I) of both systems under interference of the other are evaluated.
{"title":"Compatibility Tests of Digital Terrestrial Audio Broadcasting Systems CDR and RAVIS","authors":"Shuyu Wang, Chao Zhang, Changyong Pan, Guoting Zhang","doi":"10.1109/EnT50437.2020.9431253","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431253","url":null,"abstract":"China's Convergent Digital Radio (CDR) and Rus-sia's Real-time Audio Visual Information System (RAVIS) are two digital audio broadcasting systems in Frequency Modulation band. Due to the two countries' unique geographic locations and their long shared broader, the efficiency of both systems in the coexistence of the other is required to be evaluated. This paper discusses the compatibility of CDR and RAVIS by conducting a number of tests and demonstrating the working efficiency of both systems under interference of the other. In the tests, Carrier-to-Noise-Threshold (C/N) for RAVIS under different channel models were tested. Signal-to-interference ratio (S/I) of both systems under interference of the other are evaluated.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122698749","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-25DOI: 10.1109/ent50437.2020.9431257
Pankaj Tyagi, Anupama Vishwakarma, U. Tiwary, P. Varadwaj
As compared to smell, other senses like touch, taste, vision, and hearing are highly predictable. Though, it is very difficult to predict the smell perception of a molecule from its molecular properties. It is reported that structurally very similar types of molecules can produce a different smell, and structurally very different types of molecules can produce the nearly same smell. The goal of the manuscript is to have a comparative performance measure between the existing machine learning algorithms like ANN, SVR, DTR, RFR, and CNN, while using the DREAM olfaction challenge dataset and a series of defined feature set. In this paper, we have used machine learning approach to predict the Molecular olfactory perception based on the molecular descriptors of structurally different molecules. 4884 molecular descriptors of 472 structurally different molecules were used in this study. In terms of machine learning, it's a multi-input and multi-output regression problem and every feature need to be combined to give output in 21 targets. In this study, Artificial Neural Network (ANN), Decision Tree Regressor (DTR), Support Vector Machine (SVR), Convolution Neural Network (CNN), and Random Forest Regressor (RFR) has been used to predict the olfactory perception of a molecule. For the validation of our model R-Squared method with residual plots has been used. Mean Squared Error (MSE) and Mean Absolute Error (MAE) has been used for Error calculation. The ANN regression model performed better than all the other models used in this study. For the ANN regression model, MSE and MAE were 44.56 and 4.19 respectively.
{"title":"Predicting Smell Perception from Molecular Descriptors Using Machine Learning Approach","authors":"Pankaj Tyagi, Anupama Vishwakarma, U. Tiwary, P. Varadwaj","doi":"10.1109/ent50437.2020.9431257","DOIUrl":"https://doi.org/10.1109/ent50437.2020.9431257","url":null,"abstract":"As compared to smell, other senses like touch, taste, vision, and hearing are highly predictable. Though, it is very difficult to predict the smell perception of a molecule from its molecular properties. It is reported that structurally very similar types of molecules can produce a different smell, and structurally very different types of molecules can produce the nearly same smell. The goal of the manuscript is to have a comparative performance measure between the existing machine learning algorithms like ANN, SVR, DTR, RFR, and CNN, while using the DREAM olfaction challenge dataset and a series of defined feature set. In this paper, we have used machine learning approach to predict the Molecular olfactory perception based on the molecular descriptors of structurally different molecules. 4884 molecular descriptors of 472 structurally different molecules were used in this study. In terms of machine learning, it's a multi-input and multi-output regression problem and every feature need to be combined to give output in 21 targets. In this study, Artificial Neural Network (ANN), Decision Tree Regressor (DTR), Support Vector Machine (SVR), Convolution Neural Network (CNN), and Random Forest Regressor (RFR) has been used to predict the olfactory perception of a molecule. For the validation of our model R-Squared method with residual plots has been used. Mean Squared Error (MSE) and Mean Absolute Error (MAE) has been used for Error calculation. The ANN regression model performed better than all the other models used in this study. For the ANN regression model, MSE and MAE were 44.56 and 4.19 respectively.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124582905","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-25DOI: 10.1109/EnT50437.2020.9431272
V. V. Berezhnoy, E. Kuchukova
Creation of reliable and secure cloud storage is a complicated task, since this type of data storage and processing is efficient and cost effective. The Residue Number System (RNS) can be used to achieve the required level of data security and reliability. RNS is a non-positional number system, the use of which for data protection is promising. Redundant RNS allows the creation of correction codes. Such properties of error-correction codes as effectiveness, safety and reliability depend on the redundancy of the RNS. This paper evaluates the effectiveness of the RNS correction codes usage in multi-cloud data storage and processing systems by examining various sets of RNS moduli.
{"title":"Analysis of Residue Number System Corrective Properties for Designing Reliable Cloud Storage","authors":"V. V. Berezhnoy, E. Kuchukova","doi":"10.1109/EnT50437.2020.9431272","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431272","url":null,"abstract":"Creation of reliable and secure cloud storage is a complicated task, since this type of data storage and processing is efficient and cost effective. The Residue Number System (RNS) can be used to achieve the required level of data security and reliability. RNS is a non-positional number system, the use of which for data protection is promising. Redundant RNS allows the creation of correction codes. Such properties of error-correction codes as effectiveness, safety and reliability depend on the redundancy of the RNS. This paper evaluates the effectiveness of the RNS correction codes usage in multi-cloud data storage and processing systems by examining various sets of RNS moduli.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127764655","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-25DOI: 10.1109/EnT50437.2020.9431275
I. Levitsky, Yaroslav Okatev, E. Khorov
A key technology proposed to significantly increase the capacity of next-generation Wi-Fi networks is multi-link, which will be included in the IEEE 802.11be standard, aka Wi-Fi 7. Multi-link allows a device to operate on multiple channels simultaneously. However, simultaneous reception and transmission (STR) on various channels may be impossible because of cross-link interference at the device, leading to a performance drop. The article examines STR feasibility, depending on the spectral distance between channels, bandwidth, and interference power. The paper shows how the frame receive ratio depends on the transmission and interference parameters, which is obtained with a testbed based on the software-defined radios. Conditions, when STR is possible, are found. From our results, we derive the spectral distance boundary where STR is possible. Also, the signal reception procedure is studied, and remarks on the receiver design are given.
{"title":"Study on Simultaneous Transmission and Reception on Multiple Links in IEEE 802.11be networks","authors":"I. Levitsky, Yaroslav Okatev, E. Khorov","doi":"10.1109/EnT50437.2020.9431275","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431275","url":null,"abstract":"A key technology proposed to significantly increase the capacity of next-generation Wi-Fi networks is multi-link, which will be included in the IEEE 802.11be standard, aka Wi-Fi 7. Multi-link allows a device to operate on multiple channels simultaneously. However, simultaneous reception and transmission (STR) on various channels may be impossible because of cross-link interference at the device, leading to a performance drop. The article examines STR feasibility, depending on the spectral distance between channels, bandwidth, and interference power. The paper shows how the frame receive ratio depends on the transmission and interference parameters, which is obtained with a testbed based on the software-defined radios. Conditions, when STR is possible, are found. From our results, we derive the spectral distance boundary where STR is possible. Also, the signal reception procedure is studied, and remarks on the receiver design are given.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126247924","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-25DOI: 10.1109/EnT50437.2020.9431317
Yu. Z. Kovalev, Timur Bergaliyev, S. Sakhno
A system has been created for controlling devices using EMG signals from a small number of sensors by recognizing signal sections corresponding to the operator's gestures. The solution implements a scheme of three independent components: sensors, a user interface and a data processor, connected by a simple data transfer protocol, which allows replacing any of the parts if necessary. Software has the realization of the most popular ML-algorithms, which widely used for EMG gesture recognition and intuitive GUI. It allows to use machine learning algorithms to users without any special background.
{"title":"An Interactive System for the Study of EMG Signal ML-Processing and Prototyping of Human-Machine Interfaces","authors":"Yu. Z. Kovalev, Timur Bergaliyev, S. Sakhno","doi":"10.1109/EnT50437.2020.9431317","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431317","url":null,"abstract":"A system has been created for controlling devices using EMG signals from a small number of sensors by recognizing signal sections corresponding to the operator's gestures. The solution implements a scheme of three independent components: sensors, a user interface and a data processor, connected by a simple data transfer protocol, which allows replacing any of the parts if necessary. Software has the realization of the most popular ML-algorithms, which widely used for EMG gesture recognition and intuitive GUI. It allows to use machine learning algorithms to users without any special background.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132122671","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-25DOI: 10.1109/EnT50437.2020.9431283
V. Spivak, A. Tartakovsky
In many problems of the initialization of objects' tracks, changepoint detection algorithms can be used. In the past when computational complexity was an issue, the $K$ / $N$ algorithm gained its popularity due to computational simplicity. Nowadays with the tremendous progress in computing technology, the problem of finding more efficient detection and track initiation algorithms is urgent. A substantially more efficient track initiation algorithm can be built based on the sequential change detection technique. In this paper, we consider the Finite Moving Average algorithm. We compare the performance of the $K$ / $N$ algorithm and the Finite Moving Average algorithm. The optimality criterion is to maximize the probability of correct detection in a certain time interval under the given false alarm risk measured as the local probability of a false alarm. For performance, we obtain a theoretical estimate and an estimate by Monte Carlo (MC) simulations. The results show that the Finite Moving Average algorithm performs significantly better than the $K$ / $N$ procedure.
{"title":"Efficient Algorithm for Initialization of Object Tracks Based on Changepoint Detection Method","authors":"V. Spivak, A. Tartakovsky","doi":"10.1109/EnT50437.2020.9431283","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431283","url":null,"abstract":"In many problems of the initialization of objects' tracks, changepoint detection algorithms can be used. In the past when computational complexity was an issue, the $K$ / $N$ algorithm gained its popularity due to computational simplicity. Nowadays with the tremendous progress in computing technology, the problem of finding more efficient detection and track initiation algorithms is urgent. A substantially more efficient track initiation algorithm can be built based on the sequential change detection technique. In this paper, we consider the Finite Moving Average algorithm. We compare the performance of the $K$ / $N$ algorithm and the Finite Moving Average algorithm. The optimality criterion is to maximize the probability of correct detection in a certain time interval under the given false alarm risk measured as the local probability of a false alarm. For performance, we obtain a theoretical estimate and an estimate by Monte Carlo (MC) simulations. The results show that the Finite Moving Average algorithm performs significantly better than the $K$ / $N$ procedure.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132589145","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-25DOI: 10.1109/EnT50437.2020.9431305
D. Klygach, M. Vakhitov, Vladimir Zhivulin, D. Vinnik
The paper describes a method for measuring electrodynamic parameters in the frequency range from 10 MHz to 18 GHz at temperatures up to -180 °C. The measurement results are given for an empty transmission line and the line filled with the test material. Frequency dependences of the S-parameters depending on the sample temperature are shown.
{"title":"Measurements of Electrodynamic Parameters at Low Temperatures in the Frequency Range up to 18 GHz","authors":"D. Klygach, M. Vakhitov, Vladimir Zhivulin, D. Vinnik","doi":"10.1109/EnT50437.2020.9431305","DOIUrl":"https://doi.org/10.1109/EnT50437.2020.9431305","url":null,"abstract":"The paper describes a method for measuring electrodynamic parameters in the frequency range from 10 MHz to 18 GHz at temperatures up to -180 °C. The measurement results are given for an empty transmission line and the line filled with the test material. Frequency dependences of the S-parameters depending on the sample temperature are shown.","PeriodicalId":129694,"journal":{"name":"2020 International Conference Engineering and Telecommunication (En&T)","volume":" 45","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113952024","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
扫码关注我们
求助内容：
应助结果提醒方式：