Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: similarity and distance measures

Sortuj według:

Ogranicz wyniki do:

A New Method for Symbolic Sequences Analysis. An Application to Long Sequences

Kozarzewski B.

Computational Methods in Science and Technology

2014

Vol. 20, No. 3

93--100

The method for symbolic sequence decomposition into a set of consecutive, distinct, non-overlapping strings of various lengths is proposed. Representation of the sequence as a set of words allows one to use set theory notions. The main result is a quite new definition of the similarity between any two sequences over a given alphabet. No prior sequence alignment is necessary. In the present paper two applications of a set of words are described. In the first a similarity measure is applied to prepare centroids for K-means algorithm. It results in a high performance grouping method for long DNA sequences. The other application concerns the statistical analysis of word attributes. It is shown that similarity, complexity and correlation function of word attributes across sequences of digits of fractional parts of some irrational numbers support the suggestion that the sequences are instances of a random sequence of decimal digits.

Akinwale A., Niewiadomski A.

Journal of Applied Computer Science

2012

Vol. 20, nr 2

7--26

The purpose of this study is to explore the grammatical proper ties and features of generalized n-gram matching technique in electronic test at programming languages. N-gram matching technique has been success fully employed in information handling and decision support system dealing with texts but its side effect is size n which tends to be rather large. Two new methods of odd gram and sumsquare gram have been proposed for the improvement of generalized n-gram matching together with the modification of existing methods. While generalized n-grams matching is easy to generate and manage, they do require quadratic time and space complexity and are therefore ill-suited to the proposed and modified methods which work in quadratic in nature. Experiments have been conducted with the two new methods and modified ones using real life programming code assignments as pattern and text matches and the derived results were compared with the existing methods which are among the best in practice. The results obtained experimentally are very positive and suggested that the proposed methods can be successfully applied in electronic test at programming languages.

Grupowanie trajektorii ruchu

Cholewa W., Urbanek G., Wojtusik J.

Pomiary Automatyka Kontrola

2005

R. 51, nr 9 bis

231--233

W referacie przedstawiono problem automatycznego porównywania trajektorii ruchu środka czopa dla potrzeb identyfikacji modeli diagnostycznych. Przedstawiono problem porównywania kształtów dwóch trajektorii i analizy stacjonarności trajektorii. Omówiono zagadnienia związane z grupowaniem trajektorii podobnych takie, jak wybór algorytmu i kryterium grupowania. Pokazano przykład uzyskanych wyników.

A problem of automatic comparison of shaft-neck trajectories for the purpose of diagnostic model identification is presented in the paper. The task of shape comparison of two trajectories and analysis of trajectory stationarity is discussed. Choice problems of algorithm and criterion of clustering are described in the paper. The example of received results is shown.