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

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3564-3578页

作者： Xu, Honghui Fang, Chuangjie Wang, Renfang Chen, Shengyong Zheng, Jianwei Zhejiang University of Technology College of Computer Science and Technology Hangzhou310023 China Zhejiang Wanli University College of Big Data and Software Engineering Ningbo315200 China Tianjin University of Technology College of Computer Sciences and Engineering Tianjin300384 China

Recently, tensor singular value decomposition (TSVD) within high-order (Ho) algebra framework has shed new light on tensor robust principal component analysis (TRPCA) problem. However, HoTSVD lacks flexibility in handling the hidden correlations along different modes of large-scale multidimensional data. Moreover, the utilization of fixed or data-independent transformations in HoTSVD may result in suboptimality. For a relief, we propose a dual-enhanced self-learning TSVD along all modes to address computational flaws and learn a lossless transformation that induces a lower average-rank tensor. Specifically, we multiply the learnable semiorthogonal matrices obtained through Tucker compression with the original tensor along all modes, thus obtaining a core tensor with more inherent low rankness. Building upon this foundation, a new TNN is introduced by generalizing HoTSVD to Mode-k TSVD, followed by the facilitation to the core tensor, achieving dual-enhancement. Moreover, a reweighting scheme is imposed on the Mode-k HoTSVD to learn the global low-rank correlation and provide an efficient numerical solution. Finally, an alternating direction method of multipliers (ADMM)-based algorithm is developed as a solver. Experimental results on several types of multidimensional visual data, including light field images (LFI) and color videos, demonstrate the superiority of the proposal over previous state-of-the-art methods. © 2020 IEEE.

关键词： Discrete Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

Theoretical Analysis of an Adaptive Closeness Centrality-Based Algorithm for Dynamic Optimization of Transportation Networks

Theoretical Analysis of an Adaptive Closeness Centrality-Bas...

引用

2024 International Conference on engineering Management of Communication and Technology, EMCTECH 2024

作者： Mann, Michael Afeka - the Academic College of Engineering School of Software Engineering and Computer Science Tel Aviv Israel

ISBN: (数字)9798331507909

ISBN: (纸本)9798331507909

Purpose: This paper presents a theoretical analysis of the DynaTrans algorithm, a novel approach for dynamic optimization of urban transportation networks. Design/methodology/approach: We introduce an Adaptive Closeness Centrality (ACC) metric and the DynaTrans algorithm, providing formal proofs of correctness, convergence, and efficiency. The analysis employs graph theory, algorithmic complexity theory, and competitive analysis techniques. Findings: We prove that DynaTrans converges to a local optimal state in O(|V|/ϵ) iterations, with each iteration has limited computational and memory requirements. The algorithm achieves solutions within a factor of O(log|V|) from the global optimum, outperforming simple greedy approaches. Practical implications: DynaTrans offers a theoretically sound foundation for real-time traffic management systems, potentially improving urban mobility and reducing congestion. Originality/value: This work introduces a new paradigm for dynamic transportation network optimization, combining adaptive centrality measures with efficient graph algorithms. The rigorous theoretical analysis provides a solid basis for practical implementation and future research in urban traffic management. © 2024 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

DECAY: Dynamic Evaluation and Component Analysis for Enhancing Trust Management

DECAY: Dynamic Evaluation and Component Analysis for Enhanci...

引用

2024 IEEE International Conference on Consumer Electronics, ICCE 2024

作者： Huber, Brennan Kandah, Farah Auburn University Samuel Ginn College of Engineering Computer Science and Software Engineering United States

ISBN: (纸本)9798350324136

The Internet of Things (IoT) has gained widespread use across various domains, necessitating robust trust management for safeguarding data integrity and device reliability. Existing trust management algorithms often overlook the impact of a device's lifespan on trust adjustments. To address this shortcoming, we propose an innovative trust management strategy that introduces an 'engagement-level' component as a key feature. This component considers a device's past performance, granting established devices milder trust penalties than new ones and facilitating faster trust restoration for devices with low trust levels. Our approach also introduces a trust decay mechanism to handle inactive devices and cease contributing to the system, resulting in decreased trust levels. By discouraging passive behavior and encouraging active participation, this mechanism enhances IoT system trustworthiness. Through simulations and evaluations, we have demonstrated that our approach bolsters system security by scrutinizing malicious devices and rewarding active, trustworthy ones. It ensures vigilant threat monitoring, bolstering system security and improving trust assessment in the IoT environment. By integrating the engagement-level component and trust decay mechanism, our approach offers a dynamic trust management system that addresses existing algorithm limitations, enhancing accuracy and adaptability. © 2024 IEEE.

关键词： Internet of Things (IoT) Trust decay mechanism Trust management

来源：评论

学校读者我要写书评

暂无评论

Certrust:An SDN-Based Framework for the Trust of Certificates against Crossfire Attacks in IoT Scenarios

引用

computer Modeling in engineering & sciences 2023年第3期134卷 2137-2162页

作者： Lei Yan Maode Ma Dandan Li Xiaohong Huang Yan Ma Kun Xie School of Computer Science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijingChina College of Engineering QatarUniversityDohaQatar

The low-intensity attack flows used by Crossfire attacks are hard to distinguish from legitimate *** methods to identify the malicious flows in Crossfire attacks are rerouting,which is based on *** these existing mechanisms,the identification of malicious flows depends on the IP ***,the IP address is easy to be changed by *** the IP address,the certificate ismore challenging to be tampered with or ***,the traffic trend in the network is towards *** certificates are popularly utilized by IoT devices for authentication in encryption *** proposed a new way to verify certificates for resource-constrained IoT devices by using the SDN *** on DTLShps,the SDN controller can collect statistics on *** this paper,we proposeCertrust,a framework based on the trust of certificates,tomitigate the Crossfire attack by using SDN for *** goal is ***,the trust model is built based on the Bayesian trust system with the statistics on the participation of certificates in each Crossfire ***,the forgetting curve is utilized instead of the traditional decay method in the Bayesian trust system for achieving a moderate decay ***,for detecting the Crossfire attack accurately,a method based on graph connectivity is ***,several trust-based routing principles are proposed tomitigate the Crossfire *** principles can also encourage users to use certificates in *** performance evaluation shows that Certrust is more effective in mitigating the Crossfire attack than the traditional rerouting ***,our trust model has a more appropriate decay rate than the traditional methods.

关键词： Trust model certificate SDN Crossfire attack bayesian trust system forgetting curve IoT

来源：评论

学校读者我要写书评

暂无评论

Zero Trust+: A Trusted-based Zero Trust architecture for IoT at Scale

Zero Trust+: A Trusted-based Zero Trust architecture for IoT...

引用

2024 IEEE International Conference on Consumer Electronics, ICCE 2024

作者： Huber, Brennan Kandah, Farah Auburn University Computer Science and Software Engineering Samuel Ginn College of Engineering United States

ISBN: (纸本)9798350324136

The Zero Trust security architecture has been widely recognized for its efficacy in strengthening cybersecurity by rejecting the concept of implicit trust and adopting strict identity verification measures. However, as organizations face escalating demands for rapid and scalable access control, the performance limitations of traditional Zero Trust implementations have become a concern. In response to this challenge, we introduce a novel trust management-based solution that significantly improves performance without compromising security integrity. Through a streamlined trust provisioning approach, our solution offers a 20% enhancement in processing efficiency, making it highly suitable for dynamic and large-scale environments. This research paper presents the design, implementation, and evaluation of our trust management-based solution, showcasing its superiority over conventional Zero Trust architectures in addressing performance concerns while delivering the same robust access control capabilities. © 2024 IEEE.

关键词： Internet of Things Security Trust Management Zero Trust Architecture

来源：评论

学校读者我要写书评

暂无评论

Optimized Autonomous Computing with Trusted Resilient Data Management for IoT Emerging Networks

引用

IEEE Sensors Journal 2025年第11期25卷 20778-20785页

作者： Shafique, Ayesha Cheng, Benmao Zhao, Bo Alwakid, Ghadah Naif Haq, Muhammad Inaam Ul Laboratory of Intelligent IOT Technology and Applications in Universities China Jouf University College of Computer and Information Sciences Department of Computer Science Al Jowf Sakaka72341 Saudi Arabia Quanzhou University of Information Engineering School of Computer Science and Software Engineering Quanzhou362000 China

The innovative city network integrates numerous computational and physical components to develop real-time systems. These systems can capture sensor data and distribute it to end stations. Most solutions have been presented based on the centralized computing paradigm, which effectively and systematically increases data flow;however, distributed wireless technologies and heterogeneous network services continue to raise significant research problems. These challenges lower the optimization criteria and reflect communication structure around the network edges. In this research, we proposed a sustainable development for smart networks using efficient big data management with collaborative decisions for network devices. It differs from most existing work in the mentioned aspect. It applies computational lightweight intelligence for forwarding collected data using mobile collectors and reduces the congestion flow between devices on the limited bandwidth of wireless links. Moreover, the energy load is efficiently managed with edge-driven methods, and the incorporation of trusted devices ensures the integrity of the smart network. It also tackles potential communication threats smartly. Based on the experiments conducted in Network Simulator (NS-3), the proposed model enhances the efficacy of smart networks for performance metrics with reliability and effective management of resources in Internet of Things (IoT) network. © 2025 IEEE.

关键词： Mathematical models Computational modeling Intelligent sensors Data aggregation Internet of Things Security Routing Load modeling Silicon Data models

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach to Energy Optimization:Efficient Path Selection in Wireless Sensor Networks with Hybrid ANN

引用

computers, Materials & Continua 2024年第5期79卷 2945-2970页

作者： Muhammad Salman Qamar Ihsan ulHaq Amil Daraz Atif MAlamri Salman A.AlQahtani Muhammad Fahad Munir Department of Electrical and Computer Engineering International Islamic UniversityIslamabad44000Pakistan School of Information Science and Engineering NingboTech UniversityNingbo315100China Software Engineering Department College of Computer and Information SciencesKing Saud UniversityRiyadh11495Saudi Arabia Computer Engineering Department College of Computer and Information SciencesKing Saud UniversityRiyadh11495Saudi Arabia

In pursuit of enhancing the Wireless Sensor Networks(WSNs)energy efficiency and operational lifespan,this paper delves into the domain of energy-efficient routing ***,the limited energy resources of Sensor Nodes(SNs)are a big challenge for ensuring their efficient and reliable *** data gathering involves the utilization of a mobile sink(MS)to mitigate the energy consumption problem through periodic network *** mobile sink(MS)strategy minimizes energy consumption and latency by visiting the fewest nodes or predetermined locations called rendezvous points(RPs)instead of all cluster heads(CHs).CHs subsequently transmit packets to neighboring *** unique determination of this study is the shortest path to reach *** the mobile sink(MS)concept has emerged as a promising solution to the energy consumption problem in WSNs,caused by multi-hop data collection with static *** this study,we proposed two novel hybrid algorithms,namely“ Reduced k-means based on Artificial Neural Network”(RkM-ANN)and“Delay Bound Reduced kmeans with ANN”(DBRkM-ANN)for designing a fast,efficient,and most proficient MS path depending upon rendezvous points(RPs).The first algorithm optimizes the MS’s latency,while the second considers the designing of delay-bound paths,also defined as the number of paths with delay over bound for the *** methods use a weight function and k-means clustering to choose RPs in a way that maximizes efficiency and guarantees network-wide *** addition,a method of using MS scheduling for efficient data collection is *** simulations and comparisons to several existing algorithms have shown the effectiveness of the suggested methodologies over a wide range of performance indicators.

关键词： Wireless Sensor Networks(WSNs) mobile sink(MS) rendezvous point(RP) machine learning Artificial Neural Networks(ANNs)

来源：评论

学校读者我要写书评

暂无评论

Dynamic Routing of Multiple QoS-Required Flows in Cloud-Edge Autonomous Multi-Domain Data Center Networks

引用

computers, Materials & Continua 2024年第2期78卷 2287-2308页

作者： Shiyan Zhang Ruohan Xu Zhangbo Xu Cenhua Yu Yuyang Jiang Yuting Zhao School of Computer Science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijing100876China College of Computer Science and Technology Tianjin UniversityTianjin300072China Institute of Artificial Intelligence Nankai UniversityTianjin300071China College of Information Science and Engineering East China University of Science and TechnologyShanghai200237China

The 6th generation mobile networks(6G)network is a kind of multi-network interconnection and multi-scenario coexistence network,where multiple network domains break the original fixed boundaries to form connections and *** this paper,with the optimization objective of maximizing network utility while ensuring flows performance-centric weighted fairness,this paper designs a reinforcement learning-based cloud-edge autonomous multi-domain data center network architecture that achieves single-domain autonomy and multi-domain *** to the conflict between the utility of different flows,the bandwidth fairness allocation problem for various types of flows is formulated by considering different defined reward *** the tradeoff between fairness and utility,this paper deals with the corresponding reward functions for the cases where the flows undergo abrupt changes and smooth changes in the *** addition,to accommodate the Quality of Service(QoS)requirements for multiple types of flows,this paper proposes a multi-domain autonomous routing algorithm called LSTM+*** a Long Short-Term Memory(LSTM)layer in the actor and critic networks,more information about temporal continuity is added,further enhancing the adaptive ability changes in the dynamic network *** LSTM+MADDPG algorithm is compared with the latest reinforcement learning algorithm by conducting experiments on real network topology and traffic traces,and the experimental results show that LSTM+MADDPG improves the delay convergence speed by 14.6%and delays the start moment of packet loss by 18.2%compared with other algorithms.

关键词： Multi-Domain data center networks autonomous routing

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Identifying Critical Nodes in Networks Based on Spectral Clustering to Construct Hypergraphs 16

Algorithm for Identifying Critical Nodes in Networks Based o...

引用

16th International Conference on Wireless Communications and Signal Processing, WCSP 2024

作者： Li, Xujie Shao, Fei Li, Haotian College of Computer Science and Software Engineering Hohai University Nanjing China College of Information Science and Engineering Hohai University Nanjing China

ISBN: (纸本)9798350390643

Currently, the basis for critical nodes definition and identification lies in the representation learning of the network and the extraction of local and global features of the nodes. The effectiveness of the algorithm is closely related to network modeling and network structural characteristics. However, with the increasing complexity of real-world systems, utilizing the continuity and integrity of traditional bipartite graph representation faces significant challenges. Different from traditional graph modeling, the hyperedges of a hypergraph can connect multiple nodes simultaneously, thus forming richer structural features and interaction information between nodes for the analysis and judgment of critical nodes. To more accurately identify critical nodes in complex networks, we propose an algorithm that establishes a hypergraph representation for traditional graph data to extract higher-order features of nodes for neural network training, in order to identify critical nodes in complex networks. The effectiveness of this method is proven by comparing it with various critical node identification algorithms under different infection rates. © 2024 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

A Length-Adaptive Non-Dominated Sorting Genetic Algorithm for Bi-Objective High-Dimensional Feature Selection

引用

IEEE/CAA Journal of Automatica Sinica 2023年第9期10卷 1834-1844页

作者： Yanlu Gong Junhai Zhou Quanwang Wu MengChu Zhou Junhao Wen College of Computer Science Chongqing UniversityChongqing 400044China IEEE Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA College of Big Data and Software Engineering Chongqing UniversityChongqing 400044China

As a crucial data preprocessing method in data mining,feature selection(FS)can be regarded as a bi-objective optimization problem that aims to maximize classification accuracy and minimize the number of selected *** computing(EC)is promising for FS owing to its powerful search ***,in traditional EC-based methods,feature subsets are represented via a length-fixed individual *** is ineffective for high-dimensional data,because it results in a huge search space and prohibitive training *** work proposes a length-adaptive non-dominated sorting genetic algorithm(LA-NSGA)with a length-variable individual encoding and a length-adaptive evolution mechanism for bi-objective highdimensional *** LA-NSGA,an initialization method based on correlation and redundancy is devised to initialize individuals of diverse lengths,and a Pareto dominance-based length change operator is introduced to guide individuals to explore in promising search space ***,a dominance-based local search method is employed for further *** experimental results based on 12 high-dimensional gene datasets show that the Pareto front of feature subsets produced by LA-NSGA is superior to those of existing algorithms.

关键词： Bi-objective optimization feature selection(FS) genetic algorithm high-dimensional data length-adaptive

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：