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

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Qi, Guangfei Qu, Zhihao Lyu, Shen-Huan Jia, Ninghui Ye, Baoliu Key Laboratory of Water Big Data Technology of Ministry of Water Resources College of Computer Science and Software Engineering Hohai University Nanjing China National Key Laboratory for Novel Software Technology Nanjing University Nanjing China

ISBN: (纸本)9789819601189

Personalized Federated Learning (PFL) has gained significant attention for its ability to handle heterogeneous data effectively. Parameter decoupling is a typical approach to PFL. It decouples the model into a feature extractor and a classifier head, where the feature extractor is trained collaboratively to learn a common representation and the classifier head is personalized for local data. Since local training only learns personalized feature information and ignores global information, the generalization ability of the feature extractor is limited. To improve the performance of the local model, a feasible approach is to make the local feature extractor more generalized. However, prior work requires the transmission of additional feature data beyond the transmission of model parameters, which leads to privacy leakage and higher communication overhead. To address these shortcomings, we propose a PFL algorithm with feature alignment via knowledge distillation, named PFAKD. PFAKD enhances the training of local feature extractors by explicitly aligning each sample’s local features with global features, providing more detailed guidance. Meanwhile, it avoids additional communication overhead and the risk of privacy leakage. We conduct extensive experiments in heterogeneous data scenarios. PFAKD outperforms other state-of-the-art methods by up to 4.35% in terms of model accuracy. Our code is available at https://***/fei0829/PFAKD. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

引用

25th International Conference on Web Information Systems Engineering, WISE 2024

作者： Tu, Longchuan Meng, Shunmei Liu, Xiao Liu, Guanfeng Beheshti, Amin Zhang, Xuyun School of Computer Science and Engineering Nanjing University of Science and Technology Nanjin China State Key Laboratory for Novel Software Technology Nanjing University Nanjin China School of Computing Macquarie University Sydney Australia

ISBN: (纸本)9789819605699

Recently, graph neural networks(GNNs) have played a key crucial in many recommendation situations. In particular, contrastive learning-based hypergraph neural networks (HGNNs) are gradually becoming a research focus for addressing issues of data sparsity and noise. Despite many studies proving their outstanding performance, there are still some shortcomings: i) Most contrastive learning-based HGNNs primarily rely on cross-view contrastive learning, while neglecting contrastive learning on the interaction graph. ii) Utilizing node embedding for hypergraph structure learning is susceptible to the influence of low-quality representations, thereby constraining the learning capability of HGNNs. To address these issues, we offer a Semantic Similarity-based Graph Contrastive Learning framework (SSGCL), which aims to jointly learn representations with rich semantic information through within-view and cross-view contrastive learning. Specifically, we first introduce consistency contrastive learning, which captures self-supervised signals through semantic similarity between nodes and their neighborhoods. It better captures the unique features of nodes through the connections between nodes and their neighborhoods. Then, we utilize interaction graph learning hypergraph structure, promoting it to extract potential node connections and thus improving its ability to describe homogeneous node relationships. Experimental evaluations on three actual datasets show that SSGCL performs much better than the current baseline models. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Git Merge Conflict Resolution Leveraging Strategy Classification and LLM 23

Git Merge Conflict Resolution Leveraging Strategy Classifica...

引用

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

作者： Shen, Chaochao Yang, Wenhua Pan, Minxue Zhou, Yu Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology China Nanjing University State Key Laboratory for Novel Software Technology China

ISBN: (纸本)9798350319583

In the realm of collaborative software development, version control systems (VCS) like Git play an indispensable role, enabling concurrent development and facilitating seamless integration of disparate code contributions. Despite these benefits, merge conflicts resulting from simultaneous changes to identical code lines often pose significant challenges to the integration process. Addressing this challenge, our paper introduces a novel two-stage approach, termed as CHATMERGE, for resolving Git merge conflicts. CHATMERGE pioneers a unique strategy that employs machine learning to initially predict resolution strategies, and subsequently leverages a large language model, ChatGPT, to create resolutions for conflicts that necessitate complex resolution strategies. A series of comprehensive experiments validate CHATMERGE's efficacy, demonstrating its impressive alignment with historical manual resolutions and its superior performance relative to existing, publicly accessible tools. The paper further explores the influence of various classification algorithms and the prompt construction process for ChatGPT, providing further insights into the merge conflict resolution process. Moreover, to foster continued advancements in this area, CHATMERGE, along with its associated training and testing datasets, is made publicly available, offering a valuable resource for both developers and researchers. This work, therefore, provides both an innovative solution to merge conflict resolution and a strong foundation for future explorations in this domain. © 2023 IEEE.

关键词： Mergers and acquisitions

来源：评论

学校读者我要写书评

暂无评论

Momentum Posterior Regularization for Multi-hop Dense Retrieval 31

Momentum Posterior Regularization for Multi-hop Dense Retrie...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Xia, Zehua Wu, Yuyang Xia, Yiyun Nguyen, Cam-Tu State Key Laboratory for Novel Software Technology Nanjing University China School of Computer Science Nanjing University China School of Artificial Intelligence Nanjing University China

ISBN: (纸本)9798891761964

Multi-hop question answering (QA) often requires sequential retrieval (multi-hop retrieval), where each hop retrieves missing knowledge based on information from previous hops. To facilitate more effective retrieval, we aim to distill knowledge from a posterior retrieval, which has access to posterior information like an answer, into a prior retrieval used during inference when such information is unavailable. Unfortunately, current methods for knowledge distillation in one-time retrieval are ineffective for multi-hop QA due to two issues: 1) Posterior information is often defined as the response (i.e. the answer), which may not clearly connect to the query without intermediate retrieval;and 2) The large knowledge gap between prior and posterior retrievals makes existing distillation methods unstable, even resulting in performance loss. As such, we propose MoPo (Momentum Posterior Regularization) with two key innovations: 1) Posterior information of one hop is defined as a query-focus summary from the golden knowledge of the previous and current hops;2) We develop an effective training strategy where the posterior retrieval is updated along with the prior retrieval via momentum moving average method, allowing smoother and effective distillation. Experiments on HotpotQA and StrategyQA demonstrate that MoPo outperforms existing baselines in both retrieval and downstream QA tasks. © 2025 Association for Computational Linguistics.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

GridDroid--An Effective and Efficient Approach for Android Repackaging Detection Based on Runtime Graphical User Interface

引用

Journal of computer science & technology 2022年第1期37卷 147-181页

作者： Jun Ma Qing-Wei Sun Chang Xu Xian-Ping Tao State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China Department of Computer Science and Technology Nanjing UniversityNanjing 210023China Huatai Securities Co. Ltd.Nanjing 210019China

Repackaging brings serious threats to Android *** birthmark techniques are typically applied to detect repackaged *** based on apps'runtime graphical user interfaces(GUI)are effective,especially for obfuscated or encrypted ***,existing studies are time-consuming and not suitable for handling apps in large *** this paper,we propose an effective yet efficient dynamic GUI birthmark for Android ***,we run an app with automatically generated GUI events and dump its layout after each *** divide each dumped layout into a grid,count in each grid cell the vertices of boundary rectangles corresponding to widgets within the layout,and generate a feature vector to encode the *** layouts are merged at runtime,and finally we obtain a graph as the birthmark of the *** a pair of apps to be compared,we build a weighted bipartite graph from their birthmarks and apply a modified version of the maximum-weight-bipartite-matching algorithm to determine whether they form a repackaging pair(RP)or *** implement the proposed technique in a prototype,GridDroid,and apply it to detect RPs in three datasets involving 527 *** reports only six false negatives and seven false positives,and it takes GridDroid merely 20 microseconds on average to compare a pair of birthmarks.

关键词： Android apps dynamic software birthmark graphical user interface(GUI) repackaging detection

来源：评论

学校读者我要写书评

暂无评论

Classifying Authentic and Fake Anger Based on High-Performance LSTM Networks Model, Fuzzy Logic Model and Fully Connected Neural Network 4

Classifying Authentic and Fake Anger Based on High-Performan...

引用

4th International Conference on Advances in Electrical Engineering and computer Applications, AEECA 2023

作者： Chen, Kangyu Peng, Zhiyuan The University of Hong Kong Department of Computer Science Hong Kong Nanjing University State Key Laboratory For Novel Software Technology Nanjing China

ISBN: (纸本)9798350308082

Understanding human's emotion is a vital task in the computer science and machine learning. People could easily distinguish the genuine and posed anger while it could be difficult for computers to judge the authenticity of anger. In this paper, apart from the fully connected Neural Networks built in the previous research, methods of LSTM (Long short-term memory) Networks and Fuzzy logic classification are also built for telling the posed angers from genuine ones using limited data. Then the paper compared the performance of these three popular classification methods. Carefully designed modifications have been made on these models to increase the performance. © 2023 IEEE.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

A bytecode-based integrated detection and repair method for reentrancy vulnerabilities in smart contracts

IET Blockchain

引用

IET Blockchain 2024年第3期4卷 235-251页

作者： Feng, Zijun Feng, Yuming He, Hui Zhang, Weizhe Zhang, Yu School of Cyberspace Science Harbin Institute of Technology Harbin China School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Department of New Networks Peng Cheng Laboratory Shenzhen China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies Shenzhen China

The reentrancy vulnerability in smart contracts has caused significant losses in the digital currency economy. Existing solutions for detecting and repairing this vulnerability are limited in scope and lack a comprehensive framework. Additionally, there is currently a lack of guidance methods for effectively pinpointing the location of vulnerabilities. The proposed bytecode-level method addresses these challenges by incorporating a detection module, an auxiliary localization module, and a repair module. An opcode classification method is introduced using vulnerability features and a BiLSTM-Attention-based sequence model to enhance detection accuracy. To overcome difficulties in vulnerability localization, an auxiliary localization method based on data flow and control flow analysis is proposed, enabling developers to better locate vulnerabilities. Current reentrancy vulnerability repair methods are analyzed and strategies for three reachable patterns are proposed. The bytecode rewriting strategy utilizes Trampoline technology for repair, while a fuel optimization method reduces bytecode generation length to optimize gas costs. Through extensive experimental validation, the effectiveness and superiority of the proposed methods are confirmed, further validating the feasibility of the entire framework. Experimental results demonstrate that the framework offers enhanced protection against reentrancy vulnerability attacks in smart contracts. © 2023 The Authors. IET Blockchain published by John Wiley & Sons Ltd on behalf of The Institution of Engineering and technology.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

Global video object segmentation with spatial constraint module

引用

Computational Visual Media 2023年第2期9卷 385-400页

作者： Yadang Chen Duolin Wang Zhiguo Chen Zhi-Xin Yang Enhua Wu Engineering Research Center of Digital Forensics Ministry of EducationSchool of Computer and SoftwareNanjing University of Information Science and TechnologyNanjing 210044China State Key Laboratory of Internet of Things for Smart City Department of Electromechanical EngineeringUniversity of MacaoMacao 999078China State Key Laboratory of Computer Science Institute of SoftwareUniversity of Chinese Academy of SciencesBeijing 100190China Faculty of Science and Technology University of MacaoMacao 999078China

We present a lightweight and efficient semisupervised video object segmentation network based on the space-time memory *** some extent,our method solves the two difficulties encountered in traditional video object segmentation:one is that the single frame calculation time is too long,and the other is that the current frame’s segmentation should use more information from past *** algorithm uses a global context(GC)module to achieve highperformance,real-time *** GC module can effectively integrate multi-frame image information without increased memory and can process each frame in real ***,the prediction mask of the previous frame is helpful for the segmentation of the current frame,so we input it into a spatial constraint module(SCM),which constrains the areas of segments in the current *** SCM effectively alleviates mismatching of similar targets yet consumes few additional *** added a refinement module to the decoder to improve boundary *** model achieves state-of-the-art results on various datasets,scoring 80.1%on YouTube-VOS 2018 and a J&F score of 78.0%on DAVIS 2017,while taking 0.05 s per frame on the DAVIS 2016 validation dataset.

关键词： video object segmentation semantic segmentation global context(GC)module spatial constraint

来源：评论

学校读者我要写书评

暂无评论

Alignment efficient image-sentence retrieval considering transferable cross-modal representation learning

引用

Frontiers of computer science 2024年第1期18卷 77-91页

作者： Yang YANG Jinyi GUO Guangyu LI Lanyu LI Wenjie LI Jian YANG School of Computer Science and Engineering Nanjing University of Science and TechnologyNanjing 210094China Department of Computing Hong Kong Polytechnic UniversityHong Kong 100872China State Key Lab.for Novel Software Technology Nanjing UniversityNanjing 210094China 14th Research Institute of China Electronics Technology Group Corporation Nanjing 210094China guangyu.li2017@***

Traditional image-sentence cross-modal retrieval methods usually aim to learn consistent representations of heterogeneous modalities,thereby to search similar instances in one modality according to the query from another modality in *** basic assumption behind these methods is that parallel multi-modal data(i.e.,different modalities of the same example are aligned)can be obtained in *** other words,the image-sentence cross-modal retrieval task is a supervised task with the alignments as ***,in many real-world applications,it is difficult to realign a large amount of parallel data for new scenarios due to the substantial labor costs,leading the non-parallel multi-modal data and existing methods cannot be used *** the other hand,there actually exists auxiliary parallel multi-modal data with similar semantics,which can assist the non-parallel data to learn the consistent ***,in this paper,we aim at“Alignment Efficient Image-Sentence Retrieval”(AEIR),which recurs to the auxiliary parallel image-sentence data as the source domain data,and takes the non-parallel data as the target domain *** single-modal transfer learning,AEIR learns consistent image-sentence cross-modal representations of target domain by transferring the alignments of existing parallel ***,AEIR learns the image-sentence consistent representations in source domain with parallel data,while transferring the alignment knowledge across domains by jointly optimizing a novel designed cross-domain cross-modal metric learning based constraint with intra-modal domain adversarial ***,we can effectively learn the consistent representations for target domain considering both the structure and semantic ***,extensive experiments on different transfer scenarios validate that AEIR can achieve better retrieval results comparing with the baselines.

关键词： image-sentence retrieval transfer learning semantic transfer structure transfer

来源：评论

学校读者我要写书评

暂无评论

Constraint-aware and multi-objective optimization for micro-service composition in mobile edge computing

Constraint-aware and multi-objective optimization for micro-...

引用

作者： Wu, Jintao Zhang, Jingyi Zhang, Yiwen Wen, Yiping School of Software Nanjing University of Information Science and Technology Nanjing China School of Computer Science and Technology Anhui University Anhui China Hunan Key Laboratory for Service Computing and Novel Software Technology Hunan University of Science and Technology Hunan China

As a new paradigm of distributed computing, mobile edge computing (MEC) has gained increasing attention due to its ability to expand the capabilities of centralized cloud computing. In MEC environments, a software application typically consists of multiple micro-services, which can be composed together in a flexible manner to achieve various user requests. However, the composition of micro-services in MEC is still a challenging research issue arising from three aspects. Firstly, composite micro-services constructed by ignoring the processing capabilities of different micro-services may cause waste of edge resources. Secondly, edge servers' limitations in terms of computational power can easily cause service occupancy between composite micro-services, severely affecting the user experience. Thirdly, in dynamic and unstable mobile environments, different edge users have different sensitivities to request latency, which increases the complexity of micro-service composition. In order to improve edge resource utilization and user experience on micro-service invocations, in this paper, we comprehensively consider the above three factors, and we first model the micro-services composition problem in MEC as a constrained multi-objective optimization problem. Then, a micro-service composition optimization method M3C combining graph search and branch-and-bound strategy is proposed to find a composition solution set with low energy consumption and high success rate for multiple edge users. Finally, we perform a series of experiments on two widely used datasets. Experimental results show that our proposed approach significantly outperforms the four competing baseline approaches, and that it is sufficiently efficient for practical deployment. © 2023 John Wiley & Sons Ltd.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：