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

Securing Sdn/Nfv-Enabled Campus Networks with Software-Defined Perimeter-Based Zero-Trust Architecture

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Ruambo, Francis A. Zou, Deqing Lopes, Ivandro O. Yuan, Bin School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Hubei Key Laboratory of Distributed System Security Wuhan China Hubei Engineering Research Center on Big Data Security Wuhan China National Engineering Research Center for Big Data Technology and System Wuhan China Services Computing Technology and System Lab Wuhan China Cluster and Grid Computing Lab Wuhan China Mbeya university of Science and Technology Mbeya131 Tanzania United Republic of Nucleo Operacional para a Sociedade de Informacao Cape Verde Songshan Laboratory Zhengzhou China

Network softwarization is a breakthrough in designing modern networks and providing numerous new network operations and services. This change is exemplified by Software Defined Networks (SDN) and Network Function Virtualization (NFV). As a result, the combination of SDN and NFV (SDN/NFV) frameworks and individual SDN and NFV frameworks have gained substantial traction in network security over the past decade, significantly supporting on-demand protection measures. However, the inherent security shortcomings of SDN, NFV, and SDN/NFV frameworks provide the fundamental issue in implementing security procedures via network softwarization. To solve this issue, we present a Software-Defined Perimeter (SDP)-powered Zero-Trust Architecture (ZTA) to improve security in the SDN/NFV-enabled campus network holistically. In addition to this, we also propose a threat model and quantitatively assess the suggested approach's performance and security. Furthermore, we highlight potential zero-trust network security function implementations in SDN/NFV-enabled infrastructure to increase protection for endpoint devices, network resources, and flows for detecting threats and responding effectively with minimal latency and overhead. © 2023, The Authors. All rights reserved.

关键词： Access control

TCSloT: Text Guided 3D Context and Slope Aware Triple Network for Dental Implant Position Prediction

学校读者我要写书评

暂无评论

TCSloT: Text Guided 3D Context and Slope Aware Triple Networ...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xinquan Yang Jinheng Xie Xuechen Li Xuguang Li Linlin Shen Yongqiang Deng College of Computer Science and Software Engineering Shenzhen University Shenzhen China Show Lab National University of Singapore Singapore National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Stomatology Shenzhen University General Hospital Shenzhen China

In implant prosthesis treatment, the surgical guide of implant is used to ensure accurate implantation. However, such design heavily relies on the manual location of the implant position. When deep neural network has been proposed to assist the dentist in locating the implant position, most of them take a single slice as input, which do not fully explore 3D contextual information and ignores the influence of implant slope. In this paper, we design a Text Guided 3D Context and Slope Aware Triple Network (TCSloT) to integrate the perception of contextual information from multiple adjacent slices and awareness of variation of implant slopes. A Texture Variation Perception (TVP) module is correspondingly design to process the multiple slices and capture the texture variation among slices and a Slope-Aware Loss (SAL) is proposed to dynamically assign adaptive weights for the regression head. Additionally, we design a conditional text guidance (CTG) module to integrate the text condition (i.e., left, middle and right) from the CLIP to assist the implant position prediction. Extensive experiments on a dental implant dataset through five-fold cross-validation, demonstrated that the proposed TCSloT achieves superior performance than existing methods.

关键词：

Evolutionary Multiobjective Feature Selection Assisted by Unselected Features

学校读者我要写书评

暂无评论

Evolutionary Multiobjective Feature Selection Assisted by Un...

Congress on Evolutionary Computation

作者： Xuan Duan Songbai Liu Junkai Ji Lingjie Li Qiuzhen Lin Kay Chen Tan College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ) Shenzhen University Shenzhen China Department of Computing The Hong Kong Polytechnic University Hong Kong SAR

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

To enhance the generalization of multi-objective feature selection (MOFS) in classification, this paper proposes an evolutionary multitasking algorithm, diverging from previous approaches that exclusively target selected features. The algorithm integrates information from both selected and unselected features, introducing a novel objective to minimize the accuracy of unselected features. This objective, combined with the goal of minimizing classification errors for selected features, forms an auxiliary MOFS task. The paper presents a dual-population evolutionary multitasking framework that synergizes the main MOFS task with the auxiliary task. A knowledge transfer mechanism, based on accuracy preferences, seamlessly shares insights from the auxiliary to the main task, aiming to identify improved Pareto feature subsets. Empirical results demonstrate the superior performance of several state-of-the-art multi-objective algorithms within this framework, highlighting significant improvements across diverse datasets.

关键词： Accuracy Evolutionary computation Multitasking Feature extraction Classification algorithms Task analysis Knowledge transfer

FlashWalker: An In-Storage Accelerator for Graph Random Walks

学校读者我要写书评

暂无评论

FlashWalker: An In-Storage Accelerator for Graph Random Walk...

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Fuping Niu Jianhui Yue Jiangqiu Shen Xiaofei Liao Haikun Liu Hai Jin National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Computer Science Michigan Technological University Houghton Michigan USA

Graph random walk is widely used in the graph processing as it is a fundamental component in graph analysis, ranging from vertices ranking to the graph embedding. Different from traditional graph processing workload, random walk features massive processing parallelisms and poor graph data reuse, being limited by low I/O efficiency. Prior designs for random walk mitigate slow I/O operations. However, the state-of-the-art random walk processing systems are bounded by slow disk I/O bandwidth, which is confirmed by our experiments with real-world graphs. To address this issue, we propose FlashWalker, an in-storage accelerator for random walk that moves walk updating close to graph data stored in flash memory, by exploiting significant parallelisms inside SSD. Featuring a heterogeneous and parallel processing system, FlashWalker includes a board-level accelerator, channel-level accelerators, and chip-level accelerators. To address challenges posed by the tight resource constraints for processing large-scale graphs, we propose novel designs: storing a few popular subgraphs in accelerators, the pre-walking for dense walks, two optimizations to search the subgraph mapping table, and a subgraph scheduling algorithm. We implement FlashWalker in RTL, showing small circuit area overhead. Our evaluation shows FlashWalker reduces the execution time of random walk algorithms by up to 660.50×, compared with GraphWalker, which is the state-of-the-art system for random walk algorithms.

关键词： Distributed processing Scheduling algorithms Bandwidth Parallel processing Distance measurement Flash memories Optimization

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning 24

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level...

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9798400706868

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity Network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment Network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3D-AD. We provide the code and supplementary information on our website: https://***/M-3lab/Group3AD. © 2024 ACM.

关键词： Contrastive Learning

Metadata-Driven Federated Learning of Connectional Brain Templates in Non-IID Multi-Domain Scenarios

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Geng Wang, Qingyue Rekik, Islem National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science and Engineering Northwestern Polytechnical University China BASIRA Lab Imperial-X Department of Computing Imperial College London United Kingdom

A connectional brain template (CBT) is a holistic representation of a population of multi-view brain connectivity graphs, encoding shared patterns and normalizing typical variations across individuals. The federation of CBT learning allows for an inclusive estimation of representative center of multi-domain brain connectivity datasets in a fully data-preserving manner. However, existing methods overlook the non-independent and identically distributed (non-IDD) issue stemming from multidomain brain connectivity heterogeneity, in which data domains are drawn from different hospitals and imaging modalities. This non-IDD issue degrades the centrality of locally learned CBT from multiple decentralized datasets (i.e., domains/hospitals), eventually leading to a limited representation ability. To overcome this limitation, we unprecedentedly propose a metadata-driven federated learning framework, called MetaFedCBT, for cross-domain CBT learning. Given the data drawn from a specific domain (i.e., hospital), our model aims to learn a metadata in a fully supervised manner by introducing a local client-based regressor network. The generated meta-data is forced to meet the statistical attributes (e.g., mean) of other domains, while preserving their privacy. Our supervised meta-data generation approach boosts the unsupervised learning of a more centered and representative and holistic CBT of a particular brain state across diverse domains. As the federated learning progresses over multiple rounds, the learned metadata and associated generated connectivities are are continuously updated to better approximate the target domain information. MetaFedCBT overcomes the non-IID issue of existing methods by generating informative brain connectivities for privacy-preserving holistic CBT learning with the guidance using metadata. Extensive experiments on multi-view morphological brain networks of normal and patient subjects demonstrate that our MetaFedCBT is a superior federated CBT learnin

关键词： Metadata

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

APSeg: Auto-Prompt Network for Cross-Domain Few-Shot Semantic Segmentation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： He, Weizhao Zhang, Yang Zhuo, Wei Shen, Linlin Yang, Jiaqi Deng, Songhe Sun, Liang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China School of Computer Science University of Nottingham China

Few-shot semantic segmentation (FSS) endeavors to segment unseen classes with only a few labeled samples. Current FSS methods are commonly built on the assumption that their training and application scenarios share similar domains, and their performances degrade significantly while applied to a distinct domain. To this end, we propose to leverage the cutting-edge foundation model, the Segment Anything Model (SAM), for generalization enhancement. The SAM however performs unsatisfactorily on domains that are distinct from its training data, which primarily comprise natural scene images, and it does not support automatic segmentation of specific semantics due to its interactive prompting mechanism. In our work, we introduce APSeg, a novel auto-prompt network for cross-domain few-shot semantic segmentation (CD-FSS), which is designed to be auto-prompted for guiding cross-domain segmentation. Specifically, we propose a Dual Prototype Anchor Transformation (DPAT) module that fuses pseudo query prototypes extracted based on cycle-consistency with support prototypes, allowing features to be transformed into a more stable domain-agnostic space. Additionally, a Meta Prompt Generator (MPG) module is introduced to automatically generate prompt embeddings, eliminating the need for manual visual prompts. We build an efficient model which can be applied directly to target domains without fine-tuning. Extensive experiments on four cross-domain datasets show that our model outperforms the state-of-the-art CD-FSS method by 5.24% and 3.10% in average accuracy on 1-shot and 5-shot settings, respectively. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

Fingerprint Presentation Attack Detector Using Global-Local Model

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Haozhe Zhang, Wentian Liu, Feng Wu, Haoqian Shen, Linlin The Computer Vision Institute College of Computer Science and Software Engineering SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society The National Engineering Laboratory for Big Data System Computing Technology The Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China

The vulnerability of automated fingerprint recognition systems (AFRSs) to presentation attacks (PAs) promotes the vigorous development of PA detection (PAD) technology. However, PAD methods have been limited by information loss and poor generalization ability, resulting in new PA materials and fingerprint sensors. This paper thus proposes a global-local model-based PAD (RTK-PAD) method to overcome those limitations to some extent. The proposed method consists of three modules, called: 1) the global module;2) the local module;and 3) the rethinking module. By adopting the cut-out-based global module, a global spoofness score predicted from nonlocal features of the entire fingerprint images can be achieved. While by using the texture in-painting-based local module, a local spoofness score predicted from fingerprint patches is obtained. The two modules are not independent but connected through our proposed rethinking module by localizing two discriminative patches for the local module based on the global spoofness score. Finally, the fusion spoofness score by averaging the global and local spoofness scores is used for PAD. Our experimental results evaluated on LivDet 2017 show that the proposed RTK-PAD can achieve an average classification error (ACE) of 2.28% and a true detection rate (TDR) of 91.19% when the false detection rate (FDR) equals 1.0%, which significantly outperformed the state-of-the-art methods by ∼10% in terms of TDR (91.19% versus 80.74%). Copyright © 2024, The Authors. All rights reserved.

关键词： Supervised learning