Discrete and Continuous Models and Applied Computational Science

Editor-in-Chief: Yuriy P. Rybakov, Doctor of Science (Physics and Mathematics), Professor, Honored Scientist of Russia

ISSN: 2658-4670 (Print). ISSN: 2658-7149 (Online)

Founded in 1993. Publication frequency: quarterly.

Peer-Review: double blind. Publication language: English. 

APC: no article processing charge. Open Access: Open Access , DOAJ SEAL

PUBLISHER: Peoples’ Friendship University of Russia named after Patrice Lumumba (RUDN University)

See the Journal History to get information on previous journal titles.

Indexation: Russian Index of Science Citation, Scopus (Q3 SJR), VINITI RAS, DOAJ, Google Scholar, Ulrich's Periodicals Directory, WorldCat, Cyberleninka, East View, Dimensions, ResearchBib, Lens, Research4Life, JournalTOCs

 

Discrete and Continuous Models and Applied Computational Science was created in 2019 by renaming RUDN Journal of Mathematics, Information Sciences and Physics. RUDN Journal of Mathematics, Information Sciences and Physics was created in 2006 by combining the series "Physics", "Mathematics", "Applied Mathematics and Computer Science", "Applied Mathematics and Computer Mathematics".

Discussed issues affecting modern problems of physics, mathematical modeling, computer science. The widely discussed issues Teletraffic theory, queuing systems design, software and databases design and development.

Discussed problems in physics related to quantum theory, nuclear physics and elementary particle physics, astrophysics, statistical physics, the theory of gravity, plasma physics and the interaction of electromagnetic fields with matter, radio physics and electronics, nonlinear optics.

Journal has a high qualitative and quantitative indicators. The Editorial Board consists of well-known scientists of world renown, whose works are highly valued and are cited in the scientific community. Articles are indexed in the Russian and foreign databases. Each paper is reviewed by at least two reviewers, the composition of which includes PhDs, are well known in their circles. Author's part of the magazine includes both young scientists, graduate students and talented students, who publish their works, and famous giants of world science.

Subject areas:

  • Mathematics
    • Modeling and Simulation
    • Mathematical Physics
  • Computer Science
    • Computer Science (miscellaneous)

 

Announcements

 
No announcements have been published.
 
More Announcements...

Current Issue

Vol 33, No 1 (2025)

Editorial

Abstract structure
Kulyabov D.S., Sevastianov L.A.
Abstract

We describe the general requirements for the abstract of a scientific article. We recommend to use the structured abstract approach

Discrete and Continuous Models and Applied Computational Science. 2025;33(1):5-9
pages 5-9 views

Computer Science

Modeling and optimization of an M/M/1/K queue with single working vacation, feedback, and impatience timers under N-policy
Kadi A., Boualem M., Touche N., Dehimi A.
Abstract

This work presents an intensive study of a single server finite-capacity queueing model with impatience timers which depend on the server’s states, feedback, and a single working vacation policy operating under an \(N\)-policy discipline. We examine the scenario where the server must wait for the number of customers to reach \(N\) to start a regular busy period; otherwise, the server will initiate a working vacation or switch to the dormant state if the number of customers increases. By applying the Markov recursive method, the steady-state probabilities were derived. Various performance metrics were visually depicted to assess diverse system parameter configurations. After constructing the expected cost function of the model, Grey Wolf Optimization (GWO) algorithm is utilized to determine the optimum values of the service rates \(\mu^{*}\) and \(\mu_{v}^{*}\). Numerical examples are provided to validate the theoretical findings, offering insights into this intricate system.

Discrete and Continuous Models and Applied Computational Science. 2025;33(1):10-26
pages 10-26 views
Statistical and density-based clustering techniques in the context of anomaly detection in network systems: A comparative analysis
Baklashov A.S., Kulyabov D.S.
Abstract

In the modern world, the volume of data stored electronically and transmitted over networks continues to grow rapidly. This trend increases the demand for the development of effective methods to protect information transmitted over networks as network traffic. Anomaly detection plays a crucial role in ensuring net security and safeguarding data against cyberattacks. This study aims to review statistical and density-based clustering methods used for anomaly detection in network systems and to perform a comparative analysis based on a specific task. To achieve this goal, the authors analyzed existing approaches to anomaly detection using clustering methods. Various algorithms and clustering techniques applied within network environments were examined in this study. The comparative analysis highlights the high effectiveness of clustering methods in detecting anomalies in network traffic. These findings support the recommendation to integrate such methods into intrusion detection systems to enhance information security levels. The study identified common features, differences, strengths, and limitations of the different methods. The results offer practical insights for improving intrusion detection systems and strengthening data protection in network infrastructures.

Discrete and Continuous Models and Applied Computational Science. 2025;33(1):27-45
pages 27-45 views

Modeling and Simulation

Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices
Milena V.
Abstract

Systems of linear algebraic equations with multi-diagonal coefficient matrices may arise after many different scientific and engineering problems, as well as problems of the computational linear algebra where finding the solution of such a system of linear algebraic equations is considered to be one of the most important problems. This paper presents a generalised symbolic algorithm for solving systems of linear algebraic equations with multi-diagonal coefficient matrices. The algorithm is given in a pseudocode. A theorem which gives the condition for correctness of the algorithm is formulated and proven. Formula for the complexity of the multidiagonal numerical algorithm is obtained.

Discrete and Continuous Models and Applied Computational Science. 2025;33(1):46-56
pages 46-56 views
On the stable approximate solution of the ill-posed boundary value problem for the Laplace equation with homogeneous conditions of the second kind on the edges at inaccurate data on the approximated boundary
Laneev E.B., Klimishin A.V.
Abstract

In this paper, we consider the ill-posed continuation problem for harmonic functions from an ill-defined boundary in a cylindrical domain with homogeneous boundary conditions of the second type on the side faces. The value of the function and its normal derivative (Cauchy conditions) is known approximately on an approximated surface of arbitrary shape bounding the cylinder. In this case, the Cauchy problem for the Laplace equation has the property of instability with respect to the error in the Cauchy data, that is, it is ill-posed. On the basis of an idea about the source function of the original problem, the exact solution is represented as a sum of two functions, one of which depends explicitly on the Cauchy conditions, and the second one can be obtained as a solution of the Fredholm integral equation of the first kind in the form of Fourier series on the eigenfunctions of the second boundary value problem for the Laplace equation. To obtain an approximate stable solution of the integral equation, the Tikhonov regularization method is applied when the solution is obtained as an extremal of the Tikhonov functional. For an approximated surface, we consider the calculation of the normal to this surface and its convergence to the exact value depending on the error with which the original surface is given. The convergence of the obtained approximate solution to the exact solution is proved when the regularization parameter is compared with the errors in the data both on the inexactly specified boundary and on the value of the original function on this boundary. A numerical experiment is carried out to demonstrate the effectiveness of the proposed approach for a special case, for a flat boundary and a specific initial heat source (a set of sharpened sources).

Discrete and Continuous Models and Applied Computational Science. 2025;33(1):57-73
pages 57-73 views
Analytic projective geometry for computer graphics
Gevorkyan M.N., Korolkova A.V., Kulyabov D.S., Sevastianov L.A.
Abstract

The motivation of this paper was the development of computer geometry course for students of mathematical specialties. The term “computer geometry” hereafter refers to the mathematical foundations of machine graphics. It is important to emphasize separately that this course should be designed for second-year students and, therefore, they can only be required to have prior knowledge of a standard course in algebra and mathematical analysis. This imposes certain restrictions on the material presented. When studying the thematic literature, it was found out that the de facto standard in modern computer graphics is the use of projective space and homogeneous coordinates. However, the authors faced a methodological problem-the almost complete lack of suitable educational literature in both Russian and English. This paper was written to present the information collected by the authors on this issue.

Discrete and Continuous Models and Applied Computational Science. 2025;33(1):74-102
pages 74-102 views

Letters

On the methods of minimizing the risks of implementing artificial intelligence in the financial business of a company
Shchetinin E.Y., Sevastianov L.A., Demidova A.V., Velieva T.R.
Abstract

Effective application of artificial intelligence (AI) models in various fields in the field of financial risks can increase the speed of data processing, deepen the degree of their analysis and reduce labor costs, thereby effectively improving the efficiency of financial risk control. The application of AI in the field of financial risk management puts forward new requirements for the system configuration and operation mode of financial supervision. With the rapid growth of computer and network technologies, the increase in the frequency of market transactions, the diversification of data sources, and the development and application of big data, this creates new problems for financial risk management based on big data. This paper analyzes the role of artificial intelligence in promoting the reform and growth of the financial industry, and proposes countermeasures for the rational use of AI in the field of financial risk management.

Discrete and Continuous Models and Applied Computational Science. 2025;33(1):103-111
pages 103-111 views

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies