Vol 12, No 2 (2018)

Some method is developed for calculating the optimal resource consumption control with interval restrictions on the components of the control vector. The approach is based on the sequential adjustment of the values of a quasioptimal control actions up to their limit values. The connection is found between the deviations of the initial conditions of the adjoint system and the deviations of the values of the quasioptimal control from the limit values. The rule for specifying the initial approximation is given, and the specific features of the rule are noted. An iterative algorithm is developed, and an example is given.

We study the identification methods for the nonlinear dynamical systems described by Volterra series. One of the main problems in the dynamical system simulation is the problem of the choice of the parameters allowing the realization of a desired behavior of the system. If the structure of the model is identified in advance, then the solution to this problem closely resembles the identification problem of the system parameters. We also investigate the parameter identification of continuous and discrete nonlinear dynamical systems. The identification methods in the continuous case are based on application of the generalized Borel Theorem in combination with integral transformations. To investigate discrete systems, we use a discrete analog of the generalized Borel Theorem in conjunction with discrete transformations. Using model examples, we illustrate the application of the developed methods for simulation of systems with specified characteristics.

The notion of local primitivity for a quadratic 0, 1-matrix of size n × n is extended to any part of the matrix which need not be a rectangular submatrix. A similar generalization is carried out for any set B of pairs of initial and final vertices of the paths in an n-vertex digraph, B ⊆ {(i, j) : 1 ≤ i, j ≤ n}. We establish the relationship between the local B-exponent of a matrix (digraph) and its characteristics such as the cyclic depth and period, the number of nonprimitive matrices, and the number of nonidempotentmatrices in the multiplicative semigroup of all quadratic 0, 1-matrices of order n, etc. We obtain a criterion of B-primitivity and an upper bound for the B-exponent. We also introduce some new metric characteristics for a locally primitive digraph Γ: the k, r-exporadius, the k, r-expocenter, where 1 ≤ k, r ≤ n, and the matex which is defined as the matrix of order n of all local exponents in the digraph Γ. An example of computation of the matex is given for the n-vertex Wielandt digraph. Using the introduced characteristics, we propose an idea for algorithmically constructing realizable s-boxes (elements of round functions of block ciphers) with a relatively wide range of sizes.

We present a 0.5-approximation algorithm for the Multiple Knapsack Problem (MKP). The algorithm uses the ordering of knapsacks according to the nondecreasing of size and the two orderings of items: in nonincreasing utility order and in nonincreasing order of the utility/size ratio. These orderings create two lexicographic orderings on A × B (here A is the set of knapsacks and B is the set of indivisible items). Based on each of these lexicographic orderings, the algorithm creates a feasible solution to the MKP by looking through the pairs (a, b) ∈ A × B in the corresponding order and placing item b into knapsack a if this item is not placed yet and there is enough free space in the knapsack. The algorithm chooses the best of the two obtained solutions. This algorithm is 0.5-approximate and has runtime O(mn) (without sorting), where mand n are the sizes of A and B correspondingly.

We estimate the number of monotone discrete functions related to the divisibility of numbers.

Under study are the equilibrium problems for a two-dimensional viscoelastic body with delaminated thin inclusions in the cases of elastic and rigid inclusions. Both variational and differential formulations of the problems with nonlinear boundary conditions are presented; their unique solvability is substantiated. For the case of a thin elastic inclusion modelled as a Bernoulli–Euler beam, we consider the passage to the limit as the rigidity parameter of the inclusion tends to infinity. In the limit it is the problem about a thin rigid inclusion. Relationship is established between the problems about thin rigid inclusions and the previously considered problems about volume rigid inclusions. The corresponding passage to the limit is justified in the case of inclusions without delamination.

Under study is the equilibrium problem for two plates with possible contact between them. It is assumed that the plates of the same shape and size are located in parallel without a gap. The clamped edge condition is stated on their lateral boundaries. The deflections of the plates satisfy the nonpenetration condition. There is a vertical crack in the lower layer. Along one edge of the crack, the plates are rigidly glued with each other. The three cases are studied in the paper: In the first case, the both layers are elastic, whereas in the second and third cases, the lower or upper layer respectively is rigid. To describe the displacement of the points of elastic plates, the Kirchhoff–Love model is used. Variational and differential formulations of the problems are derived and the unique solvability of the problems is established.

Some methods are proposed for geometric simulation of surfaces of the smooth spiral case and generation of the meshes for numerical simulation of flow.

Given n and d, we describe the structure of trees with the maximal possible number of greatest independent sets in the class of n-vertex trees of vertex degree at most d.We show that the extremal tree is unique for all even n but uniqueness may fail for odd n; moreover, for d = 3 and every odd n ≥ 7, there are exactly ⌈(n − 3)/4⌉ + 1 extremal trees. In the paper, the problem of searching for extremal (n, d)-trees is also considered for the 2-caterpillars; i.e., the trees in which every vertex lies at distance at most 2 from some simple path. Given n and d ∈ {3, 4}, we completely reveal all extremal 2-caterpillars on n vertices each of which has degree at most d.