NaUKMA Research Papers. Computer Science最新文献

筛选
英文 中文
A Bfgs Method for the Problem of Building S-Shaped Curve 构建s形曲线问题的Bfgs方法
NaUKMA Research Papers. Computer Science Pub Date : 2020-12-28 DOI: 10.18523/2617-3808.2020.3.102-106
P. Stetsyuk, V. Lyashko, A. Suprun
{"title":"A Bfgs Method for the Problem of Building S-Shaped Curve","authors":"P. Stetsyuk, V. Lyashko, A. Suprun","doi":"10.18523/2617-3808.2020.3.102-106","DOIUrl":"https://doi.org/10.18523/2617-3808.2020.3.102-106","url":null,"abstract":"","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127321510","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
Using the LSA Algorithm for Clustering Geometry Problems 基于LSA算法的几何问题聚类
NaUKMA Research Papers. Computer Science Pub Date : 2020-12-28 DOI: 10.18523/2617-3808.2020.3.107-113
O. Zhezherun, Serhiy Borozennyi, Mykita Nyverovskyi
{"title":"Using the LSA Algorithm for Clustering Geometry Problems","authors":"O. Zhezherun, Serhiy Borozennyi, Mykita Nyverovskyi","doi":"10.18523/2617-3808.2020.3.107-113","DOIUrl":"https://doi.org/10.18523/2617-3808.2020.3.107-113","url":null,"abstract":"","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116497574","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
Methods of Working with Textures Using Computer Vision on Python 在Python上使用计算机视觉处理纹理的方法
NaUKMA Research Papers. Computer Science Pub Date : 2020-12-28 DOI: 10.18523/2617-3808.2020.3.97-101
David Gamayun, M. Korniichuk
{"title":"Methods of Working with Textures Using Computer Vision on Python","authors":"David Gamayun, M. Korniichuk","doi":"10.18523/2617-3808.2020.3.97-101","DOIUrl":"https://doi.org/10.18523/2617-3808.2020.3.97-101","url":null,"abstract":"","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128414101","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
Distributed System Technical Audit 分布式系统技术审计
NaUKMA Research Papers. Computer Science Pub Date : 2020-12-28 DOI: 10.18523/2617-3808.2020.3.69-74
Kyrylo Gorokhovskyi, Oleksii Zhylenko, Oleh Franchuk
{"title":"Distributed System Technical Audit","authors":"Kyrylo Gorokhovskyi, Oleksii Zhylenko, Oleh Franchuk","doi":"10.18523/2617-3808.2020.3.69-74","DOIUrl":"https://doi.org/10.18523/2617-3808.2020.3.69-74","url":null,"abstract":"","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131971057","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
Implementation of the Contact Management System of Graduates of the Faculty of Informatics 信息学学院毕业生联系管理系统的实现
NaUKMA Research Papers. Computer Science Pub Date : 2020-12-28 DOI: 10.18523/2617-3808.2020.3.149-153
D. Vasylenko, V. Kozopas, M. Korniichuk
{"title":"Implementation of the Contact Management System of Graduates of the Faculty of Informatics","authors":"D. Vasylenko, V. Kozopas, M. Korniichuk","doi":"10.18523/2617-3808.2020.3.149-153","DOIUrl":"https://doi.org/10.18523/2617-3808.2020.3.149-153","url":null,"abstract":"","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131118723","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
Consistency Models for Distributed Virtual Reality Systems 分布式虚拟现实系统的一致性模型
NaUKMA Research Papers. Computer Science Pub Date : 2020-12-28 DOI: 10.18523/2617-3808.2020.3.7-11
Volodymyr Duchenchuk, Volodymyr Boublik
{"title":"Consistency Models for Distributed Virtual Reality Systems","authors":"Volodymyr Duchenchuk, Volodymyr Boublik","doi":"10.18523/2617-3808.2020.3.7-11","DOIUrl":"https://doi.org/10.18523/2617-3808.2020.3.7-11","url":null,"abstract":"","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"59 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131858102","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
Static Block-Recursive Cholesky Algorithm for a Distributed Memory Cluster 分布式内存集群的静态块递归Cholesky算法
NaUKMA Research Papers. Computer Science Pub Date : 2020-12-28 DOI: 10.18523/2617-3808.2020.3.114-120
G. Malaschonok, Andrii Ivaskevych
{"title":"Static Block-Recursive Cholesky Algorithm for a Distributed Memory Cluster","authors":"G. Malaschonok, Andrii Ivaskevych","doi":"10.18523/2617-3808.2020.3.114-120","DOIUrl":"https://doi.org/10.18523/2617-3808.2020.3.114-120","url":null,"abstract":"","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"44 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114130546","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
Image Shadow Removal Based on Generative Adversarial Networks 基于生成对抗网络的图像阴影去除
NaUKMA Research Papers. Computer Science Pub Date : 2020-12-28 DOI: 10.18523/2617-3808.2020.3.75-82
Vladyslav Andronik, Olena Buchko
{"title":"Image Shadow Removal Based on Generative Adversarial Networks","authors":"Vladyslav Andronik, Olena Buchko","doi":"10.18523/2617-3808.2020.3.75-82","DOIUrl":"https://doi.org/10.18523/2617-3808.2020.3.75-82","url":null,"abstract":"Accurate detection of shadows and removal in the image are complicated tasks, as it is difficult to understand whether darkening or gray is the cause of the shadow. This paper proposes an image shadow removal method based on generative adversarial networks. Our approach is trained in unsupervised fashion which means it does not depend on time-consuming data collection and data labeling. This together with training in a single end-to-end framework significantly raises its practical relevance. Taking the existing method for unsupervised image transfer between different domains, we have researched its applicability to the shadow removal problem. Two networks have been used. Тhe first network is used to add shadows in images and the second network for shadow removal. ISTD dataset has been used for evaluation clarity because it has ground truth shadow free images as well as shadow masks. For shadow removal we have used root mean squared error between generated and real shadow free images in LAB color space. Evaluation is divided into region and global where the former is applied to shadow regions while the latter to the whole images. Shadow detection is evaluated with the use of Intersection over Union, also known as the Jaccard index. It is computed between the generated and ground-truth binary shadow masks by dividing the area of overlap by the union of those two. We selected random 100 images for validation purposes. During the experiments multiple hypotheses have been tested. The majority of tests we conducted were about how to use an attention module and where to localize it. Our network produces better results compared to the existing approach in the field. Analysis showed that attention maps obtained from auxiliary classifier encourage the networks to concentrate on more distinctive regions between domains. However, generative adversarial networks demand more accurate and consistent architecture to solve the problem in a more efficient way.","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129767363","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
Two-Stage Transportation Problem and Its AMPL-Realization 两阶段运输问题及其amp实现
NaUKMA Research Papers. Computer Science Pub Date : 2018-10-16 DOI: 10.18523/2617-3808.2018.14-20
P. Stetsyuk, V. Lyashko, Gabriela Mazyutynets
{"title":"Two-Stage Transportation Problem and Its AMPL-Realization","authors":"P. Stetsyuk, V. Lyashko, Gabriela Mazyutynets","doi":"10.18523/2617-3808.2018.14-20","DOIUrl":"https://doi.org/10.18523/2617-3808.2018.14-20","url":null,"abstract":"","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114157354","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}
引用次数: 6
Technical Comparison Aspects of Leading Blockchain-Based Platforms on Key Characteristics 主要区块链平台关键特性的技术比较方面
NaUKMA Research Papers. Computer Science Pub Date : 2018-10-16 DOI: 10.18523/2617-3808.2018.58-64
A. Ivanov, Yevhenii Babichenko, Hlib Kanunnikov, Paul Karpus, Leonid Foiu­-Khatskevych, Roman Kravchenko, Kyrylo Gorokhovskyi, Ievhen Nevmerzhitskyi
{"title":"Technical Comparison Aspects of Leading Blockchain-Based Platforms on Key Characteristics","authors":"A. Ivanov, Yevhenii Babichenko, Hlib Kanunnikov, Paul Karpus, Leonid Foiu­-Khatskevych, Roman Kravchenko, Kyrylo Gorokhovskyi, Ievhen Nevmerzhitskyi","doi":"10.18523/2617-3808.2018.58-64","DOIUrl":"https://doi.org/10.18523/2617-3808.2018.58-64","url":null,"abstract":"Blockchain as a technology is rapidly developing, finding more and more new entry points into everyday life. This is one of the elements of the technical Revolution 4.0, and it is used in the field of supply, maintenance of various types of registers, access to software products, combating DDOS attacks, distributed storage, fundraising for projects, IoT, etc. Nowadays, there are many blockchain­platforms in the world. They have one technological root but different applications. There are many prerequisites to the fact that in the future the number of new decentralized applications will increase. Therefore, it is important to develop a methodology for determining the optimal blockchain­based platform to solve a specific problem. As an example, consider the world­famous platforms Ethereum, Nem, and Stellar. Each of them allows to develop decentralized applications, issue tokens, and execute transactions. At the same time, the key features of these blockchain­based platforms are not similar to one another. These very features will be considered in the article. Purpose. Identify the key parameters that characterize the blockchain­based platforms. This will provide an opportunity to present a complex blockchain technology in the form of a simple and understandable architecture. Based on these parameters and using the expertise of the article’s authors, we will be able to develop a methodology to be used to solve the problems of choosing the optimal blockchain­based platform for solving the problem of developing smart contracts and issuing tokens. Methods. Analysis of the complexity of using blockchain­based platforms. Implementation of token issuance, use of test and public networks, execution of transactions, analysis of the development team and the community, analysis of the user interface and the developer interface. Discussion. By developing a platform comparison methodology to determine optimal characteristics, we can take the development process to a new level. This will allow to quickly and effectively solve the tasks. Results. Creation of a methodology for comparison blockchain­based platforms.","PeriodicalId":433538,"journal":{"name":"NaUKMA Research Papers. Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129819771","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学术文献互助群
群 号:481959085
Book学术官方微信