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

Reversible data Hiding in Encrypted Images Based on Chinese Remainder Theorem

IEEE Transactions on Cloud Computing 2025年

作者： Chen, Jiani Xu, Dawen Ningbo University of Technology School of Cyber Science and Engineering Ningbo315211 China Anhui University of Science and Technology School of Mathmatics and Big Data Huainan232001 China

To deal with the development of the distributed server, this paper proposes a new method for reversible data hiding in encrypted images based on the Chinese Remainder Theorem (CRT), encrypting and sharing one image to multiple data hiders through (k, n)-threshold secret sharing. First, an original image is divided into the most significant bit (MSB) compression area and the least significant bit (LSB) area by utilizing the spatial correlation. The l-MSB layers are predicted to obtain prediction errors, and these prediction errors are compressed by Huffman coding. Then according to the value of k, CRT and secret sharing scheme are performed on the (8 - l)-LSB layers to generate the shared bitstream. Finally, n encrypted images for sharing consist of MSB compression bitstreams and shared bitstreams, whose size is adjusted based on k value. Each data hider can independently embed secret data after having one of the encrypted images, while the receiver can recover the original image only after receiving k or more encrypted images. Experimental results show that the proposed algorithm not only provides a large embedding space for secret data, but is also able to complete the inverse operation of data hiding and realize the lossless recovery of the original image with (k, n)-threshold secret sharing. © 2013 IEEE.

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

Controller Optimization of an Automated Force Calibration Device Based on an Improved Particle Swarm Algorithm

Controller Optimization of an Automated Force Calibration De...

引用

Sensors and Information technology (ICSI), International Conference on

作者： Jiming Jiang Xiang Dong Qiang Li Huibin Cao School of Electrical Engineering and Automation Anhui University Hefei China Department of Computer Science and Technology College of Big Data and Internet Shenzhen Technology University Shenzhen China Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei Anhui China

ISBN: (数字)9798331542887

ISBN: (纸本)9798331542894

This paper presents a PID controller optimization method based on an Improved Particle Swarm Optimization (IPSO) algorithm, aimed at enhancing the design and performance of automated force calibration devices. Traditional force calibration systems often suffer from limitations in automation and force application accuracy, which this method seeks to address. The IPSO algorithm incorporates logistic chaotic mapping to initialize particle positions and enhances the standard particle swarm algorithm through nonlinear decreasing weights and adaptive learning factors, resulting in improved global search capabilities and faster local convergence. Additionally, the objective function is refined by normalizing and weighting the integral of time-multiplied absolute error (ITAE) and the overshoot, thereby further enhancing the force application accuracy of the PID controller. Simulation results demonstrate that the IPSO algorithm offers significant advantages in terms of settling time, overshoot, and ITAE error when compared to traditional PID tuning methods (e.g., Ziegler-Nichols) and other optimization algorithms (e.g., GA, GWO). Experimental results validate the effectiveness and practicality of the IPSO algorithm, providing an efficient solution for the automation and high-precision control of force sensor calibration systems.

关键词： Performance evaluation Accuracy Automation Force Optimization methods Systems modeling Calibration Particle swarm optimization Tuning Standards

来源：评论

学校读者我要写书评

暂无评论

Multivariate Time Series Classification via Hierarchical Graph Embedding

Multivariate Time Series Classification via Hierarchical Gra...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Wenhao Niu Xingrui Zhuo Gongqing Wu JunWei Lv Zan Zhang Chenyang Bu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Anhui China

Multivariate time series classification aims to determine the labels for multivariate time series samples. Although variable interaction relationships and sample similarity relationships exist in multivariate time series, the available related methods usually ignore the rich relationships and are ineffective in exploiting these. To solve this problem, we propose a Hierarchical Graph Embedding for Multivariate Time Series Classification (MTSC-HGE), which consists of a variable-wise attentive graph pooling module and a sample-wise graph convolutional module to obtain the relationships of variables and samples. Specifically, we design an attentive graph pooling module based on self-attention, which can obtain sample features fusing temporal patterns and variable interaction relationships in samples. Furthermore, we propose a graph mapping criterion that converts the MTS dataset into a graph based on dynamic time warping to explicitly reflect the similarity relationships between samples. To capture latent sample relationships, a GCN module is utilized on the sample graph to integrate sample features obtained from the attentive graph pool module. In addition, a classifier takes the rich representation output by the model to get the final predicted class. Extensive experiments on 14 public datasets show that MTSC-HGE significantly outperforms state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

AegonKV: a high bandwidth, low tail latency, and low storage cost KV-separated LSM store with SmartSSD-based GC offloading 25

AegonKV: a high bandwidth, low tail latency, and low storage...

引用

Proceedings of the 23rd USENIX Conference on File and Storage Technologies

作者： Zhuohui Duan Hao Feng Haikun Liu Xiaofei Liao Hai Jin Bangyu Li National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133458

The key-value separation is renowned for its significant mitigation of the write amplification inherent in traditional LSM trees. However, KV separation potentially increases performance overhead in the management of Value region, especially for garbage collection (GC) operation that is used to reduce the redundant space occupation. In response, many efforts have been made to optimize the GC mechanism for KV separation. However, our analysis indicates that such solution based on trade-offs between CPU and I/O overheads cannot simultaneously satisfy the three requirements of KV separated systems in terms of throughput, tail latency, and space usage. This limitation hinders their real-world *** this paper, we introduce AegonKV, a "three-birds-one-stone" solution that comprehensively enhances the throughput, tail latency, and space usage of KV separated systems. AegonKV first proposes a SmartSSD-based GC offloading mechanism to enable asynchronous GC operations without competing with LSM read/write for bandwidth or CPU. AegonKV leverages offload-friendly data structures and hardware/ software execution logic to address the challenges of GC offloading. Experiments demonstrate that AegonKV achieves the largest throughput improvement of 1.28-3.3 times, a significant reduction of 37%-66% in tail latency, and 15%-85% in space overhead compared to existing KV separated systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Stealthy Backdoor Attack Towards Federated Automatic Speaker Verification

Stealthy Backdoor Attack Towards Federated Automatic Speaker...

引用

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

作者： Longling Zhang Lyqi Liu Dan Meng Jun Wang Shengshan Hu School of Cyber Science and Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security OPPO Research Institute China

Automatic speech verification (ASV) authenticates individuals based on distinct vocal patterns, playing a pivotal role in many applications such as voice-based unlocking systems for devices. The ASV system comprises three stages: training, registration, and validation. The model refines using voice data in training, extracts vocal features in registration, and contrasts these with speech patterns in validation. Modern ASV models, primarily grounded in DNN architectures, require extensive data for training. Federated learning (FL) fosters model-sharing across multiple clients while ensuring data privacy. Due to its open architecture, FL is vulnerable to backdoor attacks. However, training a stealthy backdoor attack in FL presents challenges, including diminished attack generalization owing to data heterogeneity, and conspicuous triggers that render them easily detectable. In this paper, we propose a Federated Stealthy Backdoor Attack method ($FedSBA$). FedSBA aims to improve the attack model’s generalization, enhance its persistence, and elude anomaly detection under the heterogeneous data distribution. FedSBA constructs an attack model based on a personalized transformer and encompasses a stealthy trigger. Moreover, we also propose a defensive strategy that utilizes an adaptive weight aggregation scheme. The stealthiness and effectiveness of FedSBA are demonstrated by exhibiting superior performance in comparison to previous works.

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Jin Zhao Yu Zhang Jian Cheng Yiyang Wu Chuyue Ye Hui Yu Zhiying Huang Hai Jin Xiaofei Liao Lin Gu Haikun Liu National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China and Zhejiang-HUST Joint Research Center for Graph Processing Zhejiang Lab Hangzhou China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798350323481

Temporal graph processing is used to handle the snapshots of the temporal graph, which concerns changes in graph over time. Although several software/hardware solutions have been designed for efficient temporal graph processing, they still suffer from serious irregular data access due to the uncoordinated graph traversal. To overcome these limitations, this paper proposes SaGraph, a domain-specific hardware accelerator to support the efficient processing of temporal graph. Specifically, temporal graph processing shows strong data access similarity, i.e., most graph accesses of the processing of different snapshots are the same and usually refer to a small fraction of vertices. SaGraph can dynamically coordinate the graph traversals and adaptively cache the vertex states to fully exploit the data access similarity for smaller data access overhead. We implemented and evaluated SaGraph on a Xilinx Alveo U280 FPGA card. Compared with the cutting-edge software and hardware solutions, SaGraph achieves 8.5×-157.3×, 4.2×-16.1× speedups and 34.7×-423.6×, 5.3×-14.7× energy savings, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Frontiers of Artificial Intelligent and Quantitative Management: Preface for ITQM 2024

引用

Procedia Computer Science 2024年 242卷 1-8页

作者： Filip, Florin Gheorghe Shi, Yong Pocatilu, Paul Ciurea, Cristian-Eugen Li, Jianping Tien, James M. Berg, Daniel Romanian Academy Information Science and Technology Section Bucharest Romania Research Centre on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States Bucharest University of Economic Studies Bucharest Romania College of Engineering University of Miami Coral GablesFL33124 United States

来源：评论

学校读者我要写书评

暂无评论

Sustainable Self-evolution Adversarial Training 24

Sustainable Self-evolution Adversarial Training

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Wang, Wenxuan Wang, Chenglei Qi, Huihui Ye, Menghao Qian, Xuelin Wang, Peng Zhang, Yanning School of Computer Science Northwestern Polytechnical University China Natl. Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Shaanxi Xi'an China School of Automation Northwestern Polytechnical University The BRain and Artificial INtelligence Lab Shaanxi Xi'an China

ISBN: (纸本)9798400706868

With the wide application of deep neural network models in various computer vision tasks, there has been a proliferation of adversarial example generation strategies aimed at deeply exploring model security. However, existing adversarial training defense models, which rely on single or limited types of attacks under a one-time learning process, struggle to adapt to the dynamic and evolving nature of attack methods. Therefore, to achieve defense performance improvements for models in long-term applications, we propose a novel Sustainable Self-Evolution Adversarial Training (SSEAT) framework. Specifically, we introduce a continual adversarial defense pipeline to realize learning from various kinds of adversarial examples across multiple stages. Additionally, to address the issue of model catastrophic forgetting caused by continual learning from ongoing novel attacks, we propose an adversarial data replay module to better select more diverse and key relearning data. Furthermore, we design a consistency regularization strategy to encourage current defense models to learn more from previously trained ones, guiding them to retain more past knowledge and maintain accuracy on clean samples. Extensive experiments have been conducted to verify the efficacy of the proposed SSEAT defense method, which demonstrates superior defense performance and classification accuracy compared to competitors. © 2024 ACM.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Ethereum smart contract security research:survey and future research opportunities

引用

Frontiers of Computer Science 2021年第2期15卷 143-160页

作者： Zeli WANG Hai JIN Weiqi DAI Kim-Kwang Raymond CHOO Deqing ZOU National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabHubei Engineering Research Center on Big Data SecurityWuhan430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan430074China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518057China Department of Information Systems and Cyber Security University of Texas at San AntonioSan AntonioTX78249-0631USA

Blockchain has recently emerged as a research trend,with potential applications in a broad range of industries and *** particular successful Blockchain technology is smart contract,which is widely used in commercial settings(e.g.,high value financial transactions).This,however,has security implications due to the potential to financially benefit from a security incident(e.g.,identification and exploitation of a vulnerability in the smart contract or its implementation).Among,Ethereum is the most active and ***,in this paper,we systematically review existing research efforts on Ethereum smart contract security,published between 2015 and ***,we focus on how smart contracts can be maliciously exploited and targeted,such as security issues of contract program model,vulnerabilities in the program and safety consideration introduced by program execution *** also identify potential research opportunities and future research agenda.

关键词： smart contract security blockchain vulnerability unreliable data

来源：评论

学校读者我要写书评

暂无评论

A Knowledge Graph Completion Model with Path-Specific Learning

A Knowledge Graph Completion Model with Path-Specific Learni...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Xiulin Zheng Zan Zhang Rui Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) and also with the School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Inspur Academy of Science and Technology Shandong China

ISBN: (数字)9798350377613

ISBN: (纸本)9798350377620

Knowledge graphs (KGs) play an increasingly im-portant role in many knowledge-aware tasks. However, existing KGs are struggle with incompleteness, which motivates Knowledge graph completion (KGC), that is, predicting the lost links between entities based on observed triples. Reasoning over relation paths in incomplete KGs is popular. Nonetheless, some significant issues are still remained to be addressed, such as path noise and ambiguity of inferred relation. To address these problems, we propose a novel path augmented _Reasoning model with avoidance of Path noise and Disambiguation of inferred relation in this paper, referred to as RPD. In this model, we calculate the sum of resource allocation for each relation path to measure its reliability to avoid the inference of path noise. To address the ambiguity of an inferred relation, we introduce position embedding to denote the relation position along the path when learning path representation. Extensive experiments conducted on benchmark datasets demonstrate the effectiveness of our proposal RPD model in the handling of KGC tasks compared to SOTAs.

关键词： Heavily-tailed distribution Noise Knowledge graphs Benchmark testing Transformers Cognition Reliability Resource management Proposals Noise measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：