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

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

来源：评论

学校读者我要写书评

暂无评论

Causal Label Enhancement

引用

IEEE Transactions on Knowledge and Data engineering 2024年第7期37卷 3933-3946页

作者： Liu, Xinyuan Zhu, Jihua Yue, Kun Zheng, Qinghai Li, Zhongyu Tian, Zhiqiang Zhu, Mingchen Xi'an Jiaotong University School of Software Engineering Xi'an China Yunnan University School of Information Science and Engineering Kunming China Fuzhou University College of Computer and Data Science Fuzhou China

Label enhancement (LE) is still a challenging task to mitigate the dilemma of the lack of label distribution. Existing LE work typically focuses on primarily formulating a projection between feature space and label distribution space from discriminative model perspective, which preserves the relevance consistency that the sign of recovered label distribution should be consistent with the logical label. Different from previous algorithms, we formulate this problem from a causal perspective and present a novel LE method via the structured causal model (LESCM). Specifically, the proposed LESCM deliberates establishing the causal graph with assuming that label distribution is a cause of feature and logical label, which naturally satisfies the definition of label distribution learning (LDL). With capturing the underlying causal relationships, we can significantly boost the interpretability and identifiability of label enhancement. Meanwhile, except for the relevance consistency, LESCM are encouraged to sustain the order consistency that assigns higher description degree of the recovered label distribution to the positive labels, as compared with the negative labels. Empirically, sufficient experiments on several label distribution learning data sets validate the effectiveness of LESCM. © 1989-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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)

来源：评论

学校读者我要写书评

暂无评论

Geometry-Aware Self-Supervised Indoor 360° Depth Estimation via Asymmetric Dual-Domain Collaborative Learning

引用

IEEE Transactions on Multimedia 2025年 27卷 3224-3237页

作者： Wang, Xu He, Ziyan Zhang, Qiudan Yang, You Zhao, Tiesong Jiang, Jianmin Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Huangzhong University of Science and Technology School of Electronic Information and Communications Wuhan430074 China Fuzhou University College of Physics and Information Engineering Fuzhou350108 China

Being able to estimate monocular depth for spherical panoramas is of fundamental importance in 3D scene perception. However, spherical distortion severely limits the effectiveness of vanilla convolutions. To push the envelope of accuracy, recent approaches attempt to utilize Tangent projection (TP) to estimate the depth of 360° images. Yet, these methods still suffer from discrepancies and inconsistencies among patch-wise tangent images, as well as the lack of accurate ground truth depth maps under a supervised fashion. In this paper, we propose a geometry-aware self-supervised 360° image depth estimation methodology that explores the complementary advantages of TP and Equirectangular projection (ERP) by an asymmetric dual-domain collaborative learning strategy. Especially, we first develop a lightweight asymmetric dual-domain depth estimation network, which enables to aggregate depth-related features from a single TP domain, and then produce depth distributions of the TP and ERP domains via collaborative learning. This effectively mitigates stitching artifacts and preserves fine details in depth inference without overspending model parameters. In addition, a frequent-spatial feature concentration module is devised to simultaneously capture non-local Fourier features and local spatial features, such that facilitating the efficient exploration of monocular depth cues. Moreover, we introduce a geometric structural alignment module to further improve geometric structural consistency among tangent images. Extensive experiments illustrate that our designed approach outperforms existing self-supervised 360° depth estimation methods on three publicly available benchmark datasets. © 1999-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Performance of pre-trained deep learning models for land use land cover classification using remote sensing imaging datasets

引用

Environmental Earth sciences 2025年第11期84卷 1-36页

作者： Haider, Irfan Khan, Muhammad Attique Masood, Saleha Algamdi, Shabbab Ali Alasiry, Areej Marzougui, Mehrez Nam, Yunyoung Department of Computer Science HITEC University Taxila Pakistan Department of AI College of Computer Engineering and Science Prince Mohammad Bin Fahd University Al-Khobar Saudi Arabia IRC for Finance and Digital Economy King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia Department of Software Engineering College of Computer Science and Engineering Prince Sattam Bin Abdulaziz University Al Kharj Saudi Arabia College of Computer Science King Khalid University Abha61413 Saudi Arabia Department of Computer Science and Engineering Soonchunhyang University Asan31538 Korea Republic of

This study presents a comparative analysis of ten pre-trained convolutional neural network (CNN) models, evaluated across three remote sensing datasets: EuroSat, NWPU, and Earth Hazards (Land Sliding). We investigate the interplay between model architecture and classifier selection by incorporating five different neural network (NN) classifiers, emphasizing their impact on predictive accuracy and computational efficiency. Due to its densely connected architecture, DenseNet201 achieved the highest accuracy—97% on EuroSat, 99.40% on NWPU, and 97.80% on Earth Hazards. In contrast, MobileNetV2, while slightly less accurate, demonstrated superior computational efficiency, recording the shortest prediction times of 39.943 s on EuroSat, 27.482 s on NWPU, and 2.8986 s on Earth Hazards. Additionally, classifier choice significantly influenced performance, with the Wide NN classifier excelling in diverse datasets and the Medium NN classifier optimizing speed. Our findings underscore the importance of balancing accuracy and efficiency in selecting CNN models for remote sensing applications, suggesting future research should explore ensembling techniques and lightweight models to enhance performance. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： software design

来源：评论

学校读者我要写书评

暂无评论

MixSSC: Forward-Backward Mixture for Vision-based 3D Semantic Scene Completion

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年第6期35卷 5684-5696页

作者： Wang, Meng Ding, Yan Liu, Yumeng Qin, Yunchuan Li, Ruihui Tang, Zhuo The College of Computer Science and Electronic Engineering Hunan University Changsha410082 China Beijing Key Laboratory of Human-Computer Interaction Institute of Software Chinese Academy of Sciences Beijing100190 China

Vision-based semantic scene completion task aims to predict dense geometric and semantic 3D scene representations from 2D images. However, 3D modeling from a single view is an ill-posed problem, limited by the field of view and occlusion problems caused by image input. Moreover, existing methods tend to produce erroneous scene hallucinations and overly smooth boundary segmentation due to a lack of information. To address this problem, we propose MixSSC, which mixes the sparsity of forward projection with the denseness of depth-prior backward projection. The aim is to use sparse features to fill information-poor regions and dense features to enhance visible regions. Specifically, we develop the forward-backward mixture module, which enables the generation of scene mixture voxel representation by leveraging the benefits of both forward and backward projection. Subsequently, we design the semantic-spatial fusion module, which utilizes a coarse-to-fine approach to process mixture voxel features at the semantic-spatial level. Extensive experimental results on the SemanticKITTI, SSCBench-KITTI-360 and nuScenes datasets demonstrate the superiority of MixSSC. © 1991-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

BMLP:behavior-aware MLP for heterogeneous sequential recommendation

引用

Frontiers of computer science 2024年第3期18卷 235-237页

作者： Weixin LI Yuhao WU Yang LIU Weike PAN Zhong MING College of Computer Science and Software Engineering Shenzhen UniversityShenzhen 518060China Guangdong Laboratory of Artificial Intelligence and Digital Economy(SZ) Shenzhen 518123China

1 Introduction Recommender systems can effectively alleviate the problem of information ***,traditional recommendation methods cannot capture users’dynamic *** recommendation methods model user sequences to obtain more accurate and dynamic user ***,deep learning-based sequential recommendation methods have achieved great *** is proposed to capture the sequential information[1,2].Attention-based methods[3]use attention mechanisms to learn relationships between ***-based methods[4−6]transform sequences into graph structures to capture relationships of ***,they have the following two limitations.

关键词： sequences behavior sequential

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：