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

LooP: A Low-Overhead Path Reconstruction for Large-Scale IoTs

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

作者： Fu, Luwei Zhao, Zhiwei Liu, Zhuoliu Min, Geyong University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China University of Exeter Department of Computer Science ExeterEX4 4QF United Kingdom

Internet of Things (IoT) plays a vital role in various smart applications due to its cost-efficiency and good scalability. For safety and management of a large-scale IoT with many gateways, packet-level path reconstruction which exactly reveals the transmission path of each packet is desired. However, the existing path reconstruction schemes rely on correlation between diverse packets, which results in either considerable overhead or poor accuracy. It is particularly difficult to reconstruct the paths by affordable overhead under the intensive deployment, constrained resource, and weak correlation of IoT devices. To this end, we propose a Low-overhead Path reconstruction (LooP) for large-scale IoT. The proposed scheme exploits the nature of incremental update that each node only identifies the changes of its one-hop topology for diverse gateways. The gateway nodes then iteratively recover the complete path of each received packet according to the reported changes and historical information. It removes much redundant overhead (e.g., the common paths information) while guaranteeing the accurate reconstruction in a large scale and dynamic topology network. We analyze the information entropy of LooP and several existing schemes to theoretically prove the superiority of our proposal. The experimental results also demonstrate LooP can achieve 98% reconstruction accuracy on average and at least 3x gain-cost-ratio of the sub-optimal rival. © 2013 IEEE.

关键词： Gateways (computer networks)

来源：评论

学校读者我要写书评

暂无评论

Deep-Reinforcement-Learning-Based Continuous Workflows Scheduling in Heterogeneous Environments

引用

IEEE Internet of Things Journal 2025年第10期12卷 14036-14050页

作者： Wang, Zhi Zhan, Wenhan Duan, Hancong Min, Geyong Huang, Hualong University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China University of Exeter College of Engineering Mathematics and Physical Sciences Department of Computer Science ExeterEX4 4QF United Kingdom

Workflow scheduling plays a critical role in optimizing completion time and throughput in distributed cloud environments, leveraging the parallelism of heterogeneous computing resources. However, existing workflow scheduling algorithms often fall short due to heuristic limitations and the challenges in adaptability within heterogeneous settings, leading to suboptimal scheduling solutions. In this article, we present a novel deep reinforcement learning (DRL) framework tailored for continuous workflow scheduling in heterogeneous environments. First, we propose an intelligent scheduler that updates the policy network through interactions with a multitenant environment, triggered by scheduling events. Next, the framework incorporates a graph attention network (GAT) and a self-attention multilayer perceptron (MLP) to preprocess the workflow topology and embed dynamic features of ready tasks and available processors into the state input at each scheduling step. Additionally, a k-dimensional tree-based k-nearest neighbors (kNN) algorithm is employed to map the output action vector to a pair of executed ready task and processor, facilitating the transition from continuous to discrete action spaces and addressing challenges associated with dynamic action spaces. Experimental results demonstrate that our method converges effectively in continuous workflow scheduling scenarios and significantly outperforms the best-known methods in terms of average makespan and load balancing efficiency. © 2014 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A parametric rate-distortion model for video transcoding

引用

Multimedia Tools and Applications 2025年 1-35页

作者： Jamali, Maedeh Karimi, Nader Samavi, Shadrokh Shirani, Shahram Department of Electrical and Computer Engineering McMaster University HamiltonL8S 4L8 Canada Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan84156-83111 Iran Computer Science Department Seattle University Seattle98122 United States

Over the past two decades, the rise in video streaming has been driven by internet accessibility and the demand for high-quality video. To meet this demand across varying network speeds and devices, transcoding is essential. This paper introduces a parametric rate-distortion (R-D) transcoding model that predicts transcoding distortion at different bitrates without the need for re-encoding. Experimental results validate the model’s effectiveness in predicting rate-distortion behavior for diverse video content. Using our model, visual quality (measured by PSNR and VMAF) of transcoded video can be improved through trans-sizing. Moreover, our model can identify visually lossless bitrate ranges. This allows service providers to adjust target bitrates with minimal quality loss. Experimental results validate the model’s effectiveness in predicting rate-distortion behavior for diverse video content. By using the VMAF measure, our model achieves a quality improvement of up to 2.55 and bitrate savings of up to 79.10%. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Video streaming

来源：评论

学校读者我要写书评

暂无评论

Self-supervised learning of pseudo classes for generalized zero-shot fine-grained recognition

引用

Multimedia Tools and Applications 2025年第10期84卷 7915-7930页

作者： Chen, Yan-He Yeh, Mei-Chen Department of Computer Science and Information Engineering National Taiwan Normal University No. 88 Sec. 4 Tingzhou Rd. Taipei Taiwan

Generalized zero-shot learning (GZSL) attempts to recognize visual instances from both seen and unseen classes by transferring knowledge from seen classes to unseen classes through semantic information (e.g., attributes). Generative methods are commonly employed to alleviate the issue of extreme data imbalance in which visual samples from unseen classes are not available during training, by synthesizing training samples for unseen classes from class prototypes. However, in the context of GZSL applied to fine-grained recognition, a notable complication arises. Similar class prototypes among different categories lead to ambiguity when generating synthetic data for classification. In response, we present a novel solution: a self-supervised pseudo-labeling (SSPL) module designed to enhance the generation of discerning synthetic data. This enhancement is achieved through an unsupervised grouping of fake and real samples using pseudo classes. By doing so, the SSPL module addresses the challenge of generating discriminative fake data, ultimately improving the overall quality of synthesized samples for classification. Our experimental results, conducted on three widely recognized GZSL datasets, demonstrate the effectiveness of the proposed method. Notably, the SSPL module not only produces well-distributed synthetic samples, but also enhances the discriminative and generalizable visual features derived from both real and synthetic samples within the GZSL framework. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Deep Reinforcement Learning-Based Ultra Reliable and Low Latency Vehicular OCC

引用

IEEE Transactions on Communications 2025年第5期73卷 3254-3267页

作者： Islam, Amirul Thomos, Nikolaos Musavian, Leila Department of Electrical and Electronics Engineering Dhaka1229 Bangladesh University of Essex School of Computer Science and Electronic Engineering ColchesterCO4 3SQ United Kingdom

In this paper, we present a deep reinforcement learning (DRL) framework for vehicular optical camera communication (OCC) systems that ensures ultra-reliable and low-latency communication (uRLLC). We first formulate a throughput maximization problem that aims at optimizing speed of vehicles, channel code rate, and modulation order while respecting the uRLLC requirements. We model reliability by satisfying a target bit error rate and latency as transmission latency. To improve the transmission rate and provide high reliability and low latency, our scheme uses low-density parity-check codes and adaptive modulation. We then solve the optimization problem using the actor-critic-based DRL scheme with Wolpertinger framework. We employ a deep deterministic policy gradient algorithm to operate over continuous action spaces. The evaluation confirms that our proposed DRL-based optimization scheme achieves superior performance compared to radio frequency-based communication systems as well as variants of the proposed scheme. Finally, we verify through simulations that our proposed solution can maximize the communication rate while meeting the uRLLC constraints. © 1972-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A combinatorial algorithm for finding straight skeleton of a digital object

引用

Multimedia Tools and Applications 2025年 1-21页

作者： Maity, Anukul Dutt, Mousumi Biswas, Arindam Department of Computer Science and Engineering Narula Institute of Technology 81 Nilgunj Road Agarpara West Bengal Kolkata700109 India Department of Computer Science and Engineering St. Thomas’ College of Engineering and Technology 4 Diamond Harbour Road Kidderpore West Bengal Kolkata700023 India Department of Information Technology Indian Institute of Engineering Science and Technology Botanical Garden Road Shibpur West Bengal Howrah711103 India

The paper presents a combinatorial algorithm to find the straight skeleton of the inner isothetic cover of a digital object imposed on a uniform background grid. The isothetic polygon (orthogonal polygon) tightly inscribes the given digital object. The algorithm stated here finds the straight skeleton of any isothetic polygon (simple or non-simple) in O(nglogng) time in a single traversal by applying combinatorial rules, where n is the number of pixels on the boundary of the digital object and g is the grid size on which the digital object is imposed. To find the straight skeleton of non-simple orthogonal polygon, the polygon is divided into sub-parts which are a set of simple orthogonal polygons. The straight skeleton is generated for each of the sub-parts and the corresponding results are merged. The orthogonal polygon containing holes is cut at each holes and the polygon becomes hole-free. The algorithm to obtain the straight skeleton is applied on it. The disconnected hole parts are rejoined and the result is merged. The straight skeleton is useful shape descriptor of digital object. This algorithm stated here has applications in shape analysis. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation

引用

IEEE Transactions on Information Theory 2025年第6期71卷 4556-4580页

作者： Wang, Ziao Wang, Weina Wang, Lele University of British Columbia Department of Electrical and Computer Engineering VancouverBCV6T 1Z4 Canada University of Michigan Department of Electrical and Computer Engineering Ann ArborMI48109 United States Carnegie Mellon University Computer Science Department PittsburghPA15213 United States

Graph alignment refers to the task of finding the vertex correspondence between two correlated graphs of n vertices. Extensive study has been done on polynomial-time algorithms for the graph alignment problem under the Erdős–Rényi graph pair model, where the two graphs are Erdős–Rényi graphs with edge probability qu, correlated under certain vertex correspondence. To achieve exact recovery of the correspondence, all existing algorithms at least require the edge correlation coefficient ρu between the two graphs to be non-vanishing as n → ∞. Moreover, it is conjectured that no polynomial-time algorithm can achieve exact recovery under vanishing edge correlation ρuu ≥ n-Θ(1). We identify a local tree structure, which incorporates one layer of user information and one layer of attribute information, and apply the subgraph counting technique to such structures. A polynomial-time algorithm is proposed that recovers the vertex correspondence for most of the vertices, and then refines the output to achieve exact recovery. The consideration of attribute information is motivated by real-world applications like LinkedIn and Twitter, where user attributes like birthplace and education background can aid alignment. © 1963-2012 IEEE.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Deep learning based predictive analysis of energy consumption for smart homes

引用

Multimedia Tools and Applications 2025年第12期84卷 10665-10686页

作者： Malik, Sangeeta Malik, Sitender Singh, Ishmeet Gupta, Harsh Vardhan Prakash, Sidhant Jain, Rachna Acharya, Biswaranjanjan Hu, Yu-Chen Computer Science and Engineering Maharaja Surajmal Institute of Technology New Delhi India IT Department Maharaja Surajmal Institute of Technology New Delhi India IT Department Bhagwan Parshuram Institute of Technology New Delhi India Department of Computer Engineering-AI & BD Marwadi University Gujarat Rajkot India Department of Computer Science TungHai University No. 1727 Sec. 4 Boulevard Xitun District Taichung City407224 Taiwan

Predicting energy consumption has become crucial to creating a sustainable and intelligent environment. With the aid of forecasts of future demand, the distribution and production of energy can be optimized to meet the requirements of a vastly growing population. However, because of the varied types of energy consumption patterns, predicting the demand for any household can be difficult. It has recently gained popularity with social Internet of Things-based smart homes, smart grid planning, and artificial intelligence-based smart energy-saving solutions. Although there are methods for estimating energy consumption, most of these systems are based on one-step forecasting and have a limited forecasting period. Several prediction models were implemented in this paper to address the problem mentioned above and achieve high accuracy, including the baseline model, the Auto-Regressive Integrated Moving Average (ARIMA) model, the Seasonal Auto-Regressive Integrated Moving Average (SARIMAX with eXogenous factors) model, the Long Short-Term Memory (LSTM) Univariate model, and the LSTM Multivariate model. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A New Cybersecurity Approach Enhanced by xAI-Derived Rules to Improve Network Intrusion Detection and SIEM

引用

computers, Materials & Continua 2025年第5期83卷 1607-1621页

作者： Federica Uccello Marek Pawlicki Salvatore D'Antonio RafałKozik MichałChoras Centro Direzionale Department of EngineeringUniversity of Naples‘Parthenope’Isola C4Napoli80133Italy Department of Computer and Information Science Software and SystemsLinköping UniversityLinköping58183Sweden ITTI Sp.z o.o. Pozna´n61-612Poland Faculty of Telecommunications Computer Science and Electrical EngineeringBydgoszcz University of Science and TechnologyBydgoszcz85-796Poland

The growing sophistication of cyberthreats,among others the Distributed Denial of Service attacks,has exposed limitations in traditional rule-based Security Information and Event Management *** machine learning–based intrusion detection systems can capture complex network behaviours,their“black-box”nature often limits trust and actionable insight for security *** study introduces a novel approach that integrates Explainable Artificial Intelligence—xAI—with the Random Forest classifier to derive human-interpretable rules,thereby enhancing the detection of Distributed Denial of Service(DDoS)*** proposed framework combines traditional static rule formulation with advanced xAI techniques—SHapley Additive exPlanations and Scoped Rules-to extract decision criteria from a fully trained *** methodology was validated on two benchmark datasets,CICIDS2017 and *** rules were evaluated against conventional Security Information and Event Management Systems rules with metrics such as precision,recall,accuracy,balanced accuracy,and Matthews Correlation *** results demonstrate that xAI-derived rules consistently outperform traditional static ***,the most refined xAI-generated rule achieved near-perfect performance with significantly improved detection of DDoS traffic while maintaining high accuracy in classifying benign traffic across both datasets.

关键词： Cybersecurity explainable artificial intelligence intrusion detection system rule-based SIEM distributed denial of service

来源：评论

学校读者我要写书评

暂无评论

(r, k, Ε)-Anonymization: Privacy-Preserving Data Publishing Algorithm Based on Multi-Dimensional Outlier Detection, k-Anonymity, and Ε-Differential Privacy

引用

IEEE Access 2025年 13卷 70422-70435页

作者： Kara, Burak Cem Eyupoglu, Can Karakus, Oktay National Defence University Turkish Air Force Academy Department of Computer Engineering İstanbul34149 Turkey Cardiff University School of Computer Science and Informatics CardiffCF24 4AG United Kingdom

In recent years, there has been a tremendous rise in both the volume and variety of big data, providing enormous potential benefits to businesses that seek to utilize consumer experiences for research or commercial purposes. The general data protection regulation (GDPR) implementation, on the other hand, has introduced extensive control over the use of individuals’ personal information and placed many limits. Data anonymization technologies have become an important solution for businesses trying to generate value from data while adhering to GDPR limitations. To address these challenges, researchers have developed various methods, including k-anonymity and Ε -differential privacy, offering solutions for both industry and academia. However, protecting individuals’ privacy against diverse attack attempts presents significant challenges for anonymization models that rely solely on a single technique, highlighting the need for more adaptable and hybrid approaches. In this study, a new hybrid anonymization algorithm called (r, k, Ε )-anonymization has been proposed, which combines k-anonymity and Ε-differential privacy models in a consistent framework and provides stronger privacy guarantees compared to existing privacy-preserving models. The proposed algorithm is capable of overcoming well-known shortcomings of the k-anonymity and Ε -differential privacy models, and it has been confirmed by extensive tests on real-world datasets. The proposed (r, k, Ε )-anonymization algorithm outperforms k-anonymity and Ε -differential privacy in terms of the average error rate measure, achieving data utility increases of 31.74% and 26.99%, respectively. © 2013 IEEE.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：