On a problem of summing elements chosen from the family of finite numerical sequences

Alexander Kel’manov, Ludmila Mikhailova, Semyon Romanchenko

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

Abstract

The tuple of permutations and the tuple of indices are required to be found in the problem considered in order to minimize the sum of elements chosen from the given family of finite numerical sequences subject to some constraints on the elements choice. Namely, given the family of L numerical nonnegative N-element sequences and a positive integer J, it is required to minimize the sum of J intra-sums. Each element corresponds to one element in one of L input sequences, and all possible L-permutations are admissible in this one-to-one correspondence in each intra-sum of L elements. In addition, there are some constraints on the indices of the summed sequence elements. The problem solution is a pair of tuples, namely, (1) a tuple of J permutations on L elements, and (2) a tuple of JL increasing indices. The paper presents an exact polynomial-time algorithm with O(N 5 ) running time for this problem. In particular, the problem is induced by an applied problem of noiseproof searching for repetitions of the given tuple of elements with their possible permutations at each tuple repeat, and finding the positions of these elements in the numerical sequence distorted by noise under some constraints on unknown positions of elements. The applied problem noted is related, for example, to the remote monitoring of several moving objects with possible arbitrary displacements (permutations) of these objects.

Original languageEnglish
Title of host publicationAnalysis of Images, Social Networks and Texts - 7th International Conference, AIST 2018, Revised Selected Papers
EditorsAlexander Panchenko, Wil M. van der Aalst, Michael Khachay, Panos M. Pardalos, Vladimir Batagelj, Natalia Loukachevitch, Goran Glavaš, Dmitry I. Ignatov, Sergei O. Kuznetsov, Olessia Koltsova, Irina A. Lomazova, Andrey V. Savchenko, Amedeo Napoli, Marcello Pelillo
PublisherSpringer-Verlag GmbH and Co. KG
Pages305-317
Number of pages13
ISBN (Print)9783030110260
DOIs
Publication statusPublished - 1 Jan 2018
Event7th International Conference on Analysis of Images, Social Networks and Texts, AIST 2018 - Moscow, Russian Federation
Duration: 5 Jul 20187 Jul 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11179 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Conference on Analysis of Images, Social Networks and Texts, AIST 2018
CountryRussian Federation
CityMoscow
Period05.07.201807.07.2018

Keywords

  • Exact polynomial-time algorithm
  • Finite numerical sequences
  • Optimal summing
  • Permutations

Fingerprint

Dive into the research topics of 'On a problem of summing elements chosen from the family of finite numerical sequences'. Together they form a unique fingerprint.

Cite this