Pub Date : 2019-09-01DOI: 10.1109/CSITechnol.2019.8895208
Denis Timoshenko, K. Simonchik, V. Shutov, Polina Zhelezneva, V. Grishkin
The study about the vulnerabilities of biometric systems against spoofing has been a very active field of research in recent years. In this particular research we are focusing on one of the most difficult types of attack — video replay. We have noticed that currently most of face replay anti-spoofing databases focus on data with little variations of the devices used for replay and record. This fact may limit the generalization performance of trained models since potential attacks in the real world are probably more complex. In this review we present a face anti-spoofing database, which covers a huge range of different devices used for recording and for the video playback. The database contains 1942 genuine images, and 16885 fake faces are made from high quality records of the genuine faces. The database was collected using Amazon Mechanical Turk and Yandex Toloka services. The database was manually checked and the test protocol was provided. Some methods are also provided to be used as a baseline for future research. We hope that database as such can serve as an evaluation platform for the future studies in the literature.
{"title":"Large Crowdcollected Facial Anti-Spoofing Dataset","authors":"Denis Timoshenko, K. Simonchik, V. Shutov, Polina Zhelezneva, V. Grishkin","doi":"10.1109/CSITechnol.2019.8895208","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895208","url":null,"abstract":"The study about the vulnerabilities of biometric systems against spoofing has been a very active field of research in recent years. In this particular research we are focusing on one of the most difficult types of attack — video replay. We have noticed that currently most of face replay anti-spoofing databases focus on data with little variations of the devices used for replay and record. This fact may limit the generalization performance of trained models since potential attacks in the real world are probably more complex. In this review we present a face anti-spoofing database, which covers a huge range of different devices used for recording and for the video playback. The database contains 1942 genuine images, and 16885 fake faces are made from high quality records of the genuine faces. The database was collected using Amazon Mechanical Turk and Yandex Toloka services. The database was manually checked and the test protocol was provided. Some methods are also provided to be used as a baseline for future research. We hope that database as such can serve as an evaluation platform for the future studies in the literature.","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":"128687587","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.8895029
G. Margarov, V. Konovalova
The analysis of trends and forecasts of changes in digital and non-digital skills and competencies demanded by employers and determining the future professional success of engineers in the digital economy is presented. Key digital skills are identified and disclosed, namely: general IT-skills, professional IT-skills, problem-oriented digital skills, complimentary IT-skills, skills of using digital economy services. It is shown that along with digital skills, an increase in demand for additional interdisciplinary competencies, not peculiar to machines, but necessary, are expected for cooperation with artificial intelligence. Based on the research materials, the author identifies a number of generic skills, the relevance of which will increase in the digital economy: cognitive competencies (self-development, organization, management skills), social behavioral and communication competencies (communication skills, interpersonal skills, interdisciplinary and intercultural interaction), digital (technological) competencies (systems creation, information management).
{"title":"Interdisciplinary Competencies Needed for Engineers in the Digital Economy","authors":"G. Margarov, V. Konovalova","doi":"10.1109/CSITechnol.2019.8895029","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895029","url":null,"abstract":"The analysis of trends and forecasts of changes in digital and non-digital skills and competencies demanded by employers and determining the future professional success of engineers in the digital economy is presented. Key digital skills are identified and disclosed, namely: general IT-skills, professional IT-skills, problem-oriented digital skills, complimentary IT-skills, skills of using digital economy services. It is shown that along with digital skills, an increase in demand for additional interdisciplinary competencies, not peculiar to machines, but necessary, are expected for cooperation with artificial intelligence. Based on the research materials, the author identifies a number of generic skills, the relevance of which will increase in the digital economy: cognitive competencies (self-development, organization, management skills), social behavioral and communication competencies (communication skills, interpersonal skills, interdisciplinary and intercultural interaction), digital (technological) competencies (systems creation, information management).","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"52 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132442780","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.8895058
L. Aslanyan, H. Sahakyan, V. Romanov, Georges Da Costa, Rahim Kacimi
The problem of energy aware wireless accessibility from a collection of statically positioned sensor nodes to a given set of target nodes is considered. The simple plain-disc-model with the sensing radius ρs of wireless nodes is well known. Constant guarantee approximation algorithm is known for the ideal disk model but we will continue the study of general model in the case with hindrances. This model is defined by the use of matrices of sensor-target accessibility. The traditional connectivity issue of WSN is out of the scope of current research and the focus is on coverage. We aim at applying the widely-decentralized time-sharing model, where sensors collectively share the duty of continuous covering of the total collection of the set of targets. That is, when part of the nodes may accept for a time interval the sleep regime, minimizing in this way the energy consumption. In an easy step we obtain, that the mathematical problems arisen are related to the well-known combinatorial set cover problems. Set cover is one of the typical NP complete problems, which means that our solution will likely be not exact, but – approximate, or even heuristic. We bring analysis of the theoretical resources around these postulations. An extension of Integer Linear Programming model is implemented and demonstrated, being applied on the WSN domain coverage issues. In a complementary manner, and for the first time, we manage the appearing covering structures using the terms of monotone Boolean functions (the main result)
{"title":"Large Network Target Coverage Protocols","authors":"L. Aslanyan, H. Sahakyan, V. Romanov, Georges Da Costa, Rahim Kacimi","doi":"10.1109/CSITechnol.2019.8895058","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895058","url":null,"abstract":"The problem of energy aware wireless accessibility from a collection of statically positioned sensor nodes to a given set of target nodes is considered. The simple plain-disc-model with the sensing radius ρs of wireless nodes is well known. Constant guarantee approximation algorithm is known for the ideal disk model but we will continue the study of general model in the case with hindrances. This model is defined by the use of matrices of sensor-target accessibility. The traditional connectivity issue of WSN is out of the scope of current research and the focus is on coverage. We aim at applying the widely-decentralized time-sharing model, where sensors collectively share the duty of continuous covering of the total collection of the set of targets. That is, when part of the nodes may accept for a time interval the sleep regime, minimizing in this way the energy consumption. In an easy step we obtain, that the mathematical problems arisen are related to the well-known combinatorial set cover problems. Set cover is one of the typical NP complete problems, which means that our solution will likely be not exact, but – approximate, or even heuristic. We bring analysis of the theoretical resources around these postulations. An extension of Integer Linear Programming model is implemented and demonstrated, being applied on the WSN domain coverage issues. In a complementary manner, and for the first time, we manage the appearing covering structures using the terms of monotone Boolean functions (the main result)","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"15 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":"134285633","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.8895153
T. Kosovskaya
The paper is the answer to the question posed to the author during a report at the CSIT-2017 conference: whether it is possible to change a logic-predicate network so that not only objects with descriptions from the training set are recognized, but also differ slightly from them. The notion of partial sequence of a predicate formula, introduced by the author earlier, makes it possible to change the content of network cells so that the degree of similarity of a recognizable object fragment to fragments of objects from the training set, and then the degree of certainty that the object belongs to a given class, is calculated. A brief description of the logic-predicate approach to AI problems, the information about a logic-predicate network, the notion of partial sequence are presented in the paper.
{"title":"Implementation of Formula Partial Sequence for Rough Solution of AI Problems in the Framework of the Logic-Predicate Approach","authors":"T. Kosovskaya","doi":"10.1109/CSITechnol.2019.8895153","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895153","url":null,"abstract":"The paper is the answer to the question posed to the author during a report at the CSIT-2017 conference: whether it is possible to change a logic-predicate network so that not only objects with descriptions from the training set are recognized, but also differ slightly from them. The notion of partial sequence of a predicate formula, introduced by the author earlier, makes it possible to change the content of network cells so that the degree of similarity of a recognizable object fragment to fragments of objects from the training set, and then the degree of certainty that the object belongs to a given class, is calculated. A brief description of the logic-predicate approach to AI problems, the information about a logic-predicate network, the notion of partial sequence are presented in the paper.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"3 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":"123001611","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.8895255
G. Malaschonok
The report is devoted to the concept of creating block-recursive matrix algorithms for computing on a super-computer with distributed memory and dynamic decentralized control.
该报告致力于在具有分布式内存和动态分散控制的超级计算机上创建块递归矩阵算法的概念。
{"title":"Recursive Matrix Algorithms, Distributed Dynamic Control, Scaling, Stability","authors":"G. Malaschonok","doi":"10.1109/CSITechnol.2019.8895255","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895255","url":null,"abstract":"The report is devoted to the concept of creating block-recursive matrix algorithms for computing on a super-computer with distributed memory and dynamic decentralized control.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"8 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":"126597733","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.8895211
H. Sahakyan, L. Aslanyan, V. Ryazanov
In this paper, the problem of a quantitative description of partitions (QDP) of arbitrary m-subsets of the n-dimensional unit cube is considered for a given m, 0 ≤ m ≤ 2n. A necessary condition for the existence of a given QDP-subset is achieved in terms of minimal and maximal layers that are known by earlier publications. It is shown that QDP are in a correspondence to the upper homogeneous area elements of the n-cube and to the monotone Boolean functions. The NP-hardness of the QDP problem is proved. QDP singular points on different layers of the cube are described.
{"title":"On the Hypercube Subset Partitioning Varieties","authors":"H. Sahakyan, L. Aslanyan, V. Ryazanov","doi":"10.1109/CSITechnol.2019.8895211","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895211","url":null,"abstract":"In this paper, the problem of a quantitative description of partitions (QDP) of arbitrary m-subsets of the n-dimensional unit cube is considered for a given m, 0 ≤ m ≤ 2n. A necessary condition for the existence of a given QDP-subset is achieved in terms of minimal and maximal layers that are known by earlier publications. It is shown that QDP are in a correspondence to the upper homogeneous area elements of the n-cube and to the monotone Boolean functions. The NP-hardness of the QDP problem is proved. QDP singular points on different layers of the cube are described.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"68 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":"132638110","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.8895189
Suren Martirosyan, G. Harutyunyan
Memory reliability and testability are considered as primary requirements for achieving high production yield in nowadays system on chips (SoCs). For that purpose, different testing methods and diagnosis flows were proposed in the past. The fault models and test mechanisms can be different when dealing with volatile and non-volatile memories. This paper describes an efficient test methodology for detection and diagnosis of faults in both volatile and non-volatile types of memories.
{"title":"An Efficient Fault Detection and Diagnosis Methodology for Volatile and Non-Volatile Memories","authors":"Suren Martirosyan, G. Harutyunyan","doi":"10.1109/CSITechnol.2019.8895189","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895189","url":null,"abstract":"Memory reliability and testability are considered as primary requirements for achieving high production yield in nowadays system on chips (SoCs). For that purpose, different testing methods and diagnosis flows were proposed in the past. The fault models and test mechanisms can be different when dealing with volatile and non-volatile memories. This paper describes an efficient test methodology for detection and diagnosis of faults in both volatile and non-volatile types of memories.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"210 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":"134451683","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.8895131
Sedrak V. Grigoryan, Nairi Hakobyan, Tadevos Baghdasaryan
In this work, we present means for usage of RGT (Reproducible Game Trees) Solvers, that include knowledge acquisition, matching and decision making algorithms for RGT problems. The RGT Solvers are being regularly improved and the current implementation tries to cover the drawbacks of previous versions, improves presentation of classifiers and mental doings, as well as provides enhancements in interface. We also discuss ways of knowledge acquisition for marketing and battlefield problems by RGT Solvers
{"title":"Knowledge-Based Solvers for RGT Combinatorial Problems","authors":"Sedrak V. Grigoryan, Nairi Hakobyan, Tadevos Baghdasaryan","doi":"10.1109/CSITechnol.2019.8895131","DOIUrl":"https://doi.org/10.1109/CSITechnol.2019.8895131","url":null,"abstract":"In this work, we present means for usage of RGT (Reproducible Game Trees) Solvers, that include knowledge acquisition, matching and decision making algorithms for RGT problems. The RGT Solvers are being regularly improved and the current implementation tries to cover the drawbacks of previous versions, improves presentation of classifiers and mental doings, as well as provides enhancements in interface. We also discuss ways of knowledge acquisition for marketing and battlefield problems by RGT Solvers","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"73 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":"115648934","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.8895241
{"title":"[Copyright notice]","authors":"","doi":"10.1109/csitechnol.2019.8895241","DOIUrl":"https://doi.org/10.1109/csitechnol.2019.8895241","url":null,"abstract":"","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"378 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132948724","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
扫码关注我们
求助内容：
应助结果提醒方式：