View in EDS HTML Full Text PDF Full Text

Worst-case asymmetric distributed function computation.

Saved in:
Bibliographic Details
Title: Worst-case asymmetric distributed function computation.
Authors: Agnihotri, Samar1 (AUTHOR) samar.agnihotri@gmail.com, Venkatachalapathy, Rajesh2 (AUTHOR)
Source: International Journal of General Systems. Apr2013, Vol. 42 Issue 3, p268-293. 26p. 5 Diagrams, 2 Charts.
Subjects: Wireless sensor networks, Mathematical functions software, Wireless communications, Telecommunication systems, Information resources, Set theory
Abstract: We consider a distributed function computation problem where an information sink communicates withNcorrelated information sources to compute a given deterministic function of source data. A data-vectoris drawn from a discrete and finite probability distributionand componentxiis revealed toith,, source. We address this problem inasymmetric communicationscenarios where only the sink knows the distribution P. We are interested in computing the minimum number of source bits required,in the worst-case, to solve this problem. We propose the notion offunctional ambiguityto carry out the worst-case information-theoretic analysis of distributed function computation problems. We establish its various characteristics and prove that it leads to a valid information measure. Then, we provide a constructive solution for the distributed function computation problem in terms of an interactive communication protocol and prove its optimality. Finally, we establish two equivalence classes ofcompressibleandincompressiblefunctions to classify the set of all computable multivariate functions based on the minimum number of source bits needed in the worst-case to compute a function in the distributed function computation set-up. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of General Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 84918902
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Worst-case asymmetric distributed function computation.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Agnihotri%2C+Samar%22">Agnihotri, Samar</searchLink><relatesTo>1</relatesTo> (AUTHOR)<i> samar.agnihotri@gmail.com</i><br /><searchLink fieldCode="AR" term="%22Venkatachalapathy%2C+Rajesh%22">Venkatachalapathy, Rajesh</searchLink><relatesTo>2</relatesTo> (AUTHOR)
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22International+Journal+of+General+Systems%22">International Journal of General Systems</searchLink>. Apr2013, Vol. 42 Issue 3, p268-293. 26p. 5 Diagrams, 2 Charts.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Wireless+sensor+networks%22">Wireless sensor networks</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematical+functions+software%22">Mathematical functions software</searchLink><br /><searchLink fieldCode="DE" term="%22Wireless+communications%22">Wireless communications</searchLink><br /><searchLink fieldCode="DE" term="%22Telecommunication+systems%22">Telecommunication systems</searchLink><br /><searchLink fieldCode="DE" term="%22Information+resources%22">Information resources</searchLink><br /><searchLink fieldCode="DE" term="%22Set+theory%22">Set theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: We consider a distributed function computation problem where an information sink communicates withNcorrelated information sources to compute a given deterministic function of source data. A data-vectoris drawn from a discrete and finite probability distributionand componentxiis revealed toith,, source. We address this problem inasymmetric communicationscenarios where only the sink knows the distribution P. We are interested in computing the minimum number of source bits required,in the worst-case, to solve this problem. We propose the notion offunctional ambiguityto carry out the worst-case information-theoretic analysis of distributed function computation problems. We establish its various characteristics and prove that it leads to a valid information measure. Then, we provide a constructive solution for the distributed function computation problem in terms of an interactive communication protocol and prove its optimality. Finally, we establish two equivalence classes ofcompressibleandincompressiblefunctions to classify the set of all computable multivariate functions based on the minimum number of source bits needed in the worst-case to compute a function in the distributed function computation set-up. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of International Journal of General Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=84918902
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1080/03081079.2012.708342
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 26
        StartPage: 268
    Subjects:
      – SubjectFull: Wireless sensor networks
        Type: general
      – SubjectFull: Mathematical functions software
        Type: general
      – SubjectFull: Wireless communications
        Type: general
      – SubjectFull: Telecommunication systems
        Type: general
      – SubjectFull: Information resources
        Type: general
      – SubjectFull: Set theory
        Type: general
    Titles:
      – TitleFull: Worst-case asymmetric distributed function computation.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Agnihotri, Samar
      – PersonEntity:
          Name:
            NameFull: Venkatachalapathy, Rajesh
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr2013
              Type: published
              Y: 2013
          Identifiers:
            – Type: issn-print
              Value: 03081079
          Numbering:
            – Type: volume
              Value: 42
            – Type: issue
              Value: 3
          Titles:
            – TitleFull: International Journal of General Systems
              Type: main
ResultId 1