Informatsionno-Upravliaiushchie Sistemy最新文献

筛选
英文 中文
Circles on lattices and Hadamard matrices 格上的圆和阿达玛矩阵
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-06-21 DOI: 10.31799/1684-8853-2019-3-2-9
N. A. Balonin, M. Sergeev, J. Seberry, O. I. Sinitsyna
{"title":"Circles on lattices and Hadamard matrices","authors":"N. A. Balonin, M. Sergeev, J. Seberry, O. I. Sinitsyna","doi":"10.31799/1684-8853-2019-3-2-9","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-3-2-9","url":null,"abstract":"Introduction: The Hadamard conjecture about the existence of Hadamard matrices in all orders multiple of 4, and the Gauss problem about the number of points in a circle are among the most important turning points in the development of mathematics. They both stimulated the development of scientific schools around the world with an immense amount of works. There are substantiations that these scientific problems are deeply connected. The number of Gaussian points (Z3 lattice points) on a spheroid, cone, paraboloid or parabola, along with their location, determines the number and types of Hadamard matrices.Purpose: Specification of the upper and lower bounds for the number of Gaussian points (with odd coordinates) on a spheroid depending on the problem size, in order to specify the Gauss theorem (about the solvability of quadratic problems in triangular numbers by projections onto the Liouville plane) with estimates for the case of Hadamard matrices. Methods: The authors, in addition to their previous ideas about proving the Hadamard conjecture on the base of a one-to-one correspondence between orthogonal matrices and Gaussian points, propose one more way, using the properties of generalized circles on Z3 .Results: It is proved that for a spheroid, the lower bound of all Gaussian points with odd coordinates is equal to the equator radius R, the upper limit of the points located above the equator is equal to the length of this equator L=2πR, and the total number of points is limited to 2L. Due to the spheroid symmetry in the sector with positive coordinates (octant), this gives the values of R/8 and L/4. Thus, the number of Gaussian points with odd coordinates does not exceed the border perimeter and is no less than the relative share of the sector in the total volume of the figure.Practical significance: Hadamard matrices associated with lattice points have a direct practical significance for noise-resistant coding, compression and masking of video information.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41842120","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}
引用次数: 3
Saliency detection in deep learning era: trends of development 深度学习时代的显著性检测:发展趋势
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-06-21 DOI: 10.31799/1684-8853-2019-3-10-36
M. Favorskaya, L. Jain
{"title":"Saliency detection in deep learning era: trends of development","authors":"M. Favorskaya, L. Jain","doi":"10.31799/1684-8853-2019-3-10-36","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-3-10-36","url":null,"abstract":"Introduction:Saliency detection is a fundamental task of computer vision. Its ultimate aim is to localize the objects of interest that grab human visual attention with respect to the rest of the image. A great variety of saliency models based on different approaches was developed since 1990s. In recent years, the saliency detection has become one of actively studied topic in the theory of Convolutional Neural Network (CNN). Many original decisions using CNNs were proposed for salient object detection and, even, event detection.Purpose:A detailed survey of saliency detection methods in deep learning era allows to understand the current possibilities of CNN approach for visual analysis conducted by the human eyes’ tracking and digital image processing.Results:A survey reflects the recent advances in saliency detection using CNNs. Different models available in literature, such as static and dynamic 2D CNNs for salient object detection and 3D CNNs for salient event detection are discussed in the chronological order. It is worth noting that automatic salient event detection in durable videos became possible using the recently appeared 3D CNN combining with 2D CNN for salient audio detection. Also in this article, we have presented a short description of public image and video datasets with annotated salient objects or events, as well as the often used metrics for the results’ evaluation.Practical relevance:This survey is considered as a contribution in the study of rapidly developed deep learning methods with respect to the saliency detection in the images and videos.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43358083","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}
引用次数: 4
OpenLDAP directory service structure as a search filter OpenLDAP目录服务结构作为搜索过滤器
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-04-19 DOI: 10.31799/1684-8853-2019-2-52-56
A. Gordeyev, A. Andreyev
{"title":"OpenLDAP directory service structure as a search filter","authors":"A. Gordeyev, A. Andreyev","doi":"10.31799/1684-8853-2019-2-52-56","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-2-52-56","url":null,"abstract":"","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42860263","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
Organization of multi-level data storage 组织多级数据存储
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-04-19 DOI: 10.31799/1684-8853-2019-2-68-75
B. Sovetov, T. Tatarnikova, E. Poymanova
{"title":"Organization of multi-level data storage","authors":"B. Sovetov, T. Tatarnikova, E. Poymanova","doi":"10.31799/1684-8853-2019-2-68-75","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-2-68-75","url":null,"abstract":"","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41706504","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}
引用次数: 14
Multi-user distributed information-control systems as an element of modern digital educational environment 作为现代数字教育环境要素的多用户分布式信息控制系统
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-04-19 DOI: 10.31799/1684-8853-2019-2-83-94
V. Komarov, A. Sarafanov, S. Tumkovskiy
{"title":"Multi-user distributed information-control systems as an element of modern digital educational environment","authors":"V. Komarov, A. Sarafanov, S. Tumkovskiy","doi":"10.31799/1684-8853-2019-2-83-94","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-2-83-94","url":null,"abstract":"","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49613346","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
Mathematical model of a fixed-biomass anaerobic bioreactor as a control object 以固定式生物质厌氧生物反应器为控制对象的数学模型
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-04-19 DOI: 10.31799/1684-8853-2019-2-44-51
A. A. Klucharev, A. Fomenkova
{"title":"Mathematical model of a fixed-biomass anaerobic bioreactor as a control object","authors":"A. A. Klucharev, A. Fomenkova","doi":"10.31799/1684-8853-2019-2-44-51","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-2-44-51","url":null,"abstract":"","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45709416","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
Data clustering in distributed monitoring systems 分布式监控系统中的数据集群
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-04-19 DOI: 10.31799/1684-8853-2019-2-35-43
A. Rukavitsyn
{"title":"Data clustering in distributed monitoring systems","authors":"A. Rukavitsyn","doi":"10.31799/1684-8853-2019-2-35-43","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-2-35-43","url":null,"abstract":"","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44628490","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 families of orthogonal functions for coding messages in a chaotic masking scheme 在混沌掩蔽方案中使用正交函数族对消息进行编码
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-04-19 DOI: 10.31799/1684-8853-2019-2-76-82
S. Belim, Y. S. Rakitskiy
{"title":"Using families of orthogonal functions for coding messages in a chaotic masking scheme","authors":"S. Belim, Y. S. Rakitskiy","doi":"10.31799/1684-8853-2019-2-76-82","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-2-76-82","url":null,"abstract":"","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44323198","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
A team of soccer robots for RoboCup competitions in SSL league: system and algorithms 参加SSL联赛RoboCup比赛的一队足球机器人:系统和算法
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-04-18 DOI: 10.31799/1684-8853-2019-2-19-25
P. Konovalov, A. Kornilova, D. Korolev, G. Reneva, Alexander L. Fradkov, I. Shirokolobov, D. Yarosh
{"title":"A team of soccer robots for RoboCup competitions in SSL league: system and algorithms","authors":"P. Konovalov, A. Kornilova, D. Korolev, G. Reneva, Alexander L. Fradkov, I. Shirokolobov, D. Yarosh","doi":"10.31799/1684-8853-2019-2-19-25","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-2-19-25","url":null,"abstract":"Introduction: The international RoboCup soccer tournaments for robots have been held since the mid-1990s and have attracted a lot of attention from universities all over the world. Their goal is to develop scientific and engineering research in the areas of robotics, artificial intelligence, computer vision, navigation, group and multi-agent interaction of robots and mechatronic devices. Purpose: To create a new generation research bench which assists in developing, training and evaluating soccer robots, as well as developing basic algorithms for managing an individual soccer robot or a group of them. Results: A stand was designed to develop and analyze algorithms for control over a group of robots and navigation in a highly dynamic environment with centralized control organized as follows: the computing center receives data from a video surveillance system, uses the obtained information about the positions of the robots and the ball and about the state of their sensors to calculate control commands (velocity vector, angular velocity, impact signal) which are then transmitted to the robots for execution. Basic control algorithms for robot soccer players, such as: moving to a point, turning on a point, movement around a circle, obstacle avoidance, taking a pass, goalkeeper actions, hitting a set point, as well as a game model for two field players acting against a goalkeeper were implemented and used to test the stand performance, to record the qualification video and to prepare documents for the participation of St. Petersburg State University team in the RoboCup Small Size League final, 2019, in Sydney, Australia.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69413264","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
Exact solution method for Fredholm integro-differential equations with multipoint and integral boundary conditions. Part 2. Decomposition-extension method for squared operators 具有多点积分边界条件的Fredholm积分微分方程的精确解方法。第2部分。平方算子的分解-扩展方法
Informatsionno-Upravliaiushchie Sistemy Pub Date : 2019-04-18 DOI: 10.31799/1684-8853-2019-2-2-9
N. Vassiliev, I. Parasidis, E. Providas
{"title":"Exact solution method for Fredholm integro-differential equations with multipoint and integral boundary conditions. Part 2. Decomposition-extension method for squared operators","authors":"N. Vassiliev, I. Parasidis, E. Providas","doi":"10.31799/1684-8853-2019-2-2-9","DOIUrl":"https://doi.org/10.31799/1684-8853-2019-2-2-9","url":null,"abstract":"Introduction: In Part 1 of this article, a direct method was presented for examining the solvability and uniqueness problem, and for obtaining a closed-form solution of boundary value problems which incorporate an mth order linear ordinary Fredholm integro-differential operator, or a differential operator, along with multipoint and integral boundary conditions. Here, we focus on a special class of boundary value problems including the composite square of an integro-differential operator and the corresponding non-local boundary conditions. Purpose : To investigate the construction of the unique solution of 2mth order boundary value problems in the special case of an operator which can be presented as composite squares of lower m th order ones, and to develop an algorithm for constructing an exact solution for this special case. Results: By decomposition and applying the extension method explicated in Part 1, we provide a formula for obtaining an exact solution of boundary value problems for squared integro-differential operators, or differential operators, with multipoint and integral boundary conditions. This method is simple to use and can be easily incorporated to any Computer Algebra System.","PeriodicalId":36977,"journal":{"name":"Informatsionno-Upravliaiushchie Sistemy","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2019-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46857638","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}
引用次数: 7
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学术官方微信