Towards the Succinct Representation of m Out of n

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    Combinations of n objects taken m at the time are ubiquitous in a wide range of combinatorial problems. In this paper, we introduce a novel approach to generate combinations from given integer numbers by using a gradient-based algorithm through plural number of CPU and GPU processors. The time complexity is bounded by O(m2) when using a single processor, and bounded by O(mlog m) when using at most O(m/ log m) processors. Relevant computational experiments confirmed the practical efficiency within computationally allowable limits. Our approach offers the building blocks to represent combinations with succinct encoding and complexity being independent of n, which is meritorious when n is very large, or when n is time-varying.

    Original languageEnglish
    Title of host publicationInternet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings
    EditorsAntonio Guerrieri, Jason J. Jung, Giancarlo Fortino, Jingtao Sun, Yang Xiang
    PublisherSpringer-Verlag
    Pages16-26
    Number of pages11
    ISBN (Print)9783030027377
    DOIs
    Publication statusPublished - 2018 Jan 1
    Event11th International Conference on Internet and Distributed Computing Systems, IDCS 2018 - Tokyo, Japan
    Duration: 2018 Oct 112018 Oct 13

    Publication series

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

    Other

    Other11th International Conference on Internet and Distributed Computing Systems, IDCS 2018
    CountryJapan
    CityTokyo
    Period18/10/1118/10/13

    Fingerprint

    Program processors
    Combinatorial Problems
    Computational Experiments
    Building Blocks
    Time Complexity
    Time-varying
    Encoding
    Gradient
    Integer
    Experiments
    Range of data
    Graphics processing unit
    Object

    Keywords

    • Combinations
    • Complexity
    • Optimization
    • Parallel computing
    • Representation
    • Unranking

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Computer Science(all)

    Cite this

    Parque Tenorio, V., & Miyashita, T. (2018). Towards the Succinct Representation of m Out of n. In A. Guerrieri, J. J. Jung, G. Fortino, J. Sun, & Y. Xiang (Eds.), Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings (pp. 16-26). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11226 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-030-02738-4_2

    Towards the Succinct Representation of m Out of n. / Parque Tenorio, Victor; Miyashita, Tomoyuki.

    Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings. ed. / Antonio Guerrieri; Jason J. Jung; Giancarlo Fortino; Jingtao Sun; Yang Xiang. Springer-Verlag, 2018. p. 16-26 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11226 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Parque Tenorio, V & Miyashita, T 2018, Towards the Succinct Representation of m Out of n. in A Guerrieri, JJ Jung, G Fortino, J Sun & Y Xiang (eds), Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11226 LNCS, Springer-Verlag, pp. 16-26, 11th International Conference on Internet and Distributed Computing Systems, IDCS 2018, Tokyo, Japan, 18/10/11. https://doi.org/10.1007/978-3-030-02738-4_2
    Parque Tenorio V, Miyashita T. Towards the Succinct Representation of m Out of n. In Guerrieri A, Jung JJ, Fortino G, Sun J, Xiang Y, editors, Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings. Springer-Verlag. 2018. p. 16-26. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-02738-4_2
    Parque Tenorio, Victor ; Miyashita, Tomoyuki. / Towards the Succinct Representation of m Out of n. Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings. editor / Antonio Guerrieri ; Jason J. Jung ; Giancarlo Fortino ; Jingtao Sun ; Yang Xiang. Springer-Verlag, 2018. pp. 16-26 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{221a5003ed634adb86c77cb192670347,
    title = "Towards the Succinct Representation of m Out of n",
    abstract = "Combinations of n objects taken m at the time are ubiquitous in a wide range of combinatorial problems. In this paper, we introduce a novel approach to generate combinations from given integer numbers by using a gradient-based algorithm through plural number of CPU and GPU processors. The time complexity is bounded by O(m2) when using a single processor, and bounded by O(mlog m) when using at most O(m/ log m) processors. Relevant computational experiments confirmed the practical efficiency within computationally allowable limits. Our approach offers the building blocks to represent combinations with succinct encoding and complexity being independent of n, which is meritorious when n is very large, or when n is time-varying.",
    keywords = "Combinations, Complexity, Optimization, Parallel computing, Representation, Unranking",
    author = "{Parque Tenorio}, Victor and Tomoyuki Miyashita",
    year = "2018",
    month = "1",
    day = "1",
    doi = "10.1007/978-3-030-02738-4_2",
    language = "English",
    isbn = "9783030027377",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer-Verlag",
    pages = "16--26",
    editor = "Antonio Guerrieri and Jung, {Jason J.} and Giancarlo Fortino and Jingtao Sun and Yang Xiang",
    booktitle = "Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings",

    }

    TY - GEN

    T1 - Towards the Succinct Representation of m Out of n

    AU - Parque Tenorio, Victor

    AU - Miyashita, Tomoyuki

    PY - 2018/1/1

    Y1 - 2018/1/1

    N2 - Combinations of n objects taken m at the time are ubiquitous in a wide range of combinatorial problems. In this paper, we introduce a novel approach to generate combinations from given integer numbers by using a gradient-based algorithm through plural number of CPU and GPU processors. The time complexity is bounded by O(m2) when using a single processor, and bounded by O(mlog m) when using at most O(m/ log m) processors. Relevant computational experiments confirmed the practical efficiency within computationally allowable limits. Our approach offers the building blocks to represent combinations with succinct encoding and complexity being independent of n, which is meritorious when n is very large, or when n is time-varying.

    AB - Combinations of n objects taken m at the time are ubiquitous in a wide range of combinatorial problems. In this paper, we introduce a novel approach to generate combinations from given integer numbers by using a gradient-based algorithm through plural number of CPU and GPU processors. The time complexity is bounded by O(m2) when using a single processor, and bounded by O(mlog m) when using at most O(m/ log m) processors. Relevant computational experiments confirmed the practical efficiency within computationally allowable limits. Our approach offers the building blocks to represent combinations with succinct encoding and complexity being independent of n, which is meritorious when n is very large, or when n is time-varying.

    KW - Combinations

    KW - Complexity

    KW - Optimization

    KW - Parallel computing

    KW - Representation

    KW - Unranking

    UR - http://www.scopus.com/inward/record.url?scp=85055672556&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85055672556&partnerID=8YFLogxK

    U2 - 10.1007/978-3-030-02738-4_2

    DO - 10.1007/978-3-030-02738-4_2

    M3 - Conference contribution

    AN - SCOPUS:85055672556

    SN - 9783030027377

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 16

    EP - 26

    BT - Internet and Distributed Computing Systems - 11th International Conference, IDCS 2018, Proceedings

    A2 - Guerrieri, Antonio

    A2 - Jung, Jason J.

    A2 - Fortino, Giancarlo

    A2 - Sun, Jingtao

    A2 - Xiang, Yang

    PB - Springer-Verlag

    ER -