Сибирский федеральный университет

Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций

Конференция: International Conference on Computational Science (ICCS 2003); MELBOURNE, AUSTRALIA; MELBOURNE, AUSTRALIA

Год издания: 2003

Ключевые слова: Entropy, Data loss, Fine grained, Kinetic machines, Parallel Computation, Specific entropy, Symbol sequences, Recovery

Аннотация: The new method of a gap recovery in symbol sequences is presented. A covering is combined from the suitable reasonably short strings of the parts of a sequence available for an observation. Two criteria are introduced to choose the best covering. It must yield the maximum of entropy of a frequency dictionary developed over the sequence obtained due to the recovery, if an overlapping combined from the copies of strings from the available parts of the sequence exists. The second criterion identifies the best covering in case when one has to use any string to cover the gap; here the best covering must yield the minimum of specific entropy of the frequency dictionary developed over the available parts of the sequence against that one developed over the entire sequence obtained due to the recovery. Kirdin kinetic machine that is the ideal fine-grained structureless computer has been used to resolve the problem of the reconstruction of a gap in symbol sequence.

Журнал: COMPUTATIONAL SCIENCE - ICCS 2003, PT II, PROCEEDINGS

Выпуск журнала: Vol. 2658

Номера страниц: 794-801

ISSN журнала: 03029743

Место издания: BERLIN

Издатель: SPRINGER-VERLAG BERLIN

• Gorbunova E.O. (Institute of Computational Modelling of SB RAS)
• Kondratenko Y.V. (Krasnoyarsk State University)
• Sadovsky M.G. (Institute of Biophysics of SB RAS)

• Web of Science Core Collection
• Scopus
• Ядро РИНЦ (eLIBRARY.RU)