Pub Date : 2024-06-01DOI: 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}
Pub Date : 2024-06-01DOI: 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}
Pub Date : 2024-06-01DOI: 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}
Pub Date : 2024-06-01DOI: 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}
Pub Date : 2024-06-01DOI: 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}
Pub Date : 2024-06-01DOI: 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}
Pub Date : 2024-06-01DOI: 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}
Pub Date : 2024-03-01DOI: 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).
{"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}
Pub Date : 2024-03-01DOI: 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.
{"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}
Pub Date : 2024-03-01DOI: 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.
{"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}