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

arXiv 2020年

作者： Shi, Feng Wang, Jun Shi, Jun Wu, Ziyan Wang, Qian Tang, Zhenyu He, Kelei Shi, Yinghuan Shen, Dinggang Department of Research and Development Shanghai United Imaging Intelligence Co. Ltd. Shanghai200232 Key Laboratory of Specialty Fiber Optics and Optical Access Networks Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai University Shanghai200444 United Imaging Intelligence CambridgeMA02140 United States Institute for Medical Imaging Technology School of Biomedical Engineering Shanghai Jiao Tong University Shanghai200030 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 Medical School of Nanjing University Nanjing China National Institute of Healthcare Data Science Nanjing University Nanjing210093 China National Key Laboratory for Novel Software and Technology Nanjing University Nanjing China

The pandemic of coronavirus disease 2019 (COVID-19) is spreading all over the world. Medical imaging such as X-ray and computed tomography (CT) plays an essential role in the global fight against COVID-19, whereas the recently emerging artificial intelligence (AI) technologies further strengthen the power of the imaging tools and help medical specialists. We hereby review the rapid responses in the community of medical imaging (empowered by AI) toward COVID-19. For example, AI-empowered image acquisition can significantly help automate the scanning procedure and also reshape the workflow with minimal contact to patients, providing the best protection to the imaging technicians. Also, AI ca n improve work efficiency by accurate delination of infections in X-ray and CT images, facilitating subsequent quantification. Moreover, the computer-aided platforms help radiologists make clinical decisions, i.e., for disease diagnosis, tracking, and prognosis. In this review paper, we thus cover the entire pipeline of medical imaging and analysis techniques involved with COVID-19, including image acquisition, segmentation, diagnosis, and follow-up. We particularly focus on the integration of AI with X-ray and CT, both of which are widely used in the frontline hospitals, in order to depict the latest progress of medical imaging and radiology fighting against COVID-19. Copyright © 2020, The Authors. All rights reserved.

关键词： Coronavirus

来源：评论

学校读者我要写书评

暂无评论

The Library for Hadoop Deflate Compression Based on FPGA Accelerator with Load Balance

The Library for Hadoop Deflate Compression Based on FPGA Acc...

引用

IEEE International Conference on Parallel and Distributed computing, Applications and Technologies (PDCAT)

作者： Haixin Du Jiankui Zhang Shihao Sha Cai Ye Qiuming Luo College of Computer Science and Software Engineering Shenzhen University NHPCC/Guangdong Key Laboratory of popular HPC and Guangdong Province Engineering Center of China-made High Performance Data Computing System Shenzhen China

ISBN: (数字)9781728126166

ISBN: (纸本)9781728126173

Hadoop application will produce lots of intermediate results in the map/reduce process that requires disk I/O and network transmission. By compressing the large-scale data of intermediate result, it will greatly improve disk access efficiently and reduce program run time. Hardware-accelerated solutions have become more desirable. This paper design a multi-FPGA compression accelerator on the Hadoop platform, and the system performance analysis compared with a software-only solution that mainly uses CPU to processing. The testing programs are zpipe, TestDFSIO and Terasort. In contrast with the software-only solution. The max speedup of zpipe is 6.55X (single FPGA) and 10.24X (dual FPGA), the max speedup of TestDFSIO is 6.28X (single FPGA) and 6.28X (dual FPGA), and the max speedup of Terasort application is up to 3.25X(single FPGA) and 3.35X(dual FPGA).

关键词： Handheld computers Conferences Computer science Software engineering Distributed databases Indexes

来源：评论

学校读者我要写书评

暂无评论

Mitigating medical dataset bias by learning adaptive agreement from a biased council

引用

Medical Image Analysis 2025年

作者： Luyang Luo Xin Huang Minghao Wang Zhuoyue Wan Wanteng Ma Hao Chen Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong China Department of Biomedical Informatics Harvard University Cambridge USA Department of Chemical and Biological Engineering The Hong Kong University of Science and Technology Hong Kong China Department of Computing The Hong Kong Polytechnic University Hong Kong China Department of Statistics and Data Science University of Pennsylvania Philadelphia USA Division of Life Science Hong Kong University of Science and Technology Hong Kong China HKUST Shenzhen-Hong Kong Collaborative Innovation Research Institute Futian Shenzhen China State Key Laboratory of Molecular Neuroscience The Hong Kong University of Science and Technology Hong Kong China

dataset bias in images is an important yet less explored topic in medical images. Deep learning could be prone to learning spurious correlation raised by dataset bias, resulting in inaccurate, unreliable, and unfair models, which impedes its adoption in real-world clinical applications. Despite its significance, there is a dearth of research in the medical image classification domain to address dataset bias. Furthermore, the bias labels are often agnostic, as identifying biases can be laborious and depend on post-hoc interpretation. This paper proposes learning Adaptive Agreement from a Biased Council (Ada-ABC), a debiasing framework that does not rely on explicit bias labels to tackle dataset bias in medical images. Ada-ABC develops a biased council consisting of multiple classifiers optimized with generalized cross entropy loss to learn the dataset bias. A debiasing model is then simultaneously trained under the guidance of the biased council. Specifically, the debiasing model is required to learn adaptive agreement with the biased council by agreeing on the correctly predicted samples and disagreeing on the wrongly predicted samples by the biased council. In this way, the debiasing model could learn the target attribute on the samples without spurious correlations while also avoiding ignoring the rich information in samples with spurious correlations. We theoretically demonstrated that the debiasing model could learn the target features when the biased model successfully captures dataset bias. Moreover, we constructed the first medical debiasing benchmark focusing on addressing spurious correlation from four datasets containing seven different bias scenarios. Our extensive experiments practically showed that our proposed Ada-ABC outperformed competitive approaches, verifying its effectiveness in mitigating dataset bias for medical image classification. The codes and organized benchmark datasets can be accessed via https://***/LLYXC/Ada-ABC .

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adversarial directed graph embedding

arXiv

引用

arXiv 2020年

作者： Zhu, Shijie Li, Jianxin Peng, Hao Wang, Senzhang He, Lifang Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China State Key Laboratory of Software Development Environment Beihang University Beijing100191 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China Department of Computer Science and Engineering Lehigh University BethlehemPA United States

Node representation learning for directed graphs is critically important to facilitate many graph mining tasks. To capture the directed edges between nodes, existing methods mostly learn two embedding vectors for each node, source vector and target vector. However, these methods learn the source and target vectors separately. For the node with very low indegree or outdegree, the corresponding target vector or source vector cannot be effectively learned. In this paper, we propose a novel Directed Graph embedding framework based on Generative Adversarial Network, called DGGAN. The main idea is to use adversarial mechanisms to deploy a discriminator and two generators that jointly learn each node's source and target vectors. For a given node, the two generators are trained to generate its fake target and source neighbor nodes from the same underlying distribution, and the discriminator aims to distinguish whether a neighbor node is real or fake. The two generators are formulated into a unified framework and could mutually reinforce each other to learn more robust source and target vectors. Extensive experiments show that DGGAN consistently and significantly outperforms existing state-of-the-art methods across multiple graph mining tasks on directed graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Graph wavelet neural network

arXiv

引用

arXiv 2019年

作者： Xu, Bingbing Shen, Huawei Cao, Qi Qiu, Yunqi Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China

We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained via a fast algorithm without requiring matrix eigendecomposition with high computational cost. Moreover, graph wavelets are sparse and localized in vertex domain, offering high efficiency and good interpretability for graph convolution. The proposed GWNN significantly outperforms previous spectral graph CNNs in the task of graph-based semi-supervised classification on three benchmark datasets: Cora, Citeseer and Pubmed. Copyright © 2019, The Authors. All rights reserved.

关键词： Wavelet transforms

来源：评论

学校读者我要写书评

暂无评论

Relation-Guided Representation Learning

arXiv

引用

arXiv 2020年

作者： Kang, Zhao Lu, Xiao Liang, Jian Bai, Kun Xu, Zenglin School of Computer Science and Engineering University of Electronic Science and Technology of China Sichuan China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Cloud and Smart Industries Group Tencent Beijing China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Center for Artificial Intelligence Peng Cheng Lab Shenzhen China

Deep auto-encoders (DAEs) have achieved great success in learning data representations via the powerful representability of neural networks. But most DAEs only focus on the most dominant structures which are able to reconstruct the data from a latent space and neglect rich latent structural information. In this work, we propose a new representation learning method that explicitly models and leverages sample relations, which in turn is used as supervision to guide the representation learning. Different from previous work, our framework well preserves the relations between samples. Since the prediction of pairwise relations themselves is a fundamental problem, our model adaptively learns them from data. This provides much flexibility to encode real data manifold. The important role of relation and representation learning is evaluated on the clustering task. Extensive experiments on benchmark data sets demonstrate the superiority of our approach. By seeking to embed samples into subspace, we further show that our method can address the large-scale and out-of-sample problem. Our source code is publicly available at: https://***/nbShawnLu/RGRL. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

ALOR: Adaptive layout optimization of raft groups for heterogeneous distributed key-value stores 1

引用

15th IFIP International Conference on Network and Parallel computing, NPC 2018

作者： Wang, Yangyang Chai, Yunpeng Wang, Xin Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China School of Information Renmin University of China Beijing China College of Intelligence and Computing Tianjin University Tianjin China

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

Many distributed key-value storage systems employ the simple and effective Raft protocol to ensure data consistency. They usually assume a homogeneous node hardware configuration for the underlying cluster and thus adopt even data distribution schemes. However, today’s distributed systems tend to be heterogeneous in nodes’ I/O devices due to the regular worn I/O device replacement and the emergence of expensive new storage media (e.g., non-volatile memory). In this paper, we propose a new data layout scheme called Adaptive Layout Optimization of Raft groups (ALOR), considering the hardware heterogeneity of the cluster. ALOR aims to optimize the data layout of Raft groups to achieve a better practical load balance, which leads to higher performance. ALOR consists of two components: leader migration in Raft groups and skewed data layout based on cold data migration. We conducted experiments on a practical heterogeneous cluster, and the results indicate that, on average, ALOR improves throughput by 36.89%, reduces latency and 99th percentile tail latency by 24.54% and 21.32%, respectively. © IFIP International Federation for Information Processing 2018.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Energy Saving Strategy of Power System Cluster Based on Container Virtualization

Energy Saving Strategy of Power System Cluster Based on Cont...

引用

IEEE Asia Power and Energy engineering Conference (APEEC)

作者： Ran Zheng Hao Wang Hai Jin Dechao Xu Yong Chen Xiaomeng Li Yufei Rao Zhenan Zhang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China State Key Laboratory of Power Grid Safety and Energy Conservation China Electric Power Research Institute Haidian District Beijing China State Grid Henan Electric Power Company Electric Power Research Institute Zhengzhou China

ISBN: (数字)9781728167824

ISBN: (纸本)9781728167831

With the continuous development of power grids, the scale of supercomputing clusters has also gradually increased to carry a large number of power system simulation calculations, and the problem of high energy consumption has appeared. To solve this problem, we propose a container virtualization-based supercomputing cluster for power system. We analyze the impact of containers on power simulation calculations and compare the energy consumption effects of various container scheduling and migration algorithms on clusters. Experiments show that compared to virtual machines with hypervisor, which consumes massive resources and reduces performances by 28.4%, the performance degradation of container on power simulation calculation is 1.3%, which can be ignored. The energy consumption of load-concentration or resource-and-load-balance container scheduling algorithms is up to 4.0% lower and at least 2.2% lower than other algorithms. In container migration, the method combining autoregressive model with most-correlation and resource-andload-balance algorithms is better than other methods, which not only minimizes energy consumption, but also has lowest number of migrations and SLA violations. Experiments verify the feasibility and advantages of container migration in power system computing clusters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Foundation models and intelligent decision-making: Progress, challenges, and perspectives

引用

The Innovation 2025年第6期6卷

作者： Jincai Huang Yongjun Xu Qi Wang Qi (Cheems) Wang Xingxing Liang Fei Wang Zhao Zhang Wei Wei Boxuan Zhang Libo Huang Jingru Chang Liantao Ma Ting Ma Yuxuan Liang Jie Zhang Jian Guo Xuhui Jiang Xinxin Fan Zhulin An Tingting Li Aiguo Fei Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China National Engineering Research Center for Software Engineering Peking University Beijing 100871 China College of Systems Engineering National University of Defense Technology Changsha 410073 China Department of Oral Implantology Peking University School and Hospital of Stomatology Beijing 100081 China Laboratory for Big Data and Decision National University of Defense Technology Changsha 410073 China School of Automation Beijing Institute of Technology Beijing 100081 China Huazhong University of Science and Technology Wuhan 430074 China University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of AI Safety Beijing 100190 China Department of Automation Tsinghua University Beijing 100084 China School of Information Science and Engineering Dalian Polytechnic University Dalian 116034 China The Hong Kong University of Science and Technology (Guangzhou) Guangzhou 511453 China College of Information and Electrical Engineering China Agricultural University Beijing 100083 China State Key Laboratory of Efficient Utilization of Agricultural Water Resources Beijing 100083 China IDEA Research International Digital Economy Academy Shenzhen 518057 China School of Computer Science National Pilot Software Engineering School Beijing University of Posts and Telecommunications Beijing 100876 China

Intelligent decision-making (IDM) is a cornerstone of artificial intelligence (AI) designed to automate or augment decision processes. Modern IDM paradigms integrate advanced frameworks to enable intelligent agents to make effective and adaptive choices and decompose complex tasks into manageable steps, such as AI agents and high-level reinforcement learning. Recent advances in multimodal foundation-based approaches unify diverse input modalities—such as vision, language, and sensory data—into a cohesive decision-making process. Foundation models (FMs) have become pivotal in science and industry, transforming decision-making and research capabilities. Their large-scale, multimodal data-processing abilities foster adaptability and interdisciplinary breakthroughs across fields such as healthcare, life sciences, and education. This survey examines IDM’s evolution, advanced paradigms with FMs and their transformative impact on decision-making across diverse scientific and industrial domains, highlighting the challenges and opportunities in building efficient, adaptive, and ethical decision systems.

关键词： artificial intelligence intelligent decision-making foundation models agent large language model

来源：评论

学校读者我要写书评

暂无评论

On information-theoretic characterizations of markov random fields and subfields

On information-theoretic characterizations of markov random ...

引用

作者： Yeung, Raymond W. Al-Bashabsheh, Ali Chen, Chao Chen, Qi Moulin, Pierre Institute of Network Coding Chinese University of Hong Kong Hong Kong Department of Information Engineering Chinese University of Hong Kong Hong Kong Big Data and Brain Computing Center Beihang University Beijing100191 China State Key Laboratory of Integrated Service Networks Xidian University Xi'an710071 China Department of Electrical and Computer Engineering University of Illinois UrbanaIL61801 United States Coordinated Science Laboratory University of Illinois UrbanaIL61801 United States

Let Xi, i ϵ V form a Markov random field (MRF) represented by an undirected graph G = (V,E) , and V′ be a subset of V. We determine the smallest graph that can always represent the subfield Xi, i ϵ V′ as an MRF. Based on this result, we obtain a necessary and sufficient condition for a subfield of a Markov tree to be also a Markov tree. When G is a path so that Xi, i ϵ V form a Markov chain, it is known that the I -Measure is always nonnegative (Kawabata and Yeung in 1992). We prove that Markov chain is essentially the only MRF such that the I -Measure is always nonnegative. By applying our characterization of the smallest graph representation of a subfield of an MRF, we develop a recursive approach for constructing information diagrams for MRFs. Our work is built on the set-theoretic characterization of an MRF (Yeung et al. in 2002). © 1963-2012 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：