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

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Kang Chen Ming Wen Haoxiang Jia Rongxin Wu Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology (HRUST) Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Hubei Key Laboratory of Distributed System Security Jin YinHu Laboratory Wuhan China School of Informatics Xiamen University Xiamen China School of Computer Science and Technology HUST Wuhan China Cluster and Grid Computing Lab

ISBN: (数字)9798350330663

ISBN: (纸本)9798350330670

Software systems often encounter various errors or exceptions in practice, and thus proper error handling code is essential to ensure the reliability of software systems. Unfortunately, error handling code is often bug-prone, while sufficiently testing them is challenging as such code often cannot be triggered under normal conditions. Motivated by this, recent studies have proposed to leverage software fault injection (SFI) based fuzzing to discover potential bugs in complicated error handling code. Despite the promising results achieved, their effectiveness and efficiency are still compromised in practice due to the huge search space of error sites, inadequate fuzzing guidance, and the overhead induced by context-sensitive SFI. To achieve effective and efficient testing of error handling code, this study presents AFL-FI, which first utilizes a similarity-based method to identify suspicious error sites, and then incorporates the idea of error site coverage to guide the fuzzing process. Finally, the design of lightweight context-sensitive SFI enables AFL-FI to execute test cases efficiently. We evaluate AFL-FI on eight large-scale open-source projects, and the results show that it can outperform existing state-of-the-art fuzzing tools significantly in terms of branch code coverage. More importantly, AFL-FI has discovered 13 previously unknown bugs, and all of them have been confirmed while 12 of them have been fixed. Besides, our evaluation also demonstrates that all the key designs of AFL- F I are effective that contribute significantly to its overall performance.

关键词： Codes Computer bugs Fuzzing Software systems Software reliability Testing

来源：评论

学校读者我要写书评

暂无评论

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Network for Segmenting Pathology Lesion of the Focal Lymphocytic Sialadenitis

M2CF-Net: A Multi-Resolution and Multi-Scale Cross Fusion Ne...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Hao Han Feng Lu Yanhan Deng Xiaofang Luo Hai Jin Wei Tu Xia Xie 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 Tongji Hospital Tongji Medical College Huazhong University of Science and Technology Wuhan China School of Computer Science and Technology Hainan University Haikou China

In the medical realm, the pivotal role of pathological Whole Slide Images (WSIs) in detecting cancer, tracking disease progression, and evaluating treatment efficacy is indisputable. Nevertheless, the identification and quantification of lesion areas in these gigapixel WSIs present a significant challenge due to their substantial size and the intricate details of lesions. To address these issues, we developed a novel multi-resolution and multi-scale cross fusion network (M 2 CF-Net), adept at managing large-scale pathological WSIs and capturing both fine details and context. Our model particularly focuses on segmenting local lymphocyte infiltration lesions in pathological WSIs of patients diagnosed with primary Sjogren's syndrome. By employing a patch-based training approach and combining interconnected elements via a multi-scale fusion technique, we enhance our model's capacity to detect and analyze structures and features in minor salivary gland section WSIs. Extensive experiments and ablation studies conducted on real-world clinical datasets affirm our model's superior accuracy in identifying lymphocyte-infiltrated regions over state-of-the-art models, with a performance improvement of up to 4.32% in terms of the Dice Similarity Coefficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EdgeDis: Enabling Fast, Economical, and Reliable Data Dissemination for Mobile Edge computing

arXiv

引用

arXiv 2023年

作者： Li, Bo He, Qiang Chen, Feifei Lyu, Lingjuan Bouguettaya, Athman Yang, Yun The College of Arts Business Law Education and Information Technology Victoria University MelbourneVIC3122 Australia The 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 Wuhan430074 China The Department of Computing Technologies Swinburne University of Technology MelbourneVIC3122 Australia The School of Information Technology Deakin University Geelong Australia SONY AI Inc. Tokyo108-0075 Japan The School of Computer Science University of Sydney CamperdownNSW2006 Australia

Mobile edge computing (MEC) enables web data caching in close geographic proximity to end users. Popular data can be cached on edge servers located less than hundreds of meters away from end users. This ensures bounded latency guarantees for various latency-sensitive web applications. However, transmitting a large volume of data out of the cloud onto many geographically-distributed web servers individually can be expensive. In addition, web content dissemination may be interrupted by various intentional and accidental events in the volatile MEC environment, which undermines dissemination efficiency and subsequently incurs extra transmission costs. To tackle the above challenges, we present a novel scheme named EdgeDis that coordinates data dissemination by distributed consensus among those servers. We analyze EdgeDis’s validity theoretically and evaluate its performance experimentally. Results demonstrate that compared with baseline and state-of-the-art schemes, EdgeDis: 1) is 5.97x - 7.52x faster;2) reduces dissemination costs by 48.21% to 91.87%;and 3) reduces performance loss caused by dissemination failures by up to 97.30% in time and 96.35% in costs. © 2023, CC BY-NC-SA.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Significant Engagement Community Search on Temporal Networks: Concepts and Algorithms

arXiv

引用

arXiv 2022年

作者： Zhang, Yifei Lin, Longlong Yuan, Pingpeng Jin, Hai 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 & Technology HuaZhong University of Science and Technology Luoyu Road 1037 Hubei Wuhan430074 China

Community search, retrieving the cohesive subgraph which contains the query vertex, has been widely touched over the past decades. The existing studies on community search mainly focus on static networks. However, real-world networks usually are temporal networks where each edge is associated with timestamps. The previous methods do not work when handling temporal networks. We study the problem of identifying the significant engagement community to which the user-specified query belongs. Specifically, given an integer k and a query vertex u, then we search for the subgraph H which satisfies (i) u ∈ H;(ii) the de-temporal graph of H is a connected k-core;(iii) In H that u has the maximum engagement level. To address our problem, we first develop a top-down greedy peeling algorithm named TDGP, which iteratively removes the vertices with the maximum temporal degree. To boost the efficiency, we then design a bottom-up local search algorithm named BULS and its enhanced versions BULS+ and BULS*. Lastly, we empirically show the superiority of our proposed solutions on six real-world temporal graphs. Copyright © 2022, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

FedMoS: Taming Client Drift in Federated Learning with Double Momentum and Adaptive Selection

FedMoS: Taming Client Drift in Federated Learning with Doubl...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Xiong Wang Yuxin Chen Yuqing Li Xiaofei Liao Hai Jin Bo Li 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 School of Cyber Science and Engineering Wuhan University Wuhan China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Federated learning (FL) enables massive clients to collab.ratively train a global model by aggregating their local updates without disclosing raw data. Communication has become one of the main bottlenecks that prolongs the training process, especially under large model variances due to skewed data distributions. Existing efforts mainly focus on either single momentum-based gradient descent, or random client selection for potential variance reduction, yet both often lead to poor model accuracy and system efficiency. In this paper, we propose FedMoS, a communication-efficient FL framework with coupled double momentum-based update and adaptive client selection, to jointly mitigate the intrinsic variance. Specifically, FedMoS maintains customized momentum buffers on both server and client sides, which track global and local update directions to alleviate the model discrepancy. Taking momentum results as input, we design an adaptive selection scheme to provide a proper client representation during FL aggregation. By optimally calibrating clients’ selection probabilities, we can effectively reduce the sampling variance, while ensuring unbiased aggregation. Through a rigid analysis, we show that FedMoS can attain the theoretically optimal ${{\mathcal{O}}}\left({{T^{ - 2/3}}}\right)$ convergence rate. Extensive experiments using real-world datasets further validate the superiority of FedMoS, with 58%-87% communication reduction for achieving the same target performance compared to state-of-the-art techniques.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Networks for Vulnerability Detection: A Counterfactual Explanation

arXiv

引用

arXiv 2024年

作者： Chu, Zhaoyang Wan, Yao Li, Qian Wu, Yang Zhang, Hongyu Sui, Yulei Xu, Guandong Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology China School of Electrical Engineering Computing and Mathematical Sciences Curtin University Australia School of Big Data and Software Engineering Chongqing University China School of Computer Science and Engineering University of New South Wales Australia School of Computer Science University of Technology Sydney Australia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

Vulnerability detection is crucial for ensuring the security and reliability of software systems. Recently, Graph Neural Networks (GNNs) have emerged as a prominent code embedding approach for vulnerability detection, owing to their ability to capture the underlying semantic structure of source code. However, GNNs face significant challenges in explainability due to their inherently black-box nature. To this end, several factual reasoning-based explainers have been proposed. These explainers provide explanations for the predictions made by GNNs by analyzing the key features that contribute to the outcomes. We argue that these factual reasoning-based explanations cannot answer critical what-if questions: "What would happen to the GNN's decision if we were to alter the code graph into alternative structures?" Inspired by advancements of counterfactual reasoning in artificial intelligence, we propose CFExplainer, a novel counterfactual explainer for GNN-based vulnerability detection. Unlike factual reasoning-based explainers, CFExplainer seeks the minimal perturbation to the input code graph that leads to a change in the prediction, thereby addressing the what-if questions for vulnerability detection. We term this perturbation a counterfactual explanation, which can pinpoint the root causes of the detected vulnerability and furnish valuable insights for developers to undertake appropriate actions for fixing the vulnerability. Extensive experiments on four GNN-based vulnerability detection models demonstrate the effectiveness of CFExplainer over existing state-of-the-art factual reasoning-based explainers. © 2024, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

LOPO: An Out-of-order Layer Pulling Orchestration Strategy for Fast Microservice Startup

LOPO: An Out-of-order Layer Pulling Orchestration Strategy f...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Lin Gu Junhao Huang Shaoxing Huang Deze Zeng Bo Li 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 School of Computer Science China University of Geosciences Wuhan China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Container based microservices have been widely applied to promote the cloud elasticity. The mainstream Docker containers are structured in layers, which are organized in stack with bottom-up dependency. To start a microservice, the required layers are pulled from a remote registry and stored on its host server, following the layer dependency order. This incurs long microservice startup time and hinders the performance efficiency. In this paper, we discover that, for the first time, the layer pulling order can be adjusted to accelerate the microservice startup. Specifically, we address the problem on microservice layer pulling orchestration for startup time minimization and prove it as NP-hard. We propose a Longest-chain based Out-of-order layer Pulling Orchestration (LOPO) strategy with low computational complexity and guaranteed approximation ratio. Through extensive real-world trace driven experiments, we verify the efficiency of our LOPO and demonstrate that it reduces the microservice startup time by 22.71% on average in comparison with state-of-the-art solutions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Breaking Barriers in Physical-World Adversarial Examples: Improving Robustness and Transferability via Robust Feature

arXiv

引用

arXiv 2024年

作者： Wang, Yichen Chou, Yuxuan Zhou, Ziqi Zhang, Hangtao Wan, Wei Hu, Shengshan Li, Minghui National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab China Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of School of Software Engineering Huazhong University of Science and Technology China

As deep neural networks (DNNs) are widely applied in the physical world, many researches are focusing on physical-world adversarial examples (PAEs), which introduce perturbations to inputs and cause the model’s incorrect outputs. However, existing PAEs face two challenges: unsatisfactory attack performance (i.e., poor transferability and insufficient robustness to environment conditions), and difficulty in balancing attack effectiveness with stealthiness, where better attack effectiveness often makes PAEs more perceptible. In this paper, we explore a novel perturbation-based method to overcome the challenges. For the first challenge, we introduce a strategy Deceptive RF injection based on robust features (RFs) that are predictive, robust to perturbations, and consistent across different models. Specifically, it improves the transferability and robustness of PAEs by covering RFs of other classes onto the predictive features in clean images. For the second challenge, we introduce another strategy Adversarial Semantic Pattern Minimization, which removes most perturbations and retains only essential adversarial patterns in AEs. Based on the two strategies, we design our method Robust Feature Coverage Attack (RFCoA), comprising Robust Feature Disentanglement and Adversarial Feature Fusion. In the first stage, we extract target class RFs in feature space. In the second stage, we use attention-based feature fusion to overlay these RFs onto predictive features of clean images and remove unnecessary perturbations. Experiments show our method’s superior transferability, robustness, and stealthiness compared to existing state-of-the-art methods. Additionally, our method’s effectiveness can extend to Large Vision-Language Models (LVLMs), indicating its potential applicability to more complex tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

When the Metaverse Meets Carbon Neutrality: Ongoing Efforts and Directions

arXiv

引用

arXiv 2023年

作者： Liu, Fangming Pei, Qiangyu Chen, Shutong Yuan, Yongjie Wang, Lin Mühlhäuser, Max Huazhong University of Science and Technology Peng Cheng Laboratory China The National Engineering Research Center for Big Data Technology and System The Services Computing Technology and System Lab Cluster and Grid Computing Lab The School of Computer Science and Technology Huazhong University of Science and Technology 1037 Luoyu Road Wuhan430074 China VU Amsterdam Netherlands TU Darmstadt Germany The Telecooperation Lab TU Darmstadt Germany

The metaverse has recently gained increasing attention from the public. It builds up a virtual world where we can live as a new role regardless of the role we play in the physical world. However, building and operating this virtual world will generate an extraordinary amount of carbon emissions for computing, communicating, displaying, and so on. This inevitably hinders the realization of carbon neutrality as a priority of our society, adding heavy burden to our earth. In this survey, we first present a green viewpoint of the metaverse by investigating the carbon issues in its three core layers, namely the infrastructure layer, the interaction layer, and the economy layer, and estimate their carbon footprints in the near future. Next, we analyze a range of current and emerging applicable green techniques for the purpose of reducing energy usage and carbon emissions of the metaverse, and discuss their limitations in supporting metaverse workloads. Then, in view of these limitations, we discuss important implications and bring forth several insights and future directions to make each metaverse layer greener. After that, we investigate green solutions from the governance perspective, including both public policies in the physical world and regulation of users in the virtual world, and propose an indicator Carbon Utility (CU) to quantify the service quality brought by an user activity per unit of carbon emissions. Finally, we identify an issue for the metaverse as a whole and summarize three directions: (1) a comprehensive consideration of necessary performance metrics, (2) a comprehensive consideration of involved layers and multiple internal components, and (3) a new assessing, recording, and regulating mechanism on carbon footprints of user activities. Our proposed quantitative indicator CU would be helpful in regulating user activities in the metaverse world. Copyright © 2023, The Authors. All rights reserved.

关键词： Carbon footprint

来源：评论

学校读者我要写书评

暂无评论

Effective Concurrency Testing for Go via Directional Primitive-Constrained Interleaving Exploration

Effective Concurrency Testing for Go via Directional Primiti...

引用

IEEE International Conference on Automated Software Engineering (ASE)

作者： Zongze Jiang Ming Wen Yixin Yang Chao Peng Ping Yang 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 ByteDance Beijing China School of Computer Science and Technology Huazhong University of Science and Technology China

The Go language (Go/Golang) has been attracting increasing attention from the industry over recent years due to its strong concurrency support and ease of deployment. This programming language encourages developers to use channel-based concurrency, which simplifies the development of concurrent programs. Unfortunately, it also introduces new concurrency problems that differ from those caused by the mechanism of shared memory concurrency. However, there are only few works that aim to detect such Go-specific concurrency issues. Even state-of-the-art testing tools will miss critical concurrent bugs that require fine-grained and effective interleaving exploration. This paper presents GoPie, a novel testing approach for detecting Go concurrency bugs through primitive-constrained interleaving exploration. GoPie utilizes execution histories to identify new interleavings instead of relying on exhaustive exploration or random scheduling. To evaluate its performance, we applied GoPie to existing benchmarks and large-scale open-source projects. Results show that GoPie can effectively explore concurrent interleavings and detect significantly more bugs in the benchmark. Furthermore, it uncovered 11 unique previously unknown concurrent bugs, and 9 of which have been confirmed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：