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

IEEE Transactions on Intelligent Vehicles 2024年 1-12页

作者： Zhang, Yanan Zhou, Chao Huang, Di State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China

Existing 3D object detection suffers from expensive annotation costs and poor transferability to unknown data due to the domain gap, Unsupervised Domain Adaptation (UDA) aims to generalize detection models trained in labeled source domains to perform robustly on unexplored target domains, providing a promising solution for cross-domain 3D object detection. Although Self-Training (ST) based cross-domain 3D detection methods with the assistance of pseudo-labeling techniques have achieved remarkable progress, they still face the issue of low-quality pseudo-labels when there are significant domain disparities due to the absence of a process for feature distribution alignment. While Adversarial Learning (AL) based methods can effectively align the feature distributions of the source and target domains, the inability to obtain labels in the target domain forces the adoption of asymmetric optimization losses, resulting in a challenging issue of source domain bias. To overcome these limitations, we propose a novel unsupervised domain adaptation framework for 3D object detection via collaborating ST and AL, dubbed as STAL3D, unleashing the complementary advantages of pseudo labels and feature distribution alignment. Additionally, a Background Suppression Adversarial Learning (BS-AL) module and a Scale Filtering Module (SFM) are designed tailored for 3D cross-domain scenes, effectively alleviating the issues of the large proportion of background interference and source domain size bias. Our STAL3D achieves state-of-the-art performance on multiple cross-domain tasks and even surpasses the Oracle results on Waymo $\rightarrow$ KITTI and Waymo $\rightarrow$ KITTI-rain. IEEE

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

ALSTNet:Autoencoder fused long-and short-term time-series network for the prediction of tunnel structure

引用

Deep Underground Science and Engineering 2025年第1期4卷 72-82页

作者： Bowen Du Haohan Liang Yuhang Wang Junchen Ye Xuyan Tan Weizhong Chen State Key Laboratory of Software Development Environment Beihang UniversityBeijingChina State Key Laboratory of Geomechanics and Geotechnical Engineering Institute of Rock and Soil MechanicsChinese Academy of SciencesWuhanChina

It is crucial to predict future mechanical behaviors for the prevention of structural *** for underground construction,the structural mechanical behaviors are affected by multiple internal and external factors due to the complex *** that the existing models fail to take into account all the factors and accurate prediction of the multiple time series simultaneously is difficult using these models,this study proposed an improved prediction model through the autoencoder fused long-and short-term time-series network driven by the mass number of monitoring ***,the proposed model was formalized on multiple time series of strain monitoring ***,the discussion analysis with a classical baseline and an ablation experiment was conducted to verify the effectiveness of the prediction *** the results indicate,the proposed model shows obvious superiority in predicting the future mechanical behaviors of *** a case study,the presented model was applied to the Nanjing Dinghuaimen tunnel to predict the stain variation on a different time scale in the future.

关键词： autoencoder deep learning structural health monitoring time-series prediction

来源：评论

学校读者我要写书评

暂无评论

Pushing the Limit of Post-Training Quantization

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2025年第7期47卷 5556-5570页

作者： Gong, Ruihao Liu, Xianglong Li, Yuhang Fan, Yunqiang Wei, Xiuying Guo, Jinyang Beihang University State Key Laboratory of Complex & Critical Software Environment Beijing100191 China Yale University New HavenCT06511 United States ShanghaiTech University Shanghai201210 China Beihang University State Key Laboratory of Complex & Critical Software Environment Institute of Artificial Intelligence Beijing100191 China

Recently, post-training quantization (PTQ) has become the de facto way to produce efficient low-precision neural networks without long-time retraining. Despite its low cost, current PTQ works fail to succeed under the extremely low-bit setting. In this work, we delve into extremely low-bit quantization and construct a unified theoretical analysis, which provides an in-depth understanding of the reason for the failure of low-bit quantization. According to the theoretical study, we argue that the existing methods fail in low-bit schemes due to significant perturbation on weights and lack of consideration of activation quantization. To this end, we propose Brecq and QDrop to respectively solve these two challenges, based on which a Q-Limit framework is constructed. Then the Q-Limit framework is further extended to support a mixed precision quantization scheme. To the best of our knowledge, this is the first work that can push the limit of PTQ down to INT2. Extensive experiments on various handcrafted and searched neural architectures are conducted for both visual recognition/detection tasks and language processing tasks. Without bells and whistles, our PTQ framework can attain low-bit ResNet and MobileNetV2 comparable with quantization-aware training (QAT), establishing a new state-of-the-art for PTQ. Our code has been open-sourced at https://***/ModelTC/MQBench/. © 1979-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

swSpAMM:optimizing large-scale sparse approximate matrix multiplication on Sunway Taihulight

引用

Frontiers of Computer Science 2023年第4期17卷 29-41页

作者： Xiaoyan LIU Yi LIU Bohong YIN Hailong YANG Zhongzhi LUAN Depei QIAN State Key Laboratory of Software Development Environment Beijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China

Although matrix multiplication plays an essential role in a wide range of applications,previous works only focus on optimizing dense or sparse matrix *** Sparse Approximate Matrix Multiply(SpAMM)is an algorithm to accelerate the multiplication of decay matrices,the sparsity of which is between dense and sparse *** addition,large-scale decay matrix multiplication is performed in scientific applications to solve cutting-edge *** optimize large-scale decay matrix multiplication using SpAMM on supercomputers such as Sunway Taihulight,we present swSpAMM,an optimized SpAMM algorithm by adapting the computation characteristics to the architecture features of Sunway ***,we propose both intra-node and inter-node optimizations to accelerate swSpAMM for large-scale *** intra-node optimizations,we explore algorithm parallelization and block-major data layout that are tailored to better utilize the architecture advantage of Sunway *** inter-node optimizations,we propose a matrix organization strategy for better distributing sub-matrices across nodes and a dynamic scheduling strategy for improving load balance across *** compare swSpAMM with the existing GEMM library on a single node as well as large-scale matrix multiplication methods on multiple *** experiment results show that swSpAMM achieves a speedup up to 14.5×and 2.2×when compared to xMath library on a single node and 2D GEMM method on multiple nodes,respectively.

关键词： approximate calculation sunway processor performance optimization

来源：评论

学校读者我要写书评

暂无评论

Rumor Detection on Social Media with Temporal Propagation Structure Optimization 31

Rumor Detection on Social Media with Temporal Propagation St...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Peng, Xingyu Wu, Junran Liu, Ruomei Xu, Ke State Key Laboratory of Complex & Critical Software Environment Beihang University Beijing China

ISBN: (纸本)9798891761964

Traditional methods for detecting rumors on social media primarily focus on analyzing textual content, often struggling to capture the complexity of online interactions. Recent research has shifted towards leveraging graph neural networks to model the hierarchical conversation structure that emerges during rumor propagation. However, these methods tend to overlook the temporal aspect of rumor propagation and may disregard potential noise within the propagation structure. In this paper, we propose a novel approach that incorporates temporal information by constructing a weighted propagation tree, where the weight of each edge represents the time interval between connected posts. Drawing upon the theory of structural entropy, we transform this tree into a coding tree. This transformation aims to preserve the essential structure of rumor propagation while reducing noise. Finally, we introduce a recursive neural network to learn from the coding tree for rumor veracity prediction. Experimental results on two common datasets demonstrate the superiority of our approach. © 2025 Association for Computational Linguistics.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

ValidGen: A Tool for Automatic Generation of Validation Scripts to Support Rapid Requirements Validation 24

ValidGen: A Tool for Automatic Generation of Validation Scri...

引用

46th International Conference on software Engineering: Companion, ICSE-Companion 2024

作者： Pan, Hongyue Yang, Yilong School of Software Beihang University State Key Laboratory of Complex & Critical Software Environment Beijing China

ISBN: (纸本)9798400705021

Rapid prototyping is an effective way for requirement validation in the earliest stages of software development. Our previous work, RM2PT, can automatically generate software prototypes from requirements models to support incremental and rapid requirements validation. This paper proposes a CASE tool named ValidGen based on RM2PT, which can automatically generate validation scripts to execute the prototype. Thanks to these validation scripts, the stakeholder only needs to monitor the execution process without selecting the system operation and typing the input parameters, which significantly reduces the time and effort needed for validating requirements. We adopted three case studies to evaluate the tool, and the results show that the tool requires only about 60% of the time for requirements validation compared to traditional methods. Overall, the results were satisfactory. The proposed tool can be further extended and applied for requirements validation in the software industry. The tool can be downloaded at https://***/advs/validgen/, and a demo video is at https://***/AP9Ymg1ewIA. © 2024 IEEE Computer Society. All rights reserved.

关键词： software prototyping

来源：评论

学校读者我要写书评

暂无评论

VGGAN: Visual Grounding GAN Using Panoptic Transformers 8

VGGAN: Visual Grounding GAN Using Panoptic Transformers

引用

8th International Conference on Image, Vision and Computing, ICIVC 2023

作者： Quan, Fengnan Lang, Bo Beihang University State Key Laboratory of Software Development Environment Beijing China Beihang University State Key Laboratory of Software Development Environment Zhongguancun Laboratory Beijing China

ISBN: (纸本)9798350335231

Visual Grounding is an important part of image annotation generation. The existing methods usually use data alignment based on the similarity calculation of visual text features in location inference and multi-modal fusion, which will lose visual and text information to some extent, and is more likely to make the model overfit the data of specific scenes. To solve this problem, we propose a Visual Grounding Generative Adversarial Network (VGGAN) for visual text fusion using the panoptic transformer. We use the generative adversarial network to generate the prediction, judge the accuracy, and design the visual text transformer according to the panoptic theory. The model can retain the feature information, realize the full interactions between features, thereby better supporting the feature fusion of visual and text. Experimental results on the COCO dataset of complex daily scenes verify the effectiveness of our model, and our model achieves the highest prediction accuracy compared with the state-of-the-art methods. © 2023 IEEE.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Exploration via Temporal Inconsistency in Reinforcement Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第11期5卷 5530-5539页

作者： Gao, Zijian Xu, Kele Zhai, Yuanzhao Ding, Bo Feng, Dawei Mao, Xinjun Wang, Huaimin National University of Defense Technology School of Computer Changsha410000 China State Key Laboratory of Complex and Critical Software Environment Beijing100191 China

In sparse extrinsic reward settings, reinforcement learning remains a challenge despite increasing interest in this field. Existing approaches suggest that intrinsic rewards can alleviate issues caused by reward sparsity. However, many studies overlook the critical role of temporal information, essential for human curiosity. This article introduces a novel intrinsic reward mechanism inspired by human learning processes, where curiosity is evaluated by comparing current observations with historical knowledge. Our method involves training a self-supervised prediction model, periodically saving snapshots of the model parameters, and employing the nuclear norm to assess the temporal inconsistency between predictions from different snapshots as intrinsic rewards. Additionally, we propose a variational weighting mechanism to adaptively assign weights to the snapshots, enhancing the model's robustness and performance. Experimental results across various benchmark environments demonstrate the efficacy of our approach, which outperforms other state-of-the-art methods without incurring additional training costs and exhibits higher noise tolerance. Our findings indicate that leveraging temporal information in intrinsic rewards can significantly improve exploration performance, motivating future research to develop more robust and accurate reward systems for reinforcement learning. © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Secure Mutual Authentication Protocol Based on Visual Cryptography Technique for IoT-Cloud

引用

Chinese Journal of Electronics 2024年第1期33卷 43-57页

作者： Brou Bernard Ehui Chen CHEN Shirui WANG Hua GUO Jianwei LIU School of Cyber Sciences and Technology Beihang University State Key Laboratory of Software Development Environment Beihang University Sino-French Engineering School Beihang University Beihang Hangzhou Innovation Institute Yuhang

Because of the increasing number of threats in the IoT cloud, an advanced security mechanism is needed to guard data against hacking or attacks. A user authentication mechanism is also required to authenticate the user accessing the cloud services. The conventional cryptographic algorithms used to provide security mechanisms in cloud networks are often vulnerable to various cyber-attacks and inefficient against new attacks. Therefore,developing new solutions based on different mechanisms from traditional cryptography methods is required to protect data and users' privacy from attacks. Different from the conventional cryptography method, we suggest a secure mutual authentication protocol based on the visual cryptography technique in this paper. We use visual cryptography to encrypt and decrypt the secret images. The mutual authentication is based on two secret images and *** user requests the ticket from the authentication server(AS) to obtain the permission for accessing the cloud services. Three shared secret keys are used for encrypting and decrypting the authentication process. We analyze the protocol using the Barrows-Abadi-Needham(BAN)-logic method and the results show that the protocol is robust and can protect the user against various attacks. Also, it can provide a secure mutual authentication mechanism.

关键词： Internet of things Visual cryptography Security Mutual authentication IoT-cloud

来源：评论

学校读者我要写书评

暂无评论

Effective Exploration Based on the Structural Information Principles 38

Effective Exploration Based on the Structural Information Pr...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zeng, Xianghua Peng, Hao Li, Angsheng State Key Laboratory of Software Development Environment Beihang University Beijing China Zhongguancun Laboratory Beijing China

Traditional information theory provides a valuable foundation for Reinforcement Learning (RL), particularly through representation learning and entropy maximization for agent exploration. However, existing methods primarily concentrate on modeling the uncertainty associated with RL's random variables, neglecting the inherent structure within the state and action spaces. In this paper, we propose a novel Structural Information principles-based Effective Exploration framework, namely SI2E. Structural mutual information between two variables is defined to address the single-variable limitation in structural information, and an innovative embedding principle is presented to capture dynamics-relevant state-action representations. The SI2E analyzes value differences in the agent's policy between state-action pairs and minimizes structural entropy to derive the hierarchical state-action structure, referred to as the encoding tree. Under this tree structure, value-conditional structural entropy is defined and maximized to design an intrinsic reward mechanism that avoids redundant transitions and promotes enhanced coverage in the state-action space. Theoretical connections are established between SI2E and classical information-theoretic methodologies, highlighting our framework's rationality and advantage. Comprehensive evaluations in the MiniGrid, MetaWorld, and DeepMind Control Suite benchmarks demonstrate that SI2E significantly outperforms state-of-the-art exploration baselines regarding final performance and sample efficiency, with maximum improvements of 37.63% and 60.25%, respectively. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：