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

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud Computing, 16th IEEE International Conference on Social Computing and Networking and 13th International Conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Yang, Wang Zhenzhen, Yuan Guosheng, Kang Buqing, Cao Jianxun, Liu Yong, Xiao Hnust Xiangtan China Hunan University of Science and Technology Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China School of Computer Science and Engineering China

ISBN: (纸本)9798350329223

The number of Web services on the Internet has been steadily increasing in recent years due to their growing popularity. Under the big data environment, how to effectively manage Web services is of significance for service discovery, service recommendation, etc. It is widely studied that Web services clustering is an effective way for service management. However, most of the current Web service clustering only extracts the information of Web services for clustering from one view, such as Web service content descriptions, networks in which Web services participate, and so on. Extracting information from Web services only unilaterally will not be able to provide a three-dimensional and comprehensive description of Web services, which may diminish the effect of Web service clustering. In addition, some Web service resources will be wasted if other information of Web services is not used at the same time. We find that multi-view clustering can simultaneously consider multiple information of a data at the same time, and multiple information can complement and enhance each other according to the characteristics of multiview clustering. Therefore, in this paper, we apply Web services to graph-based multi-view clustering in multi-view clustering to improve the performance of Web service clustering by simultaneously considering multiple feature information about Web services and distributing different weights to different information in the clustering process. © 2023 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient Nearest Neighbor Emotion Classification with BERT-whitening

Efficient Nearest Neighbor Emotion Classification with BERT-...

引用

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

作者： Yin, Wenbiao Shang, Lin State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Retrieval-based methods have been proven effective in many NLP tasks. Previous methods use representations from the pre-trained model for similarity search directly. However, the sentence representations from the pre-trained model like BERT perform poorly in retrieving semantically similar sentences, resulting in poor performance of the retrieval-based methods. In this paper, we propose KNN-EC, a simple and efficient non-parametric emotion classification (EC) method using nearest neighbor retrieval. We use BERT-whitening to get better sentence semantics, ensuring that nearest neighbor retrieval works. Meanwhile, BERT-whitening can also reduce memory storage of datastore and accelerate retrieval speed, solving the efficiency problem of the previous methods. KNN-EC average improves the pre-trained model by 1.17 F1-macro on two emotion classification datasets. © 2022 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Disentangled Hypergraph Collaborative Filtering for Social Recommendation

Disentangled Hypergraph Collaborative Filtering for Social R...

引用

2023 IEEE International Conference on Web Services, ICWS 2023

作者： Liu, Xiao Meng, Shunmei Li, Qianmu Xu, Xiaolong Qi, Lianyong Dou, Wanchun Zhang, Jing Zhang, Xuyun Nanjing University of Science and Technology China Nanjing University State Key Lab. for Novel Software Technology China Nanjing University of Information Science and Technology School of Computer and Software China College of Computer Science and Technology China Southeast University School of Cyber Science and Engineering China Macquarie University School of Computing Australia

ISBN: (纸本)9798350304855

In the current era of information overload, service recommendations have emerged as a valuable tool for enhancing the user experience. Among them, social recommendation models have shown promising results by incorporating social relationships to improve representation learning. However, most of these models lack fine-grained modeling of social user behavior, leading to a unified representation of users and a loss of expressiveness in user representations. To address this issue, we propose DisenHGCF, a new social recommendation approach based on disentangled hypergraph collaborative filtering, to disentangle the representations of users and items at the granularity of social users' intents. This approach aims to provide a more nuanced understanding of the user, leading to more accurate and personalized recommendations. To be specific, DisenHGCF leverages hypergraphs to represent the complex relationships among users, friends, and items. By using the hypergraph disentangling module based on attention, it is able to disentangle the user's intents and generate users representations in cooperating their intents for recommendation tasks. Additionally, a contrastive learning task based on intent-weight perturbation is designed to enhance representational learning. The experimental results obtained from the BeiBei and Beidian datasets demonstrate the superiority of our proposed approach in comparison to previous baseline methods, as evidenced by higher Recall and NDCG scores. © 2023 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Weighting Online Decision Transformer with Episodic Memory for Offline-to-Online Reinforcement Learning

Weighting Online Decision Transformer with Episodic Memory f...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Xiao Ma Wu-Jun Li Department of Computer Science and Technology National Key Laboratory for Novel Software Technology Nanjing University Nanjing PRC

ISBN: (数字)9798350384574

ISBN: (纸本)9798350384581

Offline reinforcement learning (RL) has been shown to be successfully modeled as a sequence modeling problem, drawing inspiration from the success of Transformers. Offline RL is often limited by the quality of the offline dataset, so offline-to-online RL is a more realistic setting. Online decision transformer (ODT) is an effective and representative sequence modeling-based offline-to-online RL method. Despite its effectiveness, ODT still suffers from the sample inefficiency problem during the online fine-tuning phase. This sample inefficiency problem arises because the agent treats all state-action pairs in the replay buffer equally when trying to learn from the replay buffer. In this paper, we propose a simple yet effective method, called weighting online decision transformer with episodic memory (WODTEM), to improve sample efficiency. We first attempt to introduce an episodic memory (EM) mechanism into the sequence modeling-based RL methods. By utilizing the EM mechanism, we propose a novel training objective with a weighting function, based on ODT, to improve sample efficiency. Experimental results on multiple tasks show that WODTEM can improve sample efficiency.

关键词： Training Memory management Reinforcement learning Transformers Task analysis Robotics and automation

来源：评论

学校读者我要写书评

暂无评论

Investigating the Impact of Bug Dependencies on Bug-Fixing Time Prediction 17

Investigating the Impact of Bug Dependencies on Bug-Fixing T...

引用

17th ACM/IEEE International Symposium on Empirical software Engineering and Measurement, ESEM 2023

作者： Li, Chenglin Zhao, Yangyang Yang, Yibiao Zhou, Yuming Nie, Liming Ding, Zuohua School of Computer Science and Technology Zhejiang Sci-Tech University Hangzhou China Nanjing University State Key Lab for Novel Software Technology Nanjing China School of Computer Science and Engineering Nanyang Technological University Singapore

ISBN: (纸本)9781665452236

Background: Bug dependencies refer to the link relationships between bugs and related issues, which are commonly observed in software evolution. It has been found that bugs with bug dependencies often take longer time to be resolved than other bugs without any dependencies. Despite the potential impact of bug dependencies on bug-fixing time, previous studies use traditional metrics without considering bug dependencies to build bug-fixing time prediction models. As a result, there is currently little empirical evidence to support the use of bug dependencies in improving prediction accuracy. Aims: We aim to conduct a comprehensive empirical study to investigate the value of considering bug dependencies for bug-fixing time prediction. Method: We define a set of bug dependency metrics based on bug dependencies. We first investigate the correlation between bug dependency metrics and bug-fixing time to investigate whether bugs with more complex dependencies are more time-consuming to be fixed. Next, we employ principal component analysis to study whether bug dependency metrics capture additional dimensions of a bug compared to traditional metrics. Finally, we build multivariate prediction models to explore whether considering bug dependencies can improve the effectiveness of bug-fixing time prediction. Results: The experimental results suggest that: (1) bugs with more complex dependencies require more time to be fixed;(2) bug dependency metrics are complementary to traditional metrics;(3) considering bug dependencies can improve the effectiveness of bug-fixing time prediction. Conclusions: These findings highlight the importance of considering bug dependencies in bug-fixing time prediction, and provide valuable insights into the potential impact of bug dependencies on software development processes. © 2023 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Effective and Imperceptible Adversarial Textual Attack Via Multi-objectivization

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第3期4卷 1-23页

作者： Liu, Shengcai Lu, Ning Hong, Wenjing Qian, Chao Tang, Ke Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen College of Engineering South Tower 1088 Xueyuan Avenue Guangdong Shenzhen518055 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong999077 Hong Kong National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen 10F Zhizhen Building Canghai Campus 3688 Nanhai Avenue Guangdong Shenzhen China National Key Laboratory for Novel Software Technology School of Artificial Intelligence Nanjing University Nanjing International College Area Xianlin Campus 163 Xianlin Avenue Jiangsu Nanjing China

The field of adversarial textual attack has significantly grown over the past few years, where the commonly considered objective is to craft adversarial examples (AEs) that can successfully fool the target model. However, the imperceptibility of attacks, which is also essential for practical attackers, is often left out by previous studies. In consequence, the crafted AEs tend to have obvious structural and semantic differences from the original human-written text, making them easily perceptible. In this work, we advocate leveraging multi-objectivization to address such an issue. Specifically, we reformulate the problem of crafting AEs as a multi-objective optimization problem, where the attack imperceptibility is considered as an auxiliary objective. Then, we propose a simple yet effective evolutionary algorithm, dubbed HydraText, to solve this problem. HydraText can be effectively applied to both score-based and decision-based attack settings. Exhaustive experiments involving 44,237 instances demonstrate that HydraText consistently achieves competitive attack success rates and better attack imperceptibility than the recently proposed attack approaches. A human evaluation study also shows that the AEs crafted by HydraText are more indistinguishable from human-written text. Finally, these AEs exhibit good transferability and can bring notable robustness improvement to the target model by adversarial training. © 2024 Copyright held by the owner/author(s).

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

ESM All-Atom: Multi-scale Protein Language Model for Unified Molecular Modeling 41

ESM All-Atom: Multi-scale Protein Language Model for Unified...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Zheng, Kangjie Long, Siyu Lu, Tianyu Yang, Junwei Dai, Xinyu Zhang, Ming Nie, Zaiqing Ma, Wei-Ying Zhou, Hao School of Computer Science National Key Laboratory for Multimedia Information Processing Peking University Anker Embodied AI Lab Peking University Beijing100871 China School of Artificial Intelligence National Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science Tsinghua University China Tsinghua University China PharMolix Inc. China

Protein language models have demonstrated significant potential in the field of protein ***, current protein language models primarily operate at the residue scale, which limits their ability to provide information at the atom *** limitation prevents us from fully exploiting the capabilities of protein language models for applications involving both proteins and small *** this paper, we propose ESM-AA (ESM All-Atom), a novel approach that enables atom-scale and residue-scale unified molecular ***-AA achieves this by pretraining on multi-scale code-switch protein sequences and utilizing a multi-scale position encoding to capture relationships among residues and *** results indicate that ESM-AA surpasses previous methods in protein-molecule tasks, demonstrating the full utilization of protein language *** investigations reveal that through unified molecular modeling, ESM-AA not only gains molecular knowledge but also retains its understanding of proteins. Copyright 2024 by the author(s)

关键词： Molecular docking

来源：评论

学校读者我要写书评

暂无评论

On Efficient Packet Batching and Resource Allocation for GPU based NFV Acceleration 31

On Efficient Packet Batching and Resource Allocation for GPU...

引用

31st IEEE/ACM International Symposium on Quality of Service, IWQoS 2023

作者： Zeng, Deze Zhu, Andong Gu, Lin Chen, Quan Guo, Minyi School of Computer Science China University of Geosciences Hubei Wuhan China Nanjing University State Key Lab. for Novel Software Technology Nanjing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai China

ISBN: (纸本)9798350399738

Network Function Virtualization (NFV) has already become an essential technology for improving the scalability and flexibility of modern computer networks. The performance gap has become the main issue that impedes the development of NFV. GPUs, with massive parallel processors, are advocated to accelerate the Virtualized Network Functions (VNFs). However, the special architecture and workflow of GPUs introduce new challenges, especially on the batched processing, and resource allocation. In this paper, we propose GPU-based NFV Acceleration framework (GNFA) with an efficient packet batching and resource allocation solution. Considering the increased latency caused by the accumulation of the GPU kernel invoking overhead, we first invent a latency reduction mechanism called SM Performance Compensation (SPC). A Partition and Adjustment based Batching and Resource Allocation (PABARA) algorithm that jointly considers batch size tuning and GPU thread allocation is also proposed. We have practically implemented GNFA and extensively evaluated its performance on some well-known VNFs. The experiment results show that GNFA can effectively promote the GPU resource utilization and improve the NFV performance in terms of per-packet latency. © 2023 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

LEARNING WITH LOGICAL CONSTRAINTS BUT WITHOUT SHORTCUT SATISFACTION 11

LEARNING WITH LOGICAL CONSTRAINTS BUT WITHOUT SHORTCUT SATIS...

引用

11th International Conference on Learning Representations, ICLR 2023

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

Recent studies have explored the integration of logical knowledge into deep learning via encoding logical constraints as an additional loss ***, existing approaches tend to vacuously satisfy logical constraints through shortcuts, failing to fully exploit the *** this paper, we present a new framework for learning with logical ***, we address the shortcut satisfaction issue by introducing dual variables for logical connectives, encoding how the constraint is *** further propose a variational framework where the encoded logical constraint is expressed as a distributional loss that is compatible with the model's original training *** theoretical analysis shows that the proposed approach bears salient properties, and the experimental evaluations demonstrate its superior performance in both model generalizability and constraint satisfaction. © 2023 11th International Conference on Learning Representations, ICLR 2023. All rights reserved.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：