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

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Ma, Xinbei Ju, Tianjie Qiu, Jiyang Zhang, Zhuosheng Zhao, Hai Liu, Lifeng Wang, Yulong School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University China Department of Computer Science and Engineering Shanghai Jiao Tong University China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University China Shanghai Key Laboratory of Trusted Data Circulation and Governance in Web3 China Baichuan Intelligent Technology China

ISBN: (纸本)9798891761643

Large language models (LLMs) have played a pivotal role in building communicative AI, yet they encounter the challenge of efficient updates. Model editing enables the manipulation of specific knowledge memories and the behavior of language generation without retraining. However, the robustness of model editing remains an open question. This work seeks to understand the strengths and limitations of editing methods, facilitating practical applications of communicative AI. We focus on three key research questions. RQ1: Can edited LLMs behave consistently resembling communicative AI in realistic situations? RQ2: To what extent does the rephrasing of prompts lead LLMs to deviate from the edited knowledge memory? RQ3: Which knowledge features are correlated with the performance and robustness of editing? Our empirical studies uncover a substantial disparity between existing editing methods and the practical application of LLMs. On rephrased prompts that are flexible but common in realistic applications, the performance of editing experiences a significant decline. Further analysis shows that more popular knowledge is memorized better, easier to recall, and more challenging to edit effectively. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Multi-source Multi-label Feature Selection

Multi-source Multi-label Feature Selection

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiulan Yuan Xuegang Hu Peipei Li Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei City China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei City China

Feature selection for multi-source multi-label data has attracted much attention, because there are a lot of scenarios that produce multiple source data with multi-labels in the real-world applications, which aggravates the problems of dimensional disaster and the label skewness. However, most of existing multi-source feature selection methods miss the multi-label issue while existing multi-label feature selection methods can not select the optimal feature set in the multi-source environment. Motivated by this, we propose a novel feature selection method, called MSMLFS. To be specific, the Inf-FS algorithm is firstly introduced to handle multi-label feature selection for each data source, which considers the label weight in the feature selection. Secondly, the over-sampling mechanism and the inter-source feature fusion method are used to handle the label skewness of multi-label data and the feature selection in multiple sources respectively. Finally, extensive experiments conducted on synthetic and real-world multi-source multi-label data sets demonstrate that the proposed method outperforms several state-of-the-art multi-source or multi-label feature selection methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient survivable mapping algorithm for logical topology in IP-over-WDM optical networks against node failure

引用

Journal of Supercomputing 2023年第5期79卷 5037-5063页

作者： Cheng, Dun-Wei Chang, Jo-Yi Lin, Chen-Yen Lin, Limei Huang, Yanze Thulasiraman, Krishnaiyan Hsieh, Sun-Yuan Department of Computer Science and Information Engineering National Yunlin University of Science and Technology 123 University Road Yunlin64002 Taiwan Department of Computer Science and Information Engineering National Cheng Kung University No. 1 University Road Tainan701 Taiwan College of Mathematics and Informatics and the Key Laboratory of Network Security and Cryptology Fujian Normal University Fujian Fuzhou350117 China Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Mathematics and Physics Fujian University of Technology Fujian Fuzhou350118 China Department of Computer Science University of Oklahoma 660 Parrington Oval NormanOK73019 United States Department of Computer Science and Information Engineering National Chi Nan University No. 1 Daxue Rd Nantou County Puli Township54561 Taiwan

The survivable mapping problem in an IP-over-WDM network with a logical graph and physical graph is the problem of finding a mapping of a logical network in a physical layer so that any failure in physical topology does not break the logical topology’s connection. Determining whether a survivable mapping against failure exists is an NP-complete problem, and therefore many heuristic algorithms have been proposed in the literature. In this paper, a heuristic mapping design strategy is proposed to enable the lightpaths to more efficiently endure a node failure. We individually consider the logical topology by building a Hamiltonian cycle and then deal with the mapping problem for disjoint physical paths. Experimental results demonstrate that the proposed algorithm can provide efficient survivable mapping in IP-over-WDM networks. The simulation shows that the survivability of previous methods (SNF and SMART-Node) is around 60–80%, but our proposed algorithm can build survivable mapping in all kinds of situations. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

CA-MLIF: Cross-Attention and Multimodal Low-Rank Interaction Fusion Framework for Tumor Prognostic Prediction 39

CA-MLIF: Cross-Attention and Multimodal Low-Rank Interaction...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： An, Yajun Chen, Jiale Lin, Huan Liu, Zhenbing Feng, Siyang Zhang, Hualong Lan, Rushi Liu, Zaiyi Pan, Xipeng School of Computer Science and Information Security Guilin University of Electronic Technology Guilin541004 China School of Artificial Intelligence and Big Data Chongqing College of Finance and Economics Chongqing402160 China Southern Medical University Guangzhou510080 China Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin University of Electronic Technology Guilin541004 China Guangdong Provincial Key Laboratory of Artificial Intelligence in Medical Image Analysis and Application Guangzhou510080 China

ISBN: (纸本)157735897X

Cancer is a leading cause of death worldwide due to its aggressive nature and complex variability. Accurate prognosis is therefore challenging but essential for guiding personalized treatment and follow-up. Previous research often relied on single data sources, missing the opportunity to combine various types of patient information for more comprehensive survival predictions. To address these challenges, we propose a two-stage fusion method named Cross-Attention and Multimodal Low-Rank Interaction Fusion Framework (CA-MLIF). In the first stage, we propose a CA mechanism for real-time feature updates and cross-modal mutual learning to capture rich semantic information. In the second stage, we design a novel multimodal low-rank interaction fusion method for survival prediction. Specifically, we present modal attention mechanism (MAM) for feature filtration, low-rank multimodal fusion (LMF) for model complexity reduction, and optimal weight concatenation (OWC) for maximizing feature integration. Extensive experiments on two public datasets TCGA-GBMLGG and TCGA-KIRC, as well as a multi-center in-house lung adenocarcinoma (LUAD) dataset validate the effectiveness of CA-MLIF, which demonstrate that our method outperforms existing approaches in survival prediction under both pathology-gene fusion and CT-pathology fusion scenarios. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Learning to rank

来源：评论

学校读者我要写书评

暂无评论

Research on Enhanced Perception and Attention-Driven Person Re-Identification 20

Research on Enhanced Perception and Attention-Driven Person ...

引用

20th International Conference on Natural Computation, Fuzzy Systems and knowledge Discovery, ICNC-FSKD 2024

作者： Wu, Cancan Li, Dong Zhang, Zhi College of Computer Science and Technology Wuhan University of Science and Technology Hubei Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Hubei Wuhan430065 China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Hubei Wuhan430065 China

ISBN: (纸本)9798350356328

When matching similarity among pedestrians in images, pedestrian re-identification algorithms are often disturbed by occlusions. A typical tactic is to improve the robustness of occlusion features in the model. However, this approach neglects the noise introduced by other pedestrians in the image, leading to limited learning of relevant information between images. To address these issues, this paper introduces a pedestrian re-identification model that leverages perception-enhanced and attention mechanisms. By enhancing the perception of non-pedestrian noise and erasing non-pedestrian features, we then employ a cross-attention mechanism to subtly embed global and local features for finer feature recognition. Finally, through context attention, we learn the interaction between pedestrian images to improve re-identification accuracy. Results from studies performed on the Market-1501, CUHK03-D, and Duke-ReID datasets indicate that the suggested model surpasses leading contemporary models regarding Rank-1 scores and mean Average Precision (mAP), while maintaining good robustness. © 2024 IEEE.

关键词： Reamers

来源：评论

学校读者我要写书评

暂无评论

Steel Surface Defect Detection Based on Improved YOLOv8 20

Steel Surface Defect Detection Based on Improved YOLOv8

引用

20th International Conference on Natural Computation, Fuzzy Systems and knowledge Discovery, ICNC-FSKD 2024

作者： Zhang, Jichen Zhang, Zhi College of Computer Science and Technology Wuhan University of Science and Technology Hubei Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Hubei Wuhan430065 China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Hubei Wuhan430065 China

ISBN: (纸本)9798350356328

There are some defects on the surface of steel that are difficult to detect, so we propose an improved algorithm based on YOLOv8 for detecting defects that are difficult to be detected. This improvement includes the introduction of an SPD module to minimize the problem of information loss due to downsampling;the addition of a small object detection head combined with EMA attention to further enhance the detection capabilities for small targets;the use of BiFPN to replace the original PANet, applying different weights to different features to strengthen feature fusion. Experiments were conducted on the NEU-DET dataset, and the algorithm improved mAP to 80.2%, an improvement of 3.9% over the baseline model. © 2024 IEEE.

关键词： Change detection

来源：评论

学校读者我要写书评

暂无评论

FELSDiff: Image Super-Resolution Based on Diffusion Model Fusing Feature Extraction with Latent Space 20

FELSDiff: Image Super-Resolution Based on Diffusion Model Fu...

引用

20th International Conference on Natural Computation, Fuzzy Systems and knowledge Discovery, ICNC-FSKD 2024

作者： Wu, Cancan Zhang, Zhi Wuhan University of Science and Technology College of Computer Science and Technology Hubei Wuhan430065 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan430065 China Big Data Science and Engineering Research Institute Wuhan University of Science and Technology Hubei Wuhan430065 China

ISBN: (纸本)9798350356328

In addressing issues like an excessive number of network parameters and the loss of fine texture details in image super-resolution reconstruction approaches based on diffusion models, this passage introduces a novel image super-resolution model (FELSDiff). This model relies on the fusion of diffusion models, feature extraction, and latent space. FELSDiff utilizes a Pre-trained CNN for initial super-resolution to extract the primary low-band features and part high-band features of the image. The preliminary super-resolved image is then concatenated as a condition to this model. We introduce a cross-attention mechanism guided by the high-band features of the preliminary super-resolved image to enhance the network's feature extraction capability and obtain more effective features. In the U-Net structure, we incorporate a latent space strategy, enabling the model's training and inference processes to be conducted in the latent space, thereby reducing the number of network parameters. Experimental results on multiple standard datasets indicate that this method outperforms other advanced methods overall. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Seastar: A Cache-Efficient and Load-Balanced key-Value Store on Disaggregated Memory

Seastar: A Cache-Efficient and Load-Balanced Key-Value Store...

引用

2024 IEEE International Conference on Cluster Computing, CLUSTER 2024

作者： Du, Jingwen Wang, Fang Feng, Dan Zeng, Dexin Yi, Sheng Engineering Research Center of Data Storage Systems and Technology Ministry of Education of China Wuhan National Laboratory for Optoelectronics Key Laboratory of Information Storage System China School of Computer Science and Technology Huazhong University of Science and Technology China Shenzhen Huazhong University of Science and Technology Research Institute China

ISBN: (纸本)9798350358711

In modern datacenters, memory disaggregation un-packs monolithic servers to build independent network-connected compute and memory pools, greatly improving resource uti-lization. Existing memory-disaggregated key-value stores adopt ownership sharing or ownership partitioning for request scheduling and they all show poor performance and scalability. The former generates multiple cache misses and multiple network round trips due to poor cache locality, while the latter fails to fully use resources on all Compute Nodes (CNs) due to load imbalance. In this paper, we propose Seastar, a fast and scalable key-value store that achieves high cache locality as well as load balancing. To enable high concurrency and ensure linearizability, Seastar exploits a self-verification version chain to provide out-of-place atomic updates and ensure consistent reads. To improve cache locality, Seastar leverages a pair-based ownership assigning scheme to assign the processing permission of requests corre-sponding to each key to a CN pair through two independent hash functions. To ensure load balancing among CNs, Seastar proposes a decentralized power-of-two-choices routing scheme to route the requests to the less-loaded CNs in CN pairs for handling. Experimental results demonstrate that Seastar improves the throughput by up to 6.7x and significantly reduces the latency compared with state-of-the-art memory-disaggregated key-value stores. © 2024 IEEE.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral Image Classification Based on Unsupervised Heterogeneous Domain Adaptation CycleGan

引用

Chinese Journal of Electronics 2020年第4期29卷 608-614页

作者： WANG Xuesong LI Yiran CHENG Yuhu School of Information and Control Engineering China University of Mining and Technology Xuzhou Key Laboratory of Artificial Intelligence and Big Data

Aiming at the difficulty of obtaining sufficient labeled Hyperspectral image(HSI) data and the inconsistent feature distribution of different HSIs, a novel Unsupervised heterogeneous domain adaptation CycleGan(UHDAC) is proposed by using CycleGan to capture the transferable features in the absence of similar *** the one hand, the two-way mapping is used to find the internal relationship between the source and target domain data,while the two-way adversary is used to constrain the source and target domain features, realizing the alignment of feature *** the other hand, the CORAL loss function is introduced to minimize the distance between the second-order statistical difference between the source and target domain features, so as to solve the insufficient constraint of mapping relationship caused by the low consistency of HSI data structure in different *** on three real HSI datasets show that UHDAC can effectively realize the unsupervised classification of target domain HSI with high classification accuracy by using the labeled HSI data in the source domain.

关键词： Unsupervised Heterogeneous Domain adaptation CycleGan Hyperspectral image Classification

来源：评论

学校读者我要写书评

暂无评论

Auction Theory and Game Theory Based Pricing of Edge Computing Resources: A Survey

引用

IEEE Internet of Things Journal 2025年

作者： Yu, Jiguo Liu, Shun Zou, Yifei Wang, Guijuan Hu, Chunqiang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Qufu Normal University School of Computer Science Shandong Rizhao China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250353 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

The proliferation of Internet of Things (IoT) devices and edge computing applications has heightened the demand for efficient resource allocation and pricing mechanisms. Effective pricing strategies play a crucial role in optimizing resource utilization, reducing latency, and ensuring fair resource distribution among users. Both auction theory and game theory have emerged as fundamental economic frameworks for designing pricing mechanisms in edge computing. This paper presents a comprehensive survey of pricing strategies that leverage both auction and game theory, systematically categorizing existing research based on auction mechanisms and game-theoretic models. Unlike previous surveys that focus solely on auction-based pricing, this work integrates game-theoretic perspectives, providing a holistic analysis of strategic interactions in edge computing resource allocation. Furthermore, we discuss key challenges, emerging trends, and future research directions aimed at enhancing efficiency, fairness, and privacy protection in cloud-edge collaborative computing environments. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：