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

6th International Conference on Machine Learning, Big Data and Business Intelligence, MLBDBI 2024

作者： Xi, Hajie Hu, Song Zhang, He Zhang, Shuang Weng, Jingnong Huang, Jian School of Computer Science and Engineering Beihang University Beijing China Research Institute of Highway Ministry of Transport State Key Lab of Transportation System Beijing China Transportation Comprehensive Enforcement Corps Beijing China School of Software Beihang University Beijing China

ISBN: (纸本)9798331541798

With the rapid development of artificial intelligence, a wide variety of deep learning models have emerged across various fields. Nevertheless, the quality of these models varies significantly, making the effective evaluation of model performance a pressing issue. In some open data competitions, remote evaluation based on Docker images has increasingly become a novel and reliable approach, providing a consistent environment to ensure the fairness of model evaluations. However, it imposes high demands on hardware resources, typically requiring dedicated resources for each participant to serve as Docker Registries for the pushing and management of Docker images. In this paper, we extend the load balancing module of the Nginx server by integrating Lua scripts and propose a Cache-based Dynamic Smooth Weighted Round-robin (CDSWRR) algorithm to optimize the pushing process of Docker images. By constructing a unified load balancing entry, the proposed approach simplifies the deployment of Docker Registry clusters. Experiments show that compared to weighted round-robin and IP hash algorithms of Nginx, the CDSWRR algorithm is able to ensure stable pushing of Docker images and reduce both response error rate and response time. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Outlier Suppression+: Accurate quantization of large language models by equivalent and effective shifting and scaling

Outlier Suppression+: Accurate quantization of large languag...

引用

2023 Conference on Empirical Methods in Natural Language Processing, EMNLP 2023

作者： Wei, Xiuying Zhang, Yunchen Li, Yuhang Zhang, Xiangguo Gong, Ruihao Guo, Jinyang Liu, Xianglong State Key Lab of Software Development Environment Beihang University China SenseTime Research School of Computer and Communication Sciences EPFL Switzerland Yale University United States UESTC China

ISBN: (纸本)9798891760608

Post-training quantization (PTQ) of transformer language models faces significant challenges due to the existence of detrimental outliers in activations. We observe that these outliers are concentrated in specific channels and are asymmetric across channels. To address this issue, we propose the Outlier Suppression+ (OS+) framework, which contains the channel-wise shifting for asymmetry and channel-wise scaling for concentration. We show that these operations can be seamlessly migrated into subsequent modules while maintaining equivalence. Second, we propose a fast and stable scheme to calculate effective shifting and scaling values. The channel-wise shifting aligns the center of each channel for removal of outlier asymmetry. The channel-wise scaling quantitatively evaluates changes brought by migration and quantization for better quantization burden balance. We validate our OS+ under both standard and fine-grained quantization settings with models including BERT, OPT, BLOOM, BLOOMZ, and LLaMA. Comprehensive results across various tasks demonstrate the superiority of our approach. Especially, with standard quantization, OS+ can achieve near-floating-point performance on both small models and large language models on 8-bit and 6-bit. Besides, we establish a new state-of-the-art for 4-bit BERT with 15.5% improvement. Our code is available at https://***/ModelTC/Outlier_Suppression_Plus. ©2023 Association for Computational Linguistics.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

A Framework to Analyze the Impact of Maps on VANET Simulation

引用

Chinese Journal of Electronics 2023年第3期20卷 401-406页

作者： Xiaoming LI Jingxuan WANG Xin JIN Tong ZHAO Wei YAN State Key Laboratory of Software Development Environment Beihang University Beijing China School of Electronic Engineering and Computer Science Peking University Beijing China

Mobility models play an important role on VANET simulation, which has been discussed in many studies. However, few studies have analyzed the impact of maps. We find that maps can greatly influence simulation results. We present a framework to help researchers analyze the impact of maps. We regard intersections in the map as virtual nodes and propose Virtual node coverage (VNC) and Virtual connected components (VCC) as two metrics to estimate the impact of maps. Through the-oretical analysis and extensive simulations, we show that our approach can be applied to various scenarios and researchers can use our approach to analyze the impact of maps on VANET simulation.

关键词： Measurement Analytical models Electric potential Mobility models Simulation Vehicular ad hoc networks Research and development

来源：评论

学校读者我要写书评

暂无评论

Towards Fully Decoupled End-to-End Person Search

Towards Fully Decoupled End-to-End Person Search

引用

2023 International Conference on Digital Image Computing: Techniques and Applications, DICTA 2023

作者： Zhang, Pengcheng Bai, Xiao Zheng, Jin Ning, Xin Jiangxi Research Institute Beihang University School of Computer Science and Engineering State Key Laboratory of Software Development Environment Beijing China Institute of Semiconductors Chinese Academy of Sciences Cognitive Computing Technology Joint Laboratory Wave Group Beijing China

ISBN: (纸本)9798350382204

End-to-end person search aims to jointly detect and re-identify a target person in raw scene images with a unified model. The detection task unifies all persons while the re-id task discriminates different identities, resulting in conflict optimal objectives. Existing works proposed to decouple end-to-end person search to alleviate such conflict. Yet these methods are still sub-optimal on one or two of the sub-tasks due to their partially decoupled models, which limits the overall person search performance. In this paper, we propose to fully decouple person search towards optimal person search. A task-incremental person search network is proposed to incrementally construct an end-to-end model for the detection and re-id sub-task, which decouples the model architecture for the two sub-tasks. The proposed task-incremental network allows task-incremental training for the two conflicting tasks. This enables independent learning for different objectives thus fully decoupled the model for personsearch. Comprehensive experimental evaluations demonstrate the effectiveness of the proposed fully decoupled models for end-to-end person search. © 2023 IEEE.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Effective Training of PINNs by Combining CMA-ES with Gradient Descent

Effective Training of PINNs by Combining CMA-ES with Gradien...

引用

Congress on Evolutionary Computation

作者： Lin Liu Yuan Yuan School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Software Development Environment Zhongguancun Laboratory School of Computer Science and Engineering Beihang University Beijing China

ISBN: (数字)9798350308365

ISBN: (纸本)9798350308372

Physics-Informed Neural Networks (PINNs) have recently received increasing attention, however, optimizing the loss function of PINNs is notoriously difficult, where the landscape of the loss function is often highly non-convex and rugged. Local optimization methods based on gradient information can converge quickly but are prone to being trapped in local minima for training PINNs. Evolutionary algorithms (EAs) are well known for the global search ability, which can help escape from local minima. It has been reported in the literature that EAs show some advantages over gradient-based methods in training PINNs. Inspired by the Memetic Algorithm, we combine global-search based EAs and local-search based batch gradient descent in order to make the best of both word. In addition, since the PINN loss function is composed of multiple terms, balancing these terms is also a challenging issue. Therefore, we also attempt to combine EAs with multiple-gradient descent algorithm for multi-objective optimization. Our experiments provide strong evidence for the superiority of the above algorithms.

关键词： Training Memetics Neural networks Evolutionary computation Pareto optimization Prediction algorithms Linear programming

来源：评论

学校读者我要写书评

暂无评论

Understanding heterophily for graph neural networks 24

Understanding heterophily for graph neural networks

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Junfu Wang Yuanfang Guo Liang Yang Yunhong Wang State Key Laboratory of Software Development Environment and School of Computer Science and Engineering and Shen Yuan Honors College Beihang University Beijing China State Key Laboratory of Software Development Environment and School of Computer Science and Engineering Beihang University Beijing China School of Artificial Intelligence Hebei University of Technology Tianjin China School of Computer Science and Engineering Beihang University Beijing China

Graphs with heterophily have been regarded as challenging scenarios for Graph Neural Networks (GNNs), where nodes are connected with dissimilar neighbors through various patterns. In this paper, we present theoretical understandings of heterophily for GNNs by incorporating the graph convolution (GC) operations into fully connected networks via the proposed Heterophilous Stochastic Block Models (HSBM), a general random graph model that can accommodate diverse heterophily patterns. Our theoretical investigation comprehensively analyze the impact of heterophily from three critical aspects. Firstly, for the impact of different heterophily patterns, we show that the separability gains are determined by two factors, i.e., the Euclidean distance of the neighborhood distributions and $\sqrt{\mathbb{E}\left[\operatorname{deg}\right]}$, where $\mathbb{E}\left[\operatorname{deg}\right]$ is the averaged node degree. Secondly, we show that the neighborhood inconsistency has a detrimental impact on separability, which is similar to degrading $\mathbb{E}\left[\operatorname{deg}\right]$ by a specific factor. Finally, for the impact of stacking multiple layers, we show that the separability gains are determined by the normalized distance of the l-powered neighborhood distributions, indicating that nodes still possess separability in various regimes, even when over-smoothing occurs. Extensive experiments on both synthetic and realworld data verify the effectiveness of our theory.

关键词：

来源：评论

学校读者我要写书评

暂无评论

User-level failure detection and auto-recovery of parallel programs in HPC systems

引用

Frontiers of computer science 2021年第6期15卷 31-42页

作者： Guozhen ZHANG Yi LIU Hailong YANG Jun XU Depei QIAN State Key Laboratory of Software Development Environment Beijing 100191China Sino-German Joint Software Institute Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China Science and Technology on Space System Simulation Laboratory Beijing Simulation Center Beijing 100854China

As the mean-time-between-failures(MTBF)continues to decline with the increasing number of components on large-scale high performance computing(HPC)systems,program failures might occur during the execution period with high *** successful execution of the HPC programs has become an issue that the unprivileged users should be *** the user perspective,if the program failure cannot be detected and handled in time,it would waste resources and delay the progress of program ***,the unprivileged users are unable to perform program state checking due to execution control by the job management system as well as the limited ***,automated tools for supporting user-level failure detection and autorecovery of parallel programs in HPC systems are *** paper proposes an innovative method for the unprivileged user to achieve failure detection of job execution and automatic resubmission of failed *** state checker in our method is encapsulated as an independent job to reduce interference with the user *** addition,we propose a dual-checker mechanism to improve the robustness of our *** implement the proposed method as a tool named automatic re-launcher(ARL)and evaluate it on the Tianhe-2 *** results show that ARL can detect the execution failures effectively on Tianhe-2 *** addition,the communication and performance overhead caused by ARL is *** good scalability of ARL makes it applicable for large-scale HPC systems.

关键词： high performance computing parallel program failure detection failure auto-recovery

来源：评论

学校读者我要写书评

暂无评论

software fault localization based on eigenvector centrality in complex network theory 24

Software fault localization based on eigenvector centrality ...

引用

24th IEEE International Conference on software Quality, Reliability and Security Companion, QRS-C 2024

作者： Wu, Wentao Wang, Shihai Shao, Yuanxun Xie, Wandong School of Reliability and Systems Engineering Beihang University Beijing100191 China Science and Technology on Reliability and Environmental Engineering Laboratory China State Key Laboratory of Software Development Environment China Aerospace Science and Engineering Network Information Development CO. Ltd Beijing China Information Center of China North Industries Group Corporation Beijing China

ISBN: (纸本)9798350365658

software debugging plays a crucial role in fault localization tasks, and spectrum-based fault localization (SBFL) is a hot topic in software automation debugging research. However, existing SBFL technologies are generally limited by tie within ranks, where a large number of elements share the same suspiciousness, which in turn severely limits the performance of SBFL. To this end, we propose an SBFL model based on eigenvector centrality (FLEC). This algorithm first utilizes the statement coverage information in the program spectrum to construct a statement network, and adopts the correlation between statements as edge weights. Then, FLEC takes statement suspiciousness as node weight. On this basis, the algorithm utilizes the eigenvector centrality to calculate the weighted suspiciousness of each statement while considering both node importance and correlation between nodes. Finally, FLEC conducted experimental validation on 3 datasets of Defects4J, and the results showed an average improvement of 10.7% in ACC@N compared to the optimal baseline. © 2024 IEEE.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the Physical-world Adversarial Robustness of Vehicle Detection

arXiv

引用

arXiv 2023年

作者： Zhang, Tianyuan Xiao, Yisong Zhang, Xiaoya Li, Hao Wang, Lu School of Computer Science and Engineering Beihang University Beijing China State Key Lab of Software Development Environment Beihang University Beijing China

Adversarial attacks in the physical world can harm the robustness of detection models. Evaluating the robustness of detection models in the physical world can be challenging due to the time-consuming and labor-intensive nature of many experiments. Thus, virtual simulation experiments can provide a solution to this challenge. However, there is no unified detection benchmark based on virtual simulation environment. To address this challenge, we proposed an instant-level data generation pipeline based on the CARLA simulator. Using this pipeline, we generated the DCI dataset and conducted extensive experiments on three detection models and three physical adversarial attacks. The dataset covers 7 continuous and 1 discrete scenes, with over 40 angles, 20 distances, and 20,000 positions. The results indicate that Yolo v6 had strongest resistance, with only a 6.59% average AP drop, and ASA was the most effective attack algorithm with a 14.51% average AP reduction, twice that of other algorithms. Static scenes had higher recognition AP, and results under different weather conditions were similar. Adversarial attack algorithm improvement may be approaching its ’limitation’. Copyright © 2023, The Authors. All rights reserved.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

PPIRB:Achieving an privacy-preserving image retrieval scheme Based on Blockchain 5

PPIRB:Achieving an privacy-preserving image retrieval scheme...

引用

5th International Conference on Data science and Information Technology, DSIT 2022

作者： Yuan, Bo Peng, Jiahui Li, Chunpei Qiu, Wangjie School of Computer Science and Engineering State Key Laboratory of Software Development Environment Beihang University Beijing100191 China Guangxi Key Lab of Multi-source Information Mining Security Guangxi Normal University GuiLin China State Key Laboratory of Software Development Environment Beihang University Advanced Innovation Center for Future Blockchain and Privacy Computing Beijing100191 China

ISBN: (数字)9781665498685

ISBN: (纸本)9781665498685

With the proliferation of cloud services, the work of large-scale image retrieval is carried out on remote cloud become a trend in order to get rid of the storage burden and computation. However, traditional retrieval work based on centralized cloud services is considered to take risk in giving away users' privacy in many researches. We need a secure way for retrieving and storing images by decentralized approach. In this paper, we propose a decentralized scheme named PPIRB(An Privacy-Preserving Image Retrieval Scheme Base on Blockchain) for retrieving images based on blockchain. We used the data structure called amplifying locality sensitive hashing (ALSH) to improve search accuracy. Searchable symmetric en-cryption(SSE) and ALSH used to realize the encryption retrieval of image index on the blockchain. Our scheme also uses IPFS to replace the cloud server to realize distributed storage, and uses secret sharing scheme to realize the access control. We implemented and evaluated the scheme in Ethereum, and the results show that our scheme is efficient and accurate in finding similar images while preserving privacy. The overall overhead is reasonable. © 2022 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：