## Cellular automata simulation on surface triangulation for diffusion processes

This paper concerns the development of techniques for the cellular automata simulation on triangulation grids on at and curved surfaces. The possibility of the proposed techniques are shown on examples of the cellular automata simulation of diffusion, front propagation and diffusion-limited aggregation.

## Parallel simulation of asynchronous cellular automata on different computer architectures

An overview and experimental comparative study of parallel algorithms
of asynchronous cellular automata simulation are presented. The algorithms are
tested for physicochemical process model of the surface reaction *CO + O2* over the
supported Pd nanoparticles on different parallel computers. For the testing, we
use shared memory computers, distributed...

## Using kinetic cellular automata for modeling CO oxidation over Pd110 surface

For simulating CO catalytic oxidation on platinum-group metals, kinetic asynchronous cellular automata (CA) (asynchronous CA with probabilistic transition rules) are used being sometimes referred to as Monte Carlo methods. In this paper, the influence of the rate coefficients values of oxygen adsorption and carbon monoxide absorbtion on the reaction rate...

## Automata noise in diffusion cellular-automata models

Two new cellular-automata models of the diffusion process are pro- posed. They are based on integer states of cells instead of Boolean ones in the known models: asynchronous naive diffusion by Toffolli and block-synchronous Margolus diffusion. Computing experiments have been carried out with these models; they demonstrate a good correlation...

## Parallel implementation of the Ramalingam incremental algorithm for dynamic updating the shortest-paths subgraph

The paper proposes an efficient implementation of the Ramalingam algorithm for dynamic updating the single-sink shortest-paths subgraph of a directed weighted graph after insertion of an edge using a model of associative (content addressable) parallel systems with vertical processing (the STAR-machine). An associative version of the Ramalingam incremental algorithm is...

## On selection of data structures for use in WinALT simulating system

The importance of a proper selection of data structures can hardly be overestimated. It is crucial for the overall performance in certain problem domains, such as file systems, task and memory managers in operating systems, indexing in the DBMS, dictionaries in compression utilities.

## An ontology-oriented approach to constructing user interfaces for an informational computational system to support innovations

By now, supercomputers have become an efficient tool of mathematical simulation for both scientific and applied large-size problems. This makes it possible to thoroughly analyze such physical processes that otherwise could be too costly or even prohibitively expensive or time consuming to be analyzed in a usual way. This tool...

## A parallel algorithm for solving the traveling salesman problem by a recurrent neural network

A parallel algorithm for solving the traveling salesman problem by the recurrent Wang neural network in conjunction with the WTA (“Winner Takes All”) principle is proposed. This algorithm is preferable when it is necessary to solve the problem with sufficient accuracy in a lesser time.

## An algorithm for evaluating the thermogram heterogeneity based on its quadtree representation

An analysis of a thermal image (thermogram) of a human body surface shows the availability of correlation between the body state and the thermogram heterogeneity (“motley”). A new method for the quantitative analysis of the thermogram heterogeneity based on the thermogram representation by a quadtree of reduced images is proposed....