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

Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya最新文献

筛选
英文 中文
On the question of a constructive controllability criterion. Pt I. Cyclic invariant subspaces 论构造可控性判据问题。1 .循环不变子空间
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.213
Elizaveta A. Kalinina, A. M. Kamachkin, N. Stepenko, G. Tamasyan
{"title":"On the question of a constructive controllability criterion. Pt I. Cyclic invariant subspaces","authors":"Elizaveta A. Kalinina, A. M. Kamachkin, N. Stepenko, G. Tamasyan","doi":"10.21638/11701/spbu10.2023.213","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.213","url":null,"abstract":"The rank of the Kalman’s controllability matrix of linear systems depends on the bases of the invariant cyclic subspaces of the state matrix generated by the columns of the input matrix. The case of the Jordan form of the state matrix and scalar control is studied in detail. It is shown that the dimension of cyclic subspaces is determined by the index numbers of the first non-zero elements of the coordinate blocks of the columns of the input matrix. The formation of the bases of these subspaces is completely disclosed. Based on this, the basis of the space of a constructive control system is constructed.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87925982","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
The maximum entropy principle in search theory 搜索理论中的最大熵原理
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.103
Aleksandr N. Prokaev
{"title":"The maximum entropy principle in search theory","authors":"Aleksandr N. Prokaev","doi":"10.21638/11701/spbu10.2023.103","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.103","url":null,"abstract":"The paper considers the relationship between search theory and information theory. The traditional problem of search theory is to develop a search plan for a physical object in the sea or on land. The search plan has to develop the distribution of available search resources in such a way that the probability of detection the search object is to be maximum. The optimal solution is traditionally considered as so-called \"uniformly optimal search plan\", which provides a uniform distribution of the posterior probability of the location of the object as the search is conducted. At the same time, optimality simultaneously according to the criteria of maximum detection probability and equality of a posteriori probability is possible only for the exponential detection function, which is used most often in search theory. For other kinds of detection functions, the optimal solutions according to the specified criteria do not match. In this paper, the approach to this problem is considered on the basis of the maximum entropy principle. For a situation of discrete distribution, it is shown that, within the framework of information theory, the search problem has a simpler solution that does not depend on the kind of the detection function.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81046562","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
Algorithm for optimal coloring of square (0,1)-matrices 方形(0,1)矩阵的最优着色算法
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.108
I. V. Olemskoy, O. S. Firyulina
{"title":"Algorithm for optimal coloring of square (0,1)-matrices","authors":"I. V. Olemskoy, O. S. Firyulina","doi":"10.21638/11701/spbu10.2023.108","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.108","url":null,"abstract":"The paper proposes an algorithm for solving the configuration-optimization coloring problem for square (0,1)-matrices, which is based on the method of selection their structural features. The algorithm belongs to the method's of backtracking, however, the construction of the optimal solution is carried out among the options that provide a certain configuration, due to which the size of the search tree is significantly reduced. A detailed scheme of its operation is given, and the effectiveness of the solution is demonstrated by the example of calculating the chromatic number of a specific (0,1)-matrix.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73662305","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
Sound synthesis approach based on the elastic stress analysis of a wrinkled thin film coating 基于起皱薄膜涂层弹性应力分析的声音合成方法
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.107
S. Kostyrko, B. Shershenkov
{"title":"Sound synthesis approach based on the elastic stress analysis of a wrinkled thin film coating","authors":"S. Kostyrko, B. Shershenkov","doi":"10.21638/11701/spbu10.2023.107","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.107","url":null,"abstract":"This paper examines the ability to employ the model of a wrinkled thin film coating under plane strain conditions for the generation and manipulation of sounds. It is assumed that the film-on-substrate structure represents a multilevel system consisting of four phases with different elastic properties such as surface layer, film material, interphase and substrate material. The undulation of surface and interface geometry leads to the complex stress state of the film coating resulting from the superposition of two perturbed stress fields evolved near the curved surface and interface. The analysis of the stress state reveals the periodic distribution of the longitudinal stresses smoothly changing from surface to interface. This facilitates the creation of a sound synthesis technique similar to the timbre morphing method which provides the transition between two waveforms while creating new intermediate waveform during this process. The perspective of using the wrinkled thin film model for sound generation is gained by its complex behavior, where the influence of one parameter on the stress distribution is affected by other parameters, which in turn reflects in the rich sound morphologies during the mapping of the stress oscillations onto sound.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74484630","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
Graph vertices ranking using absolute potentials of electric circuit nodes 使用电路节点的绝对电位对图顶点进行排序
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.209
V. Mazalov, V. Khitraya
{"title":"Graph vertices ranking using absolute potentials of electric circuit nodes","authors":"V. Mazalov, V. Khitraya","doi":"10.21638/11701/spbu10.2023.209","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.209","url":null,"abstract":"A method for ranking the vertices of a graph based on Kirchhoff’s laws for determining the potentials of an electrical network is proposed. The graph is represented as an electrical network, where the edge weights are interpreted as electrical conductivities. Next, the current is supplied to one of the vertices, and the absolute potentials of all vertices are determined by the Kirchhoff method. Based on the obtained potential values, the vertices are ranked. Then the current is sequentially applied to all vertices and the ranking is performed each time. For the final ranking, it is proposed to apply the ranking procedure based on the tournament matrix. The operation of the ranking algorithm is illustrated by numerical examples related to graphs of specific transport networks.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90630479","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
Identification of low and medium intensity gas leakage location in medium and ultra-high pressure gas pipelines 中、超高压燃气管道中低、中强度气体泄漏位置的识别
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.208
G. Kurbatova, V. A. Klemeshev
{"title":"Identification of low and medium intensity gas leakage location in medium and ultra-high pressure gas pipelines","authors":"G. Kurbatova, V. A. Klemeshev","doi":"10.21638/11701/spbu10.2023.208","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.208","url":null,"abstract":"An efficient method for calculating the location of stationary gas leakage in wells and gas pipelines with medium and ultra-high pressures is presented. An algorithm for constructing the dependence of the compressibility factor of the gas mixture with a predominance of methane in the region of ultra-high pressures based on experimental data of pressure and temperature is proposed. The algorithm for calculating the leakage location is based on the Bellman method of quasi-linearization of nonlinear problems, with an additional hypothesis of the linear dependence of pressure and temperature on the leakage location coordinates used at each iteration. The issue of selecting the initial approximation is considered, and the advantage of calculating the initial approximation using a simplified non-isothermal flow model is justified. Examples of solving practical problems of high interest are given, and the high accuracy of calculating the gas leakage location using the proposed algorithm in gas pipelines with medium pressures (around 9 MPa) and ultra-high pressures (around 20 MPa) for small and medium gas leaks is demonstrated.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90180270","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
The stability of differential-difference systems with linearly increasing delay. II. Systems with additive right side 时滞线性增加的微分-差分系统的稳定性。2具有右侧加性的系统
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.101
A. Ekimov, A. P. Zhabko, P. Yakovlev
{"title":"The stability of differential-difference systems with linearly increasing delay. II. Systems with additive right side","authors":"A. Ekimov, A. P. Zhabko, P. Yakovlev","doi":"10.21638/11701/spbu10.2023.101","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.101","url":null,"abstract":"The article considers an uncontrolled system of differential-difference equations with a homogeneous additive right side and linearly increasing delay. Sufficient conditions for asymptotic stability are known for a number of special cases of such systems. Razumikhin's theorem on the asymptotic stability of homogeneous systems with proportional delay is formulated. Sufficient conditions for asymptotic stability are obtained basing on the asymptotic stability of the initial system without delay and constructing the Lyapunov function.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87092780","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
Difference dynamic input-output models 差分动态投入产出模型
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.105
N. Smirnov, T. Smirnova, M. Smirnova, M. N. Smirnov
{"title":"Difference dynamic input-output models","authors":"N. Smirnov, T. Smirnova, M. Smirnova, M. N. Smirnov","doi":"10.21638/11701/spbu10.2023.105","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.105","url":null,"abstract":"In this work, the object of study is the economy of the region. To describe it, a regular method for constructing difference input - output dynamic models is proposed. This approach involves modeling not only the sphere of production, but also the sphere of consumption. To do this, the vector of phase variables includes the gross domestic product. The variability of the model consists in the ability to take into account various macroeconomic parameters depending on the ultimate goals of analysis and control of macroeconomic trends. It is shown that the dynamics of the economy with direct investment in various sectors of the economy is described by linear controlled difference systems. If there is a need to take into account other macroeconomic parameters that increase the sensitivity of the model to managerial influences, then this leads to nonlinear difference systems of various types. In the final part of the article, a scenario approach for the development of investment projects is described. This approach is based on the principles of constructing program controls and stabilizing the corresponding program movements of a controlled difference system.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84793690","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
Dynamic network model of production and investment 生产投资动态网络模型
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.102
Vitaly A. Kochevadov, A. Sedakov
{"title":"Dynamic network model of production and investment","authors":"Vitaly A. Kochevadov, A. Sedakov","doi":"10.21638/11701/spbu10.2023.102","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.102","url":null,"abstract":"The paper studies a dynamic network game that models the competitive behavior of firms in a market. It is assumed that firms, under the condition of simultaneous and independent choice of their actions, implement the behavior that determines their production and investment behavior in each period. The production behavior of the firm reflects the ongoing quantities that it should produce and supply to the market. The investment behavior specifies the ongoing amounts of investment that the firm allocates to the modernization of its production technology in order to prevent it from becoming obsolete. Next, the unit cost is assumed to depend on the firm's investment and the investment of its competitors, which are determined by an exogenous network. Two types of Nash equilibria are characterized: open-loop and feedback. Finally, we analyze the impact of the network and related model parameters on firms' behavior, profits, and competitive advantage.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72516789","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
Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment 未知环境下最小匝数自主移动机器人动态路径规划算法
IF 0.6
Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya Pub Date : 2023-01-01 DOI: 10.21638/11701/spbu10.2023.211
G. Rego, R. Voronov
{"title":"Dynamic path planning algorithm for autonomous mobile robot with a minimum number of turns in unknown environment","authors":"G. Rego, R. Voronov","doi":"10.21638/11701/spbu10.2023.211","DOIUrl":"https://doi.org/10.21638/11701/spbu10.2023.211","url":null,"abstract":"The article is devoted to the problem of reactive navigation of a mobile robot with limited information about the environment. An algorithm for finding a path from source to the target with a minimum number of turns is described. The idea of the algorithm is based on the bug family of algorithms for reactive navigation. The mobile robot remembers the boundaries of obstacles and calculates the angle of rotation depending on the surrounding situation. The difference from bug algorithms is that the robot does not move “along the obstacle”, but turns only in a limited number of cases. The results of testing the algorithm on simulated polygons are presented. Models of fallen trees, stumps and swamps were considered as obstacles. The performance of the algorithm is evaluated by comparing the minimum possible number of turns with the number of turns in the path obtained using the algorithm.","PeriodicalId":43738,"journal":{"name":"Vestnik Sankt-Peterburgskogo Universiteta Seriya 10 Prikladnaya Matematika Informatika Protsessy Upravleniya","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84241607","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
首页 上一页 下一页 尾页
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学术官方微信