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

arXiv 2025年

作者： Zhao, Chen Shaik, Anjum Keyak, Joyce H. Lane, Nancy E. Deng, Jeffrey D. Su, Kuan-Jui Sha, Qiuying Shen, Hui Deng, Hong-Wen Zhou, Weihua Department of Computer Science Kennesaw State University 680 Arntson Dr MariettaGA30060 United States Department of Applied Computing Michigan Technological University 1400 Townsend Dr HoughtonMI49931 United States Department of Radiological Sciences Department of Biomedical Engineering Department of Mechanical and Aerospace Engineering University of California IrvineCA92697 United States Department of Internal Medicine Division of Rheumatology UC Davis Health SacramentoCA95817 United States Geisel School of Medicine Dartmouth College HanoverNH03755 United States Division of Biomedical Informatics and Genomics Tulane Center of Biomedical Informatics and Genomics Deming Department of Medicine Tulane University New OrleansLA70112 United States Department of Mathematical Sciences Michigan Technological University HoughtonMI49931 United States Center for Biocomputing and Digital Health Institute of Computing and Cybersystems Health Research Institute Michigan Technological University HoughtonMI49931 United States Department of Applied Computing Michigan Technological University 1400 Townsend Dr HoughtonMI49931 United States

Hip fractures represent a major health concern, particularly among the elderly, often leading decreased mobility and increased mortality. Early and accurate detection of at risk individuals is crucial for effective intervention. In this study, we propose Iterative Cross Graph Matching for Hip Fracture Risk Assessment (ICGM-FRAX), a novel approach for predicting hip fractures using Dual-energy X-ray Absorptiometry (DXA) images. ICGM-FRAX involves iteratively comparing a test (subject) graph with multiple template graphs representing the characteristics of hip fracture subjects to assess the similarity and accurately to predict hip fracture risk. These graphs are obtained as follows. The DXA images are separated into multiple regions of interest (RoIs), such as the femoral head, shaft, and lesser trochanter. Radiomic features are then calculated for each RoI, with the central coordinates used as nodes in a graph. The connectivity between nodes is established according to the Euclidean distance between these coordinates. This process transforms each DXA image into a graph, where each node represents a RoI, and edges derived by the centroids of RoIs capture the spatial relationships between them. If the test graph closely matches a set of template graphs representing subjects with incident hip fractures, it is classified as indicating high hip fracture risk. We evaluated our method using 547 subjects from the UK Biobank dataset, and experimental results show that ICGM-FRAX achieved a sensitivity of 0.9869, demonstrating high accuracy in predicting hip fractures. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Roadmap on Deep Learning for Microscopy

arXiv

引用

arXiv 2023年

作者： Volpe, Giovanni Wählby, Carolina Tian, Lei Hecht, Michael Yakimovich, Artur Monakhova, Kristina Waller, Laura Sbalzarini, Ivo F. Metzler, Christopher A. Xie, Mingyang Zhang, Kevin Lenton, Isaac C.D. Rubinsztein-Dunlop, Halina Brunner, Daniel Bai, Bijie Ozcan, Aydogan Midtvedt, Daniel Wang, Hao Sladoje, Nataša Lindblad, Joakim Smith, Jason T. Ochoa, Marien Barroso, Margarida Intes, Xavier Qiu, Tong Yu, Li-Yu You, Sixian Liu, Yongtao Ziatdinov, Maxim A. Kalinin, Sergei V. Sheridan, Arlo Manor, Uri Nehme, Elias Goldenberg, Ofri Shechtman, Yoav Moberg, Henrik K. Langhammer, Christoph Špačková, Barbora Helgadottir, Saga Midtvedt, Benjamin Argun, Aykut Thalheim, Tobias Cichos, Frank Bo, Stefano Hubatsch, Lars Pineda, Jesus Manzo, Carlo Bachimanchi, Harshith Selander, Erik Homs-Corbera, Antoni Fränzl, Martin de Haan, Kevin Rivenson, Yair Korczak, Zofia Adiels, Caroline Beck Mijalkov, Mite Veréb, Dániel Chang, Yu-Wei Pereira, Joana B. Matuszewski, Damian Kylberg, Gustaf Sintorn, Ida-Maria Caicedo, Juan C. Cimini, Beth A. Bell, Muyinatu Lediju A. Saraiva, Bruno M. Jacquemet, Guillaume Henriques, Ricardo Ouyang, Wei Le, Trang Gómez-De-Mariscal, Estibaliz Sage, Daniel Muñoz-Barrutia, Arrate Lindqvist, Ebba Josefson Bergman, Johanna Department of Physics University of Gothenburg Gothenburg41296 Sweden Dept. IT and SciLifeLab Uppsala University Sweden Department of Electrical and Computer Engineering Boston University BostonMA02215 United States Department of Biomedical Engineering Boston University BostonMA02215 United States Görlitz Germany Department of Renal Medicine Division of Medicine University College London Royal Free Hospital Campus London United Kingdom Artificial Intelligence for Life Sciences CIC Dorset United Kingdom Roche Pharma International Informatics Roche Diagnostics GmbH Mannheim Germany Department of Electrical Engineering and Computer Sciences UC Berkeley United States Technische Universität Dresden Faculty of Computer Science Dresden Germany Max Planck Institute of Molecular Cell Biology and Genetics Center for Systems Biology Dresden Dresden Germany University of Maryland College Park United States Klosterneuburg3400 Austria School of Mathematics and Physics The University of Queensland Brisbane4072 Australia Australian Research Council Centre of Excellence for Engineered Quantum Systems The University of Queensland Brisbane4072 Australia Département d’Optique P. M. Duffieux Institut FEMTO-ST Université Franche-Comté CNRS UMR 6174 Besançon France Department of Electrical and Computer Engineering University of California Los Angeles Los AngelesCA United States Department of Information Technology Uppsala University Sweden Department of Biomedical Engineering Rensselaer Polytechnic Institute TroyNY12180 United States Elephas 1 Erdman Pl. Madison53705 United States University of Wisconsin–Madison Department of Medical Physics MadisonWI53705 United States Department of Molecular and Cellular Physiology Albany Medical College AlbanyNY12208 United States Research Laboratory of Electronics Electrical Engineering and Computer Science Massachusetts Institute of Technology BostonMA United States Center for Nanophase Materials Sciences Oak R

Through digital imaging, microscopy has evolved from primarily being a means for visual observation of life at the micro- and nano-scale, to a quantitative tool with ever-increasing resolution and throughput. Artificial intelligence, deep neural networks, and machine learning are all niche terms describing computational methods that have gained a pivotal role in microscopy-based research over the past decade. This Roadmap is written collectively by prominent researchers and encompasses selected aspects of how machine learning is applied to microscopy image data, with the aim of gaining scientific knowledge by improved image quality, automated detection, segmentation, classification and tracking of objects, and efficient merging of information from multiple imaging modalities. We aim to give the reader an overview of the key developments and an understanding of possibilities and limitations of machine learning for microscopy. It will be of interest to a wide cross-disciplinary audience in the physical sciences and life sciences. Copyright © 2023, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Fitting Dense and Sparse Reduced Data 21st

Fitting Dense and Sparse Reduced Data

引用

21st International Multi-Conference on Advanced computer Systems, ACS 2018

作者： Kozera, Ryszard Wiliński, Artur Faculty of Applied Informatics and Mathematics Warsaw University of Life Sciences - SGGW ul. Nowoursynowska 159 Warsaw02-776 Poland Department of Computer Science and Software Engineering The University of Western Australia 35 Stirling Highway Crawley PerthWA6009 Australia

ISBN: (纸本)9783030033132

This paper addresses the topic of fitting reduced data represented by the sequence of interpolation points (Formula Presented) in arbitrary Euclidean space Em. The parametric curve γ together with its knots (Formula Presented) (for which (Formula Presented)) are both assumed to be unknown. We look at some recipes to estimate T in the context of dense versus sparse M for various choices of interpolation schemes (Formula Presented). For M dense, the convergence rate to approximate γ with (Formula Presented) is considered as a possible criterion to force a proper choice of new knots (Formula Presented). The latter incorporates the so-called exponential parameterization "retrieving" the missing knots T from the geometrical spread of M. We examine the convergence rate in approximating γ by commonly used interpolants (Formula Presented) based here on M and exponential parameterization. In contrast, for M sparse, a possible optional strategy is to select (Formula Presented) which optimizes a certain cost function depending on the family of admissible knots (Formula Presented). This paper focuses on minimizing "an average acceleration" within the family of natural splines (Formula Presented) fitting M with (Formula Presented) admitted freely in the ascending order. Illustrative examples and some applications listed supplement theoretical component of this work. © 2019, Springer Nature Switzerland AG.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

SELFIES and the future of molecular string representations

arXiv

引用

arXiv 2022年

作者： Krenn, Mario Ai, Qianxiang Barthel, Senja Carson, Nessa Frei, Angelo Frey, Nathan C. Friederich, Pascal Gaudin, Théophile Gayle, Alberto Alexander Jablonka, Kevin Maik Lameiro, Rafael F. Lemm, Dominik Lo, Alston Moosavi, Seyed Mohamad Nápoles-Duarte, José Manuel Nigam, AkshatKumar Pollice, Robert Rajan, Kohulan Schatzschneider, Ulrich Schwaller, Philippe Skreta, Marta Smit, Berend Strieth-Kalthoff, Felix Sun, Chong Tom, Gary von Rudorff, Guido Falk Wang, Andrew White, Andrew Young, Adamo Yu, Rose Aspuru-Guzik, Alán Erlangen Germany Department of Chemistry Fordham University The Bronx New York United States Department of Mathematics Vrije Universiteit Amsterdam Amsterdam Netherlands Syngenta Jealott’s Hill International Research Centre Bracknell Berkshire United Kingdom Department of Chemistry Imperial College London Molecular Sciences Research Hub White City Campus Wood Lane London United Kingdom Massachusetts Institute of Technology CambridgeMA United States Institute of Theoretical Informatics Karlsruhe Institute of Technology Karlsruhe Germany Institute of Nanotechnology Karlsruhe Institute of Technology Eggenstein-Leopoldshafen Germany Department of Computer Science University of Toronto Canada IBM Research Europe Zürich Switzerland Unaffiliated Sapporo Japan Sion Valais Switzerland Medicinal and Biological Chemistry Group São Carlos Institute of Chemistry University of São Paulo São Paulo Brazil Faculty of Physics University of Vienna Vienna Austria Department of Mathematics and Computer Science Freie Universität Berlin Berlin Germany Facultad de Ciencias Químicas Universidad Autónoma de Chihuahua Chihuahua Mexico Department of Computer Science Stanford University CA United States Chemical Physics Theory Group Department of Chemistry University of Toronto Canada Institute for Inorganic and Analytical Chemistry Friedrich-Schiller Universität Jena Jena Germany Institut für Anorganische Chemie Julius-Maximilians-Universität Würzburg Würzburg Germany Lausanne Switzerland Lausanne Switzerland Vector Institute for Artificial Intelligence Toronto Canada Solar Fuels Group Department of Chemistry University of Toronto Canada Department of Chemical Engineering University of Rochester United States Department of Computer Science and Engineering University of California San Diego United States Department of Chemical Engineering and Applied Chemistry University of Toronto Canada Department of Materials Science University of Toronto Canada Toronto

Artificial intelligence (AI) and machine learning (ML) are expanding in popularity for broad applications to challenging tasks in chemistry and materials science. Examples include the prediction of properties, the discovery of new reaction pathways, or the design of new molecules. The machine needs to read and write fluently in a chemical language for each of these tasks. Strings are a common tool to represent molecular graphs, and the most popular molecular string representation, SMILES, has powered cheminformatics since the late 1980s. However, in the context of AI and ML in chemistry, SMILES has several shortcomings – most pertinently, most combinations of symbols lead to invalid results with no valid chemical interpretation. To overcome this issue, a new language for molecules was introduced in 2020 that guarantees 100% robustness: SELFIES (SELF-referencIng Embedded Strings). SELFIES has since simplified and enabled numerous new applications in chemistry. In this manuscript, we look to the future and discuss molecular string representations, along with their respective opportunities and challenges. We propose 16 concrete Future Projects for robust molecular representations. These involve the extension toward new chemical domains, exciting questions at the interface of AI and robust languages, and interpretability for both humans and machines. We hope that these proposals will inspire several follow-up works exploiting the full potential of molecular string representations for the future of AI in chemistry and materials science. © 2022, CC BY.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Metrics Reloaded: Recommendations for image analysis validation

arXiv

引用

arXiv 2022年

作者： Maier-Hein, Lena Reinke, Annika Godau, Patrick Tizabi, Minu D. Buettner, Florian Christodoulou, Evangelia Glocker, Ben Isensee, Fabian Kleesiek, Jens Kozubek, Michal Reyes, Mauricio Riegler, Michael A. Wiesenfarth, Manuel Emre Kavur, A. Sudre, Carole H. Baumgartner, Michael Eisenmann, Matthias Heckmann-Nötzel, Doreen Rädsch, Tim Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Benis, Arriel Blaschko, Matthew B. Jorge Cardoso, M. Cheplygina, Veronika Cimini, Beth A. Collins, Gary S. Farahani, Keyvan Ferrer, Luciana Galdran, Adrian Ginneken, Bram Van Haase, Robert Hashimoto, Daniel A. Hoffman, Michael M. Huisman, Merel Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kenngott, Hannes Kofler, Florian Kopp-Schneider, Annette Kreshuk, Anna Kurc, Tahsin Landman, Bennett A. Litjens, Geert Madani, Amin Maier-Hein, Klaus Martel, Anne L. Mattson, Peter Meijering, Erik Menze, Bjoern Moons, Karel G.M. Müller, Henning Nichyporuk, Brennan Nickel, Felix Petersen, Jens Rajpoot, Nasir Rieke, Nicola Saez-Rodriguez, Julio Sánchez, Clara I. Shetty, Shravya Smeden, Maarten Van Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. Calster, Ben Van Varoquaux, Gaël Jäger, Paul F. Heidelberg Division of Intelligent Medical Systems and HI Helmholtz Imaging Germany Faculty of Mathematics and Computer Science and Medical Faculty Heidelberg University Heidelberg Germany NCT Heidelberg a partnership between DKFZ University Medical Center Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Division of Intelligent Medical Systems Germany partner site Frankfurt/Mainz a partnership between DKFZ and UCT Frankfurt-Marburg Germany Heidelberg Goethe University Frankfurt Germany Department of Medicine Goethe University Frankfurt Germany Department of Informatics Frankfurt Cancer Insititute Germany Department of Computing Imperial College London London United Kingdom Heidelberg Division of Medical Image Computing and HI Applied Computer Vision Lab Germany Institute for AI in Medicine University Medicine Essen Essen Germany Centre for Biomedical Image Analysis Faculty of Informatics Masaryk University Brno Czech Republic ARTORG Center for Biomedical Engineering Research University of Bern Bern Switzerland Department of Radiation Oncology University Hospital Bern University of Bern Bern Switzerland Simula Metropolitan Center for Digital Engineering Oslo Norway UiT The Arctic University of Norway Romsø Norway Heidelberg Division of Biostatistics Germany Heidelberg Division of Intelligent Medical Systems Division of Medical Image Computing HI Applied Computer Vision Lab Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London London United Kingdom Heidelberg Division of Medical Image Computing Germany Instituto de Cálculo CONICET – Universidad de Buenos Aires Buenos Aires Argentina Centre for Medical Image Computing University College London London United Kingdom McGill University Montréal

Increasing evidence shows that flaws in machine learning (ML) algorithm validation are an underestimated global problem. Particularly in automatic biomedical image analysis, chosen performance metrics often do not reflect the domain interest, thus failing to adequately measure scientific progress and hindering translation of ML techniques into practice. To overcome this, we created Metrics Reloaded, a comprehensive framework guiding researchers in the problem-aware selection of metrics. It was developed by a large international consortium in a multi-stage Delphi process and is based on the novel concept of a problem fingerprint – a structured representation of the given problem that captures all aspects that are relevant for metric selection, from the domain interest to the properties of the target structure(s), data set and algorithm output. Based on the problem fingerprint, users are guided through the process of choosing and applying appropriate validation metrics while being made aware of potential pitfalls. Metrics Reloaded targets image analysis problems that can be interpreted as a classification task at image, object or pixel level, namely image-level classification, object detection, semantic segmentation, and instance segmentation tasks. To improve the user experience, we implemented the framework in the Metrics Reloaded online tool. Following the convergence of ML methodology across application domains, Metrics Reloaded fosters the convergence of validation methodology. Its applicability is demonstrated for various biomedical use cases. © 2022, CC BY.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Automatic Intelligent System Using Medical of Things for Multiple Sclerosis Detection

引用

Computational intelligence and neuroscience 2023年第1期2023卷 4776770页

作者： Sujatha Krishnamoorthy Yaxi Zhang Seifedine Kadry Muhammad Attique Khan Majed Alhaisoni Nasser Mustafa Weifeng Yu Abdullah Alqahtani Zhejiang Bioinformatics International Science and Technology Cooperation Center Wenzhou-Kean University Wenzhou Zhejiang Province China. Wenzhou Municipal Key Lab of Applied Biomedical and Biopharmaceutical Informatics Wenzhou-Kean University Wenzhou Zhejiang Province China. Department of Neurology Wenzhou Central Hospital Medical Group Wenzhou 325000 China. Department of Applied Data Science Noroff University College Kristiansand Norway. Artificial Intelligence Research Center (AIRC) Ajman University Ajman 346 UAE. Department of Electrical and Computer Engineering Lebanese American University Byblos Lebanon. Department of Computer Science HITEC University Taxila Pakistan. Computer Sciences Department College of Computer and Information Sciences Princess Nourah Bint Abdulrahman University Riyadh 11671 Saudi Arabia. Wenzhou-Kean University School of Science and Technology Wenzhou Zhejiang Province China. College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia.

Malfunctions in the immune system cause multiple sclerosis (MS), which initiates mild to severe nerve damage. MS will disturb the signal communication between the brain and other body parts, and early diagnosis will help reduce the harshness of MS in humankind. Magnetic resonance imaging (MRI) supported MS detection is a standard clinical procedure in which the bio-image recorded with a chosen modality is considered to assess the severity of the disease. The proposed research aims to implement a convolutional neural network (CNN) supported scheme to detect MS lesions in the chosen brain MRI slices. The stages of this framework include (i) image collection and resizing, (ii) deep feature mining, (iii) hand-crafted feature mining, (iii) feature optimization with firefly algorithm, and (iv) serial feature integration and classification. In this work, five-fold cross-validation is executed, and the final result is considered for the assessment. The brain MRI slices with/without the skull section are examined separately, presenting the attained results. The experimental outcome of this study confirms that the VGG16 with random forest (RF) classifier offered a classification accuracy of >98% MRI with skull, and VGG16 with K-nearest neighbor (KNN) provided an accuracy of >98% without the skull.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Explainable AI: Definition and attributes of a good explanation for health AI

arXiv

引用

arXiv 2024年

作者： Kyrimi, Evangelia McLachlan, Scott Wohlgemut, Jared M. Perkins, Zane B. Lagnado, David A. Marsh, William Gimson, Alexander Shafti, Ali Ercole, Ari Banerjee, Amitava Glocker, Ben Schafer, Burkhard Gatsonis, Constantine Grosan, Crina Sent, Danielle Berman, David S. Glass, David O'Regan, Declan P. Letsios, Dimitrios Morrissey, Dylan Pisirir, Erhan Leofante, Francesco Soyel, Hamit Williamson, Jon Grieman, Keri Dube, Kudakwashe Mardsen, Max Nagendran, Myura Tai, Nigel Kostopoulou, Olga Jones, Owain Curzon, Paul Stoner, Rebecca S. Tandle, Sankalp Joshi, Shalmali Mossadegh, Somayyeh Buijsman, Stefan Miller, Tim Madai, Vince Istvan School of Electronic Engineering and Computer Science Queen Mary University of London London United Kingdom School of Nursing Midwifery and Palliative Care King's College London London United Kingdom Centre for Trauma Sciences Blizard Institute Queen Mary University of London London United Kingdom Royal London Hospital Barts Health NHS Trust London United Kingdom Department of Experiment Psychology University College London London United Kingdom Cambridge Liver Unit Addenbrooke's Hospital Cambridge University Hospitals Hills Road Box 210 Cambridge United Kingdom University of Cambridge United Kingdom Cambridge Consultants Ltd. United Kingdom Division of Anaesthesia Cambridge Centre for AI in Medicine University of Cambridge Cambridge United Kingdom Magdelene College University of Cambridge United Kingdom Institute of Health Informatics University College London London United Kingdom Department of Computing Imperial College London London United Kingdom SCRIPT Centre for IT and IP Law School of Law University of Edinburgh United Kingdom Center for Statistical Sciences School of Public Health Brown University Providence United States Research Group Artificial Intelligence HU University of Applied Sciences Utrecht Netherlands Jheronimus Academy of Data Science Tilburg University Eindhoven University of Technology s-Hertogenbosch Netherlands Centre for Theoretical Physics Queen Mary University of London London United Kingdom School of Computing Ulster University Belfast United Kingdom MRC Laboratory of Medical Sciences Imperial College London London United Kingdom Department of Informatics King's College London United Kingdom Physiotherapy Department Barts Health NHS Trust London United Kingdom Sport and Exercise Medicine Queen Mary University of London London United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London United Kingdom Department of Computing Imperial College London United Kingdom Departmen

Proposals of artificial intelligence (AI) solutions based on increasingly complex and accurate predictive models are becoming ubiquitous across many disciplines. As the complexity of these models grows, transparency and users' understanding often diminish. This suggests that accurate prediction alone is insufficient for making an AI-based solution truly useful. In the development of healthcare systems, this introduces new issues related to accountability and safety. Understanding how and why an AI system makes a recommendation may require complex explanations of its inner workings and reasoning processes. Although research on explainable AI (XAI) has significantly increased in recent years and there is high demand for XAI in medicine, defining what constitutes a good explanation remains ad hoc, and providing adequate explanations continues to be challenging. To fully realize the potential of AI, it is critical to address two fundamental questions about explanations for safety-critical AI applications, such as health-AI: (1) What is an explanation in health-AI? and (2) What are the attributes of a good explanation in health-AI? In this study, we examined published literature and gathered expert opinions through a two-round Delphi study. The research outputs include (1) a definition of what constitutes an explanation in health-AI and (2) a comprehensive list of attributes that characterize a good explanation in health-AI. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analysis of variance of graph-clique mining for scalable proof of work 14th

Analysis of variance of graph-clique mining for scalable pro...

引用

14th International Conference on Information Security and Cryptology, Inscrypt 2018

作者： Anada, Hiroaki Matsushima, Tomohiro Su, Chunhua Meng, Weizhi Kawamoto, Junpei Bag, Samiran Sakurai, Kouichi Department of Information Security University of Nagasaki Nagasaki Japan Department of Informatics Graduate School and Faculty of Information Science and Electrical Engineering Kyushu University Fukuoka Japan Division of Computer Science University of Aizu Aizuwakamatsu Japan Department of Applied Mathematics and Computer Science Technical University of Denmark Kongens Lyngby Denmark School of Computing Science Newcastle University Newcastle upon Tyne United Kingdom

ISBN: (纸本)9783030142339

Recently, Bitcoin is becoming one of the most popular decentralized cryptographic currency technologies, and Bitcoin mining is a process of adding transaction records to Bitcoin’s public ledger of past transactions or blockchain. To obtain a bitcoin, the mining process involves compiling recent transactions into blocks and trying to solve a computationally difficult puzzle, e.g., proof of work puzzle. A proof of work allows miners the ability to quantify how much work a given proof contains. Basically, the required time for mining is decided in advance, but problems will occur if the value is large for dispersion. In this paper, we first accept that the required time between consecutive blocks follows the exponential distribution. That is, the variance is stable as long as the expected time is fixed. Then, we focus on the graph clique mining technique proposed by the literature, like Tromp (BITCOIN 2015) and Bag-Ruj-Sakurai (Inscrypt 2015), which is based on a computational difficulty problem of searching cliques of undirected graphs, where a clique is a subset of vertices. In particular, when the clique size is two, graph clique mining can be used to gain Bitcoins. The previous work also claimed that if the clique size is parameterized and increased, even if the expected time is fixed, the variance would not be stable. However, no qualitative or quantitative results were given to support their claim. Motivated by this issue, in this work, we propose a simple search algorithm for graph cliques mining, and perform a small scale evaluation on Bitcoin and Graph cliques’s solo mining to investigate the variance issue. © 2019, Springer Nature Switzerland AG.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Measurement and interpretation of same-sign W boson pair production in association with two jets in pp collisions at (Formula presented.) TeV with the ATLAS detector

引用

Journal of High Energy Physics 2024年第4期2024卷 1-61页

作者： Aad, G. Abbott, B. Abeling, K. Abicht, N.J. Abidi, S.H. Aboulhorma, A. Abramowicz, H. Abreu, H. Abulaiti, Y. Abusleme Hoffman, A.C. Acharya, B.S. Adam Bourdarios, C. 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. Ait Tamlihat, M. Aitbenchikh, B. Aizenberg, I. Akbiyik, M. Åkesson, T.P.A. Akimov, A.V. Akiyama, D. Akolkar, N.N. Al Khoury, K. 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. Allendes Flores, C.A. Allport, P.P. Aloisio, A. Alonso, F. Alpigiani, C. Alvarez Estevez, M. Alvarez Fernandez, A. Alves Cardoso, M. Alviggi, M.G. Aly, M. Amaral Coutinho, Y. Ambler, A. Amelung, C. Amerl, M. Ames, C.G. Amidei, D. Amor Dos Santos, S.P. 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. Aparisi Pozo, J.A. Aparo, M.A. Aperio Bella, L. Appelt, C. Apyan, A. Aranzabal, N. 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. 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. Bakalis, C. Baker, O.K. Bakos, E. Bakshi Gupta, D. Balakrishnan, V. Balasubramanian, R. Baldin, E.M. Balek, P. Ballabene, E. Balli, F. Baltes, L.M. Balunas, W.K. Balz, J. Banas, E. Bandieramont Department of Physics University of Adelaide Department of Physics University of Alberta Department of Physics Ankara University Division of Physics TOBB University of Economics and Technology LAPP Université Savoie Mont Blanc CNRS/IN2P3 APC Université Paris Cité CNRS/IN2P3 High Energy Physics Division Argonne National Laboratory Department of Physics University of Arizona Department of Physics University of Texas at Arlington Physics Department National and Kapodistrian University of Athens Physics Department National Technical University of Athens Department of Physics University of Texas at Austin Institute of Physics Azerbaijan Academy of Sciences Institut de Física d’Altes Energies (IFAE) Barcelona Institute of Science and Technology Institute of High Energy Physics Chinese Academy of Sciences Physics Department Tsinghua University Department of Physics Nanjing University School of Science Shenzhen Campus of Sun Yat-sen University University of Chinese Academy of Science (UCAS) Institute of Physics University of Belgrade Department for Physics and Technology University of Bergen Physics Division Lawrence Berkeley National Laboratory University of California Institut für Physik Humboldt Universität zu Berlin Albert Einstein Center for Fundamental Physics and Laboratory for High Energy Physics University of Bern School of Physics and Astronomy University of Birmingham Department of Physics Bogazici University Department of Physics Engineering Gaziantep University Department of Physics Istanbul University Facultad de Ciencias y Centro de Investigaciónes Universidad Antonio Nariño Departamento de Física Universidad Nacional de Colombia Dipartimento di Fisica e Astronomia A. Righi Università di Bologna INFN Sezione di Bologna Physikalisches Institut Universität Bonn Department of Physics Boston University Department of Physics Brandeis University Transilvania University of Brasov Horia Hulubei National Institute of Physics and Nuclear Engineering Department of Physics Alexandru

This paper presents the measurement of fiducial and differential cross sections for both the inclusive and electroweak production of a same-sign W-boson pair in association with two jets (W^±W^±jj) using 139 fb⁻¹ of proton-proton collision data recorded at a centre-of-mass energy of s = 13 TeV by the ATLAS detector at the Large Hadron Collider. The analysis is performed by selecting two same-charge leptons, electron or muon, and at least two jets with large invariant mass and a large rapidity difference. The measured fiducial cross sections for electroweak and inclusive W^±W^±jj production are 2.92 ± 0.22 (stat.) ± 0.19 (syst.) fb and 3.38 ± 0.22 (stat.) ± 0.19 (syst.) fb, respectively, in agreement with Standard Model predictions. The measurements are used to constrain anomalous quartic gauge couplings by extracting 95% confidence level intervals on dimension-8 operators. A search for doubly charged Higgs bosons H^±± that are produced in vector-boson fusion processes and decay into a same-sign W boson pair is performed. The largest deviation from the Standard Model occurs for an H^±± mass near 450 GeV, with a global significance of 2.5 standard deviations. © The Author(s) 2024.

关键词： Hadron-Hadron Scattering Vector Boson Production

来源：评论

学校读者我要写书评

暂无评论

Big Data Processing Using Spark in Cloud 1st ed. 2019

引用

丛书名： Studies in Big Data

2019年

作者： Mamta Mittal Valentina E. Balas Lalit Mohan Goyal Raghvendra Kumar

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：