检索结果-内蒙古大学图书馆

arXiv 2017年

作者： Chan, Chung Al-Bashabsheh, Ali Zhou, Qiaoqiao Institute of Network Coding Chinese University of Hong Kong Hong Kong Shenzhen Key Laboratory of Network Coding Key Technology and Application China Shenzhen Research Institute Chinese University of Hong Kong China

An agglomerative clustering of random variables is proposed, where clusters of random variables sharing the maximum amount of multivariate mutual information are merged successively to form larger clusters. Compared to the previous info-clustering algorithms, the agglomerative approach allows the computation to stop earlier when clusters of desired size and accuracy are obtained. An efficient algorithm is also derived based on the submodularity of entropy and the duality between the principal sequence of partitions and the principal sequence for submodular functions. Copyright © 2017, The Authors. All rights reserved.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Info-clustering: An efficient algorithm by network information flow

arXiv

引用

arXiv 2017年

作者： Chan, Chung Al-Bashabsheh, Ali Zhou, Qiaoqiao Institute of Network Coding Chinese University of Hong Kong Shenzhen Key Laboratory of Network Coding Key Technology and Application Shenzhen Research Institute Chinese University of Hong Kong Hong Kong center Beihang University Beijing China

Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can group entities into communities using a parametric max-flow algorithm. This is a meaningful special case of the info-clustering paradigm where the dependency structure is graphical and can be learned readily from data. Copyright © 2017, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Secret key agreement under discussion rate constraints

arXiv

引用

arXiv 2017年

作者： Chan, Chung Mukherjee, Manuj Kashyap, Navin Zhou, Qiaoqiao Institute of Network Coding Chinese University of Hong Kong Shenzhen Key Laboratory of Network Coding Key Technology and Application China Shenzhen Research Institute Chinese University of Hong Kong Department of Electrical Communication Engineering Indian Institute of Science Bangalore India

For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to general source model without helpers or wiretapper's side information but can be strengthened for hypergraphical sources. In particular, for the pairwise independent network, the results give rise to a complete characterization of the maximum secret key rate achievable under a constraint on the total discussion rate. Copyright © 2017, The Authors. All rights reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Info-Clustering: A Mathematical Theory for Data Clustering

引用

IEEE Transactions on Molecular, Biological, and Multi-Scale Communications 2016年第1期2卷 64-91页

作者： Chan, Chung Al-Bashabsheh, Ali Zhou, Qiaoqiao Kaced, Tarik Liu, Tie Institute of Network Coding Shenzhen Key Laboratory of Network Coding Key Technology and Application Chinese University of Hong Kong Hong Kong Algorithmic Complexity and Logic Laboratory Université Paris-Est Créteil Créteil France Department of Electrical and Computer Engineering Texas A and M University College StationTX77843 United States

We formulate an info-clustering paradigm based on a multivariate information measure, called multivariate mutual information, that naturally extends Shannon's mutual information between two random variables to the multivariate case involving more than two random variables. With proper model reductions, we show that the paradigm can be applied to study the human genome and connectome in a more meaningful way than the conventional algorithmic approach. Not only can info-clustering provide justifications and refinements to some existing techniques, but it also inspires new computationally feasible solutions. © 2017 IEEE.

关键词： Random variables

来源：评论

学校读者我要写书评

暂无评论

Pan-cancer analysis of somatic mutations across 21 neuroendocrine tumor types

引用

细胞研究（英文版） 2018年第5期28卷 601-604页

作者： Yanan Cao Weiwei Zhou Lin Li Jiaqian Wang Zhibo Gao Yiran Jiang Xiuli Jiang Aijing Shan Matthew H. Bailey Kuan-lin Huang Sam Q. Sun Michael D. McLellan Beifang Niu Weiqing Wang Li Ding Guang Ning Shanghai Clinical Center for Endocrine and Metabolic Diseases Shanghai Key Laboratory for Endocrine Tumors Rui-Jin Hospital Shanghai Jiao Tong University School of Medicine Shanghai China Laboratory of Endocrinology and Metabolism Shanghai Institutes for Biological Sciences Chinese Academy of Sciences Shanghai China Shanghai Clinical Center for Endocrine and Metabolic Diseases Shanghai Key Laboratory for Endocrine Tumors Rui-Jin Hospital Shanghai Jiao Tong University School of Medicine Shanghai China YuceBio Shenzhen China McDonnell Genome Institute Washington University St Louis MO USA Department of Medicine Division of Oncology Washington University St Louis MO USA McDonnell Genome Institute Washington University St Louis MO USA McDonnell Genome Institute Washington University St Louis MO USA Department of High-Performance Computing Technology and Application Development Computer Network Information Center Chinese Academy of Sciences Beijing China McDonnell Genome Institute Washington University St Louis MO USA Department of Medicine Division of Oncology Washington University St Louis MO USA Siteman Cancer Center Washington University St. Louis MO USA

Dear Editor,Neuroendocrine tumors (NETs) comprise a heterogeneous spectrum of neoplasms originating from neuroendocrine cells in various organs — most commonly in the endocrine glands and the gastrointestinal tract.1 The molecular and etiological features of NETs arising from different organs are still far from clarified. Therefore, systematic analysis of genomic alternations and their contribution to core pathways in NETs is urgently needed for the development of novel diagnostic, therapeutic strategies and personalized management of patients. Here, we investigated somatic mutations across 21 NET types through pan-cancer analysis and identified 86 candidate driver genes. Further analysis of druggability and panel sequencing of these genes provide potential diagnostic and therapeutic targets for NETs.

关键词： Cancer genomics Endocrine cancer

来源：评论

学校读者我要写书评

暂无评论

Combination of Measurements of the Top Quark Mass from Data Collected by the ATLAS and CMS Experiments at s=7 and 8 TeV

引用

Physical Review Letters 2024年第26期132卷 261902-261902页

作者： A. Hayrapetyan A. Tumasyan W. Adam J. W. Andrejkovic T. Bergauer S. Chatterjee K. Damanakis M. Dragicevic P. S. Hussain M. Jeitler N. Krammer A. Li D. Liko I. Mikulec J. Schieck R. Schöfbeck D. Schwarz M. Sonawane S. Templ W. Waltenberger C.-E. Wulz M. R. Darwish T. Janssen P. Van Mechelen E. S. Bols J. D’Hondt S. Dansana A. De Moor M. Delcourt H. El Faham S. Lowette I. Makarenko D. Müller A. R. Sahasransu S. Tavernier M. Tytgat S. Van Putte D. Vannerom B. Clerbaux G. De Lentdecker L. Favart D. Hohov J. Jaramillo A. Khalilzadeh K. Lee M. Mahdavikhorrami A. Malara S. Paredes L. Pétré N. Postiau L. Thomas M. Vanden Bemden C. Vander Velde P. Vanlaer M. De Coen D. Dobur Y. Hong J. Knolle L. Lambrecht G. Mestdach C. Rendón A. Samalan K. Skovpen N. Van Den Bossche J. van der Linden L. Wezenbeek A. Benecke G. Bruno C. Caputo C. Delaere I. S. Donertas A. Giammanco K. Jaffel Sa. Jain V. Lemaitre J. Lidrych P. Mastrapasqua K. Mondal T. T. Tran S. Wertz G. A. Alves E. Coelho C. Hensel T. Menezes De Oliveira A. Moraes P. Rebello Teles M. Soeiro W. L. Aldá Júnior M. Alves Gallo Pereira M. Barroso Ferreira Filho H. Brandao Malbouisson W. Carvalho J. Chinellato E. M. Da Costa G. G. Da Silveira D. De Jesus Damiao S. Fonseca De Souza R. Gomes De Souza J. Martins C. Mora Herrera K. Mota Amarilo L. Mundim H. Nogima A. Santoro A. Sznajder M. Thiel A. Vilela Pereira C. A. Bernardes L. Calligaris T. R. Fernandez Perez Tomei E. M. Gregores P. G. Mercadante S. F. Novaes B. Orzari Sandra S. Padula A. Aleksandrov G. Antchev R. Hadjiiska P. Iaydjiev M. Misheva M. Shopova G. Sultanov A. Dimitrov L. Litov B. Pavlov P. Petkov A. Petrov E. Shumka S. Keshri S. Thakur T. Cheng Q. Guo T. Javaid L. Yuan Z. Hu J. Liu K. Yi G. M. Chen H. S. Chen M. Chen F. Iemmi C. H. Jiang A. Kapoor H. Liao Z.-A. Liu R. Sharma J. N. Song J. Tao C. Wang J. Wang Z. Wang H. Zhang A. Agapitos Y. Ban A. Levin C. Li Q. Li Y. Mao S. J. Qian X. Sun D. Wang H. Yang L. Zhang C. Zhou Z. You N. Lu G. Bauer X. Gao D. Leggat H. Okawa Y. Zhang Z. Lin C. Lu M. Xiao C. Avila D. A. Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Vienna Austria Indian Institute of Technology Madras Madras India APC Université Paris Cité CNRS/IN2P3 Paris France Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium Korea University Seoul Korea Ghent University Ghent Belgium Université Catholique de Louvain Louvain-la-Neuve Belgium Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro Brazil Universidade do Estado do Rio de Janeiro Rio de Janeiro Brazil Universidade Estadual Paulista Universidade Federal do ABC São Paulo Brazil Institute for Nuclear Research and Nuclear Energy Bulgarian Academy of Sciences Sofia Bulgaria University of Sofia Sofia Bulgaria IJCLab Université Paris-Saclay CNRS/IN2P3 91405 Orsay France Instituto De Alta Investigación Universidad de Tarapacá Casilla 7 D Arica Chile Beihang University Beijing China Department of Physics Tsinghua University Beijing China Institute of High Energy Physics Beijing China Department of Physics Oxford University Oxford United Kingdom School of Physics and Astronomy Shanghai Jiao Tong University Key Laboratory for Particle Astrophysics and Cosmology (MOE) SKLPPC Shanghai China Department of Physics Chinese University of Hong Kong Shatin N.T. Hong Kong China Department of Physics University of Michigan Ann Arbor Michigan USA State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Department of Modern Physics and State Key Laboratory of Particle Detection and Electronics University of Science and Technology of China Hefei China Department of Physics Nanjing University Nanjing China Sun Yat-Sen University Guangzhou China University of Science and Technology of China Hefei China Nanjing Normal University Nanjing China Institute of Modern Physics and Key Laboratory of Nuclear Physics and Ion-beam Application (MOE)—Fudan University Shanghai China Zhe

A combination of fifteen top quark mass measurements performed by the ATLAS and CMS experiments at the LHC is presented. The datasets used correspond to an integrated luminosity of up to 5 and 20 fb−1 of proton-proton collisions at center-of-mass energies of 7 and 8 TeV, respectively. The combination includes measurements in top quark pair events that exploit both the semileptonic and hadronic decays of the top quark, and a measurement using events enriched in single top quark production via the electroweak t channel. The combination accounts for the correlations between measurements and achieves an improvement in the total uncertainty of 31% relative to the most precise input measurement. The result is mt=172.52±0.14(stat)±0.30(syst) GeV, with a total uncertainty of 0.33 GeV.

关键词： Top quark Hadron colliders

来源：评论

学校读者我要写书评

暂无评论

Practical inner codes for batched sparse codes in wireless multi-hop networks

arXiv

引用

arXiv 2017年

作者： Zhou, Zhiheng Li, Congduan Yang, Shenghao Guang, Xuan National Key Laboratory of Science and Technology on Communications University of Electronic Science and Technology of China Chengdu China Department of Computer Science City University of Hong Kong Tat Chee Ave. Hong Kong Shenzhen China Institute of Network Coding Chinese University of Hong Kong Hong Kong School of Mathematical Sciences Nankai University Tianjin China

Batched sparse (BATS) code is a promising technology for reliable data transmission in multi-hop wireless networks. As a BATS code consists of an outer code and an inner code that typically is a random linear network code, one main research topic for BATS codes is to design an inner code with good performance in transmission efficiency and complexity. In this paper, this issue is addressed with a focus on the problem of minimizing the total number of packets transmitted by the source and intermediate nodes. Subsequently, the problem is formulated as a mixed integer nonlinear programming (MINLP) problem that is NP-hard in general. By exploiting the properties of inner codes and the incomplete beta function, we construct a nonlinear programming (NLP) problem that gives a valid upper bound on the best performance that can be achieved by any feasible solutions. Moreover, both centralized and decentralized real-time optimization strategies are developed. In particular, the decentralized approach is performed independently by each node to find a feasible solution in linear time with the use of look-up tables. Numerical results show that the gap in performance between our proposed approaches and the upper bound is very small, which demonstrates that all feasible solutions developed in the paper are near-optimal with a guaranteed performance bound. Copyright © 2017, The Authors. All rights reserved.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

Design of router for network on chip based on network coding

Lecture Notes in Electrical Engineering

引用

Lecture Notes in Electrical Engineering 2015年 334卷 1071-1078页

作者： Fu, Xisong Gu, Huaxi Chen, Ke Gao, Rong Zhu, Jian State Key Laboratory of ISN Shenzhen CU-Xidian joint center Xidian University Xi’an710071 China Key Laboratory of Network Coding Key Technology and Application Shenzhen Research Institute The Chinese University of Hong Kong Shenzhen518057 China

network on Chip (NoC) has significantly solved the problem caused by the bus architecture of System on Chip (SoC). The multicast communication will become an increasingly important factor in future NoC-based system. network coding (NC) can help to improve the performance of NoC. In this paper, we design a router architecture based on network coding. The design principle and working process of this new router, especially the coding and decoding modules are discussed in details. Finally, a simulation model of the router is established. © Springer International Publishing Switzerland 2015.

关键词： network-on-chip

来源：评论

学校读者我要写书评

暂无评论

Clustering by Multivariate Mutual Information under Chow-Liu Tree Approximation

Clustering by Multivariate Mutual Information under Chow-Liu...

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Chung Chan Tie Liu the Institute of Network Coding at the Chinese University of Hong Kong the Shenzhen Key Laboratory of Network Coding Key Technology and Application China and the Shenzhen Research Institute of the Chinese University of Hong Kong. the Department of Electrical and Computer Engineering Texas A&M University College Station TX 77843 USA

ISBN: (纸本)9781509018253

This paper considers two mutual-information based approaches for clustering random variables proposed in the literature: clustering by mutual information relevance networks (MIRNs) and clustering by multivariate mutual information (MMI). Despite being two seemingly very different approaches, the derived clustering solutions share very strong structural similarity. Motivated by this curious fact, in this paper we show that there is a precise connection between these two clustering solutions via the celebrated Chow-Liu tree algorithm in machine learning: Under a Chow-Liu tree approximation to the underlying joint distribution, the clustering solutions provided by MIRNs and by MMI are, in fact, identical. This solidifies the heuristic view of clustering by MMI as a natural generalization of clustering by MIRNs from dependency-tree distributions to general joint distributions.

关键词： approaches MRNs MMI

来源：评论

学校读者我要写书评

暂无评论

BATS: network coding in action 52

BATS: Network coding in action

引用

2014 52nd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2014

作者： Yang, Shenghao Yeung, Raymond W. Cheung, Jay H.F. Yin, Hoover H.F. Institute for Interdisciplinary Information Sciences Tsinghua University Beijing China Institute of Network Coding Chinese University of Hong Kong Hong Kong Department of Information Engineering Chinese University of Hong Kong Hong Kong Shenzhen Key Laboratory of Network Coding Key Technology and Application Shenzhen Research Institute Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9781479980093

BATS code is a low-complexity random linear network coding scheme that can achieve asymptotic bandwidth optimality for many types of networks with packet loss. In this paper, we propose a BATS code based network protocol and evaluate the performance by real-device experiments. Our results demonstrate significant ready-to-implement gain of network coding over forwarding in multi-hop network transmission with packet loss. We also propose an improved protocol to handle the practical issues observed in the experiments. © 2014 IEEE.

关键词： network coding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：