Software & Systems

Articles of journal № 4 at 2011 year.

Order result by: Public date | Title | Authors

31. Error handling relational databases [№4 за 2011 год]
Author: Лихачёв В.Н.
Visitors: 9971
The article considers the opportunities of forming the informative messages for errors of relational databases. The work is based on the analysis of databases structure. The questions considered in the article can be applied to different relational databases.

32. Optimization of placing of trajectory measurements means by genetic algorithms [№4 за 2011 год]
Author: Ковалев А.А.
Visitors: 11974
The approach to optimum placing of trajectory measurements means with application of genetic algorithms is described. The offered approach is illustrated by means of results of mathematical modeling.

33. Integrated circuits elements optimization for single-event prevention [№4 за 2011 год]
Author: Шунков В.Е.
Visitors: 11932
Schematic optimization-based methods for single event mitigation are presented. Efficiency of proposed methods for important applications is proven by modeling and experimental results.

34. Approach to automatic construction of hydrodynamic models [№4 за 2011 год]
Author: Доровский С.В.
Visitors: 17335
Approach to hydrodynamic models automatic construction is suggested. The approach is developed for hydrodynamic models construction support expert system. Aim of the approach is construction of mathematical model of arbitrary hydrodynamic system in form of differential equations system. Construction of hydrodynamic system qualitative model and qualitative model ontology are described.

35. Representation of graphs and undirected hypergraphs with constraints in a relational database [№4 за 2011 год]
Authors: Мокрозуб В.Г., Немтинов В.А., Лагутин Д.А.
Visitors: 45780
Describes a method of formal mathematical descriptions of graphs and hypergraphs with constraints in the form suitable for submission to the relational database, wherein the description in the graph is being restricted, represented in terms of set theory. Described the structure of a relational database, which allows to describe graphs and undirected hypergraphs with restrictions. Implementation of the restrictions provided referential and domain integrity of the database.

36. Application of multispectral segmentation for the green vegetation status analysis based on video [№4 за 2011 год]
Authors: Zotin A.G., Золотарева Е.Ю.
Visitors: 10634
In the article the question of applying a multispectral segmentation for the analysis of the plants images is discussed. We propose a method of performing a multispectral segmentation based on modified threshold segmentation, using several color models. The ways of performance improvement of the system, which uses the proposed methods and algorithms, are described. The results of the experiments are presented.

37. Application of small digit capacity numbers in binary optimization problem [№4 за 2011 год]
Authors: Крыжановский М.В., Malsagov M.Yu.
Visitors: 8826
The problem of neural network minimization of quadratic functional in binary space is considered in this paper. To solve problem modified minimization algorithm is proposed and researched, based on discretization procedure. It is shown, that it applying decrease calculation volume.

38. Validation of routing scheme in RapidiO system [№4 за 2011 год]
Author: Бакулин А.А.
Visitors: 12773
An algorithm is proposed for validating feasibility of a routing scheme in specified RapidIO system. Algorithm execution time linearly depends on the number of routes in the scheme.

39. Program for automatic creation and validation of source materials for design documentation [№4 за 2011 год]
Author: Подковыров А.А.
Visitors: 12328
The developed program allows for a few minutes to perform most operations that can not be automated using CAD, and thereby substantially reduce errors and time to generate documentation for the production of printed circuit board. Generator specification provides all necessary editing features specifications and test the relevance of the components used.

40. Programming problems on graphs of bounded treewidth [№4 за 2011 год]
Author: Bykova V.V.
Visitors: 11198
We present the modern approach to development of efficient algorithms for solving optimization problems on graphs of bounded treewidth. This approach is based on dynamic programming using a tree decomposition of the graph. According to this approach we propose an exact algorithm for solving the VERTEX COVER problem. We apply the transformation of the tree decomposition which reduces the size of dynamic programming tables. In describing the algorithm, we use the language of relational algebra. Algorithm execution time depends linearly on the number of vertices and depends exponentially on the treewidth the original graph.

◄ ← Preview | 1 | 2 | 3 | 4 | 5 | 6 | Next → ►