发布求助
文献互助 智能选刊 最新文献

2017 Computer Science and Information Technologies (CSIT)最新文献

筛选
英文 中文
Reachability confirmation of statically detected defects using dynamic analysis 利用动态分析确定静态检测缺陷的可达性
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/CSITECHNOL.2017.8312141
A. Gerasimov, L. Kruglov
{"title":"Reachability confirmation of statically detected defects using dynamic analysis","authors":"A. Gerasimov, L. Kruglov","doi":"10.1109/CSITECHNOL.2017.8312141","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312141","url":null,"abstract":"Static and dynamic analysis of programs are well known approaches to the problem of automatic program behaviour analysis. Both methods have advantages and limitations. Static analysis has lack of precision for the sake of scalability. On the other hand, dynamic analysis has 100% precision while reaching defect point, but suffers from scalability issues. This paper describes an approach to confirmation of reachability of source-sink defects that were found by static analysis with help of dynamic analysis. The combination of methods allows to circumvent limitations and multiply their advantages. Preliminary experiments on several open source projects show that real true positive defects can be confirmed to be reachable using the approach and some false positives can be proved.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128419083","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}
引用次数: 5
A mechanism of row redundancy sharing for reparable memory systems 可修复内存系统的行冗余共享机制
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/CSITECHNOL.2017.8312140
K. Amirkhanyan, S. Shoukourian, V. Vardanian
{"title":"A mechanism of row redundancy sharing for reparable memory systems","authors":"K. Amirkhanyan, S. Shoukourian, V. Vardanian","doi":"10.1109/CSITECHNOL.2017.8312140","DOIUrl":"https://doi.org/10.1109/CSITECHNOL.2017.8312140","url":null,"abstract":"In this paper, we proposed a method for implementation of a mechanism for “redundancy sharing” allowing to repair a fault/defect in a memory instance from a memory system with hundreds/thousands of memory instances with an available shared redundant element of another memory instance in the same group of the Memory System that has been preliminarily grouped with respect to its main parameters, e.g. clock, power and position of instances. The calculations showed that the hardware is saved to a great extent with a negligible impact on memory's functional performance. Not only excluded redundancies contribute in the area saving but also reduction of the redundancy registers due to reduction of redundancies, as well as reduction of the control logic and the number of necessary fuses.","PeriodicalId":332371,"journal":{"name":"2017 Computer Science and Information Technologies (CSIT)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128726180","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}
引用次数: 2
On the existence of the tt-mitotic hypersimple set which is not btt-mitotic 关于非有丝分裂超简单集的存在性
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/csitechnol.2017.8312131
Arsen H. Mokatsian
{"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":"37 1","pages":"0"},"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}
引用次数: 0
An analysis of wintertime cold-air pool in Armenia using climatological observations and WRF model data 利用气候观测和WRF模式资料分析亚美尼亚冬季冷空气池
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/CSITECHNOL.2017.8312156
H. Melkonyan, A. Gevorgyan, S. Sargsyan, V. Sahakyan, Z. Petrosyan, Hasmik Panyan, R. Abrahamyan, H. Astsatryan, Yuri Shoukorian
{"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":"35 1","pages":"0"},"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}
引用次数: 0
Gossiping properties of the edge-permuted Knödel graphs 边置换Knödel图的八卦性质
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/CSITECHNOL.2017.8312126
V. Hovnanyan, S. Poghosyan, V. Poghosyan
{"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":"51 1","pages":"0"},"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}
引用次数: 0
Reed-Solomon coding: Variated redundancy and matrix formalism Reed-Solomon编码:可变冗余和矩阵形式化
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/CSITECHNOL.2017.8312154
Aleksei Marov, A. Uteshev
{"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":"45 1","pages":"0"},"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}
引用次数: 0
LCS algorithm with vector-markers 带有矢量标记的LCS算法
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/CSITECHNOL.2017.8312148
L. Aslanyan
{"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":"92 1","pages":"0"},"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}
引用次数: 2
On the structure of positive and strongly positive arithmetical sets 关于正与强正算术集的结构
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/csitechnol.2017.8312130
S. Manukian
{"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":"37 1","pages":"0"},"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}
引用次数: 1
Plagiarism detection system for Armenian language 亚美尼亚语抄袭检测系统
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/CSITECHNOL.2017.8312168
G. Margarov, Gohar Tomeyan, M. Pereira
{"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":"141 1","pages":"0"},"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}
引用次数: 2
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 ip视频监控系统中数字通信信道的Eb/N0比的确定和出错概率的计算
2017 Computer Science and Information Technologies (CSIT) Pub Date : 2017-09-01 DOI: 10.1109/CSITECHNOL.2017.8312165
M. Markosyan, R. Safin, V. Artyukhin, Elena Satimova
{"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":"168 1","pages":"0"},"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}
引用次数: 1
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信