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

λGrapher: A Resource-Efficient Serverless system for GNN Serving through Graph Sharing 24

学校读者我要写书评

暂无评论

λGrapher: A Resource-Efficient Serverless System for GNN Se...

33rd ACM Web Conference, WWW 2024

作者： Hu, Haichuan Liu, Fangming Pei, Qiangyu Yuan, Yongjie Xu, Zichen Wang, Lin National Engineering Research Center for Big Data Technology and System The Services Computing Technology and System Lab Cluster and Grid Computing Lab in the School of Computer Science and Technology Huazhong University of Science and Technology 1037 Luoyu Road Wuhan China Peng Cheng Laboratory Huazhong University of Science and Technology China School of Mathematics and Computer Science Nanchang University China Paderborn University Paderborn Germany

ISBN: (纸本)9798400701719

Graph Neural Networks (GNNs) have been increasingly adopted for graph analysis in web applications such as social networks. Yet, efficient GNN serving remains a critical challenge due to high workload fluctuations and intricate GNN operations. Serverless computing, thanks to its flexibility and agility, offers on-demand serving of GNN inference requests. Alas, the request-centric serverless model is still too coarse-grained to avoid resource waste. Observing the significant data locality in computation graphs of requests, we propose λGrapher, a serverless system for GNN serving that achieves resource efficiency through graph sharing and fine-grained resource allocation. "Grapher features the following designs: (1) adaptive timeout for request buffering to balance resource efficiency and inference latency, (2) graph-centric scheduling to minimize computation and memory redundancy, and (3) resource-centric function management with fine-grained resource allocation catered to the resource sensitivities of GNN operations and function orchestration optimized to hide communication latency. We implement a prototype of λGrapher based on the representative open-source serverless platform Knative and evaluate it with real-world traces from various web applications. Our results show that λGrapher can achieve an average savings of 61.5% in memory resource and 47.2% in computing resource compared with the state of the arts while ensuring GNN inference latency. © 2024 ACM.

关键词： Efficiency

RSP-gcForest: A Distributed Deep Forest via Random Sample Partition

学校读者我要写书评

暂无评论

RSP-gcForest: A Distributed Deep Forest via Random Sample Pa...

IEEE International Conference on big data

作者： Mark Junjie Li Wenzhu Cai Yigang Lin Sunjie Huang Joshua Zhexue Huang Patrick Xiaogang Peng College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Shenzhen Academy of Inspection and Quarantine

Deep Forest, a powerful alternative to deep neural networks, has gained much attention due to its advantages, such as low complexity, minimal hyperparameter requirements, and strong application performance. In the current big data environment, where data volumes and model complexities are growing rapidly, distributed computing is needed to increase computational efficiency. Recently, a distributed deep forest approach, called BLB-gcForest (Bag of Little Bootstraps-gcForest), has been successful in reducing training instances within cascade forests, combining BLB and granularity segmentation, thus improving the computational efficiency and scalability of distributed deep forests. However, it still transmits the entire data set between layers and requires double sampling with BLB, limiting the amount of data and the scalability of resource utilization. This paper introduces a novel algorithm, RSP-gcForest, based on Random Sample Partition (RSP) to improve distributed deep forests computational efficiency and scalability. RSP-gcForest uses block-level samples that replace the full dataset, significantly reducing interlayer instance transmission and prediction within cascade forests. Additionally, RSP blocks are integrated with the segmentation granularity of cascade forests for ensemble learning, effectively addressing computational efficiency and resource constraints. We conducted experiments on four extensive datasets using Spark and evaluated performance across five key metrics. The results clearly show that RSP-gcForest, while maintaining high classification quality, surpasses state-of-the-art methods in terms of computational efficiency and resource utilization. Furthermore, it achieves superior load balancing, demonstrating its potential as a powerful tool in big data and distributed computing.

关键词：

A dual-polarized zhe-shaped conformal patch antenna for 5G millimeter-wave applications 4

学校读者我要写书评

暂无评论

A dual-polarized zhe-shaped conformal patch antenna for 5G m...

4th IEEE International Conference on Electronic Information and Communication technology, ICEICT 2021

作者： Yang, Baifa Huang, Haixuan Feng, Botao Deng, Li College of Electronics and Information Engineering Shenzhen University Shenzhen518060 China College of Big Data and Internet Shenzhen Technology University Shenzhen518118 China College of Electronics and Information Engineering Shenzhen University Shenzhen518060 China Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications Beijing100876 China

ISBN: (纸本)9781665432030

We propose a dual-polarized conformal Zhe-shaped patch antenna that is suitable for future millimeter wave (mmW) applications. The proposed antenna is composed of 3 different layers. A Zhe-shaped (喆) patch is printed on the upper surface of the top dielectric layer. In order to excite the Zhe-shaped radiating patch, two feeding networks are designed in the other two layers. The simulation result shows that a frequency bandwidth of 10.5% (24.75-27.5 GHz) and a good isolation performance ( © 2021 IEEE

关键词： Microstrip antennas

Question-Answer Cross Language Image Matching for Weakly Supervised Semantic Segmentation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Deng, Songhe Zhuo, Wei Xie, Jinheng Shen, Linlin Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

Class Activation Map (CAM) has emerged as a popular tool for weakly supervised semantic segmentation (WSSS), allowing the localization of object regions in an image using only image-level labels. However, existing CAM methods suffer from under-activation of target object regions and false-activation of background regions due to the fact that a lack of detailed supervision can hinder the model’s ability to understand the image as a whole. In this paper, we propose a novel Question-Answer Cross-Language-Image Matching framework for WSSS (QA-CLIMS), leveraging the vision-language foundation model to maximize the text-based understanding of images and guide the generation of activation maps. First, a series of carefully designed questions are posed to the VQA (Visual Question Answering) model with Question-Answer Prompt engineering (QAPE) to generate a corpus of both foreground target objects and backgrounds that are adaptive to query images. We then employ contrastive learning in a Region Image Text Contrastive (RITC) network to compare the obtained foreground and background regions with the generated corpus. Our approach exploits the rich textual information from the open vocabulary as additional supervision, enabling the model to generate high-quality CAMs with a more complete object region and reduce false-activation of background regions. We conduct extensive analysis to validate the proposed method and show that our approach performs state-of-the-art on both PASCAL VOC 2012 and MS COCO datasets. Code is available at: https://***/CVI-SZU/QA-CLIMS Copyright © 2024, The Authors. All rights reserved.

关键词： Chemical activation

A Viewport Prediction Framework for Panoramic Videos

学校读者我要写书评

暂无评论

A Viewport Prediction Framework for Panoramic Videos

International Joint Conference on Neural Networks (IJCNN)

作者： Jinting Tang Yongkai Huo Shaoshi Yang Jianmin Jiang National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

Panoramic video is considered to be an attractive video format, since it provides the viewers with an immersive experience, such as virtual reality (VR) gaming. However, the viewers only focus on part of panoramic video, which is referred to as viewport. Hence, the resources consumed for distributing the remaining part of the panoramic video are wasted. It is intuitive to only deliver the video data within this viewport for reducing the distribution cost. Empirically, viewports within a time interval are highly correlated, hence the historical trajectory may be used for predicting the future viewports. On the other hand, a viewer tends to sustain attention on a specific object in a panoramic video. Motivated by these findings, we propose a deep learning-based viewport Prediction scheme, namely HOP, where the Historical viewport trajectory of viewers and Object tracking are jointly exploited by the long short-term memory (LSTM) networks. Additionally, our solution is capable of predicting multiple future viewports, while a single viewport prediction was supported by the state-of-the-art contributions. Simulation results show that our proposed HOP scheme outperforms the benchmarkers by up to 33.5% in terms of the prediction error.

关键词： Trajectory Videos Bandwidth Object tracking Computer architecture Resists Virtual reality

DeepGATGO: A Hierarchical Pretraining-Based Graph-Attention Model for Automatic Protein Function Prediction

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Li, Zihao Jiang, Changkun Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Lab for Big Data System Computing Technology Shenzhen University Shenzhen China

Automatic protein function prediction (AFP) is classified as a large-scale multi-label classification problem aimed at automating protein enrichment analysis to eliminate the current reliance on labor-intensive wet-lab methods. Currently, popular methods primarily combine protein-related information and Gene Ontology (GO) terms to generate final functional predictions. For example, protein sequences, structural information, and protein-protein interaction networks are integrated as prior knowledge to fuse with GO term embeddings and generate the ultimate prediction results. However, these methods are limited by the difficulty in obtaining structural information or network topology information, as well as the accuracy of such data. Therefore, more and more methods that only use protein sequences for protein function prediction have been proposed, which is a more reliable and computationally cheaper approach. However, the existing methods fail to fully extract feature information from protein sequences or label data because they do not adequately consider the intrinsic characteristics of the data itself. Therefore, we propose a sequence-based hierarchical prediction method, DeepGATGO, which processes protein sequences and GO term labels hierarchically, and utilizes graph attention networks (GATs) and contrastive learning for protein function prediction. Specifically, we compute embeddings of the sequence and label data using pre-trained models to reduce computational costs and improve the embedding accuracy. Then, we use GATs to dynamically extract the structural information of non-Euclidean data, and learn general features of the label dataset with contrastive learning by constructing positive and negative example samples. Experimental results demonstrate that our proposed model is no longer limited to specific biological populations and exhibits better scalability in GO term enrichment analysis on large-scale datasets. Copyright © 2023, The Authors. All rights reser

关键词： Gene Ontology

CALPA-NET: Channel-pruning-assisted deep residual network for steganalysis of digital images

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Tan, Shunquan Wu, Weilong Shao, Zilong Li, Qiushi Li, Bin Huang, Jiwu College of Computer Science and Software Engineering Shenzhen University College of Electronic and Information Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen 518060 China

Over the past few years, detection performance improvements of deep-learning based steganalyzers have been usually achieved through structure expansion. However, excessive expanded structure results in huge computational cost, storage overheads, and consequently difficulty in training and deployment. In this paper we propose CALPA-NET, a ChAnneL-Pruning-Assisted deep residual network architecture search approach to shrink the network structure of existing vast, over-parameterized deep-learning based steganalyzers. By providing theoretical rationale, we demonstrate that the broad inverted-pyramid structure of existing deep-learning based steganalyzers contradicts the well-established model diversity oriented philosophy and is not suitable for steganalysis. Then a hybrid criterion combined with two network pruning schemes is introduced to adaptively shrink every involved convolutional layer in a data-driven manner. The resulting network architecture presents a slender bottleneck-like structure. We have conducted extensive experiments on BOSSBase+BOWS2 dataset and even a large-scale subset extracted from ImageNet CLS-LOC dataset. The experimental results show that the model structure generated by our proposed CALPA-NET can achieve comparative detection performance with less than two percent of parameters and about one third FLOPs compared to the original steganalytic model. The new model possesses even better adaptivity, transferability, and scalability. Copyright © 2019, The Authors. All rights reserved.

关键词： Steganography

A zero-shot based fingerprint presentation attack detection system

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Haozhe Zhang, Wentian Liu, Guojie Liu, Feng National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of IntelligentInformation Processing College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

With the development of presentation attacks, Automated Fingerprint Recognition systems(AFRSs) are vulnerable to presentation attack. Thus, numerous methods of presentation attack detection(PAD) have been proposed to ensure the normal utilization of AFRS. However, the demand of large-scale presentation attack images and the low-level generalization ability always astrict existing PAD methods' actual performances. Therefore, we propose a novel Zero-Shot Presentation Attack Detection Model to guarantee the generalization of the PAD model. The proposed ZSPAD-Model based on generative model does not utilize any negative samples in the process of establishment, which ensures the robustness for various types or materials based presentation attack. Different from other auto-encoder based model, the Fine-grained Map architecture is proposed to refine the reconstruction error of the auto-encoder networks and a task-specific gaussian model is utilized to improve the quality of clustering. Meanwhile, in order to improve the performance of the proposed model, 9 confidence scores are discussed in this article. Experimental results showed that the ZSPAD-Model is the state of the art for ZSPAD, and the MS-Score is the best confidence score. Compared with existing methods, the proposed ZSPAD-Model performs better than the feature-based method and under the multi-shot setting, the proposed method overperforms the learning based method with little training data. When large training data is available, their results are similar. Copyright © 2020, The Authors. All rights reserved.

关键词： Palmprint recognition

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities 24

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detecto...

44th ACM/IEEE International Conference on Software engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software