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

Decoupled knowledge distillation method based on meta-learning

High-Confidence Computing 2024年第1期4卷 1-6页

作者： Wenqing Du Liting Geng Jianxiong Liu Zhigang Zhao Chunxiao Wang Jidong Huo Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250014China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250014China Aerospace Science&Industry Network Information Development Co. LTDBeijing 100854China

With the advancement of deep learning techniques,the number of model parameters has been increasing,leading to significant memory consumption and limits in the deployment of such models in real-time *** reduce the number of model parameters and enhance the generalization capability of neural networks,we propose a method called Decoupled MetaDistil,which involves decoupled *** method utilizes meta-learning to guide the teacher model and dynamically adjusts the knowledge transfer strategy based on feedback from the student model,thereby improving the generalization ***,we introduce a decoupled loss method to explicitly transfer positive sample knowledge and explore the potential of negative samples *** experiments demonstrate the effectiveness of our method.

关键词： Model compression Knowledge distillation Meta-learning Decoupled loss

来源：评论

学校读者我要写书评

暂无评论

Neural RAPT: deep learning-based pitch tracking with prior algorithmic knowledge instillation

引用

International Journal of Speech technology 2023年第4期26卷 999-1015页

作者： Wang, Kai Liu, Jingjing Peng, Yizhou Huang, Hao School of Computer Science and Technology Xinjiang University Urumqi830017 China Xinjiang Provincial Key Laboratory of Multi-lingual Information Technology Xinjiang University Urumqi830017 China

The task of estimating the fundamental frequency of an audio signal, also known as pitch tracking, has been a long-standing research area in speech signal processing. Recently, there has been a growing interest in data-driven pitch tracking methods that leverage deep learning technologies. However, deep learning-based pitch tracking models often neglect the methodologies employed in well-established signal processing-based pitch tracking algorithms, which incorporate valuable prior knowledge. Motivated by this, we propose Neural RAPT, an interpretable neural network-based pitch tracking model that incorporates signal processing knowledge from RAPT. The proposed model consists of a front-end module and a back-end module. The front-end module adopts the U-Net structure, which inherently involves downsampling and upsampling processes similar to RAPT. To enhance the U-Net, we introduce a neural autocorrelation function (ACF) module using masked CNN, along with a normalization layer that models the sample pair-wise product in the normalized cross-correlation function (NCCF). The back-end module is based on the Transformer architecture. The model is evaluated by pitch tracking experiments on the PTDB-TUG database and noisy mixtures with the NOISEX-92 database at different SNRs. The experimental results demonstrate that incorporating algorithmic knowledge into the model design leads to improved performance. The proposed model inherits the advantages of high accuracy from traditional pitch tracking algorithms, while also benefiting from the noise robustness offered by neural network-based methods. Consequently, our model exhibits superiority over existing deep learning-based pitch tracking methods. © 2023, The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

A Novel 3D Medical Image Segmentation Model Using Improved SAM

A Novel 3D Medical Image Segmentation Model Using Improved S...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Kuang, Yuansen Ma, Xitong Zhao, Jing Wang, Guangchen Zeng, Yijie Liu, Song Key Laboratory of Computing Power Network and Information Security Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

3D medical image segmentation is an essential task in the medical image field, which aims to segment organs or tumours into different labels. A number of issues exist with the current 3D medical image segmentation task: existing models cannot simultaneously obtain the space correlation and depth correlation of 3D slices;previous models suffer from local detail loss of positional embedding in 3D images;previous approaches often have blurring of boundaries in segmenting 3D images. To solve these shortcomings, we propose a 3D medical image segmentation model named TPM-SAM. In our model, we design a twinchannel image encoder to simultaneously capture the space correlation and depth correlation of 3D slices through a multi-head attention mechanism and improved adapters. Furthermore, we design a prompt encoding generator, which divides the volumetric image into small blocks and better captures the local detail information. In addition, we introduce a multi-layer aggregation decoder by employing U-Net with multi-level skip connection to solve the blurring of boundaries in processing 3D images. Finally, we experimented and evaluated our model on KiTS21 and LiTS17 datasets to compare with other baseline models. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Textual Data De-Privatization Scheme Based on Generative Adversarial networks 24th

Textual Data De-Privatization Scheme Based on Generative Adv...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Du, Yanning Xu, Jinnan Zhang, Yaling Wang, Yichuan Wang, Zhoukai School of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an China

ISBN: (纸本)9789819615506

In many fields, such as healthcare, finance, and scientific research, data sharing and collaboration are critical to achieving better outcomes. However, the sharing of personal data often involves privacy risks, so privacy-preserving techniques are needed to ensure data security and privacy. The superior performance and flexibility of generative models in data representation have led to significant progress in the development of data privacy. This paper proposes a textual data de-privatization scheme based on generative adversarial networks that well combines generative adversarial networks with privacy protection. The generated de-privacy data retains the statistical properties of the original data and effectively removes sensitive information. Moreover, feature sorting and reshaping modules are introduced to enable the generator to better capture the relationships between features, thus improving the quality of synthetic data. In this paper, the utility of synthetic data is evaluated from three aspects, including similarity assessment, privacy assessment, and model utility assessment. Experimental results show that this method achieves a good trade-off in terms of textual data privacy protection and data quality maintenance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Endogenous Security of FQn networks: Adaptive System-Level Fault Self-Diagnosis

引用

IEEE Transactions on Reliability 2024年第3期73卷 1659-1668页

作者： Lin, Yuhang Lin, Limei Huang, Yanze Xu, Li Hsieh, Sun-Yuan Fujian Normal University College of Computer and Cyber Security Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou350117 China Fujian University of Technology School of Computer Science and Mathematics Fuzhou350118 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

Endogenous security has the ability to discover, eliminate, and solve internal security problems and hidden dangers within the network, and is a superior technology to ensure future network security. The t/k-diagnosis strategy, as a strong and adaptive self-diagnosis strategy, is an important part for ensuring endogenous security. Moreover, the folded hypercube (FQn) as a data transmission network (e.g., optical network) topology offers new potential for the construction of large-scale, high data throughput, and low-latency systems, such as computing network, human-cyber-physical systems, and smart grid. However, there are few studies on endogenous security based on FQn networks. Therefore, this article designs an adaptive system-level fault self-diagnosis strategy, namely Fast t/k-Diagnosis Under Maeng-Malek Model (Ftk-DIAG-MM*) to diagnosis the faulty vertices in FQn network under the Maeng-Malek model (MM∗ mod). Then, we provide a proof of the algorithm correctness theoretically by the fault tolerance of FQn network. It is derived by theoretical derivation that the t/k-diagnosability inherent to the FQn network is (n+1)(k+1)-k(k+3)/2. The simulation experiments demonstrate that the designed Ftk-DIAG-MM∗ strategy can correctly diagnose all vertices within the range allowed by the diagnosability, and still has a great performance when it exceeds the range allowed by the diagnosability. It greatly enhances the fault diagnosis capability of FQn network in the circumstance of misdiagnosing a few vertices, which provides an important theoretical basis for the reliability and endogenous security of FQn networks. © 1963-2012 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

FCA-based θ-iceberg core decomposition in graphs

引用

Journal of Ambient Intelligence and Humanized Computing 2024年第2期15卷 1423-1428页

作者： Hao, Fei Xinchang, Khamphaphone Park, Doo-Soon Key Laboratory of Modern Teaching Technology Ministry of Education Xi’an China School of Computer Science Shaanxi Normal University Xi’an710119 China Department of Computer Science and Engineering Soonchunhyang University Asan31538 Korea Republic of Department of Computer Software Engineering Soonchunhyang University Asan31538 Korea Republic of

Complex networking analysis is a powerful technique for understanding both complex networks and big graphs in ubiquitous computing. Particularly, there are several novel metrics, such as k-clique and k-core are proposed in order to study the relative importance of nodes in complex networks. Among of those metrics, k-core analysis is an effective approach for simplifying graphical structure. However, the relation between k and the scale of networks is not explored in most existing literature. Toward this end, this paper formulate a new research problem, θ-Iceberg Core decomposition in graphs, which is able to incorporate a parameter θ (0 © Springer-Verlag GmbH Germany, part of Springer Nature 2017.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

A Multi-Objective Particle Swarm Optimization Algorithm Based on Decomposition and Multi-Selection Strategy

引用

computers, Materials & Continua 2025年第1期82卷 997-1026页

作者： Li Ma Cai Dai Xingsi Xue Cheng Peng School of Computer Science Shaanxi Normal UniversityXi’an710119China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of TechnologyFuzhou350118China Information Construction and Management Center and Institute of Artificial Intelligence and Educational New Productivity Ningxia Normal UniversityGuyuan756099China

The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization *** the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search ***,two update strategies based on decomposition are used to update the evolving population and external archive,***,a multiselection strategy is *** first strategy is for the subspace without a non-dominated *** the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global *** second strategy is for the subspace with a non-dominated *** the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local *** third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated *** the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to ***,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search ***,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test *** results show that the proposed algorithm has better performance.

关键词： Multi-objective optimization multi-objective particle swarm optimization decomposition multi-selection strategy

来源：评论

学校读者我要写书评

暂无评论

Domain Adaptive Lung Nodule Detection in X-Ray Image

Domain Adaptive Lung Nodule Detection in X-Ray Image

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Zhao, Haifeng Jiang, Lixiang Ma, Leilei Sun, Dengdi Fu, Yanping School of Computer Science and Technology Anhui University Anhui Provincial Key Laboratory of Multi-modal Cognitive Computation Hefei China

ISBN: (纸本)9781665410205

Medical images from different healthcare centers exhibit varied data distributions, posing significant challenges for adapting lung nodule detection due to the domain shift between training and application phases. Traditional unsupervised domain adaptive detection methods often struggle with this shift, leading to suboptimal outcomes. To overcome these challenges, we introduce a novel domain adaptive approach for lung nodule detection that leverages mean teacher self-training and contrastive learning. First, we propose a hierarchical contrastive learning strategy to refine nodule representations and enhance the distinction between nodules and background. Second, we introduce a nodule-level domain-invariant feature learning (NDL) module to capture domain-invariant features through adversarial learning across different domains. Additionally, we propose a new annotated dataset of X-ray images to aid in advancing lung nodule detection research. Extensive experiments conducted on multiple X-ray datasets demonstrate the efficacy of our approach in mitigating domain shift impacts. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Deep supervised fused similarity hashing for cross-modal retrieval

引用

Multimedia Tools and Applications 2024年第39期83卷 86537-86555页

作者： Ng, Wing W. Y. Xu, Yongzhi Tian, Xing Wang, Hui Guangdong Provincial Key Laboratory of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering South China University of Technology Guangzhou China School of Artificial Intelligence South China Normal University Guangzhou China School of Electronics Electrical Engineering and Computer Science Queens University Belfast Belfast United Kingdom

The need for cross-modal retrieval increases significantly with the rapid growth of multimedia information on the Internet. However, most of existing cross-modal retrieval methods neglect the correlation between label similarity and intra-modality similarity in common semantic subspace training, which makes the trained common semantic subspace unable to preserve semantic similarity of original data effectively. Therefore, a novel cross-modal hashing method is proposed in this paper, namely, Deep Supervised Fused Similarity Hashing (DSFSH). The DSFSH mainly consists of two parts. Firstly, a fused similarity method is proposed to exploit the intrinsic inter-modality correlation of data while preserving the intra-modality relationship of data at the same time. Secondly, a novel quantization max-margin loss is proposed. The gap between cosine similarity and Hamming similarity is closed by minimizing this loss. Extensive experimental results on three benchmark datasets show that the proposed method yields better retrieval performance comparing to state-of-the-art methods. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Transmission Energy Allocation for Over-the-Air Computation with Energy Harvesting

引用

Journal of Communications and Information networks 2024年第2期9卷 126-136页

作者： Siyao Zhang Zixiang Ren Xinmin Li Yin Long Jie Xu Shuguang Cui School of Computer Science and Technology Southwest University of Science and TechnologyMianyang 621010China Shenzhen Future Network of Intelligence Institute(FNii-Shenzhen) The Chinese University of Hong KongShenzhenGuangdong 518172China School of Information Science and Technology University of Science and Technology of ChinaHefei 230027China FNii-Shenzhen The Chinese University of Hong KongShenzhenGuangdong 518172China College of Computer Science Chengdu UniversityChengdu 610100China School of Science and Engineering FNii-Shenzhenand Guangdong Provincial Key Laboratory of Future Networks of IntelligenceThe Chinese University of Hong KongShenzhenGuangdong 518172China

Over-the-air computation(AirComp)has recently emerged as a promising multiple-access technique for fast wireless data aggregation(WDA)from distributed wireless devices(WDs). This paper investigates an energy harvesting (EH) AirComp system, in which multiple EH-powered single-antenna WDs simultaneously send wireless signals to a single-antenna access point (AP) with conventional energy supply for WDA via AirComp. Under this setup, we minimize the average computation mean square error(MSE)over a particular time period, by jointly optimizing the transmit energy allocation at the WDs and the AirComp denoising factors at the AP over time, subject to the energy causality constraints at individual WDs. First, we consider the offline scenario by assuming that the energy state information(ESI)and channel state information (CSI) are non-causally known at the beginning of the period, in which the formulated average MSE minimization corresponds to a non-convex optimization problem. We present a high-quality converged solution by using the techniques of alternating optimization and convex optimization. It is shown that for each WD,if the EH rate is sufficiently high,then the channel inversion power allocation is adopted;while if the EH rate is low, then all the harvested energy should be used up for transmission with proper energy allocation over time. Next, we consider the online scenario with causal ESI and CSI,in which the MSE minimization becomes a stochastic optimization *** this scenario, we present an offline-inspired online algorithm to obtain efficient online energy allocation designs by utilizing the obtained offline solutions. Finally,numerical results show that the proposed designs significantly outperform two benchmark schemes with power-halving and full-power transmission,respectively.

关键词： over-the-air computation(AirComp) power allocation energy harvesting(EH) optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：