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

Symbiosis Rather Than Aggregation: Towards Generalized Federated Learning via Model Symbiosis

IEEE Internet of Things Journal 2025年

作者： Liu, Yuange Liu, Yuru Zhang, Weishan Zheng, Chaoqun Jiang, Wei Luo, Daobin Qiao, Qiao Meng, Lingzhao Zhao, Hongwei Yang, Su College of Computer Science and Technology Qingdao266580 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan250014 China Information Science Academy of China Electronics Technology Group Corporation Beijing100036 China Fudan University School of Computer Science Shanghai200433 China

Federated Learning (FL) faces significant challenges in scenarios with non-IID (non-independent and identically distributed) data distributions across participating clients. Traditional aggregation-based approaches often struggle with the inherent misalignment between local and global optimization objectives, leadingwhich leads to gradient divergence and suboptimal generalization performance. This paper proposes a novel FL framework that replaces conventional aggregation with a biologically inspired model symbiosis approach called FedSym, which employs a dual-level symbiotic mechanism. Ectosymbiosis performs coarse-grained hierarchical parameter recombinations through random layer-wise model combination, while endosymbiosis enables fine-grained intra-layer parameter fusion through weighted averaging, collectively steering model updates towards flatter loss landscapes. Our theoretical analysis demonstrates that FedSym's convergence rate is O(1T) under non-IID conditions, which matches the convergence properties of FedAvg. Extensive experimentsevaluations across multiple datasets and model architectures show that FedSym achieves substantial improvements over state-of-the-art FL methods, particularly in challenging scenarios with high data heterogeneity, and demonstrates robust performance across varying numbers of participating clients and federation scales. © 2014 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

On the -differential spectra of two classes of power functions over finite fields

引用

Applicable Algebra in Engineering, Communication and computing 2025年 1-30页

作者： Liu, Qian Huang, Zhiwei Chen, Zhixiong Jiang, Rong Zhang, Liupiao Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Kunming China Fujian Key Laboratory of Financial Information Processing Putian University Putian China School of Computer Science and Technology Dongguan University of Technology Dongguan China

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. [7]. As an extension of the differential uniformity, it is theoretically appealing to determine the properties of c-differential uniformity and the corresponding c-differential spectrum. In this paper, based on certain quadratic character sums and two special elliptic curves over $$\mathbb {F}_p$$ , the $$(-1)$$ -differential spectra of the following two classes of power functions over $$\mathbb {F}_{p^n}$$ is completely determined: (1) $$f_1(x)=x^{\frac{p^n+3}{2}}$$ , where $$p>3$$ and $$p\equiv 3\pmod 4$$ ; (2) $$f_2(x)=x^{p^n-3}$$ , where $$p>3$$ . The obtained result shows that the $$(-1)$$ -differential spectra of $$f_1(x)$$ and $$f_2(x)$$ can be expressed explicitly in terms of n. Moreover, an upper bound of the c-differential uniformity of $$f_2(x)$$ is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multimodal Dialogue Emotion Recognition Based on Label Optimization and Coarse-Grained Assisted Fine-Grained

Multimodal Dialogue Emotion Recognition Based on Label Optim...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhibo Zhang Zhenyu Yang Yan Huang Baojie Xu Wenyue Hu 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) China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Multimodal dialogue emotion recognition integrates data from multiple modalities to accurately identify emotional states in conversations. However, differences in expression and information density across modalities complicate the fusion of features. Traditional methods may introduce redundant information from other utterances, reducing the accuracy of emotion recognition. Existing one-hot labels often fail to capture the full range of emotional expressions, leading to biased results. To address these issues, we propose a model that fuses different modalities within the same utterance to avoid redundancy. It employs a progressive classification process, refining emotion recognition from coarse to fine granularity. Additionally, we use emotion polarity probabilities as weights for fine-grained classification and introduce a multimodal information-rich label that considers both the data and their interactions. Experiments on IEMOCAP and MELD datasets demonstrate the model’s effectiveness, significantly improving dialog emotion recognition accuracy. Our code is available at https://***/r/LOCG-188E.

关键词： Emotion recognition Accuracy Fuses Refining Termination of employment Speech recognition Signal processing Speech processing Optimization Faces

来源：评论

学校读者我要写书评

暂无评论

On the Performance of Coexisting Passive RIS and Active Relay-Assisted Short-Packet Communications

On the Performance of Coexisting Passive RIS and Active Rela...

引用

IEEE Conference on Wireless Communications and networking

作者： Chenyao Wei Liqin Shi Xiaoli Chu Xi Song Guangyue Lu Shaanxi Key Laboratory of Information Communication Network and Security Xi'an University of Posts & Telecommunications China University of Sheffield U.K. North China Electric Power University Beijing China

ISBN: (数字)9798350368369

ISBN: (纸本)9798350368376

Although coexisting passive reconfigurable intelligent surface (RIS) and active relay have been considered for enhancing long-packet communications, their potential in supporting short-packet communications (SPC) where the direct link is blocked has not been sufficiently studied. Motivated by this, this work investigates the performance of the coexisting passive RIS and active relay-assisted SPC network, where a source (S) transmits its short-packet data to the destination (D) with the help of a passive RIS and an active relay (R). More specifically, in the first time slot of the two-hop transmission, S transmits its short-packet signal to both the RIS and R. The RIS then reflects the incident signal towards D. If D is unable to decode the short-packet information while R successfully decodes it, R forwards the decoded signal to D with the assistance of the RIS in the second time slot. Following a decode-and-forward (DF) relaying protocol, we analytically derive the closed-form expression of the block error rate (BLER) for the short-packet transmission. Simulation results verify the correctness of the derived expression and show that the combination of the passive RIS and active relay can enhance the BLER performance as compared with the benchmarks that employ only a passive RIS or an active relay.

关键词： Closed-form solutions Protocols Error analysis Simulation Reconfigurable intelligent surfaces Benchmark testing Relays

来源：评论

学校读者我要写书评

暂无评论

Adaptive ELM-Based Time-Constrained Control of Uncertain Robotic Manipulators With Minimum Learning Computation

引用

IEEE Transactions on Emerging Topics in computing 2025年

作者： Jin, Xiaozheng Hou, Yuhan Wu, Xiaoming Chi, Jing Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Jinan250013 China Qilu Institute of Technology School of Intelligent Manufacturing and Control Engineering Shandong Jinan250200 China Shandong University of Finance and Economics School of Computing and Artificial Intelligence Shandong Jinan250014 China

This paper studies the extreme learning machine (ELM)-based time-constrained trajectory tracking control of a class of robotic manipulator systems with model/input uncertainties, matched and mismatched disturbances. A uniform robust exact differentiator (URED) is developed to construct a multi-layer virtual control framework of the robotic manipulator system. Under the control framework, adaptive ELM-based control strategies are proposed to suppress the influence of the uncertainties and disturbances layer-by-layer, combining with the minimum learning parameter (MLP) technique which is employed to reduce the calculation complexity of ELM parameters. The significance of this study is that general model/input uncertainties, matched and mismatched disturbances can be effectively compensated within a limited time, so that bounded trajectory tracking of the robotic manipulator can be achieved avoiding the complexity explosion issue. The time-constrained stability of the closed-loop robotic error systems is proved through Lyapunov stability theory. Finally, comparative simulations are employed to display the feasibility and superiority of the designed robust adaptive ELM-based control schemes of a robotic manipulator system. © 2013 IEEE.

关键词： Robust control

来源：评论

学校读者我要写书评

暂无评论

MEDIAN: Adaptive Intermediate-grained Aggregation network for Composed Image Retrieval

MEDIAN: Adaptive Intermediate-grained Aggregation Network fo...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Qinlei Huang Zhiwei Chen Zixu Li Chunxiao Wang Xuemeng Song Yupeng Hu Liqiang Nie School of Software Shandong University Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology (Shandong Academy of Sciences) School of Computer Science and Technology Shandong University School of Computer Science and Technology Harbin Institute of Technology (Shenzhen)

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The Composed Image Retrieval (CIR) task aims to retrieve a target image that meets the requirements based on a given multimodal query (includes a reference image and modification text). Most existing works align multimodal semantics at both local and global granularity. However, they have failed to consider the mining of semantic correspondences at the intermediate-grained level, which has resulted in sub-optimal model performance. In this paper, we propose an adaptive interMEDiate-graIned Aggregation network (MEDIAN). Compared with the conventional CIR models, MEDIAN is capable of generating intermediate-grained feature aggregation supervised signals and constructing graph attention networks to extract intermediate-grained features. Concurrently, MEDIAN also devises cross-modal semantic correspondence aligning guided by the target image, which in turn enables accurate multi-grained feature composition. The superiority of MEDIAN is demonstrated by extensive experiments on three benchmark datasets. Our code is available at https://***/***/.

关键词： Adaptation models Adaptive systems Accuracy Codes Semantics Image retrieval Benchmark testing Signal processing Feature extraction Speech processing

来源：评论

学校读者我要写书评

暂无评论

PAIR: Complementarity-guided Disentanglement for Composed Image Retrieval

PAIR: Complementarity-guided Disentanglement for Composed Im...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhiheng Fu Zixu Li Zhiwei Chen Chunxiao Wang Xuemeng Song Yupeng Hu Liqiang Nie School of Software Shandong University Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology (Shandong Academy of Sciences) School of Computer Science and Technology Shandong University School of Computer Science and Technology Harbin Institute of Technology (Shenzhen)

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Composed Image Retrieval (CIR) is a novel image retrieval paradigm that aims at searching for the target images via the multimodal query including a reference image and a modification text. Although existing works have made significant progress, they overlook the inter-modal coherence and incoherence relations modeling, hindering the retrieval accuracy of CIR models. This limitation is non-trivial due to the following two challenges: 1) inter-modal incoherence and 2) intra-modal entanglement. To address the above challenges, we propose a comPlementArity-guided dIsentanglement network (PAIR), which can disentangle the features of multimodal queries from a semantic coherence perspective, thereby facilitating the identification of both complementary coherent and incoherent features. Furthermore, based on disentangled features, PAIR develops an asymmetric feature composition module, which is designed to enhance the retrieval performance of the model. Extensive experiments on three benchmark datasets demonstrate the superiority of PAIR. The code is available at https://***/***/.

关键词： Codes Accuracy Image retrieval Semantics Coherence Benchmark testing Signal processing Acoustics Speech processing Protection

来源：评论

学校读者我要写书评

暂无评论

How to Construct Public Timeline for RSA-Formed Time-Lock Cryptography 20th

How to Construct Public Timeline for RSA-Formed Time-Lock ...

引用

20th International Conference on information security and Cryptology, Inscrypt 2024

作者： Jin, Huixuan Peng, Cong Fu, Jintao Luo, Min Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan China Henan Key Laboratory of Network Cryptography Technology Henan Zhengzhou China Inspur Academy of Science and Technology Jinan China

ISBN: (纸本)9789819647330

Time-Locked Puzzle (TLP) and timed-release encryption (T-RE) are both time-based locking mechanisms. The former requires the decryptor to perform a predetermined amount of computation, while the latter requires a trusted server to release the decryption information after a preset time, thereby sending information to the future. As research has progressed, many feature-rich TLPs and TREs have emerged. However, TLP and TRE still face issues in practical deployment. The imbalance in computation load with TLP can result in significant computational burdens in many deployment scenarios, while the timed release in TRE necessitates that the server remains online. To address these issues, our goal is to develop a multifunctional solution to offload the computational burden and allow the server to be offline. Our scheme focuses on RSA-based TLPs and builds upon the sequential TRE schemes proposed by Chvojka and Jager et al.(ESORICS’21). We construct a multi-timeline scheme that aggregates multiple functions and allows the server to be offline. The multi-timeline structure proposed in our scheme, consisting of a main timeline, sub-timelines, and reward timelines, allows different timelines to assume different functions, and the main timeline controls the information release of the remaining timelines to achieve an efficient puzzle-solving release mechanism. The reward timeline provides a transfer account for storing bonuses for entities that solve puzzles, which achieves a self-balancing mechanism for computing resources. Due to the completion of a transaction guaranteed by the adaptor signature and smart contract, which ensure the atomicity of the transaction, the scheme achieves a traceable fair trading mechanism and a public verification mechanism. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： computational burden multi-timeline TLP TRE

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Authenticated key-Management Mechanism for e-Healthcare Environment

引用

IEEE Internet of Things Journal 2025年

作者： Saleem, Muhammad Asad Li, Xiong Mahmood, Khalid Ghaffar, Zahid Xie, Yong Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan National Yunlin University of Science and Technology Graduate School of Engineering Science and Technology Douliu64002 Taiwan Qinghai Institute of Technology School of Computer and Information Science China Qinghai Provincial Laboratory for Intelligent Computing and Application China Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan250353 China

The Internet of Things (IoT) is rapidly permeating all aspects of human life, involving a network of devices that share sensitive data. A notable application is the e-healthcare systems, which employ connected sensors, medical servers, and wearable devices. However, the public nature of communication in e-healthcare systems poses challenges such as security, privacy, and authentication of participating entities. Recently, many authentication protocols have been introduced to address these challenges. However, most of these protocols remain vulnerable to various security attacks, including device or medical server impersonation, denial of service, physical or cloning, and de-synchronization attacks. Therefore, we introduce an authenticated key-management protocol utilizing hash functions and Cipher-Block Chaining-Advanced Encryption Standard encryption (CBC-AES) encryption. The proposed protocol also employs the Physical Unclonable Function (PUF), which makes it more robust and efficient in resisting physical or cloning attacks. Additionally, the proposed scheme resists various security threats, including impersonation, session key leakage, ephemeral secret leakage, and de-synchronization attacks. We analyze the scheme’s security and reliability through formal and informal analysis. The informal analysis demonstrates that the scheme encompasses crucial security features, while the formal analysis substantiates. Moreover, performance analysis of the proposed protocol with various competing results indicates that our protocol achieves an average reduction in communication and computation overheads by 36.03.% and 41.79%, respectively. © 2014 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

SML: A Backdoor Defense for Non-Intrusive Speech Quality Assessment via Semi-Supervised and Multi-Task Learning

SML: A Backdoor Defense for Non-Intrusive Speech Quality Ass...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Ying Ren Wenjie Zhang Jiahong Ye Jie Li Diqun Yan Bin Ma Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo China College of Digital Technology and Engineering Ningbo University of Finance and Economics Ningbo China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology (Shandong Academy of Sciences) China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Non-intrusive speech quality assessment (NISQA) is widely used in speech downstream tasks due to its ability to predict the quality of speech without a reference speech. However, few researchers have focused on the backdoor security of NISQA. Despite the backdoor defenses have been extensively studied to mitigate the threat of maliciously modifications in deep neural networks. In particular, semi-supervised based backdoor defenses have excellent defensive performance by depriving backdoor attacks of their most essential need. But these defense methods rely on data-augmentation consistency and thus cannot be applied to NISQA. In this work, we propose a backdoor defense based on semi-supervised and multi-task learning (SML). Semi-supervised learning is based on the simple assumption that the same input should be as consistent as possible in two similar models. Multi-task learning further improves the prediction performance of mean opinion score (MOS) by learning the tasks of perceptual evaluation of speech quality (PESQ), short-time objective intelligibility (STOI) and speech distortion index (SDI). Extensive experiments involving five backdoor defenses against five backdoor attacks on two benchmark datasets demonstrate the superiority of our SML approach.

关键词： Acoustic distortion Artificial neural networks Semisupervised learning Benchmark testing Multitasking Acoustics Quality assessment security Indexes Speech processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：