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

arXiv 2024年

作者： Zhang, Guoqing Liu, Tianqi Fang, Wenxuan Zheng, Yuhui School of Computer Science Nanjing University of Information Science and Technology Nanjing China The State Key Laboratory of Tibetan Intelligent Information Processing and Application Qinghai Normal University Xining China

Group re-identification (re-ID) aims to match groups with the same people under different cameras, mainly involves the challenges of group members and layout changes well. Most existing methods usually use the k-nearest neighbor algorithm to update node features to consider changes in group membership, but these methods cannot solve the problem of group layout changes. To this end, we propose a novel vision transformer based random walk framework for group re-ID. Specifically, we design a vision transformer based on a monocular depth estimation algorithm to construct a graph through the average depth value of pedestrian features to fully consider the impact of camera distance on group members relationships. In addition, we propose a random walk module to reconstruct the graph by calculating affinity scores between target and gallery images to remove pedestrians who do not belong to the current group. Experimental results show that our framework is superior to most methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

Towards a Holistic Understanding of Mathematical Questions with Contrastive Pre-training

arXiv

引用

arXiv 2023年

作者： Ning, Yuting Huang, Zhenya Lin, Xin Chen, Enhong Tong, Shiwei Gong, Zheng Wang, Shijin Anhui Province Key Laboratory of Big Data Analysis and Application School of Computer Science and Technology University of Science and Technology of China China State Key Laboratory of Cognitive Intelligence China iFLYTEK Co. Ltd China

Understanding mathematical questions effectively is a crucial task, which can benefit many applications, such as difficulty estimation. Researchers have drawn much attention to designing pre-training models for question representations due to the scarcity of human annotations (e.g., labeling difficulty). However, unlike general free-format texts (e.g., user comments), mathematical questions are generally designed with explicit purposes and mathematical logic, and usually consist of more complex content, such as formulas, and related mathematical knowledge (e.g., Function). Therefore, the problem of holistically representing mathematical questions remains underexplored. To this end, in this paper, we propose a novel contrastive pre-training approach for mathematical question representations, namely QuesCo, which attempts to bring questions with more similar purposes closer. Specifically, we first design two-level question augmentations, including content-level and structure-level, which generate literally diverse question pairs with similar purposes. Then, to fully exploit hierarchical information of knowledge concepts, we propose a knowledge hierarchy-aware rank strategy (KHAR), which ranks the similarities between questions in a fine-grained manner. Next, we adopt a ranking contrastive learning task to optimize our model based on the augmented and ranked questions. We conduct extensive experiments on two real-world mathematical datasets. The experimental results demonstrate the effectiveness of our model. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Enhanced Fine-Tuning of Lightweight Domain-Specific Q&A Model Based on Large Language Models

Enhanced Fine-Tuning of Lightweight Domain-Specific Q&A Mode...

引用

IEEE International Conference on Software Reliability Engineering Workshops (ISSRE Wksp)

作者： Shenglin Zhang Pengtian Zhu Minghua Ma Jiagang Wang Yongqian Sun Dongwen Li Jingyu Wang Qianying Guo Xiaolei Hua Lin Zhu Dan Pei Nankai University Haihe Laboratory of Information Technology Application Innovation Microsoft Tsinghua University Tianjin Key Laboratory of Software Experience and Human Computer Interaction China Mobile Research Institute Beijing National Research Center for Information Science and Technology

ISBN: (数字)9798350367041

ISBN: (纸本)9798350367058

Large language models (LLMs) excel at general question-answering (Q&A) but often fall short in specialized domains due to a lack of domain-specific knowledge. Commercial companies face the dual challenges of privacy protection and resource constraints when involving LLMs for fine-tuning. This paper propose a novel framework, Self-Evolution, designed to address these issues by leveraging lightweight open-source LLMs through multiple iterative fine-tuning rounds. To enhance the efficiency of iterative fine-tuning, Self-Evolution employ a strategy that filters and reinforces the knowledge with higher value during the iterative process. We employed Self-Evolution on Qwen1.5-7B-Chat using 4,000 documents containing rich domain knowledge from China Mobile, achieving a performance score 174% higher on domain-specific question-answering evaluations than Qwen1.5-7B-Chat and even 22% higher than Qwen1.5-72B-Chat. Self-Evolution has been deployed in China Mobile’s daily operation and maintenance for 117 days, and it improves the efficiency of locating alarms, fixing problems, and finding related reports, with an average efficiency improvement of over 18.6%. In addition, we release Self-Evolution framework code in https://***/Zero-Pointer/Self-Evolution.

关键词： Privacy Filters Large language models Conferences Software reliability Maintenance Iterative methods Data mining Protection Faces

来源：评论

学校读者我要写书评

暂无评论

Reliability Analysis of Heterogeneous Sensor-Cloud Systems against Targeted Attacks

引用

China Communications 2022年第8期19卷 181-197页

作者： Hao Peng Zhen Qian Guangquan Xu Kejie Mao Kangtian Li Dandan Zhao Department of Computer Science and Engineering Zhejiang Normal UniversityJinhua Zhejiang 321004China Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province Zhejiang Normal UniversityJinhua Zhejiang 321004China The Big Data School Qingdao Huanghai UniversityQingdao Shandong 266427China College of Intelligence and Computing Tianjin UniversityTianjin 300072China

Based on the wide application of cloud computing and wireless sensor networks in various fields,the Sensor-Cloud System(SCS)plays an indispensable role between the physical world and the network ***,due to the close connection and interdependence between the physical resource network and computing resource network,there are security problems such as cascading failures between systems in the *** this paper,we propose a model with two interdependent networks to represent a sensor-cloud ***,based on the percolation theory,we have carried out a formulaic theoretical analysis of the whole process of cascading *** the system’s subnetwork presents a steady state where there is no further collapse,we can obtain the largest remaining connected subgroup components and the penetration ***,this result is the critical maximum that the coupled SCS can *** verify the correctness of the theoretical results,we further carried out actual simulation *** results show that a scale-free network priority attack’s percolation threshold is always less than that of ER network which is priority ***,when the scale-free network is attacked first,adding the power law exponentλcan be more intuitive and more effective to improve the network’s reliability.

关键词： sensor-cloud systems targeted attacks heterogeneous networks reliability analysis system security

来源：评论

学校读者我要写书评

暂无评论

Bit-mask Robust Contrastive Knowledge Distillation for Unsupervised Semantic Hashing

arXiv

引用

arXiv 2024年

作者： He, Liyang Chen, Enhong Huang, Zhenya Wang, Fei Wang, Shijin Liu, Jiayu Sha, Jing School of Computer Science and Technology University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China Anhui Province Key Laboratory of Big Data Analysis and Application University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China State Key Laboratory of Cognitive Intelligence Hefei China School of Data Science University of Science and Technology of China State Key Laboratory of Cognitive Intelligence Hefei China iFLYTEK AI Research State Key Laboratory of Cognitive Intelligence Hefei China

Unsupervised semantic hashing has emerged as an indispensable technique for fast image search, which aims to convert images into binary hash codes without relying on labels. Recent advancements in the field demonstrate that employing large-scale backbones (e.g., ViT) in unsupervised semantic hashing models can yield substantial improvements. However, the inference delay has become increasingly difficult to overlook. Knowledge distillation provides a means for practical model compression to alleviate this delay. Nevertheless, the prevailing knowledge distillation approaches are not explicitly designed for semantic hashing. They ignore the unique search paradigm of semantic hashing, the inherent necessities of the distillation process, and the property of hash codes. In this paper, we propose an innovative Bit-mask Robust Contrastive knowledge Distillation (BRCD) method, specifically devised for the distillation of semantic hashing models. To ensure the effectiveness of two kinds of search paradigms in the context of semantic hashing, BRCD first aligns the semantic spaces between the teacher and student models through a contrastive knowledge distillation objective. Additionally, to eliminate noisy augmentations and ensure robust optimization, a cluster-based method within the knowledge distillation process is introduced. Furthermore, through a bit-level analysis, we uncover the presence of redundancy bits resulting from the bit independence property. To mitigate these effects, we introduce a bit mask mechanism in our knowledge distillation objective. Finally, extensive experiments not only showcase the noteworthy performance of our BRCD method in comparison to other knowledge distillation methods but also substantiate the generality of our methods across diverse semantic hashing models and backbones. The code for BRCD is available at https://***/hly1998/BRCD. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Long and Recent Preference Learning with Recent-k Items Distribution for Recommender System

引用

IEEE Transactions on Multimedia 2025年

作者： Gao, Yongbiao Niu, Sijie Lv, Guohua Ling, Miaogen Geng, Xin Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Jinan China Southeast University Ministry of Education Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Application China University of Jinan Shandong Provincial Key Laboratory of Ubiquitous Intelligent Computing School of Information Science and Engineering China Nanjing University of Information Science and Technology School of Computer Science China Southeast University School of Computer Science and Engineering China

Reinforcement learning (RL) aims to formulate the recommendation task as a Markov decision process (MDP) and trains an agent to automatically learn the optimal recommendation policy from interaction trajectories through trial-and-error and reward mechanisms. However, most existing RL-based approaches overlook the correlation between items and the dynamics of user interests implied in temporally close interactions. Therefore, in this paper, we propose a reinforcement learning method that incorporates a "recent-k items"distribution to capture users' local preferences. Specifically, we model the output layer as two distinct branches. The "recent-k items"branch, formulated with a Kullback-Leibler divergence loss, learns the recent interests of users, whereas the other branch utilizes a one-step temporal difference error to capture long-term preferences. The proposed structure is integrated into deep Q-learning and actor-critics, resulting in two enhanced methods named R k Q and R k AC, respectively. Furthermore, a novel soft inter-reward is carefully designed to enhance the proposed method, and we theoretically prove the convergence of the proposed algorithm. We perform extensive experiments on two large real-world datasets and conduct further analysis of the influences of different action sequences, time intervals, and enhancement capabilities for state-of-the-art models. The experimental results demonstrate the efficacy of our proposed methods. © 1999-2012 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

GGTS: FPGA-Based General Ground Test System for Space-Borne Equipment 6

GGTS: FPGA-Based General Ground Test System for Space-Borne ...

引用

6th IEEE International Conference on computer and Communication Systems, ICCCS 2021

作者： Mang, Jialu Qiu, Zhiliang Pan, Weitao Dong, Meng Wu, Min State Key Laboratory of the Integrated Services Networks Xidian University Xi'an China Beijing Institute of Computer Technology and Application Beijing China

ISBN: (纸本)9780738126043

Space-borne equipment has the characteristics of long in-orbit work cycle, high risk, high development cost, and high maintenance cost. Therefore, it needs to pass the satellite payload ground test before launching. As different space-borne equipment has different testing requirements, it is necessary to develop a variety of corresponding ground test equipment, which leads to problems such as high development costs, long cycles, and difficult software maintenance and updates. This paper designs a set of FPGA-based ground test system for space-borne equipment based on the demand characteristics of satellite equipment ground testing. The system integrates the external interfaces of different onboard equipment into a universal interface adapter, and combines the network tester to test the functions and performance of the onboard equipment. The system efficiently solves the problem of repeated development of ground testing equipment and improves the efficiency of ground testing of space-borne equipment. The application results show that the system has significantly improved the test efficiency in the ground test. © 2021 IEEE.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Domain Adaptive Code Completion via Language Models and Decoupled Domain Databases 23

Domain Adaptive Code Completion via Language Models and Deco...

引用

Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering

作者： Ze Tang Jidong Ge Shangqing Liu Tingwei Zhu Tongtong Xu Liguo Huang Bin Luo National Key Laboratory for Novel Software Technology Nanjing University China Nanyang Technological University Singapore Huawei Software Engineering Application Technology China Department of Computer Science Southern Methodist University USA

ISBN: (纸本)9798350329964

Large Language Models (LLMs) have demonstrated remarkable performance in code completion. However, due to the lack of domain-specific knowledge, they may not be optimal in completing code that requires intensive domain knowledge for example completing the library names. Although there are several works that have confirmed the effectiveness of fine-tuning techniques to adapt language models for code completion in specific domains. They are limited by the need for constant fine-tuning of the model when the project is in constant *** address this limitation, in this paper, we propose kNM-LM, a retrieval-augmented language model (R-LM), that integrates domain knowledge into language models without fine-tuning. Different from previous techniques, our approach is able to automatically adapt to different language models and domains. Specifically, it utilizes the in-domain code to build the retrieval-based database decoupled from LM, and then combines it with LM through Bayesian inference to complete the code. The extensive experiments on the completion of intra-project and intra-scenario have confirmed that kNM-LM brings about appreciable enhancements when compared to CodeGPT and UnixCoder. A deep analysis of our tool including the responding speed, storage usage, specific type code completion, and API invocation completion has confirmed that kNM-LM provides satisfactory performance, which renders it highly appropriate for domain adaptive code completion. Furthermore, our approach operates without the requirement for direct access to the language model's parameters. As a result, it can seamlessly integrate with black-box code completion models, making it easy to integrate our approach as a plugin to further enhance the performance of these models.

关键词： domain adaptive code completion

来源：评论

学校读者我要写书评

暂无评论

application of SNNS Model Based On Multi-Dimensional Attention In Drone Radio Frequency Signal Classification

Application of SNNS Model Based On Multi-Dimensional Attenti...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zheng Si Chao Liu Jianyu Liu Yinhao Zhou Henan Institute of Advanced Technology Zhengzhou University Zhengzhou Zhongke Institute of Integrated Circuit and System Application School of Computer Science Shanghai Key Laboratory of Data Science Fudan University

Spiking Neural Networks (SNNs) are attracting attention due to their energy efficiency and importance in neuromorphic computing. Therefore, we propose an SNN-based method for classifying drone RF signals in complex electromagnetic environments. Specifically, we designed a new SNNs model called Spiking-EfficientNet based on EfficientNetV2 and improved its performance with a multidimensional attention mechanism. Experimental results demonstrate that Spiking-EfficientNet achieved classification accuracy of 99.13% and 96.02% on the ZK RF and DroneDetectV2 datasets. Importantly, Spiking-EfficientNet not only outperforms traditional Artificial Neural Networks (ANNs) in performance, but also exhibits significantly lower energy consumption. The energy consumption is only 20.1% of EfficientNetV2, 2.56% of VGG11, 10.71% of ResNet18, and 61.15% of MobileNetV2. This study demonstrates the significant potential of SNNs in drone RF signal classification and provides a low-power solution.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A technique of internal relative transmission delay measurement and positioning error correction for GNSS pseudo-satellite systems

A technique of internal relative transmission delay measurem...

引用

IEEE Information technology and Mechatronics Engineering Conference (ITOEC)

作者： Yuexian Liang Li Zhao Yao Cheng Chunhui Li School of Computer Science and Engineering Guilin University of Electronic Technology Guilin China Guangxi Key Laboratory of Precision Navigation Technology and Application Guilin University of Electronic Technology Guilin China

Internal transmission delay is one of the inherent system parameters of pseudo-satellite transmitters, and it is also one of the factors affecting the positioning service accuracy of pseudo-satellite systems. Aiming at the influence of the internal delay inconsistency deviation caused by the inconsistent components characteristics of different pseudo-satellites, a method of relative delay mensuration and compensating inside the pseudo-satellite transmitter is proposed. According to the structural characteristics of pseudo-satellite transmitter and receiver, a transmission delay measurement model is established, the total transmission delay of the pseudo-satellite transceiver system is measured by high-precision instruments, and the relative internal transmission delay between other pseudo-satellites is obtained by difference method based on one of the pseudo-satellites. Starting from the carrier phase observation equation, the positioning correction model based on single-difference carrier phase is established, and the measured value is converted into the delay compensation factor in the positioning algorithm model for positioning solution. Through the comparative analysis of the experimental results of the positioning solution before and after correction, the method can improve the positioning accuracy effectively, and the feasibility of the method is verified.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：