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

5th Chinese Conference on Swarm Intelligence and Cooperative Control, CCSICC 2021

作者： Liu, Jiajun Ru, Xinfeng Xia, Weiguo Wang, Chen China National Aeronautical Radio Electronic Research Institute and National Key Laboratory of Science and Technology on Avionics System Integration Shanghai China Key Laboratory of Intelligent Control and Optimization for Industrial Equipment of Ministry of Education and School of Control Science and Engineering Dalian University of Technology Dalian China National Engineering Research Center of Software Engineering and the State Key Laboratory of Turbulence and Complex Systems Intelligent Biomimetic Design Lab College of Engineering Peking University Beijing China

ISBN: (纸本)9789811939976

A distributed fault-tolerant formation control law is designed in this paper for multi-agent systems under external disturbances and actuator faults including time-varying loss of effectiveness faults. The initial position of each agent is already on a circle and the control purpose is to form a desired formation on this circle. Based on this local information, a distributed adaptive formation control law is designed by employing the congelation of variables method to deal with time-varying actuator faults. Finally, a simulation example is given to verify the effectiveness of the adaptive fault-tolerant control design method. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

How to Route CUBIC and BBR Packets in Space

How to Route CUBIC and BBR Packets in Space

引用

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

来源：评论

学校读者我要写书评

暂无评论

AGDB: A Dictionary-based Malicious Domain Detection Method based on Representation Fusion 7

AGDB: A Dictionary-based Malicious Domain Detection Method b...

引用

7th IEEE International Conference on Data Science in Cyberspace, DSC 2022

作者： Zhai, You Dong, Hao Li, Zhoujun Yang, Liqun He, Longtao Beihang University State Key Lab of Software Development Environment China Beihang University School of Cyber Science and Technology China National Computer Network Emergency Response Technical Team Coordination Center of China China

ISBN: (数字)9781665474801

ISBN: (纸本)9781665474801

Botnets are starting to use domain generation algorithms (DGAs) extensively to enhance the stealth of command and control (C&C) communications between C&C servers and bots. Domains generated by DGAs are called algorithmically generated domains (AGDs), which also known as malicious domains. Detection of AGDs is a crucial element for fighting botnets and security researchers have proposed a variety of DGA detection methods. In order to avoid the detection of DGA detectors, various types of DGAs are continuously updated. Among them, the dictionary-based malicious domain, with strong camouflage, is the most advanced DGA representative and the previous detection methods are very ineffective on this type of malicious domain. To solve this problem, we explore the dictionary-based malicious domain generation algorithm, and propose, AGDB, a dictionary-based malicious domain detection method based on representation fusion, which combines features extracted from the context-based malicious domain detection model with features extracted from the graph-based malicious domain detection model. The experimental results show that the detection method based on representation fusion significantly outperforms the existing methods in terms of precision and recall. © 2022 IEEE.

关键词： Botnet

来源：评论

学校读者我要写书评

暂无评论

Camouflaged Object Segmentation with Transformer 6th

Camouflaged Object Segmentation with Transformer

引用

6th International Conference on Cognitive Systems and Signal Processing, ICCSIP 2021

作者： Wang, Haiwen Wang, Xinzhou Sun, Fuchun Song, Yixu State Key Lab on Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing China School of Electronic and Information Engineering Tongji University Shanghai China

ISBN: (纸本)9789811692468

The Vision Transformer (ViT) [6] directly applies a Transformer architecture to image classification and achieves an impressive result compared with convolutional networks. This paper presents a new ViT-base camouflaged object segmentation method, called COS Transformer, which aims to identify and segment objects concealed in a complex environment. The high intrinsic similarities between object and surrounding makes the task challenging than salient object detection. Most recent camouflaged object segmentation methods(e.g., EGNet [29], PraNet [10] and SINet [9]) adopt convolutional network with an encoder-decoder architecture and focused on increasing the receptive field, which is limited by the depth of the network. In camouflaged object segmentation (COS) task, the camouflage is mainly relied on contrast of the whole surrounding instead of the local information. We introduce transformer with global context awareness in this paper, for self-attention allowing COS Transformer to aggregate features globally even in the lowest layers. Specifically, the architecture is composed of a transformer-based encoder and a multi-layers feature aggregation refinement module. After training on the COD10K [9] dataset, COS Transformer attains excellent results compared to state-of-the-art convolutional networks, e.g. 11.7% improvement of E [8] on the COD10K contrasted to SINet. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Fix the Tests: Augmenting LLMs to Repair Test Cases with Static Collector and Neural Reranker

Fix the Tests: Augmenting LLMs to Repair Test Cases with Sta...

引用

International Symposium on software Reliability engineering (ISSRE)

作者： Jun Liu Jiwei Yan Yuanyuan Xie Jun Yan Jian Zhang Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences University of Chinese Academy of Sciences (UCAS) Technology Center of Software Engineering Institute of Software Chinese Academy of Sciences School of Intelligent Science and Technology Hangzhou Institute for Advanced Study UCAS

ISBN: (数字)9798350353884

ISBN: (纸本)9798350353891

During software evolution, it is advocated that test code should co-evolve with production code. In real development scenarios, test updating may lag behind production code changing, which may cause compilation failure or bring other troubles. Existing techniques based on pre-trained language models can be directly adopted to repair obsolete tests caused by such unsynchronized code changes, especially syntactic-related ones. However, the lack of task-oriented contextual information affects the repair accuracy on large-scale projects. Starting from an obsolete test, the key challenging task is precisely identifying and constructing Test-Repair-Oriented Contexts (TROCtxs) from the whole repository within a limited token *** this paper, we propose Synter (SYNtactic-breaking- changes-induced TEst Repair), a novel approach based on LLMs to automatically repair obsolete test cases via precise and concise TROCtxs construction. Inspired by developers’ programming practices, we design three types of TROCtx: class context, usage context, and environment context. Given an obsolete test case to repair, Synter firstly collects the related code information for each type of TROCtx through static analysis techniques automatically. Then, it generates reranking queries to identify the most relevant TROCtxs, which will be taken as the repair-required key contexts and be input to the large language model for the final test *** evaluate the effectiveness of Synter, we construct a benchmark dataset that contains a set of obsolete tests caused by syntactic breaking changes. The experimental results show that Synter outperforms baseline approaches both on textual- and intent-matching metrics. With the augmentation of constructed TROCtxs, hallucinations are reduced by 57.1%.

关键词： Measurement Codes Large language models Static analysis Production Maintenance engineering Syntactics Programming software software reliability

来源：评论

学校读者我要写书评

暂无评论

CLIP is Also an Efficient Segmenter: A Text-Driven Approach for Weakly Supervised Semantic Segmentation

CLIP is Also an Efficient Segmenter: A Text-Driven Approach ...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Yuqi Lin Minghao Chen Wenxiao Wang Boxi Wu Ke Li Binbin Lin Haifeng Liu Xiaofei He State Key Lab of CAD&CG College of Computer Science Zhejiang University School of Software Technology Zhejiang University Fullong Technology

Weakly supervised semantic segmentation (WSSS) with image-level labels is a challenging task. Mainstream approaches follow a multi-stage framework and suffer from high training costs. In this paper, we explore the potential of Contrastive Language-Image Pre-training models (CLIP) to localize different categories with only image-level labels and without further training. To efficiently generate high-quality segmentation masks from CLIP, we propose a novel WSSS framework called CLIP-ES. Our framework improves all three stages of WSSS with special designs for CLIP: 1) We introduce the softmax function into GradCAM and exploit the zero-shot ability of CLIP to suppress the confusion caused by non-target classes and backgrounds. Mean-while, to take full advantage of CLIP, we re-explore text inputs under the WSSS setting and customize two text-driven strategies: sharpness-based prompt selection and synonym fusion. 2) To simplify the stage of CAM refinement, we propose a real-time class-aware attention-based affinity (CAA) module based on the inherent multi-head self-attention (MHSA) in CLIP- ViTs. 3) When training the final segmentation model with the masks generated by CLIP, we introduced a confidence-guided loss (CGL) focus on confident regions. Our CLIP-ES achieves SOTA performance on Pascal VOC 2012 and MS COCO 2014 while only taking 10% time of previous methods for the pseudo mask generation. Code is available at https://***/linyq2117/CLIP-ES.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Regulating microstructure and composition by carbonizing in-situ grown metal-organic frameworks on cotton fabrics for boosting electromagnetic wave absorption

引用

Nano Research 2024年第8期17卷 7290-7300页

作者： Jie Jin Hongsen Long Hu Liu Yan Guo Tiantian Bai Ben Bin Xu Mohammed A.Amin Hua Qiu Mohamed H.Helal Chuntai Liu Changyu Shen Zeinhom M.El-Bahy Zhanhu Guo State Key Laboratory of Structural Analysis Optimization and CAE Software for Industrial EquipmentNational Engineering Research Center for Advanced Polymer Processing TechnologyZhengzhou UniversityZhengzhou 450002China China State Key Laboratory of Powder Metallurgy Central South UniversityChangsha 410000China School of Electronic Engineering North China University of Water Resources and Electric PowerZhengzhou 450046China Complex Conditions of High-end Tire Technology Innovation Center Shuguang Rubber Industry Research&Design Institute Co.LtdGuilin 541004China Integrated Composites Lab Department of Mechanical and Civil EngineeringNorthumbria UniversityNewcastle Upon TyneNE18STUK Department of Chemistry College of ScienceTaif UniversityP.O.Box 11099Taif 21944Saudi Arabia Shaanxi Key Laboratory of Macromolecular Science and Technology School of Chemistry and Chemical EngineeringNorthwestern Polytechnical UniversityXi’an 710072China Department of Chemistry Faculty of Arts and ScienceNorthern Border UniversityRafha 73213Saudi Arabia Department of Chemistry Faculty of ScienceAl-Azhar UniversityNasr City 11884CairoEgypt

High-temperature carbonized metal-organic frameworks(MOFs)derivatives have demonstrated their superiority for promising electromagnetic wave(EMW)absorbers,but they still suffer from limited EMW absorption capacity and narrow *** the advantage of microstructure and chemical composition regulation for the design of EMW absorber,hierarchical heterostructured MoS_(2)/CoS_(2)-Co_(3)O_(4)@cabonized cotton fabric(CF)(MCC@CCF)is prepared by growing ZIF-67 MOFs onto CF surface,chemical etching,and *** from the dual loss mechanism of magnetic-dielectric multicomponent carbonized MOFs,chemical etching and carbonization process can effectively introduce abundant micro-gap structure that can result in better impedance matching and stronger absorption capacity via internal reflection,doped heteroatoms(Mo,N,S)to supply additional dipolar polarization loss,and numerous heterointerfaces among MoS_(2),CoS_(2),Co_(3)O_(4),and CCF that produce promoted conduction loss and interfacial polarization ***,a minimal reflection loss of−52.87 dB and a broadest effective absorption bandwidth of 6.88 GHz were achieved via tunning the sample thickness and filler loading,showing excellent EMW absorption *** research is of great value for guiding the research on MOFs derivatives based EMW absorbing materials.

关键词： metal-organic frameworks hierarchical structure chemical etching sulfurization electromagnetic wave absorption

来源：评论

学校读者我要写书评

暂无评论

Fix the Tests: Augmenting LLMs to Repair Test Cases with Static Collector and Neural Reranker

arXiv

引用

arXiv 2024年

作者： Liu, Jun Yan, Jiwei Xie, Yuanyuan Yan, Jun Zhang, Jian State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Technology Center of Software Engineering Institute of Software Chinese Academy of Sciences China China School of Intelligent Science and Technology Hangzhou Institute for Advanced Study UCAS China

During software evolution, it is advocated that test code should co-evolve with production code. In real development scenarios, test updating may lag behind production code changing, which may cause compilation failure or bring other troubles. Existing techniques based on pre-trained language models can be directly adopted to repair obsolete tests caused by such unsynchronized code changes, especially syntactic-related ones. However, the lack of task-oriented contextual information affects the repair accuracy on large-scale projects. Starting from an obsolete test, the key challenging task is precisely identifying and constructing Test-Repair-Oriented Contexts (TROCtxs) from the whole repository within a limited token size. In this paper, we propose SYNTER (SYNtactic-breaking-changes-induced TEst Repair), a novel approach based on LLMs to automatically repair obsolete test cases via precise and concise TROCtxs construction. Inspired by developers’ programming practices, we design three types of TROCtx: class context, usage context, and environment context. Given an obsolete test case to repair, SYNTER firstly collects the related code information for each type of TROCtx through static analysis techniques automatically. Then, it generates reranking queries to identify the most relevant TROCtxs, which will be taken as the repair-required key contexts and be input to the large language model for the final test repair. To evaluate the effectiveness of SYNTER, we construct a benchmark dataset that contains a set of obsolete tests caused by syntactic breaking changes. The experimental results show that SYNTER outperforms baseline approaches both on textual- and intent-matching metrics. With the augmentation of constructed TROCtxs, hallucinations are reduced by 57.1%. © 2024, CC BY.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

Prune and Merge: Efficient Token Compression for Vision Transformer with Spatial Information Preserved

引用

IEEE Transactions on Multimedia 2025年

作者： Mao, Junzhu Shen, Yang Guo, Jinyang Yao, Yazhou Hua, Xiansheng Shen, Hengtao Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China Beihang University State Key Laboratory of Software Development Environment Institute of Artificial Intelligence Beijing100191 China Terminus Group Beijing100027 China University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China

Token compression is essential for reducing the computational and memory requirements of transformer models, enabling their deployment in resource-constrained environments. In this work, we propose an efficient and hardware-compatible token compression method called Prune and Merge. Our approach integrates token pruning and merging operations within transformer models to achieve layer-wise token compression. By introducing trainable merge and reconstruct matrices and utilizing shortcut connections, we efficiently merge tokens while preserving important information and enabling the restoration of pruned tokens. Additionally, we introduce a novel gradient-weighted attention scoring mechanism that computes token importance scores during the training phase, eliminating the need for separate computations during inference and enhancing compression efficiency. We also leverage gradient information to capture the global impact of tokens and automatically identify optimal compression structures. Extensive experiments on the ImageNet-1k and ADE20K datasets validate the effectiveness of our approach, achieving significant speed-ups with minimal accuracy degradation compared to state-of-the-art methods. For instance, on DeiT-Small, we achieve a 1.64× speed-up with only a 0.2% drop in accuracy on ImageNet-1k. Moreover, by compressing segmenter models and comparing with existing methods, we demonstrate the superior performance of our approach in terms of efficiency and effectiveness. Code and models have been made available at https://***/NUST-Machine-Intelligence-laboratory/prune_and_merge. © 1999-2012 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

Near-linear time approximation algorithms for k-means with outliers 24

Near-linear time approximation algorithms for k-means with o...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Junyu Huang Qilong Feng Ziyun Huang Jinhui Xu Jianxin Wang School of Computer Science and Engineering Central South University Changsha China and Xiangjiang Laboratory Changsha China Department of Computer Science and Software Engineering Penn State Erie The Behrend College Department of Computer Science and Engineering State University of New York at Buffalo NY School of Computer Science and Engineering Central South University Changsha China and Xiangjiang Laboratory Changsha China and The Hunan Provincial Key Lab of Bioinformatics Central South University Changsha China

The k-means with outliers problem is one of the most extensively studied clustering problems in the field of machine learning, where the goal is to discard up to z outliers and identify a minimum k-means clustering on the remaining data points. Most previous results for this problem have running time dependent on the aspect ratio Δ(the ratio between the maximum and the minimum pairwise distances) to achieve fast approximations. To address the issue of aspect ratio dependency on the running time, we propose sampling-based algorithms with almost linear running time in the data size, where a crucial component of our approach is an algorithm called Fast-Sampling. Fast-Sampling algorithm can find inliers that well approximate the optimal clustering centers without relying on a guess for the optimal clustering costs, where a 4-approximate solution can be obtained in time $O(\frac{ndk\log\log n}{\epsilon^2})$ with O(k/ε) centers opened and (1 + ε)z outliers discarded. To reduce the number of centers opened, we propose a center reduction algorithm, where an O(1/ε)-approximate solution can be obtained in time $O(\frac{ndk\log \log n}{\epsilon^2} + dpoly(k, \frac{1}{\epsilon})\log(n\Delta))$ with (1 + ε)z outliers discarded and exactly k centers opened. Empirical experiments suggest that our proposed sampling-based algorithms outperform state-of-the-art algorithms for the k-means with outliers problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：