Реферати
Збережено в:
| Дата: | 2019 |
|---|---|
| Формат: | Стаття |
| Мова: | Ukrainian |
| Опубліковано: |
Інститут проблем реєстрації інформації НАН України
2019
|
| Назва видання: | Реєстрація, зберігання і обробка даних |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/169105 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | Реферати // Реєстрація, зберігання і обробка даних. — 2019. — Т. 21, № 2. — С. 72–77. — укр. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| id |
irk-123456789-169105 |
|---|---|
| record_format |
dspace |
| spelling |
irk-123456789-1691052020-06-05T01:26:09Z Реферати 2019 Article Реферати // Реєстрація, зберігання і обробка даних. — 2019. — Т. 21, № 2. — С. 72–77. — укр. 1560-9189 http://dspace.nbuv.gov.ua/handle/123456789/169105 uk Реєстрація, зберігання і обробка даних Інститут проблем реєстрації інформації НАН України |
| institution |
Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| collection |
DSpace DC |
| language |
Ukrainian |
| format |
Article |
| title |
Реферати |
| spellingShingle |
Реферати Реєстрація, зберігання і обробка даних |
| title_short |
Реферати |
| title_full |
Реферати |
| title_fullStr |
Реферати |
| title_full_unstemmed |
Реферати |
| title_sort |
реферати |
| publisher |
Інститут проблем реєстрації інформації НАН України |
| publishDate |
2019 |
| url |
http://dspace.nbuv.gov.ua/handle/123456789/169105 |
| citation_txt |
Реферати // Реєстрація, зберігання і обробка даних. — 2019. — Т. 21, № 2. — С. 72–77. — укр. |
| series |
Реєстрація, зберігання і обробка даних |
| first_indexed |
2025-07-15T03:50:01Z |
| last_indexed |
2025-07-15T03:50:01Z |
| _version_ |
1837683338906697728 |
| fulltext |
72
519.854
. ., . .
. , . . 2019. . 21. 2. . 3–11. — .
’ -
. ,
. .
, , .
, . -
, , ’ -
-
. -
. -
. — .
,
. -
. -
.
, . ’ -
.
, -
,
.
, , -
NP- . .: 2. .: 1. .: 10 .
: , , -
, , .
UDC 519.854
Yukhymenko B.I., Tkalenko O.Yu. An algorithm of ants’ colony for the multi-dimensional knap-
sack problem. Data Rec., Storage & Processing. 2019. Vol. 21. N 2. P. 3–11. — Rus.
A fairly new direction in the creation of methods and algorithms for solving optimization problems
is described. The behavior of living beings in nature can be formalized using scientific ideas. Particular
attention is attracted by the behavior of ants. Their colonies can be viewed as a multi-agent system, whose
agents work separately, but pursue a common goal. They have the ability to transmit information that al-
lows them to adapt and change their behavior.
The principles of randomness, multiplicity, positive and negative feedback in the actions of those
non-intelligent creatures in nature provide ideas for creating some original and quite effective optimiza-
tion methods. The algorithms of the ant colony are successfully used in solving many problems of dis-
crete optimization. The article provides an overview of the applicability of ant algorithms in various sub-
ject areas. All algorithms of this type are approximate — probabilistic methods. The magnitude of the
probability of making a certain decision when forming a variant depends on the parameters and ,
which determine the presence and evaporation of pheromones. The values of these parameters, in princi-
ple, and determine the efficiency of the algorithm. The main development in the article is a new probabil-
istic approximate algorithm for solving the multidimensional knapsack problem. At the core of its devel-
opment are the ideas of ant colony algorithms, which are already being used in practice. The results of
computer experimental research are given.
The results of the comparison of exact solutions with the solutions of the proposed algorithm gives
hope to get ways to solve discrete optimization problems for practical use, the computational complexity
of which is much less.
In the future, if these algorithms can be brought to exact ones, then they will derive discrete opti-
mization methods from the NP class of complexity. Tabl.: 2. Fig.: 1. Refs: 10 titles.
Key words: optimization methods, approximate probabilistic methods, ant colony algorithms,
multi-dimensional knapsack problem, computational complexity.
ISSN 1560-9189 , , 2019, . 21, 2 73
004.891.3
. . -
( ). , . . 2019. . 21. 2. . 12–20. — .
-
, - -
. -
.
, . -
Rete. « – »
Rete, .
. -
, . .: 4. .:
13 .
: , , , , -
, , « – »,
Rete, .
UDC 004.891.3
Poliagushko L.G. An automated analysis of the patient’s condition and assessment of medical ses-
sions (hypoxic therary). Data Rec., Storage & Processing. 2019. Vol. 21. N 2. P. 12–20. — Ukr.
The task of creating an expert system for conducting an automated assessment of patients' status
and analyzing the results of conducting medical sessions is examined. This system is part of an automated
software and hardware complex for hypoxic therapy. The paper describes the proposed architecture of the
expert system and the interaction of its main modules. The developed formal model of representation of
the knowledge base is described. This model is based on product rules. The proposed Knowledge Base
representation allows for the presentation of rules with different levels of nesting conditions and conse-
quences, as well as maintaining rules using MySQL. The model is adapted to use the Rete algorithm. The
article describes the output mechanism through the «mapping-operation» procedure and the Rete algo-
rithm, which is a quick comparison tool with the template. The created expert system conducts an auto-
mated assessment of patients' condition and analysis of diagnostic sessions and course of treatment based
on parameters of the respiratory and cardiovascular system of a person. This expert system has improved
the effectiveness and safety of procedures for hypoxic therapy, which in the future ensure the use of auto-
mated software and hardware for hypoxic therapy, not only in medical centers, but also at home. Also,
this system can work with other medical devices or as an independent program for assessing medical pro-
cedures and providing medical advice. The main improvements will be to fill the knowledge base with the
necessary rules and facts. The paper presents the algorithm's work and the presentation of the rules on the
example of the evaluation of the diagnostic session. Fig.: 4. Refs: 13 titles.
Key words: medicine, diagnostics, expert system, formal model, production rules, inferential
mechanism, «comparison-operation» procedure, the Rete algorithm, hypoxia therapy.
004.3
. ., . .
. , . . 2019. . 21. 2. . 21–33. —
.
Big Data, -
Deep Learning.
Deep Learning, Big Data, GPGPU.
CPU
GPU, API Android. -
, -
WiFi, 3G 4G. -
. .: 14. .: 34 .
: Big Data, Deep Learning, GPGPU, -
Android, TensorFlow, CNTK, PyTorch, -
MxNet, Caffe, Mobile Net, Squeeze Net,
Inception Net, NAS Net, Dense Net, Res Net.
74
UDC 004.3
Pogorilyy S.D., Chechula M.V. Graphical data aggregation and analysis in dedicated mobile de-
vice networks. Data Rec., Storage & Processing. 2019. Vol. 21. N 2. P. 21–33. — Ukr.
The problem of inefficient processing in the Big Data industry is touched upon. A detailed analysis
of the various means to increase the percentage of processed data is provided and the experimental im-
plementation of a way to obtain and preprocess data in a mobile device network in real-time mode is
shown.
During the analysis of the subject, the next fields of research were observed: Deep Learning, Ma-
chine Learning, Big Data, and GPGPU technology. The increasing numbers of publications, especially of
papers that include mobile networks, were emphasized as evidence of rapid growth of the industry and a
transition of neuron network algorithms toward mobile operating systems.
Further analysis was focused on highlighting the most relevant and perspective objects for the re-
search. The analysis showed that amidst currently most innovative and broadly widespread operation sys-
tems and frameworks to implement and engage neuron network algorithms Android operation system and
TensorFlow framework has the most significant advantages.
Due to the purpose of developing an experimental solution based on mobile device network and
neuron network, different classes and types of neuron network architectures were explored. Two major
types of mobile neuron networks such as quantized and integer neuron networks and the principal dis-
similarity between them were described. Various neuron networks were tested on mobile devices with
Internet connection via specially developed auxiliary software using GPGPU technology. Experimental
results had shown that modern smartphones such as Huawei P20-Pro are capable to analyze, store and
transmit the incoming from its camera sensor information at a rate of up to 40 frames per second. The
usage of mobile GPU for improving the performance of the neuron networks was proved to be effective
as such the number of frames processed by a neuron network per second can be elevated up to 10 times.
The experimental software that task was to search for the given by user object in a real-time mode
using mobile device network as both — server and processing nodes — proved to be a violable solution
for the increasing amount of preprocessed up-to-the-minute information in the Big Data industry after the
diligent research.
As a summary, it needs to be stated that current progress in mobile device industry is making pos-
sible to bring neuron network technologies on mobile platforms and expand the capability of data aggre-
gating services through the use of modern Deep Learning frameworks and GPGPU technology. Fig.: 14.
Refs: 34 titles.
Key words: Big Data concept, Deep Learning technology, GPGPU technology, Android operation
system, TensorFlow framework, CNTK framework, PyTorch framework, MxNet framework, Caffe
framework, Mobile Net neuron network, Squeeze Net neuron network, Inception Net neuron network,
NAS Net neuron network, Dense Net neuron network, Res Net neuron network.
004.932.2
. ., . ., . ., . . -
-
. , . . 2019. . 21. 2. . 34–40. — .
-
-
( ). -
, -
. , -
, -
. .: 5. .: 8 .
: , - -
, , , .
UDC 004.932.2
Yuzefovych V.V., Mezentsev O.V., Butochnov O.M., Tsybulska Y.O. Using selective reference
images of optical range for navigarion systems of controlled objects. Data Rec., Storage & Processing.
2019. Vol. 21. N 2. P. 34–40. — Ukr.
ISSN 1560-9189 , , 2019, . 21, 2 75
A possibility (an advisability under certain conditions) to use various types of optical range images
as the reference image to solve the problems of the correlation-extremal guidance of the controlled aerial
vehicles is considered. During the flight the correlation-extremal navigation (guidance) system performs a
comparison of reference images of sighting surface, prepared before, and current images from the on-
board sensors. To form optimal reference images the correlation characteristics of the regular optical ima-
ges, selective grayscale images and binary images are analyzed. It is shown that the selective images with
sufficient number of stable informative features are characterized by most «quality» cross-correlation
function (it has a lower level of «background» and a more intense main peak). This approach potentially
increases the quality of the solution of controlled objects navigation (guidance) problems on the basis of
such images. On addition, the advantage of using selective reference images is the small amount of mem-
ory required to store them and lower bandwidth requirements of communication channels for their trans-
mission.
Also there is considered the use of binary selective current images with binary selective reference
images to solve the problems of the correlation-extremal guidance of the controlled aerial vehicles. It is
shown that it is necessary to use fast methods of selective images formation (to obtain selective current
images on a board) and to apply the methods of temporary objects removing on the input images (for ex-
ample, on the base of common analysis of the few images of the sighting surface obtained in a different
time) to prepare the reference images with stable information features for increasing of the navigation
(guidance) accuracy. Fig.: 5. Refs: 8 titles.
Key words: reference image, correlation-extremal navigation system, cross-correlation function,
selective image, binary image.
004.7
. .
. , . . 2019. . 21.
2. . 41–48. — .
. -
,
STRIDE DREAD. -
, , -
.
, , -
,
. -
, . .: 3.
.: 11 .
: , , , -
.
UDC 004.7
Zubok V.Yu. A combination of traditional methods and a metric approach to assessing the risks
from cyber attacks to global routing. Data Rec., Storage & Processing. 2019. Vol. 21. N 2. P. 41–48. —
Ukr.
One of the most significant Internet-related problems of cybersecurity is route hijacking counterac-
tion in the Internet global routing system. Attacking global routing is capable of harming millions of net-
work devices (and also users) with much less effort than the well-known DDoS or Ransomware attacks.
The problem defined by Internet Engineering Task force (IETF, in RFC 7908) as «the propagation of
routing announcement(s) beyond their intended scope. That is, an announcement from an Autonomous
System (AS) of a learned BGP route to another AS is in violation of the intended policies of the receiver,
the sender, and/or one of the ASes along the preceding AS path». In other words, some Internet provider
could announce a route to some network prefixes which don’t belong to him. Then, a new fake route can
compete with true route, and can win using BGP selection criteria. As a result, traffic to victimized net-
works is redirected improper way where it can be dropped, monitored, diversed. Border Gateway Protocol
(BGP) itself has no mechanisms to defend routes. There are many improvements, including cryptographi-
cal approaches (electronic signatures, certificates, routing registries), are still either computationally com-
76
plex, or hard to implement and control worldwide, or both. Avoiding or minimizing this risk is an actual
problem.
Relying on world practices of risk management, we‘ve made theoretical approaches to identifica-
tion and evaluation of route hijacking risk by exploring topology — links and relations between the ASes.
On a first step, we have proceeded through ISO Guide 73:2009 «Risk Management – Vocabulary» to tie-
up to the commonly used methodical approach for risk management. Then, we used a classic STRIDE
approach to routing security threats classification, and DREAD model to assess each threat of STRIDE
acronym. Using such two-dimensional measuring, we achieved a numerically expressed impact of each
threat on aggregated risk evaluation.
Further we used offered earlier metric function of the Internet so we can see and specify clear rela-
tion between distance between two nodes and risk of route hijacking. The more distance between two
autonomous systems, the more is risk of successful intrusion in global routing for their mutual traffic dis-
tortion. The same way we can measure the distance (i.e. evaluate the risk of route hijacking) between one
node and a group of some other nodes. In the conclusion we emphasize that such approach opens a way to
further formulation of route hijacking risk management problem in terms of topology tasks. Fig.: 3. Refs:
11 titles.
Key words: global routing route hijack route leak, risc assessment, cybersecurity.
004.085
. . .
, . . 2019. . 21. 2. . 49–55. — .
.
-
.
405 Blu-ray, DVD CD. .: 6. .: 15 .
: , , - , ,
, .
UDC 004.085
Kosyak I.V. Semiconductor laser diode control in optical disc writing systems. Data Rec., Storage
& Processing. 2019. Vol. 21. N 2. P. 49–55. — Ukr.
An analysis of the principles of construction of control systems for semiconductor laser diode is
carried out. Features of control of semiconductor laser for the system of recording optical disks are con-
sidered. The implementation of 405 nm wavelength semiconductor laser control device for recording Blu-
ray, DVD, and CD formats is proposed.
One of the main advantages of optical CDs, DVDs, and now Blu-Ray is the simplicity and low
cost of replicating disks. Optical disk mastering is a key step in creating a stamp, of which ROM (read-
only memory) disks are copied.
The basis for the production of compact discs of any format is the laser recording stations, which
provide relief recordings of original discs for optical memory, and are one of the most sophisticated mod-
ern optoelectronic systems.
The Institute for Information Recording Problems of the National Academy of Sciences of Ukraine
created the only working laser recording station in Ukraine. The urgent task remains to improve its work
and research the new principles of its construction. This work is devoted to the analysis and research of
the construction of a 405 nm wavelength semiconductor laser diode control device for recording systems
for high density optical disks.
When constructing a recording system for high-density optical discs, in particular CD, Blu-ray and
DVD formats, there is a need for the development of a 405 nm wavelength semiconductor laser diode
control unit that will provide the necessary modulation of laser radiation on CD, Blu-ray and DVD for-
mats on laser recording station.
The necessary control of the semiconductor laser diode is provided by circuit engineering methods
and means. The radiation power of the semiconductor laser is clearly dependent on the current of the in
the so-called active zone of its operation. Thus, the modulation of laser radiation is carried out by modu-
lating the pump current. The schematic diagram of the developed device is constructed using analog and
digital components.
The main feature of the developed device is the presence of 3-channel control of the output power
of laser radiation with the ability to adjust the reference current. This allows the use of different levels of
ISSN 1560-9189 , , 2019, . 21, 2 77
power in the formation of channel coding impulses, which provides optimal forms and sizes of recordable
pits for reliable reading of information from disks and use different recording materials for the original
disk. Fig.: 6. Refs: 15 titles.
Key words: optical disc, mastering, original disc, information recording, recording format, semi-
conductor laser diode.
519.816
. ., . . . -
, . . 2019. . 21. 2. . 56–72. — .
, -
.
,
. -
.
, — -
, , . -
,
. ,
( , , -
). .: 5. .: 6. .: 24 .
: , -
, , .
UDC 519.816
Kadenko S.V. and Tsyganok V.V. Approaches to fficiency valuation of xpert methods. Data
Rec., Storage & Processing. 2019. Vol. 21. N 2. P. 56–72. — Ukr.
It is shown that definition of accuracy of expert methods represents a significant problem due to
unavailability of benchmark values of object estimates in real expert examinations. It is suggested to use
the efficiency indicator based on the stability of results of aggregation methods under deviations of input
data. It has been studied two approaches to expert method efficiency evaluation on the example of com-
parison of two modifications of combinatorial aggregation method (in one modification spanning tree
weights are taken into consideration, while in the other they are not). The first approach is based on
analysis of real data of expert estimation of special benchmark objects, while the second one is based on
simulation of the whole expert examination cycle, including the estimates themselves. In the process of
efficiency evaluation of the two specified methods, the simulation-based approach turned out to be more
suitable and representative. The obtained experimental results empirically prove the advantage of combi-
natorial method, taking spanning tree weights into account, over the method where these weights are not
considered (and, consequently, over row geometric mean and logarithmic least squares methods). They
also allow us to draw several conceptual conclusions, such as:
1) Accuracy of expert estimates and efficiency of expert data aggregation methods are not the
same concept. Often low accuracy of expert data aggregation methods results from mistakes made by ex-
perts during estimation and not from the drawbacks of the method itself;
2) Not only accuracy, but also consistency of expert estimates is important, both within the pair-
wise comparison matrix provided by a single expert, and among pair-wise comparisons provided by an
expert group; the more consistent the data is, the more credibility it deserves;
3) Only conceptually different methods, using different input data, can be compared based on real
expert estimates. If the input data is the same and only the methods of their aggregation are different, then
in order to evaluate such methods, one should simulate the whole expert examination cycle.
Tabl.: 5. Fig.: 6. Refs: 24 titles.
Key words: decision-making support, weakly structured subject domain, expert estimate, pair-
wise comparisons.
|