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

An infrastructure software perspective toward computation offloading between executable specifications and foundation models

引用

science China(Information sciences) 2025年第4期68卷 380-382页

作者： Dezhi RAN Mengzhou WU Yuan CAO Assaf MARRON David HAREL Tao XIE Key Laboratory of High Confidence Software Technologies (PKU) Ministry of Education School of Computer SciencePeking University School of Electronics Engineering and Computer Science Peking University Department of Computer Science and Applied Mathematics Weizmann Institute of Science

Foundation models(FMs) [1] have revolutionized software development and become the core components of large software systems. This paradigm shift, however, demands fundamental re-imagining of software engineering theories and methodologies [2]. Instead of replacing existing software modules implemented by symbolic logic, incorporating FMs' capabilities to build software systems requires entirely new modules that leverage the unique capabilities of ***, while FMs excel at handling uncertainty, recognizing patterns, and processing unstructured data, we need new engineering theories that support the paradigm shift from explicitly programming and maintaining user-defined symbolic logic to creating rich, expressive requirements that FMs can accurately perceive and implement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A survey on cross-user federated recommendation

引用

science China(Information sciences) 2025年第4期68卷 7-32页

作者： Enyue YANG Yudi XIONG Wei YUAN Weike PAN Qiang YANG Zhong MING College of Computer Science and Software Engineering Shenzhen University School of Electrical Engineering and Computer Science The University of Queensland WeBank AI Lab WeBank Department of Computer Science and Engineering Hong Kong University of Science and Technology College of Big Data and Internet Shenzhen Technology University Guangdong Laboratory of Artificial Intelligence and Digital Economy (SZ)

Recommender systems are effective in mitigating information overload, yet the centralized storage of user data raises significant privacy concerns. Cross-user federated recommendation(CUFR) provides a promising distributed paradigm to address these concerns by enabling privacy-preserving recommendations directly on user devices. In this survey, we review and categorize current progress in CUFR, focusing on four key aspects: privacy, security, accuracy, and efficiency. Firstly,we conduct an in-depth privacy analysis, discuss various cases of privacy leakage, and then review recent methods for privacy protection. Secondly, we analyze security concerns and review recent methods for untargeted and targeted *** untargeted attack methods, we categorize them into data poisoning attack methods and parameter poisoning attack methods. For targeted attack methods, we categorize them into user-based methods and item-based methods. Thirdly,we provide an overview of the federated variants of some representative methods, and then review the recent methods for improving accuracy from two categories: data heterogeneity and high-order information. Fourthly, we review recent methods for improving training efficiency from two categories: client sampling and model compression. Finally, we conclude this survey and explore some potential future research topics in CUFR.

关键词： cross-user federated recommendation federated recommendation federated learning recommender systems user privacy

来源：评论

学校读者我要写书评

暂无评论

DevDynaP: A Dynamic Local Community Detection Algorithm

引用

SN computer science 2025年第4期6卷 1-11页

作者： Bakhtar, Sahar Harutyunyan, Hovhannes A. Department of Computer Science and Software Engineering Concordia University Montreal Canada

Recent years have witnessed the rapid growth of social network services. Real-world social networks are huge and changing over time. Consequently, the problems in this area have become more complex. Community detection is one of the most important problems in social networks. A good community can be defined as a group of nodes that are highly connected to each other and loosely connected to the nodes outside the community. Regarding the fact that social networks are huge in size, having complete information about the whole network is almost impossible. As a result, the problem of local community detection has become more popular in recent years. However, the problem of community detection in dynamic networks is well-investigated, the local community detection is not widely addressed by researchers in dynamic networks. In this paper, a dynamic local community detection algorithm is proposed. The purpose of the proposed algorithm is to explore the network as fast as possible and detect communities as well. Experimental results show that the proposed algorithm discovers the unknown parts of networks faster than similar algorithms. Also, the detected communities by the proposed algorithm outperform that of the compared algorithm in different snapshots. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

关键词： Dynamic social network Geodesic distance metric Local community detection Modularity

来源：评论

学校读者我要写书评

暂无评论

Enhancing Voice Phishing Detection Using Multilingual Back-Translation and SMOTE: An Empirical Study

引用

IEEE Access 2025年 13卷 37946-37965页

作者： Boussougou, Milandu Keith Moussavou Hamandawana, Prince Park, Dong-Joo Soongsil University Department of Computer Science and Engineering Seoul06978 Korea Republic of Ajou University Department of Software and Computer Engineering Suwon16499 Korea Republic of Soongsil University School of Computer Science and Engineering Seoul06978 Korea Republic of

With the widespread global trend of voice phishing or vishing attacks, the development of effective detection models using artificial intelligence (AI) has been hindered by the lack of high-quality and large volumes of data. This lack of data reflecting a real vishing scenario often leads to imbalanced datasets and biased detection models. Therefore, we present in this paper a data augmentation (DA) method for expanding the imbalanced Korean call content vishing (KorCCVi) dataset to address the existing data asymmetry problem and enhance the performance of Korean vishing detection. The proposed approach for DA involves using the back-translation (BT) method with three different intermediate languages: English, Chinese, and Japanese. The proposed method offers several advantages over the traditional synthetic minority oversampling technique (SMOTE), which is the main technique used to compare with our multilingual BT approach. Using these two DA techniques, several machine learning (ML) and deep learning (DL) models were trained on the original imbalanced dataset, the dataset balanced with SMOTE and its variants, and the dataset augmented with our method. We analyzed the impact of these DA methods on the performance of the models, demonstrated the benefits of each approach, and suggested the most suitable approach. The performance of the trained models was evaluated using the accuracy, precision, recall, and F1-score metrics. The experimental results demonstrated that the proposed multilingual BT method effectively expands the dataset while preserving its contextual and linguistic characteristics. The average performance of the models revealed that those trained on the augmented dataset outperformed the other models. They achieved F1-scores of 98.91% for the back-translated data, 98.14% for the original data, and 97.23% for SMOTE. © 2025 The Authors. This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecomm

关键词： Phishing

来源：评论

学校读者我要写书评

暂无评论

#REval: A Semantic Evaluation Framework for Hashtag Recommendation

引用

IEEE Transactions on Knowledge and Data engineering 2025年第6期37卷 3075-3087页

作者： Alsini, Areej Huynh, Du Q. Datta, Amitava Umm Al-Qura University Department of Computer Science and Artificial Intelligence Makkah Saudi Arabia University of Western Australia Department of Computer Science and Software Engineering Perth Australia

Automatic evaluation of hashtag recommendation models is a fundamental task in Twitter. In the traditional evaluation methods, the recommended hashtags from an algorithm are firstly compared with the ground truth hashtags for exact correspondences. The number of exact matches is then used to calculate the hit rate, hit ratio, precision, recall, or F1-score. This way of evaluating hashtag similarities is inadequate as it ignores the semantic correlation between the recommended and ground truth hashtags. To tackle this problem, we propose a novel semantic evaluation framework for hashtag recommendation, called #REval. This framework includes an internal module referred to as BERTag, which automatically learns the hashtag embeddings. We investigate on how the #REval framework performs under different word embedding methods and different numbers of synonyms and hashtags in the recommendation using our proposed #REval-hit-ratio measure. Our experiments of the proposed framework on three large datasets show that #REval gave more meaningful hashtag synonyms for hashtag recommendation evaluation. Our analysis also highlights the sensitivity of the framework to the word embedding technique, with #REval based on BERTag more superior over #REval based on Word2Vec, FastText, and GloVe. © 2025 IEEE. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A mathematical multi-objective optimization model and metaheuristic algorithm for effective advertising in the social internet of things

引用

Neural Computing and Applications 2025年第6期37卷 4797-4821页

作者： Molaei, Reza Rahsepar Fard, Kheirollah Bouyer, Asgarali Department of Computer Engineering and Information Technology University of Qom Qom Iran Department of Software Engineering Azarbaijan Shahid Madani University Tabriz Iran Department of Software Engineering Faculty of Engineering and Natural Science Istinye University Istanbul Turkey

The integration of social networks with the Internet of Things (IoT) has been explored in recent research, giving rise to the Social Internet of Things (SIoT). One promising application of SIoT is viral marketing, which plays a critical role in modern advertising. However, current solutions proposed for viral marketing are often impractical in real-world scenarios, and there has been limited investigation into viral marketing within the context of SIoT. To address this issue, we present a multi-objective integer linear programming model named ILP-ASoT that facilitates advertising through SIoT. Our approach introduces two realistic parameters: the node sociality rate and the node appropriateness rate as an advertising destination. By balancing the cost of selecting a seed set with the number of users who receive the advertisement, our model offers an appropriate trade-off. Since this is proven as an NP-hard problem, A PSO-based metaheuristic algorithm is proposed to provide near-optimal solutions for advertising in SIoT, called PSO-ASoT. Through simulations, we show that our PSO-ASoT algorithm outperforms state-of-the-art algorithms in several metrics, such as influence spread, advertising cost, and duplicated advertising rate. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Clustered Reinforcement Learning

引用

Frontiers of computer science 2025年第4期19卷 43-57页

作者： Xiao MA Shen-Yi ZHAO Zhao-Heng YIN Wu-Jun LI National Key Laboratory for Novel Software Technology Department of Computer Science and TechnologyNanjing UniversityNanjing 210023China Department of Electrical Engineering and Computer Sciences University of CaliforniaBerkeleyCA 94720-1770USA

Exploration strategy design is a challenging problem in reinforcement learning(RL),especially when the environment contains a large state space or sparse *** exploration,the agent tries to discover unexplored(novel)areas or high reward(quality)*** existing methods perform exploration by only utilizing the novelty of *** novelty and quality in the neighboring area of the current state have not been well utilized to simultaneously guide the agent’s *** address this problem,this paper proposes a novel RL framework,called clustered reinforcement learning(CRL),for efficient exploration in *** adopts clustering to divide the collected states into several clusters,based on which a bonus reward reflecting both novelty and quality in the neighboring area(cluster)of the current state is given to the *** leverages these bonus rewards to guide the agent to perform efficient ***,CRL can be combined with existing exploration strategies to improve their performance,as the bonus rewards employed by these existing exploration strategies solely capture the novelty of *** on four continuous control tasks and six hard-exploration Atari-2600 games show that our method can outperform other state-of-the-art methods to achieve the best performance.

关键词： deep reinforcement learning exploration count-based method clustering K-means

来源：评论

学校读者我要写书评

暂无评论

Utility-Enhanced Personalized Privacy Preservation in Hierarchical Federated Learning

引用

IEEE Transactions on Mobile Computing 2025年第06期24卷 5264-5279页

作者： Chen, Jianan Jiang, Honglu Hu, Qin Purdue University Indianapolis Department of Computer Science IndianapolisIN46202 United States Miami University Department of Computer Science and Software Engineering OxfordOH45056 United States Georgia State University Department of Computer Science AtlantaGA30303 United States

Federated learning (FL) is a distributed learning framework that allows clients to jointly train a model by uploading parameter updates rather than sharing local data. FL deployed on a client-edge-cloud hierarchical architecture, named Hierarchical Federated Learning (HFL), can accelerate model training and accommodate more clients with reduced communication cost via edge aggregation. Unfortunately, HFL suffers from privacy risks since the submitted parameters from clients are vulnerable to privacy attacks. To address this issue, we propose a novel Differential Privacy (DP) definition tailored for HFL, i.e., Group Local Differential Privacy (GLDP). We design the Sampling-Randomizing-Shuffling (SRS) mechanism to implement GLDP in HFL, where the sampling process is employed to achieve a stronger level of privacy protection with less noise added. By combining the randomized response and the shuffling mechanism, our proposed SRS mechanism can achieve client-level personalization within ρk-GLDP for privacy preservation while balancing model performance and privacy protection in HFL. Privacy analysis and convergence analysis are conducted to provide theoretical performance guarantees. Experimental results based on real-world datasets verify the effectiveness of SRS. © 2025 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Common Declarative Language for UML State Machine Representation, Model Transformation, and Interoperability of Visualization Tools 1st

A Common Declarative Language for UML State Machine Represe...

引用

1st International Symposium on software Fault Prevention, Verification, and Validation, SFPVV 2024

作者： Jannatpour, Ali Constantinides, Constantinos Department of Computer Science and Software Engineering Concordia University Montreal Canada

ISBN: (纸本)9789819616206

Originally presented in previous work to capture the set of fundamental elements of the UML state machine specification, Common Declarative Language (CDL) provides a model that can aid in the validation and verification of requirements. In this paper we target two objectives: First, we extend CDL by addressing one of the advanced concepts of the UML state machine specification, namely the notion of orthogonality which allows complex machine behavior through parallel state configurations. Second, we complement previous work by focusing on how CDL can serve as a platform for the representation of a state machine, how the language can be deployed for a model transformation where the initial machine (containing composite and/or orthogonal states) can be flattened into a model whose formal definition we provide, and finally how the CDL can be deployed to support interoperability among text-to-UML drawing tools [11]. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

An aspect-based sentiment analysis model for Arabic game reviews based on hybrid transformers models

引用

Neural Computing and Applications 2025年 1-23页

作者： Hammad, Mahmoud AbuEnnab, Noor Al-Refai, Mohammed IT Department Ajman University Ajman United Arab Emirates Software Engineering Department Jordan University of Science and Technology Irbid Jordan Computer Science Department Jordan University of Science and Technology Irbid Jordan

Aspect-based sentiment analysis (ABSA) is a natural language processing (NLP) technique to determine the various sentiments of a customer in a single comment regarding different aspects. The increasing online data content generated by interested customers and reviewers motivated researchers and data scientists to conduct ABSA. ABSA has become increasingly popular in recent years due to its versatility in e-commerce, social media, and customer feedback analysis. However, ABSA faces several significant challenges, including determining the aspects and their sentiment polarities (positive, negative, or neutral) in a given text. Moreover, ABSA faces particular challenges in non-English languages such as Arabic due to the lack of resources and mature models. Typically, ABSA tackles one or more of the ABSA research tasks: (T1) aspect term extraction, (T2) aspect term polarity, (T3) aspect category identification, and (T4) aspect category polarity. To identify the aspects and their corresponding sentiment polarities in a given text, accurate and efficient NLP techniques are required. Despite growing interest in Arabic ABSA, the lack of annotated datasets and pre-trained models has hindered its development. In this research, we have collected a dataset of Arabic game reviews and annotated them using three annotators, and then we trained an ABSA deep learning model based on the BERT pre-trained model combined with zero-shot learning (ZSL) to tackle all the four aforementioned tasks. Our best performing model achieved a high accuracy on all four tasks with an accuracy of 91.61% on T1, 90.99% on T2, 79.08% on T3, and 88.17% on T4. Finally, we compared our model’s accuracy with the state-of-the-art Arabic-based ABSA models on different datasets. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：