Pub Date : 2017-09-01DOI: 10.1109/csitechnol.2017.8312131
Arsen H. Mokatsian
Let us adduce some definitions: If a recursively enumerable (r.e.) set A is a disjoint union of two sets B and C, then we say that B, C is an r.e. splitting of A The r.e. set A is tt-mitotic (btt-mitotic) if there is an r.e. splitting (B, C) of A such that the sets B and C both belong to the same tt — (btt -) degree of unsolvability, as the set A. In this paper the existence of the tt-mitotic hypersimple set, which is not btt-mitotic is proved.
{"title":"On the existence of the tt-mitotic hypersimple set which is not btt-mitotic","authors":"Arsen H. Mokatsian","doi":"10.1109/csitechnol.2017.8312131","DOIUrl":"https://doi.org/10.1109/csitechnol.2017.8312131","url":null,"abstract":"Let us adduce some definitions: If a recursively enumerable (r.e.) set A is a disjoint union of two sets B and C, then we say that B, C is an r.e. splitting of A The r.e. set A is tt-mitotic (btt-mitotic) if there is an r.e. splitting (B, C) of A such that the sets B and C both belong to the same tt — (btt -) degree of unsolvability, as the set A. In this paper the existence of the tt-mitotic hypersimple set, which is not btt-mitotic is proved.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124104631","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312167
Marina Khachaturyan
Increasing the effectiveness of learning Armenian as a Second Language with the use of technology that helps to cover challenges of education and preservation of the national and cultural identity of Armenians in Diaspora via language are considered in the study. The research is conducted basing on the online teaching and instructing experience under the large number of students of different age, educational background and origin. Basing on the multiyear maintenance of the built system it is concluded that one of the biggest advantages of the system is guidance and facilitation in the personal environment via Online Instructor (OI) which gives students the possibility to learn and acquire language through natural communication, interaction and discussions with OI and classmates. A brief overview of the chosen online pedagogy principles and used approaches for their effectiveness measurement jointly with the implementation peculiarities is performed.
{"title":"First steps in building emergent view on teaching and learning Armenian as a second language via technology","authors":"Marina Khachaturyan","doi":"10.1109/CSITECHNOL.2017.8312167","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312167","url":null,"abstract":"Increasing the effectiveness of learning Armenian as a Second Language with the use of technology that helps to cover challenges of education and preservation of the national and cultural identity of Armenians in Diaspora via language are considered in the study. The research is conducted basing on the online teaching and instructing experience under the large number of students of different age, educational background and origin. Basing on the multiyear maintenance of the built system it is concluded that one of the biggest advantages of the system is guidance and facilitation in the personal environment via Online Instructor (OI) which gives students the possibility to learn and acquire language through natural communication, interaction and discussions with OI and classmates. A brief overview of the chosen online pedagogy principles and used approaches for their effectiveness measurement jointly with the implementation peculiarities is performed.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128068097","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312159
T. Davitashvili, H. Meladze, N. Skhirtladze
In the present work, the initial-boundary problem with non-local contact condition for heat (diffusion) equation is considered. For the stated problem, the existence and uniqueness of the solution is proved. The constructed iteration process allows one to reduce the solution of the initial non-classical problem to the solution of a sequence of classical Cauchy-Dirichlet problems. The convergence of the proposed iterative process is proved; the speed of convergence is estimated. The algorithm is suitable for parallel implementation. The specific problem is considered as an example and solved numerically.
{"title":"About one parallel algorithm of solving non-local contact problem for parabolic equations","authors":"T. Davitashvili, H. Meladze, N. Skhirtladze","doi":"10.1109/CSITECHNOL.2017.8312159","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312159","url":null,"abstract":"In the present work, the initial-boundary problem with non-local contact condition for heat (diffusion) equation is considered. For the stated problem, the existence and uniqueness of the solution is proved. The constructed iteration process allows one to reduce the solution of the initial non-classical problem to the solution of a sequence of classical Cauchy-Dirichlet problems. The convergence of the proposed iterative process is proved; the speed of convergence is estimated. The algorithm is suitable for parallel implementation. The specific problem is considered as an example and solved numerically.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130530389","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312156
H. Melkonyan, A. Gevorgyan, S. Sargsyan, V. Sahakyan, Z. Petrosyan, Hasmik Panyan, R. Abrahamyan, H. Astsatryan, Yuri Shoukorian
The number of extreme weather events including strong frosts, cold waves, heat waves, droughts, hails, strong winds has increased in Armenia by 20% during the last 20 years. The paper studies the formation of cold-air pools in Ararat Valley, Armenia during the winter season. Observational data from 47 meteorological stations of Armenia were used, and daily minimum temperatures lower than −10 °C were assessed over the period 1966–2017. December, 2016 was considered as the 4-th coldest month, after the years 2013, 2002 and 1973. The focus area of this study is the low-elevated basin of Ararat Valley for which climatological analysis of winter temperature regime has been performed. Monthly average temperatures for December were significantly below normal values, particularly, for low-elevated part of Ararat Valley. 24-hour simulations derived from Weather Research and Forecasting model (WRF) were used to assess the WRF model's capabilities to reproduce strong cold-air pool (CAP) over the Ararat Valley observed on 20 December 2016 when minimum temperatures decreased up to −20 °C and lower. The WRF model was applied with spatial resolutions of 9 and 3 km and 65 vertical levels based on Global Forecast System model's (GFS) initial and boundary conditions at 0.25×0.25 deg. resolution.
{"title":"An analysis of wintertime cold-air pool in Armenia using climatological observations and WRF model data","authors":"H. Melkonyan, A. Gevorgyan, S. Sargsyan, V. Sahakyan, Z. Petrosyan, Hasmik Panyan, R. Abrahamyan, H. Astsatryan, Yuri Shoukorian","doi":"10.1109/CSITECHNOL.2017.8312156","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312156","url":null,"abstract":"The number of extreme weather events including strong frosts, cold waves, heat waves, droughts, hails, strong winds has increased in Armenia by 20% during the last 20 years. The paper studies the formation of cold-air pools in Ararat Valley, Armenia during the winter season. Observational data from 47 meteorological stations of Armenia were used, and daily minimum temperatures lower than −10 °C were assessed over the period 1966–2017. December, 2016 was considered as the 4-th coldest month, after the years 2013, 2002 and 1973. The focus area of this study is the low-elevated basin of Ararat Valley for which climatological analysis of winter temperature regime has been performed. Monthly average temperatures for December were significantly below normal values, particularly, for low-elevated part of Ararat Valley. 24-hour simulations derived from Weather Research and Forecasting model (WRF) were used to assess the WRF model's capabilities to reproduce strong cold-air pool (CAP) over the Ararat Valley observed on 20 December 2016 when minimum temperatures decreased up to −20 °C and lower. The WRF model was applied with spatial resolutions of 9 and 3 km and 65 vertical levels based on Global Forecast System model's (GFS) initial and boundary conditions at 0.25×0.25 deg. resolution.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115142156","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 : 2017-09-01DOI: 10.1109/csitechnol.2017.8312130
S. Manukian
The relations between the classes of positive and strongly positive arithmetical sets are investigated. Some simplified form for the logical representation of the class of positive sets is obtained. It is proved that the logical representation of the class of positive sets is obtained when the list of operations &, ∨ in the definition of the class of strongly positive sets is replaced by the list, ∃ &, ∨.
{"title":"On the structure of positive and strongly positive arithmetical sets","authors":"S. Manukian","doi":"10.1109/csitechnol.2017.8312130","DOIUrl":"https://doi.org/10.1109/csitechnol.2017.8312130","url":null,"abstract":"The relations between the classes of positive and strongly positive arithmetical sets are investigated. Some simplified form for the logical representation of the class of positive sets is obtained. It is proved that the logical representation of the class of positive sets is obtained when the list of operations &, ∨ in the definition of the class of strongly positive sets is replaced by the list, ∃ &, ∨.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127114620","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312154
Aleksei Marov, A. Uteshev
We aim to construct a version of the Reed-Solomon coding procedure which admits an easy extension when the number of checksums has to be increased due to the rise of the expected error rate.
{"title":"Reed-Solomon coding: Variated redundancy and matrix formalism","authors":"Aleksei Marov, A. Uteshev","doi":"10.1109/CSITECHNOL.2017.8312154","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312154","url":null,"abstract":"We aim to construct a version of the Reed-Solomon coding procedure which admits an easy extension when the number of checksums has to be increased due to the rise of the expected error rate.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130180175","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312148
L. Aslanyan
The Multiple Longest Common Subsequence (MLCS) problem is aimed at constructing a maximum length subsequence, common to a given set of sequences, defined on some finite alphabet of symbols. The paper considers the particular case of two input sequences (LCS), which is simply extendable to the general MLCS problem. We consider the problem in an online manner, where symbols arrive one-by-one and the next acquired symbol is appending any one of the two input sequences. The sought-for LCS algorithm acts by recursive handling of parts of sequences arrived so far, constructing and updating specific supportive structures of markers representing the interrelations of the longest common subsequences of the two input sequences. In paper we discuss a perfect online parallelization framework of the algorithm for the “simple” memory model, so that the parallel complexity becomes O(mn/t) for t parallel threads. The general outcome of paper is the use of vector markers instead of matrix markers or graphs, which helps in minimization of the memory, used by the algorithm.
{"title":"LCS algorithm with vector-markers","authors":"L. Aslanyan","doi":"10.1109/CSITECHNOL.2017.8312148","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312148","url":null,"abstract":"The Multiple Longest Common Subsequence (MLCS) problem is aimed at constructing a maximum length subsequence, common to a given set of sequences, defined on some finite alphabet of symbols. The paper considers the particular case of two input sequences (LCS), which is simply extendable to the general MLCS problem. We consider the problem in an online manner, where symbols arrive one-by-one and the next acquired symbol is appending any one of the two input sequences. The sought-for LCS algorithm acts by recursive handling of parts of sequences arrived so far, constructing and updating specific supportive structures of markers representing the interrelations of the longest common subsequences of the two input sequences. In paper we discuss a perfect online parallelization framework of the algorithm for the “simple” memory model, so that the parallel complexity becomes O(mn/t) for t parallel threads. The general outcome of paper is the use of vector markers instead of matrix markers or graphs, which helps in minimization of the memory, used by the algorithm.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126846303","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312168
G. Margarov, Gohar Tomeyan, M. Pereira
In the academic context, it is very important to evaluate the uniqueness of reports, scientific papers and other documents that are everyday disseminated on the web. There are already several tools with this purpose but not for Armenian texts. In this paper, a system to analyze the similarity of Armenian documents is presented. The idea is to collect a set of documents of the same domain in order to identify keywords. Then, based on that information, the system receives two documents and compares them calculating the probability of plagiarism. For that, an approach based on several levels of analysis is implemented and some of those steps allow the user interaction choosing options or adding more information.
{"title":"Plagiarism detection system for Armenian language","authors":"G. Margarov, Gohar Tomeyan, M. Pereira","doi":"10.1109/CSITECHNOL.2017.8312168","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312168","url":null,"abstract":"In the academic context, it is very important to evaluate the uniqueness of reports, scientific papers and other documents that are everyday disseminated on the web. There are already several tools with this purpose but not for Armenian texts. In this paper, a system to analyze the similarity of Armenian documents is presented. The idea is to collect a set of documents of the same domain in order to identify keywords. Then, based on that information, the system receives two documents and compares them calculating the probability of plagiarism. For that, an approach based on several levels of analysis is implemented and some of those steps allow the user interaction choosing options or adding more information.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131354541","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312126
V. Hovnanyan, S. Poghosyan, V. Poghosyan
In this paper we consider the gossiping process implemented on several modifications of Knödel graphs. We show the ability of Knödel graphs to remain good network topology for gossiping even in case of cyclic permutation of the weights of its edges. We show that the modified graphs are still able to gossip and not isomorphic to Knödel graphs for any even value of n. The results obtained in this paper makes it possible to construct edge-disjoint paths between any pairs of vertices in the Knödel graph.
{"title":"Gossiping properties of the edge-permuted Knödel graphs","authors":"V. Hovnanyan, S. Poghosyan, V. Poghosyan","doi":"10.1109/CSITECHNOL.2017.8312126","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312126","url":null,"abstract":"In this paper we consider the gossiping process implemented on several modifications of Knödel graphs. We show the ability of Knödel graphs to remain good network topology for gossiping even in case of cyclic permutation of the weights of its edges. We show that the modified graphs are still able to gossip and not isomorphic to Knödel graphs for any even value of n. The results obtained in this paper makes it possible to construct edge-disjoint paths between any pairs of vertices in the Knödel graph.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130352243","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 : 2017-09-01DOI: 10.1109/CSITECHNOL.2017.8312165
M. Markosyan, R. Safin, V. Artyukhin, Elena Satimova
Due to the transition from analog to digital format, it possible to use IP-protocol for video surveillance systems. In addition, wireless access, color systems with higher resolution, biometrics, intelligent sensors, software for performing video analytics are becoming increasingly widespread. The paper considers only the calculation of the error probability (BER — Bit Error Rate) depending on the realized value of S/N.
由于从模拟到数字格式的过渡，ip协议可以用于视频监控系统。此外，无线接入、更高分辨率的色彩系统、生物识别技术、智能传感器、用于执行视频分析的软件正变得越来越普遍。本文只考虑基于信噪比实现值的误码率(BER - Bit error Rate)的计算。
{"title":"Determination of the Eb/N0 ratio and calculation of the probability of an error in the digital communication channel of the IP-video surveillance system","authors":"M. Markosyan, R. Safin, V. Artyukhin, Elena Satimova","doi":"10.1109/CSITECHNOL.2017.8312165","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312165","url":null,"abstract":"Due to the transition from analog to digital format, it possible to use IP-protocol for video surveillance systems. In addition, wireless access, color systems with higher resolution, biometrics, intelligent sensors, software for performing video analytics are becoming increasingly widespread. The paper considers only the calculation of the error probability (BER — Bit Error Rate) depending on the realized value of S/N.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114250855","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
扫码关注我们
求助内容：
应助结果提醒方式：