Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895127
M. Markosyan, B. Yakubov, V. Artyukhin, R. Safin, Yelena Satimova
The paper presents the results of studies of three-point autogenerators operating in emergency mode, namely, as generators of chaotic signals. Studies were conducted to identify common signs of changes in the supply voltage on the parameters of the signals of chaotic generators.
{"title":"Study of Microwave Generator of Chaotic Oscillations Based on Elements with Lumped Parameters","authors":"M. Markosyan, B. Yakubov, V. Artyukhin, R. Safin, Yelena Satimova","doi":"10.1109/CSITechnol.2019.8895127","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895127","url":null,"abstract":"The paper presents the results of studies of three-point autogenerators operating in emergency mode, namely, as generators of chaotic signals. Studies were conducted to identify common signs of changes in the supply voltage on the parameters of the signals of chaotic generators.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121817496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8894943
V. Kvaratskhelia, M. Menteshashvili
In this communication a nonlocal modified characteristic problem for a second order quasi-linear equation with real characteristics is investigated.
研究了一类具有实数特征的二阶拟线性方程的非局部修正特征问题。
{"title":"Some Nonlinear Version of a Nonlocal Problem and Its Discrete Analogy","authors":"V. Kvaratskhelia, M. Menteshashvili","doi":"10.1109/CSITechnol.2019.8894943","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8894943","url":null,"abstract":"In this communication a nonlocal modified characteristic problem for a second order quasi-linear equation with real characteristics is investigated.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127068979","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895039
D. Asatryan
In this paper, a new measure for no-reference assessment of image quality based on the use of the structural properties of an image is proposed. As a measure, it is proposed to use the estimate of the Weibull distribution shape parameter, obtained by the set of image gradient magnitudes. This measure was previously successfully used to estimate the blurriness of the image. To test the effectiveness of the proposed measure, we used the data from the well-known TID2013 image database, which includes images of various types of distortions and corresponding mean opinion scores of the humans. The ability of the proposed measure is shown to distinguish the types of image distortions, which change the structural properties of an image.
{"title":"Novel Technique for Ro-Reference Image Quality Assessment","authors":"D. Asatryan","doi":"10.1109/CSITechnol.2019.8895039","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895039","url":null,"abstract":"In this paper, a new measure for no-reference assessment of image quality based on the use of the structural properties of an image is proposed. As a measure, it is proposed to use the estimate of the Weibull distribution shape parameter, obtained by the set of image gradient magnitudes. This measure was previously successfully used to estimate the blurriness of the image. To test the effectiveness of the proposed measure, we used the data from the well-known TID2013 image database, which includes images of various types of distortions and corresponding mean opinion scores of the humans. The ability of the proposed measure is shown to distinguish the types of image distortions, which change the structural properties of an image.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129665944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895031
E. Pogossian
Progressing outcomes of Artificial Intelligence in constructing basic, root cognizers able to develop to the artificial ones functionally equal to the highest human cognizers produce a significant consequences. In fact, AI proves that realities not only of cellular nature but also the ones constructed, assembled from ordinary available to humans units of matter can attain the highest cognizing of the universe, at least, comparable with one of humans.And since those artificial, constructed highest cognizers are only the assembles of units of matter unconstrained from the mysteries of the origin of cells it is expected to question the necessity of humans or some ones else in assembling, constructing the highest cognizers.In other words, to question the feasibility of origin of highest cognizers in frame of the acknowledged physics.This paper aims to enlighten the base of the above consequences and to track some steps of their grounding.
{"title":"Artificial Intelligence: Alternating the Highest Human Cognizing","authors":"E. Pogossian","doi":"10.1109/CSITechnol.2019.8895031","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895031","url":null,"abstract":"Progressing outcomes of Artificial Intelligence in constructing basic, root cognizers able to develop to the artificial ones functionally equal to the highest human cognizers produce a significant consequences. In fact, AI proves that realities not only of cellular nature but also the ones constructed, assembled from ordinary available to humans units of matter can attain the highest cognizing of the universe, at least, comparable with one of humans.And since those artificial, constructed highest cognizers are only the assembles of units of matter unconstrained from the mysteries of the origin of cells it is expected to question the necessity of humans or some ones else in assembling, constructing the highest cognizers.In other words, to question the feasibility of origin of highest cognizers in frame of the acknowledged physics.This paper aims to enlighten the base of the above consequences and to track some steps of their grounding.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"493 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121329175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895166
Michel Kulhandjian, L. Aslanyan, H. Sahakyan, Hovannes Kulhandjian, C. D’amours
In this paper, we present some of the interesting questions raised in the “5G and Beyond” workshop discussions. We propose to explore alternative solutions in other discipline such as algebraic combinatorics and discrete optimization. Construction of matrices that possess certain desirable properties in discrete tomography can be exploited for the 5th generation (5G) multiuser waveform design. Moreover, we propose to investigate thoroughly the random graph theory developed by Erdős and A. Rényi for 5G multiuser waveform design. Furthermore, we explore using the “Best Match” algorithm, which has a polynomial time complexity, in 5G communications.
在本文中，我们介绍了“5G及未来”研讨会讨论中提出的一些有趣的问题。我们建议探索其他学科的替代解决方案，如代数组合学和离散优化。在离散层析成像中具有某些理想特性的矩阵的构建可以用于第五代(5G)多用户波形设计。此外，我们建议深入研究Erdős和A. r nyi开发的用于5G多用户波形设计的随机图理论。此外，我们探索了在5G通信中使用具有多项式时间复杂度的“最佳匹配”算法。
{"title":"Multidisciplinary Discussion on 5G from the Viewpoint of Algebraic Combinatorics","authors":"Michel Kulhandjian, L. Aslanyan, H. Sahakyan, Hovannes Kulhandjian, C. D’amours","doi":"10.1109/CSITechnol.2019.8895166","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895166","url":null,"abstract":"In this paper, we present some of the interesting questions raised in the “5G and Beyond” workshop discussions. We propose to explore alternative solutions in other discipline such as algebraic combinatorics and discrete optimization. Construction of matrices that possess certain desirable properties in discrete tomography can be exploited for the 5th generation (5G) multiuser waveform design. Moreover, we propose to investigate thoroughly the random graph theory developed by Erdős and A. Rényi for 5G multiuser waveform design. Furthermore, we explore using the “Best Match” algorithm, which has a polynomial time complexity, in 5G communications.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126773297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895233
Hovhannes Gomcyan, Robert Apikyan
C/A codes (course acquisition codes) are pseudo-random generated codes with good correlation properties. Those codes are being used in GPS. Each satellite vehicle can generate its unique C/A code sequence and modulate it with the output data signal. Each millisecond of satellite data contains 1024 chips (bits) of C/A codes and each 1ms this code sequences are being repeated. Receivers are using locally generated C/A codes in to filter out the satellite signal from aggregated signals near the receiver’s antenna. As the C/A codes are being repeated in each 1ms, in theory, it’s enough of 1ms satellite signal to determine from which satellite it is coming. C/A code’s correlation properties are being used for filtering incoming signals. The higher is the autocorrelation properties of the code sequence, the easier to filter it out from the summary signal. In other words, the same C/A codes have high correlation values and different C/A codes have low correlation values. The target of this article is to write a program using genetic algorithms that will generate code sequences from 1 and −1 values that will have nearly the same correlation properties as the C/A code, where each individual in algorithm will contain 32 number of code sequences with 1024 length that has low cross-correlation and high autocorrelation properties.
{"title":"Code Sequence Generation with Genetic Algorithms, with Correlation Properties Similar to GPS C/A Codes","authors":"Hovhannes Gomcyan, Robert Apikyan","doi":"10.1109/CSITechnol.2019.8895233","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895233","url":null,"abstract":"C/A codes (course acquisition codes) are pseudo-random generated codes with good correlation properties. Those codes are being used in GPS. Each satellite vehicle can generate its unique C/A code sequence and modulate it with the output data signal. Each millisecond of satellite data contains 1024 chips (bits) of C/A codes and each 1ms this code sequences are being repeated. Receivers are using locally generated C/A codes in to filter out the satellite signal from aggregated signals near the receiver’s antenna. As the C/A codes are being repeated in each 1ms, in theory, it’s enough of 1ms satellite signal to determine from which satellite it is coming. C/A code’s correlation properties are being used for filtering incoming signals. The higher is the autocorrelation properties of the code sequence, the easier to filter it out from the summary signal. In other words, the same C/A codes have high correlation values and different C/A codes have low correlation values. The target of this article is to write a program using genetic algorithms that will generate code sequences from 1 and −1 values that will have nearly the same correlation properties as the C/A code, where each individual in algorithm will contain 32 number of code sequences with 1024 length that has low cross-correlation and high autocorrelation properties.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121482738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895161
Jing Ren, Rui Ren, Mark Green, Xishi Huang
Due to the increased complexity in actuators and sensors, unmanned ground vehicles have a better chance to generate faults in the course of operation. An untreated fault can result in a failure, which may lead to catastrophic consequences. In this paper, we propose a deep learning method using both input and output signals of the vehicles to learn the features of different faults reflected in the dynamic models of unmanned vehicles. We have applied the proposed method to detect and classify multiplicative and additive faults, as well as the faults that result in malfunction of the actuators. The results show that the proposed deep learning method can accurately detect and classify multiple types of faults, which are caused by different sources.
{"title":"A Deep Learning Method for Multiple Faults Detection and Classification of Unmanned Ground Vehicles","authors":"Jing Ren, Rui Ren, Mark Green, Xishi Huang","doi":"10.1109/CSITechnol.2019.8895161","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895161","url":null,"abstract":"Due to the increased complexity in actuators and sensors, unmanned ground vehicles have a better chance to generate faults in the course of operation. An untreated fault can result in a failure, which may lead to catastrophic consequences. In this paper, we propose a deep learning method using both input and output signals of the vehicles to learn the features of different faults reflected in the dynamic models of unmanned vehicles. We have applied the proposed method to detect and classify multiplicative and additive faults, as well as the faults that result in malfunction of the actuators. The results show that the proposed deep learning method can accurately detect and classify multiple types of faults, which are caused by different sources.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124847746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895176
K. Amirkhanyan, V. Vardanian
In this paper, we defined a new logical organization of a group of memory instances of the same size and structure, called a memory system (MS). A few scrambling types defined earlier for conventional SRAM memory instances are extended for MS that are widely used nowadays in semiconductor industry. It is observed that the defined scrambling types may increase the efficiency of solving several problems of test and repair connected with memory systems.
{"title":"On a Few Scrambling Types for Memory Systems","authors":"K. Amirkhanyan, V. Vardanian","doi":"10.1109/CSITechnol.2019.8895176","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895176","url":null,"abstract":"In this paper, we defined a new logical organization of a group of memory instances of the same size and structure, called a memory system (MS). A few scrambling types defined earlier for conventional SRAM memory instances are extended for MS that are widely used nowadays in semiconductor industry. It is observed that the defined scrambling types may increase the efficiency of solving several problems of test and repair connected with memory systems.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129096658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895245
A. Kostanyan, Arevik Harmandayan
The problem of segmentation of a given string to match a fuzzy pattern is considered in this paper. The fuzzy pattern is defined as a sequence of fuzzy properties. It is assumed that each string can match a fuzzy property in some measure. Being increasing, decreasing, or oscillating are examples of fuzzy properties of a numerical sequence. The problem we consider is how to split the given string (sequence) into sufficiently long substrings (contiguous subsequences) to match the pattern as well as possible. This problem can be considered in the frame of the fuzzy clustering problem that has many applications in such areas as image processing, bioinformatics, etc. It can also be viewed as a special case of the fuzzy string matching problem. In this paper, we propose the optimal solution to the fuzzy segmentation problem and consider its application to the decomposition of a given function.
{"title":"Mapping a Fuzzy Pattern onto a String","authors":"A. Kostanyan, Arevik Harmandayan","doi":"10.1109/CSITechnol.2019.8895245","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895245","url":null,"abstract":"The problem of segmentation of a given string to match a fuzzy pattern is considered in this paper. The fuzzy pattern is defined as a sequence of fuzzy properties. It is assumed that each string can match a fuzzy property in some measure. Being increasing, decreasing, or oscillating are examples of fuzzy properties of a numerical sequence. The problem we consider is how to split the given string (sequence) into sufficiently long substrings (contiguous subsequences) to match the pattern as well as possible. This problem can be considered in the frame of the fuzzy clustering problem that has many applications in such areas as image processing, bioinformatics, etc. It can also be viewed as a special case of the fuzzy string matching problem. In this paper, we propose the optimal solution to the fuzzy segmentation problem and consider its application to the decomposition of a given function.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131456783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2019-09-01DOI: 10.1109/csitechnol.2019.8895064
{"title":"[CSIT 2019 Title Page]","authors":"","doi":"10.1109/csitechnol.2019.8895064","DOIUrl":"https://doi.org/10.1109/csitechnol.2019.8895064","url":null,"abstract":"","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123870809","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
扫码关注我们
求助内容：
应助结果提醒方式：