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

International Joint Conference on Neural networks (IJCNN)

作者： Yurun Bi Xingang Wang Qingao Wang Jinxiao Yang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Medical Visual Question Answering (Med-VQA) is a sophisticated multimodal technology within the medical domain that utilizes natural language processing and artificial intelligence techniques. It serves as a tool in the medical field to provide information and answers, aiming to correctly respond to medical questions related to specific professional medical images. The primary goal is to assist patients in understanding their physical condition and provide decision support for healthcare professionals. While Generalized Visual Question Answering has seen significant advancements, challenges persist in the medical domain. Firstly, medical data has inherent limitations, such as the scarcity of annotated medical datasets and the complexity of medical images (including factors like noise, artifacts, and low contrast). Secondly, in terms of cross-modal fusion, there exists an intricate relationship between medical images and textual information. The complexity of the relationship between medical images and medical text, as well as the incorporation of global contextual details, pose challenges. To address these issues, this paper proposes the Feature-Enhanced network with Conditional Mixing. This innovative approach aims to overcome the scarcity and complexity of medical images without the need for additional datasets. Simultaneously, to tackle the challenge of cross-modal fusion and information interaction and to address the complex relationship between medical images and text, we propose the Cross-Adaptive Fusion network. Experimental results conducted on the VQA-RAD dataset demonstrate noticeable improvements in accuracy compared to mainstream Med-VQA models.

关键词： Visualization Accuracy Noise Neural networks Medical services Question answering (information retrieval) Data models

来源：评论

学校读者我要写书评

暂无评论

hcaPCG: A Heterogeneous and communication-avoid PCG with Jacobi preconditioner on SW26010-Pro architecture

hcaPCG: A Heterogeneous and communication-avoid PCG with Jac...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Yue Liu Li Wang Yanyan Chen Qi Liu Jingshan Pan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

Due to its efficiency and versatility, the preconditioned conjugate gradient algorithm has long been a staple in the realm of iterative linear system solvers. In this paper, we proposed an optimized preconditioned conjugate gradient algorithm tailored for the SW26010-Pro manycore processor, The main work includes: Optimizing data block sizes based on the processor’s storage structure; combining thread-level and data-level parallelism, utilizing manual SIMD to improve efficiency; optimizing the memory access pattern by employing direct memory access and overlapping of computation and communication; employing a shared-memory approach to store long vectors across all cores. Furthermore, we design an accelerated algorithm for reduction operations, to avoid data communication. Experimental results show that the hcaPCG yields up to 28.1× speedups on average compared to the original implementation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algorithm on the New Sunway Supercomputer

AH-TDMA: An Adaptive Heterogeneous Tridiagonal Matrix Algori...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Qi Liu Yanlong Li Wei Du Zenghui Ren Yue Liu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

The solution of tridiagonal linear systems is used in in various fields and plays a crucial role in numerical simulations. However, there is few efficient solver for tridiagonal linear systems on the new Sunway supercomputer. Based on a three-dimensional heat conduction problem, we propose an adaptive heterogeneous tridiagonal matrix algorithm (AH-TDMA). Our major innovations include: (1) To address computational hotspots within AH-TDMA, a multi-level parallel approach involving MPI+Athread has been adopted. (2) An adaptive data partitioning scheme has been set up to achieve load balance. (3) Employing direct memory access and establishing shared space between registers and main memory, instead of employing discrete memory access, is done to enhance memory access efficiency. (4) The optimization of the loop structure has been made in adjusting the sequencing of the dual-layered loops to reduce communication overhead. The experimental results show that, with one core group, the AH-TDMA achieves a speedup of 99.6 times for hotspot and total time speedup up to 59.4 times compared to the Parallel and Scalable Library for Tridiagonal Matrix Algorithm (PaScal TDMA). The AH-TDMA is scalable up to 2048 core groups, with a parallel efficiency of 69.2%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

PIOD: An Efficient Parallel Iterative Algorithm for Solving Over-determined Equations

PIOD: An Efficient Parallel Iterative Algorithm for Solving ...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Min Tian Zhenguo Wei Yanlong Li Wei Du Lei Xiao Chaoshuai Xu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan Key Laboratory of High Performance Computing Jinan Institute of Supercomputing Technology

The solution of over-determined equations plays a very important role in fields such as data fitting, signal processing, and machine learning. It is of great significance in predicting natural phenomena, optimizing engineering design, and other fields. However, there is currently no efficient method to solve over-determined equations, either being not accurate enough or consuming a lot of time. In this article, we propose a parallel iterative method for solving over-determined equations, called the PIOD algorithm. By using a sub-convergence condition to terminate the iterative calculation, we have developed a task partitioning strategy for the algorithm and implemented parallelization of the solution of over-determined equations on a distributed memory system. Our proposed algorithm achieves an average speedup of 152 ×times compared to the open-source Eigen solver. Additionally, it also achieves a parallel efficiency of over 30%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Leveraging Tumor Heterogeneity: Heterogeneous Graph Representation Learning for Cancer Survival Prediction in Whole Slide Images 38

Leveraging Tumor Heterogeneity: Heterogeneous Graph Represen...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Wu, Junxian Ke, Xinyi Jiang, Xiaoming Wu, Huanwen Kong, Youyong Shao, Lizhi School of Internet Anhui University China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing School of Computer Science and Engineering Southeast University China Department of Pathology State Key Laboratory of Complex Severe and Rare Disease Molecular Pathology Research Center Peking Union Medical College Hospital Chinese Academy of Medical Sciences Peking Union Medical College Beijing China School of Bioinformatics Chongqing University of Post and Telecommunications China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Applications Southeast University Ministry of Education China

Survival prediction is a significant challenge in cancer management. Tumor microenvironment is a highly sophisticated ecosystem consisting of cancer cells, immune cells, endothelial cells, fibroblasts, nerves and extracellular matrix. The intratumor heterogeneity and the interaction across multiple tissue types profoundly impact the prognosis. However, current methods often neglect the fact that the contribution to prognosis differs with tissue types. In this paper, we propose ProtoSurv, a novel heterogeneous graph model for WSI survival prediction. The learning process of ProtoSurv is not only driven by data but also incorporates pathological domain knowledge, including the awareness of tissue heterogeneity, the emphasis on prior knowledge of prognostic-related tissues, and the depiction of spatial interaction across multiple tissues. We validate ProtoSurv across five different cancer types from TCGA (i.e., BRCA, LGG, LUAD, COAD and PAAD), and demonstrate the superiority of our method over the state-of-the-art methods. Source code is available at https://***/wjx-error/ProtoSurv. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A High-Dimensional Temporal Data Publishing Method Based on Dynamic Bayesian networks and Differential Privacy

A High-Dimensional Temporal Data Publishing Method Based on ...

引用

International Joint Conference on Neural networks (IJCNN)

作者： Yaxin Wang Zhen Zhang Heng Qian Yongchao Gao Qiuyue Wang Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Massive high-dimensional data generated by the Internet typically contains sensitive privacy information. Protecting data privacy while maintaining utility has become a pressing challenge. We propose a novel high-dimensional temporal data publishing method leveraging dynamic Bayesian networks and differential privacy. Initially, a dynamic Bayesian network is constructed, utilizing mutual information filtering of data. Subsequently, we calculate the Coherent Neighborhood Propinquity for each node within the network to determine edge sensitivity and establish a privacy budget. Noise is then strategically added to attribute data in accordance with the sensitivity and privacy budget requirements, ensuring the dataset complies with ε-differential privacy standards. Experimental results demonstrate that the data availability performance of the SMAP dataset (Soil Moisture Active Passive) surpasses that of competing algorithms while providing an equivalent level of privacy protection. Hence, our method significantly enhances data availability without compromising differential privacy protection.

关键词： Differential privacy Privacy Sensitivity Publishing Time series analysis Dynamic scheduling Bayes methods

来源：评论

学校读者我要写书评

暂无评论

BEW-YOLO: An Improved Method for PCB Defect Detection Based on YOLOv7

BEW-YOLO: An Improved Method for PCB Defect Detection Based ...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zhiyao Li Aimin Li Yuechen Zhang Xiaotong Kong Wenqiang Li Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

The PCB defect object size is small and the detection process is susceptible to background interference, usually have the problem of missed and false detection. In order to solve the above problems, an improved method based on YOLOv7 is proposed in this paper. Firstly, the bi-level routing attention (BRA) has been added to the header of the original YOLOv7 model to capture global dependencies and ensure the accuracy of small object detection and localization. Secondly, the explicit visual center (EVC) block is introduced before the fusion of mid-level features and high-level features to capture the global remote dependencies of top-level features, extract the features in local corner regions, achieve a comprehensive feature representation. Finally, the loss function is improved by changing the loss function of the original model to Wise-IoU, which allows our model to focus more on ordinary-quality anchor boxes and improve the performance of the detector while decreasing the competitiveness of anchor boxes for high-quality samples and reducing the influence of low-quality samples on the detection results. The experimental results show that the improved model improves 5% in AP and 1.9% in both AR and mAP over the original YOLOv7 model. Meanwhile, comparison experiments are conducted on the data-enhanced PCB dataset, which proves the superiority of our model over other state-of-the-art models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LSTM-Based Strategy for Customer Directrix Load Prediction

LSTM-Based Strategy for Customer Directrix Load Prediction

引用

Energy, Electrical and Power Engineering (CEEPE), International Conference on

作者： Bin Han Zongxuan Xie Xiao Luo Minghe Wu Yifei Wang Lucheng Hong Jiangsu Provincial Key Laboratory of Smart Grid Technology and Equipment Southeast University Nanjing China Network Information Center of Xinjiang University Xinjiang University of Political Science and Law Tumushuke China

High percentage of renewable energy to the grid is the future trend of smart grid. Demand response can effectively smooth out real-time fluctuations in renewable energy and has become an important tool for maintaining power system balance. Customer Directrix Load is a relatively new demand response mechanism, which can effectively consume renewable energy. However, as the installed capacity of renewable energy continues to increase, the dispatch center is under greater computational pressure. Therefore, this paper uses LSTM neural network to predict Customer Directrix Load profile. Case studies verify the effectiveness of the proposed model and algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GHTO: Improving Byzantine Robustness in Distributed Machine Learning Through Gradient Heterogeneity Twofold Optimization

GHTO: Improving Byzantine Robustness in Distributed Machine ...

引用

Frontiers technology of Information and computer (ICFTIC), IEEE International Conference on

作者： Caiyun Li Ming Yang Jian Cao Xiaoming Wu Yunpeng He Xin Wang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China Shandong Evayinfo Technology Co. Ltd Jinan P. R. China

ISBN: (数字)9798331541750

ISBN: (纸本)9798331541767

Heterogeneous datasets induce local gradient variance and global gradient variance in distributed learning, collectively referred to as gradient heterogeneity. Gradient heterogeneity increases the system's vulnerability to Byzantine attacks, affecting performance. To address this issue, the paper proposes a Gradient Heterogeneity Twofold Optimization (GHTO) algorithm to enhance the Byzantine robustness of the system in non-independent and identically distributed environments. Specifically, a Local Gradient Correction (LGC) algorithm is proposed, which aims to reduce the local gradient variance. By further integrating LGC with momentum and bucketing techniques to achieve dual optimization of local and global gradient variance. Experimental results demonstrate the proposed LGC algorithm diminishes local gradient variance, and the GHTO method optimizes both local and global gradient variance, which further strengthens the robustness of the system against Byzantine attacks.

关键词： computer aided instruction Machine learning algorithms Distance learning Machine learning Robustness Optimization Resilience

来源：评论

学校读者我要写书评

暂无评论

TFSG: A Self-Supervised Guided Graph Learning Method for Traffic Flow Prediction

引用

IEEE Internet of Things Journal 2025年

作者： Zheng, Yingran Luo, Chao Shao, Rui Shandong Normal University School of Information Science and Engineering Jinan250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan250014 China China Mobile Shandong Co. Ltd center of network optimization Jinan250014 China

With the rapid development of the Internet of Things, a large amount of real-time traffic data has been collected. How to fully utilize these traffic data for rational planning of intelligent transportation systems is an important issue. Graph learning has proved to be potential tools for modeling complex spatiotemporal relationships in addressing traffic flow prediction problems. Existing methods usually relied on the graph structure constructed from predefined distance information between different regions. However, affected by factors such as road capacity, traffic rules etc., distance bias is non-trivial to affect traffic flow in reality. Besides, the distance based static transportation network structure is also difficult to describe the dynamic and uncertainty of road traffic in complex situations. To address the aforementioned issues, this article proposes an enhanced graph generation approach for traffic flow prediction, which is based on Temporal-Frequency Self-Supervised Guided Graph Learning (TFSG). The method progressively guides the feature latent representation to approach the target latent representation in both the time domain and frequency domain. Meanwhile, a multi-head self-attention mechanism is introduced to capture dependencies among different time series patches, constructing an enhanced graph structure for downstream prediction tasks. Experimental results first independently evaluated the qualities of the generated graphs. Subsequently, by using five public traffic datasets, the feasibility and effectiveness of the proposed method are further verified. © 2014 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：