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

Robust Imagined Speech Production Using AI-Generated Content Network for Patients with Language Impairments

IEEE Transactions on Consumer Electronics 2024年第1期71卷 1402-1411页

作者： Xu, Xu Fu, Chong Dalian University of Technology School of Software Dalian116621 China Northeastern University School of Computer Science and Engineering Shenyang110004 China Northeastern University Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Ministry of Education Engineering Research Center of Security Technology of Complex Network System Shenyang110004 China

Imagined speech production is critical for brain-computer interface systems. It is able to provide the communication ability for patients with language impairments. Nowadays, many studies have developed algorithms for this purpose. However, they often struggle with an issue that is the noise in physiological signals from various devices. This makes current methods have low robustness when performing speech generation. To this end, we propose a framework to robustly producing imagined speech for patients with language impairments. It is based on artificial intelligent-generated content (AIGC). In specific, this work develops a diffusion model to remove noise from brain signals, which are then converted and normalized into log-mel spectrograms. Next, the product feeds into a transformer-based model to extract local and global features. Finally, these enhanced features are inputted into full connected layers to generate the imagined speech. The effectiveness of our model is validated using the high-quality, i.e., single-word-production-Dutch-iBIDS dataset. It achieves Pearson correlation scores above 0.8 and standard deviations below 0.2 across different volunteers. Experimental results well demonstrate that our model is robust and has advantages over peer methods. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Representation of Semantic Word Embeddings Based on SLDA and Word2vec Model

引用

Chinese Journal of Electronics 2023年第3期32卷 647-654页

作者： TANG Huanling ZHU Hui WEI Hongmin ZHENG Han MAO Xueli LU Mingyu GUO Jin School of Computer Science and Technology Shandong Technology and Business University Co-innovation Center of Shandong Colleges and Universities: Future Intelligent Computing Key Laboratory of Intelligent Information Processing in Universities of Shandong Shandong Technology and Business University School of Information and Electronic Engineering Shandong Technology and Business University Information Science and Technology College Dalian Maritime University School of Computer and Information Technology Liaoning Normal University

To solve the problem of semantic loss in text representation, this paper proposes a new embedding method of word representation in semantic space called wt2svec based on supervised latent Dirichlet allocation(SLDA) and Word2vec. It generates the global topic embedding word vector utilizing SLDA which can discover the global semantic information through the latent topics on the whole document set. It gets the local semantic embedding word vector based on the Word2vec. The new semantic word vector is obtained by combining the global semantic information with the local semantic information. Additionally, the document semantic vector named doc2svec is generated. The experimental results on different datasets show that wt2svec model can obviously promote the accuracy of the semantic similarity of words,and improve the performance of text categorization compared with Word2vec.

关键词： Semantics Text categorization Resource management Task analysis

来源：评论

学校读者我要写书评

暂无评论

Machine Learning is All You Need: A Simple Token-Based Approach for Effective Code Clone Detection 24

Machine Learning is All You Need: A Simple Token-Based Appro...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Feng, Siyue Suo, Wenqi Wu, Yueming Zou, Deqing Liu, Yang Jin, Hai Huazhong University of Science and Technology China Nanyang Technological University Singapore Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Jinyinhu Laboratory Wuhan430074 China School of Cyber Science and Engineering Hust Wuhan430074 China School of Computer Science and Technology Hust Wuhan430074 China

ISBN: (纸本)9798400702174

As software engineering advances and the code demand rises, the prevalence of code clones has increased. This phenomenon poses risks like vulnerability propagation, underscoring the growing importance of code clone detection techniques. While numerous code clone detection methods have been proposed, they often fall short in real-world code environments. They either struggle to identify code clones effectively or demand substantial time and computational resources to handle complex clones. This paper introduces a code clone detection method namely Toma using tokens and machine learning. Specifically, we extract token type sequences and employ six similarity calculation methods to generate feature vectors. These vectors are then input into a trained machine learning model for classification. To evaluate the effectiveness and scalability of Toma, we conduct experiments on the widely used BigCloneBench dataset. Results show that our tool outperforms token-based code clone detectors and most tree-based clone detectors, demonstrating high effectiveness and significant time savings. © 2024 ACM.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

CoMT: A Novel Benchmark for Chain of Multi-modal Thought on Large Vision-Language Models 39

CoMT: A Novel Benchmark for Chain of Multi-modal Thought on ...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Cheng, Zihui Chen, Qiguang Zhang, Jin Fei, Hao Feng, Xiaocheng Che, Wanxiang Li, Min Qin, Libo School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for SCIR Harbin Institute of Technology Harbin China National University of Singapore Singapore

ISBN: (纸本)157735897X

Large Vision-Language Models (LVLMs) have recently demonstrated amazing success in multi-modal tasks, including advancements in Multi-modal Chain-of-Thought (MCoT) reasoning. Despite these successes, current benchmarks still follow a traditional paradigm with multi-modal input and text-modal output, which leads to significant drawbacks such as missing visual operations and vague expressions. Motivated by this, we introduce a novel Chain of Multi-modal Thought (CoMT) benchmark to address these limitations. Different from the traditional MCoT benchmark, CoMT requires both multi-modal input and multi-modal reasoning output, aiming to mimic human-like reasoning that inherently integrates visual operations. Specifically, CoMT consists of four categories: (1) Visual Creation, (2) Visual Deletion, (3) Visual Update, and (4) Visual Selection to comprehensively explore complex visual operations and concise expression in real scenarios. We evaluate various LVLMs and strategies on CoMT, revealing some key insights into the capabilities and limitations of the current approaches. We hope that CoMT can inspire more breakthroughs on introducing multi-modal generation into the reasoning process. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Modal analysis

来源：评论

学校读者我要写书评

暂无评论

CoGAP: A Personalized Federated Learning Method Using Collaborative Optimization for Medical Image Classification

CoGAP: A Personalized Federated Learning Method Using Collab...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Zheng, Shenhai Li, Congyu Wen, Sian Gao, Xi Yu, Lei College of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing China Emergency Department The Second Affiliated Hospital of Chongqing Medical University Chongqing China

ISBN: (纸本)9798350368741

Federated learning (FL) has been widely used in medical image processing to protect data privacy, but it has issues with data heterogeneity. Personalized federated learning have emerged to tackle these issues but often focuses too much on personalized models at the expense of global models. To address these problem, we propose a personalized federated learning method CoGAP, using collaborative optimization to enhance both personalized and global model performance. On the client side, it employs adaptive weight aggregation to initialize personalized models and uses a training strategy based on L2 regularization. On the server side, it implements a gradient accumulation-based aggregation method. These modules facilitate a collaborative optimization process where the global model guides the personalized models, and the personalized models provide positive feedback to the global model, ultimately leading to mutual improvement for both. We conducted extensive comparative experiments on the OCT2017 dataset, as well as the BloodMnist and PathMnist (subsets from MedMnist), to evaluate both global and personalized models. Results show that CoGAP own a unique strength which not only outperforms other personalized federated learning methods in personalization capability while also remarkably achieving satisfying global generalization. Code is available at https://***/lcyCQUPT/CoGAP. © 2025 IEEE.

关键词： collaborative optimization federated learning medical image classification

来源：评论

学校读者我要写书评

暂无评论

NeuVSA: A Unified and Efficient Accelerator for Neural Vector Search 31

NeuVSA: A Unified and Efficient Accelerator for Neural Vecto...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Yuan, Ziming Dai, Lei Li, Wen Zhang, Jie Liang, Shengwen Wang, Ying Liu, Cheng Li, Huawei Li, Xiaowei Guo, Jiafeng Wang, Peng Chen, Renhai Zhang, Gong Shanxi University School of Computer and Information Technology China Peking University School of Computer Science China Institute of Computing Technology CAS State Key Lab of Processors China University of Chinese Academy of Sciences China Zhongguancun National Laboratory Beijing China Institute of Computing Technology CAS Key Lab of Network Data Science and Technology China Huawei Technologies Co. Ltd. China

ISBN: (纸本)9798331506476

Neural Vector Search (NVS) has exhibited superior search quality over traditional key-based strategies for information retrieval tasks. An effective NVS architecture requires high recall, low latency, and high throughput to enhance user experience and cost-efficiency. However, implementing NVS on existing neural network accelerators and vector search accelerators is sub-optimal due to the separation between the embedding stage and vector search stage at both algorithm and architecture levels. Fortunately, we unveil that Product Quantization (PQ) opens up an opportunity to break separation. However, existing PQ algorithms and accelerators still focus on either the embedding stage or the vector search stage, rather than both simultaneously. Simply combining existing solutions still follows the beaten track of separation and suffers from insufficient parallelization, frequent data access conflicts, and the absence of scheduling, thus failing to reach optimal recall, latency, and throughput. To this end, we propose a unified and efficient NVS accelerator dubbed NeuVSA based on algorithm and architecture co-design philosophy. Specifically, on the algorithm level, we propose a learned PQ-based unified NVS algorithm that consolidates two separate stages into the same computing and memory access paradigm. It integrates an end-to-end joint training strategy to learn the optimal codebook and index for enhanced recall and reduced PQ complexity, thus achieving smoother acceleration. On the architecture level, we customize a homogeneous NVS accelerator based on the unified NVS algorithm. Each sub-accelerator is optimized to exploit all parallelism exposed by unified NVS, incorporating a structured index assignment strategy and an elastic on-chip buffer to alleviate buffer conflicts for reduced latency. All sub-accelerators are coordinated using a hardware-aware scheduling strategy for boosted throughput. Experimental results show that the joint training strategy improves recall

关键词： Network embeddings

来源：评论

学校读者我要写书评

暂无评论

GCD-Sampling: A General Cross-scale Decoupled Sampling for Point Cloud 39

GCD-Sampling: A General Cross-scale Decoupled Sampling for P...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Dai, Tao Wang, Yanzi Xiong, Jianyu Zha, Yaohua Xia, Shu-Tao Zhu, Zexuan College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Tsinghua Shenzhen International Graduate School Tsinghua University China Shenzhen City Key Laboratory of Embedded System Design Shenzhen China

ISBN: (纸本)157735897X

Sampling strategy (e.g., fixed farthest point sampling) of point cloud has been an essential step for developing practical solutions in 3D computer vision tasks. Previous fixed sampling is simple, but suffer from suboptimal performance for downstream tasks. To adapt to target networks properly, adaptive sampling methods with trainable parameters have been recently developed to enhance the performance. However, existing adaptive sampling methods still suffer from the over-coupling problem of target network, and thus become model-specific, which limits their practical applications. To address this issue, we propose a novel general cross-scale decoupled sampling method (GCD-sampling) for point cloud, which consists of original feature cache, cross-scale feature fusion and convex combination learning for better feature extraction. To reduce the coupling relationship with the target task network, our method only utilizes the point cloud coordinates as the input and output of itself. Besides, we introduce an arbitrary scale structure to enable parameter sharing across multi-scale sampling in point cloud networks. Extensive experiments on different architectures demonstrate the effectiveness of our method over other existing adaptive sampling methods. © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Thematic Event Extraction Based on Event-Related Sentence Detection 1

Thematic Event Extraction Based on Event-Related Sentence De...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Zhang, Xing Guo, Yucan Jin, Xiaolong Liang, Haozhe Guan, Saiping School of Computer Science and Technology University of Chinese Academy of Sciences China Institute of Computing Technology Chinese Academy of Sciences Cas Key Laboratory of Network Data Science and Technology China Institute of Systems Engineering Academy of Military Science Australia

ISBN: (纸本)9798350358780

Existing works in event extraction typically extract event arguments within the sentence scope. However, besides the sentence level, events may also be naturally presented at the document level. A document-level event usually reflects, to some extent, the theme (i.e., the main content) of the document (e.g., electronic medical records and news articles), which is thus referred to as the thematic event. Thematic Event Extraction (TEE) aims to extract the arguments of thematic events. TEE faces a major challenge, i.e., the sparsity and dispersion of arguments, which means that the arguments of a thematic event are dispersed in different sentences of the document. To overcome this challenge, we propose an Event-related Sentence Detection based TEE model, called ESDTEE, which first detects the sentences related to the thematic event and then extracts the arguments only within these detected sentences using existing models. Extensive experiments with comprehensive analyses demonstrate the effectiveness of ESDTEE. © 2023 IEEE.

关键词： Medical computing

来源：评论

学校读者我要写书评

暂无评论

Zeroth-Order Methods for Constrained Nonconvex Nonsmooth Stochastic Optimization 41

Zeroth-Order Methods for Constrained Nonconvex Nonsmooth Sto...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Liu, Zhuanghua Chen, Cheng Luo, Luo Low, Bryan Kian Hsiang Department of Computer Science National University of Singapore Singapore Singapore CNRS@CREATE LTD 1 Create Way #08-01 CREATE Tower 138602 Singapore Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China School of Data Science Fudan University Shanghai China Shanghai Key Laboratory for Contemporary Applied Mathematics China

This paper studies the problem of solving nonconvex nonsmooth optimization over a closed convex set. Most previous works tackle such problems by transforming the constrained problem into an unconstrained problem. However, they only provide asymptotic convergence analysis for their methods. In this work, we provide the non-asymptotic convergence analysis for solving constrained nonconvex nonsmooth optimization. We first generalize classical gradient mapping and the Frank-Wolfe gap in the nonsmooth setting. Then we introduce novel notions of approximate stationarity concerning such generalized quantities. We also propose several stochastic zeroth-order algorithms for the problem, along with their non-asymptotic convergence guarantees of obtaining the proposed approximate stationarity. Finally, we conduct numerical experiments that demonstrate the effectiveness of our algorithms. Copyright 2024 by the author(s)

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Focus on Local: Finding Reliable Discriminative Regions for Visual Place Recognition 39

Focus on Local: Finding Reliable Discriminative Regions for ...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Wang, Changwei Chen, Shunpeng Song, Yukun Xu, Rongtao Zhang, Zherui Zhang, Jiguang Yang, Haoran Zhang, Yu Fu, Kexue Du, Shide Xu, Zhiwei Gao, Longxiang Guo, Li Xu, Shibiao China School of Artificial Intelligence Beijing University of Posts and Telecommunications China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science China MAIS Institute of Automation Chinese Academy of Sciences China Tongji University China College of Computer and Data Science Fuzhou University China Shandong University China

ISBN: (纸本)157735897X

Visual Place Recognition (VPR) is aimed at predicting the location of a query image by referencing a database of geotagged images. For VPR task, often fewer discriminative local regions in an image produce important effects while mundane background regions do not contribute or even cause perceptual aliasing because of easy overlap. However, existing methods lack precisely modeling and full exploitation of these discriminative regions. In this paper, we propose the Focus on Local (FoL) approach to stimulate the performance of image retrieval and re-ranking in VPR simultaneously by mining and exploiting reliable discriminative local regions in images and introducing pseudo-correlation supervision. First, we design two losses, Extraction-Aggregation Spatial Alignment Loss (SAL) and Foreground-Background Contrast Enhancement Loss (CEL), to explicitly model reliable discriminative local regions and use them to guide the generation of global representations and efficient re-ranking. Second, we introduce a weakly-supervised local feature training strategy based on pseudo-correspondences obtained from aggregating global features to alleviate the lack of local correspondences ground truth for the VPR task. Third, we suggest an efficient re-ranking pipeline that is efficiently and precisely based on discriminative region guidance. Finally, experimental results show that our FoL achieves the state-of-the-art on multiple VPR benchmarks in both image retrieval and re-ranking stages and also significantly outperforms existing two-stage VPR methods in terms of computational efficiency. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：