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

2022 Conference and Labs of the Evaluation Forum, CLEF 2022

作者： Das, Amit Raychawdhary, Nilanjana Dozier, Gerry Seals, Cheryl D. Department of Computer Science and Software Engineering Auburn University AuburnAL United States

In this paper we introduce our system for the task of determining whether an author spreads Irony and Stereotype in English tweets or not, a part of PAN 2022 (IROSTEREO) task. For the irony spreading author classification task, 600 authors each containing 200 tweets have been used. The uniqueness of the task is that it is not a classification between ironic and non ironic tweets, instead it is a classification of irony and non irony spreading authors. The task contains a subtask also that addresses stereotype stance detection. For the previous years, several representation methods like character/word n-grams etc. have been used for tweet representations, but there was not a clear clue whether a combination of other representations would be helpful. To do this end, we introduce BERT combined with TFIDF representation to address this specific problem. Later we used Logistic Regression classifier for the classification task. It was seen that the BERT representation combined with TFIDF showed very promising results. © 2022 Copyright for this paper by its authors.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

How Propense Are Large Language Models at Producing Code Smells? A Benchmarking Study

How Propense Are Large Language Models at Producing Code Sme...

引用

IEEE/ACM International Conference on software engineering: New Ideas and Emerging Technologies Results Track (ICSE-NIER)

作者： Alejandro Velasco Daniel Rodriguez-Cardenas Luftar Rahman Alif David N. Palacio Denys Poshyvanyk Department of Computer Science William & Mary Department of Software Engineering University of Dhaka

ISBN: (数字)9798331537111

ISBN: (纸本)9798331537128

Large Language Models (LLMs) have shown significant potential in automating software engineering tasks, particularly in code generation. However, current evaluation benchmarks, which primarily focus on accuracy, fall short in assessing the quality of the code generated by these models, specifically their tendency to produce code smells. To address this limitation, we introduce CodeSmellEval, a benchmark designed to evaluate the propensity of LLMs for generating code smells. Our benchmark includes a novel metric: Propensity Smelly Score (PSC), and a curated dataset of method-level code smells: CodeSmellData. To demonstrate the use of CodeSmellEval, we conducted a case study with two state-of-the-art LLMs, CodeLlama and Mistral. The results reveal that both models tend to generate code smells, such as simplifiable-condition and consider-merging-isinstance. These findings highlight the effectiveness of our benchmark in evaluating LLMs, providing valuable insights into their reliability and their propensity to introduce code smells in code generation tasks.

关键词： Measurement Codes Accuracy Large language models Benchmark testing software reliability software engineering

来源：评论

学校读者我要写书评

暂无评论

Post-training with Data Augmentation for Improving T5-Based Question Generator 14th

Post-training with Data Augmentation for Improving T5-Based ...

引用

14th International Conference on computer science and its Applications, CSA 2022 and the 16th KIPS International Conference on Ubiquitous Information Technologies and Applications, CUTE 2022

作者： Park, Gyu-Min Hong, Seong-Eun Hong, Choong Seon Park, Seong-Bae Department of Computer Science and Engineering Kyung Hee University Yongin Korea Republic of Department of Software Convergence Kyung Hee University Yongin Korea Republic of

ISBN: (纸本)9789819912513

Post-training is known to be effective for boosting the performance of a pre-trained language model. However, in the task of question generation, question generators post-trained with a well-designed training objective show poor performance without sufficient training examples. To handle this problem, this paper proposes a novel post-training for question generation which adopts a data augmentation technique to increase the number of training examples as well as post-training objectives. As post-training objectives, this paper introduces a new training objective, wh-words deletion, in addition to the well-known question infilling. Moreover, this paper employs back-translation techniques to increase the number of instances for post-training. To prove the effectiveness of the proposed method, this paper applies the post-training strategies to T5, a large-scale pre-trained language model, on SQuAD-QG. The experimental results demonstrate that the proposed post-training is helpful for enhancing the performance of answer-aware question generation. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Towards Improving the Quality of Requirement and Testing Process in Agile software Development:An Empirical Study

引用

computers, Materials & Continua 2024年第9期80卷 3761-3784页

作者： Irum Ilays Yaser Hafeez Nabil Almashfi Sadia Ali Mamoona Humayun Muhammad Aqib Ghadah Alwakid University Institute of Information Technology Pir Mehr Ali Shah Arid Agriculture UniversityRawalpindi46000Pakistan Department of Software Engineering College of Computer and Information SciencesJouf UniversityAl Jouf72388Saudi Arabia School of Arts Humanities and Social Sciences University of RoehamptonLondonSW155PJUK Department of Computer Science College of Computer and Information SciencesJouf UniversityAl Jouf72388Saudi Arabia

software testing is a critical phase due to misconceptions about ambiguities in the requirements during specification,which affect the testing ***,it is difficult to identify all faults in *** requirement changes continuously,it increases the irrelevancy and redundancy during *** to these challenges;fault detection capability decreases and there arises a need to improve the testing process,which is based on changes in requirements *** this research,we have developed a model to resolve testing challenges through requirement prioritization and prediction in an agile-based *** research objective is to identify the most relevant and meaningful requirements through semantic analysis for correct change *** compute the similarity of requirements through case-based reasoning,which predicted the requirements for reuse and restricted to error-based ***,the apriori algorithm mapped out requirement frequency to select relevant test cases based on frequently reused or not reused test cases to increase the fault detection ***,the proposed model was evaluated by conducting *** results showed that requirement redundancy and irrelevancy improved due to semantic analysis,which correctly predicted the requirements,increasing the fault detection rate and resulting in high user *** predicted requirements are mapped into test cases,increasing the fault detection rate after changes to achieve higher user ***,the model improves the redundancy and irrelevancy of requirements by more than 90%compared to other clustering methods and the analytical hierarchical process,achieving an 80%fault detection rate at an earlier ***,it provides guidelines for practitioners and researchers in the modern *** the future,we will provide the working prototype of this model for proof of concept.

关键词： Requirement prediction software testing agile software development semantic analysis case-based reasoning

来源：评论

学校读者我要写书评

暂无评论

Detached and Interactive Multimodal Learning 24

Detached and Interactive Multimodal Learning

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Fan, Yunfeng Xu, Wenchao Wang, Haozhao Liu, Junhong Guo, Song Department of Computing The Hong Kong Polytechnic University Hong Kong Hong Kong School of Computer Science and Technology Huazhong University of Science and Technology Hubei China School of Software Beihang University Beijing China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Hong Kong

ISBN: (纸本)9798400706868

Recently, Multimodal Learning (MML) has gained significant interest as it compensates for single-modality limitations through comprehensive complementary information within multimodal data. However, traditional MML methods generally use the joint learning framework with a uniform learning objective that can lead to the modality competition issue, where feedback predominantly comes from certain modalities, limiting the full potential of others. In response to this challenge, this paper introduces DI-MML, a novel detached MML framework designed to learn complementary information across modalities under the premise of avoiding modality competition. Specifically, DI-MML addresses competition by separately training each modality encoder with isolated learning objectives. It further encourages cross-modal interaction via a shared classifier that defines a common feature space and employing a dimension-decoupled unidirectional contrastive (DUC) loss to facilitate modality-level knowledge transfer. Additionally, to account for varying reliability in sample pairs, we devise a certainty-aware logit weighting strategy to effectively leverage complementary information at the instance level during inference. Extensive experiments conducted on audio-visual, flow-image, and front-rear view datasets show the superior performance of our proposed method. The code is released at https://***/fanyunfeng-bit/DI-MML. © 2024 Owner/Author.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Linear Time Approximation Algorithm for Column Subset Selection with Local Search 38

Linear Time Approximation Algorithm for Column Subset Select...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zou, Yuanbin Huang, Ziyun Xu, Jinhui Wang, Jianxin Feng, Qilong School of Computer Science and Engineering Central South University Changsha410083 China Xiangjiang Laboratory Changsha410205 China Department of Computer Science and Software Engineering Penn State Erie The Behrend College United States Department of Computer Science and Engineering State University of New York BuffaloNY United States The Hunan Provincial Key Lab of Bioinformatics Central South University Changsha410083 China

The Column Subset Selection (CSS) problem has been widely studied in dimensionality reduction and feature selection. The goal of the CSS problem is to output a submatrix S, consisting of k columns from an n × d input matrix A that minimizes the residual error A − SS†A2F, where S† is the Moore-Penrose inverse matrix of S. Many previous approximation algorithms have non-linear running times in both n and d, while the existing linear-time algorithms have a relatively larger approximation ratios. Additionally, the local search algorithms in existing results for solving the CSS problem are heuristic. To achieve linear running time while maintaining better approximation using a local search strategy, we propose a local search-based approximation algorithm for the CSS problem with exactly k columns selected. A key challenge in achieving linear running time with the local search strategy is how to avoid exhaustive enumerations of candidate columns for constructing swap pairs in each local search step. To address this issue, we propose a two-step mixed sampling method that reduces the number of enumerations for swap pair construction from O(dk) to k in linear time. Although the two-step mixed sampling method reduces the search space of local search strategy, bounding the residual error after swaps is a non-trivial task. To estimate the changes in residual error after swaps, we propose a matched swap pair construction method to bound the approximation loss, ensuring a constant probability of loss reduction in each local search step. In expectation, these techniques enable us to obtain the local search algorithm for the CSS problem with theoretical guarantees, where a 53(k + 1)-approximate solution can be obtained in linear running time O(ndk4 log k). Empirical experiments show that our proposed algorithm achieves better quality and time compared to previous algorithms on both small and large datasets. Moreover, it is at least 10 times faster than state-of-the-art algorithms a

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sample Compression for Continual Learning

arXiv

引用

arXiv 2025年

作者： Comeau, Jacob Bazinet, Mathieu Germain, Pascal Subakan, Cem Computer Science and Software Engineering Department Laval University Canada Mila - Quebec Artificial Intelligence Institute Canada Computer Science and Software Engineering Department Concordia University Canada

Continual learning algorithms aim to learn from a sequence of tasks, making the training distribution non-stationary. The majority of existing continual learning approaches in the literature rely on heuristics and do not provide learning guarantees for the continual learning setup. In this paper, we present a new method called ‘Continual Pick-to-Learn’ (CoP2L), which is able to retain the most representative samples for each task in an efficient way. The algorithm is adapted from the Pick-to-Learn algorithm, rooted in the sample compression theory. This allows us to provide high-confidence upper bounds on the generalization loss of the learned predictors, numerically computable after every update of the learned model. We also empirically show on several standard continual learning benchmarks that our algorithm is able to outperform standard experience replay, significantly mitigating catastrophic forgetting. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Network Coverage Improvement during Natural Disaster using Self-Organizing Maps

Network Coverage Improvement during Natural Disaster using S...

引用

2023 International Conference on Electrical, computer, Communications and Mechatronics engineering, ICECCME 2023

作者： Hoang, Nam Devabhakthini, Prathyusha Shukla, Raj Mani Bhunia, Suman Miami University Department of Computer Science and Software Engineering OxfordOH United States Anglia Ruskin University Computing and Information Science Cambridge United Kingdom

ISBN: (纸本)9798350322972

This paper presents an emergency response management system to tackle the problem of the absence of network connectivity during the time of a natural disaster. Network connectivity is often enabled by the base stations on the ground. However, during the time of the disaster, the connectivity is disrupted due to the base station being damaged. During such scenarios, the Unmanned Aerial Vehicles (UAV) based stations could help in partially providing the network connectivity and help in the rescue operations. But, the UAVs need to be quickly deployed and placed at a suitable location based on the population coverage and base stations being impacted due to the disruptions. In this paper, we propose the Self Organizing Map (SOM) based optimal UAV deployment to enhance the network coverage, and increase the percentage of people having network access. In contrast to other Artificial Intelligence-based approaches, like Deep Neural Networks, our method does not require to be heavily trained using train and the test dataset. © 2023 IEEE.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

A Short Survey on Inductive Biased Graph Neural Networks

A Short Survey on Inductive Biased Graph Neural Networks

引用

2022 CCF International Conference on Service science, CCF ICSS 2022

作者： Zhang, Yuqi Wang, Nancy Yu, Jian Yongchareon, Sira Nguyen, Mo Auckland University of Technology Department of Computer Science and Software Engineering Auckland New Zealand

ISBN: (数字)9781665498616

ISBN: (纸本)9781665498616

Many real-world networks including the World Wide Web and the Internet of Things are graphs in their abstract forms. Graph neural networks (GNNs) have emerged as the main solution for deep learning on graphs. Recently, tremendous effort has been made to enhance the performance and expressivity of GNNs. In this paper, we review the state-of-the-art graph neural network models and frameworks with a focus on the latest developments in graph representation learning. We propose a new taxonomy which divides general GNNs into recurrent GNNs, spectral GNNs, spatial GNNs and topology-aware GNNs. We will also discuss the inductive biases behind different categories of GNNs. © 2022 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Cognitive Computing Model for Data Security on a Cloud Platform

引用

computers, Materials & Continua 2023年第12期77卷 3305-3323页

作者： Xiangmin Guo Guangjun Liang Jiayin Liu Xianyi Chen Department of Computer Information and Cyber Security Jiangsu Police InstituteNanjing210031China Jiangsu Electronic Data Forensics and Analysis Engineering Research Center Jiangsu Police InstituteNanjing210031China School of Computer and Software Nanjing University of Information Science and TechnologyNanjing210044China

Cloud storage is widely used by large companies to store vast amounts of data and files,offering flexibility,financial savings,and ***,information shoplifting poses significant threats,potentially leading to poor performance and privacy ***-based cognitive computing can help protect and maintain information security and privacy in cloud platforms,ensuring businesses can focus on business *** ensure data security in cloud platforms,this research proposed a blockchain-based Hybridized Data Driven Cognitive Computing(HD2C)***,the proposed HD2C framework addresses breaches of the privacy information of mixed participants of the Internet of Things(IoT)in the ***2C is developed by combining Federated Learning(FL)with a Blockchain consensus algorithm to connect smart contracts with Proof of ***“Data Island”problem can be solved by FL’s emphasis on privacy and lightning-fast processing,while Blockchain provides a decentralized incentive structure that is impervious to *** with Blockchain allows quick consensus through smart member selection and *** HD2C paradigm significantly improves the computational processing efficiency of intelligent *** analysis results derived from IIoT datasets confirm HD2C *** compared to other consensus algorithms,the Blockchain PoA’s foundational cost is *** accuracy and memory utilization evaluation results predict the total benefits of the *** comparison to the values 0.004 and 0.04,the value of 0.4 achieves good *** to the experiment results,the number of transactions per second has minimal impact on memory *** findings of this study resulted in the development of a brand-new IIoT framework based on blockchain technology.

关键词： Blockchain Internet of Things(IoT) blockchain based cognitive computing Hybridized Data Driven Cognitive Computing(HD2C) Federated Learning(FL) Proof of Authority(PoA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：