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

Search for Gamma-Ray Spectral Lines from Dark Matter Annihilation up to 100 TeV toward the Galactic Center with MAGIC

学校读者我要写书评

暂无评论

Physical Review Letters 2023年第6期130卷 061002-061002页

作者： H. Abe S. Abe V. A. Acciari T. Aniello S. Ansoldi L. A. Antonelli A. Arbet Engels C. Arcaro M. Artero K. Asano D. Baack A. Babić A. Baquero U. Barres de Almeida J. A. Barrio I. Batković J. Baxter J. Becerra González W. Bednarek E. Bernardini M. Bernardos A. Berti J. Besenrieder W. Bhattacharyya C. Bigongiari A. Biland O. Blanch G. Bonnoli Ž. Bošnjak I. Burelli G. Busetto R. Carosi M. Carretero-Castrillo G. Ceribella Y. Chai A. Chilingarian S. Cikota E. Colombo J. L. Contreras J. Cortina S. Covino G. D’Amico V. D’Elia P. Da Vela F. Dazzi A. De Angelis B. De Lotto A. Del Popolo M. Delfino J. Delgado C. Delgado Mendez D. Depaoli F. Di Pierro L. Di Venere E. Do Souto Espiñeira D. Dominis Prester A. Donini D. Dorner M. Doro D. Elsaesser G. Emery V. Fallah Ramazani L. Fariña A. Fattorini L. Font C. Fruck S. Fukami Y. Fukazawa R. J. García López M. Garczarczyk S. Gasparyan M. Gaug J. G. Giesbrecht Paiva N. Giglietto F. Giordano P. Gliwny N. Godinović J. G. Green D. Green D. Hadasch A. Hahn T. Hassan L. Heckmann J. Herrera D. Hrupec M. Hütten R. Imazawa T. Inada R. Iotov K. Ishio I. Jiménez Martínez J. Jormanainen D. Kerszberg Y. Kobayashi H. Kubo J. Kushida A. Lamastra D. Lelas F. Leone E. Lindfors L. Linhoff S. Lombardi F. Longo R. López-Coto M. López-Moya A. López-Oramas S. Loporchio A. Lorini E. Lyard B. Machado de Oliveira Fraga P. Majumdar M. Makariev G. Maneva N. Mang M. Manganaro S. Mangano K. Mannheim M. Mariotti M. Martínez A. Mas Aguilar D. Mazin S. Menchiari S. Mender S. Mićanović D. Miceli T. Miener J. M. Miranda R. Mirzoyan E. Molina H. A. Mondal A. Moralejo D. Morcuende V. Moreno T. Nakamori C. Nanci L. Nava V. Neustroev M. Nievas Rosillo C. Nigro K. Nilsson K. Nishijima T. Njoh Ekoume K. Noda S. Nozaki Y. Ohtani T. Oka J. Otero-Santos S. Paiano M. Palatiello D. Paneque R. Paoletti J. M. Paredes L. Pavletić M. Persic M. Pihet F. Podobnik P. G. Prada Moroni E. Prandini G. Principe C. Priyadarshi I. Puljak W. Rhode M. Ribó J. Rico C. Righi A. Rugliancich N. Sahakyan T. Saito S. Sakurai K. Satalecka F. G. Sat Japanese MAGIC Group: Institute for Cosmic Ray Research (ICRR) The University of Tokyo Kashiwa 277-8582 Chiba Japan Instituto de Astrofísica de Canarias and Departamento de Astrofísica Universidad de La Laguna E-38200 La Laguna Tenerife Spain National Institute for Astrophysics (INAF) I-00136 Rome Italy Università di Udine and INFN Trieste I-33100 Udine Italy Max-Planck-Institut für Physik D-80805 München Germany Università di Padova and INFN I-35131 Padova Italy Institut de Física d’Altes Energies (IFAE) The Barcelona Institute of Science and Technology (BIST) E-08193 Bellaterra (Barcelona) Spain Technische Universität Dortmund D-44221 Dortmund Germany Croatian MAGIC Group: University of Zagreb Faculty of Electrical Engineering and Computing (FER) 10000 Zagreb Croatia IPARCOS Institute and EMFTEL Department Universidad Complutense de Madrid E-28040 Madrid Spain Centro Brasileiro de Pesquisas Físicas (CBPF) 22290-180 URCA Rio de Janeiro (RJ) Brazil University of Lodz Faculty of Physics and Applied Informatics Department of Astrophysics 90-236 Lodz Poland Instituto de Astrofísica de Andalucía-CSIC Glorieta de la Astronomía s/n 18008 Granada Spain Deutsches Elektronen-Synchrotron (DESY) D-15738 Zeuthen Germany ETH Zürich CH-8093 Zürich Switzerland Università di Pisa and INFN Pisa I-56126 Pisa Italy Universitat de Barcelona ICCUB IEEC-UB E-08028 Barcelona Spain Armenian MAGIC Group: A. Alikhanyan National Science Laboratory 0036 Yerevan Armenia Centro de Investigaciones Energéticas Medioambientales y Tecnológicas E-28040 Madrid Spain Department for Physics and Technology University of Bergen Norway INFN MAGIC Group: INFN Sezione di Catania and Dipartimento di Fisica e Astronomia University of Catania I-95123 Catania Italy INFN MAGIC Group: INFN Sezione di Torino and Università degli Studi di Torino I-10125 Torino Italy INFN MAGIC Group: INFN Sezione di Bari and Dipartimento Interateneo di Fisica dell’Università e del Politecnico di Bari I-70125 Bari Italy

Linelike features in TeV γ rays constitute a “smoking gun” for TeV-scale particle dark matter and new physics. Probing the Galactic Center region with ground-based Cherenkov telescopes enables the search for TeV spectral features in immediate association with a dense dark matter reservoir at a sensitivity out of reach for satellite γ-ray detectors, and direct detection and collider experiments. We report on 223 hours of observations of the Galactic Center region with the MAGIC stereoscopic telescope system reaching γ-ray energies up to 100 TeV. We improved the sensitivity to spectral lines at high energies using large-zenith-angle observations and a novel background modeling method within a maximum-likelihood analysis in the energy domain. No linelike spectral feature is found in our analysis. Therefore, we constrain the cross section for dark matter annihilation into two photons to ⟨σv⟩≲5×10−28 cm3 s−1 at 1 TeV and ⟨σv⟩≲1×10−25 cm3 s−1 at 100 TeV, achieving the best limits to date for a dark matter mass above 20 TeV and a cuspy dark matter profile at the Galactic Center. Finally, we use the derived limits for both cuspy and cored dark matter profiles to constrain supersymmetric wino models.

关键词： Dark matter Gamma ray astronomy Particle dark matter Milky Way Cosmic ray & astroparticle detectors Cosmic rays & astroparticles Electromagnetic radiation astronomy Telescopes

Participant Grouping for Privacy Preservation in Mobile Crowdsensing over Hierarchical Edge Clouds

学校读者我要写书评

暂无评论

Participant Grouping for Privacy Preservation in Mobile Crow...

IEEE International Performance computing and Communications Conference

作者： Ting Li Zhijin Qiu Lijuan Cao Hanshang Li Zhongwen Guo Fan Li Xinghua Shi Yu Wang College of Computing and Informatics University of North Carolina at Charlotte Charlotte USA Institute of Oceanographic Instrumentation Qilu University of Technology Qingdao Shandong China Department of Computer Science and Engineering Ocean University of China Qingdao Shandong China School of Computer Science Beijing Institute of Technology Beijing China

ISBN: (纸本)9781538668092;9781538668085

In mobile crowdsensing (MCS), to select the optimal set of participants for a particular sensing task, the cloud-based MCS platform requires mobile users to submit their bids and their sensing quality data. This can cause privacy breaches. One possible solution is to leverage secure sharing or bidding schemes to protect participants' personal information during selection. However, these schemes suffer from high overheads, poor scalability and more importantly, the group formation has never been studied. To address this issue and to enhance the protection of user privacy, we propose a set of novel privacy-preserving grouping methods, which place participants into small groups over hierarchical edge clouds. By doing this, not only can the participants be hidden in groups, but also the overall privacy-preserving participant selection becomes more scalable. The design goal to minimize the communication cost during secure sharing/bidding within groups, while satisfying each participant's requirement for privacy preservation. For different scenarios and optimization functions, we propose a set of grouping schemes to fulfill this goal. Extensive simulations over both synthetic and real-life datasets illustrate the efficiency of proposed mechanisms.

关键词： Privacy Servers Task analysis Sensors Delays Optimization Data privacy

Limited individual attention and online virality of low-quality information

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Qiu, Xiaoyan Oliveira, Diego F.M. Shirazi, Alireza Sahami Flammini, Alessandro Menczer, Filippo School of Economics and Management Shanghai Institute of Technology China Center for Complex Networks and Systems Research School of Informatics and Computing Indiana University United States Yahoo Research Indiana University Network Science Institute United States

Social media are massive marketplaces where ideas and news compete for our attention [1]. Previous studies have shown that quality is not a necessary condition for online virality [2] and that knowledge about peer choices can distort the relationship between quality and popularity [3]. However, these results do not explain the viral spread of low-quality information, such as the digital misinformation that threatens our democracy [4]. We investigate quality discrimination in a stylized model of online social network, where individual agents prefer quality information, but have behavioral limitations in managing a heavy flow of information. We measure the relationship between the quality of an idea and its likelihood to become prevalent at the system level. We find that both information overload and limited attention contribute to a degradation in the market's discriminative power. A good tradeoff between discriminative power and diversity of information is possible according to the model. However, calibration with empirical data characterizing information load and finite attention in real social media reveals a weak correlation between quality and popularity of information. In these realistic conditions, the model predicts that high-quality information has little advantage over low-quality information. Copyright © 2017, The Authors. All rights reserved.

关键词： Social networking (online)

Toward a tactile internet reference architecture: Vision and progress of the IEEE P1918.1 standard

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Aijaz, Adnan Dawy, Zaher Pappas, Nikolaos Simsek, Meryem Oteafy, Sharief Holland, Oliver Telecommunications Research Laboratory Toshiba Research Europe Ltd. BristolBS1 4ND United Kingdom Faculty of Engineering and Architecture American University of Beirut Lebanon Department of Science and Technology Linköping University Sweden International Computer Science Institute Berkeley BerkeleyCA United States School of Computing DePaul University ChicagoIL United States Department of Informatics King's College London London United Kingdom

The term Tactile Internet broadly refers to a communication network which is capable of delivering control, touch, and sensing/actuation information in real-time. The Tactile Internet is currently a topic of interest for various standardization bodies. The emerging IEEE P1918.1 standards working group is focusing on defining a framework for the Tactile Internet. The main objective of this article is to present a reference architecture for the Tactile Internet based on the latest developments within the IEEE P1918.1 standard. The article provides an in-depth treatment of various architectural aspects including the key entities, the interfaces, the functional capabilities and the protocol stack. A case study has been presented as a manifestation of the architecture. Performance evaluation demonstrates the impact of functional capabilities and the underlying enablers on user-level utility pertaining to a generic Tactile Internet application. Copyright © 2018, The Authors. All rights reserved.

关键词： 5G mobile communication systems

Efficiently decodable non-adaptive threshold group testing

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Bui, Thach V. Kuribayashi, Minoru Cheraghchi, Mahdi Echizen, Isao Hayama Kanagawa Japan Graduate School of Natural Science and Technology Okayama University Okayama Japan Department of Computing Imperial College London United Kingdom National Institute of Informatics Tokyo Japan

We consider non-adaptive threshold group testing for identification of up to d defective items in a set of n items, where a test is positive if it contains at least 2 ≤ u ≤ d defective items, and negative otherwise. The defective items can be identified using t = (equation presented) tests with probability at least 1 − Ε for any Ε > 0 or t = O (equation presented) tests with probability 1. The decoding time is t × poly(d2 log n). This result significantly improves the best known results for decoding non-adaptive threshold group testing: O(n log n + n log 1 Ε ) for probabilistic decoding, where Ε > 0, and O(nu log n) for deterministic decoding. Copyright © 2017, The Authors. All rights reserved.

关键词： Decoding

Discussion of RAMCloud storage based on NUMA architecture 29

学校读者我要写书评

暂无评论

Discussion of RAMCloud storage based on NUMA architecture

29th International Conference on Computer Applications in Industry and Engineering, CAINE 2016

作者： Zhang, Jian Wang, Mei Wu, Huanmei School of Computer Engineering Shenzhen Polytechnic ShenzhenGuangdong518055 China School of Engineering and Technology School of Informatics and Computing IUPUI IndianapolisIN46074 United States

ISBN: (纸本)9781943436040

This paper discusses the current situation, development, relevant research and comparison of the cloud storage, including the cloud storage technologies and hardware platforms, etc. It especially focuses on the current RAM cloud storage technology, and NUMA architecture. It also analyzes the latest progress of the NUMA development. Finally it summaries the key issues of RAMCloud on NUMA architecture, that shall be studied in the future. Copyright ISCA, CAINE 2016.

关键词： Architecture

NUMA memory arrangement by using BW-SA 29

学校读者我要写书评

暂无评论

NUMA memory arrangement by using BW-SA

29th International Conference on Computer Applications in Industry and Engineering, CAINE 2016

ISBN: (纸本)9781943436040

RAMCloud is a storage system that provides low-latency to access large-scale datasets. This paper focuses on the RAMcloud storage technology under NUMA (Non-Uniform Memory Access / Non-Uniform Memory Architecture) architecture - memories' arrangement. For the better performance of blocked memories and minimum cost, we present a prototype model and use blocked windows-simulated annealing (BW-SA) algorithm to sort-merge the memories and arrange them efficiently. The results converge to a best solution to prove the algorithm. After the arrangement we can assign the global address for the memories. Copyright ISCA, CAINE 2016.

关键词： Simulated annealing

Lyndon array construction during burrows-wheeler inversion

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Louza, Felipe A. Smyth, W.F. Manzini, Giovanni Telles, Guilherme P. Department of Computing and Mathematics University of São Paulo Brazil Department of Computing and Software McMaster University Canada School of Engineering & Information Technology Murdoch University Australia Computer Science Institute University of Eastern Piedmont Italy Institute of Informatics and Telematics CNR Pisa Italy Institute of Computing University of Campinas Brazil

In this paper we present an algorithm to compute the Lyndon array of a string T of length n as a byproduct of the inversion of the Burrows-Wheeler transform of T. Our algorithm runs in linear time using only a stack in addition to the data structures used for Burrows-Wheeler inversion. We compare our algorithm with two other linear-time algorithms for Lyndon array construction and show that computing the Burrows-Wheeler transform and then constructing the Lyndon array is competitive compared to the known approaches. We also propose a new balanced parenthesis representation for the Lyndon array that uses 2n + o(n) bits of space and supports constant time access. This representation can be built in linear time using O(n) words of space, or in O(nlog n/log log n) time using asymptotically the same space as T. Copyright © 2017, The Authors. All rights reserved.

关键词： Clustering algorithms

State of the art metrics for aspect oriented programming

学校读者我要写书评

暂无评论

AIP Conference Proceedings 2018年第1期1952卷

作者： Mazen Ismaeel Ghareb Gary Allen 1Computer Science Department. College of Science and Technology University of Human Development Sulaimani Iraq 2Department of Informatics School of Computing and Engineering University of Huddersfield Huddersfield England

The quality evaluation of software, e.g., defect measurement, gains significance with higher use of software applications. Metric measurements are considered as the primary indicator of imperfection prediction and software maintenance in various empirical studies of software products. However, there is no agreement on which metrics are compelling quality indicators for novel development approaches such as Aspect Oriented Programming (AOP). AOP intends to enhance programming quality, by providing new and novel constructs for the development of systems, for example, point cuts, advice and inter-type relationships. Hence, it is not evident if quality pointers for AOP can be derived from direct expansions of traditional OO measurements. Then again, investigations of AOP do regularly depend on established coupling measurements. Notwithstanding the late reception of AOP in empirical studies, coupling measurements have been adopted as useful markers of flaw inclination in this context. In this paper we will investigate the state of the art metrics for measurement of Aspect Oriented systems development.

关键词：