ISSN 0236-235X (P)
ISSN 2311-2735 (E)

Journal influence

Higher Attestation Commission (VAK) - К1 quartile
Russian Science Citation Index (RSCI)

Bookmark

Next issue

2
Publication date:
16 June 2024

Journal articles №1 2016

11. Application features of object-oriented design for hard real time embedded systems [№1 за 2016 год]
Authors: Arzhaev V.I. (arzhaeVI@cps.tver.ru) - R&D Institute Centerprogramsystem (Branch Manager), Ph.D; Skvortsov А.V. (skvortsovAV@cps.tver.ru) - R&D Institute Centerprogramsystem (Head of Department), Ph.D;
Abstract: The article considers the problems of object-oriented software development of embedded real-time systems. It also discusses the problems that require implementation using programming languages and hardware description languages. A particular feature of processing elements of heterogeneous computing platforms is a significant volume of main and external memory, as well as flexibility of implemented control algorithms and data formats. At the same time, kernel elements implemented in hardware description languages provide greater speed. The paper suggests the principles of a functional software decomposition for the purposes of implementation on a hetero-geneous computing platform. They bring together objects with similar requirements for events response time in subsystems. The events are relevant to an element of a hardware platform. The paper describes an example of their application, which includes an element design process of a real-time technological process control system that have limitations in two time scales. The paper describes the subsystem operating in a millisecond cycle. It is implemented as the software component for a Linux-based RTOS environment. There also is a microsecond cycle subsystem implemented in FPGA. The paper presents a decomposition diagram and a diagram of conditions, as well as a timing chart describing the basic resource loading equipment. In addition, the paper defines the time limit for the software subsystem. As a result, practical application of the described RTES decomposition principles shown that this approach allows a reasonable distribution of loads on a hardware platform and enforces restrictions in hardware and software parts of the system imposed by the requirement of a hard real-time operation mode.
Keywords: dcs, distributed control system, uml, unified modeling language, software design and programming, distributed real-time embedded systems
Visitors: 5744

12. Adaptive landmark selection in shortest-paths problem for a big graph [№1 за 2016 год]
Authors: Bykova V.V. (bykvalen@mail.ru) - Siberian Federal University (Professor), Ph.D; Soldatenko A.A. (glinckon@gmail.com) - Siberian Federal University;
Abstract: The shortest path (SP) problem is one of the main problems in routing in the theory of graphs. This problem arises in a web-structure analysis when creating navigation systems, traffic modeling and logistics optimization. The problem requires a search of the shortest path between two given vertices of the initial directed graph G and minimization of the sum of edges weight forming this way. Traditionally the SP problem is solved using Dijkstra's algorithm. The algorithm works assigning marks to vertices of graph G and uniformly expands the search space of solutions, starting from the start vertex s to the target vertex t of the graph. There are a lot of modifications of Dijkstra’s algorithm aimed to reduce working time. A* (A star) algorithm is one of these modifications, in which acceleration is achieved using a potential function defined on the set of G graph vertices. The ALT (A* with Landmark & Triangle) algorithm is based on A* algorithm. Here a potential function is defined by a set of landmarks (a certain subset of G graph vertices). Different landmark selections in G correspond to different potential functions. Selection of the optimal set of landmarks is carried in a finite set of variants and is a NP-hard problem. The ALT algorithm is represented in the form of two phases: the first phase contains execution of preliminary graph processing to select landmarks and calculate a potential function; the second phase computes the shortest (s, t)-path using a potential function. The paper suggests an adaptive heuristic for landmark selection. This heuristic uses exexecution history of last queries to search the shortest paths in G graph and corrects the current set of landmarks for effective execution of a newly received query to search the shortest (s, t)-path in a current graph. In the proposed modification the ALT algorithm and Dijkstra’s algorithm are equivalent in terms of asymptotic estimate of their performance. However, in real life the modified ALT algorithm applied to a big graph is much faster than Dijkstra’s algorithm. This is confirmed by presented in this work computation results.
Keywords: big graph, heuristics, landmarks, alt algorithm, dijkstra's algorithm, accelerate method, shortest path problem
Visitors: 8564

13. Knoware of an adaptive knowledge testing system [№1 за 2016 год]
Authors: Bessarabov N.A. (nikitabes@mail.ru) - Moscow Institute of Physics and Technology; Bondarenko A.V. (bond@fgosniias.ru) - Moscow Institute of Physics and Technology (Professor), Ph.D; Kondratenko T.N. (tanya@fgosniias.ru) - State Research Institute of Automatic Systems (Head of Laboratory); Timofeev D.S. (timofeev@fgosniias.ru) - State Research Institute of Automatic Systems (Head of Sector);
Abstract: The article considers the problem of realizing knoware for an adaptive knowledge testing system. The process of testing knowledge is represented as a dynamic one. An organizer forms a homogeneous group of examinees at each cycle of the system. The system selects the best test at each step based on a convergent procedure of stochastic approximation. The best test depends on probabilistic characteristics of examinees contingent and allows increasing estimation accuracy of person parameters. To identify factors that prevent obtaining objective evaluation, such as conversations and copying, the authors introduce an interaction rate. The article analyzes the influense of examinees’ interaction on the accuracy of test marks. To improve the estimation accuracy of person parameters the system overestimates probabilistic characteristics of a group of examinees at each cycle. Person and item parameters are aligned on a common scale at each cycle. The system implements evaluating item parameters using the maximum likelihood method, the conditional maximum likelihood method and the marginal maximum likelihood method. The maximum likelihood method, the weighted likelihood method and the Bayesian approach can be used for evaluating person parameters. The system evaluates a 1-parameter dichotomous Rasch model and 2-parameter, 3-parameter, 4-parameter dichotomous extensions, RSM and PCM polytomous models and appropriate linearized models. To evaluate matching between observed data and the expected values the authors use a statistics of the likelihood test, statistics of the Hosmer-Lemeshow test, coefficients of determination, ROC-analysis. The article contains a flow chart of the algorithm for each cycle and a database schematic diagram.
Keywords: algorithm of work, Rush's model, logit, tests design, stochastic approximation, test results accuracy, distribution of test’s easiness, algorithmic support, adaptive system, database, mathematical theory test
Visitors: 8650

14. Review of studies on time series forecasting based on hybrid methods, neural networks and multiple regression [№1 за 2016 год]
Authors: Yarushev S.A. (sergey.yarushev@icloud.com) - Dubna International University for Nature, Society and Man; A.N. Averkin (averkin2003@inbox.ru) - Dorodnicyn Computing Centre, RAS, Ph.D;
Abstract: The article gives a detailed overview of the studies in time series forecasting. It also considers the history of forecasting methods development. The author gives a review of the latest valid forecasting methods, such as statistical, connectionist and hybrid, forecasting methods that are based on multiple regression, their basic parameters, application area and performance. The paper considers recent research in the field of hybrid forecasting methods application, gives a short overview of these methods and notes their efficiency according to the authors. The author emphasizes the study of using BigData in forecasting. He suggests a forecasting model based on BigData technology using a hybrid of soft computing and artificial neural networks, he tests it on a stock market. The article considers a model based on neural networks, wavelet analysis and bootstrap method. The method is developed for flows forecasting to manage water resources successfully. The paper shows a detailed comparative study of methods based on neural networks and multiple regression. It considers different studies with a description of comparison methods and results. It also shows a comparison of these methods on the example of predicting housing market; there is a detailed analysis of both methods using different samples. At the end the author gives the results of the study and compares forecasting results.
Keywords: , , , neural networks, , , forecasting,
Visitors: 7081

15. An information system of technological machines operation analysis [№1 за 2016 год]
Authors: Bolotov A.N. (alnikbltov@rambler.ru) - Tver State Technical University (Professor), Ph.D; Gorlov I.V. (gorloviv@yandex.ru) - Tver State Technical University (Associate Professor), Ph.D; Poletaeva E.V. (epolet2010@mail.ru) - Tver State Technical University (Associate Professor), Ph.D; Rakhutin M.G. (mtm98@yandex.ru) - National University of Scince and Technology "MISiS", Mining Institute (Professor), Ph.D;
Abstract: The paper suggests a new approach to a technological machines operation analysis using information technologies. A relevant direction of improving the efficiency of using peat machines (TM) is creation of a state control system depending on specific operating conditions. TM maximum seasonal performance is achieved based on the analysis of technological objects’ models and parametric optimization of the components that are responsible for performance. The automated system of processing machines’ operation analysis was implemented in three stages. To obtain necessary statistical data to fill the model the first step included studying the parameters of technological machines operation for milling mining on the basis of JSC “Vasilevsky moss”. The authors developed an algorithm to determine key operating parameters of a functionality restore system. The algorithm provides the highest efficiency of machines in the peat extraction season. The second phase included development of a peat machines operation simulation model. It consists of series-connected elements, their failure leads to system failure. The problem of peat machines operation analysis was solved on the example of an integrated unit that included all the basic elements of peat milling machines for mining. The third stage of research included a computer experiment. The analysis of its results provides the most informed decisions on affecting the technical condition of technological machines under specific conditions with maximum efficiency. The objective component of a maintenance process is ensured by collecting and processing information about the technical condition of the object of diagnosis based on the identification of shortcomings of units and parts that limit the time to repair.
Keywords: diagnostics, repair, rejuvenation, information technologies, algorithm
Visitors: 8317

16. An optimization algorithm to find inscribed polyhedron of maximum volume [№1 за 2016 год]
Author: Kokorev D.S. (korvin-d@yandex.ru) - Institute for Information Transmission Problems of the Russian Academy of Sciences;
Abstract: The article discusses the problem of finding the polyhedrons with given shape inside other polyhedrons. This problem is a particular case of the third part of the 18th Hilbert problem. It can be applied in computer simulation of three-dimensional objects, the autonomous robots moving and the jewelry industry. The article offers several alternative methods of finding inscribed polyhedrons based on the reduction of the problem to a nonlinear programming problem and solving it using ready-made software resources. The basic idea is that the problem is easily described in terms of non-linear programming. Internal polyhedron volume is an objective function. Restrictions include saving a combinatorial structure, a polyhedron being inside another one, convexity and additional constraints that are necessary for practical purposes. This article describes two different ways to specify a nonlinear programming problem. In addition, it describes free software resources to solve this problem. To make work with non-linear programming solvers easier, only the third order polynomials can be used as the functions. The proposed possible approximations for the main types of restrictions allow to convert all the necessary restrictions to the third-order polynomials. Finally, the article describes a distributed testing system and the algorithm effectiveness. The testing system was developed in Python and is used to test and develop the algorithm. It allows aggregating data across multiple runs of the algorithm in a user-friendly format and comparing results of different versions of the algorithm.
Keywords: solver, nonlinear programming problems, inscribed polyhedron, combinatorial structure, convex polyhedrons
Visitors: 4356

17. Modeling of social and economic processes for subject of administration [№1 за 2016 год]
Authors: Piskunov A.A. (a-a-piskunov@yandex.ru) - Office of the Plenipotentiary of the Russian Federation President in the Central Federal District (Plenipotentiary assistant of the Russian Federation President in the Central Federal District), Ph.D; Suvorov A.V. (avsuvorov@list.ru) - Financial University under the Government of the Russian Federation (Professor), Ph.D;
Abstract: The paper describes a semantic topology of a concept structure for social and economic processes (SEP) in the Russian Federation. It is based on a formal model called a Special Form Dynamic Hypergraph. To describe SEP the authors define the notions of a sanction, an operation, a transaction. These terms are applied to design a SOT space (sanction, operation, transaction). In this SOT space the authors design calendar structure and calendar-technology structure within the model of Special Form Dynamic Hypergraph to describe some processes of elements modification and SEP structures.
Keywords: dynamic hypergraph, social and economic process, budget process
Visitors: 4303

18. Comatch. A search engine for transcription factors cooperative binding sites [№1 за 2016 год]
Authors: Nikitin S.I. (sergey_post@inbox.ru) - A.P. Ershov Institute of Informatics Systems (IIS), Siberian Branch of the Russian Federationn Academy of Sciences, Novel Computing Systems in Biology; Cheremushkin E.S. (evgeny.cheryomushkin@gmail.com) - A.P. Ershov Institute of Informatics Systems (IIS), Siberian Branch of the Russian Federationn Academy of Sciences, Novel Computing Systems in Biology (Research Associate), Ph.D;
Abstract: Recognition of short sequences called transcription factor binding sites is one of the most important problems in bioinformatics. Transcription factor binding sites are short sequences located in DNA regulatory areas and play a key role in transcription process, which is a basic element of every living organism. About 100 algorithms are developed to solve this problem and a number of algorithms is still growing. However, there is no universal algorithm due to many factors that influence binding. For example, in complex living organisms transcription factors are joining into complexes during binding to DNA. Here we present a novel algorithm, which predicts statistically overrepresented transcription factors binding sites pairs. In this case the first site in a pair belongs to initially known fixed transcription factor and another factor should be found. The method uses two kinds of input data: an experimental sequence set and a background sequence set. It searches for significant difference between sites in experimental and background sets. As a result, a user obtains the list of binding sites pairs with P-values, which characterizes the probability to get a pair accidentally, and FDR (False Discovery Rate) is calculated for every pair. In addition, the authors developed a P-value cor-rection option for datasets overrepresented by the anchor matrix binding sites. In this case, dependence between P-value and the selected anchor matrix is made invisible. As a result, the significance of obtained results increases.
Keywords: binding sites pairs, algorithm, р-value, positional weight matrix, rna, DNA, transcription factors, binding sites
Visitors: 8923

19. Logical analysis of corrective operations to construct high-quality recognition algorithm [№1 за 2016 год]
Authors: Lyutikova L.A. (lylarisa@yandex.ru) - Institute of Applied Mathematics and Automation (Head of Department), Ph.D; Shmatova E.V. (lenavsh@yandex.ru) - Institute of Applied Mathematics and Automation (Junior Researcher);
Abstract: The article carries out a logical analysis on study domain, which includes the object and its characteristics described it in terms of running value logic. A research subject is methods and algorithms aimed to find practical solution to the problems of pattern recognition in weakly formalized areas or expertise. These areas include medical, technical, geological reconnaissance diagnostics, forecasting, expert systems construction. While solving such problems, a large number of incorrect (heuristic) algorithms were introduced. The authors examine the such aspects as: the importance of developing the theory of error-correcting operations, the synthesis of minimal complexity correct algorithms using mathematical logic. The most important problems in this field are the problems of logical regularity productive search in objects characteristic descriptions (when the objects are considered as elementary classifiers). The final rule uses a conjunction procedure for each of constructed elementary classifiers. As a general rule, recognition algorithm correctness (the ability to classify training objects correctly) is provided by correctness of each generated elementary classifiers. This is the basis of recognition procedures logical synthesis. However, to use the structures of a logic-algebraic approach in building correct recognition algorithms based on arbitrary sets of recognition algorithms including incorrect ones is of great interest. This paper considers the logical method of constructing algorithms, which includes sequential addition of a small part of unrecognized information. This method ensures correction of a previously constructed algorithm with insignificant changes of its characteristics. In many cases such inductive methods allow building highly accurate and correct algorithms that expand the area of the obtained solutions for substantially less time.
Keywords: subject domain, knowledge base, learning sample, algorithms, decision rule, clauses, logic of varied values
Visitors: 8013

20. Using Global-EAM and “2P-Kadry” to manage productive capacity of the enterprise [№1 за 2016 год]
Authors: Razinkov P.I. (men_756@mail.ru) - Tver State Technical University (Professor, Head of Chair), Ph.D; Razinkova O.P. (men_756@mail.ru) - Tver State Technical University (Associate Professor), Ph.D;
Abstract: The article considers the issues of software application to improve the productive capacity management in an enterprise. Improving the efficiency of using productive capacity of an enterprise is one of the most important factors of production crisis prevention. Development of production crisis depends on generatation and efficiency of using fixed assets, labour and other resources. The effectiveness of generatation and use of capacity, workforce and fixed assets is affected by external and internal factors. Their number and impact increases. Thus, it is not only necessary to consider the impact of external and internal environmental factors, but to model these processes. It will identify characteristics of the structural components of fixed assets, labor and other elements of the productive capacity of an enterprise. Modeling will allow more detailed analyzing element properties and predicting their possible behavior in different situations, under external and internal environmental factors. To solve these problems the authors prove the need to use Global-EAM and “2P-Kadry”. They can significantly increase the efficiency of using productive capacity of an enterprise.
Keywords: management model of assets generation and use, efficiency assessment of development and use of productive capacity, management information system, productive capacity management
Visitors: 7197

← Preview | 1 | 2 | 3 | 4 | Next →