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

6th IFIP TC 12 International Conference on Intelligence science, ICIS 2024

作者： Wang, You Qi, Lei Yu, Qian Shi, Yinghuan Gao, Yang State Key Laboratory of Novel Software Technology National Insititute of Health-care Data Science Nanjing University Nanjing China School of Computer Science and Engineering Southeast University Nanjing China School of Data and Computer Science Shandong Woman’s University Jinan China

ISBN: (纸本)9783031712524

In this paper, we introduce an innovative approach to weakly supervised medical image segmentation with box annotations. Different from the previous methods which simply utilize a single conventional network with the same augmentation techniques widely used in supervised segmentation, we aim to introduce diverse augmentations and heterogenous networks to leverage the box annotations for promising generalization ability. Specifically, to amplify the diversity between the contents within the box and its surroundings, we propose the interior and exterior box augmentation (IEBA) technique, in which distinct augmentation techniques are employed for regions inside and outside the bounding boxes. Also, for the purpose of selecting pseudo-labels of superior quality, we propose the pseudo-label filter module (PLFM) to eliminate unreliable pseudo-labels. Besides, as CNN demonstrates superior capabilities in acquiring local information, and ViT specializes in capturing global context, we facilitate a bidirectional learning process between CNN and ViT through quadruple cross consistency losses (QCCL). In inference, we only employ the superior model from the validation set to obtain parameter efficiency. Our approach is evaluated across four tasks on two public datasets, utilizing the 3D dice similarity coefficient as the evaluation metric. The experimental results show that the proposed method outperforms the state-of-the-art comparison methods. © IFIP International Federation for Information Processing 2025.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

SOFTENED SYMBOL GROUNDING FOR NEUROSYMBOLIC SYSTEMS 11

SOFTENED SYMBOL GROUNDING FOR NEUROSYMBOLIC SYSTEMS

引用

11th International Conference on Learning Representations, ICLR 2023

作者： Li, Zenan Yao, Yuan Chen, Taolue Xu, Jingwei Cao, Chun Ma, Xiaoxing Lü, Jian State Key Lab of Novel Software Technology Nanjing University China Department of Computer Science Birkbeck University of London United Kingdom

Neuro-symbolic learning generally consists of two separated worlds, i.e., neural network training and symbolic constraint solving, whose success hinges on symbol grounding, a fundamental problem in *** paper presents a novel, softened symbol grounding process, bridging the gap between the two worlds, and resulting in an effective and efficient neuro-symbolic learning ***, the framework features (1) modeling of symbol solution states as a Boltzmann distribution, which avoids expensive state searching and facilitates mutually beneficial interactions between network training and symbolic reasoning;(2) a new MCMC technique leveraging projection and SMT solvers, which efficiently samples from disconnected symbol solution spaces;(3) an annealing mechanism that can escape from sub-optimal symbol *** with three representative neuro-symbolic learning tasks demonstrate that, owing to its superior symbol grounding capability, our framework successfully solves problems well beyond the frontier of the existing proposals. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Boltzmann equation

来源：评论

学校读者我要写书评

暂无评论

Multi-view Hypergraph-based Self-supervised Learning Model for Web API Recommendation 22

Multi-view Hypergraph-based Self-supervised Learning Model f...

引用

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Shen, Jiexun Li, Dongfan Chen, Wanjun Xiao, Yong Kang, Guosheng Liu, Jianxun Peng, Zhenlian School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (纸本)9798331509712

With the rapid development of service computing technology, how to recommend the desirable Web APIs to developers from the large number of APIs is a challenge. The traditional methods based on collaborative filtering are limited by data sparsity. With the support of multi-dimensional relational feature modeling, graph neural network-based methods are proposed to mitigate data sparsity, but their convolution nature may amplify the noise effect. Therefore, how to simultaneously reduce the impact of sparsity and noisy data has been an open question in the field of API recommendation. To address the problem, this paper proposes a self-supervised learning method based on multi-view hypergraph for Web API recommendation. First, the Mashup-API interaction graph is transformed into a hypergraph, and the hyperedges are used as intermediate hubs to transfer messages between nodes, maintaining the global collaboration effect between Mashup and API nodes. Then, a multi-view strategy is adopted to generate embeddings of Mashups and APIs through information fusion, by which recommendation probability is derived by dot product between the embeddings of Mashups and Web APIs. To train the model parameters effectively, a self-supervised learning method is used to reduce the effect of noisy data to improve the embeddings. Extensive experiments are conducted on a real-world dataset, and the experimental results show that the proposed model outperforms the baselines. © 2024 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

AoI-aware Incentive Mechanism for Mobile Crowdsensing using Stackelberg Game 42

AoI-aware Incentive Mechanism for Mobile Crowdsensing using ...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Xiao, Mingjun Xu, Yin Zhou, Jinrui Wu, Jie Zhang, Sheng Zheng, Jun University of Science and Technology of China School of Computer Science and Technology China Suzhou Institute for Advanced Research University of Science and Technology of China China Temple Universityy Department of Computer and Information Sciences United States Nanjing University State Key Laboratory for Novel Software Technology China

ISBN: (纸本)9798350334142

Mobile CrowdSensing (MCS) is a mobile computing paradigm, through which a platform can coordinate a crowd of workers to accomplish large-scale data collection tasks using their mobile devices. Information freshness has attracted much focus on MCS research worldwide. In this paper, we investigate the incentive mechanism design in MCS systems that take the freshness of collected data and social benefits into concerns. First, we introduce the Age of Information (AoI) metric to measure the freshness of data. Then, we model the incentive mechanism design with AoI guarantees as a novel incomplete information two-stage Stackelberg game with multiple constraints. Next, we derive the optimal strategies of this game so as to determine the optimal reward paid by the platform and the optimal data update frequency for each worker. Moreover, we prove that these optimal strategies form a unique Stackelberg equilibrium. Based on the optimal strategies, we propose an AoI-Aware Incentive (AIAI) mechanism for the MCS system, whereby the platform and all workers can maximize their utilities simultaneously. Meanwhile, the system can ensure that the AoI values of all data uploaded to the platform are not larger than a given threshold to achieve high data freshness. Extensive simulations on real-world traces are conducted to demonstrate the significant performance of AIAI. © 2023 IEEE.

关键词： Optimal systems

来源：评论

学校读者我要写书评

暂无评论

An efficient and balanced feature pyramid network: shared-FPN

引用

Optoelectronics Letters 2025年

作者： Tian Sulong Qin Longfei Pang Wenchao Gao Ying Zhao Dexin School of Computer Science and Engineering， Tianjin University of Technology Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology， Tianjin University of Technology

In the field of object detection， it is challenging to achieve a balance between neck complexity and accuracy. To address this issue， we propose an efficient and decoupled neck module called Shared-FPN(Shared Feature Pyramid Network). Our design aims to effectively address the trade-off between these two factors. Neck modules are crucial for effectively fusing multi-scale information in neural network models. However， traditional neck designs， with their single structure， have struggled to significantly improve detection performance. In recent years， the incorporation of neural architecture search techniques in neck design has led to an increase in model complexity. This trade-off between model complexity and detection performance highlights the need for more efficient neck design approaches. Not only does Shared-FPN not increase the number of model parameters and FLOPs， but it also can be easily ported to any of the detection models. It improves on PAFPN by using transposed convolution with a large convolution kernel as the upsampling module， designing spatial pyramidal pooling-fast downsampling(SPPFD) based on shared pooling， and designing shared convolution as the right part module. To evaluate the performance of Shared-FPN in object detection tasks， we conducted experiments on object detection datasets. The results show that Shared-FPN achieved excellent performance across all sizes. In particular， on the VOC 2012 dataset， which contains mostly large objects， Shared-FPN's mAP was improved by 11.2% compared to FPN with YOLOX-s as the detector. On the COCO dataset， which contains mostly small objects， Shared-FPN's mAP was improved by 7.8% compared to FPN and 7.1% compared to PAFPN with Faster RCNN as the detector. Shared-FPN can be easily inserted into any of the detectors for better performance in various scenarios， such as small， medium or large objects.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Context-aware API recommendation using tensor factorization

引用

science China(Information sciences) 2023年第2期66卷 78-93页

作者： Yu ZHOU Chen CHEN Yongchao WANG Tingting HAN Taolue CHEN College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics State Key Laboratory for Novel Software Technology Nanjing University Birkbeck University of London

An activity constantly engaged by most programmers in coding is to search for appropriate application programming interfaces(APIs). Contextual information is widely recognized to play a crucial role in effective API recommendation, but it is largely overlooked in practice. In this paper, we propose contextaware API recommendation using tensor factorization(CARTF), a novel API recommendation approach in considering programmers' working context. To this end, we use tensors to explicitly represent the queryAPI-context triadic relation. When a new query is made, CARTF harnesses word embeddings to retrieve similar user queries, based on which a third-order tensor is constructed. CARTF then applies non-negative tensor factorization to complete missing values in the tensor and the Smith-Waterman algorithm to identify the most matched context. Finally, the ranking of the candidate APIs can be derived based on which API sequences are recommended. Our evaluation confirms the effectiveness of CARTF for class-level and method-level API recommendations, outperforming state-of-the-art baseline approaches against a number of performance metrics, including SuccessRate, Precision, and Recall.

关键词： API recommendation tensor factorization context awareness word embedding intelligent software development

来源：评论

学校读者我要写书评

暂无评论

Oxpecker: Leaking Secrets via Fetch Target Queue

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第7期44卷 2461-2474页

作者： Li, Shan Xu, Zheliang Shen, Haihua Li, Huawei University of Chinese Academy of Sciences School of Computer Science and Technology Beijing101408 China Chinese Academy of Sciences State Key Laboratory of Processors Institute of Computing Technology Beijing100190 China

Modern processors integrate carefully designed micro-Architectural components within the front-end to optimize performance. These components include instruction cache, micro-operation cache, and instruction prefetcher. Through experimentation, we observed that the rate of instruction generation in the fetch unit markedly exceeds the execution rate in the decode unit. However, existing frameworks of processors fail to explain this phenomenon. Consequently, we empirically validate the presence of an optimization feature, referred to as the Fetch Target Queue (FTQ), within the Intel processor. To the best of our knowledge, our study represents the first empirical validation of FTQ across various Intel processors and provides a comprehensive characterization of unrecorded FTQ micro-structural details on Intel processors. Our analysis uncovers overlooked insights that front-end rollbacks caused by the incorrectly ordered instructions or mismatched instruction lengths stored in FTQ introduce specific execution latencies. Based on these observations, we introduce the Oxpecker attack, consisting of two attack primitives, which leverages the FTQ to construct novel side-channel attacks. We construct two distinct exploitation scenarios for each attack primitive to demonstrate the Oxpecker attack's capability to leak secret control flow information and break Kernel Address Space Layout Randomization. © 1982-2012 IEEE.

关键词： Side channel attack

来源：评论

学校读者我要写书评

暂无评论

AD3: Implicit Action is the key for World Models to Distinguish the Diverse Visual Distractors 41

AD3: Implicit Action is the Key for World Models to Distingu...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Wang, Yucen Wan, Shenghua Gan, Le Feng, Shuai Zhan, De-Chuan School of Artificial Intelligence Nanjing University China National Key Laboratory for Novel Software Technology Nanjing University China School of Cyberspace Science and Technology Beijing Institute of Technology China

Model-based methods have significantly contributed to distinguishing task-irrelevant distractors for visual control. However, prior research has primarily focused on heterogeneous distractors like noisy background videos, leaving homogeneous distractors that closely resemble controllable agents largely unexplored, which poses significant challenges to existing methods. To tackle this problem, we propose Implicit Action Generator (IAG) to learn the implicit actions of visual distractors, and present a new algorithm named implicit Action-informed Diverse visual Distractors Distinguisher (AD3), that leverages the action inferred by IAG to train separated world models. Implicit actions effectively capture the behavior of background distractors, aiding in distinguishing the task-irrelevant components, and the agent can optimize the policy within the task-relevant state space. Our method achieves superior performance on various visual control tasks featuring both heterogeneous and homogeneous distractors. The indispensable role of implicit actions learned by IAG is also empirically validated. Copyright 2024 by the author(s)

关键词： Visual servoing

来源：评论

学校读者我要写书评

暂无评论

KnowLA: Enhancing Parameter-efficient Finetuning with Knowledgeable Adaptation

KnowLA: Enhancing Parameter-efficient Finetuning with Knowle...

引用

2024 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL 2024

作者： Luo, Xindi Sun, Zequn Zhao, Jing Zhao, Zhe Hu, Wei State Key Laboratory for Novel Software Technology Nanjing University China National Institute of Healthcare Data Science Nanjing University China Tencent AI Lab China

ISBN: (纸本)9798891761148

Parameter-efficient finetuning (PEFT) is a key technique for adapting large language models (LLMs) to downstream tasks. In this paper, we study leveraging knowledge graph embeddings to improve the effectiveness of PEFT. We propose a knowledgeable adaptation method called KnowLA. It inserts an adaptation layer into an LLM to integrate the embeddings of entities appearing in the input text. The adaptation layer is trained in combination with LoRA on instruction data. Experiments on six benchmarks with two popular LLMs and three knowledge graphs demonstrate the effectiveness and robustness of KnowLA. We show that KnowLA can help activate the relevant parameterized knowledge in an LLM to answer a question without changing its parameters or input prompts. © 2024 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Deep visual-linguistic fusion network considering cross-modal inconsistency for rumor detection

引用

science China(Information sciences) 2023年第12期66卷 16-32页

作者： Yang YANG Ran BAO Weili GUO De-Chuan ZHAN Yilong YIN Jian YANG School of Computer Science and Engineering Nanjing University of Science and Technology National Key Laboratory for Novel Software Technology Nanjing University School of Software Shandong University

With the development of the Internet, users can freely publish posts on various social media platforms, which offers great convenience for keeping abreast of the world. However, posts usually carry many rumors, which require plenty of manpower for monitoring. Owing to the success of modern machine learning techniques, especially deep learning models, we tried to detect rumors as a classification problem automatically. Early attempts have always focused on building classifiers relying on image or text information, i.e., single modality in posts. Thereafter, several multimodal detection approaches employ an early or late fusion operator for aggregating multiple source information. Nevertheless, they only take advantage of multimodal embeddings for fusion and ignore another important detection factor, i.e., the intermodal inconsistency between modalities. To solve this problem, we develop a novel deep visual-linguistic fusion network(DVLFN) considering cross-modal inconsistency, which detects rumors by comprehensively considering modal aggregation and contrast information. Specifically, the DVLFN first utilizes visual and textual deep encoders, i.e., Faster R-CNN and bidirectional encoder representations from transformers, to extract global and regional embeddings for image and text modalities. Then, it predicts posts' authenticity from two aspects:(1) intermodal inconsistency, which employs the Wasserstein distance to efficiently measure the similarity between regional embeddings of different modalities, and(2) modal aggregation, which experimentally employs the early fusion to aggregate two modal embeddings for prediction. Consequently, the DVLFN can compose the final prediction based on the modal fusion and inconsistency measure. Experiments are conducted on three real-world multimedia rumor detection datasets collected from Reddit, Good News, and Weibo. The results validate the superior performance of the proposed DVLFN.

关键词： multimodal learning Wasserstein distance rumor detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：