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

4th ISPRS Geospatial Week 2019

作者： Guan, H. Yu, Y. Yan, W. Li, D. Li, J. School of Remote Sensing and Geomatics Engineering Nanjing University of Information Science and Technology Nanjing210044 China Faculty of Computer and Software Engineering Huaiyin Institute of Technology Huaian223003 China School of Geographical Science Nanjing University of Information Science and Technology Nanjing210044 China State Key Laboratory of Information Engineering in Surveying Mapping and Remote Sensing Wuhan University Wuhan China Department of Geography and Environmental Management University of Waterloo WaterlooONN2L 3G1 Canada

Our work addresses the problem of classifying tree species from mobile LiDAR data. The work is a two step-wise strategy, including tree segmentation and tree species classification. In the tree segmentation step, a voxel-based upward growing filtering is proposed to remove terrain points from the mobile laser scanning data. Then, individual trees are segmented via a Euclidean distance clustering approach and Voxel-based Normalized Cut (VNCut) segmentation approach. In the tree species classification, a voxel-based 3D convolutional neural network (3D-CNN) model is developed based on intensity information. A road section data acquired by a RIEGL VMX-450 system are selected for evaluating the proposed tree classification method. Qualitative analysis shows that our algorithm achieves a good performance. © Authors 2019.

关键词： Optical radar

来源：评论

学校读者我要写书评

暂无评论

The role of positive and negative citations in scientific evaluation

arXiv

引用

arXiv 2020年

作者： Bai, Xiaomei Lee, Ivan Ning, Zhaolong Tolba, Amr Xia, Feng Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province School of Software Dalian University of Technology Dalian116620 China Computing Center Anshan Normal University Anshan114007 China School of Information Technology and Mathematical Sciences University of South Australia Australia Riyadh Community College King Saud University Riyadh11437 Saudi Arabia Mathematics and Computer Science Department Faculty of Science Menoufia University Egypt

Quantifying the impact of scientific papers objectively is crucial for research output assessment, which subsequently affects institution and country rankings, research funding allocations, academic recruitment and national/international scientific priorities. While most of the assessment schemes based on publication citations may potentially be manipulated through negative citations, in this study, we explore Conflict of Interest (COI) relationships and discover negative citations and subsequently weaken the associated citation strength. PANDORA (Positive And Negative COI- Distinguished Objective Rank Algorithm) has been developed, which captures the positive and negative COI, together with the positive and negative suspected COI relationships. In order to alleviate the influence caused by negative COI relationship, collaboration times, collaboration time span, citation times and citation time span are employed to determine the citing strength;while for positive COI relationship, we regard it as normal citation relationship. Furthermore, we calculate the impact of scholarly papers by PageRank and HITS algorithms, based on a credit allocation algorithm which is utilized to assess the impact of institutions fairly and objectively. Experiments are conducted on the publication dataset from American Physical Society (APS) dataset, and the results demonstrate that our method significantly outperforms the current solutions in Recommendation Intensity of list R at top-K and Spearman’s rank correlation coefficient at top-K. Copyright © 2020, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving software Testing Education via Industry Sponsored Contests 48

Improving Software Testing Education via Industry Sponsored ...

引用

48th Frontiers in Education Conference, FIE 2018

作者： Eric Wong, W. Hu, Linghuan Wang, Haoliang Chen, Zhenyu Department of Computer Science University of Texas at Dallas United States State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9781538611739

This Innovative Practice, Work in Progress Paper presents how we improve software testing education via industry sponsored contests. Over the past decades, we have built software to improve our efficiency, reliability, and safety in production, business, daily life, etc. These goals, however, cannot be accomplished if the software is not properly tested. Some universities provide classes to teach students the fundamental knowledge and techniques of software testing. However, these classes often ignore industry practices and can hardly offer real-world testing experiences to students. To address this, we partnered with industry sponsors to design and host several software testing contests along with software testing tutorials. Through the contests and tutorials, we brought real-world testing and tool experience to the students and provided excellent opportunities for them to practice their learned testing techniques to overcome industry testing challenges. © 2018 IEEE.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

Timed Data Plane Update in Data Center Network

Timed Data Plane Update in Data Center Network

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yuxiang Liu Xiaofeng Gao Jiaqi Zheng Guihai Chen Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

software-Defined Networks make it more principled and formal to operate and verify networks, which decouple the control plane and the data plane and introduce flexibility and programmability into the network. The SDN control plane needs to frequently update the data plane. However, the decoupled control and data planes face new challenges. The network is still an asynchronous distributed system in rule updates. If the update operations are not carefully scheduled, it may result in blackhole, congestions, and violate the consistency properties. Motivated by the tightly synchronized SDNs, we proposed TIDERS Algorithm for consistent network updates in "timed SDNs" - where one node update can be scheduled at specific time. In TIDERS, we use synchronized time technique to achieve fast network updates while guaranteeing consistency properties. We focus on congestion-free in scheduling the update operations. To achieve this, we first set up a flow-based dependency graph and transform it into switch-operation level dependency graph. Based on operation dependency graph, we generate an update schedule and gradually optimize it to finally get a fast update schedule. After that, we conduct a series of simulations comparing our approach with several other methods to evaluate it.

关键词：

来源：评论

学校读者我要写书评

暂无评论

IGATA: An Attraction-Based Online Task Recommendation Framework in Freemium-Crowdsourcing Platform

IGATA: An Attraction-Based Online Task Recommendation Framew...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yuchen Xia Shenwei Chen Xiaofeng Gao Haipeng Dai Guihai Chen Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9781728125848

The Freemium-Crowdsourcing platform replaces purchases in Freemium games with crowdsourcing tasks, which can effectively incentivize player participation using the psychological factor of reward attraction. However, no previous researches focus on quantifying this factor, nor do they make an effort on controlling the answer quality produced by the hybrid platform. We propose a novel online algorithm, IGATA, to allocate crowdsourcing tasks to Freemium game players on the hybrid Freemium-Crowdsourcing platform. In order to maximize the task satisfaction to reduce waste caused by task refusal, while keeping competitive expected profit output, we measure the players' quality using their in-game attributes, and quantify the task reward attraction as the key factor of allocation with the help of psychological knowledge. Evaluations conducted on real trace data show that IGATA makes a significant improvement in producing total attraction comparing to existing strategies.

关键词： Crowdsourcing Freemium games Task allocation Psychology task allocation Psychology Crowdsource Platform Psychological Factors Attraction Game theory

来源：评论

学校读者我要写书评

暂无评论

Superpixel segmentation based on spatially constrained subspace clustering

arXiv

引用

arXiv 2020年

作者： Li, Hua Jia, Yuheng Cong, Runmin Wu, Wenhui Kwong, Sam Chen, Chuanbo School of Software Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science City University of Hong Kong Kowloon Hong Kong School of Computer Science and Engineering Southeast University Nanjing211189 China Institute of Information Science Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing Jiaotong University Beijing100044 China College of Electronics and Information Engineering Shenzhen University Shenzhen518060 China Department of Computer Science City University of Hong Kong Kowloon Hong Kong City University of Hong Kong Shenzhen Research Institute Shenzhen518057 China School of Software Engineering Huazhong University of Science and Technology Wuhan430074 China

Superpixel segmentation aims at dividing the input image into some representative regions containing pixels with similar and consistent intrinsic properties, without any prior knowledge about the shape and size of each superpixel. In this paper, to alleviate the limitation of superpixel segmentation applied in practical industrial tasks that detailed boundaries are difficult to be kept, we regard each representative region with independent semantic information as a subspace, and correspondingly formulate superpixel segmentation as a subspace clustering problem to preserve more detailed content boundaries. We show that a simple integration of superpixel segmentation with the conventional subspace clustering does not effectively work due to the spatial correlation of the pixels within a superpixel, which may lead to boundary confusion and segmentation error when the correlation is ignored. Consequently, we devise a spatial regularization and propose a novel convex locality-constrained subspace clustering model that is able to constrain the spatial adjacent pixels with similar attributes to be clustered into a superpixel and generate the content-aware superpixels with more detailed boundaries. Finally, the proposed model is solved by an efficient alternating direction method of multipliers (ADMM) solver. Experiments on different standard datasets demonstrate that the proposed method achieves superior performance both quantitatively and qualitatively compared with some state-of-the-art methods. © 2020, CC BY-NC-ND.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

DeePMD-kit v2: A software package for Deep Potential models

arXiv

引用

arXiv 2023年

作者： Zeng, Jinzhe Zhang, Duo Lu, Denghui Mo, Pinghui Li, Zeyu Chen, Yixiao Rynik, Marián Huang, Li'ang Li, Ziyao Shi, Shaochen Wang, Yingze Ye, Haotian Tuo, Ping Yang, Jiabin Ding, Ye Li, Yifan Tisi, Davide Zeng, Qiyu Bao, Han Xia, Yu Huang, Jiameng Muraoka, Koki Wang, Yibo Chang, Junhan Yuan, Fengbo Bore, Sigbjørn Løland Cai, Chun Lin, Yinnian Wang, Bo Xu, Jiayan Zhu, Jia-Xin Luo, Chenxing Zhang, Yuzhi Goodall, Rhys E.A. Liang, Wenshuo Singh, Anurag Kumar Yao, Sikai Zhang, Jingchao Wentzcovitch, Renata Han, Jiequn Liu, Jie Jia, Weile York, Darrin M. Weinan, E. Car, Roberto Zhang, Linfeng Wang, Han Laboratory for Biomolecular Simulation Research Institute for Quantitative Biomedicine Department of Chemistry and Chemical Biology Rutgers University PiscatawayNJ08854 United States AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China HEDPS CAPT College of Engineering Peking University Beijing100871 China College of Electrical and Information Engineering Hunan University Changsha China Yuanpei College Peking University Beijing100871 China Program in Applied and Computational Mathematics Princeton University PrincetonNJ08540 United States Department of Experimental Physics Comenius University Mlynská Dolina F2 Bratislava842 48 Slovakia Center for Quantum Information Institute for Interdisciplinary Information Sciences Tsinghua University Beijing100084 China Center for Data Science Peking University Beijing100871 China ByteDance Research Zhonghang Plaza No. 43 North 3rd Ring West Road Haidian District Beijing China College of Chemistry and Molecular Engineering Peking University Beijing100871 China Baidu Inc. Beijing China Key Laboratory of Structural Biology of Zhejiang Province School of Life Sciences Westlake University Zhejiang Hangzhou China Westlake AI Therapeutics Lab Westlake Laboratory of Life Sciences and Biomedicine Zhejiang Hangzhou China Department of Chemistry Princeton University PrincetonNJ08544 United States SISSA Scuola Internazionale Superiore di Studi Avanzati Trieste34136 Italy Laboratory of Computational Science and Modeling Institute of Materials École Polytechnique Fédérale de Lausanne Lausanne1015 Switzerland Department of Physics National University of Defense Technology Hunan Changsha410073 China State Key Lab of Processors Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Electronics Engineerin

DeePMD-kit is a powerful open-source software package that facilitates molecular dynamics simulations using machine learning potentials (MLP) known as Deep Potential (DP) models. This package, which was released in 2017, has been widely used in the fields of physics, chemistry, biology, and material science for studying atomistic systems. The current version of DeePMD-kit offers numerous advanced features such as DeepPot-SE, attention-based and hybrid descriptors, the ability to fit tensile properties, type embedding, model deviation, Deep Potential - Range Correction (DPRc), Deep Potential Long Range (DPLR), GPU support for customized operators, model compression, non-von Neumann molecular dynamics (NVNMD), and improved usability, including documentation, compiled binary packages, graphical user interfaces (GUI), and application programming interfaces (API). This article presents an overview of the current major version of the DeePMD-kit package, highlighting its features and technical details. Additionally, the article benchmarks the accuracy and efficiency of different models and discusses ongoing developments. © 2023, CC BY-NC-ND.

关键词： Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

FADBM: Frequency-Aware Dummy-Based Method in Long-Term Location Privacy Protection

FADBM: Frequency-Aware Dummy-Based Method in Long-Term Locat...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Jiabang Liu Xutong Jiang Song Zhang Hao Wang Wanchun Dou State Key Laboratory for Novel Software Technology Nanjing University Nanjing P. R. China The Department of Computer Science and Technology Nanjing University Nanjing P. R. China Department of Computer Science Norwegian University of Science and Technology Gjøvik Norway

ISBN: (纸本)9781728125848

With the rapid usage of location-based services (LBSs), protection of location privacy has become a significant concern. Existing dummy-based methods mainly consider generating dummies in continuous queries, which neglects the fact that the user would launch queries in a frequent region(e.g., home), resulting in privacy disclosure in a long-term period (i.e., more than 30 days). To solve this problem, we propose a method which generates dummy frequent regions, and make dummies locate in these dummy regions as far as possible. Compared with other methods, evaluation based on real-world dataset shows that the proposed method can reduce the ratio of recognized dummies and restored trajectory in a long-term situation.

关键词： Privacy protection Location-based services K-anonymity Dummy generation Trajectory privacy Location based services Manikins Privacy

来源：评论

学校读者我要写书评

暂无评论

software Performance of the ATLAS Track Reconstruction for LHC Run 3

引用

Computing and software for Big science 2024年第1期8卷 1-32页

作者： Aad, G. Abbott, B. Abeling, K. Abicht, N.J. Abidi, S.H. Aboulhorma, A. Abramowicz, H. Abreu, H. Abulaiti, Y. Acharya, B.S. Bourdarios, C. Adam Adamczyk, L. Adamek, L. Addepalli, S.V. Addison, M.J. Adelman, J. Adiguzel, A. Adye, T. Affolder, A.A. Afik, Y. Agaras, M.N. Agarwala, J. Aggarwal, A. Agheorghiesei, C. Ahmad, A. Ahmadov, F. Ahmed, W.S. Ahuja, S. Ai, X. Aielli, G. Aikot, A. Tamlihat, M. Ait Aitbenchikh, B. Aizenberg, I. Akbiyik, M. Åkesson, T.P.A. Akimov, A.V. Akiyama, D. Akolkar, N.N. Khoury, K. Al Alberghi, G.L. Albert, J. Albicocco, P. Albouy, G.L. Alderweireldt, S. Aleksa, M. Aleksandrov, I.N. Alexa, C. Alexopoulos, T. Alfonsi, F. Algren, M. Alhroob, M. Ali, B. Ali, H.M.J. Ali, S. Alibocus, S.W. Aliev, M. Alimonti, G. Alkakhi, W. Allaire, C. Allbrooke, B.M.M. Allen, J.F. Flores, C. A. Allendes Allport, P.P. Aloisio, A. Alonso, F. Alpigiani, C. Estevez, M. Alvarez Fernandez, A. Alvarez Cardoso, M. Alves Alviggi, M.G. Aly, M. Coutinho, Y. Amaral Ambler, A. Amelung, C. Amerl, M. Ames, C.G. Amidei, D. Santos, S. P. Amor Dos Amos, K.R. Ananiev, V. Anastopoulos, C. Andeen, T. Anders, J.K. Andrean, S.Y. Andreazza, A. Angelidakis, S. Angerami, A. Anisenkov, A.V. Annovi, A. Antel, C. Anthony, M.T. Antipov, E. Antonelli, M. Anulli, F. Aoki, M. Aoki, T. Pozo, J. A. Aparisi Aparo, M.A. Bella, L. Aperio Appelt, C. Apyan, A. Aranzabal, N. Val, S. J. Arbiol Arcangeletti, C. Arce, A.T.H. Arena, E. Arguin, J.-F. Argyropoulos, S. Arling, J.-H. Arnaez, O. Arnold, H. Artoni, G. Asada, H. Asai, K. Asai, S. Asbah, N.A. Assahsah, J. Assamagan, K. Astalos, R. Atashi, S. Atkin, R.J. Atkinson, M. Atmani, H. Atmasiddha, P.A. Augsten, K. Auricchio, S. Auriol, A.D. Austrup, V.A. Avolio, G. Axiotis, K. Azuelos, G. Babal, D. Bachacou, H. Bachas, K. Bachiu, A. Backman, F. Badea, A. Bagnaia, P. Bahmani, M. Bailey, A.J. Bailey, V.R. Baines, J.T. Baines, L. Baker, O.K. Bakos, E. Gupta, D. Bakshi Balakrishnan, V. Balasubramanian, R. Baldin, E.M. Balek, P. Ballabene, E. Balli, F. Baltes, L.M. Balunas, W.K. Balz, J. Banas, E. Bandieramonte CPPM Aix-Marseille Université CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman OK United States II. Physikalisches Institut Georg-August-Universität Göttingen Göttingen Germany Fakultät Physik Technische Universität Dortmund Dortmund Germany Physics Department Brookhaven National Laboratory Upton NY United States Faculté des sciences Université Mohammed V Rabat Morocco Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion Israel Institute of Technology Haifa Israel Department of Physics New York University New York NY United States INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics Stanford University Stanford CA United States LAPP Université Savoie Mont Blanc CNRS/IN2P3 Annecy France AGH University of Krakow Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics University of Toronto Toronto ON Canada Department of Physics Brandeis University Waltham MA United States School of Physics and Astronomy University of Manchester Manchester United Kingdom Department of Physics Northern Illinois University DeKalb IL United States Department of Physics Istanbul University Istanbul Turkey Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz CA United States CERN Geneva Switzerland Institut de Física d’Altes Energies (IFAE) Barcelona Institute of Science and Technology Barcelona Spain INFN Sezione di Pavia Pavia Italy Dipartimento di Fisica Università di Pavia Pavia Italy Institut für Physik Universität Mainz Mainz Germany Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Affiliated with an international laboratory covered by a cooperation agreement with CERN Geneva Switzerland Institu

Charged particle reconstruction in the presence of many simultaneous proton–proton (pp) collisions in the LHC is a challenging task for the ATLAS experiment’s reconstruction software due to the combinatorial complexity. This paper describes the major changes made to adapt the software to reconstruct high-activity collisions with an average of 50 or more simultaneous pp interactions per bunch crossing (pile-up) promptly using the available computing resources. The performance of the key components of the track reconstruction chain and its dependence on pile-up are evaluated, and the improvement achieved compared to the previous software version is quantified. For events with an average of 60pp collisions per bunch crossing, the updated track reconstruction is twice as fast as the previous version, without significant reduction in reconstruction efficiency and while reducing the rate of combinatorial fake tracks by more than a factor two. © The Author(s) 2024.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Deep Generative Models for Fast Photon Shower Simulation in ATLAS

引用

Computing and software for Big science 2024年第1期8卷 1-40页

作者： Aad, G. Abbott, B. Abbott, D.C. Abud, A. Abed Abeling, K. Abhayasinghe, D.K. Abidi, S.H. Aboulhorma, A. Abramowicz, H. Abreu, H. Abulaiti, Y. Hoffman, A. C. Abusleme Acharya, B.S. Achkar, B. Adam, L. Bourdarios, C. Adam Adamczyk, L. Adamek, L. Addepalli, S.V. Adelman, J. Adiguzel, A. Adorni, S. Adye, T. Affolder, A.A. Afik, Y. Agaras, M.N. Agarwala, J. Aggarwal, A. Agheorghiesei, C. Aguilar-Saavedra, J.A. Ahmad, A. Ahmadov, F. Ahmed, W.S. Ai, X. Aielli, G. Aizenberg, I. Akbiyik, M. Åkesson, T.P.A. Akimov, A.V. Khoury, K. Al Alberghi, G.L. Albert, J. Albicocco, P. Verzini, M. J. Alconada Alderweireldt, S. Aleksa, M. Aleksandrov, I.N. Alexa, C. Alexopoulos, T. Alfonsi, A. Alfonsi, F. Alhroob, M. Ali, B. Ali, S. Aliev, M. Alimonti, G. Allaire, C. Allbrooke, B.M.M. Allport, P.P. Aloisio, A. Alonso, F. Alpigiani, C. Camelia, E. Alunno Estevez, M. Alvarez Alviggi, M.G. Coutinho, Y. Amaral Ambler, A. Ambroz, L. Amelung, C. Amidei, D. Santos, S. P. Amor Dos Amoroso, S. Amos, K.R. Amrouche, C.S. Ananiev, V. Anastopoulos, C. Andari, N. Andeen, T. Anders, J.K. Andrean, S.Y. Andreazza, A. Angelidakis, S. Angerami, A. Anisenkov, A.V. Annovi, A. Antel, C. Anthony, M.T. Antipov, E. Antonelli, M. Antrim, D.J.A. Anulli, F. Aoki, M. Pozo, J. A. Aparisi Aparo, M.A. Bella, L. Aperio Appelt, C. Aranzabal, N. Ferraz, V. Araujo Arcangeletti, C. Arce, A.T.H. Arena, E. Arguin, J.-F. Argyropoulos, S. Arling, J.-H. Armbruster, A.J. Arnaez, O. Arnold, H. Tame, Z. P. Arrubarrena Artoni, G. Asada, H. Asai, K. Asai, S. Asbah, N.A. Asimakopoulou, E.M. Assahsah, J. Assamagan, K. Astalos, R. Atkin, R.J. Atkinson, M. Atlay, N.B. Atmani, H. Atmasiddha, P.A. Augsten, K. Auricchio, S. Austrup, V.A. Avner, G. Avolio, G. Ayoub, M.K. Azuelos, G. Babal, D. Bachacou, H. Bachas, K. Bachiu, A. Backman, F. Badea, A. Bagnaia, P. Bahmani, M. Bailey, A.J. Bailey, V.R. Baines, J.T. Bakalis, C. Baker, O.K. Bakker, P.J. Bakos, E. Gupta, D. Bakshi Balaji, S. Balasubramanian, R. Baldin, E.M. Balek, P. Ballabene, E. Balli, F. Baltes, L.M. Balunas, W.K. Balz, J. Banas Department of Physics University of Adelaide Adelaide Australia Department of Physics University of Alberta Edmonton AB Canada Department of Physics Ankara University Ankara Turkey Division of Physics TOBB University of Economics and Technology Ankara Turkey LAPP Université Savoie Mont Blanc CNRS/IN2P3 Annecy France APC Université Paris Cité CNRS/IN2P3 Paris France High Energy Physics Division Argonne National Laboratory Argonne IL United States Department of Physics University of Arizona Tucson AZ United States Department of Physics University of Texas at Arlington Arlington TX United States Physics Department National and Kapodistrian University of Athens Athens Greece Physics Department National Technical University of Athens Zografou Greece Department of Physics University of Texas at Austin Austin TX United States Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan Institut de Física d’Altes Energies (IFAE) Barcelona Institute of Science and Technology Barcelona Spain Institute of High Energy Physics Chinese Academy of Sciences Beijing China Physics Department Tsinghua University Beijing China Department of Physics Nanjing University Nanjing China University of Chinese Academy of Science (UCAS) Beijing China Institute of Physics University of Belgrade Belgrade Serbia Department for Physics and Technology University of Bergen Bergen Norway Physics Division Lawrence Berkeley National Laboratory Berkeley CA United States Institut für Physik Humboldt Universität zu Berlin Berlin Germany Albert Einstein Center for Fundamental Physics and Laboratory for High Energy Physics University of Bern Bern Switzerland School of Physics and Astronomy University of Birmingham Birmingham United Kingdom Department of Physics Bogazici University Istanbul Turkey Department of Physics Engineering Gaziantep University Gaziantep Turkey Department of Physics Istanbul University Istanbul Turkey Istinye University Sariyer Istanbul

The need for large-scale production of highly accurate simulated event samples for the extensive physics programme of the ATLAS experiment at the Large Hadron Collider motivates the development of new simulation techniques. Building on the recent success of deep learning algorithms, variational autoencoders and generative adversarial networks are investigated for modelling the response of the central region of the ATLAS electromagnetic calorimeter to photons of various energies. The properties of synthesised showers are compared with showers from a full detector simulation using geant4. Both variational autoencoders and generative adversarial networks are capable of quickly simulating electromagnetic showers with correct total energies and stochasticity, though the modelling of some shower shape distributions requires more refinement. This feasibility study demonstrates the potential of using such algorithms for ATLAS fast calorimeter simulation in the future and shows a possible way to complement current simulation techniques. © The Author(s) 2024.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：