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

Efficient and fine-grained access control with fully-hidden policies for cloud-enabled IoT

Digital Communications and Networks 2025年第2期11卷 473-481页

作者： Qi Li Gaozhan Liu Qianqian Zhang Lidong Han Wei Chen Rui Li Jinbo Xiong School of Computer Science Nanjing University of Posts and TelecommunicationsNanjing 210023China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal UniversityHangzhou 311121China Tongda College of Nanjing University of Posts and Telecommunications Yangzhou 225127China Henan Key Laboratory of Network Cryptography Technology Zhengzhou 450001China School of Computer Science and Technology Xidian UniversityXi'an 710071China State Key Laboratory of Tibetan Intelligent Information Processing and Application Qinghai Normal UniversityXining 810008China Faculty of Software Fujian Normal UniversityFuzhou 350108China

Ciphertext-Policy Attribute-Based Encryption(CP-ABE)enables fine-grained access control on ciphertexts,making it a promising approach for managing data stored in the cloud-enabled Internet of *** existing schemes often suffer from privacy breaches due to explicit attachment of access policies or partial hiding of critical attribute ***,resource-constrained IoT devices,especially those adopting wireless communication,frequently encounter affordability issues regarding decryption *** this paper,we propose an efficient and fine-grained access control scheme with fully hidden policies(named FHAC).FHAC conceals all attributes in the policy and utilizes bloom filters to efficiently locate them.A test phase before decryption is applied to assist authorized users in finding matches between their attributes and the access *** attacks are thwarted by providing unauthorized users with invalid *** heavy computational overhead of both the test phase and most of the decryption phase is outsourced to two cloud ***,users can verify the correctness of multiple outsourced decryption results *** analysis and performance comparisons demonstrate FHAC's effectiveness in protecting policy privacy and achieving efficient decryption.

关键词： Access control Policy hiding Verifiable outsourced computation Cloud IoT

来源：评论

学校读者我要写书评

暂无评论

Event-Triggered Cooperative Tracking Control of Multiagent Systems with a Dynamic Leader via Approximate Dynamic Programming

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2752-2765页

作者： Fu, Hao He, Haodong Chen, Yang Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System The School of Computer Science and Technology Wuhan430081 China Wuhan University of Science and Technology Eng. Res. Center for Metallurgical Automation and Measurement Technology of Ministry of Education Wuhan430081 China

This article investigates the optimal cooperative tracking control problem for unknown nonlinear multiagent systems with a real dynamic leader and uncertainties. Its main difficulty lies in eliminating effect of the unmatched uncertainty and noncooperation in the event-triggered manner. To overcome this difficulty, a distributed robust event-triggered control algorithm is developed with the aid of a disturbance observer and robust approximate dynamic programming (ADP). Specifically, this problem is converted into a cooperative multiplayer game for the distributed auxiliary systems employing observer-based feedforward compensation, which contributes to reducing conservatism;via an adaptive event-triggered mechanism and a new weight tuning law, a distributed robust ADP approach is proposed with hope to obviate judging the existence of the saddle point beforehand. Moreover, the local neighbor tracking error and the weight estimation error are demonstrated to be uniformly ultimately bounded by means of Lyapunov stability theory. We also prove that Zeno behavior is excluded. A comparative simulation example for multiquadrotor systems is carried out to verify the effectiveness and superiority of our algorithm. © 2020 IEEE.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Continuous and generalized visual odometry based on FLANN_PSC-RANSAC_LSTM

引用

Journal of intelligent and Fuzzy Systems 2024年第1-2期47卷 15-28页

作者： Li, Dengao Feng, Ran Wu, Fanming Zhao, Jinhua Zhao, Jumin College of Computer Science and Technology College of Data Science Taiyuan University of Technology Shanxi Taiyuan China College of Electronic Information and Optical Engineering Taiyuan University of Technology Shanxi Taiyuan China Key Laboratory of Big Data Fusion Analysis and Application of Shanxi Province Taiyuan University of Technology Shanxi Taiyuan China Intelligent Perception Engineering Technology Center of Shanxi Taiyuan China

In the field of simultaneous localization and mapping (SLAM), visual odometry (VO) always has great application prospects. In recent years, with the progress in the field of machine learning, methods based on neural networks are constantly being updated and applied. In this paper, we propose a continuous and generalized monocular visual odometry method based on features and neural networks. First, the feature information of adjacent image sequences is extracted by matching and troubleshooting algorithm (FLANN_PSC-RANSAC), then it and the corresponding six-degree-of-freedom information are simultaneously input into the long short-term memory artificial neural network (LSTM) for model construction, which not only ensures the reliability of the mode but also eliminates the influence of illumination on the data. In the real environment test, it has been effectively proved in terms of trajectory recovery accuracy and generalization ability to different environments and different illuminations. © 2024 - IOS Press. All rights reserved.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Hybrid particle swarm optimization with adaptive learning strategy

引用

Soft Computing 2024年第17-18期28卷 9759-9784页

作者： Wang, Lanyu Tian, Dongping Gou, Xiaorui Shi, Zhongzhi School of Mathematics and Information Sciences Baoji University of Arts and Science Shaanxi Baoji721007 China Institute of Computer Software Baoji University of Arts and Sciences Shaanxi Baoji721007 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Particle swarm optimization (PSO) is a meta-heuristic algorithm that can be used to solve different real-world optimization problems. However, PSO suffers from some intrinsic drawbacks, including falling into local optimal and slow convergence in the latter evolution process. To deal with these issues, a hybrid PSO with adaptive learning strategy (abbreviated as HPSO-ALS) is proposed in this paper. To start with, the chaotic opposition-learning method is employed to generate the uniformly distributed particles so as to enhance the quality of the initial swarm. Next, a self-logical mapping-based nonlinear decreasing inertia weight is formulated to trade off the global search and local search abilities. Meanwhile, different adaptive position updating strategies are leveraged to achieve better convergence according to different evolution status. In addition, inspired by the cask effect, the global worst particle (gworst) is introduced into the velocity updating to make full use of the potential information of the particles. Finally, extensive experiments on sixteen benchmark functions and CEC’13 test suite have verified the promising performance of HPSO-ALS proposed in this paper. Alternatively, HPSO-ALS is also applied to the classical traveling salesman problem (TSP) and the experimental results have further validated the effectiveness and efficiency of our proposal. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Bearing fault signal detection based on whale algorithm to optimize stochastic resonance parameters 34

Bearing fault signal detection based on whale algorithm to o...

引用

第34届中国控制与决策会议

作者： Huang Weichao Zhang Ganggang Faculty of automation and Information Engineering Xi'an University of Technology Shannxi Key Laboratory of Complex System Control and Intelligent Information Processing

ISBN: (纸本)9781665478977

Aiming at the problem that the traditional stochastic resonance system cannot adaptively adjust the structural parameters in the bearing fault signal detection,this paper proposes a parameter adaptive stochastic resonance bearing fault signal detection method based on the whale optimization *** method is based on the bistable stochastic resonance system model,and the structural parameters of the bistable stochastic resonance are optimized through the adaptive whale algorithm,so that the fault signal is enhanced,and the bearing fault signal detection is *** method was verified by actual bearing fault signals,and a series of comparative experiments were carried *** results show that the method in this paper has a simple model,few algorithm parameters,fast convergence speed,and a large output signal-to-noise ratio of the stochastic resonance system,which can accurately and efficiently detect bearing fault signals.

关键词： Stochastic Resonance Whale Optimization Algorithm Bearing Failure Signal

来源：评论

学校读者我要写书评

暂无评论

Efficient Homomorphic Approximation of Max Pooling for Privacy-Preserving Deep Learning 6th

Efficient Homomorphic Approximation of Max Pooling for Pri...

引用

6th International Conference on Machine Learning for Cyber Security, ML4CS 2024

作者： Zhang, Peng Qiu, Dongyan Duan, Ao Liu, Hongwei The Guangdong Key Laboratory of Intelligent Information Processing College of Electronics and Information Engineering Shenzhen University Guangdong Shenzhen518060 China College of Big Data and Internet Shenzhen Technology University Guangdong Shenzhen518118 China

ISBN: (纸本)9789819645657

Privacy-Preserving Deep Learning (PPDL) using Fully Homomorphic Encryption (FHE) addresses potential data privacy exposure risks associated with deploying deep learning models in untrusted cloud environments. FHE-based PPDL enables users to encrypt their data locally, allowing cloud service providers to perform computations directly on the encrypted data without ever accessing it. However, FHE faces challenges in efficiently handling nonlinear computations, which are essential to deep learning frameworks, particularly in implementing activation functions and max pooling layers. To address this challenge, we improve the homomorphic max pooling approximation scheme HMaxPool, and propose an efficient homomorphic max pooling algorithm, denoted as HMaxPool+. Specifically, we first redefine the approximation of the maximum function, and then design sub-algorithm to address the potential output expansion issue. The experimental results validate that both the homomorphic max pooling algorithm itself and the corresponding homomorphic SqueezeNet neural network demonstrate enhancements in computational efficiency and accuracy. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Anchored Monotonic Alignment and Representation Substitution for Rare Spontaneous Behaviors in Spontaneous Speech Synthesis

Anchored Monotonic Alignment and Representation Substitution...

引用

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

作者： Wu, Ning-Qian Hu, Ya-Jun Chen, Liping Ling, Zhen-Hua National Engineering Research Center of Speech and Language Information Processing University of Science and Technology of China Hefei China iFLYTEK Research iFLYTEK Co. Ltd. China MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition University of Science and Technology of China China

ISBN: (纸本)9798350368741

Spontaneous behaviors in speech pose significant challenges for speech synthesis. Existing research has not adequately addressed these behaviors, with most studies relying on specially recorded datasets. In contrast, real-world data more accurately reflects the natural, spontaneous speaking styles in everyday life and encompasses a wider range of spontaneous behaviors. However, such data is often of lower quality, and the distribution of spontaneous behaviors is highly imbalanced. In this study, we explore spontaneous speech synthesis using real-world data within the VITS2 framework. To overcome these challenges, we introduce two techniques: anchored monotonic alignment and spontaneous hidden representation substitution. Experimental results demonstrate that these methods enhance model alignment and improve the naturalness of the generated speech. Our proposed approach successfully addresses the challenge of synthesizing rare spontaneous behaviors and offers users flexible control over the synthesized speech. © 2025 IEEE.

关键词： real-world data speech synthesis spontaneous behaviors spontaneous speech synthesis VITS

来源：评论

学校读者我要写书评

暂无评论

An Entity Alignment Algorithm Based on Ontology Enhancement and Multi-Feature Fusion 6

An Entity Alignment Algorithm Based on Ontology Enhancement ...

引用

6th International Conference on Frontier Technologies of information and Computer, ICFTIC 2024

作者： Song, Hao Lei, Yuxia Zi, Kangli Quan, Fuyuan Zhang, Tianhang Li, Qi School of Computer Science Qufu Normal University Shandong Rizhao China Institute of Computing Technology Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Beijing China

ISBN: (纸本)9798331541750

Entity alignment plays a crucial role in the integration of knowledge graphs. However, current knowledge graphs often suffer from inconsistent construction standards, structural heterogeneity, and imprecise semantic representation of entities, which can lead to suboptimal embedding of structural information. Moreover, most existing entity alignment methods rely heavily on structural information, which limits alignment efficiency. To address these challenges, this paper presents Onto-IMF, an ontology-enhanced entity alignment method based on multi-feature fusion. This approach aims to enhance the semantic representation of entities by incorporating ontology information, thereby reducing structural discrepancies among heterogeneous graphs and improving the embedding of structural information. The multi-feature fusion entity alignment leverages diverse semantic features, including relations, attributes, and entity names, to achieve more accurate alignment. Experimental results on various DBP15K subsets indicate that the proposed method achieves Hits@l scores of 86.6%, 93.0%, and 97.7%, respectively, representing an average improvement of 7.9% over the best-performing baseline models. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Adaptive Multi-Updating Strategy Based Particle Swarm Optimization

引用

intelligent Automation & Soft Computing 2023年第9期37卷 2783-2807页

作者： Dongping Tian Bingchun Li Jing Liu Chen Liu Ling Yuan Zhongzhi Shi School of Computer Science and Technology Kashi UniversityKashi844006China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing100190China

Particle swarm optimization(PSO)is a stochastic computation tech-nique that has become an increasingly important branch of swarm intelligence ***,like other evolutionary algorithms,PSO also suffers from premature convergence and entrapment into local optima in dealing with complex multimodal *** this paper puts forward an adaptive multi-updating strategy based particle swarm optimization(abbreviated as AMS-PSO).To start with,the chaotic sequence is employed to generate high-quality initial particles to accelerate the convergence rate of the ***,according to the current iteration,different update schemes are used to regulate the particle search process at different evolution *** be specific,two different sets of velocity update strategies are utilized to enhance the exploration ability in the early evolution stage while the other two sets of velocity update schemes are applied to improve the exploitation capability in the later evolution *** by the unequal weightage of acceleration coefficients is used to guide the search for the global worst particle to enhance the swarm *** addition,an auxiliary update strategy is exclusively leveraged to the global best particle for the purpose of ensuring the convergence of the PSO ***,extensive experiments on two sets of well-known benchmark functions bear out that AMS-PSO outperforms several state-of-the-art PSOs in terms of solution accuracy and convergence rate.

关键词： Particle swarm optimization local optima acceleration coefficients swarm diversity premature convergence

来源：评论

学校读者我要写书评

暂无评论

Inference-Time Decontamination: Reusing Leaked Benchmarks for Large Language Model Evaluation

Inference-Time Decontamination: Reusing Leaked Benchmarks fo...

引用

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

作者： Zhu, Qin Cheng, Qinyuan Peng, Runyu Li, Xiaonan Liu, Tengxiao Peng, Ru Qiu, Xipeng Huang, Xuanjing School of Computer Science Fudan University China Shanghai Key Laboratory of Intelligent Information Processing Fudan University China College of Computer Science and Technology Zhejiang University China

ISBN: (纸本)9798891761681

The training process of large language models (LLMs) often involves varying degrees of test data contamination (Yang et al., 2023b).Although current LLMs are achieving increasingly better performance on various benchmarks, their performance in practical applications does not always match their benchmark *** of benchmarks can prevent the accurate assessment of LLMs' true ***, constructing new benchmarks is costly, labor-intensive and still carries the risk of ***, in this paper, we ask the question "Can we reuse these leaked benchmarks for LLM evaluation?" We propose Inference-Time Decontamination (ITD) to address this issue by detecting and rewriting leaked samples without altering their *** can mitigate performance inflation caused by memorizing leaked *** proof-of-concept experiments demonstrate that ITD reduces inflated accuracy by 22.9% on GSM8K and 19.0% on *** MMLU, using Inference-time Decontamination can lead to a decrease in the results of Phi3 and Mistral by 6.7% and 3.6% *** hope that ITD can provide more truthful evaluation results for large language models. © 2024 Association for Computational Linguistics.

关键词： Decontamination

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：