NAU Harvester System
Gas turbine engines diagnosing using the methods of pattern recognition
Репозитарій Національного Авіаційного Університету
View Archive Info| Field | Value | |
| Title |
Gas turbine engines diagnosing using the methods of pattern recognition
|
|
| Creator |
Dmitriev, S.
Popov, O. Yakushenko, O. Potapov, V. Pashchuk, O. |
|
| Subject |
diagnosing
|
|
| Description |
The paper is dedicated to the relevant problem that pertains to gas turbine engines diagnosing. The issue con- sidered in the paper is how to diagnose gas turbine engines using the methods of pattern recognition: in par- ticular the method of “binary tree” and the “nearest neighbor” method. In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tree is a triple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set. Some authors allow the binary tree to be the empty set as well. I n computing, binary trees are seldom used solely for their struc- ture. Much more typical is to define a labeling function on the nodes, which associates some value to each node. Nearest neighbor search (NNS), as a form of proximity search, is the optimization problem of finding the point in a given set that is closest (or most similar) to a given point. Closeness is typically expressed in terms of a dissimilarity function: the less similar th |
|
| Date |
2017-12-06T09:53:43Z
2017-12-06T09:53:43Z 2017-09 |
|
| Type |
Article
|
|
| Identifier |
http://er.nau.edu.ua/handle/NAU/31694
|
|
| Language |
en
|
|
| Relation |
№ 8 (143)
|
|
| Format |
application/pdf
|
|
| Publisher |
Авиационно–космическая техника и технология. Харьков.
|
|