Almost simple {SM}_m -groups are considered. A group G is called {SM}_m -group if the
tensor square of any irreducible representation is decomposed into the sum of all characters
with multiplicities not greater than m. It turned out that if G is an almost simple
{SM}_2 -group, then G congruence {PGL}_2(q).

In the article an approach to constructing in terms of Petri nets a function model as a
program model unit is considered. This approach makes it possible to present a program
control flow model in a whole as a composition of constituent control flow models of each
function. In the article constructions of function call and function body are introduced
on the base of Petri net object, and then an operation of directed composition of Petri
net object is defined that represents a control flow transfer between caller and called
functions.

The problem of algorithm for organization of the object queries execution [1] for a new
object DBMS technology DIM [2] is considered such that the computational complexity
of the queries execution is as little as possible. Solutions of this problem may be taken
as a basis for the development of a query compiler.

We prove and discuss some propositions for geometric characteristics of an n-dimensional
simplex. Also we note the connection with linear interpolation on the cube [0; 1]^n.

In the article we describe principles of pulse implementation of multilayer neural
networks using biologically plausible neurons. It is shown that the multilayer perceptron can
be modeled with a neural network composed of pulse neurons using impulse information
coding.

The problem of the decomposition of a train into its cars is considered in this paper.
This problem arises while making automatic systems of train registration. The input
data is a film that visualizes the train motion. An algorithm for solving the problem is
proposed. An experiment is conducted using 16 different films to test the algorithm.

We continue our study of multiagent algorithms for a problem that we call the Mars
Robot Puzzle. This problem could be considered as a special case of a graph-theoretic
problem (Discrete Mathematics), as a combinatorial geometry problem (Computer
Science), or as a very special case of a path-planning problem (Artificial Intelligence). Our
algorithms grew up from a local search (heuristic) solution of the problem suggested by
E.W. Dijkstra. In the paper we present a series of new multiagent algorithms solving the
problem, prove (manually) their correctness, model check some of these algorithms, and
discuss further research topics. All our algorithms are multiagent in contrast to
"centralized" graph and combinatorial algoritms; correctness of our algorithms is formally
proven, while the testing is used for validation of path-planning algorithms.

The article discusses an ARTCP header structure and some practical aspects of forming
the header and the calculation of header fields. The questions of precise time
dispatching of the received packets are discussed. The Linux kernel interfaces for time
measurement are described as well as the clock source abstraction layer and its implementation.