Refining the Typical Scenarios by Additional Factors
The problems in the quality assessment modeling scenarios collecting information flow on an extensive network of the example of the problem of building and further optimization scenarios to analyze the budget process on an extensive network. Shown use structured approach to the ontology as considere...
Gespeichert in:
| Datum: | 2020 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Інститут кібернетики ім. В.М. Глушкова НАН України
2020
|
| Schriftenreihe: | Математичне та комп'ютерне моделювання. Серія: Технічні науки |
| Online Zugang: | http://dspace.nbuv.gov.ua/handle/123456789/181471 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Zitieren: | Refining the Typical Scenarios by Additional Factors / V.O. Kuzminykh, O.V. Koval, S.I. Otrokh // Математичне та комп'ютерне моделювання. Серія: Технічні науки: зб. наук. пр. — Кам’янець-Подільський: Кам'янець-Подільськ. нац. ун-т, 2019. — Вип. 20. — С. 68-78. — Бібліогр.: 16 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| id |
irk-123456789-181471 |
|---|---|
| record_format |
dspace |
| spelling |
irk-123456789-1814712021-11-19T01:26:12Z Refining the Typical Scenarios by Additional Factors Kuzminykh, V.O. Koval, O.V. Otrokh The problems in the quality assessment modeling scenarios collecting information flow on an extensive network of the example of the problem of building and further optimization scenarios to analyze the budget process on an extensive network. Shown use structured approach to the ontology as considered most appropriate to the task of presenting the structure as a graph. Moved assessment of the effect of the use of partial information previously obtained by constructing scenarios collecting information flow on the network, described the count, with further refinement information. An formalized description of the hierarchical structure of the system. An example of the structure of the interaction of ontology elements for the problem of budget analysis is presented. У роботі розглянуті задачі оцінки якості моделювання сценаріїв збору потокової інформації на розгалуженій мережі на прикладі задачі побудови та подальшої оптимізації сценаріїв для аналізу бюджетного процесу на розгалуженій мережі. Показано використання структурного підходу до розгляду онтології, як найбільш відповідного до розглянутої задачі, з представленням структури у вигляді графу. Переведено оцінку ефекту від використання раніше отриманої часткової інформації по побудові сценаріїв збору потокової інформації на мережі, що описується графом, при подальшому уточненні інформації. Наведено формалізований опис ієрархічної структури системи. Представлено приклад структури взаємодії елементів онтології для задачі бюджетного аналізу. 2020 Article Refining the Typical Scenarios by Additional Factors / V.O. Kuzminykh, O.V. Koval, S.I. Otrokh // Математичне та комп'ютерне моделювання. Серія: Технічні науки: зб. наук. пр. — Кам’янець-Подільський: Кам'янець-Подільськ. нац. ун-т, 2019. — Вип. 20. — С. 68-78. — Бібліогр.: 16 назв. — англ. 2308-5916 DOI: https://doi.org/10.32626/2308-5916.2019-20.68-78 http://dspace.nbuv.gov.ua/handle/123456789/181471 621.391 en Математичне та комп'ютерне моделювання. Серія: Технічні науки Інститут кібернетики ім. В.М. Глушкова НАН України |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| language |
English |
| description |
The problems in the quality assessment modeling scenarios collecting information flow on an extensive network of the example of the problem of building and further optimization scenarios to analyze the budget process on an extensive network. Shown use structured approach to the ontology as considered most appropriate to the task of presenting the structure as a graph. Moved assessment of the effect of the use of partial information previously obtained by constructing scenarios collecting information flow on the network, described the count, with further refinement information. An formalized description of the hierarchical structure of the system. An example of the structure of the interaction of ontology elements for the problem of budget analysis is presented. |
| format |
Article |
| author |
Kuzminykh, V.O. Koval, O.V. Otrokh |
| spellingShingle |
Kuzminykh, V.O. Koval, O.V. Otrokh Refining the Typical Scenarios by Additional Factors Математичне та комп'ютерне моделювання. Серія: Технічні науки |
| author_facet |
Kuzminykh, V.O. Koval, O.V. Otrokh |
| author_sort |
Kuzminykh, V.O. |
| title |
Refining the Typical Scenarios by Additional Factors |
| title_short |
Refining the Typical Scenarios by Additional Factors |
| title_full |
Refining the Typical Scenarios by Additional Factors |
| title_fullStr |
Refining the Typical Scenarios by Additional Factors |
| title_full_unstemmed |
Refining the Typical Scenarios by Additional Factors |
| title_sort |
refining the typical scenarios by additional factors |
| publisher |
Інститут кібернетики ім. В.М. Глушкова НАН України |
| publishDate |
2020 |
| url |
http://dspace.nbuv.gov.ua/handle/123456789/181471 |
| citation_txt |
Refining the Typical Scenarios by Additional Factors / V.O. Kuzminykh, O.V. Koval, S.I. Otrokh // Математичне та комп'ютерне моделювання. Серія: Технічні науки: зб. наук. пр. — Кам’янець-Подільський: Кам'янець-Подільськ. нац. ун-т, 2019. — Вип. 20. — С. 68-78. — Бібліогр.: 16 назв. — англ. |
| series |
Математичне та комп'ютерне моделювання. Серія: Технічні науки |
| work_keys_str_mv |
AT kuzminykhvo refiningthetypicalscenariosbyadditionalfactors AT kovalov refiningthetypicalscenariosbyadditionalfactors AT otrokh refiningthetypicalscenariosbyadditionalfactors |
| first_indexed |
2025-07-15T22:41:52Z |
| last_indexed |
2025-07-15T22:41:52Z |
| _version_ |
1837754556387164160 |
| fulltext |
Математичне та комп’ютерне моделювання
68
boundary value problem for a model region of a conical shape, bounded
two equipotential surfaces and a surface flow, separated by some given
specified of the equipotential surfaces on several subdomains, is devel-
oped. The proposed model allows through computer experiments to inves-
tigate changes in the characteristics of piecewise homogeneous porous
loads (coefficients of filtration and active porosity of filter materials in
each layer), to predict the optimal use of adsorbents and increase the dura-
tion of operation of filters by selecting their shape and height influence on
the process of adsorption purification of water not only changes in the fil-
tration flow rate along the height of the filter, but also the temperature.
Key words: mathematical model, computer prediction, process of wa-
ter purification, impurity, adsorption, temperature, piecewise-homoge-
neous porous load, rapid multilayer filter, cone-shaped form.
Отримано: 22.08.2019
UDC 621.391
DOI: 10.32626/2308-5916.2019-20.68-78
V. O. Kuzminykh, Ph. D., Associate Professor,
O. V. Koval, Ph. D., Associate Professor,
S. I. Otrokh, D. Sc., Associate Professor
National Technical University of Ukraine «Igor Sikorsky Kyiv
Polytechnic Institute», Kyiv
REFINING THE TYPICAL SCENARIOS BY ADDITIONAL FACTORS
The problems in the quality assessment modeling scenarios
collecting information flow on an extensive network of the exam-
ple of the problem of building and further optimization scenarios to
analyze the budget process on an extensive network. Shown use
structured approach to the ontology as considered most appropriate
to the task of presenting the structure as a graph. Moved assess-
ment of the effect of the use of partial information previously ob-
tained by constructing scenarios collecting information flow on the
network, described the count, with further refinement information.
An formalized description of the hierarchical structure of the sys-
tem. An example of the structure of the interaction of ontology el-
ements for the problem of budget analysis is presented.
The use of an integrated approach based on finding the shortest
path in the graph and model ontology as a graph that realizes the
possibility of using algorithms based on traversing vertices in lay-
ers of hierarchy.
An approach to building breadth-first search algorithm that
significantly reduces the time to find ways of building scenarios
collect information on streaming extensive network. Described in
© V. O. Kuzminykh, O. V. Koval, S. I. Otrokh, 2019
Серія: Технічні науки. Випуск 20
69
the article approach to building quality assessment algorithm simu-
lation scenarios collect information on flow tested an extensive
network in the development of pilot systems, financial analysis of
regional budgets. The algorithm allows to develop a set of software
tools that provides plenty full and holistic problem solving refine-
ment and optimization scenarios searching and collecting infor-
mation flow on an extensive network. One of the promising areas
of application of this approach to assessing the quality of the simu-
lation scenarios are used to build its capacity information and ana-
lytical systems. This will significantly reduce the time and improve
the quality of finding the necessary flow of information.
Key words: quality assessment, modeling, data collection, on-
tology graph analysis, budget analysis.
Introduction. Today many methods to select the appropriate quality
and efficiency of the plurality of possible scenarios or acceptable scenarios
based on analysis of the nature and the factors that affect the planning sce-
nario. In practice, the planning situation stands, different number of factors
on which the decision and determine the fundamental differences between
the procedures necessary formation scenarios. One of the very complex
and pressing problems today that require building effective scenarios for
its decision, the task of building and further optimization scenarios to ana-
lyze the budget process on an branched network. The problem of optimiza-
tion scenarios collect information on streaming branched network is one of
the most important tasks of handling large amounts of data [1, p. 29–30; 2,
p. 78–80; 3, p. 29; 4, p. 20–25].
The most important tool to address the budget process is the financial
analysis of regional budgets. In the conditions of crisis of the economy and
regions of the country, strengthening the role of regions and regional
budgets in solving economic and social problems, problems of stability of
regional budgets are very relevant [5, p. 103; 6, p.39–45].
Financial analysis allows the state budget to sum up over time, to de-
termine the effectiveness of budget spending, predict the state budget for
the next quarter or year and make decisions that will improve the financial
condition of the state budget. One measure of financial condition is con-
sidered to be the level of financial stability budget. Resistance budget al-
lows conclusions about the possibility of the normal functioning of public
power and the strength of its financial base of operations.
The main result of the analysis of financial stability is to get the
budget estimates of stability analysis for each subject over time and opin-
ion on the state budget stability for this subject. Based on these results,
you can make general conclusions about the financial condition of the
state budget, to make predictions about the state forward and decide on
actions to improve the economic situation to achieve stability and inde-
pendence of the state budget [7, p. 103].
Математичне та комп’ютерне моделювання
70
Software development for financial analysis of the state budget and de-
termine the stability of the budget can significantly reduce the time of analysis
and facilitates the work of state institutions and authorities [8, p. 300].
The overall structure of the network, determines the ontological
analysis features for solving the problem of the budget process on an
branched network rather complicated structure and a large number of ele-
ments for which it includes.
One of the most common solutions to such problems is characterized
in that at build script based on a particular ontology that describes the
space provided in determining benefits when evaluating the quality and
effectiveness of scenarios considered only one factor. However, other fac-
tors are not taken into account. Another common approach is determined
that the required scenario is determined taking into account two or more
factors may be taken into account in varying degrees.
Determining the required quality and performance scenarios for situ-
ations where the planning is based on one factor may be using these strat-
egies, using hierarchical graph describing the relevant ontology.
You can select the following basic quality assessment scenarios:
on the vector of priorities, according to the hierarchy of the ontology;
assessment of income and expenses from the sale of each scenario;
subject to peer review;
the results of the impact of implementation scenarios.
Determining the necessary quality and effectiveness of scenarios in
accordance with the second situation where planning controls a number of
factors, a number of features that require the selection of two different
planning procedures in hierarchical systems of several factors.
An important element of consideration of the impact of a number of fac-
tors to determine the necessary quality and effectiveness of scenarios is a
method taking into account the benefits of the effects of certain factors on the
value assessment scenario. The choice can be built as one of the strengths of
the factors and on the basis of the trade-offs between several or all factors
Automation solve such problems needs to build algorithms that can
enable unambiguous choice scenario based on a hierarchical structure de-
scribing ontology data on which to construct scenarios [9, p. 29–35; 10,
p. 260–262; 11, p. 262–265].
The purpose is to develop models and algorithms determine on the
basis of the constructed ontology defined some real hierarchical storage
network and the formation of the current data. This problem concerns the
choice of the most efficient scenarios by identifying and using the most
appropriate scenarios to the terms of a specific request.
Constructing scenarios based on ontology network storage. There
are many models for solving the problem of constructing scenarios based
on ontologies describe the subject area, which are based on various math-
Серія: Технічні науки. Випуск 20
71
ematical methods. Among them are fairly common model for constructing
scenarios based on the structure data storage on an branched network,
which is typical analysis problems of regional budgets. Based on these
models and their various modifications built modern information-
analytical and information retrieval systems [12, p. 504].
This notion of ontology is considered as follows and defined as:
{ , , , }O T A R D , (1)
T — set of terms that denotes objects and concepts of a domain, A — set
of attributes of concepts, R — set of relationships (links) between terms,
D — set of concepts and relationships.
In ontology graphically represented as a network, which peaks labeled
domain concepts, and edges indicate the connection between them. The base
is such hierarchical relationships of the «class — the class» and «part —
whole» that define the structure of the branched structure of the network stor-
age. Thus, ontology is a description of the structure of the subject area, provid-
ing insight together concepts and relationships between them.
To describe ontologies for tasks to select the appropriate quality and effi-
ciency of the plurality of possible scenarios or acceptable scenarios widely
used methods for describing and mapping are based on graph theory. The
most widely descriptions in a hierarchical graph tend to estimate both the
weight and the number included in the scenario description edges of the graph.
There are many methods to assess the number of ontology, but there is
no comprehensive approach to this issue. These methods examine some spe-
cific aspects, but most do so incompletely. An important factor for assessing
ontology is perspective from which it is viewed. It depends on which domain
it is applied and that is a priority for the user. It is therefore necessary to de-
termine which of the methods is most appropriate for a particular case.
Today has models which were to quantitative and qualitative advantages
of one over the other. Therefore, the development of new algorithms and
methods based on the combination of the advantages of different approaches
in building models is very relevant and needs to develop new solutions.
Evaluation of scenario models based on network storage
ontology. The structural approach to the ontology is most appropriate to
the task, because the presentation as a graph structure makes it possible to
measure its properties using the metrics by which you can determine its
quality and form recommendations for its improvement.
An important aspect of the structural approach is the need to assess the
effectiveness of building ontological model-based estimation cost reduction
finder graph describing ontology, compared with non-directional search path,
which corresponds to a script that is based on ontology described as a graph.
To estimate the reduction of search costs by the graph describing the
ontology, one can conduct an assessment of the effectiveness based on
assumptions, which is quite simple and can accurately assess the value
Математичне та комп’ютерне моделювання
72
selected for comparison characteristics. These estimates can be built on the
difference between full and partial passage through the column, which is a
graphical representation of ontology analyzed in describing the scenario.
The basis for such procedures can be obtained before passing on in-
formation about the count in the implementation of other requests that
overlap with current that the information obtained in the previous passage
through the column. This information is stored in the appropriate
knowledge base for each ontology, and hence for a the corresponding
graph. In addition, for the measurement of the efficiency of the approach
as a whole, reducing the degree of generality, we can consider some typi-
cal types of graphs for describing ontologies. This makes it possible to
determine the boundary for efficiency assessment approach in general.
In general, this situation can be seen that search query data for ontol-
ogy that consists of n levels already known based on the analysis of previ-
ous requests stored in the knowledge base, the results of the passage (ie,
partial search) form levels where
m < n. (2)
Then the effect of using previously obtained information for this case
will be
min
2 / 2 2
n n n m
E
(3)
Thus the number of inspections during the passage of the count be
reduced to E again.
As shown in the Miller ontology evaluation suggest that the number
of ties in one concept in fully connected graph describing ontology should
not exceed 9 [13, p. 81–90]. Thus, we can assume that in most cases the
actual total number of incoming and outgoing edges do not exceed 9.
Based on this assumption the maximum benefit from the use of pre-
viously received information possible way to construct a scenario for this
case can reach
max 9 / 9 9
n n n m
E
(4)
To assess the effectiveness of building ontology model can be used
methods are based on finding the shortest path in the graph that describes
it.
In general, we can write that implementation choices to count the
ways to achieve the goal T according to the request:
T x A x , (5)
x — where all possible avenues on the graph. A x — the characteristic fea-
ture that captures the essence of a specific request and will lead to results.
Then
( )a x c c x c a , (6)
Серія: Технічні науки. Випуск 20
73
с — all paths in the graph leading to the goal, a — the minimum distance
on the column corresponding to the target.
Thus, there is always a minimum distance on the column correspond-
ing to the goals that demand, then there is always
min minT a (7)
Problem finding the shortest path in the graph (Single Source Short-
est Path — SSSP) [14, p. 370–385] are formed based on common charac-
teristics graph model describing ontology.
Let a given graph with weights arcs and dedicated source of top — u.
The sequence of arcs called by that goes from the top u to the top v.
It is necessary for each vertex v, accessible from the top source u,
specify the path that has the smallest possible total weight: *
,P u v
* *
, min ,f v f P u v f P u v . (8)
Objectives can be set for both targeted and for an undirected graph. This
kind of problem can apply in both cases. The problem satisfies the principle of
optimality if the path is part of the shortest path, that is the shortest path from
the source to the top u w. The principle of optimality means that for each ver-
tex v shortest path instead of just enough to keep it past the arc.
Consider the weighted graph with n vertices and m arcs with weights.
For it is necessary to construct the shortest path from vertex u (initial) to
top v (final).
The shortest path from u to v can be restored if the time starting from
the top v, place ribs in the opposite direction until, until the top has u. Ribs
can be restored bust curves for each vertex:
* * *
{( , ) | ( ) ( ) ( , )}ve u v E f v f u f u v (9)
To find the shortest distance (v) on a set of curves, it is necessary to
build a tree on which to search with the ability to parallelize. The most
common processing tasks to streaming information on the network is
branched breadth-first search algorithm [15, p. 285–292; 16, p. 350–360].
This algorithm can be used to solve the problem of finding the shortest
path for all pairs of vertices. For this algorithm should run for each vertex.
For optimization problem scenario analysis of the budget process on an
branched network based ontologies describe the structure of storing data in a
hierarchical graph search algorithm in width allows us to calculate the short-
est distance from the selected vertex directed graph all the other nodes. In
addition, the breadth-first search can solve the problem of checking range,
ie, whether there are ways between the top of the source and the other verti-
ces of the graph. The algorithm is based on the vertices traversing the levels
of hierarchy. The idea of breadth-first search algorithm allows to develop
different versions of the algorithm according to the specific tasks to be
solved with desired properties and actions that it should include.
Математичне та комп’ютерне моделювання
74
To solve the problem of optimization scenarios analysis of the budget
process on an branched network based ontologies describe the structure of
storing data in a hierarchical graph, offered the following modified breadth-
first search algorithm that significantly reduces the time to find ways of build-
ing scenarios collect information on streaming branched network.
Let a given graph without weights with a dedicated source of top u.
In this way ,P u v between vertices u and v is the set of arcs
1 1 2 1, , , , ...., , .nU v v v v v (10)
Path length d(u, v) denote the number of arcs in this way between
vertices u and v. Breadth-first search finds the shortest path from vertex u
to all other vertices.
At the beginning of the algorithm, the distance to the top of the source
0d u , (11)
for other peaks
, .d v v u (12)
Computing core algorithm is circumvention of vertices adjacent to the
selected vertex v, followed by the addition of not yet visited peaks in the set P.
This operation is performed at each step for each vertex, such that v V .
The algorithm consistently clarifies the function d(v). To take into
account the features of construction problems scenario based on a hierar-
chical ontology introduce an additional function as the process of forming
a scenario with desired properties and actions, that it should come in the
form: , 1j iF v v , if jv corresponds to the implementation of at least
one of the actions that are a part of the script actions under construction.
, 0j iF v v , if jv is not responsible enforcement is not one of the ac-
tions that are a part of the script actions under construction.
Number of levels in the column is r, and the number of items in each
level e.
The sequence of actions to assess the quality of the modeling of the
analysis of information on the network can be as follows:
1. Selection on the lower layer of the vertices of the graph corresponding
to the quality function.
2. Analysis of the links of the selected vertices with the vertices of the
next level, which is located higher in the model hierarchy.
3. Saving the edges of the graph corresponding to the found relationships,
for subsequent analysis and use in search operations.
4. Repetition of iterations to the exit to the search source at the top level.
5. Consolidation of all collected edges and vertices of the graph, which is
built on the basis of the quality function, that is, the request for infor-
mation search.
Серія: Технічні науки. Випуск 20
75
6. The ordering of all paths on a constant graph in accordance with the
function of quality.
7. Analysis of the scenario model based on the selection of the shortest
paths with the minimum number of edges on the graph.
Fig. 1. Algorithm structure
The work developed a simplified version of the algorithm passes
(Fig.1) to count layers (into layers) below the top of the last layer of the
first. Obtained at the previous iteration result identifies one of the curves
e(vj, vi), which is the basis for finding a new arc on last layer on top vj. If
any layer except the bottom, you cannot find ,j ie v v , which complies
with the quality features
, 1.j iF v v (13)
Математичне та комп’ютерне моделювання
76
Then the process is repeated with the transition to a single layer and
find your way back repeated. This excludes from consideration arc, poorly
chosen. If any condition layer generally cannot be done, it means that the
scenario cannot be built on this column. Then it is necessary to make
changes and rebuild ontology graph that describes it, and then to re-build
script on a new ontology.
As result of actions described algorithm we get a script that meets these
criteria, in accordance with the basic ontology that describes the graph. The
algorithm reflects the sequential process of identifying a sequence of arcs con-
necting the vertices of the bottom layer to the top of the parameters of life.
When you search for information on loved ones in the form request-
ed, we use an existing model script, which significantly reduces construc-
tion time by reducing the number of layers in question, but does not pre-
clude the need to revise the ontology and its restructuring.
Conclusions. In the paper the problem of optimization, scenarios
streaming collection of information on branched network of the example
of the problem of building and further optimization scenarios to analyze
the budget process. Shown use structured approach to the ontology as con-
sidered most appropriate to the task of presenting the structure as a graph.
Moved assessment of the effect of the use of partial information previous-
ly obtained by constructing scenarios collecting information flow on the
network, described the count, with further refinement information.
The use of an integrated approach based on finding the shortest path in
the graph (SSSP) and model ontology as a graph that realizes the possibility of
using algorithms based on traversing the vertices in the hierarchy, i.e. layers.
An approach to the construction of a modified breadth-first search al-
gorithm that significantly reduces the time to find ways of building scenarios
collect information on streaming branched network. Described in the article
optimization algorithm approach for constructing scenarios collect infor-
mation on flow tested on branched network in the development of pilot sys-
tems, financial analysis of regional budgets. The algorithm allows to devel-
op a set of software tools that provides plenty full and complete optimization
problem solving scenarios searching and collecting information flow on an
branched network. One of the promising areas of application of the algo-
rithm is used to build its capacity information and analytical systems.
References:
1. Koval O. V. Using stochastic automaton for data consolidation / O. V. Koval,
V. A. Kuzminykh, D. V. Khaustov // Наукові вісті НТУУ «КПІ». — Київ,
2017. — № 2. — С. 29–36.
2. Коваль О. В. Реалізація сценарного підходу в управлінні проектами на
основі типових задач / О. В. Коваль, В. О. Кузьміних // Реєстрація, збері-
гання і обробка даних. — Київ, 2015. — Т. 17, № 1. — С. 77–87.
Серія: Технічні науки. Випуск 20
77
3. Koval A. V. Developmen Of A Scenario-Based Project Management System
Construction In Enterpries With The Functional Organizational Structure /
A. V. Koval, V. A. Kuzminykh, M. P. Voronko, D. V. Khaustov //
Informatyka Automatyka Pomiary w Gospodarce i Ochronie Środowiska. —
2013. — № 4. — P. 26–30.
4. Koval O. V. Formation of Analytical activity Scenarios / O. V. Koval,
K. A. Zaytseva, Yu. D. Boyko // Системні дослідження та інформаційні те-
хнології. — Київ, 2014. — № 1. — С. 20–25.
5. Зайцева Е. А. Комп’ютерне моделювання соцiально-економiчного розви-
тку регiону / Е. А. Зайцева, А. В. Коваль // Системный анализ и информа-
ционные технологии : сб. тезисов 15-ой междунар. науч.-техн. конф. (Ки-
ев, 31 мая 2013). — Киев : ННК «IПСА», НТУУ «КПI», 2013. — С. 103.
6. Сенченко В. Р. Система моніторингу державного бюджету України /
В. Р. Сенченко, О. О. Діденко, О. В. Коваль // Наукові вісті НТУУ
«КПІ». — Київ. 2013. — № 6. — С. 37–48.
7. Коваль О. В. Формування та реалізація сценаріїв для вирішення задач
забезпечення сталого розвитку : монографія / О. В. Коваль, К. А. Волкова,
В. В. Дричик. — Черкаси : Видавець Чабаненко Ю. А., 2015. — 540 с.
8. Chernov V. A. The Economic Theory analysis: Textbook / V. A. Chernov. —
Moscow : Prospect, 2017. — 384 p. — ISBN 978-5-392-24867-4
9. Novogrudska R. L. Ontology for Applications Development. Ontology in
Information Science : monographs / R. L. Novogrudska, L. S. Globa,
O. V. Koval, V. R. Senchenko. — 2018. — Chapter 2. — P. 29–53. —
DOI: 10.5772/intechopen.74042
10. Novogrudska R. L., Globa L. S., Koval O. V., Senchenko V. R. Examples of
Ontology Model Usage in Engineering Fields. Ontology in Information Sci-
ence: monographs / / R. L. Novogrudska, L. S. Globa, O. V. Koval,
V. R. Senchenko. — 2018. — Chapter 3. — P. 254–281.
11. Глоба Л. С. Створення сценаріїв обробки даних на ocновi онтологій /
Л. С. Глоба, О. В. Коваль, Р. Л. Новогрудська, В. Р. Сенченко // SAIT–
2016 «Системний аналіз та інформаційні технології»: матеріали 18-й
міжнар. наук.-техн. конф. (Київ, 30 травня 2016). — Київ : ІПСА КПІ,
2016. — С. 262–265.
12. Christopher J. Manning, Prabhakar Rahavan, Heinrich Schütz. Introduction
Consumer Information Search / J. Christopher ; (trans. with Eng.) — M .:
OOO «Y. D. Williams», 2011 — P. 504.
13. Miller G. The Magical Number Seven, Plus or Minus Two: Some Limits on
Our Capacity for Processing Information / G. Miller // The Psychological Re-
view. — 1956. — Vol. 63. — P. 81–97.
14. Thorup M. Undirected Single-Source Shortest Paths with Positive Integer
Weights in Linear Time / M. Thorup // Journal of the ACM 46. — 1999. —
№ 3. — Р. 362–394
15. Moore E. F. The Shortest Path Through a Maze / E. F. Moore // International
Symposium on the Theory of Switching. — 1959. — Р. 285-292.
16. Lee C Y. An Algorithm for Path Connections and Its Applications /
C Y. Lee // IEEE Transactions on Electronic Computers 10. — 1961. —
№ 3. — Р. 346–365.
Математичне та комп’ютерне моделювання
78
УТОЧНЕННЯ ТИПОВОГО СЦЕНАРІЮ
ЗА ДОДАТКОВИМИ ПОКАЗНИКАМИ
У роботі розглянуті задачі оцінки якості моделювання сценаріїв
збору потокової інформації на розгалуженій мережі на прикладі задачі
побудови та подальшої оптимізації сценаріїв для аналізу бюджетного
процесу на розгалуженій мережі. Показано використання структурного
підходу до розгляду онтології, як найбільш відповідного до розглянутої
задачі, з представленням структури у вигляді графу. Переведено оцінку
ефекту від використання раніше отриманої часткової інформації по по-
будові сценаріїв збору потокової інформації на мережі, що описується
графом, при подальшому уточненні інформації. Наведено формалізова-
ний опис ієрархічної структури системи. Представлено приклад струк-
тури взаємодії елементів онтології для задачі бюджетного аналізу.
Запропоновано використання комплексного підходу на основі
пошуку найкоротших шляхів по графу та моделі онтології у вигляді
графу, що реалізує можливість використання алгоритмів, що заснова-
ні на обході вершин графа по шарах ієрархії.
Запропоновано підхід до побудови алгоритму пошуку в ширину, що
значно зменшує час пошуку шляхів для побудови сценаріїв збору пото-
кової інформації на розгалуженій мережі. Описаний у статті підхід до
побудови алгоритму оцінки якості моделювання сценаріїв збору пото-
кової інформації на розгалуженій мережі апробований при розробці пі-
лотного проекту системи фінансовий аналіз регіональних бюджетів. Ро-
зроблений алгоритм дозволяє розробити комплекс програмних засобів,
що забезпечує достатньо повне і цілісне рішення задач уточнення та
оптимізація сценаріїв, що здійснюють пошук та збір потокової інфор-
мації на розгалуженій мережі. Одним з перспективних напрямків засто-
сування описаного підходу до оцінки якості моделювання сценаріїв, є
використані його можливостей для побудови інформаційно-аналі-
тичних систем. Це дасть можливість значно скоротити час та підвищи-
ти якість пошуку необхідної потокової інформації.
Ключові слова: оцінка якості, моделювання, збір інформації, он-
тологія, аналіз графу, бюджетний аналіз.
Отримано: 27.08.2019
|