<\/div>\n

<\/p>\n

Title: Non-adaptive Testing of Graphical Multi-User Relationships over Noisy Multi-Access Boolean Channels with a Probabilistic Approach<\/strong><\/p>\n

\u8bb2<\/strong>\u5ea7<\/strong>\u65f6\u95f4<\/strong>\uff1a<\/strong>2016<\/strong>\u5e74<\/strong>6<\/strong>\u6708<\/strong>6<\/strong>\u65e5\uff08\u661f\u671f\u4e00\uff09\u4e0b\u5348<\/strong>14:30-15:30<\/strong><\/p>\n

\u8bb2<\/strong>\u5ea7\u5730\u70b9\uff1a<\/strong>\u6d77\u97f5\u6559\u5b66\u697c305<\/strong><\/p>\n

Abstract:\u00a0<\/strong> Group testing and compressive sensing have attracted a significant amount of attention lately. Their primary goal is to identify a relatively small set of users in a much larger group by selectively pooling and testing using a much lower dimensional data. Both of them have found numerous applications in a variety of areas including DNA library screening, software testing, and multiple-access communications, to name a few.\u00a0 Inspired by such sparse testing problems, in this work, we propose a novel non-adaptive testing framework under which we want to efficiently identify a set of active users whose pair-wise relationship can be featured in a two-colorable graph. The testing output is determined by the pair-wise Boolean operations restricted by such graph, as well as the underlying noisy Boolean MAC channel. An achievable lower bound on detection time for constructing such a two-colorable graph is found by adopting a probabilistic encoding approach, as well as a general decoding method based on strong typical set and joint decision ideas.<\/p>\n

Under our models, non-adaptive group testing can be treated as a special case of the proposed problem with the final relationship of active users represented by a single edge, when there are only two active users to be detected.\u00a0 In addition, our formulation can find applications in detecting graphical relationship between cooperating agents in multi-user networks such as public safety and social networks, and establishing partitioned groups for scheduling purposes in multiple access channels.<\/p>\n

\u62a5\u544a\u4eba\u7b80\u5386<\/strong>\uff1a\u9b4f\u53cc<\/strong>\u5e86<\/strong>\u535a\u58eb1990\u81f31998\u5e74\u5c31\u8bfb\u4e8e\u6e05\u534e\u5927\u5b66\u7535\u5b50\u5de5\u7a0b\u7cfb\uff0c\u5e76\u57281995\u5e74\u548c1998\u5e74\u5206\u522b\u83b7\u5f97\u5de5\u5b66\u5b66\u58eb\u548c\u5de5\u5b66\u7855\u58eb\u5b66\u4f4d\u30021998\u5e74\u83b7\u5f97\u5168\u989d\u5956\u5b66\u91d1\u8d74\u7f8e\u5c31\u8bfb\u4e8e\u9a6c\u8428\u8bf8\u585e\u5927\u5b66\u963f\u9ed8\u65af\u7279\u5206\u6821\u7535\u673a\u5de5\u7a0b\u7cfb\u30022003\u5e74\u83b7\u5f97\u5de5\u5b66\u535a\u58eb\u5b66\u4f4d\uff0c\u5e76\u4e8e\u540c\u5e74\u516b\u6708\u6765\u5230\u8def\u6613\u65af\u5b89\u90a3\u5dde\u7acb\u5927\u5b66\uff0c\u7535\u673a\u5de5\u7a0b\u548c\u8ba1\u7b97\u673a\u5b66\u9662\u4efb\u6559\u30022009\u5e74\u5f97\u5230\u7ec8\u8eab\u6559\u6388\u804c\u4f4d\uff0c2013\u5e74\u83b7\u5f97Michael B. Voorhies \u6770\u51fa\u6559\u6388\u5934\u8854\u3002 \u79d1\u7814\u5174\u8da3\u6db5\u76d6\u901a\u4fe1\u3001\u4fe1\u606f\u548c\u7f51\u7edc\u79d1\u5b66\u7684\u57fa\u7840\u7406\u8bba\uff0c\u4ee5\u53ca\u5927\u6570\u636e\u80cc\u666f\u4e0b\u673a\u5668\u5b66\u4e60\u548c\u4fe1\u606f\u3001\u534f\u540c\u79d1\u5b66\u4ee5\u53ca\u7f51\u7edc\u5b89\u5168\u7684\u4ea4\u53c9\u5e94\u7528\u95ee\u9898\u3002<\/p>\n

\u9b4f\u535a\u58eb\u5728\u901a\u4fe1\u548c\u4fe1\u606f\u9886\u57df\u7684\u56fd\u9645\u9876\u7ea7\u671f\u520a\u548c\u4f1a\u8bae\u4e0a\u5df2\u53d1\u8868\u6587\u7ae090\u4f59\u7bc7\u3002\u66fe\u62c5\u4efb IEEE Transactions on Wireless Communications \u548c IEEE Transactions on Vehicular Technology \u7684\u7f16\u59d4\uff0c\u76ee\u524d\u62c5\u4efbIEEE Access \u7684\u7f16\u59d4\u3002\u9b4f\u535a\u58eb\u7ecf\u5e38\u62c5\u4efbIEEE\u9876\u7ea7\u901a\u4fe1\u7c7b\u4f1a\u8bae\u7684 Technical Program Committee (TPC) \u59d4\u5458\uff0c\u5305\u62ec ICC, Globecom, WCNC, MILCOM\u3002\u9b4f\u535a\u58eb\u8fd8\u5e38\u88ab\u9080\u8bf7\u5ba1\u9605\u4fe1\u606f\u7c7bIEEE\u9876\u7ea7\u671f\u520a\u7684\u6587\u7ae0\uff0c\u5305\u62ecIEEE Transactions on Information Theory, IEEE Transactions on Communications, IEEE Transactions on Mobile Computing, IEEE Transactions on Signal Processing.\u00a0 \u53e6\u5916\uff0c\u9b4f\u535a\u58eb\u8fd8\u88ab\u9080\u8bf7\u4e3a\u7f8e\u56fd\u56fd\u5bb6\u81ea\u7136\u79d1\u5b66\u57fa\u91d1\u63d0\u4f9b\u4e13\u5bb6\u8bc4\u5ba1\u610f\u89c1\u3002<\/p>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"