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

12th International Conference on Computational Advances in Bio and Medical sciences, ICCABS 2023

作者： Stubby, Emma T. Razavi, Seyed Majid Khanmohammadi, Sina School of Computer Science University of Oklahoma Norman73019 United States Data Science and Analytics Institute University of Oklahoma Norman73019 United States

ISBN: (纸本)9783031827679

Alzheimer’s disease is a neurological disorder characterized by functional and structural atrophy, leading to symptoms like memory loss and cognitive decline. This study seeks to analyze the disruptions of functional connectivity pathways within the brain caused by Alzheimer’s disease from the maximum flow perspective. More specifically, we computed the maximum flow pathways within the functional brain networks, and compared it between healthy controls and Alzheimer’s patients. Our results suggest that the Alzheimer’s patients utilize pathways related to the default mode network (DMN) more frequently and display significant alterations in the usage of paths connected to the striate cortex (SC). The increased usage of DMN pathways might point to a compensation mechanism that facilitates interregional communications in Alzheimer’s patients. Understanding the nature of such a compensation mechanism could help develop new treatment options for Alzheimer’s patients. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Neurodegenerative diseases

来源：评论

学校读者我要写书评

暂无评论

Obstacle-Avoidance X-Architecture Steiner Minimal Tree Algorithm Based on Deep Reinforcement Learning

Obstacle-Avoidance X-Architecture Steiner Minimal Tree Algor...

引用

2023 International Conference on Artificial Intelligence of Things and Systems, AIoTSys 2023

作者： You, Jie Zhu, Yuhan Huang, Xing Yang, Liliang Liu, Genggeng Fuzhou University College of Computer and Data Science Fuzhou China Northwestern Polytechnical University School of Computer Science Xi'an China

ISBN: (纸本)9798350312270

In recent years, we have witnessed the rapid development of the Internet of Things (IoT) paradigm. A new computing paradigm, predictive intelligence, has been introduced into many IoT applications. In IoT applications, predictive intelligent devices must consider power and delay consumption. The goal of Very Large Scale Integration (VLSI) circuit routing problem is to minimize the wirelength to optimize chip delay. Therefore, VLSI routing problems have been widely applied in IoT. The X-architecture routing technology presents a promising solution that can reduce the number of vias, wirelength, and mold size significantly, thereby proving to be a highly practical approach. Moreover, with the shift of modern VLSI design towards system-on-chip paradigm, many uncrossable obstacles appear on the plane, thus Obstacle-Avoiding X-architecture Steiner Minimal Tree (OAXSMT) problem has attracted more and more attention. Most existing algorithms are troubled by poor wirelength quality or high construction time cost. Therefore, this paper proposes a method based on Deep Reinforcement Learning to construct an OAXSMT. First, an encoder based on heterogeneous graph transformer is designed to generate fixed-length encodings for each node. Second, an actor-critic decoder based on pointer network is designed to generate obstacle-avoiding X-architecture Steiner redundant tree. Finally, a fast evaluation strategy is designed to evaluate the quality of the redundant tree. Experimental results show that the routing results generated by the algorithm are superior to existing heuristic algorithms in terms of wirelength and runtime, and the algorithm also has certain generalization ability. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Household Waste Classification Algorithms Based on Various Convolutional Neural Networks: A Review of Performance Optimization 21

Household Waste Classification Algorithms Based on Various C...

引用

21st International computer Conference on Wavelet Active Media Technology and Information Processing, ICCWAMTIP 2024

作者： Renxiang, Huang Jia, Chen Jianping, Li School of Artificial Intelligence and Big Data Sichuan University of Arts and Science Chengdu635002 China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China

ISBN: (纸本)9798331519254

This paper reviews the research progress of deep learning-based household waste classification algorithms. It first introduces the importance of household waste classification and the application value of deep learning in this field. Next, it outlines the theoretical foundations of deep learning technology in waste classification, including the principles of convolutional neural networks and their applications in image recognition. The article provides a detailed analysis of the application of different deep learning models in waste classification, such as MobileNetV2, ShuffleNetV1, EfficientNetV1, and YOLOV5, as well as their optimizations and innovations in practical applications. Furthermore, it discusses optimization and innovation methods for deep learning models, including learning rate adjustment, optimizer selection, attention mechanisms, data augmentation, and lightweight network design. Finally, it summarizes the current research shortcomings and challenges, and looks forward to future research directions. This review provides a systematic perspective for a deeper understanding of the application of deep learning in waste classification and offers directions for future research. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

PAC PREDICTION SETS UNDER LABEL SHIFT 12

PAC PREDICTION SETS UNDER LABEL SHIFT

引用

12th International Conference on Learning Representations, ICLR 2024

作者： Si, Wenwen Park, Sangdon Lee, Insup Dobriban, Edgar Bastani, Osbert Department of Computer & Information Science University of Pennsylvania United States Graduate School of AI and Computer Science & Engineering POSTECH Korea Republic of Department of Statistics and Data Science University of Pennsylvania United States

Prediction sets capture uncertainty by predicting sets of labels rather than individual labels, enabling downstream decisions to conservatively account for all plausible outcomes. Conformal inference algorithms construct prediction sets guaranteed to contain the true label with high probability. These guarantees fail to hold in the face of distribution shift, which is precisely when reliable uncertainty quantification can be most useful. We propose a novel algorithm for constructing prediction sets with PAC guarantees in the label shift setting, where the probabilities of labels can differ between the source and target distributions. Our algorithm relies on constructing confidence intervals for importance weights by propagating uncertainty through a Gaussian elimination algorithm. We evaluate our approach on four datasets: the CIFAR-10 and ChestX-Ray image datasets, the tabular CDC Heart dataset, and the AGNews text dataset. Our algorithm satisfies the PAC guarantee while producing smaller prediction set sizes compared to several baselines. © 2024 12th International Conference on Learning Representations, ICLR 2024. All rights reserved.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

ViGT: proposal-free video grounding with a learnable token in the transformer

引用

science China(Information sciences) 2023年第10期66卷 196-212页

作者： Kun LI Dan GUO Meng WANG School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province Institute of Artificial Intelligence Hefei Comprehensive National Science Center

The video grounding(VG) task aims to locate the queried action or event in an untrimmed video based on rich linguistic descriptions. Existing proposal-free methods are trapped in the complex interaction between video and query, overemphasizing cross-modal feature fusion and feature correlation for VG. In this paper, we propose a novel boundary regression paradigm that performs regression token learning in a transformer. Particularly, we present a simple but effective proposal-free framework, namely video grounding transformer(ViGT), which predicts the temporal boundary using a learnable regression token rather than multi-modal or cross-modal features. In ViGT, the benefits of a learnable token are manifested as follows.(1) The token is unrelated to the video or the query and avoids data bias toward the original video and query.(2) The token simultaneously performs global context aggregation from video and query ***, we employed a sharing feature encoder to project both video and query into a joint feature space before performing cross-modal co-attention(i.e., video-to-query attention and query-to-video attention) to highlight discriminative features in each modality. Furthermore, we concatenated a learnable regression token [REG] with the video and query features as the input of a vision-language transformer. Finally, we utilized the token [REG] to predict the target moment and visual features to constrain the foreground and background probabilities at each timestamp. The proposed ViGT performed well on three public datasets:ANet-Captions, TACoS, and YouCookⅡ. Extensive ablation studies and qualitative analysis further validated the interpretability of ViGT.

关键词： video grounding temporal sentence grounding boundary regression token learning proposal-free

来源：评论

学校读者我要写书评

暂无评论

Solving Multi-Objective Vehicle Routing Problems with Time Windows: A Decomposition-Based Multiform Optimization Approach

引用

Tsinghua science and Technology 2024年第2期29卷 305-324页

作者： Yiqiao Cai Zifan Lin Meiqin Cheng Peizhong Liu Ying Zhou Xiamen Key Laboratory of Data Security and Blockchain Technology College of Computer Science and TechnologyHuaqiao UniversityXiamen361021China College of Engineering Huaqiao UniversityQuanzhou362000China School of Computer Sciences Shenzhen Institute of Information TechnologyShenzhen518000China

In solving multi-objective vehicle routing problems with time windows (MOVRPTW),most existing algorithms focus on the optimization of a single problem formulation. However,little effort has been devoted to exploiting valuable knowledge from the alternate formulations of MOVRPTW for better optimization performance. Aiming at this insufficiency,this study proposes a decomposition-based multi-objective multiform evolutionary algorithm (MMFEA/D),which performs the evolutionary search on multiple alternate formulations of MOVRPTW simultaneously to complement each other. In particular,the main characteristics of MMFEA/D are three folds. First,a multiform construction (MFC) strategy is adopted to construct multiple alternate formulations,each of which is formulated by grouping several adjacent subproblems based on the decomposition of MOVRPTW. Second,a transfer reproduction (TFR) mechanism is designed to generate offspring for each formulation via transferring promising solutions from other formulations,making that the useful traits captured from different formulations can be shared and leveraged to guide the evolutionary search. Third,an adaptive local search (ALS) strategy is developed to invest search effort on different alternate formulations as per their usefulness for MOVRPTW,thus facilitating the efficient allocation of computational resources. Experimental studies have demonstrated the superior performance of MMFEA/D on the classical Solomon instances and the real-world instances.

关键词： MOVRPTW multiform optimization multiform construction knowledge transfer adaptive local search

来源：评论

学校读者我要写书评

暂无评论

SSDRec: Self-Augmented Sequence Denoising for Sequential Recommendation 40

SSDRec: Self-Augmented Sequence Denoising for Sequential Rec...

引用

40th IEEE International Conference on data Engineering, ICDE 2024

作者： Zhang, Chi Han, Qilong Chen, Rui Zhao, Xiangyu Tang, Peng Song, Hongtao College of Computer Science and Technology Harbin Engineering University China School of Data Science City University of Hong Kong Hong Kong School of Cyber Science and Technology Shandong University China

ISBN: (纸本)9798350317152

Traditional sequential recommendation methods assume that users' sequence data is clean enough to learn accurate sequence representations to reflect user preferences. In practice, users' sequences inevitably contain noise (e.g., accidental interactions), leading to incorrect reflections of user preferences. Consequently, some pioneer studies have explored modeling sequentiality and correlations in sequences to implicitly or explicitly reduce noise's influence. However, relying on only available intra-sequence information (i.e., sequentiality and correlations in a sequence) is insufficient and may result in over-denoising and under-denoising problems (OUPs), especially for short sequences. To improve reliability, we propose to augment sequences by inserting items before denoising. However, due to the data sparsity issue and computational costs, it is challenging to select proper items from the entire item universe to insert into proper positions in a target sequence. Motivated by the above observation, we propose a novel framework-Self-augmented Sequence Denoising for sequential Recommendation (SSDRec) with a three-stage learning paradigm to solve the above challenges. In the first stage, we empower SSDRec by a global relation encoder to learn multi-faceted inter-sequence relations in a data-driven manner. These relations serve as prior knowledge to guide subsequent stages. In the second stage, we devise a self-augmentation module to augment sequences to alleviate OUPs. Finally, we employ a hierarchical denoising module in the third stage to reduce the risk of false augmentations and pinpoint all noise in raw sequences. Extensive experiments on five real-world datasets demonstrate the superiority of SSDRec over state-of-the-art denoising methods and its flexible applications to mainstream sequential recommendation models. The source code is available online at https://***/zc-97/SSDRec. © 2024 IEEE.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

An improved method for small object detection in aerial images based on YOLOv8

An improved method for small object detection in aerial imag...

引用

2024 International Conference on computer Graphics, Artificial Intelligence, and data Processing, ICCAID 2024

作者： Ma, Liting Zhao, Junzhe Hsiang, Han-Cheng School of Data and Computer Science Xiamen Institute of Technology Xiamen China

ISBN: (纸本)9781510689275

In recent years, detecting objects in aerial images has emerged as a crucial area of study within the domain of computer vision. However, due to obstacles like the limited size of objects, dense distributions, and class imbalance in these images, traditional object detection methods often face issues like missed detections and low performance. In response to these challenges, this study introduces an enhanced YOLOv8s model designed to optimize small object detection. First, to enhance feature extraction capabilities for objects of different scales, the C2f structure within the backbone of the baseline YOLOv8s model is modified by PKI(Poly Kernel Inception)Block from PKINet, thereby strengthening its recognition capabilities across multi-scale targets. Second, to further elevate the efficiency of the neck network for detecting small targets, the MCAttention module is incorporated as part of the C2f design in the neck, leading to the enhanced C2fMCAttn module, which augments the neck network's effectiveness in modeling features from small object areas. Moreover, a 160×160 detection head is added to the detection layer, tailored to enhance the detection of small objects. The experiments were conducted on the VisDrone2019 drone aerial imagery dataset. The results indicate that the improved model outperformed the baseline YOLOv8s model. It achieved a 5.3% increase in precision, a 5% increase in recall and a 4.4% increase in mAP@50. Furthermore, the proposed model outperforms other mainstream object detection methods, exhibiting superior detection effectiveness. © 2025 SPIE.

关键词： MCAttention PKI Block Small object detection YOLOv8s

来源：评论

学校读者我要写书评

暂无评论

A Framework of Knowledge Graph-Enhanced Large Language Model Based on Question Decomposition and Atomic Retrieval

A Framework of Knowledge Graph-Enhanced Large Language Model...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Li, Yading Song, Dandan Zhou, Changzhi Tian, Yuhang Wang, Hao Yang, Ziyi Zhang, Shuhao School of Computer Science and Technology Beijing Institute of Technology China School of Cyberspace Science and Technology Beijing Institute of Technology China College of Computing and Data Science Nanyang Technological University Singapore

ISBN: (纸本)9798891761681

Knowledge graphs (KGs) can provide explainable reasoning for large language models (LLMs), alleviating their hallucination problem. Knowledge graph question answering (KGQA) is a typical benchmark to evaluate the methods enhancing LLMs with KG. Previous methods on KG-enhanced LLM for KGQA either enhance LLMs with KG retrieval in a single round or perform multi-hop KG reasoning in multiple rounds with LLMs. Both of them conduct retrieving and reasoning based solely on the whole original question, without any processing to the question. To tackle this limitation, we propose a framework of KG-enhanced LLM based on question decomposition and atomic retrieval, called KELDaR. We introduce question decomposition tree as the framework for LLM reasoning. This approach extracts the implicit information of reasoning steps within complex questions, serving as a guide to facilitate atomic retrieval on KG targeting the atomic-level simple questions at leaves of the tree. Additionally, we design strategies for atomic retrieval, which extract and retrieve question-relevant KG subgraphs to assist the few-shot LLM in answering atomic-level questions. Experiments on KGQA datasets demonstrate that our framework outperforms existing reasoning-based baselines. And in a low-cost setting without additional training or fine-tuning, our framework achieves competitive or superior results compared to most existing training-based baselines. © 2024 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Few-shot Temporal Pruning Accelerates Diffusion Models for Text Generation 30

Few-shot Temporal Pruning Accelerates Diffusion Models for T...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Li, Bocheng Gao, Zhujin Zhu, Yongxin Yin, Kun Cao, Haoyu Jiang, Deqiang Xu, Linli School of Computer Science and Technology University of Science and Technology of China China School of Data Science University of Science and Technology of China China State Key Laboratory of Cognitive Intelligence China Tencent YouTu Lab China

ISBN: (纸本)9782493814104

Diffusion models have achieved significant success in computer vision and shown immense potential in natural language processing applications, particularly for text generation tasks. However, generating high-quality text using these models often necessitates thousands of iterations, leading to slow sampling rates. Existing acceleration methods either neglect the importance of the distribution of sampling steps, resulting in compromised performance with smaller number of iterations, or require additional training, introducing considerable computational overheads. In this paper, we present Few-shot Temporal Pruning, a novel technique designed to accelerate diffusion models for text generation without supplementary training while effectively leveraging limited data. Employing a Bayesian optimization approach, our method effectively eliminates redundant sampling steps during the sampling process, thereby enhancing the generation speed. A comprehensive evaluation of discrete and continuous diffusion models across various tasks, including machine translation, question generation, and paraphrasing, reveals that our approach achieves competitive performance even with minimal sampling steps after down to less than 1 minute of optimization, yielding a significant acceleration of up to 400x in text generation tasks. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：