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

ChatGPT, Copilot, Gemini, SciSpace and Wolfram versus higher education assessments: an updated multi-institutional study of the academic integrity impacts of Generative Artificial Intelligence (GenAI) on assessment, teaching and learning in engineering

引用

Australasian Journal of engineering Education 2024年第2期29卷 126-153页

作者： Nikolic, Sasha Sandison, Carolyn Haque, Rezwanul Daniel, Scott Grundy, Sarah Belkina, Marina Lyden, Sarah Hassan, Ghulam M. Neal, Peter Faculty of Engineering and Information Sciences University of Wollongong Wollongong Australia School of Science Technology and Engineering University of the Sunshine Coast Sippy Downs Australia School of Professional Practice & Leadership University of Technology Sydney Sydney Australia School of Chemical Engineering University of New South Wales Sydney Australia College Western Sydney University Sydney Australia School of Engineering University of Tasmania Hobart Australia School of Computer Science & Software Engineering University of Western Australia Perth Australia

More than a year has passed since reports of ChatGPT-3.5’s capability to pass exams sent shockwaves through education circles. These initial concerns led to a multi-institutional and multi-disciplinary study to assess the performance of Generative Artificial Intelligence (GenAI) against assessment tasks used across 10 engineering subjects, showcasing the capability of GenAI. Assessment types included online quiz, numerical, oral, visual, programming and writing (experimentation, project, reflection and critical thinking, and research). Twelve months later, the study was repeated using new and updated tools ChatGPT-4, Copilot, Gemini, SciSpace and Wolfram. The updated study investigated the performance and capability differences, identifying the best tool for each assessment type. The findings show that increased performance and features can only heighten academic integrity concerns. While cheating concerns are central, opportunities to integrate GenAI to enhance teaching and learning are possible. While each GenAI tool had specific strengths and weaknesses, ChatGPT-4 was well-rounded. A GenAI Assessment Security and Opportunity Matrix is presented to provide the community practical guidance on managing assessment integrity risks and integration opportunities to enhance learning. © 2024 The Author(s). Published by Informa UK Limited, trading as Taylor & Francis Group.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Edge-Aided Eigenvalue Decomposition in Internet of Things

引用

IEEE Internet of Things Journal 2025年第12期12卷 19901-19914页

作者： Zhao, Xiaotong Zhang, Hanlin Lin, Jie Liang, Fan Kong, Fanyu Xu, Hansong Hua, Kun Qingdao University College of Computer Science and Technology Qingdao266071 China Xian Jiaotong University School of Electronic and Information Engineering Xian710049 China Sam Houston State University Department of Computer Science HuntsvilleTX77340 United States Shandong University School of Software Jinan250101 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China California Polytechnic State University Department of Electrical Engineering San Luis ObispoCA93407 United States

Eigenvalue decomposition (EVD) is a fundamental yet time-consuming operation with extensive applications in IoT. When the matrix dimension reaches millions, resource-limited IoT devices struggle to perform such computationally expensive operations. Edge computing, with its plentiful computing resources, offers an effective solution to this problem. However, privacy concerns arise because outsourced tasks may contain sensitive user data. In this paper, we propose the first privacy-preserving, edge-assisted EVD outsourcing scheme that securely enables users to outsource EVD tasks to edge servers. We design a privacy-preserving matrix transformation method to encode the original data, ensuring that edge servers cannot access users' private information. Additionally, we design a verification scheme that enables the user to verify the correctness of the results returned by the edge servers. Our protocol supports parallel computation by multiple edge servers, thus enhancing the efficiency of EVD. The feasibility of our proposed scheme is demonstrated through both theoretical and experimental perspectives. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Region-adaptive Concept Aggregation for Few-shot Visual Recognition

引用

Machine Intelligence Research 2023年第4期20卷 554-568页

作者： Mengya Han Yibing Zhan Baosheng Yu Yong Luo Han Hu Bo Du Yonggang Wen Dacheng Tao School of Computer Science National Engineering Research Center for Multimedia SoftwareWuhan UniversityWuhan430072China Hubei Luojia Laboratory Wuhan430072China School of Computer Science The University of SydneySydney2006Australia JD Explore Academy Beijing101116China School of Information and Electronics Beijing Institute of TechnologyBeijing100081China School of Computer Science and Engineering Nanyang Technological UniversitySingapore639798Singapore

Few-shot learning (FSL) aims to learn novel concepts from very limited examples. However, most FSL methods suffer from the issue of lacking robustness in concept learning. Specifically, existing FSL methods usually ignore the diversity of region contents that may contain concept-irrelevant information such as the background, which would introduce bias/noise and degrade the performance of conceptual representation learning. To address the above-mentioned issue, we propose a novel metric-based FSL method termed region-adaptive concept aggregation network or RCA-Net. Specifically, we devise a region-adaptive concept aggregator (RCA) to model the relationships of different regions and capture the conceptual information in different regions, which are then integrated in a weighted average manner to obtain the conceptual representation. Consequently, robust concept learning can be achieved by focusing more on the concept-relevant information and less on the conceptual-irrelevant information. We perform extensive experiments on three popular visual recognition benchmarks to demonstrate the superiority of RCA-Net for robust few-shot learning. In particular, on the Caltech-UCSD Birds-200-2011 (CUB200) dataset, the proposed RCA-Net significantly improves 1-shot accuracy from 74.76% to 78.03% and 5-shot accuracy from 86.84% to 89.83% compared with the most competitive counterpart.

关键词： Few-shot learning metric-based meta learning concept learning region-adaptive concept-aggregation

来源：评论

学校读者我要写书评

暂无评论

A path planning method based on deep reinforcement learning for crowd evacuation

引用

Journal of Ambient Intelligence and Humanized Computing 2024年第6期15卷 2925-2939页

作者： Meng, Xiangdong Liu, Hong Li, Wenhao School of Information Science and Engineering Shandong Normal University Jinan250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan250014 China

Deep reinforcement learning (DRL) is suitable for solving complex path-planning problems due to its excellent ability to make continuous decisions in a complex environment. However, the increase in the population size in the crowd evacuation path-planning problem causes a substantial computational burden for the algorithm, which leads to an unsatisfactory efficiency of the current DRL algorithm. This paper presents a path planning method based on DRL for crowd evacuation to solve the problem. First, we divide crowds into groups based on their relationship and distance from each other and select leaders from them. Next, we expand the Multi-Agent Deep Deterministic Policy Gradient (MADDPG) to propose an Optimized Multi-Agent Deep Deterministic Policy Gradient (OMADDPG) algorithm to obtain the global evacuation path. The OMADDPG algorithm uses the Cross-Entropy Method (CEM) to optimize policy and improve the neural network’s training efficiency by applying the Data Pruning (DP) algorithm. In addition, the social force model is improved, incorporating the relationship between individuals and psychological factors into the model. Finally, this paper combines the improved social force model and the OMADDPG algorithm. The OMADDPG algorithm transmits the path information to the leaders. Pedestrians in the environment are driven by the improved social force model to follow the leaders to complete the evacuation simulation. The method can use a leader to guide pedestrians safely arrive the exit and reduce evacuation time in different environments. The simulation results prove the efficiency of the path planning method. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Enhancing Topic Interpretability for Neural Topic Modeling Through Topic-Wise Contrastive Learning 40

Enhancing Topic Interpretability for Neural Topic Modeling T...

引用

40th IEEE International Conference on Data engineering, ICDE 2024

作者： Gao, Xin Lin, Yang Li, Ruiqing Wang, Yasha Chu, Xu Ma, Xinyu Yu, Hailong Software Engineering Institution School of Computer Science Peking University Beijing China Key Lab of High Confidence Software Technologies Ministry of Education Beijing China Peking University National Engineering Research Center of Software Engineering Beijing China School of Computer Science Center on Frontiers of Computing Studies Peking University China

ISBN: (纸本)9798350317152

Data mining and knowledge discovery are essential aspects of extracting valuable insights from vast datasets. Neural topic models (NTMs) have emerged as a valuable unsupervised tool in this field. However, the predominant objective in NTMs, which aims to discover topics maximizing data likelihood, often lacks alignment with the central goals of data mining and knowledge discovery which is to reveal interpretable insights from large data repositories. Overemphasizing likelihood maximization without incorporating topic regularization can lead to an overly expansive latent space for topic modeling. In this paper, we present an innovative approach to NTMs that addresses this misalignment by introducing contrastive learning measures to assess topic interpretability. We propose a novel NTM framework, named ContraTopic, that integrates a differentiable regularizer capable of evaluating multiple facets of topic interpretability throughout the training process. Our regularizer adopts a unique topic-wise contrastive methodology, fostering both internal coherence within topics and clear external distinctions among them. Comprehensive experiments conducted on three diverse datasets demonstrate that our approach consistently produces topics with superior interpretability compared to state-of-the-art NTMs. © 2024 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Effort-aware cross-project just-in-time defect prediction framework for mobile apps

引用

Frontiers of computer science 2022年第6期16卷 15-29页

作者： Tian CHENG Kunsong ZHAO Song SUN Muhammad MATEEN Junhao WEN School of Big Data and Software Engineering Chongqing UniversityChongqing401331China School of Computer Science Wuhan UniversityWuhan430072China Department of Computer Science Air University Multan CampusMultan60000Pakistan

As the boom of mobile devices,Android mobile apps play an irreplaceable roles in people’s daily life,which have the characteristics of frequent updates involving in many code commits to meet new ***-in-Time(JIT)defect prediction aims to identify whether the commit instances will bring defects into the new release of apps and provides immediate feedback to developers,which is more suitable to mobile *** the within-app defect prediction needs sufficient historical data to label the commit instances,which is inadequate in practice,one alternative method is to use the cross-project *** this work,we propose a novel method,called KAL,for cross-project JIT defect prediction task in the context of Android mobile *** specifically,KAL first transforms the commit instances into a high-dimensional feature space using kernel-based principal component analysis technique to obtain the representative ***,the adversarial learning technique is used to extract the common feature embedding for the model *** conduct experiments on 14 Android mobile apps and employ four effort-aware indicators for performance *** results on 182 cross-project pairs demonstrate that our proposed KAL method obtains better performance than 20 comparative methods.

关键词： kernel-based principal component analysis adversarial learning just-in-time defect prediction cross-project model

来源：评论

学校读者我要写书评

暂无评论

Domain-aware Multimodal Dialog Systems with Distribution-based User Characteristic Modeling

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2024年第2期21卷 1-22页

作者： Chen, Xiaolin Song, Xuemeng Zuo, Jianhui Wei, Yinwei Nie, Liqiang Chua, Tat-Seng School of Software Joint SDU-NTU Centre for Artificial Intelligence Research Shandong University Jinan China School of Computer Science and Technology Shandong University Jinan China Department of Human Centred Computing Monash University Melbourne Australia Shenzhen China School of Computing National University of Singapore Singapore Singapore

Textual response generation is a pivotal yet challenging task for multimodal task-oriented dialog systems, which targets at generating the appropriate textual response given the multimodal context. Although existing efforts have obtained remarkable advancements, they ignore the potential of the domain information in revealing the key points of the user intention and the user's history dialogs in indicating the user's characteristics. To address this issue, in this work, we propose a novel domain-aware multimodal dialog system with distribution-based user characteristic modeling (named DMDU). In particular, DMDU contains three vital components: context-knowledge embedding extraction, domain-aware response generation, and distribution-based user characteristic injection. Specifically, the context-knowledge embedding extraction component aims to extract the embedding of multimodal context and related knowledge following existing studies. The domain-aware response generation component targets at conducting domain-aware fine-grained intention modeling based on the context and knowledge embedding, and thus fulfills the textual response generation. Moreover, the distribution-based user characteristic injection component first captures the user's characteristics and current intention with the Gaussian distribution and then conducts the sampling-based contrastive semantic regularization to promote the context representation learning. Experimental results on the public dataset demonstrate the effectiveness of DMDU. We release codes to promote other researchers. © 2024 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

MedNetV3: A Deep Learning Model for MRI Brain Tumor Detection with MobileNetV3 and Advanced Data Augmentation 21

MedNetV3: A Deep Learning Model for MRI Brain Tumor Detectio...

引用

21st International computer Conference on Wavelet Active Media Technology and Information Processing, ICCWAMTIP 2024

作者： Tariq, Hussain Ahmed Fengli, Zhang Salim Shakib, Muhamud Md Javed, Iram School of Information and Software Engineering University of Electronic Science and Technology of China China University of Agriculture Department of Computer Science Faisalabad Pakistan

ISBN: (纸本)9798331519254

In this paper, we present a novel deep learning model medical network (MedNetV3) developed for brain tumor detection. It incorporates advanced data augmentation techniques based on the MobileNetV3 architecture. MedNetV3 is developed for higher classification accuracy at the cost of slightly lower computational efficiency and is therefore suitable for clinical use. The proposed model overcomes the class imbalance problem and can make the model robust to the variations of MRI scans included in the extensive data augmentation methods, such as random rotations, flips. The proposed model trained and evaluated using a publicly available MRI dataset. It achieved a high Area Under the Curve (AUC) value of 0.99 for both the Precision-Recall and Receiver Operating Characteristic (ROC) curves. The results show that MedNetV3 is effective in correctly distinguishing brain tumors and therefore has the potential to be used in medical image classification. © 2024 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Reference Trustable Decoding: A Training-Free Augmentation Paradigm for Large Language Models 38

Reference Trustable Decoding: A Training-Free Augmentation P...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Shi, Luohe Yao, Yao Li, Zuchao Zhang, Lefei Zhao, Hai National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China Department of Computer Science and Engineering Shanghai Jiao Tong University China

Large language models (LLMs) have rapidly advanced and demonstrated impressive capabilities. In-Context Learning (ICL) and Parameter-Efficient Fine-Tuning (PEFT) are currently two mainstream methods for augmenting LLMs to downstream tasks. ICL typically constructs a few-shot learning scenario, either manually or by setting up a Retrieval-Augmented Generation (RAG) system, helping models quickly grasp domain knowledge or question-answering patterns without changing model parameters. However, this approach involves trade-offs, such as slower inference speed and increased space occupancy. PEFT assists the model in adapting to tasks through minimal parameter modifications, but the training process still demands high hardware requirements, even with a small number of parameters involved. To address these challenges, we propose Reference Trustable Decoding (RTD), a paradigm that allows models to quickly adapt to new tasks without fine-tuning, maintaining low inference costs. RTD constructs a reference datastore from the provided training examples and optimizes the LLM's final vocabulary distribution by flexibly selecting suitable references based on the input, resulting in more trustable responses and enabling the model to adapt to downstream tasks at a low cost. Experimental evaluations on various LLMs using different benchmarks demonstrate that RTD establishes a new paradigm for augmenting models to downstream tasks. Furthermore, our method exhibits strong orthogonality with traditional methods, allowing for concurrent usage. Our code can be found at https://***/ShiLuohe/ReferenceTrustableDecoding. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimal Multi-Bitrate Video Caching and Processing in Edge Computing: A Stackelberg Game Approach

引用

IEEE Internet of Things Journal 2025年第13期12卷 25059-25076页

作者： Guo, Min Zhang, Di Xing, Weiwei Shao, Xun Liu, Zhi Zhang, Yaoxue Beijing Jiaotong University School of Software Engineering Beijing100044 China Toyohashi University of Technology Department of Electrical and Electronic Information Engineering Aichi441-8580 Japan The University of Electro-Communications Department of Computer and Network Engineering Tokyo182-8585 Japan Tsinghua University Department of Computer Science and Technology Beijing100084 China

By caching and transcoding video files on edge servers, video edge caching (VEC) can alleviate network congestion and improve user experience. To achieve this, VEC needs to address resource allocation and pricing problems and develop caching and transcoding strategies. However, existing works have not effectively coordinated and resolved these issues. Towards this end, we propose a game-theoretic multi-bitrate video caching and processing method for VEC. Specifically, to address these interdependent issues concurrently, we first incorporate multidimensional strategies into the system model and formalize the profit maximization problems of the network service provider and multiple video providers (VPs) as a constrained multi-objective optimization problem. Second, we transform the problem into a Stackelberg game and identify a Nash equilibrium as the solution. To solve the game problem, we decompose the game process into two stages focusing on resource competition and price determination, respectively. Then, we address the problems of transcoding and caching strategies development, and resource allocation in parallel across varying resource price conditions. The transcoding strategy is determined based on the constraints imposed by delay, value, and the source video. For the caching strategy development and resource allocation, we transform them into two grouped knapsack problems and apply the "dominant strategy» from game theory to identify the "feasible strategy» of VPs. Finally, we determine the resource prices in a traversal manner. Theoretical analysis shows that our proposed method achieves the optimal solution. Experimental results show that our algorithm achieve a 6.04% increase in overall profit compared to the greedy strategy algorithm. © 2025 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：