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

SSRN 2025年

作者： Suttels, Véronique Brokowski, Trevor Wachinou, Ablo Prudence Wolleb, Julia Hada, Aboudou Rasisou Du Toit, Jacques Daniel Fiogbé, Arnauld Attannon Guendehou, Brice Alovokpinhou, Frederic Sefou, Fadyl Makpemikpa, Ginette Bessat, Cécile Roux, Alexia Garcia, Elena Brahier, Thomas Opota, Onya Doenz, Jonathan Vignoud, Julien Agodokpessi, Gildas Affolabi, Dissou Hartley, Mary-Anne Boillat-Blanco, Noémie Department of Medicine Infectious Diseases Lausanne University Hospital University of Lausanne Lausanne Switzerland Yale School of Medicine Department of Biomedical Informatics & Data Science New HavenCT06510 United States Cotonou Benin Faculty of Health Sciences University of the Witwatersrand Johannesburg South Africa Emergency Department Lausanne University Hospital University of Lausanne Lausanne1011 Switzerland Institute of Microbiology University of Lausanne University Hospital Centre Lausanne Switzerland Lausanne1015 Switzerland National Reference Laboratory for Mycobacteriology Cotonou Benin Yale University United States Faculty of Health Sciences Benin Intelligent Global Health Machine Learning and Optimization Laboratory

Background: Point-of-care lung ultrasound (LUS) is a promising tool for portable sputum-free tuberculosis (TB) triage. We investigate the diagnostic performance of LUS to detect TB using expert and artificial intelligence (AI) guided interpretation. We introduce ULTR-AI (Ultrasound-led TB recognition using AI), a suite of deep learning (DL) models designed to automate TB prediction from LUS images. Methods: In this prospective cohort study in a tertiary center in urban Benin, a standardized 14-point sliding scan LUS protocol was performed for symptomatic patients by a trained operator. LUS images were reviewed by two blinded and independent readers. Same-day single sputum Xpert MTB/RIF Ultra® was the microbiological reference standard. The suite comprises three AI models, ULTR-AI, ULTR-AI[signs] and ULTR-AI[max]. ULTR-AI predicts TB directly from images using DL, ULTR-AI[signs] first generates human-recognizable pathological signs before TB risk prediction in a machine learning (ML) model. Finally, ULTR-AI[max] takes the maximal TB risk score predicted by these two models. Findings: Out of 760 patients screened, 504 were analyzed. Median age was 40 (IQR 30-52), 196 (39%) were female, 78 (15%) were people with HIV and 66 (13%) had previous TB. Overall, 192 (38%) had bacteriologically confirmed TB. Human expert interpretation of lung ultrasound achieved a sensitivity of 0·90 (95%CI: 0·89, 0·92), specificity of 0·61 (95%CI: 0·54, 0·67) [AUROC 0·84, 95% CI: 0.82-0.85]. AI-guided interpretation with ULTRA-AI[max] reached a sensitivity of 0·91 (95% CI, 0·90–0·96) and a specificity of 0·85 (95% CI, 0·74–0·88) [AUROC 0·93, 95% 0·92-0·95]. Interpretation: In this cohort, AI-guided LUS meets the WHO requirements for a sputum-free TB triage test, enabling point-of-care testing with minimal infrastructure. ULTR-AI could further help decentralize TB diagnostics in LMICs, improving timely detection. Validation in diverse populations is crucial to confirm clinical utility. © 2025,

关键词： Lung cancer

来源：评论

学校读者我要写书评

暂无评论

TEEM: Two-Factor Energy Evaluation Metric Toward Green Big data System

TEEM: Two-Factor Energy Evaluation Metric Toward Green Big D...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Weidong Fang Chunsheng Zhu Mohsen Guizani Zhiqi Li Wuxiong Zhang Joel J.P.C. Rodrigues Science and Technology on Micro-system Laboratory Shanghai Institute of Micro-system and Information Technology Chinese Academy of Sciences Shanghai China University of Chinese Academy of Sciences Beijing China Shanghai Research and Development Center for Micro-Nano Electronics Shanghai China College of Big Data and Internet Shenzhen Technology University Shenzhen China Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence (MBZUAI) UAE COPELABS Lusófona University Lisbon Portugal

Toward green Big data System (BDS), one of the key requirements is to save energy consumption so that the system lifetime can be prolonged. Hence, the energy evaluation metric for the measurement of energy efficiency in green BDS, is very critical. Unfortunately, most current energy evaluation metrics are based on a single factor, which might be difficult to meet the diverse application requirements. In this paper, we propose a novel two-factor energy evaluation metric (TEEM) for green BDS. Specifically, the transmission distance and the modulation level are taken into account simultaneously, generating a metric named the bit-per energy consumption (BEC). Extensive simulation results demonstrate that the system performance in energy consumption can be more effectively evaluated by BEC.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Computationally Efficient Approximations for Matrix-based Rényi's Entropy

arXiv

引用

arXiv 2021年

作者： Gong, Tieliang Dong, Yuxin Yu, Shujian Dong, Bo The School of Computer Science and Technology Xi'an Jiaotong University Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an710049 China The Machine Learning Group UiT - The Arctic University of Norway Department of Computer Science Vrije University Amsterdam Amsterdam Netherlands

The recently developed matrix-based Rényi's αorder entropy enables measurement of information in data simply using the eigenspectrum of symmetric positive semi-definite (PSD) matrices in reproducing kernel Hilbert space, without estimation of the underlying data distribution. This intriguing property makes this new information measurement widely adopted in multiple statistical inference and learning tasks. However, the computation of such quantity involves the trace operator on a PSD matrix G to power α (i.e., tr(Gα)), with a normal complexity of nearly O(n3), which severely hampers its practical usage when the number of samples (i.e., n) is large. In this work, we present computationally efficient approximations to this new entropy functional that can reduce its complexity to even significantly less than O(n2). To this end, we leverage the recent progress on Randomized Numerical Linear Algebra, developing Taylor, Chebyshev and Lanczos approximations to tr(Gα) for arbitrary values of α by converting it into a matrix-vector multiplication problem. We also establish the connection between the matrix-based Rényi's entropy and PSD matrix approximation, which enables exploiting both clustering and block low-rank structure of G to further reduce the computational cost. We theoretically provide approximation accuracy guarantees and illustrate the properties for different approximations. Large-scale experimental evaluations on both synthetic and real-world data corroborate our theoretical findings, showing promising speedup with negligible loss in accuracy. Copyright © 2021, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Nanoscale chemical imaging with structured X-ray illumination

引用

Proceedings of the National Academy of sciences of the United States of America 2023年第49期120卷 e2314542120-e2314542120页

作者： Li, Jizhou Chen, Si Ratner, Daniel Blu, Thierry Pianetta, Piero Liu, Yijin Stanford Synchrotron Radiation Lightsource SLAC National Accelerator Laboratory Menlo Park 94025 CA United States School of Data Science City University of HongKong Hong Kong X-ray Science Division Argonne National Laboratory Lemont 60439 IL United States Machine Learning Initiative SLAC National Accelerator Laboratory Menlo Park 94025 CA United States Department of Electronic Engineering The Chinese University of Hong Kong Hong Kong Walker Department of Mechanical Engineering The University of Texas at Austin Austin 78705 TX United States

High-resolution imaging with compositional and chemical sensitivity is crucial for a wide range of scientific and engineering disciplines. Although synchrotron X-ray imaging through spectromicroscopy has been tremendously successful and broadly applied, it encounters challenges in achieving enhanced detection sensitivity, satisfactory spatial resolution, and high experimental throughput simultaneously. In this work, based on structured illumination, we develop a single-pixel X-ray imaging approach coupled with a generative image reconstruction model for mapping the compositional heterogeneity with nanoscale resolvability. This method integrates a full-field transmission X-ray microscope with an X-ray fluorescence detector and eliminates the need for nanoscale X-ray focusing and raster scanning. We experimentally demonstrate the effectiveness of our approach by imaging a battery sample composed of mixed cathode materials and successfully retrieving the compositional variations of the imaged cathode particles. Bridging the gap between structural and chemical characterizations using X-rays, this technique opens up vast opportunities in the fields of biology, environmental, and materials science, especially for radiation-sensitive samples. © 2023 the Author(s).

关键词： image reconstruction synchrotron X-rays transmission X-ray microscopy X-ray chemical imaging X-ray fluorescence

来源：评论

学校读者我要写书评

暂无评论

Robust and Fast Measure of Information via Low-rank Representation

arXiv

引用

arXiv 2022年

作者： Dong, Yuxin Gong, Tieliang Yu, Shujian Chen, Hong Li, Chen School of Computer Science and Technology Xi’an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China Machine Learning Group UiT - The Arctic University of Norway Norway College of Science Huazhong Agriculture University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China

The matrix-based Rényi’s entropy allows us to directly quantify information measures from given data, without explicit estimation of the underlying probability distribution. This intriguing property makes it widely applied in statistical inference and machine learning tasks. However, this information theoretical quantity is not robust against noise in the data, and is computationally prohibitive in large-scale applications. To address these issues, we propose a novel measure of information, termed low-rank matrix-based Rényi’s entropy, based on low-rank representations of infinitely divisible kernel matrices. The proposed entropy functional inherits the specialty of of the original definition to directly quantify information from data, but enjoys additional advantages including robustness and effective calculation. Specifically, our low-rank variant is more sensitive to informative perturbations induced by changes in underlying distributions, while being insensitive to uninformative ones caused by noises. Moreover, low-rank Rényi’s entropy can be efficiently approximated by random projection and Lanczos iteration techniques, reducing the overall complexity from O(n3) to O(n2s) or even O(ns2), where n is the number of data samples and s n. We conduct large-scale experiments to evaluate the effectiveness of this new information measure, demonstrating superior results compared to matrix-based Rényi’s entropy in terms of both performance and computational efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Touchstone Benchmark: Are We on the Right Way for Evaluating AI Algorithms for Medical Segmentation?

arXiv

引用

arXiv 2024年

作者： Bassi, Pedro R.A.S. Li, Wenxuan Tang, Yucheng Isensee, Fabian Wang, Zifu Chen, Jieneng Chou, Yu-Cheng Roy, Saikat Kirchhoff, Yannick Rokuss, Maximilian Huang, Ziyan Ye, Jin He, Junjun Wald, Tassilo Ulrich, Constantin Baumgartner, Michael Maier-Hein, Klaus H. Jaeger, Paul Ye, Yiwen Xie, Yutong Zhang, Jianpeng Chen, Ziyang Xia, Yong Xing, Zhaohu Zhu, Lei Sadegheih, Yousef Bozorgpour, Afshin Kumari, Pratibha Azad, Reza Merhof, Dorit Shi, Pengcheng Ma, Ting Du, Yuxin Bai, Fan Huang, Tiejun Zhao, Bo Wang, Haonan Li, Xiaomeng Gu, Hanxue Dong, Haoyu Yang, Jichen Mazurowski, Maciej A. Gupta, Saumya Wu, Linshan Zhuang, Jiaxin Chen, Hao Roth, Holger Xu, Daguang Blaschko, Matthew B. Decherchi, Sergio Cavalli, Andrea Yuille, Alan L. Zhou, Zongwei Department of Computer Science Johns Hopkins University United States Department of Pharmacy and Biotechnology University of Bologna Italy Center for Biomolecular Nanotechnologies Istituto Italiano di Tecnologia Italy NVIDIA United States Germany Germany ESAT-PSI KU Leuven Belgium Faculty of Mathematics and Computer Science Heidelberg University Germany HIDSS4Health - Helmholtz Information and Data Science School for Health Germany Shanghai Jiao Tong University China Shanghai Artificial Intelligence Laboratory China Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Germany DKFZ Germany School of Computer Science and Engineering Northwestern Polytechnical University China Australian Institute for Machine Learning The University of Adelaide Australia College of Computer Science and Technology Zhejiang University China Hong Kong University of Science and Technology Guangzhou China Hong Kong University of Science and Technology Hong Kong Faculty of Informatics and Data Science University of Regensburg Germany Faculty of Electrical Engineering and Information Technology RWTH Aachen University Germany Fraunhofer Institute for Digital Medicine MEVIS Germany Electronic & Information Engineering School Harbin Institute of Technology Shenzhen China China The Chinese University of Hong Kong Hong Kong Peking University China Department of Electrical and Computer Engineering Duke University United States Stony Brook University United States Department of Computer Science and Engineering Department of Chemical and Biological Engineering Division of Life Science Hong Kong University of Science and Technology Hong Kong Data Science and Computation Facility Fondazione Istituto Italiano di Tecnologia Italy Ecole Polytechnique Fédérale de Lausanne Switzerland

How can we test AI performance? This question seems trivial, but it isn’t. Standard benchmarks often have problems such as in-distribution and small-size test sets, oversimplified metrics, unfair comparisons, and short-term outcome pressure. As a consequence, good performance on standard benchmarks does not guarantee success in real-world scenarios. To address these problems, we present Touchstone, a large-scale collaborative segmentation benchmark of 9 types of abdominal organs. This benchmark is based on 5,195 training CT scans from 76 hospitals around the world and 5,903 testing CT scans from 11 additional hospitals. This diverse test set enhances the statistical significance of benchmark results and rigorously evaluates AI algorithms across out-of-distribution scenarios. We invited 14 inventors of 19 AI algorithms to train their algorithms, while our team, as a third party, independently evaluated these algorithms. In addition, we also evaluated pre-existing AI frameworks—which, differing from algorithms, are more flexible and can support different algorithms—including MONAI from NVIDIA, nnU-Net from DKFZ, and numerous other open-source frameworks. We are committed to expanding this benchmark to encourage more innovation of AI algorithms for the medical domain. Copyright © 2024, The Authors. All rights reserved.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

Estimate the efficiency of multiprocessor's cash memory work algorithms

arXiv

引用

arXiv 2021年

作者： Hamada, Mohamed A. Abdallah, Abdelrahman International Information Technology University Almaty Almaty050000 Kazakhstan Department of Machine Learning & Data Science Satbayev University Almaty Almaty050013 Kazakhstan National Open Research Laboratory for Information and Space Technologies Satbayev University Almaty Almaty050013 Kazakhstan

Many computer systems for calculating the proper organization of memory are among the most critical issues. Using a tier cache memory (along with branching prediction) is an effective means of increasing modern multi-core processors' performance. Designing high-performance processors is a complex task and requires preliminary verification and analysis of the model level, usually used in analytical and simulation modeling. The refinement of extreme programming is an unfortunate challenge. Few experts disagree with the synthesis of access points. This article demonstrates that Internet QoS and 16-bit architectures are always incompatible, but it's the same situation for write-back caches. The solution to this problem can be implemented by analyzing simulation models of different complexity in combination with the analytical evaluation of individual algorithms. This work is devoted to designing a multi-parameter simulation model of a multi-process for evaluating the performance of cache memory algorithms and the optimality of the structure. Optimization of the structures and algorithms of the cache memory allows you to accelerate the interaction of the memory process and improve the performance of the entire system. © 2021, CC BY.

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Overview of the Tenth Dialog System Technology Challenge: DSTC10

引用

IEEE/ACM Transactions on Audio Speech and Language Processing 2024年 32卷 765-778页

作者： Yoshino, Koichiro Chen, Yun-Nung Crook, Paul Kottur, Satwik Li, Jinchao Hedayatnia, Behnam Moon, Seungwhan Fei, Zhengcong Li, Zekang Zhang, Jinchao Feng, Yang Zhou, Jie Kim, Seokhwan Liu, Yang Jin, Di Papangelis, Alexandros Gopalakrishnan, Karthik Hakkani-Tur, Dilek Damavandi, Babak Geramifard, Alborz Hori, Chiori Shah, Ankit Zhang, Chen Li, Haizhou Sedoc, Joao D'haro, Luis F. Banchs, Rafael Rudnicky, Alexander Guardian Robot Project R-IH RIKEN 2-2-2 Hikaridai Seika Shoraku619-0288 Japan Information Science Nara Institute of Science and Technology Ikoma630-0101 Japan Computer Science and Information Engineering National Taiwan University Taipei10617 Taiwan Inc. Palo AltoCA95054 United States Alexa AI *** Inc. SunnyvaleCA94089 United States Meta Seattle RedmondWA98052 United States Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China Tencent AI Lab Beijing Beijing China Kexueyuan South Road Zhongguancun Beijing100190 China Beijing 100190 China Alexa AI *** Inc. SunnyvaleCA United States 1120 Enterprise way Sunnyvale94089 United States *** Inc. SeattleWA United States Menlo Park CA United States Audio and Speech Group Mitsubishi Electric Research Laboratories CambridgeMA02139-1955 United States Carnegie Mellon University Department of Language and Information Technologies or just Carnegie Mellon University Pittsburgh United States National University of Singapore Singapore Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore Shenzhen Research Institute of Big Data School of Data Science Chinese University of Hong Kong Shenzhen518172 China New York University New YorkNY United States ETSI de Telecomunicacion - Speech Technology and Machine Learning Group Universidad Politecnica de Madrid Ciudad Universitaria Madrid28040 Spain Nanyang Technological University Singapore Singapore Carnegie Mellon University PittsburghPA United States

This article introduces the Tenth Dialog System Technology Challenge (DSTC-10). This edition of the DSTC focuses on applying end-to-end dialog technologies for five distinct tasks in dialog systems, namely 1. Incorporation of Meme images into open domain dialogs, 2. Knowledge-grounded Task-oriented Dialogue Modeling on Spoken Conversations, 3. Situated Interactive Multimodal dialogs, 4. Reasoning for Audio Visual Scene-Aware Dialog, and 5. Automatic Evaluation and Moderation of Open-domainDialogue Systems. This article describes the task definition, provided datasets, baselines, and evaluation setup for each track. We also summarize the results of the submitted systems to highlight the general trends of the state-of-the-art technologies for the tasks. © 2023 The Authors.

关键词： Job analysis

来源：评论

学校读者我要写书评

暂无评论

Modeling Annotator Preference and Stochastic Annotation Error for Medical Image Segmentation

arXiv

引用

arXiv 2021年

作者： Liao, Zehui Hu, Shishuai Xie, Yutong Xia, Yong National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University Xi’an710072 China Australian Institute for Machine Learning The University of Adelaide AdelaideSA5000 Australia

Manual annotation of medical images is highly subjective, leading to inevitable and huge annotation biases. Deep learning models may surpass human performance on a variety of tasks, but they may also mimic or amplify these biases. Although we can have multiple annotators and fuse their annotations to reduce stochastic errors, we cannot use this strategy to handle the bias caused by annotators’ preferences. In this paper, we highlight the issue of annotator-related biases on medical image segmentation tasks, and propose a Preference-involved Annotation Distribution learning (PADL) framework to address it from the perspective of disentangling an annotator’s preference from stochastic errors using distribution learning so as to produce not only a meta segmentation but also the segmentation possibly made by each annotator. Under this framework, a stochastic error modeling (SEM) module estimates the meta segmentation map and average stochastic error map, and a series of human preference modeling (HPM) modules estimate each annotator’s segmentation and the corresponding stochastic error. We evaluated our PADL framework on two medical image benchmarks with different imaging modalities, which have been annotated by multiple medical professionals, and achieved promising performance on all five medical image segmentation tasks. © 2021, CC BY-NC-ND.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Towards DMC accuracy across chemical space with scalable ∆-QML

arXiv

引用

arXiv 2022年

作者： Huang, Bing von Lilienfeld, O. Anatole Krogel, Jaron T. Benali, Anouar University of Vienna Faculty of Physics Kolingasse 14-16 Vienna1090 Austria Departments of Chemistry Materials Science and Engineering and Physics University of Toronto St. George Campus TorontoON Canada Vector Institute for Artificial Intelligence TorontoONM5S 1M1 Canada Machine Learning Group Technische Universität Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany Materials Science and Technology Division Oak Ridge National Laboratory Oak RidgeTN37831 United States Computational Sciences Division Argonne National Laboratory ArgonneIL60439 United States

In the past decade, quantum diffusion Monte Carlo (DMC) has been demonstrated to successfully predict the energetics and properties of a wide range of molecules and solids by numerically solving the electronic many-body Schrödinger equation. We show that when coupled with quantum machine learning (QML) based surrogate methods the computational burden can be alleviated such that QMC shows clear potential to under-gird the formation of high quality descriptions across chemical space. We discuss three crucial approximations necessary to accomplish this: The fixed node approximation, universal and accurate references for chemical bond dissociation energies, and scalable minimal amons set based QML (AQML) models. Numerical evidence presented includes converged DMC results for over one thousand small organic molecules with up to 5 heavy atoms used as amons, and 50 medium sized organic molecules with 9 heavy atoms to validate the AQML predictions. Numerical evidence collected for ∆-AQML models suggests that already modestly sized QMC training data sets of amons suffice to predict total energies with near chemical accuracy throughout chemical space. Copyright © 2022, The Authors. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：