All issues

Currently, a significant development has been observed in the direction of distributed computing theory, where computational tasks are solved collectively by resource-constrained devices. In practice, this scenario is implemented when processing data in Internet of Things systems, with the aim of reducing system latency and network infrastructure load, as data is processed on edge network computing devices. However, the rapid growth and widespread adoption of IoT systems raise questions about the need to develop methods for reducing the resource intensity of computations. The resource constraints of computing devices pose the following issues regarding the distribution of computational resources: firstly, the necessity to account for the transit cost between different devices solving various tasks; secondly, the necessity to consider the resource cost associated directly with the process of distributing computational resources, which is particularly relevant for groups of autonomous devices such as drones or robots. An analysis of modern publications available in open access demonstrated the absence of proposed models or methods for distributing computational resources that would simultaneously take into account all these factors, making the creation of a new mathematical model for organizing distributed computing in IoT systems and its solution methods topical. This article proposes a novel mathematical model for distributing computational resources along with heuristic optimization methods, providing an integrated approach to implementing distributed computing in IoT systems. A scenario is considered where there exists a leader device within a group that makes decisions concerning the allocation of computational resources, including its own, for distributed task resolution involving information exchanges. It is also assumed that no prior knowledge exists regarding which device will assume the role of leader or the migration paths of computational tasks across devices. Experimental results have shown the effectiveness of using the proposed models and heuristics: achieving up to a 52% reduction in resource costs for solving computational problems while accounting for data transit costs, saving up to 73% of resources through supplementary criteria optimizing task distribution based on minimizing fragment migrations and distances, and decreasing the resource cost of resolving the computational resource distribution problem by up to 28 times with reductions in distribution quality up to 10%.

We examine a phenomenological algorithm for generating morphology of astrocytes, a major class of glial brain cells, based on morphometric data of rat brain protoplasmic astrocytes and observations of general cell development trends in vivo, based on current literature. We adapted the Space Colonization Algorithm (SCA) for procedural generation of astrocytic morphology from scratch. Attractor points used in generation were spatially distributed in the model volume according to the synapse distribution density in the rat hippocampus tissue during the first week of postnatal brain development. We analyzed and compared astrocytic morphology reconstructions at different brain development stages using morphometry estimation techniques such as Sholl analysis, number of bifurcations, number of terminals, total tree length, and maximum branching order. Using morphometric data from protoplasmic astrocytes of rats at different ages, we selected the necessary generation parameters to obtain the most realistic three-dimensional cell morphology models. We demonstrate that our proposed algorithm allows not only to obtain individual cell geometry but also recreate the phenomenon of tiling domain organization in the cell populations. In our algorithm tiling emerges due to the cell competition for territory and the assignment of unique attractor points to their processes, which then become unavailable to other cells and their processes. We further extend the original algorithm by splitting morphology generation in two phases, thereby simulating astrocyte tree structure development during the first and third-fourth weeks of rat postnatal brain development: rapid space exploration at the first stage and extensive branching at the second stage. To this end, we introduce two attractor types to separate two different growth strategies in time. We hypothesize that the extended algorithm with dynamic attractor generation can explain the formation process of fine astrocyte cell structures and maturation of astrocytic arborizations.

WS-BPEL is a widely accepted standard for specification of business distributed and parallel processes. This standard is a mismatch of algebraic and Petri net paradigms. Following that, it is easy to specify WS-BPEL business process with unwanted features. That is why the verification of WS-BPEL business processes is very important. The intent of this paper is to show some possibilities for conversion of a WS-BPEL processes into more formal specifications that can be verified. CSP and Z-notation are used as formal models. Z-notation is useful for specification of abstract data types. Web services can be viewed as a kind of abstract data types.

The paper presents a physico-mathematical model of the perturbed region formed in the lower D-layer of the ionosphere under the action of directed radio emission flux from a terrestrial stand of the megahertz frequency range, obtained as a result of comprehensive theoretical studies. The model is based on the consideration of a wide range of kinetic processes taking into account their nonequilibrium and in the two-temperature approximation for describing the transformation of the radio beam energy absorbed by electrons. The initial data on radio emission achieved by the most powerful radio-heating stands are taken in the paper. Their basic characteristics and principles of functioning, and features of the altitude distribution of the absorbed electromagnetic energy of the radio beam are briefly described. The paper presents the decisive role of the D-layer of the ionosphere in the absorption of the energy of the radio beam. On the basis of theoretical analysis, analytical expressions are obtained for the contribution of various inelastic processes to the distribution of the absorbed energy, which makes it possible to correctly describe the contribution of each of the processes considered. The work considers more than 60 components. The change of the component concentration describe about 160 reactions. All the reactions are divided into five groups according to their physical content: ionization-chemical block, excitation block of metastable electronic states, cluster block, excitation block of vibrational states and block of impurities. Blocks are interrelated and can be calculated both jointly and separately. The paper presents the behavior of the parameters of the perturbed region in daytime and nighttime conditions is significantly different at the same radio flux density: under day conditions, the maximum electron concentration and temperature are at an altitude of ~45–55 km; in night ~80 km, with the temperature of heavy particles rapidly increasing, which leads to the occurrence of a gas-dynamic flow. Therefore, a special numerical algorithm are developed to solve two basic problems: kinetic and gas dynamic. Based on the altitude and temporal behavior of concentrations and temperatures, the algorithm makes it possible to determine the ionization and emission of the ionosphere in the visible and infrared spectral range, which makes it possible to evaluate the influence of the perturbed region on radio engineering and optoelectronic devices used in space technology.

Deep learning’s power stems from complex architectures; however, these can lead to overfitting, where models memorize training data and fail to generalize to unseen examples. This paper proposes a novel probabilistic approach to mitigate this issue. We introduce two key elements: Truncated Log-Uniform Prior and Truncated Log-Normal Variational Approximation, and Automatic Relevance Determination (ARD) with Bayesian Deep Neural Networks (BDNNs). Within the probabilistic framework, we employ a specially designed truncated log-uniform prior for noise. This prior acts as a regularizer, guiding the learning process towards simpler solutions and reducing overfitting. Additionally, a truncated log-normal variational approximation is used for efficient handling of the complex probability distributions inherent in deep learning models. ARD automatically identifies and removes irrelevant features or weights within a model. By integrating ARD with BDNNs, where weights have a probability distribution, we achieve a variational bound similar to the popular variational dropout technique. Dropout randomly drops neurons during training, encouraging the model not to rely heavily on any single feature. Our approach with ARD achieves similar benefits without the randomness of dropout, potentially leading to more stable training.

To evaluate our approach, we have tested the model on two datasets: the Canadian Institute For Advanced Research (CIFAR-10) for image classification and a dataset of Macroscopic Images of Wood, which is compiled from multiple macroscopic images of wood datasets. Our method is applied to established architectures like Visual Geometry Group (VGG) and Residual Network (ResNet). The results demonstrate significant improvements. The model reduced overfitting while maintaining, or even improving, the accuracy of the network’s predictions on classification tasks. This validates the effectiveness of our approach in enhancing the performance and generalization capabilities of deep learning models.

We consider two possible computational methods of the interpretation of experimental data obtained by means of the magnetic force microscopy. These methods of macrospin distribution simulation and reconstruction can be used for research of magnetization reversal processes of nanodots in ordered 2D arrays of nanodots. New approaches to the development of high-performance superscale algorithms for parallel executing on a supercomputer clusters for solving direct and inverse task of the modeling of magnetic states, types of ordering, reversal processes of nanosystems with a collective behavior are proposed. The simulation results are consistent with experimental results.

This paper presents a model mixture of probability distributions of signal and noise. Typically, when analyzing the data under conditions of uncertainty it is necessary to use nonparametric tests. However, such an analysis of nonstationary data in the presence of uncertainty on the mean of the distribution and its parameters may be ineffective. The model involves the implementation of a case of a priori non-parametric uncertainty in the processing of the signal at a time when the separation of signal and noise are related to different general population, is feasible.

The Compact Muon Solenoid (CMS) is a high-performance general-purpose detector at the Large Hadron Collider (LHC) at CERN. A distributed data analysis system for processing and further analysis of CMS experimental data has been developed and this model foresees the obligatory usage of modern grid-technologies. The CMS Computing Model makes use of the hierarchy of computing centers (Tiers). The Joint Institute for Nuclear Research (JINR) takes an active part in the CMS experiment. In order to provide a proper computing infrastructure for the CMS experiment at JINR and for Russian institutes collaborating in CMS, Tier-1 center for the CMS experiment is constructing at JINR. The main tasks and services of the CMS Tier-1 at JINR are described. The status and perspectives of the Tier1 center for the CMS experiment at JINR are presented.

An approach to numerical analysis of thermo-hydraulic processes proceeding in a fast-neutron reactor is described in the given article. The description covers physical models, numerical schemes and geometry simplifications accepted in the computational model. Steady-state and dynamic regimes of reactor operation are considered. The steady-state regimes simulate the reactor operation at nominal power. The dynamic regimes simulate the shutdown reactor cooling by means of the heat-removal system.

Simulation of thermo-hydraulic processes is carried out in the FlowVision CFD software. A mathematical model describing the coolant flow in the first loop of the fast-neutron reactor was developed on the basis of the available geometrical model. The flow of the working fluid in the reactor simulator is calculated under the assumption that the fluid density does not depend on pressure, with use a $k–\varepsilon$ turbulence model, with use of a model of dispersed medium, and with account of conjugate heat exchange. The model of dispersed medium implemented in the FlowVision software allowed taking into account heat exchange between the heat-exchanger lops. Due to geometric complexity of the core region, the zones occupied by the two heat exchangers were modeled by hydraulic resistances and heat sources.

Numerical simulation of the coolant flow in the FlowVision software enabled obtaining the distributions of temperature, velocity and pressure in the entire computational domain. Using the model of dispersed medium allowed calculation of the temperature distributions in the second loops of the heat exchangers. Besides that, the variation of the coolant temperature along the two thermal probes is determined. The probes were located in the cool and hot chambers of the fast-neutron reactor simulator. Comparative analysis of the numerical and experimental data has shown that the developed mathematical model is correct and, therefore, it can be used for simulation of thermo-hydraulic processes proceeding in fast-neutron reactors with sodium coolant.

The conjugate problem of disk movement into gas-filled volume of the spring-type safety valve is solved. The questions of determining the physically correct value of the disk initial lift are considered. The review of existing approaches and methods for solving of such type problems is conducted. The formulation of the problem about the valve actuation when the vessel pressure rises and the mathematical model of the actuation processes are given. A special attention to the binding of physical subtasks is paid. Used methods, numerical schemes and algorithms are described. The mathematical modeling is performed on basе the fundamental system of differential equations for viscous gas movement with the equation for displacement of disk valve. The solution of this problem in the axe symmetric statement is carried out numerically using the finite volume method. The results obtained by the viscous and inviscid models are compared. In an inviscid formulation this problem is solved using the Godunov scheme, and in a viscous formulation is solved using the Kurganov – Tadmor method. The dependence of the disk displacement on time was obtained and compared with the experimental data. The pressure distribution on the disk surface, velocity profiles in the cross sections of the gap for different disk heights are given. It is shown that a value of initial drive lift it does not affect on the gas flow and valve movement part dynamic. It can significantly reduce the calculation time of the full cycle of valve work. Immediate isotahs for various elevations of the disk are presented. The comparison of jet flow over critical section is given. The data carried out by two numerical experiments are well correlated with each other. So, the inviscid model can be applied to the numerical modeling of the safety valve dynamic.