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

International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)

作者： Shuo Huang Zhiyuan Wang Wenhao Lu Kai Shen Jiayi Zhang Shan Zhang Hongbin Luo School of Computer Science and Engineering Beihang University Beijing China Zhongguancun Laboratory Beijing China State Key Laboratory of Virtual Reality Technology and Systems Beijing China State Key Laboratory of Software Development Environment Beijing China

ISBN: (数字)9783903176652

ISBN: (纸本)9798331508722

Low-earth-orbit satellite constellation (e.g., Starlink) is becoming the indispensable component of future Internet. Due to the mobility nature, ground-satellite links (GSLs) and inter-satellite links (ISLs) are not as stable as the fiber links of wired Internet. Consequently, end-to-end TCP connections traversing the LEO constellation will suffer from packet loss and latency variation caused by GSL handover and ISL failure. However, typical congestion control algorithms (e.g., loss-based CUBIC and bandwidth-estimated BBR) rely on these feedbacks to detect congestion in wired Internet. This leads to performance degradation for CUBIC/BBR in LEO satellite networks. In this paper, we propose a Default-and-Backup Routing (DB-R) mechanism to enhance the performance of CUBIC/BBR in LEO satellite networks. Specifically, DB-R leverages default routing to address the packet loss caused by frequent GSL handover. Moreover, DB- R utilizes backup routing to eliminate the packet loss caused by occasional ISL failure. Overall, DB-R only incurs negligible control overhead, but can effectively improve the performance of CUBIC and BBR in LEO satellite networks. We implement DB-R in Linux kernel and evaluate its performance based on OpenSN (i.e., an open-source libarary for emulating LEO satellite networks). Results show that our DB-R mechanism can improve the average throughput of CUBIC (and BBR, respectively) by up to 37 % (and 18 %, respectively) compared with classic OSPF.

关键词： Satellites Linux Wireless networks Low earth orbit satellites Packet loss Handover Routing Throughput Internet Kernel

来源：评论

学校读者我要写书评

暂无评论

Centerness-based Instance-aware Knowledge Distillation with Task-wise Mutual Lifting for Object Detection on Drone Imagery

arXiv

引用

arXiv 2024年

作者： Du, Bowei Liao, Zhixuan Zhang, Yanan Cai, Zhi Chen, Jiaxin Huang, Di State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China Hangzhou Innovation Institute Beihang University Hangzhou China

Developing accurate and efficient detectors for drone imagery is challenging due to the inherent complexity of aerial scenes. While some existing methods aim to achieve high accuracy by utilizing larger models, their computational cost is prohibitive for drones. Recently, Knowledge Distillation (KD) has shown promising potential for maintaining satisfactory accuracy while significantly compressing models in general object detection. Considering the advantages of KD, this paper presents the first attempt to adapt it to object detection on drone imagery and addresses two intrinsic issues: (1) low foreground-background ratio and (2) small instances and complex backgrounds, which lead to inadequate training, resulting insufficient distillation. Therefore, we propose a task-wise Lightweight Mutual Lifting (Light-ML) module with a Centerness-based Instance-aware Distillation (CID) strategy. The Light-ML module mutually harmonizes the classification and localization branches by channel shuffling and convolution, integrating teacher supervision across different tasks during back-propagation, thus facilitating training the student model. The CID strategy extracts valuable regions surrounding instances through the centerness of proposals, enhancing distillation efficacy. Experiments on the VisDrone, UAVDT, and COCO benchmarks demonstrate that the proposed approach promotes the accuracies of existing state-ofthe- art KD methods with comparable computational requirements. Codes will be available upon acceptance. Copyright © 2024, The Authors. All rights reserved.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

A study on the impact of pre-trained model on Just-In-Time defect prediction

A study on the impact of pre-trained model on Just-In-Time d...

引用

IEEE International Conference on software Quality, Reliability and Security (QRS)

作者： Yuxiang Guo Xiaopeng Gao Zhenyu Zhang W.K. Chan Bo Jiang State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Department of Computer Science City University of Hong Kong Hong Kong China

Previous researchers conducting Just-In-Time (JIT) defect prediction tasks have primarily focused on the performance of individual pre-trained models, without exploring the relationship between different pre-trained models as backbones. In this study, we build six models: RoBERTaJIT, CodeBERTJIT, BARTJIT, PLBARTJIT, GPT2JIT, and CodeGPTJIT, each with a distinct pre-trained model as its backbone. We systematically explore the differences and connections between these models. Specifically, we investigate the performance of the models when using Commit code and Commit message as inputs, as well as the relationship between training efficiency and model distribution among these six models. Additionally, we conduct an ablation experiment to explore the sensitivity of each model to inputs. Furthermore, we investigate how the models perform in zero-shot and few-shot scenarios. Our findings indicate that each model based on different backbones shows improvements, and when the backbone’s pre-training model is similar, the training resources that need to be consumed are closer. We also observe that Commit code plays a significant role in defect detection, and different pre-trained models demonstrate better defect detection ability with a balanced dataset under few-shot scenarios. These results provide new insights for optimizing JIT defect prediction tasks using pre-trained models and highlight the factors that require more attention when constructing such models. Additionally, CodeGPTJIT and GPT2JIT achieved better performance than DeepJIT and CC2Vec on the two datasets respectively under 2000 training samples. These findings emphasize the effectiveness of transformer-based pre-trained models in JIT defect prediction tasks, especially in scenarios with limited training data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Aster: Encoding Data Augmentation Relations into Seed Test Suites for Robustness Assessment and Fuzzing of Data-Augmented Deep Learning Models

Aster: Encoding Data Augmentation Relations into Seed Test S...

引用

IEEE International Conference on software Quality, Reliability and Security (QRS)

作者： Haipeng Wang Zhengyuan Wei Qilin Zhou Bo Jiang W. K. Chan City University of Hong Kong Hong Kong China State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China

Data-augmented deep learning models are widely used in real-world applications. However, many state-of the-art loss-based or coverage-based fuzzing techniques fail to produce fuzzing samples for them from many seeds. This paper proposes Aster, a novel technique to address this problem to enhance their fuzzing effectiveness for deep learning models trained with multi-sample data augmentation methods. Aster formulates a novel reachability-based strategy to encode the insights of every seed’s direct and indirect data augmentation relation instances into the replacement seed of that seed systematically. Our experiment shows that Aster is highly effective. On average, loss-based and coverage-based fuzzing techniques can generate 166% and 110% more fuzzing samples and reduce 31% and 22% unsuccessful seeds, respectively, after adopting the replacement seeds generated by Aster to replace their original seeds. Their improved models also become up to 55% and 40% on average more robust against FGSM and PGD attacks in the experiment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FuseFPS: Accelerating Farthest Point Sampling with Fusing KD-tree Construction for Point Clouds

arXiv

引用

arXiv 2023年

作者： Han, Meng Wang, Liang Xiao, Limin Zhang, Hao Zhang, Chenhao Xie, Xilong Zheng, Shuai Dong, Jin State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing100191 China Beijing Academy of Blockchain and Edge Computing China

Point cloud analytics has become a critical workload for embedded and mobile platforms across various applications. Farthest point sampling (FPS) is a fundamental and widely used kernel in point cloud processing. However, the heavy external memory access makes FPS a performance bottleneck for real-time point cloud processing. Although bucket-based farthest point sampling can significantly reduce unnecessary memory accesses during the point sampling stage, the KD-tree construction stage becomes the predominant contributor to execution time. In this paper, we present FuseFPS, an architecture and algorithm co-design for bucket-based farthest point sampling. We first propose a hardware-friendly sampling-driven KD-tree construction algorithm. The algorithm fuses the KD-tree construction stage into the point sampling stage, further reducing memory accesses. Then, we design an efficient accelerator for bucket-based point sampling. The accelerator can offload the entire bucket-based FPS kernel at a low hardware cost. Finally, we evaluate our approach on various point cloud datasets. The detailed experiments show that compared to the state-of-the-art accelerator QuickFPS, FuseFPS achieves about 4.3× and about 6.1× improvements on speed and power efficiency, respectively. Copyright © 2023, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

computer-Vision-Based Non-Contact Paste Concentration Measurement*

Computer-Vision-Based Non-Contact Paste Concentration Measur...

引用

Automation in Manufacturing, Transportation and Logistics (ICaMaL), International Conference on

作者： Tailin Liang Zhaolin Yuan State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China Department of Industrial and Systems Engineering Research Institute of Advanced Manufacturing The Hong Kong Polytechnic University Hong Kong China

ISBN: (数字)9798350378658

ISBN: (纸本)9798350378665

For monitoring the paste concentration, existing techniques, such as ultrasonic concentration meters and neutron meters, suffer from radiation hazards and low precision in high concentrations. This paper proposes a novel non-contact concentration measurement method based on deep learning. With the dataset collected by preparing the paste with different concentrations and taking photographs from the paste surface, a convolutional neural network is trained to extract the features from images and predict the concentration. The experiments indicate that the measurement accuracy is close to 88.79 % for the manual stirring paste dataset and 91.42 % for the automatic stirring paste dataset, which are sufficient in industrial applications. As a substitution of traditional concentration measurement instruments, the proposed vision-based concentration measurement method is non-contact and its accuracy is sufficient in industrial applications.

关键词： Meters Deep learning Accuracy Ultrasonic variables measurement Transportation Manuals Feature extraction Surface texture Convolutional neural networks Surface treatment

来源：评论

学校读者我要写书评

暂无评论

Is It Enough to Recommend Tasks to Newcomers? Understanding Mentoring on Good First Issues

Is It Enough to Recommend Tasks to Newcomers? Understanding ...

引用

International Conference on software engineering (ICSE)

作者： Xin Tan Yiran Chen Haohua Wu Minghui Zhou Li Zhang State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China ShenYuan Honors College Beihang University Beijing China Key Laboratory of High Confidence Software Technologies Ministry of Education School of Computer Science Peking University Beijing China

Newcomers are critical for the success and continuity of open source software (OSS) projects. To attract newcomers and facilitate their onboarding, many OSS projects recommend tasks for newcomers, such as good first issues (GFIs). Previous studies have preliminarily investigated the effects of GFIs and techniques to identify suitable GFIs. However, it is still unclear whether just recommending tasks is enough and how significant mentoring is for newcomers. To better understand mentoring in OSS communities, we analyze the resolution process of 48,402 GFIs from 964 repositories through a mix-method approach. We investigate the extent, the mentorship structures, the discussed topics, and the relevance of expert involvement. We find that ~70% of GFIs have expert participation, with each GFI usually having one expert who makes two comments. Half of GFIs will receive their first expert comment within 8.5 hours after a newcomer comment. Through analysis of the collaboration networks of newcomers and experts, we observe that community mentorship presents four types of structure: centralized mentoring, decentralized mentoring, collaborative mentoring, and distributed mentoring. As for discussed topics, we identify 14 newcomer challenges and 18 expert mentoring content. By fitting the generalized linear models, we find that expert involvement positively correlates with newcomers' successful contributions but negatively correlates with newcomers' retention. Our study manifests the status and significance of mentoring in the OSS projects, which provides rich practical implications for optimizing the mentoring process and helping newcomers contribute smoothly and suecessfully,

关键词：

来源：评论

学校读者我要写书评

暂无评论

Is It Enough to Recommend Tasks to Newcomers? Understanding Mentoring on Good First Issues

arXiv

引用

arXiv 2023年

作者： Tan, Xin Chen, Yiran Wu, Haohua Zhou, Minghui Zhang, Li School of Computer Science and Engineering Beihang University State Key Laboratory of Software Development Environment Beijing China ShenYuan Honors College Beihang University Beijing China School of Computer Science Peking University Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China

Newcomers are critical for the success and continuity of open source software (OSS) projects. To attract newcomers and facilitate their onboarding, many OSS projects recommend tasks for newcomers, such as good first issues (GFIs). Previous studies have preliminarily investigated the effects of GFIs and techniques to identify suitable GFIs. However, it is still unclear whether just recommending tasks is enough and how significant mentoring is for newcomers. To better understand mentoring in OSS communities, we analyze the resolution process of 48,402 GFIs from 964 repositories through a mix-method approach. We investigate the extent, the mentorship structures, the discussed topics, and the relevance of expert involvement. We find that ∼70% of GFIs have expert participation, with each GFI usually having one expert who makes two comments. Half of GFIs will receive their first expert comment within 8.5 hours after a newcomer comment. Through analysis of the collaboration networks of newcomers and experts, we observe that community mentorship presents four types of structure: centralized mentoring, decentralized mentoring, collaborative mentoring, and distributed mentoring. As for discussed topics, we identify 14 newcomer challenges and 18 expert mentoring content. By fitting the generalized linear models, we find that expert involvement positively correlates with newcomers' successful contributions but negatively correlates with newcomers' retention. Our study manifests the status and significance of mentoring in the OSS projects, which provides rich practical implications for optimizing the mentoring process and helping newcomers contribute smoothly and successfully. © 2023, CC BY.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

Improving Factual Error Correction by Learning to Inject Factual Errors

arXiv

引用

arXiv 2023年

作者： He, Xingwei Zhang, Qianru Jin, A-Long Ma, Jun Yuan, Yuan Yiu, Siu Ming The University of Hong Kong Hong Kong School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Software Development Environment China Zhongguancun Laboratory China

Factual error correction (FEC) aims to revise factual errors in false claims with minimal editing, making them faithful to the provided evidence. This task is crucial for alleviating the hallucination problem encountered by large language models. Given the lack of paired data (i.e., false claims and their corresponding correct claims), existing methods typically adopt the ‘mask-then-correct’ paradigm. This paradigm relies solely on unpaired false claims and correct claims, thus being referred to as distantly supervised methods. These methods require a masker to explicitly identify factual errors within false claims before revising with a corrector. However, the absence of paired data to train the masker makes accurately pinpointing factual errors within claims challenging. To mitigate this, we propose to improve FEC by Learning to Inject Factual Errors (LIFE), a three-step distantly supervised method: ‘mask-corrupt-correct’. Specifically, we first train a corruptor using the ‘mask-then-corrupt’ procedure, allowing it to deliberately introduce factual errors into correct text. The corruptor is then applied to correct claims, generating a substantial amount of paired data. After that, we filter out low-quality data, and use the remaining data to train a corrector. Notably, our corrector does not require a masker, thus circumventing the bottleneck associated with explicit factual error identification. Our experiments on a public dataset verify the effectiveness of LIFE in two key aspects: Firstly, it outperforms the previous best-performing distantly supervised method by a notable margin of 10.59 points in SARI Final (19.3% improvement). Secondly, even compared to ChatGPT prompted with in-context examples, LIFE achieves a superiority of 7.16 points in SARI Final. Copyright © 2023, The Authors. All rights reserved.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

TUBENCH: BENCHMARKING LARGE VISION-LANGUAGE MODELS ON TRUSTWORTHINESS WITH UNANSWERABLE QUESTIONS

arXiv

引用

arXiv 2024年

作者： He, Xingwei Zhang, Qianru Jin, A-Long Yuan, Yuan Yiu, Siu-Ming The University of Hong Kong Hong Kong Xi’an Jiaotong-Liverpool University China School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Software Development Environment China Zhongguancun Laboratory China

Large Vision-Language Models (LVLMs) have achieved remarkable progress on visual perception and linguistic interpretation. Despite their impressive capabilities across various tasks, LVLMs still suffer from the issue of hallucination, which involves generating content that is incorrect or unfaithful to the visual or textual inputs. Traditional benchmarks, such as MME and POPE, evaluate hallucination in LVLMs within the scope of Visual Question Answering (VQA) using answerable questions. However, some questions are unanswerable due to insufficient information in the images, and the performance of LVLMs on such unanswerable questions remains underexplored. To bridge this research gap, we propose TUBench, a benchmark specifically designed to evaluate the reliability of LVLMs using unanswerable questions. TUBench comprises an extensive collection of high-quality, unanswerable questions that are meticulously crafted using ten distinct strategies. To thoroughly evaluate LVLMs, the unanswerable questions in TUBench are based on images from four diverse domains as visual contexts: screenshots of code snippets, natural images, geometry diagrams, and screenshots of statistical tables. These unanswerable questions are tailored to test LVLMs’ trustworthiness in code reasoning, commonsense reasoning, geometric reasoning, and mathematical reasoning related to tables, respectively. We conducted a comprehensive quantitative evaluation of 28 leading foundational models on TUBench, with Gemini-1.5-Pro, the top-performing model, achieving an average accuracy of 69.2%, and GPT-4o, the third-ranked model, reaching 66.7% average accuracy, in determining whether questions are answerable. Furthermore, our manual analysis of the model outputs reveals that: (1) Gemini-1.5-Pro provides both correct answers and explanations in only 41% of cases, and (2) hallucinations are the primary cause of error, accounting for 58.5% of the incorrect explanations generated by Gemini-1.5-Pro. These findings

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：