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

第41届中国控制会议

作者： Linqian Yang Kexin Liu Zhenqian Wang Jinhu Lü Peizhu Zhou School of Automation Science and Electrical Engineering Beihang University School of Automation Science and Electrical Engineering the State Key Laboratory of Software Development Environment

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

In this paper,we focus on the Line-of-sight(LOS) information estimation for missiles with censored multi-dimensional *** this end,we first construct the nonlinear dynamic relative model between the missile and the target in 3D space to describe the correlated LOS ***,we build the measurement model including the censored measurement,which results from view limit constraints and uncensored measurement obtained from the geometric relationship or ***,an Improved Tobit Kalman filter is proposed to realize the measurement with two censoring limits and then the Improved Tobit Kalman filter is combined with the fifth-degree cubature Kalman filter to handle the nonlinearity of the dynamic ***,numerical simulations are given to demonstrate the effectiveness of our proposed algorithm.

关键词： Improved Tobit Kalman filter LOS information censored measurement Nonlinear system fifth-degree cubature Kalman filter

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

23rd IEEE International Conference on software Quality, Reliability, and Security, QRS 2023

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

ISBN: (纸本)9798350319583

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. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

m3P: Towards Multimodal Multilingual Translation with Multimodal Prompt

arXiv

引用

arXiv 2024年

作者： Yang, Jian Guo, Hongcheng Yin, Yuwei Bai, Jiaqi Wang, Bing Liu, Jiaheng Liang, Xinnian Chai, Linzheng Yang, Liqun Li, Zhoujun State Key Lab of Software Development Environment Beihang University China Department of Computer Science University of British Columbia Canada

Multilingual translation supports multiple translation directions by projecting all languages in a shared space, but the translation quality is undermined by the difference between languages in the text-only modality, especially when the number of languages is large. To bridge this gap, we introduce visual context as the universal language-independent representation to facilitate multilingual translation. In this paper, we propose a framework to leverage the multimodal prompt to guide the Multimodal Multilingual neural Machine Translation (m3P), which aligns the representations of different languages with the same meaning and generates the conditional vision-language memory for translation. We construct a multilingual multimodal instruction dataset (InstrMulti102) to support 102 languages Our method aims to minimize the representation distance of different languages by regarding the image as a central language. Experimental results show that m3P outperforms previous text-only baselines and multilingual multimodal methods by a large margin. Furthermore, the probing experiments validate the effectiveness of our method in enhancing translation under the low-resource and massively multilingual scenario. © 2024, CC BY.

关键词： Visual languages

来源：评论

学校读者我要写书评

暂无评论

UKF‐MOT:An unscented Kalman filter‐based 3D multi‐object tracker

引用

CAAI Transactions on Intelligence Technology 2024年第4期9卷 1031-1041页

作者： Meng Liu Jianwei Niu Yu Liu Collective Intelligence&Collaboration Laboratory China North Artificial Intelligence and Innovation Research InstituteBeijingChina China North Vehicle Research Institute BeijingChina State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijingChina State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijingChina School of Computer Science and Engineering Beihang UniversityBeijingChina

Multi‐object tracking in autonomous driving is a non‐linear *** better address the tracking problem,this paper leveraged an unscented Kalman filter to predict the object's *** the association stage,the Mahalanobis distance was employed as an affinity metric,and a Non‐minimum Suppression method was designed for *** the detections fed into the tracker and continuous‘predicting‐matching’steps,the states of each object at different time steps were described as their own continuous *** conducted extensive experiments to evaluate tracking accuracy on three challenging datasets(KITTI,nuScenes and Waymo).The experimental results demon-strated that our method effectively achieved multi‐object tracking with satisfactory ac-curacy and real‐time efficiency.

关键词： autonomous vehicle transportation

来源：评论

学校读者我要写书评

暂无评论

VGGAN: Visual Grounding GAN Using Panoptic Transformers

VGGAN: Visual Grounding GAN Using Panoptic Transformers

引用

International Conference on Image, Vision and Computing (ICIVC)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Monotonicity and nonmonotonicity in L3-valued propositional logic

引用

Frontiers of Computer Science 2022年第4期16卷 33-43页

作者： Wei Li Yuefei Sui State Key Laboratory of Software Development Environment Beihang UniversityBeijing100083China Key Laboratory of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of SciencesBeijing100190China School of Computer Science and Technology University of Chinese Academy of SciencesBeijing100049China

A sequent is a pair (Γ, Δ), which is true under an assignment if either some formula in Γ is false, or some formula in Δ is true. In L_(3)-valued propositional logic, a multisequent is a triple Δ∣Θ∣Γ, which is true under an assignment if either some formula in Δ has truth-value t, or some formula in Θ has truth-value m, or some formula in Γ has truth-value f. There is a sound, complete and monotonic Gentzen deduction system G for sequents. Dually, there is a sound, complete and nonmonotonic Gentzen deduction system G′ for co-sequents Δ: Θ: Γ. By taking different quantifiers some or every, there are 8 kinds of definitions of validity of multisequent Δ∣Θ∣Γ and 8 kinds of definitions of validity of co-multisequent Δ: Θ: Γ, and correspondingly there are 8 sound and complete Gentzen deduction systems for sequents and 8 sound and complete Gentzen deduction systems for co-sequents. Correspondingly their monotonicity is discussed.

关键词： sequent mulisequent gentzen deduction system monotonicity nonmonotonicity

来源：评论

学校读者我要写书评

暂无评论

A survey on federated learning:a perspective from multi-party computation

引用

Frontiers of Computer Science 2024年第1期18卷 93-103页

作者： Fengxia LIU Zhiming ZHENG Yexuan SHI Yongxin TONG Yi ZHANG Institute of Artificial Intelligence and Key Laboratory of Mathematics Informatics Behavioral Semantics Beihang UniversityBeijing 100191China State Key Laboratory of Software Development Environment and Advanced Innovation Center for Future Blockchain and Privacy Computing Beihang UniversityBeijing 100191China Pengcheng Laboratory Shenzhen 518055China Zhongguancun Laboratory Beijing 100190China Institute for Mathematical Sciences and Engineering Research Center of Financial Computing and Digital Engineering Renmin University of ChinaBeijing 100872China

Federated learning is a promising learning paradigm that allows collaborative training of models across multiple data owners without sharing their raw *** enhance privacy in federated learning,multi-party computation can be leveraged for secure communication and computation during model *** survey provides a comprehensive review on how to integrate mainstream multi-party computation techniques into diverse federated learning setups for guaranteed privacy,as well as the corresponding optimization techniques to improve model accuracy and training *** also pinpoint future directions to deploy federated learning to a wider range of applications.

关键词： sfederated learning multi-party ycomputation privacy-preserving data mining distributed learning

来源：评论

学校读者我要写书评

暂无评论

Fine-grained management of I/O optimizations based on workload characteristics

引用

Frontiers of Computer Science 2021年第3期15卷 33-46页

作者： Bing WEI Limin XIAO Bingyu ZHOU Guangjun QIN Baicheng YAN Zhisheng HUO State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China

With the advent of new computing paradigms,parallel file systems serve not only traditional scientific computing applications but also non-scientific computing applications,such as financial computing,business,and public *** file systems provide storage services for multiple *** a result,various requirements need to be ***,parallel file systems usually provide a unified storage solution,which cannot meet specific application *** this paper,an extended tile handle scheme is proposed to deal with this *** original file handle is extended to record I/O optimization information,which allows file systems to specify optimizations for a file or directory based on workload ***,fine-grained management of I/O optimizations can be *** the basis of the extended file handle scheme,data prefetching and small file optimization mechanisms are proposed for parallel file *** experimental results show that the proposed approach improves the aggregate throughput of the overall system by up to 189.75%.

关键词： parallel file systems workload characteristics extended file handle data prefetching small files

来源：评论

学校读者我要写书评

暂无评论

A More Practical Algorithm for Weighted First-Order Model Counting with Linear Order Axiom 27

A More Practical Algorithm for Weighted First-Order Model Co...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Meng, Qiaolan Tóth, Jan Wang, Yuanhong Wang, Yuyi Kuželka, Ondřej State Key Laboratory of Software Development Environment Beihang University China Faculty of Electrical Engineering Czech Technical University Prague Czech Republic CRRC Zhuzhou Insitute Zhuzhou China Tengen Intelligence Institute Zhuzhou China

ISBN: (纸本)9781643685489

We consider the task of weighted first-order model counting (WFOMC), a fundamental problem of probabilistic inference in statistical relational learning. The goal of WFOMC is to compute the weighted sum of models of a given first-order logic sentence over a finite domain, where each model is assigned a weight by a pair of weighting functions. Past work has shown that WFOMC can be solved in polynomial time in the domain size if the sentence is in the two-variable fragment of first-order logic (FO2). This result is later extended to the case where the sentence is in FO2 with the linear order axiom, which requires a binary predicate in the sentence to introduce a linear ordering of the domain elements. However, despite its polynomial theoretical complexity, the existing domain-liftable algorithm for WFOMC with the linear order often suffers from inefficiencies when applied to real-world problems. This paper introduces a novel domain-lifted algorithm for WFOMC with the linear order axiom. Compared to the existing approach, our proposed algorithm exploits the inherent symmetries within first-order logic sentences and weighting functions to minimize redundant computations. Experimental results verify the efficiency of our approach, demonstrating a significant speedup over the existing approach. © 2024 The Authors.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Experiments and Analyses of Anonymization Mechanisms for Trajectory Data Publishing

引用

Journal of Computer Science & Technology 2022年第5期37卷 1026-1048页

作者： She Sun Shuai Ma Jing-He Song Wen-Hai Yue Xue-Lian Lin Tiejun Ma State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang UniversityBeijing 100191China Department of Decision Analytics and Risk Southampton Business SchoolUniversity of Southampton Southampton SO171BJU.K

With the advancing of location-detection technologies and the increasing popularity of mobile phones and other location-aware devices,trajectory data is continuously *** large-scale trajectories provide opportunities for various applications,the locations in trajectories pose a threat to individual ***,there has been an interesting debate on the reidentifiability of individuals in the Science *** main finding of Sánchez et *** exactly opposite to that of De Montjoye et al.,which raises the first question:"what is the true situation of the privacy preservation for trajectories in terms of reidentification?''Furthermore,it is known that anonymization typically causes a decline of data utility,and anonymization mechanisms need to consider the trade-off between privacy and *** raises the second question:"what is the true situation of the utility of anonymized trajectories?''To answer these two questions,we conduct a systematic experimental study,using three real-life trajectory datasets,five existing anonymization mechanisms(i.e.,identifier anonymization,grid-based anonymization,dummy trajectories,k-anonymity andε-differential privacy),and two practical applications(i.e.,travel time estimation and window range queries).Our findings reveal the true situation of the privacy preservation for trajectories in terms of reidentification and the true situation of the utility of anonymized trajectories,and essentially close the debate between De Montjoye et *** Sánchez et *** the best of our knowledge,this study is among the first systematic evaluation and analysis of anonymized trajectories on the individual privacy in terms of unicity and on the utility in terms of practical applications.

关键词： anonymization privacy reidentification trajectory utility

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：