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

IEEE International Conference on Robotics and Automation (ICRA)

作者： Haicheng Liao Shangqian Liu Yongkang Li Zhenning Li Chengyue Wang Yunjian Li Shengbo Eben Li Chengzhong Xu State Key Laboratory of Internet of Things for Smart City and Department of Computer and Information Science University of Macau Macau SAR China Department of Information and Software Engineering University of Electronic Science and Technology of China Chengdu China Departments of Civil and Environmental Engineering and Computer and Information Science State Key Laboratory of Internet of Things for Smart City University of Macau Macau SAR China State Key Laboratory of Internet of Things for Smart City and Departments of Civil and Environmental Engineering University of Macau Macau SAR China Faculty of Innovation Engineering Macau University of Science and Technology Macau SAR China School of Vehicle and Mobility Tsinghua University Beijing China

ISBN: (数字)9798350384574

ISBN: (纸本)9798350384581

In the burgeoning field of autonomous vehicles (AVs), trajectory prediction remains a formidable challenge, especially in mixed autonomy environments. Traditional approaches often rely on computational methods such as time-series analysis. Our research diverges significantly by adopting an interdisciplinary approach that integrates principles of human cognition and observational behavior into trajectory prediction models for AVs. We introduce a novel “adaptive visual sector” mechanism that mimics the dynamic allocation of attention human drivers exhibit based on factors like spatial orientation, proximity, and driving speed. Additionally, we develop a “dynamic traffic graph” using Convolutional Neural Networks (CNN) and Graph Attention Networks (GAT) to capture spatio-temporal dependencies among agents. Benchmark tests on the NGSIM, HighD, and MoCAD datasets reveal that our model (GAVA) outperforms state-of-the-art baselines by at least 15.2%, 19.4%, and 12.0%, respectively. Our findings underscore the potential of leveraging human cognition principles to enhance the proficiency and adaptability of trajectory prediction algorithms in AVs.

关键词： Adaptation models Visualization Time series analysis Predictive models Cognition Trajectory Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Time-aware Medication Recommendation via Intervention of Dynamic Treatment Regimes 25

Time-aware Medication Recommendation via Intervention of Dyn...

引用

34th ACM Web Conference, WWW 2025

作者： Li, Yishuo Zhang, Qi Lu, Wenpeng Peng, Xueping Zhang, Weiyu Si, Jiasheng Gong, Yongshun Hu, Liang Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Department of Computer Science and Technology Tongji University Shanghai China Australian Artificial Intelligence Institute University of Technology Sydney Sydney Australia School of Software Shandong University Jinan China

ISBN: (纸本)9798400712746

Medication recommendation aims to suggest personalized drug combinations to patients based on their longitudinal medical histories stored in electronic health record (EHR) datasets. Patients’ Dynamic Treatment Regimes (DTRs) determine how patients’ drug combinations change along with the evolution of disease treatment. DTRs are effective for comprehending disease-treatment dynamics and for recommending a timely and personalized combination of medications for patients. However, existing medication recommender systems (MRSs) overlook the multiple treatment pathways generated by the intervention of DTRs and can only recommend a single treatment paradigm, ignoring the fact that patients may be at different treatment stages and thus require different treatment regime. Such disregard leads to a significant limitation in recommending personalized medication combinations tailored to different treatment stages, yielding greatly compromised accuracy and applicability of MRSs. Moreover, existing methods often overlook the time interval information over patients’ successive visits, which is critical to indicate patients’ treatment evolution. To address these significant gaps, we propose a Time-aware Medication Recommendation Framework via Intervention of Dynamic Treatment Regimes, called MR-DTR. To explicitly illustrate the intervention processes of DTRs on similar patients, we employ a co-guided graph to connect various patient sequences. In addition, to fully utilize the time interval information, we design a time-aware guidance mechanism dedicated to the co-guided graph to efficiently learn medication representation using the patient’s guidance information. We also introduce relative time intervals in the encoder to act as positional information. Extensive experiments on two real-world datasets demonstrate that MR-DTR surpasses state-of-the-art models in terms of recommendation performance. © 2025 Copyright held by the owner/author(s).

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

Improving Deep Assertion Generation via Fine-Tuning Retrieval-Augmented Pre-trained Language Models

arXiv

引用

arXiv 2025年

作者： Zhang, Quanjun Fang, Chunrong Zheng, Yi Zhang, Yaxin Zhao, Yuan Huang, Rubing Zhou, Jianyi Yang, Yun Zheng, Tao Chen, Zhenyu Department of Computing Technologies Swinburne University of Technology Melbourne Australia State Key Laboratory for Novel Software Technology Nanjing University Jiangsu Nanjing China School of Computer Science and Engineering Macau University of Science and Technology Jiangsu Nanjing China Huawei Cloud Computing Technologies Co. Ltd. Beijing China Shenzhen Research Institute of Nanjing University Guangdong Shenzhen China

Unit testing validates the correctness of the units of the software system under test and serves as the cornerstone in improving software quality and reliability. To reduce manual efforts in writing unit tests, some techniques have been proposed to generate test assertions automatically, including deep learning (DL)-based, retrieval-based, and integration-based ones. Among them, recent integration-based approaches inherit from both DL-based and retrieval-based approaches and are considered state-of-the-art. Despite being promising, such integration-based approaches suffer from inherent limitations, such as retrieving assertions with lexical matching while ignoring meaningful code semantics, and generating assertions with a limited training corpus. In this paper, we propose a novel Retrieval-Augmented Deep Assertion Generation approach, namely RetriGen, based on a hybrid assertion retriever and a pre-trained language model (PLM)-based assertion generator. Given a focal-test, RetriGen first builds a hybrid assertion retriever to search for the most relevant test-assert pair from external codebases. The retrieval process takes both lexical similarity and semantical similarity into account via a token-based and an embedding-based retriever, respectively. RetriGen then treats assertion generation as a sequence-to-sequence task and designs a PLM-based assertion generator to predict a correct assertion with historical test-assert pairs and the retrieved external assertion. Although our concept is general and can be adapted to various off-the-shelf encoder-decoder PLMs, we implement RetriGen to facilitate assertion generation based on the recent CodeT5 model. We conduct extensive experiments to evaluate RetriGen against six state-of-the-art approaches across two large-scale datasets and two metrics. The experimental results demonstrate that RetriGen achieves 57.66% and 73.24% in terms of accuracy and CodeBLEU, outperforming all baselines with an average improvement of 50.66

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Not All Data Matters: An End-to-End Adaptive Dataset Pruning Framework for Enhancing Model Performance and Efficiency

arXiv

引用

arXiv 2023年

作者： Yang, Suorong Yang, Hongchao Guo, Suhan Shen, Furao Zhao, Jian National Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Technology Nanjing University China School of Artificial Intelligence Nanjing University China School of Electronic Science and Engineering Nanjing University China

While deep neural networks have demonstrated remarkable performance across various tasks, they typically require massive training data. Due to the presence of redundancies and biases in real-world datasets, not all data in the training dataset contributes to the model performance. To address this issue, dataset pruning techniques have been introduced to enhance model performance and efficiency by eliminating redundant training samples and reducing computational and memory overhead. However, previous works most rely on manually crafted scalar scores, limiting their practical performance and scalability across diverse deep networks and datasets. In this paper, we propose AdaPruner, an end-to-end Adaptive DAtaset PRUNing framEwoRk. AdaPruner can perform effective dataset pruning without the need for explicitly defined metrics. Our framework jointly prunes training data and fine-tunes models with task-specific optimization objectives. AdaPruner leverages (1) An adaptive dataset pruning (ADP) module, which iteratively prunes redundant samples to an expected pruning ratio;and (2) A pruning performance controller (PPC) module, which optimizes the model performance for accurate pruning. Therefore, AdaPruner exhibits high scalability and compatibility across various datasets and deep networks, yielding improved dataset distribution and enhanced model performance. AdaPruner can still significantly enhance model performance even after pruning up to 10-30% of the training data. Notably, these improvements are accompanied by substantial savings in memory and computation costs. Qualitative and quantitative experiments suggest that AdaPruner outperforms other state-of-the-art dataset pruning methods by a large margin. Copyright © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

VeriQBench: A Benchmark for Multiple Types of Quantum Circuits

arXiv

引用

arXiv 2022年

作者： Chen, Kean Fang, Wang Guan, Ji Hong, Xin Huang, Mingyu Liu, Junyi Wang, Qisheng Ying, Mingsheng State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Department of Computer Science and Technology Tsinghua University China The University of Chinese Academy of Sciences China Centre for Quantum Software and Information University of Technology Sydney Australia

In this paper, we introduce VeriQBench-an open source benchmark for quantum circuits. It offers high-level quantum circuit abstractions of various circuit types, including: 1) combinational, 2) dynamic, 3) sequen-tial, and 4) variational quantum circuits, which cover almost all existing types of quantum circuits in the literature. Meanwhile, VeriQBench is a versatile benchmark which can be used in verifying quantum software for different applications, as is evidenced by the existing works includ-ing quantum circuit verification (e.g., equivalence checking [Hon+21a;WLY21] and model checking [Yin21]), simulation (e.g., fault simulation), testing (e.g., test pattern generation [CY22]) and debugging (e.g., run-time assertions [Li+20b]). All the circuits are described in OpenQASM and are validated on Qiskit and QCOR simulators. With the hope that it can be used by other researchers, VeriQBench is released at: https:// ***/Veri-Q/Benchmark. © 2022, CC BY.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

YOLOO: You Only Learn from Others Once

arXiv

引用

arXiv 2024年

作者： Gu, Lipeng Wei, Mingqiang Yan, Xuefeng Zhu, Dingkun Zhao, Wei Xie, Haoran Liu, Yong-Jin School of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Shenzhen Institute of Research Nanjing University of Aeronautics and Astronautics Shenzhen China The School of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China The Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing China The School of Computer Science Jiangsu University of Technology Changzhou China The Division of Artificial Intelligence School of Data Science Lingnan University New Territories Hong Kong The MOE-Key Laboratory of Pervasive Computing Department of Computer Science and Technology Tsinghua University Beijing China

Multi-modal 3D multi-object tracking (MOT) typically necessitates extensive computational costs of deep neural networks (DNNs) to extract multi-modal representations. In this paper, we propose an intriguing question: May we learn from multiple modalities only during training to avoid multi-modal input in the inference phase? To answer it, we propose YOLOO, a novel multi-modal 3D MOT paradigm: You Only Learn from Others Once. YOLOO empowers the point cloud encoder to learn a unified tri-modal representation (UTR) from point clouds and other modalities, such as images and textual cues, all at once. Leveraging this UTR, YOLOO achieves efficient tracking solely using the point cloud encoder without compromising its performance, fundamentally obviating the need for computationally intensive DNNs. Specifically, YOLOO includes two core components: a unified tri-modal encoder (UTEnc) and a flexible geometric constraint (F-GC) module. UTEnc integrates a point cloud encoder with image and text encoders adapted from pretrained CLIP. It seamlessly fuses point cloud information with rich visual-textual knowledge from CLIP into the point cloud encoder, yielding highly discriminative UTRs that facilitate the association between trajectories and detections. Additionally, FGC filters out mismatched associations with similar representations but significant positional discrepancies. It further enhances the robustness of UTRs without requiring any scene-specific tuning, addressing a key limitation of customized geometric constraints (e.g., 3D IoU). Lastly, high-quality 3D trajectories are generated by a traditional data association component. By integrating these advancements into a multi-modal 3D MOT scheme, our YOLOO achieves substantial gains in both robustness and efficiency. Comprehensive experiments on KITTI and Waymo demonstrate the superior performance of our YOLOO over its twenty competitors. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Phase Estimation Algorithm for Quantum Speed-Up Multi-Party Computing

引用

computers, Materials & Continua 2021年第4期67卷 241-252页

作者： Wenbin Yu Hao Feng Yinsong Xu Na Yin Yadang Chen Zhi-Xin Yang Jiangsu Collaborative Innovation Center of Atmospheric Environment and Equipment Technology(CICAEET) Jiangsu Engineering Center of Network MonitoringSchool of Computer and SoftwareNanjing University of Information Science&TechnologyNanjing210044China Department of Computer Science and Engineering Michigan State UniversityEast Lansing48824MIUSA State Key Laboratory of Internet of Things for Smart City and Department of Electromechanical Engineering University of Macao999078Macao

Security and privacy issues have attracted the attention of researchers in the field of IoT as the information processing scale grows in sensor *** computing,theoretically known as an absolutely secure way to store and transmit information as well as a speed-up way to accelerate local or distributed classical algorithms that are hard to solve with polynomial complexity in computation or *** this paper,we focus on the phase estimation method that is crucial to the realization of a general multi-party computing model,which is able to be accelerated by quantum algorithms.A novel multi-party phase estimation algorithm and the related quantum circuit are proposed by using a distributed Oracle operator with *** proved theoretical communication complexity of this algorithm shows it can give the phase estimation before applying multi-party computing efficiently without increasing any additional ***,a practical problem of multi-party dating investigated shows it can make a successful estimation of the number of solution in advance with zero communication complexity by utilizing its special statistic *** simulations present the correctness,validity and efficiency of the proposed estimation method.

关键词： Edge computing security multi-party computing quantum algorithm phase estimation communication complexity

来源：评论

学校读者我要写书评

暂无评论

Approximate Equivalence Checking of Noisy Quantum Circuits 21

Approximate Equivalence Checking of Noisy Quantum Circuits

引用

Proceedings of the 58th Annual ACM/IEEE Design Automation Conference

作者： Xin Hong Mingsheng Ying Yuan Feng Xiangzhen Zhou Sanjiang Li Centre for Quantum Software and Information University of Technology Sydney Australia Centre for Quantum Software and Information University of Technology Sydney Australia and State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China and Department of Computer Science and Technology Tsinghua University China Centre for Quantum Software and Information University of Technology Sydney Australia and State Key Lab of Millimeter Waves Southeast University China

ISBN: (纸本)9781665432740

We study the fundamental design automation problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity which measures the average distance between output states of two super-operators when the input is chosen at random. By employing tensor network contraction, we present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation. The effectiveness of our algorithms is demonstrated by experimenting on benchmarks of real NISQ circuits. When compared with the state-of-the-art implementation incorporated in Qiskit, experimental results show that the proposed algorithms outperform in both efficiency and scalability.

关键词： quantum computing

来源：评论

学校读者我要写书评

暂无评论

An Efficient Quantum Private Comparison Protocol Based on Cluster state and Bell state 8th

An Efficient Quantum Private Comparison Protocol Based on Cl...

引用

8th International Conference on Artificial Intelligence and Security , ICAIS 2022

作者： Li, Chaoyang Qing, Hua Xu, Gang Chen, Xiubo Xin, Xiangjun Dong, Mianxiong Ota, Kaoru College of Software Engineering Zhengzhou University of Light Industry Zhengzhou450002 China School of Computing Science and Technology North China University of Technology Beijing100144 China Information Security Centre State Key Laboratory of Networking and Switching Technology Beijing University of Post and Telecommunications Beijing100876 China Department of Sciences and Informatics Muroran Institution of Technology Muroran050-8585 Japan

ISBN: (纸本)9783031067631

Quantum private comparison (QPC) is the quantum method that can compare the equality of the distrustful participants’ private information without leaking them. The 4-particle cluster state has a strong violation of local reality and shows to be robust against decoherence than any other 4-particle state. In this paper, a new efficient QPC protocol based on the entanglement swapping between the 4-particle cluster state and Bell state has been proposed. With the pre-shared secret key sequence between the two participants, the semi-honest third party (TP) can only execute the protocol’s processes without obtaining information about the participants’ secrets and the final comparison results. Then, we show that the proposed QPC protocol is secure against outside or participant attacks and more efficient than similar literature. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Categorical Data Clustering via Value Order Estimated Distance Metric Learning

arXiv

引用

arXiv 2024年

作者： Zhang, Yiqun Zhao, Mingjie Jia, Hong Lu, Yang Li, Mengke Cheung, Yiu-Ming School of Computer Science and Technology Guangdong University of Technology Guangzhou China College of Electronics and Information Engineering Shenzhen University Shenzhen China Fujian Key Laboratory of Sensing and Computing for Smart City School of Informatics Xiamen University China School of Computer Science and Software Engineering Shenzhen University Shenzhen China Department of Computer Science Hong Kong Baptist University Hong Kong

Categorical data composed of qualitative valued attributes are ubiquitous in machine learning tasks. Due to the lack of well-defined metric space, categorical data distributions are difficult to be intuitively understood. Clustering is a popular data analysis technique suitable for data distribution understanding. However, the success of clustering often relies on reasonable distance metrics, which happens to be what categorical data naturally lack. This paper therefore introduces a new finding that the order relation among attribute values is the decisive factor in clustering accuracy, and is also the key to understanding categorical data clusters, because the essence of clustering is to order the clusters in terms of their admission to samples. To obtain the orders, we propose a new learning paradigm that allows joint learning of clusters and the orders. It alternatively partitions the data into clusters based on the distance metric built upon the orders and estimates the most likely orders according to the clusters. The algorithm achieves superior clustering accuracy with a convergence guarantee, and the learned orders facilitate the understanding of the non-intuitive cluster distribution of categorical data. Extensive experiments with ablation studies, statistical evidence, and case studies have validated the new insight into the importance of value order and the method proposition. The source code is temporarily opened in https://***/r/OCL-demo. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：