{"title":"Reconstruction of Three-Dimensional Vector Fields Based on Values of Normal, Longitudinal, and Weighted Radon Transforms","authors":"I. E. Svetov, A. P. Polyakova","doi":"10.1134/S1990478923040130","DOIUrl":"10.1134/S1990478923040130","url":null,"abstract":"<p> The paper considers the vector tomography problem of reconstructing a three-dimensional\u0000vector field based on the values of unweighted (normal and longitudinal) and weighted Radon\u0000transforms. Using the detailed decomposition of vector fields obtained in the paper, connections\u0000are established between the unweighted and weighted Radon transforms acting on vector fields\u0000and the Radon transform acting on functions. In particular, the kernels of tomographic integral\u0000operators acting on vector fields are described. Some statements of tomography problems for the\u0000reconstruction of vector fields are considered, and inversion formulas for their solution are\u0000obtained.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 4","pages":"842 - 858"},"PeriodicalIF":0.58,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139757449","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}
T. Le, V. A. Khoa, M. V. Klibanov, L. H. Nguyen, G. W. Bidney, V. N. Astratov
{"title":"Numerical Verification of the Convexification Method for a Frequency-Dependent Inverse Scattering Problem with Experimental Data","authors":"T. Le, V. A. Khoa, M. V. Klibanov, L. H. Nguyen, G. W. Bidney, V. N. Astratov","doi":"10.1134/S199047892304018X","DOIUrl":"10.1134/S199047892304018X","url":null,"abstract":"<p> The reconstruction of physical properties of a medium from boundary measurements,\u0000known as inverse scattering problems, presents significant challenges. The present study aims to\u0000validate a newly developed convexification method for a 3D coefficient inverse problem in the case\u0000of buried unknown objects in a sandbox, using experimental data collected by a microwave\u0000scattering facility at The University of North Carolina at Charlotte. Our study considers the\u0000formulation of a coupled quasilinear elliptic system based on multiple frequencies. The system can\u0000be solved by minimizing a weighted Tikhonov-like functional, which forms our convexification\u0000method. Theoretical results related to the convexification are also revisited in this work.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 4","pages":"908 - 927"},"PeriodicalIF":0.58,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140881801","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}
{"title":"Additional Constraints for Dynamic Competitive Facility Location Problem","authors":"V. L. Beresnev, A. A. Melnikov","doi":"10.1134/S199047892303002X","DOIUrl":"10.1134/S199047892303002X","url":null,"abstract":"<p> We consider a competitive facility location model where competing parties (Leader and\u0000Follower) make decisions considering changes of the set of customers happening during the planing\u0000horizon consisting a known number of time periods. It is assumed that the Leader makes a\u0000decision on opening their facilities at the beginning of the planning horizon, while the Follower can\u0000revise their decision in each time period. In the present paper, we study perspectives to apply a\u0000method for finding the best solution that is based on using HP-relaxation of the bilevel problem\u0000considered. The key element of this method is construction of additional inequalities\u0000strengthening the HP-relaxation and computation of upper bounds for the objective function of\u0000the problem. In the paper, we propose new families of additional constraints to strengthen the\u0000HP-relaxation that allow computing nontrivial upper bounds.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"483 - 490"},"PeriodicalIF":0.58,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71909044","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}
{"title":"On the Integrability and Stability of Stationary Solutions of the Goryachev–Sretensky Gyrostat","authors":"A. A. Kosov, E. I. Semenov","doi":"10.1134/S1990478923030092","DOIUrl":"10.1134/S1990478923030092","url":null,"abstract":"<p> The equations of motion of the Goryachev–Sretensky gyrostat are studied. All stationary\u0000solutions are found on the invariant set of the zero level of the area integral, and their stability is\u0000analyzed. For the case where the suspension point coincides with the center of mass and the\u0000action of a gyroscopic moment is of a special type, integration by quadratures is performed.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"557 - 570"},"PeriodicalIF":0.58,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71909132","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}
{"title":"On a Lower Bound for the Number of Bent Functions at the Minimum Distance from a Bent Function in the Maiorana–McFarland Class","authors":"D. A. Bykov, N. A. Kolomeec","doi":"10.1134/S1990478923030055","DOIUrl":"10.1134/S1990478923030055","url":null,"abstract":"<p> Bent functions at the minimum distance\u0000<span>( 2^n )</span> from a given bent function of\u0000<span>( 2n )</span> variables belonging to the Maiorana–McFarland class\u0000<span>( mathcal {M}_{2n} )</span> are investigated. We provide a criterion for a function obtained using the\u0000addition of the indicator of an\u0000<span>( n )</span>-dimensional affine subspace to a given bent function from\u0000<span>( mathcal {M}_{2n} )</span> to be a bent function as well. In other words, all bent functions at the\u0000minimum distance from a Maiorana–McFarland bent function are characterized. It is shown that\u0000the lower bound\u0000<span>( 2^{2n+1}-2^n )</span> for the number of bent functions at the minimum distance from\u0000<span>( f in mathcal {M}_{2n} )</span> is not attained if the permutation used for constructing\u0000<span>( f )</span> is not an APN function. It is proved that for any prime\u0000<span>( ngeq 5 )</span> there exist functions in\u0000<span>( mathcal {M}_{2n} )</span> for which this lower bound is accurate. Examples of such bent functions are\u0000found. It is also established that the permutations of EA-equivalent functions in\u0000<span>( mathcal {M}_{2n} )</span> are affinely equivalent if the second derivatives of at least one of the\u0000permutations are not identically zero.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"507 - 520"},"PeriodicalIF":0.58,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71909135","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}
{"title":"On Trees with a Given Diameter and the Extremal Number of Distance-(k) Independent Sets","authors":"D. S. Taletskii","doi":"10.1134/S1990478923030195","DOIUrl":"10.1134/S1990478923030195","url":null,"abstract":"<p> The set of vertices of a graph is called <i>distance-</i>\u0000<span>( k )</span><i> independent</i> if the distance between\u0000any two of its vertices is greater than some integer\u0000<span>( k geq 1 )</span>. In this paper, we describe\u0000<span>( n )</span>-vertex trees with a given diameter\u0000<span>( d )</span> that have the maximum and minimum possible number of distance-\u0000<span>( k )</span> independent sets among all such trees. The maximum problem is solvable for\u0000the case of\u0000<span>( 1 < k < d leq 5 )</span>. The minimum problem is much simpler and can be solved for all\u0000<span>( 1 < k < d < n )</span>. \u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"664 - 677"},"PeriodicalIF":0.58,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71909058","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}
N. E. Sibiryakov, D. Yu. Kochkin, O. A. Kabov, A. L. Karchevsky
{"title":"Determining the Heat Flux Density in the Area of a Contact Line during the Evaporation of Liquid into a Bubble","authors":"N. E. Sibiryakov, D. Yu. Kochkin, O. A. Kabov, A. L. Karchevsky","doi":"10.1134/S199047892303016X","DOIUrl":"10.1134/S199047892303016X","url":null,"abstract":"<p> The article describes a method for determining the heat flux density on the surface of a\u0000thin foil that is inaccessible for thermal imaging measurements based on thermal imaging data on\u0000the other side of the foil, available for measurements. Mathematically, the problem is reduced to\u0000solving the Cauchy problem for an elliptic equation, which is ill-posed. The problem is solved\u0000using noise smoothing in the initial temperature field and a correct restriction on the number of\u0000expansion terms in the Fourier series. According to the measurement results, the heat flux density\u0000reaches its maximum in the area of the contact line and amounts to\u0000<span>( 4200~text {W}/text {m}^2 )</span>.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"628 - 639"},"PeriodicalIF":0.58,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71909126","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}
V. D. Shinkarev, D. V. Lukyanenko, A. V. Tikhonravov, A. G. Yagola
{"title":"Algorithm for Monitoring Optical Coating Sputter Deposition Based on Broadband Measurement Sample Data","authors":"V. D. Shinkarev, D. V. Lukyanenko, A. V. Tikhonravov, A. G. Yagola","doi":"10.1134/S1990478923030146","DOIUrl":"10.1134/S1990478923030146","url":null,"abstract":"<p> We consider an algorithm for monitoring the process of sputter deposition of optical\u0000coatings based on the analysis of sample data of broadband measurements for a fixed set of\u0000wavelengths. On the one hand, the considered algorithm uses broadband measurement data,\u0000which is an advantage compared to using only monochromatic measurement data for one fixed\u0000wavelength, and on the other hand, it is fast compared to algorithms that use complete broadband\u0000measurement data. It has been demonstrated that the proposed algorithm allows one to obtain\u0000fairly accurate estimates of the layer thicknesses in deposited multilayer optical coatings.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"608 - 615"},"PeriodicalIF":0.58,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71909060","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}
{"title":"Estimates of Implementation Complexity for Quantum Cryptanalysis of Post-Quantum Lattice-Based Cryptosystems","authors":"A. O. Bakharev","doi":"10.1134/S1990478923030018","DOIUrl":"10.1134/S1990478923030018","url":null,"abstract":"<p> Due to the development of quantum computing, there is a need for the development and\u0000analysis of cryptosystems resistant to attacks using a quantum computer (post-quantum\u0000cryptography algorithms). The security of many well-known post-quantum cryptosystems based\u0000on lattice theory depends on the complexity of solving the shortest vector problem (SVP). In this\u0000paper, a model of quantum oracle developed from Grover’s algorithm is described to implement\u0000a hybrid quantum–classical algorithm based on GaussSieve. This algorithm can be used for\u0000attacks on cryptosystems whose security depends on solving the SVP. Upper bounds for the\u0000number of qubits and the depth of the circuit were obtained for two implementations of the\u0000proposed quantum oracle model: minimizing the number of qubits and minimizing the circuit\u0000depth. The complexity of implementing the proposed quantum oracle model to attack\u0000post-quantum lattice-based cryptosystems that are finalists of the NIST post-quantum\u0000cryptography competition is analyzed.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"459 - 482"},"PeriodicalIF":0.58,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71909056","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}
{"title":"Modeling Competition between Populations with Multi-Taxis","authors":"A. V. Budyansky, V. G. Tsybulin","doi":"10.1134/S1990478923030043","DOIUrl":"10.1134/S1990478923030043","url":null,"abstract":"<p> We study a mathematical model of competition between two populations described by a\u0000system of nonlinear differential reaction–diffusion–advection equations. The taxis is introduced to\u0000model the heterogeneity of the total resource and the nonuniform distribution of both species. We\u0000analyze the role of the taxis in the area occupancy. The maps of migration parameters\u0000corresponding to various variants of competitive exclusion and coexistence of species are\u0000calculated. Using the theory of cosymmetry, we find parametric relations under which\u0000multistability arises. In a computational experiment, population scenarios with a violation of\u0000cosymmetry were studied.\u0000</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"498 - 506"},"PeriodicalIF":0.58,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71909136","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}