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

7th IEEE Information Technology and Mechatronics engineering Conference, ITOEC 2023

作者： Bai, Jingqiu Kong, Huafeng Hu, Wenhan Wuhan Business University Department of Information Engineering Hubei China Major in Data Science and Big Data Technology China The Main Research Direction Is the Computer Application China

ISBN: (纸本)9798350334197

This paper studies the correlation between students' concentration in class and learning interest, emotional state and other influencing factors. By collecting students' classroom status data, a data set suitable for data mining is constructed. Based on the idea of Apriori algorithm, the Anaconda Navigator programming tool is used to mine the association rules of students' classroom concentration. Through data mining based on Apriori algorithm, and the association rules between students' emotional state, learning interest and other factors and in-class test scores are output. The results of strong association rules show that the better students' emotional state, learning interest and other states are, the better their classroom concentration performance is. Mining the potential influencing factors of students' classroom concentration provides valuable reference theory for students to improve classroom concentration and teachers to improve classroom teaching effect, which is helpful for teachers and students to build a more efficient classroom together in the future. © 2023 IEEE.

关键词： Association rules

来源：评论

学校读者我要写书评

暂无评论

Applying Competition-Based Learning to Stimulate Students' Practical and Competitive ai Ability in a Machine Learning Curriculum

引用

IEEE Transactions on Education 2024年第2期67卷 256-265页

作者： Chang, Hui-Tzu Lin, Chia-Yu National Yang Ming Chiao Tung University Center for Institutional Research and Data Analytics Hsinchu30010 Taiwan National Central University Department of Computer Science and Information Engineering Taoyuan City320317 Taiwan

Contribution: This study incorporates competition-based learning (CBL) into machine learning courses. By engaging students in innovative problem-solving challenges within information competitions, revealing that students' participation in online problem-solving competitions can improve their information technology, and showcase competitions can enhance their competition ability. Background: The CBL model seamlessly integrates project-based learning and competition, placing a strong emphasis on both collective learning and outcomes. This approach cultivates motivation among team members, driving them to enhance their learning and translate knowledge into practical experience. research Questions: The objective is to examine the disparities in the development of theoretical knowledge, information technology, ai practical ability, and competition ability among students participating in online problem-solving competitions and showcase competitions, and discusses the potential moderating effect of competition type on the relationships between variables in the hypothetical model. Methodology: The study involved 74 students enrolled in machine learning course at a university. The students were given theoretical knowledge and information technology pretests and posttests in the 2nd and 17th weeks, respectively. In the 18th week, the students presented their projects using slideshows and were graded by judges while also submitting their final competition proposal and slides. Findings: Students in online problem-solving competitions can enhance their information technology, while those participating in showcase competitions can improve their competitive ability. Moreover, the competition type was found to moderate the relationships among theoretical knowledge, information technology, and ai model accuracy. The findings suggest that incorporating CBL into machine learning courses effectively cultivates students' ai practical and competitive abilities. © 1963-2012 IEEE.

关键词： Competition

来源：评论

学校读者我要写书评

暂无评论

Ghost Module Based Residual Mixture of Self-Attention and Convolution for Online Signature Verification

引用

computers, Materials & Continua 2024年第4期79卷 695-712页

作者： Fangjun Luan Xuewen Mu Shuai Yuan Department of Computer Technology School of Computer Science and EngineeringShenyang Jianzhu UniversityShenyang110168China Liaoning Province Big Data Management and Analysis Laboratory of Urban Construction Shenyang Jianzhu UniversityShenyang110168China Shenyang Branch of National Special Computer Engineering Technology Research Center Shenyang Jianzhu UniversityShenyang110168China

Online Signature Verification (OSV), as a personal identification technology, is widely used in various ***, it faces challenges, such as incomplete feature extraction, low accuracy, and computational heaviness. Toaddress these issues, we propose a novel approach for online signature verification, using a one-dimensionalGhost-ACmix Residual Network (1D-ACGRNet), which is a Ghost-ACmix Residual Network that combines convolutionwith a self-attention mechanism and performs improvement by using Ghost method. The Ghost-ACmix Residualstructure is introduced to leverage both self-attention and convolution mechanisms for capturing global featureinformation and extracting local information, effectively complementing whole and local signature features andmitigating the problem of insufficient feature extraction. Then, the Ghost-based Convolution and Self-Attention(ACG) block is proposed to simplify the common parts between convolution and self-attention using the Ghostmodule and employ feature transformation to obtain intermediate features, thus reducing computational ***, feature selection is performed using the random forestmethod, and the data is dimensionally reducedusing Principal Component Analysis (PCA). Finally, tests are implemented on the MCYT-100 datasets and theSVC-2004 Task2 datasets, and the equal error rates (EERs) for small-sample training using five genuine andforged signatures are 3.07% and 4.17%, respectively. The EERs for training with ten genuine and forged signaturesare 0.91% and 2.12% on the respective datasets. The experimental results illustrate that the proposed approacheffectively enhances the accuracy of online signature verification.

关键词： Online signature verification feature selection ACG block ghost-ACmix residual structure

来源：评论

学校读者我要写书评

暂无评论

MCT-Net: a multi-branch hybrid CNN-transformer model for medical image segmentation

引用

Pattern Analysis and applications 2025年第2期28卷 1-21页

作者： Shen, Longfeng Diao, Liangjin Peng, Rui Chen, Jiacong Lu, Zhengtian Ge, Fangzhen Anhui Engineering Research Center for Intelligent Computing and Application on Cognitive Behavior (ICACB) College of Computer Science and Technology Huaibei Normal University Anhui Huaibei China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China Anhui Big-Data Research Center on University Management Huaibei Normal University Anhui Huaibei China

In recent years, neural networks have demonstrated substantial progress in medical image segmentation. However, accurately segmenting objects in medical images is often restricted by edge blurring, which complicates the delineation of structures of interest. The purpose of this study is to develop a multi-branch hybrid CNN-transformer model to address the issue of edge blurring in medical image segmentation. This approach enables more precise edge detection and segmentation. Integrating hybrid CNN and transformer decoders facilitates detailed recovery while preserving global structures, thus minimizing errors in regions with blurred edges. Additionally, we incorporate a hybrid attention mechanism at the model’s bottleneck to enhance feature transfer between the encoder and decoder. The model was trained using the ACDC, Synapse, and polyp datasets, with a focus on improving segmentation accuracy in regions with blurry edges. Experimental results reveal that the proposed model surpasses existing state-of-the-art methods on the ACDC, Synapse, and polyp datasets, demonstrating its superior performance and effectiveness. These results suggest that the proposed model offers a significant improvement in handling edge blurring, with potential applications in enhancing medical image analysis and diagnostics. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Attention mechanism Convolutional neural network Edge information Medical image segmentation Transformer

来源：评论

学校读者我要写书评

暂无评论

Drawing Order Diagrams Through Two-Dimension Extension

引用

Journal of Graph Algorithms and applications 2023年第9期27卷 783-802页

作者： Dürrschnabel, Dominik Hanika, Tom Stumme, Gerd Knowledge & Data Engineering Group Research Center for Information System Design & Department of Electrical Engineering and Computer Science University of Kassel Germany Institute of Computer Science University of Hildesheim Germany Berlin School of Library and Information Science Humboldt-Universität zu Berlin Germany

Ordinal real-world data such as concept hierarchies, ontologies, genealogies, or task dependencies in scheduling often has the property to not only contain pairwise comparable, but also incomparable elements. Order diagrams provide an important tool for understanding and thus discovering knowledge in such data. Easily readable drawings of such order diagrams are hard to come by, even for small ordered sets. Many attempts were made to transfer classical graph drawing approaches to order diagrams. Although these methods produce satisfying results for some ordered sets, they unfortunately perform poorly in general. In this work, we present the novel algorithm DimDraw to decompose an ordered set (e.g., a concept hierarchy) in linear orders and to produce a corresponding order diagram. This algorithm is based on a relation between the dimension of an ordered set and the bipartiteness of its transitive incompatibility graph. To evaluate the quality of the algorithm, a user study was conducted where generated drawings were compared with ones from state-of-the-art drawing algorithms. © 2023 Brown University. All rights reserved.

关键词： Set theory

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of computer science & Technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

Soft-GNN:towards robust graph neural networks via self-adaptive data utilization

引用

Frontiers of computer science 2025年第4期19卷 1-12页

作者： Yao WU Hong HUANG Yu SONG Hai JIN National Engineering Research Center for Big Data Technology and System Service Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China College of Information and Communication National University of Defense TechnologyWuhan 430019China Department of Computer Science and Operations Research Universitéde MontréalMontreal H3C 3J7Canada

Graph neural networks(GNNs)have gained traction and have been applied to various graph-based data analysis tasks due to their high ***,a major concern is their robustness,particularly when faced with graph data that has been deliberately or accidentally polluted with *** presents a challenge in learning robust GNNs under noisy *** address this issue,we propose a novel framework called Soft-GNN,which mitigates the influence of label noise by adapting the data utilized in *** approach employs a dynamic data utilization strategy that estimates adaptive weights based on prediction deviation,local deviation,and global *** better utilizing significant training samples and reducing the impact of label noise through dynamic data selection,GNNs are trained to be more *** evaluate the performance,robustness,generality,and complexity of our model on five real-world datasets,and our experimental results demonstrate the superiority of our approach over existing methods.

关键词： graph neural networks node classification label noise robustness

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Shop Scheduling Using Space-Cooperation Multi-Objective Optimization

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable Computing 2025年第3期10卷 601-615页

作者： Ding, Jiepin Xia, Jun Yang, Yaning Zhou, Junlong Chen, Mingsong Li, Keqin East China Normal University MoE Engineering Research Center of Software/Hardware Co-Design Technology and Application Shanghai200062 China Ningxia Normal University School of Physics and Electronic Information Engineering Guyuan756500 China Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210094 China State University of New York Department of Computer Science New PaltzNY12561 United States

Since Industry 5.0 emphasizes that manufacturing enterprises should raise awareness of social contribution to achieve sustainable development, more and more meta-heuristic algorithms are investigated to save energy in manufacturing systems. Although non-dominated sorting-based meta-heuristics have been recognized as promising multi-objective optimization methods for solving the energy-efficient flexible job shop scheduling problem (EFJSP), it is hard to guarantee the quality of the Pareto front (e.g., total energy consumption, makespan) due to the lack of population diversity. This is mainly because an improper individual comparison inevitably reduces population diversity, thus limiting exploration and exploitation abilities during population updates. To achieve efficient population evolution, this paper introduces a novel space-cooperation multi-objective optimization (SCMO) method that can effectively solve EFJSP to obtain scheduling schemes with better trade-offs. By cooperatively evaluating the similarity among individuals in both the decision space and objective space, we propose a space-cooperation population update method based on a three-vector representation that can accurately eliminate repetitive individuals to derive higher-quality Pareto solutions. To further improve search efficiency, we propose a difference-driven local search, which selectively changes the positions of operations with higher differences to search for neighbors effectively. Based on the Taguchi method, we conduct experiments to obtain a suitable parameter combination of SCMO. Comprehensive experimental results show that, compared to state-of-the-art methods, our SCMO method achieves the highest HV and NR and the lowest IGD, with an average of 0.990, 0.952, and 0.001, respectively. Meanwhile, compared to traditional local search approaches, our difference-driven local search obtains twice the HV on instance Mk12 and reduces the solving time from 1521 s to 475 s. © 2016 IEEE.

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

An Integrated Analysis of Yield Prediction Models:A Comprehensive Review of Advancements and Challenges

引用

computers, Materials & Continua 2024年第7期80卷 389-425页

作者： Nidhi Parashar Prashant Johri Arfat Ahmad Khan Nitin Gaur Seifedine Kadry School of Computer Science and Engineering Galgotias UniversityGreater Noida203201India Department of Applied Data Science Noroff University CollegeKristiansand4612Norway Artificial Intelligence Research Center(AIRC) Ajman UniversityAjman346United Arab Emirates MEU Research Unit Middle East UniversityAmman11831Jordan Department of Computer Science College of ComputingKhon Kaen UniversityKhon Kaen40002Thailand

The growing global requirement for food and the need for sustainable farming in an era of a changing climate and scarce resources have inspired substantial crop yield prediction *** learning(DL)and machine learning(ML)models effectively deal with such *** research paper comprehensively analyses recent advancements in crop yield prediction from January 2016 to March *** addition,it analyses the effectiveness of various input parameters considered in crop yield prediction *** conducted an in-depth search and gathered studies that employed crop modeling and ai-based methods to predict crop *** total number of articles reviewed for crop yield prediction using ML,meta-modeling(Crop models coupled with ML/DL),and DL-based prediction models and input parameter selection is *** conduct the research by setting up five objectives for this research and discussing them after analyzing the selected research *** study is assessed based on the crop type,input parameters employed for prediction,the modeling techniques adopted,and the evaluation metrics used for estimatingmodel *** also discuss the ethical and social impacts of ai on ***,various approaches presented in the scientific literature have delivered impressive predictions,they are complicateddue to intricate,multifactorial influences oncropgrowthand theneed for accuratedata-driven ***,thorough research is required to deal with challenges in predicting agricultural output.

关键词： Machine learning crop yield prediction deep learning remote sensing long short-term memory time series prediction systematic literature review

来源：评论

学校读者我要写书评

暂无评论

An efficient speech emotion recognition based on a dual-stream CNN-transformer fusion network

引用

International Journal of Speech Technology 2023年第2期26卷 541-557页

作者： Tellai, Mohammed Gao, Lijian Mao, Qirong Department of Computer Science and Communication Engineering Jiangsu University Jiangsu Zhenjiang212013 China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications Jiangsu Zhenjiang212013 China

The use of machine learning and artificial intelligence enables us to create intelligent systems. Speech emotion recognition system analyzes the speaker’s speech to determine his/her emotional state. Speech emotion recognition is a challenging pattern recognition task. This paper proposes a new robust and lightweight speech emotion recognition system based on a dual-stream CNN-Transformer fusion network that effectively captures spatial and temporal information disentangled in long-distance raw features by exploring both MFCCs and Mel-spectrograms in a parallel mechanism. Experiments are performed on the widely used emotional benchmark datasets. Our approach has shown to be quite efficient. It outperforms the best-known state-of-the-art models with an accuracy of 97.64%, 99.42%, and 97.53% on RAVDESS, TESS, and EMO-DB datasets respectively. The results demonstrate the significant advantages of the proposed model and the ability of this architecture to learn to recognize emotional data features accurately. © 2023, The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：