Offline character recognition in transport logistic tables

The paper proposes the improved skeleton method of handwritten characters recognition, which is based on the filtering procedure and the principle of alternating shading schemes of skeletonized area on the 4- and 8-timeslinked raster. The procedure of high-frequency filtration based on discrete real cosine transformation or discrete complex Fourier transform with automatic selection of filtration parameters makes it possible to significantly improve the image quality of handwritten symbols, in particular, to eliminate in many cases thin bridges between the areas of symbol element representation. The principle of alternating the painting schemes along the 4- and 8-timeslinked raster makes it possible to get the wave front of the skeletonized area close to a circle. In this case, the broken lines representing the branches of the skeleton graphs retain the shapes of the symbols. Numerical experiments on the construction of skeleton sets and skeleton graphs for recognizable handwritten symbols located in the cells of the tables of logistic transport problems have been performed. Software implementation of the method is proposed.

The curl–curl conforming virtual element method for the quad-curl problem

In this paper, we present the [Formula: see text]-conforming virtual element (VE) method for the quad-curl problem in two dimensions. Based on the idea of de Rham complex, we first construct three families of [Formula: see text]-conforming VEs, of which the simplest one has only one degree of freedom associated to each vertex and each edge in the lowest-order case, respectively. An exact discrete complex is established between the [Formula: see text]-conforming and [Formula: see text]-conforming VEs. We rigorously prove the interpolation error estimates, the stability of discrete bilinear forms, the coercivity and inf–sup condition of the corresponding discrete formulation. We show that the conforming VEs have the optimal convergence. Some numerical examples are given to confirm the theoretical results.

Devising methods to synthesize discrete complex signals with required properties for application in modern information and communication systems

Information and communication systems (ICSs) must comply with increasingly stringent requirements to ensure the reliability and speed of information transmission, noise immunity, information security. This paper reports the methods to synthesize discrete complex cryptographic signals, underlying the construction of which are random (pseudo-random) processes; the methods for synthesizing characteristic discrete complex signals whose construction is based on using the nature of the multiplicative group of a finite field; the results of studying the properties of the specified signal systems. It is shown that the methods built provide a higher synthesis performance than known methods and make it possible to algorithmize the synthesis processes for the construction of software and hardware devices to form such signals. The win in the time when synthesizing nonlinear signals in finite fields using the devised method is, compared to the known method, for the period of 9,972 elements is 1,039.6 times. The proposed method for synthesizing the entire system of such signals, based on decimation operation, outperforms the known method of difference sets in performance. Thus, for a signal period of 2,380 elements, the win in time exceeds 28 times. It has also been shown that the application of such systems of complex signals could improve the efficiency indicators of modern ICSs. Thus, the imitation resistance of the system, when using complex discrete cryptographic signals with a signal period of 1,023 elements, is four orders of magnitude higher than when applying the linear signal classes (for example, M-sequences). For a signal period of 1,023 elements, the win (in terms of structural secrecy) when using the signal systems reported in this work exceeds 300 times at a period of 8,192, compared to the signals of the linear form (M-sequences)

Research on Fast Algorithm of Radio Wave Propagation in Low-Lossy Obstacles Environment

To predict the propagation of radio waves in the environment of dielectric ground and dielectric obstacles, a new two-way parabolic equation (2W-PE) method based on the domain decomposition principle and surface impedance boundary conditions (SIBC) is proposed. First, we decompose the obstacle area into different subdomains and derive the SIBC in each subdomain in detail; then, the discrete hybrid Fourier transform (DMFT) in the upper subdomain and finite difference (FD) algorithm in the lower subdomain is used to solve 2W-PE combined with SIBC, respectively. After that, we explain the algorithm steps in the process of calculating the total field, compared with the traditional 2W-PE, and then finally introduce the method of moments (MoM) combined with the enhanced discrete complex image (E-DCIM) method for accuracy verification of the new 2W-PE algorithm. The simulation results show that no matter how the obstacle medium parameters change, the results of 2W-PE method proposed in this paper and MoM are always in good agreement, which proves the accuracy of 2W-PE and its superiority in speed. Therefore, this paper provides a reliable and efficient method for solving the problem of radio wave propagation in the presence of obstacles, especially in the case of low-lossy obstacles.