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

Moscow University Computational Mathematics and Cybernetics最新文献

筛选
英文 中文
RMS Risk Analysis when Using Multiple Hypothesis Testing Select Parameters of Thresholding under Conditions of Weak Dependence 使用多重假设检验时的均方根风险分析 在弱依赖条件下选择阈值参数
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-06-01 DOI: 10.3103/s027864192470002x
M. O. Vorontsov
{"title":"RMS Risk Analysis when Using Multiple Hypothesis Testing Select Parameters of Thresholding under Conditions of Weak Dependence","authors":"M. O. Vorontsov","doi":"10.3103/s027864192470002x","DOIUrl":"https://doi.org/10.3103/s027864192470002x","url":null,"abstract":"","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"54 13","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141416219","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
Checking the Polynomiality of Single-Variable Functions of $${k}$$-Valued Logic Composite Modulo $${k}$$ 检查 ${k}$$ 有值逻辑复合模 ${k}$$ 单变量函数的多项式性
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-06-01 DOI: 10.3103/s0278641924700067
S. N. Selezneva
{"title":"Checking the Polynomiality of Single-Variable Functions of $${k}$$-Valued Logic Composite Modulo $${k}$$","authors":"S. N. Selezneva","doi":"10.3103/s0278641924700067","DOIUrl":"https://doi.org/10.3103/s0278641924700067","url":null,"abstract":"","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"19 9","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141415381","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
Reconstructing Unknown Coefficients of Stochastic Differential Equations and Intelligently Predicting Random Processes with Directed Learning 利用定向学习重构随机微分方程的未知系数并智能预测随机过程
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-06-01 DOI: 10.3103/s0278641924700043
V. Y. Korolev, Lanxiao Xu
{"title":"Reconstructing Unknown Coefficients of Stochastic Differential Equations and Intelligently Predicting Random Processes with Directed Learning","authors":"V. Y. Korolev, Lanxiao Xu","doi":"10.3103/s0278641924700043","DOIUrl":"https://doi.org/10.3103/s0278641924700043","url":null,"abstract":"","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"47 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141414769","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
On the Cardinality Computation Problem for Regular Languages over Symmetric Groups 关于对称群上正则语言的卡底计算问题
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-06-01 DOI: 10.3103/s0278641924700079
A. A. Khashaev
{"title":"On the Cardinality Computation Problem for Regular Languages over Symmetric Groups","authors":"A. A. Khashaev","doi":"10.3103/s0278641924700079","DOIUrl":"https://doi.org/10.3103/s0278641924700079","url":null,"abstract":"","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"118 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141406972","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
On Maxima of Stationary Delay in the $${M/G/2}$$ Systems 论{M/G/2}$$系统中静态延迟的最大值
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-06-01 DOI: 10.3103/s0278641924700055
I. V. Peshkova
{"title":"On Maxima of Stationary Delay in the $${M/G/2}$$ Systems","authors":"I. V. Peshkova","doi":"10.3103/s0278641924700055","DOIUrl":"https://doi.org/10.3103/s0278641924700055","url":null,"abstract":"","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"116 7","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141390625","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
Nonsingular Solutions of the Matrix Equation $$boldsymbol{XAX=AXA}$$ and the Centralizer of the Matrix $$boldsymbol{A}$$ 矩阵方程 $$boldsymbol{XAX=AXA}$ 的非奇异解和矩阵 $$boldsymbol{A}$ 的中心集
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-06-01 DOI: 10.3103/s0278641924700031
K. Ikramov, V. Chugunov
{"title":"Nonsingular Solutions of the Matrix Equation $$boldsymbol{XAX=AXA}$$ and the Centralizer of the Matrix $$boldsymbol{A}$$","authors":"K. Ikramov, V. Chugunov","doi":"10.3103/s0278641924700031","DOIUrl":"https://doi.org/10.3103/s0278641924700031","url":null,"abstract":"","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141399393","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
Constructing Reachable Sets for a Class of Nonsmooth Control Systems on a Plane 构建平面上一类非光滑控制系统的可达集
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-06-01 DOI: 10.3103/s0278641924700018
A. S. Aseev, S. P. Samsonov
{"title":"Constructing Reachable Sets for a Class of Nonsmooth Control Systems on a Plane","authors":"A. S. Aseev, S. P. Samsonov","doi":"10.3103/s0278641924700018","DOIUrl":"https://doi.org/10.3103/s0278641924700018","url":null,"abstract":"","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"83 8","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141411980","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
Implicatively Implicit Extensions in Three-Valued Logic 三值逻辑中的隐含式扩展
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010035
{"title":"Implicatively Implicit Extensions in Three-Valued Logic","authors":"","doi":"10.3103/s0278641924010035","DOIUrl":"https://doi.org/10.3103/s0278641924010035","url":null,"abstract":"<span> <h3>Abstract</h3> <p>Implicatively implicit extensions of all 27 one-place functions of three-valued logic are characterized. It is found they include both extensions coinciding with known implicatively closed classes and extensions that are not closed with respect to the operation of superposition. It is also shown that any implicatively implicit extension in <span> <span>(P_{k})</span> </span> contains class <span> <span>(H_{k})</span> </span> of all homogeneous functions from <span> <span>(P_{k})</span> </span> for any <span> <span>(kgeqslant 3)</span> </span>.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"82 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601531","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
Forming an Agreement between Buyers of Frequencies for Open Access at a Spectrum Auction 在频谱拍卖中为开放使用频率的买方之间签订协议
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010059
{"title":"Forming an Agreement between Buyers of Frequencies for Open Access at a Spectrum Auction","authors":"","doi":"10.3103/s0278641924010059","DOIUrl":"https://doi.org/10.3103/s0278641924010059","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The problem of an unadvertised agreement between buyers of non-exclusive rights at a spectrum auction for the agreed formation of price bids is considered from the viewpoint of game theory and operations research. Such auction participants are potential freeriders claiming free access to the frequencies being sold, which results in their non-standard behavior. Two ways of organizing an agreement for an auction with pricing according to the Vickrey rule are proposed for the full awareness of the participants about the amount of income of the partners from using the range of frequencies purchased by pooling. It is shown that the lack of information results in an equal distribution of payment between negotiating buyers, and this greatly reduces their competitive advantage in a spectrum auction. The Clarke–Groves mechanism that stimulates the identification of true preferences is analyzed and a modified version of it is developed. Unfortunately, analysis shows it does not make sense for any of them to be applied to this problem. An alternative way of choosing a joint solution based on the Germeyer–Vatel model is discussed.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"124 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601433","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
Complete Classification of Hadamard Products of Codimension 1 Subcodes of Reed–Muller Codes 里德-穆勒码的标度 1 子码的哈达玛德积的完整分类
Moscow University Computational Mathematics and Cybernetics Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010023
{"title":"Complete Classification of Hadamard Products of Codimension 1 Subcodes of Reed–Muller Codes","authors":"","doi":"10.3103/s0278641924010023","DOIUrl":"https://doi.org/10.3103/s0278641924010023","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The author constructs a complete classification of linear codes that are obtained from different types of codimension <span> <span>(1)</span> </span> subcodes of Reed–Muller codes using the Hadamard product operation.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"48 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601851","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学术官方微信