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

arXiv 2024年

作者： Tao, Ruijie Shi, Zhan Jiang, Yidi Liu, Tianchi Li, Haizhou Department of Electrical and Computer Engineering National University of Singapore Singapore119077 Singapore School of Data Science The Chinese University of Hong Kong Shenzhen518172 China Singapore Institute of Technology Institute for Infocomm Research A∗STAR Singapore138632 Singapore Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big data Shenzhen518172 China University of Bremen Bremen28359 Germany

Modern speaker recognition system relies on abundant and balanced datasets for classification training. However, diverse defective datasets, such as partially-labelled, small-scale, and imbalanced datasets, are common in real-world applications. Previous works usually studied specific solutions for each scenario from the algorithm perspective. However, the root cause of these problems lies in dataset imperfections. To address these challenges with a unified solution, we propose the Voice Conversion Augmentation (VCA) strategy to obtain pseudo speech from the training set. Furthermore, to guarantee generation quality, we designed the VCA-NN (nearest neighbours) strategy to select source speech from utterances that are close to the target speech in the representation space. Our experimental results on three created datasets demonstrated that VCA-NN effectively mitigates these dataset problems, which provides a new direction for handling the speaker recognition problems from the data aspect. © 2024, CC BY.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Active legibility in multiagent reinforcement learning

引用

Artificial Intelligence 2025年 346卷

作者： Liu, Yanyu Pan, Yinghui Zeng, Yifeng Ma, Biyang Doshi, Prashant School of Automation Central South University No. 605 South Lushan Road Hunan Changsha410083 China School of Artificial Intelligence & National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Shenzhen China Department of Computer and Information Sciences Northumbria University Newcastle United Kingdom School of Computer Science Minnan Normal University Fujian Zhangzhou China Department of Computer Science University of Georgia AthensGA United States

A multiagent sequential decision problem has been seen in many critical applications including urban transportation, autonomous driving cars, military operations, etc. Its widely known solution, namely multiagent reinforcement learning, has evolved tremendously in recent years. Among them, the solution paradigm of modeling other agents attracts our interest, which is different from traditional value decomposition or communication mechanisms. It enables agents to understand and anticipate others' behaviors and facilitates their collaboration. Inspired by recent research on the legibility that allows agents to reveal their intentions through their behavior, we propose a multiagent active legibility framework to improve their performance. The legibility-oriented framework drives agents to conduct legible actions so as to help others optimize their behaviors. In addition, we design a series of problem domains that emulate a common legibility-needed scenario and effectively characterize the legibility in multiagent reinforcement learning. The experimental results demonstrate that the new framework is more efficient and requires less training time compared to several multiagent reinforcement learning algorithms. © 2025 The Author(s)

关键词： Urban transportation

来源：评论

学校读者我要写书评

暂无评论

Deep Multi-kernel Clustering Network

Deep Multi-kernel Clustering Network

引用

IEEE International Conference on data Mining (ICDM)

作者： Lina Ren Ruizhang Huang Shengwei Ma Yongbin Qin Yanping Chen Chuan Lin State Key Laboratory of Public Big Data Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and Technology Guizhou University Guiyang China Department of Information Engineering Guizhou Light Industry Technical College Guiyang China

In this paper, a deep multi-kernel clustering network, named DMKCN, is proposed to learn a high-quality and structurally separable kernel representation for the clustering task. Specifically, a multi-kernel learner is proposed to choose a suitable kernel function by learning a suitable combination of kernel functions automatically. A kernel-aid encoder module, consisting of a series of multi-kernel learners, is proposed to learn the structurally separable kernel representation. Besides, a dual self-supervised mechanism, consisting of a kernel self-supervised strategy and a representation self-supervised strategy, is designed to uniformly optimize the kernel representation learning and structural partition. The kernel self-supervised strategy is developed to supervise the multi-kernel learners with the consideration of an objective of clustering task, the representation self-supervised strategy is developed to guide the optimization of kernel representation learning by reconstructing the raw data. Extensive experiments on six real-world datasets demonstrate the outstanding performance of our proposed DMKCN.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Medical image super-resolution algorithm based on multi-scale feature aggregation

Medical image super-resolution algorithm based on multi-scal...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xinyu Han Xun Gong School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu China Manufacturing Industry Chains Collaboration and InformationSupport Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu China

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620

Ultrasound images are vital for medical diagnostics but often suffer from information loss and blurred details due to limitations in imaging systems and sensor technologies. Many researchers have proposed super-resolution algorithms to enhance medical images. But existing super-resolution methods struggle with the uneven distribution of noise and clarity. To address this, we propose a super-resolution algorithm for medical images based on multi-scale feature aggregation Leveraging the architecture of Unet as our primary framework, our method enhances output details through multi-scale hole convolutions. Taking into consideration the characteristics of ultrasonic images, we propose a frequency domain-based module to enhances edge information while effectively denoising the image. Furthermore, to improve the quality of the output images, we introduce an image processing module grounded in global information. The module ensures clarity while considering the overarching context, thereby preserving global consistency and enhancing output quality. We experiment on three datasets to demonstrate the effectiveness of our model. Additionally, significant improvements in medical image segmentation are observed, proving the practicability of our proposed approach.

关键词： Image segmentation Ultrasonic imaging Image edge detection Frequency-domain analysis Superresolution Noise reduction Noise Medical diagnosis Artificial intelligence Medical diagnostic imaging

来源：评论

学校读者我要写书评

暂无评论

Joint Sparsification and Quantization for Wireless Federated Learning under Communication Constraints

Joint Sparsification and Quantization for Wireless Federated...

引用

IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Junshen Su Xijun Wang Xiang Chen Ray-Guang Cheng School of Electronics and Information Technology Sun Yat-Sen University Guangzhou China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China Department of Electronic and Computer Engineering National Taiwan University of Science and Technology Taipei Taiwan

Communication efficiency is one of the key bottlenecks in Federated Learning (FL). Compression techniques, such as sparsification and quantization, are used to reduce communication overhead. However, joint designs of these techniques under communication constraints are not well-explored. This paper investigates the joint uplink compression problem in communication-constrained FL systems. We propose a Block-TopK sparsification scheme to reduce the proportion of bits used for locating entries of a sparsified vector. Considering the communication constraints, an optimization formulation is proposed to minimize the compression error. By solving the optimization problem, our joint compression method provides a better trade-off between sparsity budget and bit width. Numerical results demonstrate that our approach achieves 99.96% of baseline accuracy with only 1.56% of the baseline communication overhead when training ResNet-18 on CIFAR-10.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Efficient data Prefetch Strategy for Deep Learning Based on Non-volatile Memory 15th

An Efficient Data Prefetch Strategy for Deep Learning Based ...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Jiang, Wenbin Liu, Pai Jin, Hai Peng, Jing 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 Wuhan430074 China

ISBN: (纸本)9783030642426

Deep learning (DL) systems usually utilize asynchronous prefetch to improve data reading performance. However, the efficiency of the data transfer path from hard disk to DRAM is still limited by disk performance. The emerging non-volatile memory (NVRAM) provides a novel solution for this problem, while few existing researches have considered it. We propose a novel efficient data prefetch strategy for DL based on a heterogeneous memory system combining NVRAM with DRAM. Benefitting from the large capacity and fast reading speed of NVRAM, the strategy uses an asynchronous reading method named sliding NVRAM cache (SNC) to improve the performance of the data transfer paths. A sliding window is applied to map the data from disk to NVRAM and continuously update the data, while non-ideal writing performance of NVRAM can be remitted to a large extent in this strategy. Experiments show that SNC can improve the time performance of diverse deep neural networks training by more than 30%. © 2020, Springer Nature Switzerland AG.

关键词： Dynamic random access storage

来源：评论

学校读者我要写书评

暂无评论

Generalized Face Forgery Detection via Adaptive Learning for Pre-trained Vision Transformer

arXiv

引用

arXiv 2023年

作者： Luo, Anwei Cai, Rizhao Kong, Chenqi Ju, Yakun Kang, Xiangui Huang, Jiwu Kot, Alex C. The School of Information Technology Jiangxi University of Finance and Economics Nanchang330013 China The School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China Lab. School of Electrical and Electronic Engineering Nanyang Technology University Singapore The Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The China-Singapore International Joint Research Institute Singapore

With the rapid progress of generative models, the current challenge in face forgery detection is how to effectively detect realistic manipulated faces from different unseen domains. Though previous studies show that pre-trained Vision Transformer (ViT) based models can achieve some promising results after fully fine-tuning on the Deepfake dataset, their generalization performances are still unsatisfactory. One possible reason is that fully fine-tuned ViT-based models may disrupt the pre-trained features [1], [2] and overfit to some data-specific patterns [3]. To alleviate this issue, we present a Forgery-aware Adaptive Vision Transformer (FA-ViT) under the adaptive learning paradigm, where the parameters in the pre-trained ViT are kept fixed while the designed adaptive modules are optimized to capture forgery features. Specifically, a global adaptive module is designed to model long-range interactions among input tokens, which takes advantage of self-attention mechanism to mine global forgery clues. To further explore essential local forgery clues, a local adaptive module is proposed to expose local inconsistencies by enhancing the local contextual association. In addition, we introduce a fine-grained adaptive learning module that emphasizes the common compact representation of genuine faces through relationship learning in fine-grained pairs, driving these proposed adaptive modules to be aware of fine-grained forgery-aware information. Extensive experiments demonstrate that our FA-ViT achieves state-of-the-arts results in the cross-dataset evaluation, and enhances the robustness against unseen perturbations. Particularly, FA-ViT achieves 93.83% and 78.32% AUC scores on Celeb-DF and DFDC datasets in the cross-dataset evaluation. The code and trained model have been released at: https://***/LoveSiameseCat/FAViT. Copyright © 2023, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

BED: A Block-Level Deduplication-Based Container Deployment Framework 15th

BED: A Block-Level Deduplication-Based Container Deployment ...

引用

15th International Conference on Green, Pervasive, and Cloud computing, GPC 2020

作者： Zhang, Shiqiang Wu, Song Fan, Hao Zou, Deqing Jin, Hai 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 Scinece and Technology Wuhan430074 China

ISBN: (纸本)9783030642426

Container technology has gained great popularity in cloud environment since containers provide near-native performance and are lighter and less expensive than traditional virtual machines. However, starting up a non-local container, whose image is unavailable locally, is time-consuming. The reason is that pulling an image from a remote registry requires a long time. In this paper, we experimentally find that a lot of redundant data exists among image layers when we pull images from the registry. This redundant data causes additional pull time and makes the startup of a non-local container slower. To minimize the amount of pulled data while providing intact images, we propose a container deployment framework, BED, based on block-level deduplication. To be specific, BED stores an image layer as numerous data blocks and a fingerprint list which is generated based on these data blocks. When BED needs to pull an image, it pulls the fingerprint lists of the image, deduplicates these fingerprint lists, and pulls the data blocks non-existing locally from the registry. Based on the local and pulled blocks, BED reconstructs the image layers for a container. Experiments show that compared with original Docker, BED reduces the time of pulling images by 35% on average and saves about 48% data transmission in the network. © 2020, Springer Nature Switzerland AG.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

GDKansformer: A group-wise dynamic Kolmogorov–Arnold transformer with multi-view gated attention for pathological image diagnosis

引用

Expert systems with Applications 2025年 286卷

作者： Lu, Xiaoyan Gong, Xun Chen, Yuanyuan School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology and Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University Chengdu611756 China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education Chengdu611756 China Department of Pathology The Third People's Hospital of Chengdu Affiliated Hospital of Southwest Jiaotong University Chengdu610031 China

Pathological image diagnosis is a fundamental and critical component of precision medicine, playing a pivotal role in clinical decision-making. However, due to the high heterogeneity of pathological images, existing models still face the challenges of insufficient feature representation, poor interpretability, and high computational costs. To address these issues, we propose a novel pathological image diagnosis model called GDKansformer, which integrates the Group-wise Dynamic Kolmogorov–Arnold Network with a Vision Transformer (ViT) architecture. Specifically, this model employs adaptive dynamic fitting and group-wise computation strategies to seamlessly embed an improved Kolmogorov–Arnold Network (KAN) into ViTs, thereby boosting pathological representation and interpretability. The proposed group-wise computation strategy effectively mitigates the distribution overfitting caused by the KAN structure and significantly reduces the computational costs. Furthermore, a Multi-view Gated Attention (MVGA) block comprising pixel-level non-local neighborhoods and adaptive local perception is designed to eliminate redundant non-feature information and enhance contextual interactions, thereby improving the feature discrimination of the model for high heterogeneity data distributions. Experimental results demonstrate that GDKansformer achieves high accuracy with lower parameters, highlighting the significant potential in facilitating pathological diagnosis. © 2025

关键词： Pathology

来源：评论

学校读者我要写书评

暂无评论

Dynamic Searchable Scheme with Forward Privacy for Encrypted Document Similarity

Dynamic Searchable Scheme with Forward Privacy for Encrypted...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Mustafa A. Al Sibahee Chengwen Luo Jin Zhang Yijing Huang Zaid Ameen Abduljabbar National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen PR China College of Computer Science and Software Engineering Shenzhen University Shenzhen PR China Computer Technology Engineering Department Iraq University College Basrah Iraq Department of Computer Science College of Education for Pure Sciences University of Basrah Basrah Iraq Shenzhen Institute Huazhong University of Science and Technology Shenzhen PR China

ISBN: (数字)9798350381993

ISBN: (纸本)9798350382006

Document retrieval plays an essential role in many real-world applications especially when the data storage is outsourced. Due to the great advantages offered by cloud computing, clients tend to outsource their personal data to remote servers maintained by external service providers. This raises serious privacy concerns about outsourced data because such providers are usually considered untrusted entities. The majority of previous schemes of document similarity search share the same limitation: they focus mainly on static collections. Dynamic searchable schemes (DSE) allow adding or removing documents at the expense of more leakage than static schemes. To thwart certain attacks, DSE schemes should support forward privacy property, which ensures that newly added documents cannot be related to previously issued search queries. We design and implement dynamic secure similarity search schemes with forward privacy for textual documents utilizing simhash method for hamming similarity. Our scheme provides an efficient search time and a sufficient level of privacy. To show the practicality of our proposed scheme, we performed excremental results with large document collections.

关键词： Privacy data privacy Cloud computing Memory Search problems Cryptography Servers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：