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

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

来源：评论

学校读者我要写书评

暂无评论

Jointly Optimizing Terahertz based Sensing and Communications in Vehicular Networks: A Dynamic Graph Neural Network Approach

arXiv

引用

arXiv 2024年

作者： Li, Xuefei Chen, Mingzhe Hu, Ye Zhang, Zhilong Liu, Danpu Mao, Shiwen The Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing100876 China The Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Department of Industrial and Systems Engineering University of Miami Coral GablesFL33146 United States The Department of Electrical and Computer Engineering Auburn University AuburnAL36849 United States

In this paper, the problem of vehicle service mode selection (sensing, communication, or both) and vehicle connections within terahertz (THz) enabled joint sensing and communications over vehicular networks is studied. The considered network consists of several service provider vehicles (SPVs) that can provide: 1) only sensing service, 2) only communication service, and 3) both services, sensing service request vehicles, and communication service request vehicles. Based on the vehicle network topology and their service accessibility, SPVs strategically select service request vehicles to provide sensing, communication, or both services. This problem is formulated as an optimization problem, aiming to maximize the number of successfully served vehicles by jointly determining the service mode of each SPV and its associated vehicles. To solve this problem, we propose a dynamic graph neural network (GNN) model that selects appropriate graph information aggregation functions according to the vehicle network topology, thus extracting more vehicle network information compared to traditional static GNNs that use fixed aggregation functions for different vehicle network topologies. Using the extracted vehicle network information, the service mode of each SPV and its served service request vehicles will be determined. Simulation results show that the proposed dynamic GNN based method can improve the number of successfully served vehicles by up to 17% and 28% compared to a GNN based algorithm with a fixed neural network model and a conventional optimization algorithm without using GNNs. Copyright © 2024, The Authors. All rights reserved.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Compartment-specific estimation of T2 and T2* with diffusion-PEPTIDE MRI

arXiv

引用

arXiv 2024年

作者： Gong, Ting Fair, Merlin J. Setsompop, Kawin Zhang, Hui Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom Radiological Sciences Laboratory Department of Radiology Stanford University StanfordCA United States Department of Electrical Engineering Stanford University StanfordCA United States

We present a microstructure imaging technique for estimating compartment-specific T2 and T2* simultaneously in the human brain. Microstructure imaging with diffusion MRI (dMRI) has enabled the modelling of intra-neurite and extra-neurite diffusion signals separately allowing for the estimation of compartment-specific tissue properties. These compartment-specific properties have been widely used in clinical studies. However, conventional dMRI cannot disentangle differences in relaxations between tissue compartments, causing biased estimates of diffusion measures which also change with TE. To solve the problem, combined relaxometry-diffusion imaging methods have been developed in recent years, providing compartmental T2-diffusion or T2*-diffusion imaging respectively, but not T2 and T2* together. As they provide complementary information, a technique that can estimate both jointly with diffusion is appealing to neuroimaging studies. The aim of this work is to develop a method to map compartmental T2-T2*-diffusion simultaneously. Using an advanced MRI acquisition called diffusion-PEPTIDE, a novel microstructure model is proposed and a multi-step fitting method is developed to estimate parameters of interest. We demonstrate for the first time that compartmental T2, T2* can be estimated simultaneously from in vivo data. we further show the accuracy and precision of parameter estimation with simulation. Copyright © 2024, The Authors. All rights reserved.

关键词： Tissue

来源：评论

学校读者我要写书评

暂无评论

AgileWatts: An Energy-Efficient CPU Core Idle-State Architecture for Latency-Sensitive Server Applications 22

AgileWatts: An Energy-Efficient CPU Core Idle-State Architec...

引用

Proceedings of the 55th Annual IEEE/ACM International Symposium on Microarchitecture

作者： Jawad Haj Yahya Haris Volos Davide B. Bartolini Georgia Antoniou Jeremie S. Kim Zhe Wang Kleovoulos Kalaitzidis Tom Rollet Zhirui Chen Ye Geng Onur Mutlu Yiannakis Sazeides Rivos Inc Mountain View California United States Computer Architecture Laboratory Department of Computer Science University of Cyprus Computing Systems Lab Huawei Zurich Research Center Department of Information Technology and Electrical Engineering ETH Zurich Switzerland

ISBN: (纸本)9781665462723

User-facing applications running in modern datacenters exhibit irregular request patterns and are implemented using a multitude of services with tight latency requirements (30--250μs). These characteristics render existing energy-conserving techniques ineffective when processors are idle due to the long transition time (order of 100μs) from a deep CPU core idle power state (C-state). While prior works propose management techniques to mitigate this inefficiency, we tackle it at its root with AgileWatts (AW): a new deep CPU core C-state architecture optimized for datacenter server processors targeting latency-sensitive *** drastically reduces the transition latency from deep CPU core idle power states while retaining most of their power savings based on three key ideas. First, AW eliminates the latency (several microseconds) of saving/restoring the core context when powering-off/-on the core in a deep idle state by i) implementing medium-grained power-gates, carefully distributed across the CPU core, and ii) retaining context in the power-ungated domain. Second, AW eliminates the flush latency (several tens of microseconds) of the L1/L2 caches when entering a deep idle state by keeping L1/L2 content power-ungated. A small control logic also remains ungated to serve cache coherence traffic. AW implements cache sleep-mode and leakage reduction for the power-ungated domain by lowering a core's voltage to the minimum operational level. Third, using a state-of-the-art power efficient all-digital phase-locked loop (ADPLL) clock generator, AW keeps the PLL active and locked during the idle state, cutting microseconds of wake-up latency at negligible power *** evaluation with an accurate industrial-grade simulator calibrated against an Intel Skylake server shows that AW reduces the energy consumption of Memcached by up to 71% (35% on average) with <1% end-to-end performance degradation. We observe similar trends for other evaluated services (MySQL and Kafka).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-User Probabilistic Semantic Communication with Semantic Compression Ratio Optimization

Multi-User Probabilistic Semantic Communication with Semanti...

引用

IEEE International Conference on Communications Workshops, ICC

作者： Zhouxiang Zhao Zhaohui Yang Mingzhe Chen Changsheng You Qianqian Yang Wei Xu Zhaoyang Zhang College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral Gables FL USA Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China National Mobile Communications Research Laboratory Southeast University Nanjing China

ISBN: (数字)9798350304053

ISBN: (纸本)9798350304060

In this paper, the problem of joint transmission and computation resource allocation for a multi-user probabilistic semantic communication (PSC) network is investigated. In the considered model, users employ semantic information extraction techniques to compress their large-sized raw data before transmitting them to a multi-antenna base station (BS). Our model represents the raw data through comprehensive knowledge graphs, utilizing shared probability graphs between users and the BS for efficient semantic compression. The resource allocation problem is formulated as an optimization problem with the objective of maximizing the sum of equivalent rate of all users, considering total power budget constraint. This joint optimization problem inherently addresses the delicate balance between transmission efficiency and computational complexity. To address this optimization challenge, we present an iterative algorithm in which the optimal solution for the semantic compression ratio of a specific user is determined at each iteration. Numerical results validate the effectiveness of the proposed scheme.

关键词： Conferences Computational modeling Semantics Knowledge graphs Probabilistic logic Information retrieval Data models

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Semantic Relay Aided Wireless Networks with Probability Graph

Resource Allocation for Semantic Relay Aided Wireless Networ...

引用

IEEE International Conference on Communications (ICC)

作者： Jiahui Zhao Ming Chen Zhaohui Yang Changsheng You Mingzhe Chen National Mobile Communications Research Laboratory Southeast University Nanjing China College of Information Science and Electronic Engineering Zhejiang University Hangzhou China Zhejiang Provincial Key Laboratory of Info. Proc. Commun. & Netw. (IPCAN) Hangzhou China Department of Electronic and Electrical Engineering Southern University of Science and Technology Shenzhen China Department of Electrical and Computer Engineering and Institute for Data Science and Computing University of Miami Coral Gables FL USA

ISBN: (数字)9781728190549

ISBN: (纸本)9781728190556

In this paper, we introduce a novel uplink semantic relay (SemRelay)-aided wireless communication system, catering to multiple users by leveraging a shared probability graph between the SemRelay and the base station (BS). In this system, users transmit text information to the SemRelay through conventional bit transmission, and the SemRelay compresses this information using a knowledge based characterized by probability graph before transmitting it to the BS through semantic communication. Then, the BS recovers the information based on the shared probability graph. While the semantic information compression incurs computational resource consumption, it significantly reduces communication resource usage. This paper addresses the challenge of minimizing overall system latency through jointly optimizing communication and computation re-source allocation, considering limited wireless resources and the system's energy budget. To address this problem, we introduce an efficient iterative algorithm, which employs block coordinate descent for communication resource allocation and exhaustive searching for determining the optimal data compression scheme. In particular, both power allocation subproblem and bandwidth allocation subproblem are proved to be convex. The complexity analysis of the proposed algorithm are also provided. Numerical results validate the effectiveness of the proposed algorithm and the superior performance of semantic communication compared to the conventional bit transmission.

关键词： Wireless networks Semantics Knowledge based systems Data compression Search problems Complexity theory Resource management

来源：评论

学校读者我要写书评

暂无评论

Quality Assessment of Screen Content Videos

Quality Assessment of Screen Content Videos

引用

International Conference on Pattern Recognition and Image Analysis (IPRIA)

作者： Hossein Motamednia Pooryaa Cheraaqee Azadeh Mansouri Ahmad Mahmoudi-Aznaveh Department of Electrical and Computer Engineering Faculty of Engineering Kharazmi University Tehran Iran High Performance Computing Laboratory School of Computer Science Institute for Research in Fundamental Sciences Tehran Iran Cyber Research Institute Shahid Beheshti University Tehran Iran

Perceptual quality assessment has always been challenging due to the difficulty in modeling the no-linear human visual system. With the diversity in the contents of multimedia signals, the conventional methods for traditional media seems no longer satisfying. One of these emerging media, is the screen content images/videos (SCINs), Containing texts and computer generated graphics, SCVs cannot be sufficiently expressed with features designed for natural sceneries. Therefore, new researches tried to devise objective quality assessment metrics, specificly for screen contents. Recently, a dataset was proposed for quality assessment of screen content videos. Since screen contents are full of structures that spread in cardinal directions, we were motivated to employ the horizontal and vertical subbands of the wavelet transform to characterize these types of visual contents. The features were incorporated in a full-reference method that showed promising results on the publicly available dataset for SCV quality assessment. The method can bo accessed via: https://***/motamedNia/QASCV.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GaRField++: Reinforced Gaussian Radiance Fields for Large-Scale 3D Scene Reconstruction

arXiv

引用

arXiv 2024年

作者： Zhang, Hanyue Yang, Zhiliu Zuo, Xinhe Tong, Yuxin Long, Ying Liu, Chen School of Information Science and Engineering Yunnan University Yunnan Kunming650500 China Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan University Yunnan Kunming650500 China Department of Electrical and Computer Engineering Clarkson University PotsdamNY13699 United States

This paper proposes a novel framework for large-scale scene reconstruction based on 3D Gaussian splatting (3DGS) and aims to address the scalability and accuracy challenges faced by existing methods. For tackling the scalability issue, we split the large scene into multiple cells, and the candidate point-cloud and camera views of each cell are correlated through a visibility-based camera selection and a progressive point-cloud extension. To reinforce the rendering quality, three highlighted improvements are made in comparison with vanilla 3DGS, which are a strategy of the ray-Gaussian intersection and the novel Gaussians density control for learning efficiency, an appearance decoupling module based on ConvKAN network to solve uneven lighting conditions in large-scale scenes, and a refined final loss with the color loss, the depth distortion loss, and the normal consistency loss. Finally, the seamless stitching procedure is executed to merge the individual Gaussian radiance field for novel view synthesis across different cells. Evaluation of Mill19, Urban3D, and MatrixCity datasets shows that our method consistently generates more high-fidelity rendering results than state-of-the-art methods of large-scale scene reconstruction. We further validate the generalizability of the proposed approach by rendering on self-collected video clips recorded by a commercial drone. © 2024, CC BY.

关键词： 3D reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：