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

arXiv 2019年

作者： Yang, Zhaohui Chen, Mingzhe Saad, Walid Shikh-Bahaei, Mohammad Centre for Telecommunications Research Department of Informatics Kings College London WC2B 4BG United Kingdom Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China Wireless@VT Bradley Department of Electrical and Computer Engineering Virginia Tech BlacksburgVA United States

In this paper, the sum-rate maximization problem is studied for wireless networks that use downlink rate splitting multiple access (RSMA). In the considered model, each base station (BS) divides the messages that must be transmitted to its users into a "private" part and a "common" part. Here, the common message is a message that all users want to receive and the private message is a message that is dedicated to only a specific user. The RSMA mechanism enables a BS to adjust the split of common and private messages so as to control the interference by decoding and treating interference as noise and, thus optimizing the data rate of users. To maximize the users' sum-rate, the network can determine the rate allocation for the common message to meet the rate demand, and adjust the transmit power for the private message to reduce the interference. This problem is formulated as an optimization problem whose goal is to maximize the sum-rate of all users. To solve this nonconvex maximization problem, the optimal power used for transmitting the private message to the users is first obtained in closed form for a given rate allocation and common message power. Based on the optimal private message transmission power, the optimal rate allocation is then derived under a fixed common message transmission power. Subsequently, a one-dimensional search algorithm is proposed to obtain the optimal solution of common message transmission power. Simulation results show that the RSMA can achieve up to 15.6% and 21.5% gains in terms of data rate compared to non-orthogonal multiple access (NOMA) and orthogonal frequency-division multiple access (OFDMA), respectively. Copyright © 2019, The Authors. All rights reserved.

关键词： Power control

来源：评论

学校读者我要写书评

暂无评论

A Sparse Superposition Multiple Access Scheme and Performance Analysis for 5G Wireless Communication Systems

A Sparse Superposition Multiple Access Scheme and Performanc...

引用

IEEE International Conference on Communications in China Workshops (ICCC)

作者： Kai Zhang Jin Xu Changchuan Yin Weiqiang Tan Chunguo Li Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China School of Computer and Communication Engineering Zhengzhou University of Light Industry Zhengzhou China School of Computer Science Guangzhou University Guangzhou China National Communications Research Laboratory Southeast University Nanjing China

ISBN: (纸本)9781538670125;9781538670118

Orthogonal multiple access (OMA) is widely employed in traditional cellular wireless communication systems due to a low-complexity receiver is needed. However, multiple access scheme with higher spectral efficiency and the capability of access more users than OMA scheme is preferred for the future wireless communication systems. In this work, we propose a non-orthogonal multiple access scheme called sparse superposition multiple access (SSMA) by superposing more users to a limited number of time-frequency resource for the uplink transmission in the fifth generation (5G) wireless communication systems. Moreover, we design two sparse superposition matrices (SSMs) for 150% and 200% overloaded SSMA scheme. Then, a low complexity belief propagation detection and decoding algorithm based multiple user detection is proposed. Furthermore, we utilize extrinsic information transfer chart to analyze the superiority of the proposed SSMs theoretically and the numerical results show that the proposed SSM with an overload of 150% has a gain of about 1 dB compared to the existing scheme. Finally, simulation results demonstrate that the proposed scheme outperforms the traditional OMA scheme and the existing scheme significantly.

关键词： Multiuser detection Wireless communication Conferences Convergence Maximum likelihood decoding Message passing Receivers

来源：评论

学校读者我要写书评

暂无评论

Find Your Online Social Friends from Mobile Internet Traffic

Find Your Online Social Friends from Mobile Internet Traffic

引用

IEEE International Conference on network Infrastructure and Digital Content (IC-NIDC)

作者： Yi Zhang Yuanyuan Qiao Yanting Zhang Nanfei Shu Yizhe Song Jie Yang Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing China Technology Research Institute Aisino Corporation Beijing China School of Electronic Engineering and Computer Science Queen Mary University of London London England

Increasingly more mobile Internet traffic is produced which contains ample personal information related to user mobility and website browsing behavior. Prior research has attempted to recommend friends based on Global Position System (GPS) in location based social networks (LBSN). However, the study of friend recommendation in general social network according to position from the base station is relatively understudied. This paper introduces a novel feature set extracted from mobile Internet traffic according to base station location and Uniform Resource Locator (URL). We train classification models using these features to predict friendship between pairs of Weibo users. Results show that both base station location and URL when acted alone can already effectively reflect friendships even in general social network. We further show that by fusing the two features together, the model obtains even better performance. Finally, we demonstrate that the location and URL features can improve prediction performance than only using the common friends.

关键词： Uniform resource locators Feature extraction Social network services Base stations Internet Global Positioning System Predictive models

来源：评论

学校读者我要写书评

暂无评论

Research on I/Q unbalanced channel reciprocity calibration algorithm in massive MIMO system 3

Research on I/Q unbalanced channel reciprocity calibration a...

引用

3rd International Conference on Mechanical, Electronic and Information Technology Engineering, ICMITE 2017

作者： Cui, Jinming Yin, Liang Ma, Yue Li, Shufang Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China School of Computer Science Beijing University of Posts and Telecommunications Beijing100876 China

Massive MIMO system uses the transmitter channel state information (CSI) to preprocess the transmitted data, which can effectively reduce the interference and enhance the Massive MIMO system capacity. In the actual transmission process, reciprocity is subject to many factors, resulting in application difficulties. In this paper, we mainly study the influence of RF device's noncardiosis on channel reciprocity of Massive MIMO system. Combined with channel estimation based on pilot signal and FRRH subspace tracking algorithm, this paper proposes a channel reciprocity calibration method for Massive MIMO. Finally, the compensation effect of the compensation algorithm is verified by simulation. © The Authors, published by EDP Sciences, 2017.

关键词： MIMO systems

来源：评论

学校读者我要写书评

暂无评论

Signal Recognition Based on Signal Power Spectrum Fitting Feature Extraction

引用

Beijing Youdian Daxue Xuebao/Journal of Beijing University of Posts and Telecommunications 2018年第2期41卷 114-118页

作者： Tian, Hao-Min Yin, Liang Ma, Yue Li, Shu-Fang Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China Computer Network Research Center Beijing University of Posts and Telecommunications Beijing100876 China School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing100876 China

Aiming at the problem of communication signal service type identification, the author proposes a polynomial fitting factor that extracts the power spectrum of the signal using the linear regression algorithm and the polynomial fitting model in machine learning field as a unified feature of the signal to construct the training set. A multi-layer fully connected neural network classifier model was built on depth learning platform. Compared with the traditional ones, this method has advantages of unifying the radio signal without the need of individual service to extract the personalized features. The power spectrum data of code division multiple access(CDMA) uplink, CDMA downlink, extended global system for mobile(EGSM) uplink, EGSM downlink, wireless local area networks (WLAN) and long time evolution (LTE) signals in the actual radio monitoring data are selected as data set, and 97% classification accuracy is verified. that this method is proven feasible. © 2018, Editorial Department of Journal of Beijing University of Posts and Telecommunications. All right reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A joint learning and communications framework for federated learning over wireless networks

arXiv

引用

arXiv 2019年

作者： Chen, Mingzhe Yang, Zhaohui Saad, Walid Yin, Changchuan Vincent Poor, H. Cui, Shuguang Chinese University of Hong Kong Shenzhen518172 China Department of Electrical Engineering Princeton University PrincetonNJ08544 United States Centre for Telecommunications Research Department of Informatics King's College London WC2B 4BG United Kingdom Bradley Department of Electrical and Computer Engineering Virginia Tech BlacksburgVA24060 United States Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China Department of Electrical Engineering Princeton University PrincetonNJ08544 United States Shenzhen Research Institute of Big Data School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China

In this paper, the problem of training federated learning (FL) algorithms over a realistic wireless network is studied. In particular, in the considered model, wireless users execute an FL algorithm while training their local FL models using their own data and transmitting the trained local FL models to a base station (BS) that will generate a global FL model and send it back to the users. Since all training parameters are transmitted over wireless links, the quality of the training will be affected by wireless factors such as packet errors and the availability of wireless resources. Meanwhile, due to the limited wireless bandwidth, the BS must select an appropriate subset of users to execute the FL algorithm so as to build a global FL model accurately. This joint learning, wireless resource allocation, and user selection problem is formulated as an optimization problem whose goal is to minimize an FL loss function that captures the performance of the FL algorithm. To address this problem, a closed-form expression for the expected convergence rate of the FL algorithm is first derived to quantify the impact of wireless factors on FL. Then, based on the expected convergence rate of the FL algorithm, the optimal transmit power for each user is derived, under a given user selection and uplink resource block (RB) allocation scheme. Finally, the user selection and uplink RB allocation is optimized so as to minimize the FL loss function. Simulation results show that the proposed joint federated learning and communication framework can reduce the FL loss function value by up to 10% and 16%, respectively, compared to: 1) An optimal user selection algorithm with random resource allocation and 2) a standard FL algorithm with random user selection and resource allocation. Copyright © 2019, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

A Pattern Division Multiple Access Scheme with Low Complexity Iterative Receiver for 5G Wireless Communication Systems

A Pattern Division Multiple Access Scheme with Low Complexit...

引用

IEEE Vehicular Technology Conference

作者： Kai Zhang Jin Xu Changchuan Yin Chunyu Pan Weiqiang Tan Guixian Xu Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing 100876 P. R. China Zhengzhou University of Light Industry School of Computer and Communication Engineering Zhengzhou 450001 P. R. China Guangzhou University School of Computer Science and Educational Software Guangzhou 510006 P. R. China Aalborg University Department of Electronic Systems Aalborg 9400 Denmark

ISBN: (纸本)9781538663592;9781538663585

Non-orthogonal multiple access schemes with higher spectral efficiency and the capability of accessing more users than orthogonal multiple access (OMA) scheme is preferred for the fifth generation (5G) wireless networks. In this work, a non-orthogonal transmission scheme called pattern division multiple access (PDMA) is proposed for the 5G wireless communication systems. Two pattern matrices are proposed for 150% and 200% overloaded PDMA systems. Then, a low complexity symbol-wise belief propagation iterative detection and decoding (BPIDD) algorithm for multiple user detection is proposed. Numerical results and analysis provided by utilizing extrinsic information transfer chart show that the proposed scheme outperforms the traditional OMA systems significantly, and the performance of the proposed scheme is better than that of the existing schemes up to 1 dB. Finally, simulation results show that the proposed scheme is superior to the existing schemes and the proposed BPIDD algorithm is better than that of the BP algorithm over 0.5 dB.

关键词： 5G mobile communication iterative decoding matrix algebra multi-access systems multiuser detection Multi access systems matrix algebra Multiuser detection Iterative decoding multiple access Wireless communication systems Scheme iterative receiver spectral efficiency Information Transfer

来源：评论

学校读者我要写书评

暂无评论

Federated Echo State Learning for Minimizing Breaks in Presence in Wireless Virtual Reality networks

arXiv

引用

arXiv 2018年

作者： Chen, Mingzhe Semiari, Omid Saad, Walid Liu, Xuanlin Yin, Changchuan Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China Chinese University of Hong Kong Shenzhen518172 China Department of Electrical Engineering Princeton University PrincetonNJ08544 United States Department of Electrical and Computer Engineering University of Colorado Colorado Springs Colorado SpringsCO80918 United States Wireless@VT Bradley Department of Electrical and Computer Engineering Virginia Tech BlacksburgVA24060 United States

In this paper, the problem of enhancing the virtual reality (VR) experience for wireless users is investigated by minimizing the occurrence of breaks in presence (BIP) that can detach the users from their virtual world. To measure the BIP for wireless VR users, a novel model that jointly considers the VR application type, transmission delay, VR video quality, and users’ awareness of the virtual environment is proposed. In the developed model, the base stations (BSs) transmit VR videos to the wireless VR users using directional transmission links so as to provide high data rates for the VR users, thus, reducing the number of BIP for each user. Since the body movements of a VR user may result in a blockage of its wireless link, the location and orientation of VR users must also be considered when minimizing BIP. The BIP minimization problem is formulated as an optimization problem which jointly considers the predictions of users’ locations, orientations, and their BS association. To predict the orientation and locations of VR users, a distributed learning algorithm based on the machine learning framework of deep (ESNs) is proposed. The proposed algorithm uses concept from federated learning to enable multiple BSs to locally train their deep ESNs using their collected data and cooperatively build a learning model to predict the entire users’ locations and orientations. Using these predictions, the user association policy that minimizes BIP is derived. Simulation results demonstrate that the developed algorithm reduces the users’ BIP by up to 16% and 26%, respectively, compared to centralized ESN and deep learning algorithms. Copyright © 2018, The Authors. All rights reserved.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

Portable Acceleration of CMS Computing Workflows with Coprocessors as a Service

引用

Computing and Software for Big Science 2024年第1期8卷 1-36页

作者： Hayrapetyan, A. Tumasyan, A. Adam, W. Andrejkovic, J.W. Bergauer, T. Chatterjee, S. Damanakis, K. Dragicevic, M. Hussain, P.S. Jeitler, M. Krammer, N. Li, A. Liko, D. Mikulec, I. Schieck, J. Schöfbeck, R. Schwarz, D. Sonawane, M. Templ, S. Waltenberger, W. Wulz, C.-E. Darwish, M.R. Janssen, T. Mechelen, P. Van Bols, E.S. D’Hondt, J. Dansana, S. De Moor, A. Delcourt, M. Faham, H. El Lowette, S. Makarenko, I. Müller, D. Sahasransu, A.R. Tavernier, S. Tytgat, M. Onsem, G. P. Van Putte, S. Van Vannerom, D. Clerbaux, B. Das, A.K. De Lentdecker, G. Favart, L. Gianneios, P. Hohov, D. Jaramillo, J. Khalilzadeh, A. Khan, F.A. Lee, K. Mahdavikhorrami, M. Malara, A. Paredes, S. Thomas, L. Bemden, M. Vanden Velde, C. Vander Vanlaer, P. De Coen, M. Dobur, D. Hong, Y. Knolle, J. Lambrecht, L. Mestdach, G. Amarilo, K. Mota Rendón, C. Samalan, A. Skovpen, K. Bossche, N. Van Den Linden, J. van der Wezenbeek, L. Benecke, A. Bethani, A. Bruno, G. Caputo, C. Delaere, C. Donertas, I.S. Giammanco, A. Jaffel, K. Jain, Sh. Lemaitre, V. Lidrych, J. Mastrapasqua, P. Mondal, K. Tran, T.T. Wertz, S. Alves, G.A. Coelho, E. Hensel, C. De Oliveira, T. Menezes Moraes, A. Teles, P. Rebello Soeiro, M. Júnior, W. L. Aldá Pereira, M. Alves Gallo Filho, M. Barroso Ferreira Malbouisson, H. Brandao Carvalho, W. Chinellato, J. Da Costa, E.M. Da Silveira, G.G. De Jesus Damiao, D. De Souza, S. Fonseca De Souza, R. Gomes Martins, J. Herrera, C. Mora Mundim, L. Nogima, H. Pinheiro, J.P. Santoro, A. Sznajder, A. Thiel, M. Pereira, A. Vilela Bernardes, C.A. Calligaris, L. Tomei, T. R. Fernandez Perez Gregores, E.M. Mercadante, P.G. Novaes, S.F. Orzari, B. Padula, Sandra S. Aleksandrov, A. Antchev, G. Hadjiiska, R. Iaydjiev, P. Misheva, M. Shopova, M. Sultanov, G. Dimitrov, A. Litov, L. Pavlov, B. Petkov, P. Petrov, A. Shumka, E. Keshri, S. Thakur, S. Cheng, T. Javaid, T. Yuan, L. Hu, Z. Liu, J. Yi, K. Chen, G.M. Chen, H.S. Chen, M. Iemmi, F. Jiang, C.H. Kapoor, A. Liao, H. Liu, Z.-A. Sharma, R. Song, J.N. Tao, J. Wang, C. Wang, J. Wang, Z. Zhang, H. Agapitos Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Vienna Austria Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium 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 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 State Key Laboratory of Nuclear Physics and Technology Peking University Beijing 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 Zhejiang University Hangzhou Zhejiang China Universidad de Los Andes Bogota Colombia Universidad de Antioquia Medellin Colombia University of Split Faculty of Electrical Engineering Mechanical Engineering and Naval Architecture Split Croatia Faculty of Science University of Split Split Croatia Institute Rudjer Boskovic Zagreb Croatia University of Cyprus Nicosia Cyprus Charles University Prague Czech Republic Escuela Politecnica Nacional Quito Ecuador Universidad San Francisco de Quito Quito Ecuador Academy of Scientific Research and Technology of the Arab Republic of Egypt Egyptian Network of High Energy Physics Cairo Egypt Center for High Energy Physics (CHEP-FU) Fayoum University El-Fayoum Egypt National Institute of Chemical Physics and Biophysic

Computing demands for large scientific experiments, such as the CMS experiment at the CERN LHC, will increase dramatically in the next decades. To complement the future performance increases of software running on central processing units (CPUs), explorations of coprocessor usage in data processing hold great potential and interest. Coprocessors are a class of computer processors that supplement CPUs, often improving the execution of certain functions due to architectural design choices. We explore the approach of Services for Optimized network Inference on Coprocessors (SONIC) and study the deployment of this as-a-service approach in large-scale data processing. In the studies, we take a data processing workflow of the CMS experiment and run the main workflow on CPUs, while offloading several machine learning (ML) inference tasks onto either remote or local coprocessors, specifically graphics processing units (GPUs). With experiments performed at Google Cloud, the Purdue Tier-2 computing center, and combinations of the two, we demonstrate the acceleration of these ML algorithms individually on coprocessors and the corresponding throughput improvement for the entire workflow. This approach can be easily generalized to different types of coprocessors and deployed on local CPUs without decreasing the throughput performance. We emphasize that the SONIC approach enables high coprocessor usage and enables the portability to run workflows on different types of coprocessors. © The Author(s) 2024.

关键词： CMS Machine learning Offline and computing

来源：评论

学校读者我要写书评

暂无评论

The CMS Statistical Analysis and Combination Tool: Combine

引用

Computing and Software for Big Science 2024年第1期8卷 1-45页

作者： Zhokin, A. Zhizhin, I. Zarubin, A. Yuldashev, B.S. Voytishin, N. Vorotnikov, G. Vorobyev, A. Volkov, P. Uzunian, A. Uvarov, L. Toropin, A. Tlisova, I. Teryaev, O. Terkulov, A. Tcherniaev, E. Sulimov, V. Sosnov, D. Smirnov, V. Slabospitskii, S. Skovpen, Y. Shulha, S. Shmatov, S. Shalaev, V. Savrin, V. Savina, M. Radchenko, O. Popov, V. Polikarpov, S. Perfilov, M. Perelygin, V. Palichik, V. Oreshkin, V. Obraztsov, S. Nikitenko, A. Murzin, V. Matveev, V. Malakhov, A. Makarenko, V. Lychkovskaya, N. Levchenko, P. Lanev, A. Krasnikov, N. Kozyrev, A. Korenkov, V. Konstantinov, D. Kodolova, O. Klyukhin, V. Kirsanov, M. Kirpichnikov, D. Kirakosyan, M. Kim, V. Karneyeu, A. Karjavine, V. Kachanov, V. Ivanov, Y. Gribushin, A. Gorbunov, I. Golutvin, I. Golubev, N. Golovtcov, V. Gninenko, S. Gavrilov, V. Gavrilov, G. Dudko, L. Dubinin, M. Druzhkin, D. Dimova, T. Dermenev, A. Chistov, R. Chekhovsky, V. Chadeeva, M. Bunichev, V. Budkouski, D. Borshch, V. Boos, E. Blinov, V. Babaev, A. Azarkin, M. Aushev, T. Andreev, Yu. Andreev, V. Alexakhin, V. Afanasiev, S. Warden, A. Vetens, W. Tsoi, H.F. Teague, D. Smith, W.H. Sharma, V. Shang, V. Savin, A. Pinna, D. Pétré, L. Parida, G. Mondal, S. Mohammadi, A. Mallampalli, A. Sreekala, J. Madhusudanan Loveless, R. Lanaro, A. Koraka, C.K. Herve, A. Herndon, M. He, H. Galloni, C. Everaerts, P. De Bruyn, I. Dasu, S. Bose, T. Black, K. Banerjee, S. Aravind, A. Karchin, P.E. Bhattacharya, S. Neu, C. Ledovskoy, A. Hirosky, R. Hakala, J. Cox, B. Cardwell, B. Viinikainen, J. Velkovska, J. Tuo, S. Sheldon, P. Romeo, F. Melo, A. Elayavalli, R. Kunnawalkam Johns, W. Gurrola, A. Greene, S. Chen, Y. Appelt, E. Volobouev, I. Peltola, T. Mankel, A. Lee, S.W. Lamichhane, K. Kazhykarim, Y. Hussain, A. Hegde, V. Gogate, N. Damgov, J. Akchurin, N. Safonov, A. Rathjens, D. Overton, D. Mueller, R. Luo, S. Kim, H. Kamon, T. Huang, T. Gilmore, J. Eusebi, R. Bouhali, O. Akhter, T. Ahmad, M. Aebi, D. Spanier, S. Nibigira, E. Lee, L. Karunarathna, N. Kanuganti, A.R. Holmes, T. Higginbotham, S. Fiorendi, S. Delannoy Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Vienna Austria Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium 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 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 State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Guangdong Provincial Key Laboratory of Nuclear Science and Guangdong-Hong Kong Joint Laboratory of Quantum Matter South China Normal University Guangzhou China Sun Yat-Sen University Guangzhou China University of Science and Technology of China Hefei China Nanjing Normal University Nanjing China Key Laboratory of Nuclear Physics and Ion-beam Application (MOE) Institute of Modern Physics Fudan University Shanghai China Zhejiang University Hangzhou Zhejiang China Universidad de Los Andes Bogota Venezuela Universidad de Antioquia Medellin Colombia Faculty of Electrical Engineering Mechanical Engineering and Naval Architecture University of Split Split Croatia Faculty of Science University of Split Split Croatia Institute Rudjer Boskovic Zagreb Croatia University of Cyprus Nicosia Cyprus Charles University Prague Czech Republic Universidad San Francisco de Quito Quito Ecuador Egyptian Network of High Energy Physics Academy of Scientific Research and Technology of the Arab Republic of Egypt Cairo Egypt Center for High

This paper describes the Combine software package used for statistical analyses by the CMS Collaboration. The package, originally designed to perform searches for a Higgs boson and the combined analysis of those searches, has evolved to become the statistical analysis tool presently used in the majority of measurements and searches performed by the CMS Collaboration. It is not specific to the CMS experiment, and this paper is intended to serve as a reference for users outside of the CMS Collaboration, providing an outline of the most salient features and capabilities. Readers are provided with the possibility to run Combine and reproduce examples provided in this paper using a publicly available container image. Since the package is constantly evolving to meet the demands of ever-increasing data sets and analysis sophistication, this paper cannot cover all details of Combine. However, the online documentation referenced within this paper provides an up-to-date and complete user guide. © CERN, for the benefit of the CMS Collaboration 2024.

关键词： CMS Combine Higgs Higgs boson Statistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：