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

Flatband-Induced Itinerant Ferromagnetism in RbCo2Se2

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Huang, Jianwei Wang, Zhicai Pang, Hongsheng Wu, Han Cao, Huibo Mo, Sung-Kwan Rustagi, Avinash Kemper, A.F. Wang, Meng Yi, Ming Birgeneau, R.J. Department of Physics and Astronomy Rice University HoustonTX77005 United States School of the Gifted Young University of Science and Technology of China Hefei Anhui230026 China Neutron Scattering Division Oak Ridge National Laboratory Oak RidgeTN37831 United States Advanced Light Source Lawrence Berkeley National Lab BerkeleyCA94720 United States Department of Physics North Carolina State University RaleighNC27695 United States School of Electrical and Computer Engineering Purdue University West LafayetteIN47907 United States School of Physics Sun Yat-Sen University Guangzhou Guangdong510275 China Department of Physics University of California BerkeleyCA94720 United States Materials Science Division Lawrence Berkeley National Laboratory BerkeleyCA94720 United States

ACo2Se2 (A=K,Rb,Cs) is a homologue of the iron-based superconductor, AFe2Se2. From a comprehensive study of RbCo2Se2 via measurements of magnetization, transport, neutron diffraction, angle-resolved photoemission spectroscopy, and first-principle calculations, we identify a ferromagnetic order accompanied by an orbital-dependent spin-splitting of the electronic dispersions. Furthermore, we identify the ordered moment to be dominated by a dx2−y2 flatband near the Fermi level, which exhibits the largest spin splitting across the ferromagnetic transition, suggesting an itinerant origin of the ferromagnetism. In the broader context of the iron-based superconductors, we find this dx2−y2 flatband to be a common feature in the band structures of both iron-chalcogenides and iron-pnictides, accessible via heavy electron doping. Copyright © 2021, The Authors. All rights reserved.

关键词： Selenium compounds

Constant depth fault-tolerant clifford circuits for multi-qubit large block codes

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zheng, Yi-Cong Lai, Ching-Yi Brun, Todd A. Kwek, Leong-Chuan Tencent Quantum Lab Tencent Shenzhen Guangdong518057 China Centre for Quantum Technologies National University of Singapore Singapore117543 Singapore Yale-NUS College Singapore138527 Singapore Institute of Communications Engineering National Chiao Tung University Hsinchu30010 Taiwan Ming Hsieh Department of Electrical and Computer Engineering University of Southern California Los AngelesCA90089 United States MajuLab CNRS-UNS-NUS-NTU International Joint Research Unit UMI 3654 Singapore Institute of Advanced Studies Nanyang Technological University Singapore639673 Singapore National Institute of Education Nanyang Technological University Singapore637616 Singapore

Fault-tolerant quantum computation (FTQC) schemes using large block codes that encode k > 1 qubits in n physical qubits can potentially reduce the resource overhead to a great extent because of their high encoding rate. However, the fault-tolerant (FT) logical operations for the encoded qubits are difficult to find and implement, which usually takes not only a very large resource overhead but also long in-situ computation time. In this paper, we focus on Calderbank-Shor-Steane Jn;k;dK (CSS) codes and their logical FT Clifford circuits. We show that the depth of an arbitrary logical Clifford circuit can be implemented fault-tolerantly in O(1) steps in-situ via either Knill or Steane syndrome measurement circuit, with the qualified ancilla states efficiently prepared. Particularly, for those codes satisfying k/n ∼ Θ(1), the resource scaling for Clifford circuits implementation on the logical level can be the same as on the physical level up to a constant, which is independent of code distance d. With a suitable pipeline to produce ancilla states, our scheme requires only a modest resource cost in physical qubits, physical gates, and computation time for very large scale FTQC. Copyright © 2020, The Authors. All rights reserved.

关键词： Timing circuits

Constrained Multi-scale Dense Connections for Accurate Biomedical Image Segmentation

学校读者我要写书评

暂无评论

Constrained Multi-scale Dense Connections for Accurate Biome...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jiawei Zhang Yanchun Zhang Shanfeng Zhu Xiaowei Xu Shanghai key Laboratory of Data Science School of Computer Science Fudan University Shanghai China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou China College of Engineering and Science Victoria University Melbourne Australia ISTBI and Shanghai Institute of Artificial Intelligence Algorithms Fudan University Shanghai China Nanjing University Institute of Artificial Intelligence Biomedicine Nanjing China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai China Guangdong Provincial People’s Hospital Guangdong Cardiovascular Institute Guangzhou China

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

Biomedical image segmentation plays a critical role in clinical diagnosis and medical intervention. Recently, a variety of deep neural networks have boosted the biomedical image segmentation performance with a large margin, which adopts dense connections to explore rich representations in multiple scales. In multi-scale dense connections, features from all or most scales are fused or iteratively aggregated. In this paper, we propose constrained multi-scale dense connections (CMDC) for accurate biomedical image segmentation, which only fuse features from the nearest scales containing the most relevant appearance or semantic information. Based on CMDC, we further construct constraint multi-scale dense networks (CMD-Net) by applying CMDC to existing segmentation networks. Experiments across various architectures (including FCN-8s, U-Net, and DeeplabV3) and datasets (including GlaS, CRAG, KID, and ECS) demonstrate that CMD-Net not only outperforms existing schemes on both accuracy and efficiency but also can be easily generalized to a variety of segmentation networks. In addition, CMD-Net achieves state-of-the-art performance on two instance segmentation datasets, GlaS and CRAG.

关键词： Decoding Image segmentation Image resolution Biomedical imaging Glands Fuses Cancer

The medical segmentation decathlon

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Antonelli, Michela Reinke, Annika Bakas, Spyridon Farahani, Keyvan Kopp-Schneider, Annette Landman, Bennett A. Litjens, Geert Menze, Bjoern Ronneberger, Olaf Summers, Ronald M. van Ginneken, Bram Bilello, Michel Bilic, Patrick Christ, Patrick F. Do, Richard K.G. Gollub, Marc J. Heckers, Stephan H. Huisman, Henkjan Jarnagin, William R. McHugo, Maureen K. Napel, Sandy Golia Pernicka, Jennifer S. Rhode, Kawal Tobon-Gomez, Catalina Vorontsov, Eugene Hulsmon, Hankan Meakin, James A. Ourselin, Sebastien Wiesenfarth, Manuel Arbeláez, Pablo Bae, Byeonguk Chen, Sihong Daza, Laura Feng, Jianjiang He, Baochun Isensee, Fabian Ji, Yuanfeng Jia, Fucang Kim, Namkug Kim, Ildoo Merhof, Dorit Pai, Akshay Park, Beomhee Perslev, Mathias Rezaiifar, Ramin Rippel, Oliver Sarasua, Ignacio Shen, Wei Son, Jaemin Wachinger, Christian Wang, Liansheng Wang, Yan Xia, Yingda Xu, Daguang Xu, Zhanwei Zheng, Yefeng Simpson, Amber L. Maier-Hein, Lena Cardoso, M. Jorge School of Biomedical Engineering & Imaging Sciences King’s College London London United Kingdom Heidelberg Germany Heidelberg Germany Faculty of Mathematics and Computer Science University of Heidelberg Heidelberg Germany University of Pennsylvania PhiladelphiaPA United States BethesdaMD United States Heidelberg Germany Electrical Engineering and Computer Science Vanderbilt University NashvilleTN United States Radboud University Medical Center Radboud Institute for Health Sciences Nijmegen Netherlands Quantitative Biomedicine University of Zurich Zurich Switzerland DeepMind London United Kingdom School of Computing Department of Biomedical and Molecular Sciences Queen’s University KingstonON Canada Department of Surgery Memorial Sloan Kettering Cancer Center New YorkNY United States BethesdaMD United States Department of Informatics Technische Universität München Germany Department of Radiology Memorial Sloan Kettering Cancer Center New YorkNY United States Department of Psychiatry & Behavioral Sciences Vanderbilt University Medical Center NashvilleTN United States Department of Radiology Stanford University StanfordCA United States Department of Computer Science and Software Engineering École Polytechnique de Montréal Department of Radiology Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PhiladelphiaPA United States Medical Faculty University of Heidelberg Heidelberg Germany VUNO Inc. Seoul Korea Republic of Universidad de los Andes Colombia Department of Automation Tsinghua University Beijing China Heidelberg Germany Department of Computer Science Xiamen University Xiamen361005 China Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Kakao Brain Korea Republic of Institute of Imaging & Computer Vision RWTH Aachen University Aachen Germany Cere

International challenges have become the de facto standard for comparative assessment of image analysis algorithms given a specific task. Segmentation is so far the most widely investigated medical image processing task, but the various segmentation challenges have typically been organized in isolation, such that algorithm development was driven by the need to tackle a single specific clinical problem. We hypothesized that a method capable of performing well on multiple tasks will generalize well to a previously unseen task and potentially outperform a custom-designed solution. To investigate the hypothesis, we organized the Medical Segmentation Decathlon (MSD)—a biomedical image analysis challenge, in which algorithms compete in a multitude of both tasks and modalities. The underlying data set was designed to explore the axis of difficulties typically encountered when dealing with medical images, such as small data sets, unbalanced labels, multi-site data and small objects. The MSD challenge confirmed that algorithms with a consistent good performance on a set of tasks preserved their good average performance on a different set of previously unseen tasks. Moreover, by monitoring the MSD winner for two years, we found that this algorithm continued generalizing well to a wide range of other clinical problems, further confirming our hypothesis. Three main conclusions can be drawn from this study: (1) state-of-the-art image segmentation algorithms are mature, accurate, and generalize well when retrained on unseen tasks;(2) consistent algorithmic performance across multiple tasks is a strong surrogate of algorithmic generalizability;(3) the training of accurate AI segmentation models is now commoditized to non AI *** Codes 68T07. © 2021, CC BY-NC-SA.

关键词： Image segmentation

Is AI Robust Enough for Scientific Research?

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Jun-Jie Song, Jiahao Wang, Xiu-Cheng Li, Fu-Peng Liu, Zehan Chen, Jian-Nan Dang, Haoning Wang, Shiyao Zhang, Yiyan Xu, Jianhui Shi, Chunxiang Wang, Fei Pang, Long-Gang Cheng, Nan Zhang, Weiwei Zhang, Duo Meng, Deyu Northwest Institute of Nuclear Technology No. 28 Pingyu Road Shaanxi Xi’an710024 China School of Telecommunications Engineering Xidian University No. 2 South Taibai Road Shaanxi Xi’an710071 China State Key Laboratory of ISN No. 2 South Taibai Road Shaanxi Xi’an710071 China Institute of Particle Physics Central China Normal University No. 152 Luoyu Road Hubei Wuhan30079 China School of Computer Science and Technology Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China Ministry of Education Key Lab of Intelligent Networks and Network Security Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China Guangzhou Institute of Geography Academy of Sciences No. 100 Xianlie Road Guangdong Guangzhou510070 China National Meteorological Information Center Beijing100044 China MDX Research Center for Element Strategy Institute of Integrated Research Institute of Science Tokyo Midori-ku Yokohama226-8503 Japan School of Physics and Information Technology Shaanxi Normal University No. 620 West Chang’an Avenue Shaanxi Xi’an710119 China School of Aeronautics Northwestern Polytechnical University No. 127 West Youyi Road Shaanxi Xi’an710072 China AI for Science Institute Beijing100080 China DP Technology Beijing100080 China Academy for Advanced Interdisciplinary Studies Peking University Beijing100871 China School of Mathematics and Statistics Xi’an Jiaotong University No. 28 Xianning West Road Shaanxi Xi’an710049 China

We uncover a phenomenon largely overlooked by the scientific community utilizing AI: neural networks exhibit high susceptibility to minute perturbations, resulting in significant deviations in their outputs. Through an analysis of five diverse application areas—weather forecasting, chemical energy and force calculations, fluid dynamics, quantum chromodynamics, and wireless communication—we demonstrate that this vulnerability is a broad and general characteristic of AI systems. This revelation exposes a hidden risk in relying on neural networks for essential scientific computations, calling further studies on their reliability and security. © 2024, CC0.

关键词： Weather forecasting

Geo-Cloudlet: Time and Power Efficient Geospatial Query Resolution using Cloudlet

学校读者我要写书评

暂无评论

Geo-Cloudlet: Time and Power Efficient Geospatial Query Reso...

International Conference on advanced Computing, ICAC

作者： Jaydeep Das Anwesha Mukherjee Soumya K. Ghosh Rajkumar Buyya Advanced Technology Development Centre Indian Institute of Technology Kharagpur West Bengal India Department of Computer Science Mahishadal Raj College Purba Medinipur West Bengal India Department of Computer Science and Engineering Indian Institute of Technology Kharagpur West Bengal India Cloud Computing and Distributed Systems (CLOUDS) Lab School of Computing and Information Systems The University of Melbourne VIC Australia

ISBN: (数字)9781728152868

ISBN: (纸本)9781728152875

Geospatial data analysis is an emerging area of research today due to the potential to enable varied location-aware services. The existing centralized cloud-based analysis becomes time and computing-intensive for huge amount of geospatial data processing. This paper addresses the challenge of time and power-efficiency in QoS-aware geospatial query resolution. We propose a cloudlet based hierarchical paradigm, namely Geo-Cloudlet, where the cloudlets contain the geospatial data of the districts. The state and national level geospatial data are stored inside the state cloud and country cloud respectively. The query resolution is performed by either the cloudlet or by the state cloud or country cloud depending upon the geographical region related to the query. The experimental analysis illustrates that the proposed architecture Geo-Cloudlet reduces the latency up to 61.3% and power consumption up to 61.1% over the use of only remote cloud servers for geospatial query resolution.

关键词：

Developments and applications of the OPTIMADE API for materials discovery, design, and data exchange

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Evans, Matthew L. Bergsma, Johan Merkys, Andrius Andersen, Casper W. Andersson, Oskar B. Beltrán, Daniel Blokhin, Evgeny Boland, Tara M. Balderas, Rubén Castañeda Choudhary, Kamal Díaz, Alberto Díaz García, Rodrigo Domínguez Eckert, Hagen Eimre, Kristjan Montero, María Elena Fuentes Krajewski, Adam M. Mortensen, Jens Jørgen Duarte, José Manuel Nápoles Pietryga, Jacob Qi, Ji de Jesús Trejo Carrillo, Felipe Vaitkus, Antanas Yu, Jusong Zettel, Adam de Castro, Pedro Baptista Carlsson, Johan Cerqueira, Tiago F.T. Divilov, Simon Hajiyani, Hamidreza Hanke, Felix Jose, Kevin Oses, Corey Riebesell, Janosh Schmidt, Jonathan Winston, Donald Xie, Christen Yang, Xiaoyu Bonella, Sara Botti, Silvana Curtarolo, Stefano Draxl, Claudia Cobas, Luis Edmundo Fuentes Hospital, Adam Liu, Zi-Kui Marques, Miguel A.L. Marzari, Nicola Morris, Andrew J. Ong, Shyue Ping Orozco, Modesto Persson, Kristin A. Thygesen, Kristian S. Wolverton, Chris Scheidgen, Markus Toher, Cormac Conduit, Gareth J. Pizzi, Giovanni Gražulis, Saulius Rignanese, Gian-Marco Armiento, Rickard Chemin des Étoiles 8 Louvain-la-Neuve1348 Belgium Matgenix SRL 185 Rue Armand Bury Gozée6534 Belgium École Polytechnique Fédérale de Lausanne Avenue de Forel 3 Lausanne1015 Switzerland Institute of Biotechnology Life Sciences Center Vilnius University Sauletekio av. 7 VilniusLT-10257 Lithuania SINTEF P.O. Box 4760 Torgarden TrondheimNO-7465 Norway Materials Design and Informatics unit Department of Physics Chemistry and Biology Linköping University Sweden Baldiri i Reixac 10-12 Barcelona08028 Spain Tilde Materials Informatics Straßmannstraße 25 Berlin10249 Germany Materials Platform for Data Science Sepapaja 6 Tallinn15551 Estonia Computational Atomic-Scale Materials Design Technical University of Denmark Kgs. Lyngby Denmark Av. Miguel de Cervantes 120 Complejo Industrial Chihuahua Chihuahua Chih. 31136 Mexico Material Measurement Laboratory National Institute of Standards and Technology GaithersburgMD20899 United States Department of Mechanical Engineering and Materials Science Duke University DurhamNC27708 United States Center for Extreme Materials Duke University DurhamNC27708 United States École Polytechnique Fédérale de Lausanne Lausanne1015 Switzerland Universidad Autónoma de Chihuahua Facultad de Ciencias Quimicas Chihuahua31125 Mexico Department of Materials Science and Engineering The Pennsylvania State University University ParkPA16802 United States Department of Materials Science and Engineering Northwestern University EvanstonIL60208 United States Department of NanoEngineering University of California 9500 Gilman Drive La Jolla San DiegoCA92093-0448 United States National Institute for Materials Science 1-2-1 Sengen Ibaraki Tsukuba305-0047 Japan Dassault Systèmes Germany GmbH Am Kabellager 11-13 Cologne51063 Germany CFisUC Department of Physics University of Coimbra Rua Larga Coimbra3004-516 Portugal Dassault Systèmes 22 Science Park CB4 0FJ United Kingdom Theory of Condensed Matter Cavendis

The Open Databases Integration for Materials Design (OPTIMADE) application programming interface (API) empowers users with holistic access to a growing federation of databases, enhancing the accessibility and discoverability of materials and chemical data. Since the first release of the OPTIMADE specification (v1.0), the API has undergone significant development, leading to the v1.2 release, and has underpinned multiple scientific studies. In this work, we highlight the latest features of the API format, accompanying software tools, and provide an update on the implementation of OPTIMADE in contributing materials databases. We end by providing several use cases that demonstrate the utility of the OPTIMADE API in materials research that continue to drive its ongoing development. © 2024, CC BY.

关键词： Electronic data interchange

A probabilistic framework of preference discovery from folksonomy corpus

学校读者我要写书评

暂无评论

Frontiers of computer Science 2017年第6期11卷 1075-1084页

作者： Xiaohui GUO Chunming HU Richong ZHANG Jinpeng HUAI State Key Lab of Software Development Environment Beihang University Beijing 100191 China Institute of Advanced Computing Technology School of Computer Science and Engineering Beihang University Beijing 100191 China

The increasing availability of folksonomy data makes them vital for user profiling approaches to precisely detect user preferences and better understand user interests, so as to render some personalized recommendation or re- trieval results. This paper presents a rigorous probabilis- tic framework to discover user preference from folkson- omy data. Furthermore, we incorporate three models into the framework with the corresponding inference methods, expectation-maximization or Gibbs sampling algorithms. The user preference is expressed through topical conditional distributions. Moreover, to demonstrate the versatility of our framework, a recommendation method is introduced to show the possible usage of our framework and evaluate the applica- bility of the engaged models. The experimental results show that, with the help of the proposed framework, the user pref- erence can be effectively discovered.

关键词： preference discovery tagging folksonomy so-cial annotation

EAODBT: Efficient Auditing for Outsourced Database with Token Enforced Cloud Storage

学校读者我要写书评

暂无评论

EAODBT: Efficient Auditing for Outsourced Database with Toke...

IEEE International WIE Conference on Electrical and computer engineering (WIECON-ECE)

作者： C M Geeta B N Rashmi R G Shreyas Raju S Raghavendra Rajkumar Buyya K R Venugopal S S Iyengar L M Patnaik UVCE Bangalore University Bengaluru India CLOUDS Lab School of Computing and Information Systems The University of Melbourne Australia Bangalore University Bengaluru India Department of Computer Science and Engineering Florida International University USA INSA National Institute of Advanced Studies Indian Institute of Science Campus Bengaluru India

ISBN: (数字)9781728144993

ISBN: (纸本)9781728145006

Database outsourcing is one of the important utilities in cloud computing in which the Information Proprietor (IP) transfers the database administration to the Cloud Service Provider (CSP) in order to minimize the administration cost and preservation expenses of the database. Inspite of its immense profit, it undergoes few security issues such as privacy of deployed database and provability of search results. In the recent past, few of the studies have been carried out on provability of search results of Outsourced Database (ODB) that affords correctness and completeness of search results. But in the existing schemes, since there is flow of data between the Information Proprietor and the clients frequently, huge communication cost prevails at the Information Proprietor side. To address this challenge, in this paper we propose Efficient Auditing for Outsourced Database with Token Enforced Cloud Storage (EAODBT). The proposed scheme reduces the large communication cost prevailing at the Information Proprietor side and achieves correctness and completeness of search results even if the mischievous CSP knowingly sends a null set. Experimental analysis show that the proposed scheme has totally reduced the huge communication cost prevailing between Information Proprietor and clients, and simultaneously achieves the correctness and completeness of search results.

关键词： Databases IP networks Cloud computing Security Outsourcing Reliability Data privacy