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

PDC-ViT: source camera identification using pixel difference convolution and vision transformer

Neural Computing and Applications 2025年第9期37卷 6933-6949页

作者： Elharrouss, Omar Akbari, Younes Almadeed, Noor Al-Maadeed, Somaya Khelifi, Fouad Bouridane, Ahmed Department of Computer Science and Software Engineering United Arab Emirates University Al Ain United Arab Emirates Department of Computer Science and Engineering Qatar University Doha Qatar Northumbria University Newcastle Newcastle upon Tyne United Kingdom University of Sharjah Sharjah United Arab Emirates

Source camera identification has emerged as a vital solution to unlock incidents involving critical cases like terrorism, violence, and other criminal activities. The ability to trace the origin of an image/video can aid law enforcement agencies in gathering evidence and constructing the timeline of events. Moreover, identifying the owner of a certain device narrows down the area of search in a criminal investigation where smartphone devices are involved. This paper proposes a new pixel-based method for source camera identification, integrating Pixel Difference Convolution (PDC) with a Vision Transformer network (ViT), and named PDC-ViT. While the PDC acts as the backbone for feature extraction by exploiting Angular PDC (APDC) and Radial PDC (RPDC). These techniques enhance the capability to capture subtle variations in pixel information, which are crucial for distinguishing between different source cameras. The second part of the methodology focuses on classification, which is based on a Vision Transformer network. Unlike traditional methods that utilize image patches directly for training the classification network, the proposed approach uniquely inputs PDC features into the Vision Transformer network. To demonstrate the effectiveness of the PDC-ViT approach, it has been assessed on five different datasets, which include various image contents and video scenes. The method has also been compared with state-of-the-art source camera identification methods. Experimental results demonstrate the effectiveness and superiority of the proposed system in terms of accuracy and robustness when compared to its competitors. For example, our proposed PDC-ViT has achieved an accuracy of 94.30%, 84%, 94.22% and 92.29% using the Vision dataset, Daxing dataset, Socrates dataset and QUFVD dataset, respectively. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Two-Timescale Hierarchical Contract for Joint Computation Offloading and Energy Management in Edge Computing System

引用

IEEE Transactions on Network science and engineering 2025年第3期12卷 1745-1760页

作者： Yan, Min Wang, Li Xu, Lianming Hou, Luyang Han, Zhu Beijing University of Posts and Telecommunications School of Computer Science National Pilot Software Engineering School Beijing100876 China Beijing University of Posts and Telecommunications School of Electronic Engineering Beijing100876 China 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

To mitigate the rising energy costs in edge computing, edge servers (ESs) can receive revenues from reducing their energy usage by contracting with virtual power plant (VPP). ESs also respond to user equipment (UE) by providing computation offloading services. However, such two-layer coordinated trading of computation offloading and energy management in a VPP-ES-UE architecture should address the information asymmetry issue and uncertain task arrivals, posing challenges to maximizing the stakeholders' utility. In this paper, we formulate the two-layer coordinated trading as a hierarchical contracting problem, which addresses the information asymmetry using two contract models. We design a VPP-ES energy contract on a large timescale and an ES-UE computation contract on a small timescale, where ESs need to coordinate the future task arrivals under the energy reduction target assigned by VPP. We construct a two-timescale virtual queue to achieve the energy reduction goal by the long-term queue stability constraint and employ Lyapunov optimization to transform the original problem into an online optimization problem without requiring future information. An online two-timescale hierarchical contract optimization algorithm is proposed to solve the transformed problem. The simulation results demonstrate that our method achieves higher social welfare compared to other benchmarks. © 2013 IEEE.

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Reliable Task Offloading for 6G-Based IoT Applications

引用

computers, Materials & Continua 2025年第2期82卷 2255-2274页

作者： Usman Mahmood Malik Muhammad Awais Javed Ahmad Naseem Alvi Mohammed Alkhathami Department of Computer Software Engineering National University of Science and Technology(NUST)Islamabad44000Pakistan Department of Electrical and Computer Engineering COMSATS University IslamabadIslamabad45550Pakistan Information Systems Department College of Computer and Information SciencesImam Mohammad Ibn Saud Islamic University(IMSIU)Riyadh11432Saudi Arabia

Fog computing is a key enabling technology of 6G systems as it provides quick and reliable computing,and data storage services which are required for several 6G *** Intelligence(AI)algorithms will be an integral part of 6G systems and efficient task offloading techniques using fog computing will improve their performance and *** this paper,the focus is on the scenario of Partial Offloading of a Task to Multiple Helpers(POMH)in which larger tasks are divided into smaller subtasks and processed in parallel,hence expediting task ***,using POMH presents challenges such as breaking tasks into subtasks and scaling these subtasks based on many interdependent factors to ensure that all subtasks of a task finish simultaneously,preventing resource ***,applying matching theory to POMH scenarios results in dynamic preference profiles of helping devices due to changing subtask sizes,resulting in a difficult-to-solve,externalities *** paper introduces a novel many-to-one matching-based algorithm,designed to address the externalities problem and optimize resource allocation within POMH ***,we propose a new time-efficient preference profiling technique that further enhances time optimization in POMH *** performance of the proposed technique is thoroughly evaluated in comparison to alternate baseline schemes,revealing many advantages of the proposed *** simulation findings indisputably show that the proposed matching-based offloading technique outperforms existing methodologies in the literature,yielding a remarkable 52 reduction in task latency,particularly under high workloads.

关键词： 6G IoT task offloading fog computing

来源：评论

学校读者我要写书评

暂无评论

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1360-1372页

作者： Wang, Shuyue Liu, Zhunga Zhang, Zuowei Bennamoun, Mohammed Northwestern Polytechnical University School of Automation Shaanxi Xi’an710072 China The University of Western Australia Department of Computer Science and Software Engineering PerthWA6009 Australia

Multimodal domain adaptation (MMDA) aims to transfer knowledge across different domains that contain multimodal data. Current methods typically assume that both the source and target domains have paired multimodal data with the same modalities, allowing for direct knowledge transfer between corresponding types of data. However, in certain applications, the source domain benefits from advanced sensors and equipment, capturing more modalities than those available in the target domain. As a result, the information from the source modalities may not strongly align with that of the target modalities. This weak correlation hinders the effective utilization of all source data for the target domain. To address this challenge, we propose a weakly correlated multimodal domain adaptation (WCMMDA) method for pattern classification. WCMMDA is designed to acquire the modality-independent and category-related knowledge from the source domain, enabling the full utilization of available source modalities for effective knowledge transfer. Specifically, modality-invariant features are first extracted from the multimodal data to bridge the heterogeneity gap within each domain. Subsequently, domain-invariant features are further learned from these modality-invariant features to align the feature distributions across the source and target domains. A source-specific classifier is employed here, which predicts pseudo-labels for the target data and enables the feature extractor to explore category-related information in source features. Finally, a target-specific classifier is trained using the pseudolabeled target data, where highly reliable pseudolabels are selected based on confidence to improve classification performance. Extensive experiments are performed on the real-world multimodal datasets to demonstrate the superiority of WCMMDA. © 2020 IEEE.

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

Gloss-driven Conditional Diffusion Models for Sign Language Production

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2025年第4期21卷 1-17页

作者： Tang, Shengeng Xue, Feng Wu, Jingjing Wang, Shuo Hong, Richang School of Computer Science and Information Engineering Hefei University of Technology Hefei China School of Software Hefei University of Technology Hefei China School of Data Science School of Information Science and Technology University of Science and Technology of China Hefei China

Sign Language Production (SLP) aims to convert text or audio sentences into sign language videos corresponding to their semantics, which is challenging due to the diversity and complexity of sign languages, and cross-modal semantic mapping issues. In this work, we propose a Gloss-driven Conditional Diffusion Model (GCDM) for SLP. The core of the GCDM is a diffusion model architecture, in which the sign gloss sequence is encoded by a Transformer-based encoder and input into the diffusion model as a semantic prior condition. In the process of sign pose generation, the textual semantic priors carried in the encoded gloss features are integrated into the embedded Gaussian noise via cross-attention. Subsequently, the model converts the fused features into sign language pose sequences through T-round denoising steps. During the training process, the model uses the ground-truth labels of sign poses as the starting point, generates Gaussian noise through T rounds of noise, and then performs T rounds of denoising to approximate the real sign language gestures. The entire process is constrained by the MAE loss function to ensure that the generated sign language gestures are as close as possible to the real labels. In the inference phase, the model directly randomly samples a set of Gaussian noise, generates multiple sign language gesture sequence hypotheses under the guidance of the gloss sequence, and outputs a high-confidence sign language gesture video by averaging multiple hypotheses. Experimental results on the Phoenix2014T dataset show that the proposed GCDM method achieves competitiveness in both quantitative performance and qualitative visualization. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Forming

来源：评论

学校读者我要写书评

暂无评论

Zero Trust Networks: Evolution and Application from Concept to Practice

引用

computers, Materials & Continua 2025年第2期82卷 1593-1613页

作者： Yongjun Ren Zhiming Wang Pradip Kumar Sharma Fayez Alqahtani Amr Tolba Jin Wang School of Computer Science School of Cyber Science and EngineeringEngineering Research Center of Digital ForensicsMinistry of EducationNanjing University of Information Science and TechnologyNanjing210044China Department of Computing Science University of AberdeenAberdeenAB243FXUK Software Engineering Department College of Computer and Information SciencesKing Saud UniversityRiyadh12372Saudi Arabia Computer Science Department Community CollegeKing Saud UniversityRiyadh11437Saudi Arabia Sanya Institute of Hunan University of Science and Technology Sanya572024China

In the context of an increasingly severe cybersecurity landscape and the growing complexity of offensive and defen-sive techniques,Zero Trust Networks(ZTN)have emerged as a widely recognized *** Trust not only addresses the shortcomings of traditional perimeter security models but also consistently follows the fundamental principle of“never trust,always verify.”Initially proposed by John Cortez in 2010 and subsequently promoted by Google,the Zero Trust model has become a key approach to addressing the ever-growing security threats in complex network *** paper systematically compares the current mainstream cybersecurity models,thoroughly explores the advantages and limitations of the Zero Trust model,and provides an in-depth review of its components and key ***,it analyzes the latest research achievements in the application of Zero Trust technology across various fields,including network security,6G networks,the Internet of Things(IoT),and cloud computing,in the context of specific use *** paper also discusses the innovative contributions of the Zero Trust model in these fields,the challenges it faces,and proposes corresponding solutions and future research directions.

关键词： Zero trust cybersecurity software-defined perimeter micro-segmentation internet of things

来源：评论

学校读者我要写书评

暂无评论

Cardinality estimation for property graph queries with gated learning approach on the graph database

引用

Multimedia Tools and Applications 2025年第11期84卷 9159-9183页

作者： He, Zhenzhen Yu, Jiong Du, Xusheng Guo, Binglei Li, Ziyang Li, Zhe School of Information Science and Engineering Xinjiang University Urumqi China School of Computer Engineering Hubei University of Arts and Science Xiangyang China School of Software Xinjiang University Urumqi China Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong

With the increasing complexity of graph query processing tasks, it is difficult for users to obtain the accurate cardinality before or during the execution of query tasks. Accurate estimate query cardinality is crucial for property graph data model, which usually involves entities, multiple joins, and various types of properties (key-value pairs). While learning-based approaches have been used in query optimization, estimating the cardinality of property graph queries is still particularly challenging. In this paper, we first formally represent each property graph query and then divide the estimation process into three phases: query execution, training data generation, and model training. Secondly, we construct a data pool to deal the updating query workloads in the training data generation phase. Thirdly, we utilize the gate mechanism to develop a cardinality estimation framework based on deep learning neural networks for property graph queries in the Neo4j database, and we propose a hybrid loss function to optimize the training process. Finally, we adopt a method of pre-aggregating the underlying data to speed up query execution in the first phase. The result of the experiment on two real-world datasets shows that our optimized methods can effectively improve the estimation accuracy of the deep learning model, and our query estimator outperforms other deep learning models compared in terms of estimation accuracy. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Weakly Supervised Intracranial Hemorrhage Segmentation with YOLO and an Uncertainty Rectified Segment Anything Model 4th

Weakly Supervised Intracranial Hemorrhage Segmentation with...

引用

4th International Workshop on Imaging and Treatment Challenges, SWITCH 2024, and 6th International Challenge on Ischemic Stroke Lesion Segmentation Challenge, ISLES 2024, Held in Conjunction with Medical Image Computing and computer Assisted Intervention, MICCAI 2024

作者： Spiegler, Pascal Rasoulian, Amirhossein Xiao, Yiming Department of Computer Science and Software Engineering Concordia University Montreal Canada NeuroRx Research Montreal Canada

ISBN: (纸本)9783031811005

Intracranial hemorrhage (ICH) is a life-threatening condition that requires rapid and accurate diagnosis to improve treatment outcomes and patient survival rates. Recent advancements in supervised deep learning have greatly improved the analysis of medical images, but often rely on extensive datasets with high-quality annotations, which are costly, time-consuming, and require medical expertise to prepare. To mitigate the need for large amounts of expert-prepared segmentation data, we have developed a novel weakly supervised ICH segmentation method that utilizes the YOLO object detection model and an uncertainty-rectified Segment Anything Model (SAM). In addition, we have proposed a novel point prompt generator for this model to further improve segmentation results with YOLO-predicted bounding box prompts. Our approach achieved a high accuracy of 0.933 and an AUC of 0.796 in ICH detection, along with a mean Dice score of 0.629 for ICH segmentation, outperforming existing weakly supervised and popular supervised (UNet and Swin-UNETR) approaches. Overall, the proposed method provides a robust and accurate alternative to the more commonly used supervised techniques for ICH quantification without requiring refined segmentation ground truths during model training. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

An Automated Approach to Discovering software Refactorings by Comparing Successive Versions

引用

IEEE Transactions on software engineering 2025年第5期51卷 1358-1380页

作者： Liu, Bo Liu, Hui Niu, Nan Zhang, Yuxia Li, Guangjie Jiang, He Jiang, Yanjie University of Cincinnati Department of Electrical Engineering and Computer Science CincinnatiOH United States National Innovation Institute of Defense Technology Beijing China School of Software Dalian University of Technology Dalian China Beijing Institute of Technology School of Computer Science and Technology Beijing China Peking University School of Computer Science Beijing China

software developers and maintainers frequently conduct software refactorings to improve software quality. Identifying the conducted software refactorings may significantly facilitate the comprehension of software evolution, and thus facilitate software maintenance and evolution. Besides that, the identified refactorings are also valuable for data-driven approaches in software refactoring. To this end, researchers have proposed a few approaches to identifying software refactorings automatically. However, the performance (especially precision) of such approaches deserves substantial improvement. To this end, in this paper, we propose a novel refactoring detection approach, called REEXTRACTOR+. At the heart of REEXTRACTOR+ is a reference-based entity matching algorithm that matches coarse-grained code entities (e.g., classes and methods) between two successive versions, and a context-aware statement matching algorithm that matches statements within a pair of matched methods. We evaluated REEXTRACTOR+ on a benchmark consisting of 400 commits from 20 real-world projects. The evaluation results suggested that REEXTRACTOR+ significantly outperformed the state of the art in refactoring detection, reducing the number of false positives by 59.6% and improving recall by 19.2%. We also evaluated the performance of the proposed matching algorithms that serve as the cornerstone of refactoring detection. The evaluation results suggested that the proposed algorithms excel in matching code entities, substantially reducing the number of mistakes (false positives plus false negatives) by 67% compared to the state-of-the-art approaches. © 2025 IEEE.

关键词： software quality

来源：评论

学校读者我要写书评

暂无评论

Advances in Robust Federated Learning: A Survey With Heterogeneity Considerations

引用

IEEE Transactions on Big Data 2025年第3期11卷 1548-1567页

作者： Chen, Chuan Liao, Tianchi Deng, Xiaojun Wu, Zihou Huang, Sheng Zheng, Zibin Sun Yat-sen University School of Computer Science and Engineering Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China Sun Yat-sen University School of Software Engineering Zhuhai519000 China Sun Yat-sen University School of Computer Science and Engineering Guangzhou510006 China Sun Yat-sen University School of Systems Science and Engineering Guangzhou510006 China Sun Yat-sen University School of Software Engineering Zhuhai Key Laboratory of Trusted Large Language Models Zhuhai519000 China

In the field of heterogeneous federated learning (FL), the key challenge is to efficiently and collaboratively train models across multiple clients with different data distributions, model structures, task objectives, computational capabilities, and communication resources. This diversity leads to significant heterogeneity, which increases the complexity of model training. In this paper, we first outline the basic concepts of heterogeneous FL and summarize the research challenges in FL in terms of five aspects: data, model, task, device and communication. In addition, we explore how existing state-of-the-art approaches cope with the heterogeneity of FL, and categorize and review these approaches at three different levels: data-level, model-level, and architecture-level. Subsequently, the paper extensively discusses privacy-preserving strategies in heterogeneous FL environments. Finally, the paper discusses current open issues and directions for future research, aiming to promote the further development of heterogeneous FL. © 2015 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：