All issues

Original representation of statistical digital model of measurement of a macroroughness on a local site (to 15) consisting of determined (bias), correlated (standard periodic making and periodic deviations from flatness) and actually casual making (values of a macroroughness) Is offered.

Large Language Models (LLMs) are transforming software engineering by bridging the gap between natural language and programming languages. These models have revolutionized communication within development teams and the Software Development Life Cycle (SDLC) by enabling developers to interact with code using natural language, thereby improving workflow efficiency. This survey examines the impact of LLMs across various stages of the SDLC, including requirement gathering, system design, coding, debugging, testing, and documentation. LLMs have proven to be particularly useful in automating repetitive tasks such as code generation, refactoring, and bug detection, thus reducing manual effort and accelerating the development process. The integration of LLMs into the development process offers several advantages, including the automation of error correction, enhanced collaboration, and the ability to generate high-quality, functional code based on natural language input. Additionally, LLMs assist developers in understanding and implementing complex software requirements and design patterns. This paper also discusses the evolution of LLMs from simple code completion tools to sophisticated models capable of performing high-level software engineering tasks. However, despite their benefits, there are challenges associated with LLM adoption, such as issues related to model accuracy, interpretability, and potential biases. These limitations must be addressed to ensure the reliable deployment of LLMs in production environments. The paper concludes by identifying key areas for future research, including improving the adaptability of LLMs to specific software domains, enhancing their contextual understanding, and refining their capabilities to generate semantically accurate and efficient code. This survey provides valuable insights into the evolving role of LLMs in software engineering, offering a foundation for further exploration and practical implementation.

The nonlinear restrictive (with restrictions of the inequalities type) dynamic mathematical model of the committed competition vacant market of many goods in conditions of the goods deliveries time-lag and of the linear dependency of the demand vector from the prices vector is offered. The problem of finding of prices and deliveries of goods into the market which are optimal (from seller’s profit standpoint) is formulated. It is shown the seller’s total profit maximum is expressing by the continuous piecewise smooth function of vector of volumes of deliveries with breakup of the derivative on borders of zones of the goods deficit, of the overstocking and of the dynamic balance of demand and offer of each of goods. With use of the predicate functions technique the computing algorithm of optimization of the goods deliveries into the market is built.

The traditional approach to studying inter-journal communication involves analyzing journal citation graphs. This paper proposes a method for analyzing journal networks using a new type of bibliometric graph — a journal intersection graph based on the binary operation of set intersection — employing techniques grounded in the friendship index and the disparity function. The approach is demonstrated using a relatively small example of a real journal network, with data sourced from the All-Russian portal Math-Net.Ru information system: 63 journals from 2008–2021 meeting specific criteria, containing almost 69 thousand articles authored by 54 thousand individuals. The mathematical model of this real-world network is represented as an intersection graph using the Jaccard coefficient, which exhibits specific properties: low dimensionality, high graph density, and an edge weight distribution that is not approximated by a power law function. The obtained results include the network structure of connections within the studied set of journals, accounting for their degree of interaction, and the identification of significant vertices using the friendship index. This captures the graph’s structural properties, offers an obvious substantive interpretation, and allows for ranking journals by this metric. Thus, the method implements a tool for distinguishing between vertices that are leaders in terms of the friendship index and “network integrators” (based on closeness/betweenness centrality). It also demonstrates a qualitative change in structural properties when reducing graph density while maintaining connectivity, achieved by applying the disparity function. The sequential application of the disparity function while lowering the significance threshold allows for the identification of the graph’s core, containing the most strongly connected vertices. This, in turn, enables the determination of a set of vertices (and corresponding journals) that are simultaneously part of the core and have the highest significance according to the friendship index. An analysis of the levels of this resulting journal set within the “Belyi Spisok” (“White List”) shows these journals have a high rating. The findings provide a deeper understanding of the relationship structure within scientific journal networks and define new approaches for their study.

We'd like to present a specific grid infrastructure and web application development and deployment. The purpose of infrastructure and web application is to solve particular geophysical problems that require heavy computational resources. Here we cover technology overview and connector framework internals. The connector framework links problem-specific routines with middleware in a manner that developer of application doesn't have to be aware of any particular grid software. That is, the web application built with this framework acts as an interface between the user 's web browser and Grid's (often very) own middleware.

Our distributed computing system is built around Gridway metascheduler. The metascheduler is connected to TORQUE resource managers of virtual compute nodes that are being run atop of compute cluster utilizing the virtualization technology. Such approach offers several notable features that are unavailable to bare-metal compute clusters.

The first application we've integrated with our framework is seismic anisotropic parameters determination by inversion of SKS and converted phases. We've used probabilistic approach to inverse problem solution based on a posteriory probability distribution function (APDF) formalism. To get the exact solution of the problem we have to compute the values of multidimensional function. Within our implementation we used brute-force APDF calculation on rectangular grid across parameter space.

The result of computation is stored in relational DBMS and then represented in familiar human-readable form. Application provides several instruments to allow analysis of function's shape by computational results: maximum value distribution, 2D cross-sections of APDF, 2D marginals and a few other tools. During the tests we've run the application against both synthetic and observed data.

This work is devoted to molecular dynamic modeling of the thermal impact processes on the metal sample consisting of nickel atoms. For the solution of this problem, a continuous mathematical model on the basis of the classical Newton mechanics equations has been used; a numerical method based on the Verlet scheme has been chosen; a parallel algorithm has been offered, and its realization within the MPI and OpenMP technologies has been executed. By means of the developed parallel program, the investigation of thermodynamic equilibrium of nickel atoms’ system under the conditions of heating a sample to desired temperature has been executed. In numerical experiments both optimum parameters of calculation procedure and physical parameters of analyzed process have been defined. The obtained numerical results are well corresponding to known theoretical and experimental data.

The paper presents a software system aimed at finding best (in some sense) parameters of an algorithm. The system handles both discrete and continuous parameters and employs massive parallelism offered by public clouds. The paper presents an overview of the system, a method to measure algorithm's performance in the cloud and numerical results of system's use on several problem sets.

The technique of ensuring of interoperability for Grid-systems and systems of cloud computing is provided. The technique is constructed on a basis of the uniform approach of ensuring interoperability for systems of the wide class offered by authors and recorded in the national Russian Federation standard.