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

The Impact of Transformer Models and Regression Algorithms on Automated Short Answer Grading 5

The Impact of Transformer Models and Regression Algorithms o...

5th IEEE International Conference on Advances in Electrical, computing, Communication and Sustainable Technologies, ICAECT 2025

作者： Nampoothiri, Abhijith. N. Thushara, M.G. Pradeesh, N. Anand Krishna, K.R. Santhosh, Abhai Abhijith Kumar, S. Kumar, Suryan Amrita School of Computing Amrita Vishwa Vidyapeetham Department of Computer Science and Applications Amritapuri India Amrita School of Computing Amrita Vishwa Vidyapeetham Department of Computer Science and Engineering Amritapuri India Omnex Software Solutions Pvt. Ltd Thoraipakkam Chennai India

ISBN: (纸本)9798350356236

Grading short answer questions in higher education often poses significant challenges due to its subjective nature and time-consuming process. As educational institutions expand, the need for efficient and objective grading solutions becomes critical. This paper investigates the use of machine learning and natural language processing to automate the evaluation of short answer responses. Our study employs a two-phase methodology: first, several transformer models - including BERT, Sentence-BERT, T5, Genism, and XLNet - are used to transform text into numerical representations. In the second phase, various regression techniques, such as Linear Regression, Support Vector Machine (SVM), Random Forest, and AdaBoost, are applied to these representations to estimate scores. Our findings indicate that the combination of the BERT model with Random Forest performs the best, demonstrating superior accuracy with the lowest error metrics. This optimal model pairing is proposed for integration into the Ample Learning Management System (LMS) to enhance grading efficiency and provide quicker, more reliable feedback. The significant implications of this research provides teachers with a robust tool for automated grading, which can enhance the educational experience by delivering timely and accurate evaluations. © 2025 IEEE.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Metamorphic Relation Patterns for Metamorphic Testing, Exploration and Robustness

Metamorphic Relation Patterns for Metamorphic Testing, Explo...

引用

作者： Ying, Zhihao Towey, Dave Bellotti, Anthony Chua, Caslon Quan Zhou, Zhi School of Computer Science University of Nottingham Ningbo China Zhejiang Ningbo China Department of Computer Science and Software Engineering Swinburne University of Technology HawthornVIC Australia School of Computing and Information Technology University of Wollongong WollongongNSW Australia

Metamorphic testing (MT) is an effective software quality assurance method;it uses metamorphic relations (MRs) to examine the inputs and outputs of multiple test cases. Metamorphic exploration (ME) and metamorphic robustness testing (MRT) are advanced additions to the MT literature: ME can enable better understanding, and thus testing, of systems;MRT can test software robustness without an oracle. Metamorphic relation patterns (MRPs) are abstractions or templates for multiple concrete MRs. The performance of MT/ME/MRT relies on the quality of MRs, but the identification of MRs is often a manual task requiring some knowledge of MRPs, creative thinking and a good understanding of the system. In other words, the effective identification of MRs remains a challenge and requires further study. In this paper, we propose formal definitions to describe the relationship between multiple MRPs in order to classify them. We also identify a series of new MRPs and propose a new MT framework that can guide the identification and application of MRPs. Based on our definitions, we present the notion of MRP family trees and further propose two trees by classifying previously published MRPs and our proposed MRPs, in order to make it easier for users to find their target MRPs for reuse, reference or inference. Finally, we report on case studies using the MRPs and our framework to guide the identification of MRs for MT/ME/MRT and successfully detect multiple violations. © 2025 John Wiley & Sons Ltd.

关键词： software testing

来源：评论

学校读者我要写书评

暂无评论

EagerLog: Active Learning Enhanced Retrieval Augmented Generation for Log-based Anomaly Detection

EagerLog: Active Learning Enhanced Retrieval Augmented Gener...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Duan, Chiming Jia, Tong Yang, Yong Liu, Guiyang Liu, Jinbu Zhang, Huxing Zhou, Qi Li, Ying Huang, Gang School of Software and Microelectronics Peking University Beijing China Institute for Artificial Intelligence Peking University Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China National Key Laboratory of Data Space Technology and System Beijing China Alibaba Cloud Computing Company Hangzhou China

ISBN: (纸本)9798350368741

Logs record essential information about system operations and serve as a critical source for anomaly detection, which has generated growing research interest. Utilizing large language models (LLMs) within a retrieval-augmented generation (RAG) framework for log-based anomaly detection is an effective approach due to its strong generalization capabilities and efficient few-shot performance. However, the effectiveness of this method hinges on the quality of the knowledge source, which can be impacted by noise and changes within the software systems. Facing these problems, in this paper, we propose a novel log-based anomaly detection method named EagerLog, employing active learning to choose the logs for humans to label, thereby adding them to the knowledge source, thus enhancing the knowledge source and maintaining its quality. Our experiments on three open datasets (BGL, Thunderbird, Zookeeper) and one industrial dataset demonstrate that EagerLog can achieve 93.65% F1 score with approximately 10 labeled log sequences, surpassing existing methods by 15.32%. © 2025 IEEE.

关键词： Active Learning Anomaly Detection Log Analysis Retrieval Augmented Generation

来源：评论

学校读者我要写书评

暂无评论

Cost-Optimized Task Offloading for Dependent Applications in Collaborative Edge and Cloud computing

引用

IEEE Internet of Things Journal 2025年第9期12卷 12975-12988页

作者： Yuan, Haitao Hu, Qinglong Wang, Shen Bi, Jing Buyya, Rajkumar Lu, Jinhu Yang, Jinhong Zhang, Jia Zhou, MengChu Beihang University School of Automation Science and Electrical Engineering Beijing100191 China City University of Hong Kong Department of Computer Science Kowloon Tong Hong Kong Beijing University of Technology School of Software Engineering Faculty of Information Technology Beijing100124 China Laboratory School of Computing and Information Systems MelbourneVIC3010 Australia CSSC Systems Engineering Research Institute Beijing100036 China Southern Methodist University Lyle School of Engineering Department of Computer Science DallasTX75205 United States New Jersey Institute of Technology Department of Electrical and Computer Engineering NewarkNJ07102 United States

A collaborative system that includes mobile devices (MDs), edge nodes (ENs), and the cloud is needed where ENs at the network edge can run offloaded tasks of MDs with limited resources and energy for timely processing for latency-sensitive applications. Unlike existing studies, we formulate a total cost minimization problem for the system for applications, which can be divided into several interdependent subtasks. Each subtask can be executed in MDs, ENs, and the cloud. This work formulates a mixed-integer nonlinear program to minimize the total system cost. To address it, a novel meta-heuristic optimization algorithm called Genetic Simulated-annealing-based Particle swarm optimization with Auto-Encoder (GSPAE) is proposed, which innovatively combines feature extraction of deep learning and global search of meta-heuristic optimization. Genetic operations provide diverse solutions, the Metropolis acceptance of annealing offers a robust global search, and autoencoders (AEs) extract distribution characteristics of particles toward high-quality regions for fast convergence. Thus, GSPAE optimizes the associations between ENs and MDs and the scheduling of subtasks among MDs, ENs, and the cloud. Experiments with large-scale Google cluster datasets show that compared to state-of-the-art benchmark methods, GSPAE reduces the total cost by at least 17% while strictly meeting limits of application latency, available energy, computing, and communication resources of ENs and MDs. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Occlusion Face Recognition Feature Fusion Network Based on Precise Guidance Mask Extraction

引用

Journal of Shanghai Jiaotong University (Science) 2025年 1-12页

作者： Ye, Jihua Zhang, Lei Wang, Chao Tu, Qixuan Zheng, Rehua Huang, Huiyuan Jiang, Aiwen School of Computer and Information Engineering Jiangxi Normal University Nanchang330022 China Jiangxi Provincial Key Laboratory for High Performance Computing Jiangxi Normal University Nanchang330022 China State International Science & Technology Cooperation Base of Networked Supporting Software Jiangxi Normal University Nanchang330022 China

The uncertainty in the position and size of occluding objects greatly affects the extraction of identity features in facial recognition, which is a challenge that existing methods fail to effectively address. To tackle this issue, this paper introduces a novel feature fusion network for occluded facial recognition that adaptively handles arbitrary occlusions and accurately extracts occlusion information masks. The network effectively mitigates the impact of occlusions on facial identity features through a feature fusion module. The proposed method employs an occlusion classification module and an occlusion classification loss to precisely guide the extraction of accurate occlusion masks. Subsequently, an occlusion-aware hybrid attention module is introduced, which focuses on the relationship between facial features and occlusion masks across channel and spatial dimensions. This fusion strategy enables the extraction of facial identity features that are resilient to occlusions. Experimental results indicate that the proposed method holds a significant advantage in handling facial recognition tasks with arbitrary occlusions. On the LFW and MF1 synthetic occlusion datasets, the average accuracy rates reached 93.19% and 72.57%, respectively, showing improvements of 1.7 and 2.39 percent points over mainstream methods. © Shanghai Jiao Tong University 2025.

关键词： A feature fusion occluded facial recognition occlusion mask occlusion perception TP391.41

来源：评论

学校读者我要写书评

暂无评论

Against Mobile Collusive Eavesdroppers: Cooperative Secure Transmission and Computation in UAV-Assisted MEC Networks

引用

IEEE Transactions on Mobile computing 2025年第6期24卷 5280-5297页

作者： Zhao, Mingxiong Wang, Zirui Guo, Kun Zhang, Rongqian Quek, Tony Q. S. Yunnan University National Pilot School of Software Kunming650500 China Ministry of Education Engineering Research Center of Integration and Application of Digital Learning Technology Beijing100039 China Ministry of Education Engineering Research Center of Cyberspace Kunming650504 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Kunming650221 China Yunnan University Yunnan Key Laboratory of Software Engineering Kunming650091 China East China Normal University Shanghai Key Laboratory of Multidimensional Information Processing School of Communications and Electronics Engineering Shanghai200241 China Yunnan University School of Information Science and Engineering Kunming650500 China Singapore University of Technology and Design Information Systems Technology and Design 487372 Singapore

In Uncrewed Aerial Vehicle (UAV)-assisted Mobile Edge computing (MEC) networks, the security of transmission faces significant challenges due to the vulnerabilities of line-of-sight links and potential eavesdropping on two-hop links. This paper addresses these challenges with an innovative Cooperative Secure Transmission and Computation strategy (CSTC), specifically engineered for time-slotted UAV-assisted MEC networks plagued by mobile collusive eavesdroppers. These eavesdroppers significantly bolster their interception capabilities through coordinated and optimized movements, escalating the security threats. To neutralize these risks, the proposed CSTC employs the UAV and remote devices as helper nodes to emit jamming signals, thereby thwarting eavesdropping activities, while simultaneously facilitating the efficient relay of users’ tasks to the base station for advanced processing. The CSTC aims to maximize the sum Secrecy Transmission Rate (STR) satisfying task latency constraints. It involves a joint optimization of UAV trajectory, jamming beamformers, transmit power, and data offloading strategy to expedite task transmission. Additionally, a real-time computation scheduling approach is developed based on a newly defined metric, the Urgency Degree of Users (UDoU), to enhance task processing efficiency. Our extensive simulations validate that the CSTC not only elevates the sum STR but also consistently meets latency constraints, demonstrating its robustness against advanced mobile eavesdropping techniques. © 2002-2012 IEEE.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

Measuring biases in AI-generated co-authorship networks

引用

EPJ Data Science 2025年第1期14卷 1-33页

作者： Kalhor, Ghazal Ali, Shiza Mashhadi, Afra School of Electrical and Computer Engineering College of Engineering University of Tehran Tehran Iran Computing and Software Systems University of Washington Bothell WA United States

Large Language Models (LLMs) have significantly advanced prompt-based information retrieval, yet their potential to reproduce or amplify social biases remains insufficiently understood. In this study, we investigate this issue through the concrete task of reconstructing real-world co-authorship networks of computer science (CS) researchers using two widely used LLMs—GPT-3.5 Turbo and Mixtral 8x7B. This task offers a structured and quantifiable way to evaluate whether LLM-generated scholarly relationships reflect demographic disparities, as co-authorship is a key proxy for collaboration and recognition in academia. We compare the LLM-generated networks to baseline networks derived from DBLP and Google Scholar, employing both statistical and network science approaches to assess biases related to gender and ethnicity. Our findings show that both LLMs tend to produce more accurate co-authorship links for individuals with Asian or White names, particularly among researchers with lower visibility or limited academic impact. While we find no significant gender disparities in accuracy, the models systematically favor generating co-authorship links that overrepresent Asian and White individuals. Additionally, the structural properties of the LLM-generated networks differ from those of the baseline networks. These results highlight the importance of examining how LLMs represent social and scientific relationships, particularly in contexts where they are increasingly used for knowledge discovery and scholarly search. © The Author(s) 2025.

关键词： Biases in network representation Co-authorship networks Computer science Ethnicity Gender Large language models

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Features-based Code Search for Precise Query-Code Matching 31

Fine-Grained Features-based Code Search for Precise Query-Co...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhang, Xinting Cheng, Mengqiu Wang, Mengzhen Gong, Songwen Cai, Yi Xie, Jiayuan Li, Qing Department of Computing The Hong Kong Polytechnic University Hong Kong School of Software Engineering South China University of Technology China Department of Mathematics The University of Hong Kong Hong Kong Guangdong Neusoft University China

ISBN: (纸本)9798891761964

Code search aims to quickly locate target code snippets from databases using natural language queries, which promotes code reusability. Existing methods can effectively obtain aligned token-level and query word-level features. However, these studies usually represent the semantics of code and query by averaging the features of each token and word respectively, which makes it difficult to accurately capture the code details that are closely related to the query. To address this issue, we propose a fine-grained code search model that consists of a cross-modal encoder, a mapping layer, and a classification layer. Specifically, we utilize a pre-trained model, GraphCodeBERT, in the cross-modal encoder to align features. In the mapping layer, we introduce a co-attention network to capture the fine-grained interactions between code and query, ensuring a model can precisely identify key code segments relevant to the query. Finally, in the classification layer, we incorporate instruction learning techniques that leverage contextual reasoning to improve the accuracy of query-code matching. Experimental results show that our proposed model significantly outperforms existing methods across multiple programming language datasets. © 2025 Association for Computational Linguistics.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

Towards Attention-Aware Interactive 360-Degree Video Streaming on Smartphones

引用

IEEE Network 2025年

作者： Zhang, Lei Zhou, Haobin Shen, Linfeng Liu, Jiangchuan Cui, Laizhong Shenzhen University College of Computer Science and Software Engineering China Simon Fraser University School of Computing Science Canada

Browsing 360-degree videos on smartphones is becoming increasingly popular, which is challenging due to heavy user interactions, limited hardware capabilities, and constrained batteries. To improve resource efficiency and user experience, we propose a framework for attention-aware interactive 360-degree video streaming for smartphone users. We first explore the built-in capabilities of off-the-shelf smartphones to capture user attention during video browsing. Using the information of user attention to predict viewport and analyze user-perceptive quality, we then investigate the approaches for improving video encoding, transmission, and rendering in 360-degree video streaming. Further, we discuss the opportunities for enhancing user interactive experience with error tolerance, protocol design, and on-device computation. Finally, our prototype implementation is presented as a case study to validate our design principles. Our framework integrates and coordinates advanced techniques for different components of 360-degree video streaming systems to achieve better user experience, which can also serve as a foundation for leveraging modern attention-based multi-modal learning architectures. © 2025 IEEE.

关键词： Video streaming

来源：评论

学校读者我要写书评

暂无评论

Evaluating software Development Agents: Patch Patterns, Code Quality, and Issue Complexity in Real-World GitHub Scenarios

Evaluating Software Development Agents: Patch Patterns, Code...

引用

IEEE International Conference on software Analysis, Evolution and Reengineering (SANER)

作者： Zhi Chen Lingxiao Jiang Centre for Research on Intelligent Software Engineering School of Computing and Information Systems Singapore Management University

ISBN: (数字)9798331535100

ISBN: (纸本)9798331535117

In recent years, AI-based software engineering has progressed from pre-trained models to advanced agentic workflows, with software Development Agents representing the next major leap. These agents, capable of reasoning, planning, and interacting with external environments, offer promising solutions to complex software engineering tasks. However, while much research has evaluated code generated by large language models (LLMs), comprehensive studies on agent-generated patches, particularly in real-world settings, are lacking. This study addresses that gap by evaluating 4,892 patches from 10 top-ranked agents on 500 real-world GitHub issues from SWE-Bench Verified, focusing on their impact on code quality. Our analysis shows no single agent dominated, with 170 issues unresolved, indicating room for improvement. Even for patches that passed unit tests and resolved issues, agents made different file and function modifications compared to the gold patches from repository developers, revealing limitations in the benchmark's test case coverage. Most agents maintained code reliability and security, avoiding new bugs or vulnerabilities; while some agents increased code complexity, many reduced code duplication and minimized code smells. Finally, agents performed better on simpler codebases, suggesting that breaking complex tasks into smaller sub-tasks could improve effectiveness. This study provides the first comprehensive evaluation of agent-generated patches on real-world GitHub issues, offering insights to advance AI-driven software development.

关键词： Gold Codes Large language models Computer bugs Focusing Complexity theory Security Reliability software development management software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：