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

Reversible Data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

IEEE Internet of Things Journal 2025年

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： adaptive coding chinese remainder theorem for polynomials encrypted images Reversible data hiding secret sharing

来源：评论

学校读者我要写书评

暂无评论

GIRP: Energy-Efficient QoS-Oriented Microservice Resource Provisioning via Multi-Objective Multi-Task Reinforcement Learning

引用

IEEE Transactions on Mobile computing 2025年

作者： Yuan, Honggang Wang, Ting Fu, Min Shi, Yuanming East China Normal University MoE Engineering Research Center of Software/Hardware Co-design Technology and Application Shanghai Key Laboratory of Trustworthy Computing Shanghai200062 China National University of Singapore Department of Electrical and Computer Engineering 117583 Singapore ShanghaiTech University School of Information Science and Technology Shanghai201210 China

Microservice architecture has revolutionized web service development by facilitating loosely coupled and independently developable components distributed as containers or virtual machines. While existing studies emphasize end-to-end latency, this paper investigates energy-efficient quality-of-service (QoS)-oriented microservice provisioning, focusing on both QoS satisfaction and power consumption (PC) conservation. We propose the Green and Intelligent Resource Provision (GIRP) architecture, integrating a data-driven energy-latency-aware resource allocation and scheduling manager to balance latency and PC. To reconcile the trade-offs involved, a dual-objective optimization problem is formulated to minimize latency and energy use by selecting proper servers, allocating CPU cores, and determining service replicas. To address challenges with discrete variables, dual objectives, and implicit mappings, we leverage a model-free deep deterministic policy gradient-based reinforcement learning algorithm. Specifically, we develop a multi-task agent via the Multi-gate Mixture-of-Experts model to simultaneously make two separate actions regarding CPU core numbers and service replica numbers, followed by a single-task agent to determine service scheduling. Extensive experiments on the DeathStarBenchmark testbed validate GIRP's effectiveness, demonstrating approximately 52% resource savings and a 43% reduction in PC compared to leading methods like Sinan, Firm, and heuristic-based algorithms. These results highlight GIRP's capability to optimize microservice orchestration by balancing end-to-end latency and power efficiency. © 2025 IEEE. All rights reserved.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Efficient Hybrid Multi-Population Genetic Algorithm for Multi-UAV Task Assignment in Consumer Electronics Applications

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Bai, Xiaoshan Jiang, Haoyu Li, Chao Ullah, Inam Dabel, Maryam M. Al Bashir, Ali Kashif Wu, Zongze Sam, Shuzhi Shenzhen University College of Mechatronics and Control Engineering National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China Shenzhen University Shenzhen City Joint Laboratory of Autonomous Unmanned Systems and Intelligent Manipulation Shenzhen518060 China Tashkent State University of Economics Department of Artificial Intelligence Tashkent100066 Uzbekistan University of Hafr Al Batin Department of Computer Science and Engineering College of Computer Science and Engineering Saudi Arabia Manchester Metropolitan University Manchester United Kingdom Shenzhen518060 China National University of Singapore Department of Electrical and Computer Engineering Singapore117576 Singapore

In recent years, as people’s living standards have improved and consumption concepts have been transformed, the demand for purchasing consumer electronics online has continued to grow, further stimulating the development of the logistics industry. Consequently, how to deliver consumer electronics to households at minimal cost has become a crucial factor that limits the development of the consumer technology industry. To tackle this problem, this paper studies the task assignment problem for multiple initially dispersed UAVs to deliver products to target locations while minimizing their total operation time. Each UAV can continuously provide delivery services to multiple target locations within its limited loading capacity and operation time. To solve this problem, we propose several hybrid multipopulation genetic algorithms. First, a novel crossover operator for the genetic algorithms is designed, through which a single parent chromosome can generate offspring individually. Second, two mutation mechanisms are performed to increase gene diversity. Third, multiple local search strategies are employed to enhance the populations’ fitness during each iteration of evolution. An improved 2-opt local search strategy is applied to optimize individual chromosomes when their similarity with the current best chromosome falls below a prescribed threshold. Alternatively, local search strategies are utilized for 1-opt, 2h-opt and interchange processes. Combining local search strategies, genetic operators, and the multi-population mechanism leads to several hybrid multi-population genetic algorithms. Numerical simulations and experimental tests demonstrate that the hybrid multi-population genetic algorithm, integrated with the improved 2-opt and 1-opt local search strategies, exhibits superior performance among the designed hybrid genetic algorithms, the minimum marginal cost algorithm (MMA), and the existing popular Co-evolutionary Multi-population Genetic Algorithm (CMGA). In exp

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

computing time-DELAY AND ITS EFFECTS ON real-time CONTROL-SYSTEMS

引用

IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY 1995年第2期3卷 218-224页

作者： SHIN, KG CUI, XZ Real-Time Computing Laboratory Division of Comuuter Science and Engineering. Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

The reliability of a real-time digital control computer depends not only on the reliability of the hardware and software used, but also on the time delay in computing the control output, because of the negative effects of computing time delay on control system performance. For a given fixed sampling interval, the effects of computing time delay are classified into the delay and loss problems, The delay problem, occurs when the computing time delay is nonzero but smaller than the sampling interval, while the loss problem occurs when the computing time delay is greater than, or equal to, the sampling interval, i,e., loss of the control output, These two problems are analyzed as a means of evaluating real-time control systems, First, a generic analysis of the effects of computing time delay is presented along with necessary conditions for system stability, Then, we present both qualitative and quantitative analyses of the computing time delay effects on a robot control system, deriving upper bounds of the computing time delay with respect to system stability and system performance.

关键词： Delay effects real time systems Control systems Sampling methods System performance Stability analysis Digital control Hardware Software performance Performance analysis

来源：评论

学校读者我要写书评

暂无评论

computing Power in the Sky: Digital Twin-assisted Collaborative computing with Multi-UAV Networks

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Wang, Chao Han, Yu Zhang, Long Jia, Ziye Zhang, Hongliang Hong, Choong Seon Han, Zhu Hebei University of Engineering School of Information and Electrical Engineering Handan056038 China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China Nanjing University of Aeronautics and Astronautics College of Electronic and Information Engineering Nanjing211106 China Southeast University National Mobile Communications Research Laboratory Jiangsu Nanjing211111 China Peking University State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Beijing100871 China Kyung Hee University Department of Computer Science and Engineering Gyeonggi-do Yongin-si17104 Korea Republic of University of Houston Department of Electrical and Computer Engineering HoustonTX77004 United States Kyung Hee University Department of Computer Science and Engineering Seoul446-701 Korea Republic of

The collaboration of computing powers (CPs) among unmanned aerial vehicles (UAVs)-mounted edge servers is essential to handle data-intensive tasks of user equipments (UEs). This paper presents a multi-UAV computing power network (CPN) that orchestrates the CP resources of edge servers to cooperatively process tasks through collaborative computing. Due to the frequent interactions among edge servers and the increased complexities for large-scale task executions, we propose a digital twin (DT)-driven multi-UAV CPN framework, where the aerial DT network is created as a digital replica of the multi-UAV network to assist collaborative computing. A joint optimization problem of the service association, offloading power control, task partitions, CP allocation, and UAV trajectory design is formulated to minimize the long-term average delay of UEs. We use the Lyapunov technique to tackle the long-term energy constraint, forming a tractable optimization problem, which is modeled as a Markov decision process to balance the UAV's deficit queue stability and the UE's task completion delay. A hybrid soft actor-critic based deep reinforcement learning algorithm is developed to optimize the joint design by sampling the hybrid action from the Gumbel and Gaussian distributions. Simulation results verify that the multi-UAV CPN contributes to significant performance gains when supported by DTs. © 2025 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

PROBING AND FAULT INJECTION OF DEPENDABLE DISTRIBUTED PROTOCOLS

引用

computer JOURNAL 1995年第4期38卷 286-300页

作者： DAWSON, S JAHANIAN, F Real-Time Computing Laboratory Electrical Engineering and Computer Science Department University of Michigan Ann Arbor MI 48109-2122 United States

Ensuring that a distributed system with strict dependability constraints meets its prescribed specification is a growing challenge that confronts software developers and system engineers. This paper presents a technique for probing and fault injection of fault-tolerant distributed protocols. The proposed technique, called script-driven probing and fault injection, can be used for studying the behaviour of distributed systems and for detecting design and implementation errors of fault-tolerant protocols. The focus of this work is on fault injection techniques that can be used to demonstrate three aspects of a target protocol: detection of design or implementation errors;identification of violations of protocol specifications;and insight into design decisions made by the implementers. The emphasis of our approach is on experimental techniques intended to identify specific ''problems'' in a protocol or its implementation rather than the evaluation of system dependability through statistical metrics such as fault coverage. To demonstrate the capabilities of this technique, the paper describes a probing and fault injection toot, called the PFI tool (probe/fault injection tool), and a summary of several extensive experiments that studied the behaviour of two protocols: the Transmission Control Protocol (TCP) and a group membership protocol (GMP).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Provably Secure and Efficient One-to-Many Authentication and Key Agreement Protocol for Resource-Asymmetric Smart Environments

引用

IEEE Internet of Things Journal 2025年

作者： Li, Long Hsu, Chingfang Cui, Jianqun Au, Man Ho Harn, Lein Li, Quanrun Central China Normal University Computer School Wuhan430079 China Central China Normal University Hubei Provincial Key Laboratory of Artificial Intelligence and Smart Learning Wuhan430079 China Department of Computing Hong Kong Polytechnic University 25809 Hong Kong University of Missouri-Kansas City Department of Computer Science Electrical Engineering MO64110 United States Zhejiang Sci-Tech University School of Cyber Science and Engineering Hangzhou310020 China

The smart environment is a crucial application of the Internet of Things(IoT). Due to its growing security and efficiency needs, recent years have seen the proposal of numerous authentication and key agreement (AKA) protocols. Unfortunately, most of existing AKA protocols only support one-to-one AKA and rely on the elliptic curve cryptosystem, resulting in huge overhead. In addition, these protocols fail to consider the resource-asymmetric characteristics of this scenario. That is, the resources on the gateway side are abundant, while the resources on user sides and device sides are limited. In order to achieve efficient and secure one-to-many AKA establishment in this scenario, where one-to-many means that users can realize key agreements with multiple smart devices at the same time. For the first time, this paper uses the one-to-many computing structure of the Chinese Remainder Theorem (CRT) to design an efficient one-to-many AKA establishment, which is perfectly adapted to resource-asymmetric allocation in smart environments. Compared with existing solutions, this solution has the following advantages. Firstly, our protocol is suitable for resource-asymmetric environments, where the gateway acts as an intermediate node and uses rich resources to integrate multiple AKA requests. Secondly, the solution supports users to negotiate session keys with multiple smart devices at the same time. Thirdly, we prove the protocol’s security under the real-or-Random (ROR) model. In addition, we perform formal security verification of the protocol using the Automated Validation of Internet Security Protocols and Applications(AVISPA) tool. Finally, the security and efficiency of this solution are superior to similar solutions. Specifically, our solution can meet 18 security and functionality requirements. Compared with the latest similar scheme, assuming that the number of smart devices is 10, our scheme reduces the computational cost by 75.75%. At the same time, in terms of comm

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Joint Design of Radar Receive Filter and Unimodular ISAC Waveform with Sidelobe Level Control

arXiv

引用

arXiv 2025年

作者： Zhang, Kecheng Liu, Ya-Feng Wang, Zhongbin Yuan, Weijie Keskin, Musa Furkan Wymeersch, Henk Xia, Shuqiang School of System Design and Intelligent Manufacturing The Shenzhen Key Laboratory of Robotics and Computer Vision Southern University of Science and Technology Shenzhen518055 China State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Electrical Engineering Chalmers University of Technology Gothenburg41296 Sweden ZTE Corporation The State Key Laboratory of Mobile Network and Mobile Multimedia Technology Shenzhen518055 China

Integrated sensing and communication (ISAC) has been considered a key feature of next-generation wireless networks. This paper investigates the joint design of the radar receive filter and dual-functional transmit waveform for the multiple-input multiple-output (MIMO) ISAC system. While optimizing the mean square error (MSE) of the radar receive spatial response and maximizing the achievable rate at the communication receiver, besides the constraints of full-power radar receiving filter and unimodular transmit sequence, we control the maximum range sidelobe level, which is often overlooked in existing ISAC waveform design literature, for better radar imaging performance. To solve the formulated optimization problem with convex and nonconvex constraints, we propose an inexact augmented Lagrangian method (ALM) algorithm. For each subproblem in the proposed inexact ALM algorithm, we custom-design a block successive upper-bound minimization (BSUM) scheme with closed-form solutions for all blocks of variable to enhance the computational efficiency. Convergence analysis shows that the proposed algorithm is guaranteed to provide a stationary and feasible solution. Extensive simulations are performed to investigate the impact of different system parameters on communication and radar imaging performance. Comparison with the existing works shows the superiority of the proposed algorithm. © 2025, CC BY-NC-SA.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

A transactional-behavior-based hierarchical gated network for credit card fraud detection

引用

IEEE/CAA Journal of Automatica Sinica 2025年

作者： Xie, Yu Zhou, MengChu Liu, Guanjun Wei, Lifei Zhu, Honghao De Meo, Pasquale College of Information Engineering Shanghai Maritime University Shanghai201306 China School of Information and Electronic Engineering Zhejiang Gongshang University Hangzhou310018 China Helen and John C. Hartmann Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science Tongji University Shanghai201804 China College of Computer Science and Information Engineering Bengbu University Bengbu233030 China Department of Ancient and Modern Civilizations University of Messina Messina98166 Italy

The task of detecting fraud in credit card transactions is crucial to ensure the security and stability of a financial system, as well as to enforce customer confidence in digital payment systems. Historically, credit card companies have used rule-based approaches to detect fraudulent transactions, but these have proven inadequate due to the complexity of fraud strategies and have been replaced by much more powerful solutions based on machine learning or deep learning algorithms. Despite significant progress, the current approaches to fraud detection suffer from a number of limitations: for example, it is unclear whether some transaction features are more effective than others in discriminating fraudulent transactions, and they often neglect possible correlations among transactions, even though they could reveal illicit behaviour. In this paper, we propose a novel credit card fraud detection (CCFD) method based on a transaction behaviour-based hierarchical gated network. First, we introduce a feature-oriented extraction module capable of identifying key features from original transactions, and such analysis is effective in revealing the behavioural characteristics of fraudsters. Second, we design a transaction-oriented extraction module capable of capturing the correlation between users' historical and current transactional behaviour. Such information is crucial for revealing users' sequential behaviour patterns. Our approach, called transactional-behaviour-based hierarchical gated network model (TbHGN), extracts two types of new transactional features, which are then combined in a feature interaction module to learn the final transactional representations used for CCFD. We have conducted extensive experiments on a real-world credit card transaction dataset with an increase in average F1 between 1.42% and 6.53% and an improvement in average AUC between 0.63% and 2.78% over the state of the art. © 2025 Institute of electrical and Electronics Engineers Inc.. All right

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

SMRP: Fast restoration of multicast sessions from persistent failures

SMRP: Fast restoration of multicast sessions from persistent...

引用

2005 International Conference on Dependable Systems and Networks

作者： Wu, Jian Shin, Kang G. Real-Time Computing Laboratory Department of Electrical Engineering and Computer Science University of Michigan

The growing reliance of networked applications on timely and reliable data transfer requires the underlying networking infrastructure to provide adequate services even in the presence of "persistent" failures (e.g., broken links/routers). It is much more difficult to meet this requirement for multicast sessions than for unicast communications because any on-tree component failure may often cause simultaneous service disruptions to multiple receivers. This paper presents a new multicast routing protocol, called the Survivable Multicast Routing Protocol (SMRP), which facilitates fast recovery of multicast sessions in face of persistent failures via local detour paths. Our evaluation results show that SMRP trades end-to-end delay and resource usage for short, and hence fast, recovery paths. For example, under a certain set of parameter values, SMRP shortens the recovery path by 20% with only a 5% increase of end-to-end delay and resource usage. Moreover, several design enhancements have made SMRP efficient, robust, flexible and scalable. © 2005 IEEE.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：