arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0911.3347cs.ITmath.IT
收藏

同位网络中计算对称布尔函数的最优策略

Optimal strategies for computing symmetric Boolean functions in collocated networks

Hemant Kowshik, P. R. Kumar

摘要:

我们解决的问题,找到最佳的战略计算布尔对称函数。我们考虑一个并置网络,其中每个节点的传输可以被每个其他节点听到。每个节点都有一个布尔测量,我们希望计算这些测量的给定布尔函数,误差为零。我们允许块计算,以提高数据融合的效率,并确定最小的最坏情况下的总比特进行通信,以执行所需的计算。我们将注意力限制在对称布尔函数类上,它只依赖于n个测量值中1的个数。我们定义了三类函数,即阈值函数,δ函数和区间函数。对于前两类,我们给出了精确的最优策略;对于区间函数,我们给出了具有最优前常数的阶最优策略。利用这些结果,我们可以描述计算百分位型函数的复杂性,这是非常感兴趣的。在我们的分析中,我们使用的下限从通信复杂性理论,并提供了一个可实现的计划,使用信息理论的工具。

英文摘要:

We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we wish to compute a given Boolean function of these measurements with zero error. We allow for block computation to enhance data fusion efficiency, and determine the minimum worst-case total bits to be communicated to perform the desired computation. We restrict attention to the class of symmetric Boolean functions, which only depend on the number of 1s among the n measurements. We define three classes of functions, namely threshold functions, delta functions and interval functions. We provide exactly optimal strategies for the first two classes, and an order-optimal strategy with optimal preconstant for interval functions. Using these results, we can characterize the complexity of computing percentile type functions, which is of great interest. In our analysis, we use lower bounds from communication complexity theory, and provide an achievable scheme using information theoretic tools.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑