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

Programming and Computer Software最新文献

筛选
英文 中文
On Linear Cellular Automata 论线性蜂窝自动机
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824010067
V. R. Kulikov, A. A. Kytmanov, A. O. Poroshin, I. V. Timofeev, D. P. Fedchenko
{"title":"On Linear Cellular Automata","authors":"V. R. Kulikov, A. A. Kytmanov, A. O. Poroshin, I. V. Timofeev, D. P. Fedchenko","doi":"10.1134/s0361768824010067","DOIUrl":"https://doi.org/10.1134/s0361768824010067","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>wolfram cellular automata are considered and their operation is demonstrated using an example of traffic flow simulation. For the class of one-dimensional elementary cellular automata, the concept of linearity is introduced in the language of Zhegalkin operators. An algorithm for finding linear Zhegalkin operators with multipliers of three variables is presented. The algorithm is implemented in Python.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"120 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lower Bounds for the Rank of a Matrix with Zeros and Ones outside the Leading Diagonal 前对角线外有零和一的矩阵秩下限
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824020142
A. V. Seliverstov, O. A. Zverkov
{"title":"Lower Bounds for the Rank of a Matrix with Zeros and Ones outside the Leading Diagonal","authors":"A. V. Seliverstov, O. A. Zverkov","doi":"10.1134/s0361768824020142","DOIUrl":"https://doi.org/10.1134/s0361768824020142","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>We found a lower bound on the rank of a square matrix where every entry in the leading diagonal is neither zero nor one and every entry outside the leading diagonal is either zero or one. The rank of this matrix is at least half its order. Under an additional condition, the lower bound is higher by one. This condition means that some auxiliary system of linear equations has no binary solution. Some examples are provided that show that the lower bound can be achieved. This lower bound on the matrix rank allows the problem of finding a binary solution to a system of linear equations with a sufficiently large number of linearly independent equations to be reduced to a similar problem in a smaller number of variables. Restrictions on the existence of a large set of solutions are found, each differing from the binary one by the value of one variable. In addition, we discuss the possibility of certifying the absence of a binary solution to a large system of linear algebraic equations. Estimates of the time required for calculating the matrix rank in the SymPy computer algebra system are also provided. It is shown that the rank of a matrix over the field of residues modulo prime number is calculated faster than it generally takes to calculate the rank of a matrix of the same order over the field of rational numbers.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"42 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153120","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Symbolic Studies of Maxwell’s Equations in Space-Time Algebra Formalism 时空代数形式主义下麦克斯韦方程的符号研究
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824020087
A. V. Korol’kova, M. N. Gevorkyan, A. V. Fedorov, K. A. Shtepa, D. S. Kulyabov
{"title":"Symbolic Studies of Maxwell’s Equations in Space-Time Algebra Formalism","authors":"A. V. Korol’kova, M. N. Gevorkyan, A. V. Fedorov, K. A. Shtepa, D. S. Kulyabov","doi":"10.1134/s0361768824020087","DOIUrl":"https://doi.org/10.1134/s0361768824020087","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Different implementations of Clifford algebra: spinors, quaternions, and geometric algebra, are used to describe physical and technical systems. The geometric algebra formalism is a relatively new approach, destined to be used primarily by engineers and applied researchers. In a number of works, the authors examined the implementation of the geometric algebra formalism for computer algebra systems. In this article, the authors extend elliptic geometric algebra to hyperbolic space-time algebra. The results are illustrated by different representations of Maxwell’s equations. Using a computer algebra system, Maxwell’s vacuum equations in the space-time algebra representation are converted to Maxwell’s equations in vector formalism. In addition to practical application, the authors would like to draw attention to the didactic significance of these studies.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Port-Hamiltonian Systems: Structure Recognition and Applications 端口-哈密顿系统：结构识别与应用
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824020130
V. Salnikov
{"title":"Port-Hamiltonian Systems: Structure Recognition and Applications","authors":"V. Salnikov","doi":"10.1134/s0361768824020130","DOIUrl":"https://doi.org/10.1134/s0361768824020130","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>In this paper, we continue to consider the problem of recovering the port-Hamiltonian structure for an arbitrary system of differential equations. We complement our previous study on this topic by explaining the choice of machine learning algorithms and discussing some details of their application. We also consider the possibility provided by this approach for a potentially new definition of canonical forms and classification of systems of differential equations.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"10 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153082","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Calculating Partial Sums of Multiple Numerical Series by Methods of Computer Algebra 论用计算机代数方法计算多重数值序列的部分和
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824020099
V. I. Kuzovatov, A. A. Kytmanov, E. K. Myshkina
{"title":"On Calculating Partial Sums of Multiple Numerical Series by Methods of Computer Algebra","authors":"V. I. Kuzovatov, A. A. Kytmanov, E. K. Myshkina","doi":"10.1134/s0361768824020099","DOIUrl":"https://doi.org/10.1134/s0361768824020099","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>A method to calculate partial sums of some multiple numerical series arising when searching for the resultant of a polynomial and an entire function is proposed. One can apply a symbolic algorithm that uses recurrent Newton formulas to find power sums of roots included in this formula without finding the very roots of the system. The algorithm that implements the proposed approach to calculate partial sums of multiple numerical series is implemented in Maple. Examples of using this algorithm to find partial sums of some classes of multiple numerical series are given.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"16 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Searching for Laurent Solutions of Truncated Systems of Linear Differential Equations with the Use of EG-Eliminations 利用 EG-极限搜索线性微分方程截断系统的劳伦特解
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824020129
A. A. Ryabenko, D. E. Khmelnov
{"title":"Searching for Laurent Solutions of Truncated Systems of Linear Differential Equations with the Use of EG-Eliminations","authors":"A. A. Ryabenko, D. E. Khmelnov","doi":"10.1134/s0361768824020129","DOIUrl":"https://doi.org/10.1134/s0361768824020129","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Laurent solutions of systems of linear ordinary differential equations with truncated power series as coefficients are considered. The Laurent series in the solutions are also truncated. As a means for constructing such solutions, induced recurrent systems are used; earlier, an algorithm for the case when the induced recurrent system has a nonsingular leading matrix was proposed. For the series in solutions, this algorithm finds the maximum possible number of terms that are invariant with respect to any prolongation of the truncated coefficients of the original system. Results on extending the applicability of the earlier proposed algorithm to the case when the leading matrix is singular using the EG-elimination algorithm as an auxiliary tool. An implementation of the proposed algorithm in the form of a Maple procedure is given and examples of its use are presented.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"33 7 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Description of Paralocks Language Semantics in TLA+ TLA+ 中 Paralocks 语言语义描述
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824010110
A. A. Timakov
{"title":"Description of Paralocks Language Semantics in TLA+","authors":"A. A. Timakov","doi":"10.1134/s0361768824010110","DOIUrl":"https://doi.org/10.1134/s0361768824010110","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>One of the basic aspects of information flow control in applications is a security policy language. This language should allow one to define security policies for evaluation of environment elements in coherence with higher-level access control rules. Hence, the language is expected to be flexible because there may be different access control paradigms (mandatory, role-based, etc.) implemented at the system level. The application may also have its own specific restrictions. Finally, it is also desirable that the language support declassification (controlled release of information) during computations. Paralocks is one of such languages. This research is devoted to the logical semantics of a modified version of Paralocks implemented in TLA+. Paralocks represents a language basis for the PLIF information flow control platform, which is developed with author’s participation for the analysis of PL/SQL program blocks. It includes proofs of the partial order and lattice defined on a set of security policy expressions.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"2015 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153095","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Constructing Compartmental Models of Dynamic Systems Using a Software Package for Symbolic Computation in Julia 使用朱莉娅符号计算软件包构建动态系统分区模型
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824020051
A. V. Demidova, O. V. Druzhinina, O. N. Masina, A. A. Petrov
{"title":"Constructing Compartmental Models of Dynamic Systems Using a Software Package for Symbolic Computation in Julia","authors":"A. V. Demidova, O. V. Druzhinina, O. N. Masina, A. A. Petrov","doi":"10.1134/s0361768824020051","DOIUrl":"https://doi.org/10.1134/s0361768824020051","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>This paper considers the problem of constructing compartmental models of dynamic systems by using a software package for symbolic calculation written in Julia. The software package is aimed at unifying the formalized construction of compartmental models, taking into account the meaningful description of possible interactions among compartments and the influence of various factors on the evolution of systems. An approach to the development of the instrumental and methodological basis for modeling the dynamic systems the behavior of which can be described by one-step processes is developed. The proposed software package enables the symbolic representation of the differential equations of the model in both stochastic and deterministic cases. It is implemented in Julia and uses the Julia Symbolics computer algebra library. A comparison between the Julia Symbolics tools and some other computer algebra systems is carried out. The application of the developed software package to a compartmental model is considered. The results can be used to solve problems of constructing and studying dynamic models in natural sciences that are represented by one-step processes.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"132 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Calculating Similarity of Javadoc Comments 计算 Javadoc 注释的相似性
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-05-22 DOI: 10.1134/s0361768824010043
D. V. Koznov, E. Yu. Ledeneva, D. V. Luciv, P. I. Braslavski
{"title":"Calculating Similarity of Javadoc Comments","authors":"D. V. Koznov, E. Yu. Ledeneva, D. V. Luciv, P. I. Braslavski","doi":"10.1134/s0361768824010043","DOIUrl":"https://doi.org/10.1134/s0361768824010043","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Code comments are an essential part of software documentation. Many software projects suffer from the problem of low-quality comments that are often produced by copy-paste. In case of similar methods, classes, etc. copy-pasted comments with minor modifications are justified. However, in many cases this approach leads to degraded documentation quality and, subsequently, to problematic maintenance and development of the project. In this study, we address the problem of near-duplicate code comments detection, which can potentially improve software documentation. We have conducted a thorough evaluation of traditional string similarity metrics and modern machine learning methods. In our experiment, we use a collection of Javadoc comments from four industrial open-source Java projects. We have found out that LCS (Longest Common Subsequence) is the best similarity algorithm taking into account both quality (Precision 94%, Recall 74%) and performance.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"196 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141153265","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal Placement of Base Stations in Integrated Design of Wireless Networks 无线网络集成设计中基站的优化布局
IF 0.7 4区 计算机科学
Programming and Computer Software Pub Date : 2024-03-12 DOI: 10.1134/s0361768823100055
O. Yu. Pershin, A. A. Mukhtarov, V. M. Vishnevsky, A. A. Larionov
{"title":"Optimal Placement of Base Stations in Integrated Design of Wireless Networks","authors":"O. Yu. Pershin, A. A. Mukhtarov, V. M. Vishnevsky, A. A. Larionov","doi":"10.1134/s0361768823100055","DOIUrl":"https://doi.org/10.1134/s0361768823100055","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>Topology synthesis in integrated design of wireless communication networks is considered. An iterative method has been developed for placing base stations of a broadband network along extended transportation routes. The problem of base station placement is formulated as an extremal problem on a finite set in the form of a special combinatorial model. An algorithm of the branch and bound method (BBM) has been developed to solve this problem. This algorithm serves as the basis for finding a sequence of best variants for the placement of base stations. Numerical calculations confirming the efficiency of the proposed algorithm are described.</p>","PeriodicalId":54555,"journal":{"name":"Programming and Computer Software","volume":"3 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2024-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140115066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"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学术官方微信