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

Moscow University Computational Mathematics and Cybernetics最新文献

筛选
英文 中文
Inverse Problem for a Nonlinear Model of Population Dynamics with the Age Structure of Individuals and Overpopulation 具有个体年龄结构和人口过剩的人口动态非线性模型的逆问题
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010072
{"title":"Inverse Problem for a Nonlinear Model of Population Dynamics with the Age Structure of Individuals and Overpopulation","authors":"","doi":"10.3103/s0278641924010072","DOIUrl":"https://doi.org/10.3103/s0278641924010072","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The authors consider the inverse problem of restoring the coefficient in a nonlinear equation of a dynamic model of a homogeneous biological population of organisms structured according to age. The model allows for the dependence of parameters of the vital activity of individuals on the population size. Some coefficients of the model are nonlocal and have an integral structure. Conditions for the uniqueness of the solution of the inverse problem are established.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601442","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
Model for Protecting Objects from Multiple Impacts 保护物体免受多重撞击的模型
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010047
{"title":"Model for Protecting Objects from Multiple Impacts","authors":"","doi":"10.3103/s0278641924010047","DOIUrl":"https://doi.org/10.3103/s0278641924010047","url":null,"abstract":"<span> <h3>Abstract</h3> <p>An attack–defense model is considered in which the attack can deliver several strikes on defense points to maximize the damage. A way of creating a solution to a zero-sum game in mixed strategies is developed.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"54 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601527","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
Identifying the Capacity of a Social Network 识别社交网络的能力
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010084
{"title":"Identifying the Capacity of a Social Network","authors":"","doi":"10.3103/s0278641924010084","DOIUrl":"https://doi.org/10.3103/s0278641924010084","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The diffusive logistic model of information dissemination in a social network is considered in the form of a one-dimensional nonstationary parabolic equation. The problem of parametric identification is posed as an extremum problem for searching the parameter in the form of a spatially distributed social network capacity. Gradient means of optimization are applied. The results demonstrate uniform convergence to an exact solution in the approach with a controllable descent direction.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"68 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601853","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
Splitting Schemes with Additive Representation of the Operator at the Time Derivative 在时间导数上用加法表示算子的拆分方案
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010096
{"title":"Splitting Schemes with Additive Representation of the Operator at the Time Derivative","authors":"","doi":"10.3103/s0278641924010096","DOIUrl":"https://doi.org/10.3103/s0278641924010096","url":null,"abstract":"<span> <h3>Abstract</h3> <p>Additive (splitting) schemes are used to contruct effective computational algorithms for approximately solving initial-boundary value problems for nonstationary partial differential equations. Splitting schemes are normally used when the main operator of a problem has an additive representation. Problems where the operator at the time derivative of a solution is split are also of interest. For first-order evolution equations, we propose splitting schemes based on transforming the original equation to an equivalent system of equations.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"100 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601850","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
Generative Intelligence Systems for Image Synthesis: Scenarios for Their Use and Related Tasks 用于图像合成的生成智能系统：使用场景及相关任务
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010060
{"title":"Generative Intelligence Systems for Image Synthesis: Scenarios for Their Use and Related Tasks","authors":"","doi":"10.3103/s0278641924010060","DOIUrl":"https://doi.org/10.3103/s0278641924010060","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The authors discuss generative intelligence systems for image synthesis, describes one (DALL<span> <span>(cdot)</span> </span>E 2) in detail, and provide familiar examples of the use of such systems. The advisability of preparing such a review lies in the current situation in the field of generative intelligence, many inflated expectations and fears, and a practical lack of descriptions and analyses of scenarios for their use in business. This review will be useful to anyone who wishes to understand the real capabilities and limitations of such systems.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"55 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601535","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
Transitioning between Different Representations of Interval Controlled Systems 在区间受控系统的不同表示之间转换
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040106
E. I. Atamas’
{"title":"Transitioning between Different Representations of Interval Controlled Systems","authors":"E. I. Atamas’","doi":"10.3103/s0278641923040106","DOIUrl":"https://doi.org/10.3103/s0278641923040106","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>A description is given of algorithms for converting linear controlled systems with interval parameters from a state-space representation to a representation in the form of transfer functions and <i>vice versa</i>. Results are accompanied by computational examples demonstrating the capabilities and limitations of the proposed approach.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679706","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
Verifying Hypotheses of Drug Bioequivalence 验证药物生物等效性假设
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040143
M. A. Dranitsyna, T. V. Zakharova, P. V. Panov
{"title":"Verifying Hypotheses of Drug Bioequivalence","authors":"M. A. Dranitsyna, T. V. Zakharova, P. V. Panov","doi":"10.3103/s0278641923040143","DOIUrl":"https://doi.org/10.3103/s0278641923040143","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The problem of testing pharmaceuticals on their bioequivalence is considered. Investigations of drug bioequivalence are the basis for reproducing drugs that confirm their efficiency and safety. The main way of verifying drug bioequivalence is to conduct two one-sided Schuirmann tests. Two one-sided tests have been used for many years and proven their validity for proving equivalent bioavailability, but in some situations (missing data, the necessity of considering not only the aggregate metrics but also the shape of the concentration–time curve) there is a need to establish more accurately the differences between the concentration–time curves. The authors present a new criterion that is more sensitive to the differences between characteristics that affect drug bioavailability and reduce the risk for patients. In should be noted that the new criterion generalizes the Schuirmann criterion and preserves its useful properties.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679881","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
A Hadamard Product of Linear Codes: Algebraic Properties and Algorithms for Calculating It 线性编码的哈达玛积：代数特性和计算算法
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040179
I. V. Chizhov
{"title":"A Hadamard Product of Linear Codes: Algebraic Properties and Algorithms for Calculating It","authors":"I. V. Chizhov","doi":"10.3103/s0278641923040179","DOIUrl":"https://doi.org/10.3103/s0278641923040179","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>A study is performed of the algebraic properties of the Hadamard product (Schur product, component-wise product) of linear error-correcting codes. The complexity of constructing a product basis using known multiplier bases is discussed. The concept is introduced of quotient, quasi-quotient, and maximal inclusion quasi-quotient obtained from the Hadamard division of one linear code by another. An explicit form of the maximum Hadamard division quasi-quotient is established. A criterion is proved for the existence of a given code of an inverse code in a semiring formed by linear codes of length <span>(n)</span> with the operations of sum and product of Hadamard codes. The explicit form of codes that have a reverse code in this semiring is described.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679994","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
A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field 有限域上矩阵乘法的双线性复杂度下限
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040155
A. A. Nazarov
{"title":"A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field","authors":"A. A. Nazarov","doi":"10.3103/s0278641923040155","DOIUrl":"https://doi.org/10.3103/s0278641923040155","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>An improved lower bound is found for the bilinear complexity of the multiplication of arbitrary matrices over finite fields.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679879","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
Intelligent Technologies for the Segmentation and Classification of Microbiological Photographic Images 微生物摄影图像的分割和分类智能技术
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040131
O. E. Gorokhov, M. A. Kazachuk, I. S. Lazukhin, I. V. Mashechkin, L. L. Pankrat’eva, I. S. Popov
{"title":"Intelligent Technologies for the Segmentation and Classification of Microbiological Photographic Images","authors":"O. E. Gorokhov, M. A. Kazachuk, I. S. Lazukhin, I. V. Mashechkin, L. L. Pankrat’eva, I. S. Popov","doi":"10.3103/s0278641923040131","DOIUrl":"https://doi.org/10.3103/s0278641923040131","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The need to detect pathogenic microorganisms in the human body as quickly as possible is an important problem in medicine. One of today’s most common approaches of solving it is based on sowing biological material on nutrient media and then observing the growth of colonies. This technique has certain disadvantages associated mainly with the human factor, which can lead to errors in the final diagnosis. The aim of this work was to develop technologies for the intelligent processing of data from microbiological analyses based on photographic images of Petri dishes. This would reduce dependence on the human factor and improve key indicators of data processing. Results show that the developed heuristic and neural network approaches of detecting and classifying colonies of microorganisms are superior to those of existing ptocedures. They allow the automation of key stages of microbiological examination and thus can be applied in practice.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679660","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学术官方微信