首页 > 最新文献

Moscow University Computational Mathematics and Cybernetics最新文献

英文 中文
RMS Risk Analysis when Using Multiple Hypothesis Testing Select Parameters of Thresholding under Conditions of Weak Dependence 使用多重假设检验时的均方根风险分析 在弱依赖条件下选择阈值参数
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}$$ 单变量函数的多项式性
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 利用定向学习重构随机微分方程的未知系数并智能预测随机过程
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 关于对称群上正则语言的卡底计算问题
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}$$系统中静态延迟的最大值
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}$ 的中心集
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 构建平面上一类非光滑控制系统的可达集
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 三值逻辑中的隐含式扩展
Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010035

Abstract

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 (P_{k}) contains class (H_{k}) of all homogeneous functions from (P_{k}) for any (kgeqslant 3) .

摘要 描述了三值逻辑中所有 27 个单位函数的蕴涵式隐含扩展。研究发现,它们既包括与已知蕴涵封闭类重合的扩展,也包括在叠加操作方面不封闭的扩展。研究还表明,对于任意(kgeqslant 3) ,(P_{k})中的任何蕴涵式扩展都包含来自(P_{k})的所有同调函数的类(H_{k})。
{"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 在频谱拍卖中为开放使用频率的买方之间签订协议
Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010059

Abstract

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.

摘要 本文从博弈论和运筹学的角度探讨了在频谱拍卖中,非独占权买方之间为商定出价而达成的非公开协议问题。这类拍卖参与者是潜在的自由人,他们要求免费获得所拍卖的频率,这导致了他们的非标准行为。本文提出了两种根据维克里规则定价的拍卖协议组织方式,让参与者充分了解合作伙伴从使用集合购买的频率范围中获得的收入数额。结果表明,由于缺乏信息,谈判买方之间的付款分配是均等的,这大大降低了他们在频谱拍卖中的竞争优势。本文分析了克拉克-格罗夫斯机制对识别真实偏好的激励作用,并对其进行了改进。不幸的是,分析表明,任何一种机制应用于这一问题都没有意义。讨论了基于 Germeyer-Vatel 模型选择联合解决方案的另一种方法。
{"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 子码的哈达玛德积的完整分类
Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010023

Abstract

The author constructs a complete classification of linear codes that are obtained from different types of codimension (1) subcodes of Reed–Muller codes using the Hadamard product operation.

摘要 作者利用哈达玛乘积运算,构建了从里德-穆勒编码的不同类型编码维数(1)子编码得到的线性编码的完整分类。
{"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
期刊
Moscow University Computational Mathematics and Cybernetics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1