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

Container lifecycle-aware scheduling for serverless computing

学校读者我要写书评

暂无评论

Container lifecycle-aware scheduling for serverless computin...

作者： Wu, Song Tao, Zhiheng Fan, Hao Huang, Zhuo Zhang, Xinmin Jin, Hai Yu, Chen Cao, Chun 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 State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Elastic scaling in response to changes on demand is a main benefit of serverless computing. When bursty workloads arrive, a serverless platform launches many new containers and initializes function environments (known as cold starts), which incurs significant startup latency. To reduce cold starts, platforms usually pause a container after it serves a request, and reuse this container for subsequent requests. However, this reuse strategy cannot efficiently reduce cold starts because the schedulers are agnostic of container lifecycle. For example, it may ignore soon available containers or evict soon needed containers. We propose a container lifecycle-aware scheduling strategy for serverless computing, CAS. The key idea is to control distribution of requests and determine creation or eviction of containers according to different lifecycle phases of containers. We implement a prototype of CAS on OpenWhisk. Our evaluation shows that CAS reduces 81% cold starts and therefore brings a 63% reduction at 95th percentile latency compared with native scheduling strategy in OpenWhisk when there is worker contention between workloads, and does not add significant performance overhead. © 2021 John Wiley & Sons Ltd.

关键词： Containers

LECF: recommendation via learnable edge collaborative filtering

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2022年第1期65卷 116-130页

作者： Shitao XIAO Yingxia SHAO Yawen LI Hongzhi YIN Yanyan SHEN Bin CUI School of Computer Science (National Pilot Software Engineering School) Beijing University of Posts and Telecommunications Beijing Key Lab of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications School of Information Technology and Electrical Engineering The University of Queensland Department of Computer Science and Engineering Shanghai Jiao Tong University Department of Computer Science and Technology Peking University National Engineering Laboratory for Big Data Analysis and Applications Peking University

The core of recommendation models is estimating the probability that a user will like an item based on historical interactions. Existing collaborative filtering(CF) algorithms compute the likelihood by utilizing simple relationships between objects, e.g., user-item, item-item, or user-user. They always rely on a single type of object-object relationship, ignoring other useful relationship information in data. In this paper, we model an interaction between user and item as an edge and propose a novel CF framework, called learnable edge collaborative filtering(LECF). LECF predicts the existence probability of an edge based on the connections among edges and is able to capture the complex relationship in data. Specifically, we first adopt the concept of line graph where each node represents an interaction edge; then calculate a weighted sum of similarity between the query edge and the observed edges(i.e., historical interactions) that are selected from the neighborhood of query edge in the line graph for a recommendation. In addition, we design an efficient propagation algorithm to speed up the training and inference of LECF. Extensive experiments on four public datasets demonstrate LECF can achieve better performance than the state-of-the-art methods.

关键词： collaborative filtering recommender system implicit feedback edge-edge similarity line graph

Deep Feature Surgery: Towards Accurate and Efficient Multi-Exit Networks

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Gong, Cheng Chen, Yao Luo, Qiuyang Lu, Ye Li, Tao Zhang, Yuzhi Sun, Yufei Zhang, Le College of Software Nankai University China College of Computer Science Nankai University China National University of Singapore Singapore School of Information and Communication Engineering University of Electronic Science and Technology of China China HAIHE Lab of ITAI China Tianjin Key Laboratory of Network and Data Security Technology China Key Laboratory of Data and Intelligent System Security Ministry of Education

Multi-exit network is a promising architecture for efficient model inference by sharing backbone networks and weights among multiple exits. However, the gradient conflict of the shared weights results in sub-optimal accuracy. This paper introduces Deep Feature Surgery (DFS), which consists of feature partitioning and feature referencing approaches to resolve gradient conflict issues during the training of multi-exit networks. The feature partitioning separates shared features along the depth axis among all exits to alleviate gradient conflict while simultaneously promoting joint optimization for each exit. Subsequently, feature referencing enhances multi-scale features for distinct exits across varying depths to improve the model accuracy. Furthermore, DFS reduces the training operations with the reduced complexity of backpropagation. Experimental results on Cifar100 and ImageNet datasets exhibit that DFS provides up to a 50.00% reduction in training time and attains up to a 6.94% enhancement in accuracy when contrasted with baseline methods across diverse models and tasks. Budgeted batch classification evaluation on MSDNet demonstrates that DFS uses about 2× fewer average FLOPs per image to achieve the same classification accuracy as baseline methods on Cifar100. The code is available at https: //***/GongCheng1919/dfs. Copyright © 2024, The Authors. All rights reserved.

关键词： Budget control

Prompt Learning on Temporal Interaction Graphs

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Xi Zhang, Siwei Xiong, Yun Wu, Xixi Zhang, Jiawei Sun, Xiangguo Zhang, Yao Zhao, Feng Kang, Yulin Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai China IFM Lab Department of Computer Science University of California DavisCA United States Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Ant Group Shanghai Hangzhou China

Temporal Interaction Graphs (TIGs) are widely utilized to represent real-world systems, such as e-commerce and social networks. To facilitate representation learning on TIGs, researchers have proposed a series of TIG models. However, these models are still facing two tough gaps between the pre-training and downstream predictions in their "pre-train, predict" training paradigm. First, there is a temporal gap that exhibits limited accommodation ability to their timely predictions. This shortcoming severely undermines their applicability in distant future predictions on the dynamically evolving TIG data. Second, there is a semantic gap due to the lack of versatility in these pre-trained models to effectively cater to diverse downstream tasks. This hinders their practical applications, as they struggle to align with their learning and prediction capabilities across various application scenarios. Recently, the "pre-train, prompt" paradigm has emerged as a lightweight mechanism for model generalization. Therefore, applying this paradigm within TIGs is a potential solution to solve the aforementioned challenges. However, the adaptation of this paradigm to TIGs is not straightforward. The prevalent application of prompting in static graph contexts falls short in temporal settings due to a lack of consideration for time-sensitive dynamics and a deficiency in expressive power. To address this issue, we introduce Temporal Interaction Graph Prompting (TIGPrompt), a versatile framework that seamlessly integrates with existing TIG models, bridging both the temporal and semantic gaps mentioned above. In detail, we propose a temporal prompt generator to offer temporally-aware prompts for different tasks. These prompts stand out for their minimalistic design, relying solely on the fine-tuning of the prompt generator with very little supervision data, which is extremely efficient. To cater to varying computational resource demands, we propose an extended "pre-train, prompt-based fine

关键词： Forecasting

Detecting JVM JIT Compiler Bugs via Exploring Two-Dimensional Input Spaces

学校读者我要写书评

暂无评论

Detecting JVM JIT Compiler Bugs via Exploring Two-Dimensiona...

International Conference on Software engineering (ICSE)

作者： Haoxiang Jia Ming Wen Zifan Xie Xiaochen Guo Rongxin Wu Maolin Sun Kang Chen Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Services Computing Technology and System Lab Cluster and Grid Computing Lab. Hubei Engineering Research Center on Big Data Security National Engineering Research Center for Big Data Technology and System School of Informatics Xiamen University China School of Computer Science and Technology Huazhong University of Science and Technology China

Java Virtual Machine (JVM) is the fundamental software system that supports the interpretation and execution of Java bytecode. To support the surging performance demands for the increasingly complex and large-scale Java programs, Just-In-Time (JIT) compiler was proposed to perform sophisticated runtime optimization. However, this inevitably induces various bugs, which are becoming more pervasive over the decades and can often cause significant consequences. To facilitate the design of effective and efficient testing techniques to detect JIT compiler bugs. This study first performs a preliminary study aiming to understand the characteristics of JIT compiler bugs and the corresponding triggering test cases. Inspired by the empirical findings, we propose JOpFuzzer, a new JVM testing approach with a specific focus on JIT compiler bugs. The main novelty of JOpFuzzer is embodied in three aspects. First, besides generating new seeds, JOpFuzzer also searches for diverse configurations along the new dimension of optimization options. Second, JOpFuzzer learns the correlations between various code features and different optimization options to guide the process of seed mutation and option exploration. Third, it leverages the profile data, which can reveal the program execution information, to guide the fuzzing process. Such nov-elties enable JOpFuzzer to effectively and efficiently explore the two-dimensional input spaces. Extensive evaluation shows that JOpFuzzer outperforms the state-of-the-art approaches in terms of the achieved code coverages. More importantly, it has detected 41 bugs in OpenJDK, and 25 of them have already been confirmed or fixed by the corresponding developers.

关键词：

VULSEYE: Detect Smart Contract Vulnerabilities via Stateful Directed Graybox Fuzzing

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liang, Ruichao Chen, Jing Wu, Cong He, Kun Wu, Yueming Cao, Ruochen Du, Ruiying Liu, Yang Zhao, Ziming Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan430072 China Cyber Security Lab College of Computing and Data Science Nanyang Technological University Singapore Department of Computer Science and Engineering University at Buffalo New York United States

Smart contracts, the cornerstone of decentralized applications, have become increasingly prominent in revolutionizing the digital landscape. However, vulnerabilities in smart contracts pose great risks to user assets and undermine overall trust in decentralized systems. Fuzzing, a prominent security testing technique, is extensively explored to detect vulnerabilities. But current smart contract fuzzers fall short of expectations in testing efficiency for two primary reasons. Firstly, smart contracts are stateful programs, and existing approaches, primarily coverage-guided, lack effective feedback from the contract state. Consequently, they struggle to effectively explore the contract state space. Secondly, coverage-guided fuzzers, aiming for comprehensive program coverage, may lead to a wastage of testing resources on benign code areas. This wastage worsens in smart contract testing, as the mix of code and state spaces further complicates comprehensive testing. To address these challenges, we propose VULSEYE, a stateful directed graybox fuzzer for smart contracts guided by vulnerabilities. Different from prior works, VULSEYE achieves stateful directed fuzzing by prioritizing testing resources to code areas and contract states that are more prone to vulnerabilities. We introduce Code Targets and State Targets into fuzzing loops as the testing targets of VULSEYE. We use static analysis and pattern matching to pinpoint Code Targets, and propose a scalable backward analysis algorithm to specify State Targets. We design a novel fitness metric that leverages feedback from both the contract code space and state space, directing fuzzing toward these targets. With the guidance of code and state targets, VULSEYE alleviates the wastage of testing resources on benign code areas and achieves effective stateful fuzzing. In comparison with state-of-the-art fuzzers, VULSEYE demonstrated superior effectiveness and efficiency. Notably, it uncovered 4,845 vulnerabilities in 42,738 rea

关键词： Software testing

DRAG: Dynamic Region-Aware GCN for Privacy-Leaking Image Detection

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Yang, Guang Cao, Juan Sheng, Qiang Qi, Peng Li, Xirong Li, Jintao Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China China

The daily practice of sharing images on social media raises a severe issue about privacy leakage. To address the issue, privacy-leaking image detection is studied recently, with the goal to automatically identify images that may leak privacy. Recent advance on this task benefits from focusing on crucial objects via pretrained object detectors and modeling their correlation. However, these methods have two limitations: 1) they neglect other important elements like scenes, textures, and objects beyond the capacity of pretrained object detectors;2) the correlation among objects is fixed, but a fixed correlation is not appropriate for all the images. To overcome the limitations, we propose the Dynamic Region-Aware Graph Convolutional Network (DRAG) that dynamically finds out crucial regions including objects and other important elements, and models their correlation adaptively for each input image. To find out crucial regions, we cluster spatially-correlated feature channels into several region-aware feature maps. Further, we dynamically model the correlation with the self-attention mechanism and explore the interaction among the regions with a graph convolutional network. The DRAG achieved an accuracy of 87% on the largest dataset for privacy-leaking image detection, which is 10 percentage points higher than the state of the art. The further case study demonstrates that it found out crucial regions containing not only objects but other important elements like textures. The code and more details are in https://***/guang-yanng/DRAG. © 2022, CC BY.

关键词： Object detection

EABC: Energy-aware Centrality-based Caching for Named data Networking in the IoT

学校读者我要写书评

暂无评论

EABC: Energy-aware Centrality-based Caching for Named Data N...

IEEE International Symposium on World of Wireless Mobile and Multimedia Networks (WoWMoM)

作者： Xingyun He Hu Liu Wuyungerile Li Alvin Valera Winston K.G. Seah Inner Mongolia Key Lab. of Wireless Networking & Mobile Computing Engineering Research Center of Ecological Big Data Ministry of Education School of Computer Science Inner Mongolia University Hohhot China Wireless Networks Research Group School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

ISBN: (数字)9798350394665

ISBN: (纸本)9798350394672

Named data Networking (NDN) is an information-centric internet architecture that delivers packets based on the name of the content in the packet. A key component of NDN is the caching strategy designed to reduce total network latency and load on content producers. To improve the speed and reliability of web content delivery, existing caching strategies typically cache content on a large number of intermediate nodes, which incur significant energy consumption and memory overhead. However, in Internet of Things (IoT) scenarios, memory and energy of nodes are scarce resources. Therefore, in NDN-based IoT applications, traditional caching strategies can cause node failures due to energy depletion, which can significantly reduce the network operational lifetime as well as create problems that caching is supposed to solve. In this paper, a caching strategy based on node centrality and energy availability, called Energy-aware Approximate Betweenness Centrality (EABC) is proposed for NDN-based IoT. EABC uses a topology-based heuristic to cache data content on nodes with high centrality and makes caching decisions based on the remaining energy of the nodes. We evaluate EABC using simulations based on ndnSIM in different topologies and compare it with several existing NDN caching strategies. The results show that EABC performs better in different types of network topologies, reduces the average transmission delay of data and balances the energy consumption of highly central nodes, thus extending the network lifetime.

关键词： Wireless communication Energy consumption Network topology Memory management Topology Delays Internet of Things

Wideband polarization reconfigurable antenna based on double C-shaped radiators

学校读者我要写书评

暂无评论

Wideband polarization reconfigurable antenna based on double...

2022 International Applied Computational Electromagnetics Society Symposium, ACES-China 2022

作者： Liang, Weilong Li, Long Wu, Zhao Huang, Yanhu Ma, Qingxiu Liang, Jiajun Nanjing Research Institute of Electronics Technology Nanjing210000 China Yulin Normal University School of Physics and Telecommunication Engineering Yulin537000 China Guangxi Colleges Universities Key Lab of Complex System Optimization and Big Data Processing Yulin Normal University Yulin537000 China

ISBN: (纸本)9781665452366

An enhancing bandwidth tri-polarization reconfigurable antenna based on double C-shaped radiators is proposed. The antenna consists of a modified ground plane, double C-shaped radiators, and a feedline with a simple parasitic stub. The modified ground plane and the parasitic stub can improve the impedance matching, meanwhile, adjust the axial ratio performance. Two PIN diodes are embedded between the C-shaped radiator and the feedline. Three polarization reconfigurable modes can be achieved caused by switching two PIN diodes state, linear polarization (LP), left-hand circular polarization (LHCP), and right-hand circular polarization (RHCP). As the simulated results show, the -10-dB impedance bandwidth reaches 126.6% (1.76-7.83 GHz) in LP mode and 78.4% (2.96-6.78 GHz) in CP modes. And the proposed antenna has a 3-dB axial ratio (AR) bandwidth of 84% (2.6-6.4 GHz) in two CP modes. Therefore, the proposed antenna can meet the requirement of the modern wireless and satellite communication system. © 2022 IEEE.

关键词： Radiators