Abstract: Segmentation plays vital role in speech recognition systems. An automatic segmentation of Tamil speech into syllable has been carried out using Vowel Onset Point (VOP) and Spectral Transition Measure (STM). VOP is a phonetic event used to identify the beginning point of the vowel in speech signals. Spectral Transition Measure is performed to find the significant spectral changes in speech utterances. The performance of the proposed syllable segmentation method is measured corresponding to manual segmentation and compared with the exiting syllable method using VOP and Vowel Offset Point (VOF). The result of the experiments shows the effectiveness of the proposed system. PubDate: 2018-01-01 DOI: 10.3103/S0146411618010042

Abstract: When four wheel side driven EV travals in steering or changes lanes in high speed, the vehicle is easy to side-slip or flick due to the difference of wheel hub motor and a direct effect of vehicle nonlinear factors on vehicle yaw motion, which would affect vehicle handling and stability seriously. To solve this problem, a joint control strategy, combined with the linear programming algorithm and improved sliding mode algorithm, which combines the exponential reaching law and saturation function was proposed. Firstly, the vehicle dynamics model and the reference model according with the structure and driving characteristics of four wheel side driven EV were set up. Then, introduced the basic method of the improved sliding mode variable structure control and complete the sliding mode variable structure controller design basic on vehicle sideslip angle and yaw velocity.The controller accomplish optimal allocation of vehicle braking force through a linear programming algorithm, according to yaw moment produced by the vehicle motion state. Single lane driving simulation results show that the proposed control strategy can not only control vehicle sideslip angle and yaw velocity well, but also accomplish good controlling of the vehicle yaw moment, so as to significantly improve the handling and stability of vehicle. PubDate: 2018-01-01 DOI: 10.3103/S0146411618010091

Abstract: This article considers a problem of possible spontaneous emergence of high level of abstraction programs from the set of independent parallel processes, which are performing different functions and using shared variables. The model proposed in the article is based on the principles of artificial chemistry and describes the distributed computing. As the results of simulations, unstable cyclic computational structures of different kinds spontaneously arose in the model. These structures are considered as implicit programs. PubDate: 2018-01-01 DOI: 10.3103/S0146411618010054

Abstract: One of the key performance measures of cloud computing systems is the response time. However, the mean value of this characteristic does not give the full picture of quality of service. Therefore, we derive the cumulative distribution function (CDF) of the response time in terms of Laplace-Stieltjes transform and use it to evaluate moments of the response time. Moreover, we introduce a simplification of the mathematical model that significantly reduces computing complexity for the response time CDF and provide analysis of approximation accuracy of the simplified model. PubDate: 2018-01-01 DOI: 10.3103/S0146411618010066

Abstract: A fundamentally new approach to building a code with summation of on-data bits based on the selection and separate check of subsets of bits of the data vector is presented. The properties of the proposed code are analyzed in comparison with the classic and modified Berger codes. The advantages and disadvantages of new codes with summation of on-data bits are noted. The basic properties of the proposed codes with summation that should be taken into account in solving problems of technical diagnostics are established. The results of experimental applications of the developed codes to the organization of concurrent error detection systems of combinational benchmarks from LGSynth`89 are given. PubDate: 2018-01-01 DOI: 10.3103/S0146411618010029

Abstract: Solving the dynamic shortest path problem has become important in the development of intelligent transportation systems due to the increasing use of this technology in supplying accurate traffic information. This paper focuses on the problem of finding the dynamic shortest path from a single source to a destination in a given traffic network. The goal of our studies is to develop an algorithm to optimize the journey time for the traveler when traffic conditions are in a state of dynamic change. In this paper, the models of the dynamic traffic network and the dynamic shortest path were investigated. A novel dynamic shortest path algorithm based on hybridizing genetic and ant colony algorithms was developed, and some improvements in the algorithm were made according to the nature of the dynamic traffic network. The performance of the hybrid algorithm was demonstrated through an experiment on a real traffic network. The experimental results proved that the algorithm proposed in this paper could effectively find the optimum path in a dynamic traffic network. This algorithm may be useful for vehicle navigation in intelligent transportation systems. PubDate: 2018-01-01 DOI: 10.3103/S014641161801008X

Abstract: In this paper, the medical CT image blind restoration is translated into two sub problems, namely, image estimation based on dictionary learning and point spread function estimation. A blind restoration algorithm optimized by the alternating direction method of multipliers for medical CT images was proposed. At present, the existing methods of blind image restoration based on dictionary learning have the problem of low efficiency and precision. This paper aims to improve the effectiveness and accuracy of the algorithm and to improve the robustness of the algorithm. The local CT images are selected as training samples, and the K-SVD algorithm is used to construct the dictionary by iterative optimization, which is beneficial to improve the efficiency of the algorithm. Then, the orthogonal matching pursuit algorithm is employed to implement the dictionary update. Dictionary learning is accomplished by sparse representation of medical CT images. The alternating direction method of multipliers (ADMM) is used to solve the objective function and realize the local image restoration, so as to eliminate the influence of point spread function. Secondly, the local restoration image is used to estimate the point spread function, and the convex quadratic optimization method is used to solve the point spread function sub problems. Finally, the optimal estimation of point spread function is obtained by iterative method, and the global sharp image is obtained by the alternating direction method of multipliers. Experimental results show that, compared with the traditional adaptive dictionary restoration algorithm, the new algorithm improves the objective image quality metrics, such as peak signal to noise ratio, structural similarity, and universal image quality index. The new algorithm optimizes the restoration effect, improves the robustness of noise immunity and improves the computing efficiency. PubDate: 2018-01-01 DOI: 10.3103/S0146411618010078

Abstract: This paper proposes a new control law based on linear algebra. This technique allows nonlinear path tracking in multivariable and complex systems. This new methodology consists in finding the control action to make the system follow predefined concentration profiles solving a system of linear equations. The controller parameters are selected with a Monte Carlo algorithm so as to minimize a previously defined cost index. The control scheme is applied to a fed-batch penicillin production process. Different tests are shown to prove the controller effectiveness, such as adding parametric uncertainty, perturbations in the control action and in the initial conditions. Moreover, a comparison with other controllers from the literature is made, showing the better performance of the present approach. PubDate: 2018-01-01 DOI: 10.3103/S0146411618010030

Authors:A. Yu. Chernov; A. S. Konoplev; D. V. Reshetov Pages: 844 - 847 Abstract: The problem of building a trusted computing environment on the basis of modern computing devices has been considered. The main features of software execution at different levels of privilege have been indicated. The architecture of the Intel ME subsystem has been considered. The potential threats of Intel ME technology have been highlighted, and possible ways to eliminate them have been given. PubDate: 2017-12-01 DOI: 10.3103/s0146411617080077 Issue No:Vol. 51, No. 8 (2017)

Authors:D. V. Ivanov; D. A. Moskvin; A. V. Myasnikov; A. F. Suprun Pages: 855 - 859 Abstract: The results of analyzing the mechanisms and channels for replicating user data have been given. The replication mechanisms have been classified. Their advantages and drawbacks have been found. A method has been proposed that uses NFC to establish the secure data replication channel. PubDate: 2017-12-01 DOI: 10.3103/s0146411617080090 Issue No:Vol. 51, No. 8 (2017)

Authors:A. S. Zaytsev; A. A. Malyuk Pages: 860 - 866 Abstract: Classification models based on statistical data have been developed that make it possible to identify a potential insider based on the indicators that manifest in the context of data incompleteness regarding the insider’s behavior. PubDate: 2017-12-01 DOI: 10.3103/s0146411617080259 Issue No:Vol. 51, No. 8 (2017)

Authors:M. O. Kalinin; A. A. Minin Pages: 899 - 901 Abstract: This article reviews the approach to security evaluation of wireless ad-hoc networks (mesh networks, MANET/VANET networks, networks of smart houses, etc.), which is based on the method of principal component analysis. PubDate: 2017-12-01 DOI: 10.3103/s0146411617080119 Issue No:Vol. 51, No. 8 (2017)

Authors:D. V. Ivanov; D. A. Moskvin; T. D. Ovasapyan Pages: 902 - 906 Abstract: Approaches to detecting active network nodes in the IPv6 address space have been considered. Two principal families of approaches have been considered, i.e., with and without the initial sample. PubDate: 2017-12-01 DOI: 10.3103/s0146411617080107 Issue No:Vol. 51, No. 8 (2017)

Authors:I. V. Alekseev; V. V. Platonov Pages: 915 - 920 Abstract: A method has been proposed for identifying malicious programs that use encryption as a disguise. In this paper, a modification of the statistical spectral test based on entropy analysis has been described. PubDate: 2017-12-01 DOI: 10.3103/s0146411617080041 Issue No:Vol. 51, No. 8 (2017)

Authors:E. A. Timofeev Pages: 586 - 591 Abstract: Let Ω = AN be a space of right-sided infinite sequences drawn from a finite alphabet A = {0,1}, N = {1,2,…}. Let ρ(x, y)Σk=1∞ x k − y k 2−k be a metric on Ω = AN, and μ the Bernoulli measure on Ω with probabilities p0, p1 > 0, p0 + p1 = 1. Denote by B(x,ω) an open ball of radius r centered at ω. The main result of this paper \(\mu (B(\omega ,r))r + \sum\nolimits_{n = 0}^\infty {\sum\nolimits_{j = 0}^{{2^n} - 1} {{\mu _{n,j}}} } (\omega )\tau ({2^n}r - j)\) , where τ(x) = 2min {x,1 − x}, 0 ≤ x ≤ 1, (τ(x) = 0, if x < 0 or x > 1 ), \({\mu _{n,j}}(\omega ) = (1 - {p_{{\omega _{n + 1}}}})\prod _{k = 1}^n{p_{{\omega _k}}} \oplus {j_k}\) , \(j = {j_1}{2^{n - 1}} + {j_2}{2^{n - 2}} + ... + {j_n}\) . The family of functions 1, x, τ(2 n r − j), j = 0,1,…, 2 n − 1, n = 0,1,…, is the Faber–Schauder system for the space C([0,1]) of continuous functions on [0, 1]. We also obtain the Faber–Schauder expansion for Lebesgue’s singular function, Cezaro curves, and Koch–Peano curves. Article is published in the author’s wording. PubDate: 2017-12-01 DOI: 10.3103/s014641161707032x Issue No:Vol. 51, No. 7 (2017)

Authors:E. A. Timofeev Pages: 634 - 638 Abstract: Recall that Lebesgue’s singular function L(t) is defined as the unique solution to the equation L(t) = qL(2t) + pL(2t − 1), where p, q > 0, q = 1 − p, p ≠ q. The variables M n = ∫01t n dL(t), n = 0,1,… are called the moments of the function The principal result of this work is \({M_n} = {n^{{{\log }_2}p}}{e^{ - \tau (n)}}(1 + O({n^{ - 0.99}}))\) , where the function τ(x) is periodic in log2x with the period 1 and is given as \(\tau (x) = \frac{1}{2}1np + \Gamma '(1)lo{g_2}p + \frac{1}{{1n2}}\frac{\partial }{{\partial z}}L{i_z}( - \frac{q}{p}){ _{z = 1}} + \frac{1}{{1n2}}\sum\nolimits_{k \ne 0} {\Gamma ({z_k})L{i_{{z_k} + 1}}( - \frac{q}{p})} {x^{ - {z_k}}}\) , \({z_k} = \frac{{2\pi ik}}{{1n2}}\) , k ≠ 0. The proof is based on poissonization and the Mellin transform. PubDate: 2017-12-01 DOI: 10.3103/s0146411617070203 Issue No:Vol. 51, No. 7 (2017)

Authors:A. A. Kashchenko Pages: 639 - 644 Abstract: In this paper, we consider a singularly perturbed system of two differential equations with delay, simulating two coupled oscillators with a nonlinear feedback. The feedback function is assumed to be compactly supported and piecewise-continuous and it is assumed that its sign is constant. In this paper, we prove the existence of relaxation periodic solutions and make conclusions about their stability. Using a special large-parameter method, we construct asymptotics of all solutions of the considered system under the assumption that the initial-value conditions belong to a certain class. Using this asymptotics, we construct a special mapping principally describing the dynamics of the original model. It is shown that the dynamics changes fundamentally as the coupling coefficient decreases: we have a stable homogeneous periodic solution if the coupling coefficient is on the order of unity and the dynamics become more complex as the coupling coefficient decreases (it is described by a special map). For small values of the coupling, we show that there are values of the parameters such that several different stable relaxation periodic regimes coexist in the original problem. PubDate: 2017-12-01 DOI: 10.3103/s0146411617070124 Issue No:Vol. 51, No. 7 (2017)

Authors:Y. A. Belov; S. I. Vovchok Pages: 678 - 681 Abstract: It is planned to create a method of clustering a social network graph. To test the method, it is necessary to generate a graph similar in structure to existing social networks. The article presents an algorithm for the graph-distributed generation. We take into account basic properties such as the power-law distribution of the number of user communities, the dense intersections of social networks, and others. This algorithm also considers the problems that are present in similar works of other authors, for example, the multiple edges problem in the generation process. A special feature of the created algorithm is the implementation depending on the number of communities, rather than on the number of connected users, as is done in other works. This is connected with a peculiarity of the development of the existing social network structure. The properties of its graph are described in the paper. We describe a Table 1 containing the variables needed for the algorithm. A step-by-step generation algorithm is compiled. Appropriate mathematical parameters are calculated for it. The generation is performed in a distributed way by the Apache Spark framework. It is described in detail how the division of tasks with the help of this framework operates. The Erdos–Renyi model for random graphs is used in the algorithm. It is the most suitable and easiest one to implement. The main advantages of the created method are the small amount of resources and faster execution speed in comparison with other similar generators. Speed is achieved through distributed work and the fact that at any time, the network users have their own unique numbers and are ordered by these numbers so that there is no need to sort them out. The designed algorithm will not only promote the creation of an efficient clustering method, but can also be useful in other development areas connected, for example, with social network search engines. PubDate: 2017-12-01 DOI: 10.3103/s0146411617070264 Issue No:Vol. 51, No. 7 (2017)

Authors:E. A. Timofeev Pages: 731 - 735 Abstract: The Takagi function is a simple example of a continuous yet nowhere differentiable function and is given as T(x) = Σk=0∞ 2−n ρ(2 n x), where \(\rho (x) = \mathop {\min }\limits_{k \in \mathbb{Z}} x - k \) . The moments of the Takagi function are given as M n = ∫01x n T(x)dx. The estimate \({M_n} = \frac{{1nn - \Gamma '(1) - 1n\pi }}{{{n^2}1n2}} + \frac{1}{{2{n^2}}} + \frac{2}{{{n^2}1n2}}\phi (n) + O({n^{ - 2.99}})\) , where the function \(\phi (x) = \sum\nolimits_{k \ne 0} \Gamma (\frac{{2\pi ik}}{{1n2}})\zeta (\frac{{2\pi ik}}{{1n2}}){x^{ - \frac{{2\pi ik}}{{1n2}}}}\) is periodic in log2x and Γ(x) and ζ(x) denote the gamma and zeta functions, is the principal result of this work. PubDate: 2017-12-01 DOI: 10.3103/s0146411617070197 Issue No:Vol. 51, No. 7 (2017)

Authors:A. A. Kashchenko Pages: 753 - 756 Abstract: In this paper we consider the nonlocal dynamics of the model of two coupled oscillators with delayed feedback. This model has the form of a system of two differential equations with delay. The feedback function is non-linear, compactly supported and smooth. The main assumption in the problem is that the coupling between the generators is sufficiently small. With the help of asymptotic methods we investigate the existence of relaxation periodic solutions of a given system. For this purpose, a special set is constructed in the phase space of the original system. Then we build an asymptotics of the solutions of the given system with initial conditions from this set. Using this asymptotics, a special mapping is constructed. Dynamics of this map describes the dynamics of the original problem in general. It is proved that all solutions of this mapping are non-rough cycles of period two. As a result, we formulate conditions for the coupling parameter such that the initial system has a two-parameter family of non-rough inhomogeneous relaxation periodic asymptotic (with respect to the residual) solutions. PubDate: 2017-12-01 DOI: 10.3103/s0146411617070343 Issue No:Vol. 51, No. 7 (2017)