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

Residual Scheduling: A New Reinforcement Learning Approach to Solving Job Shop Scheduling Problem

IEEE Access 2024年 12卷 14703-14718页

作者： Ho, Kuo-Hao Cheng, Jui-Yu Wu, Ji-Han Chiang, Fan Chen, Yen-Chi Wu, Yuan-Yu Wu, I-Chen National Yang Ming Chiao Tung University Department of Computer Science Hsinchu30010 Taiwan Academia Sinica Research Center for Information Technology Innovation Taipei11529 Taiwan

Job-shop scheduling problem (JSP) is a mathematical optimization problem widely used in industries like manufacturing, and flexible JSP (FJSP) is also a common variant. Since they are NP-hard, it is intractable to find the optimal solution for all cases within reasonable times. Thus, it becomes important to develop efficient heuristics to solve JSP/FJSP. A kind of method of solving scheduling problems is construction heuristics, which constructs scheduling solutions via heuristics. Recently, many methods for construction heuristics leverage deep reinforcement learning (DRL) with graph neural networks (GNN). In this paper, we propose a new approach, named residual scheduling, to solving JSP/FJSP. In this new approach, we remove irrelevant machines and jobs such as those finished, such that the states include the remaining (or relevant) machines and jobs only. Our experiments show that our approach reaches state-of-the-art (SOTA) among all known construction heuristics on most well-known open JSP and FJSP benchmarks. In addition, we also observe that even though our model is trained for scheduling problems of smaller sizes, our method still performs well for scheduling problems of large sizes in terms of makespan. Interestingly in our experiments, our approach even reaches zero makespan gap for 49 among 60 JSP instances whose job numbers are more than 100 on 15 machines. © 2013 IEEE.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

SEED-VII: A Multimodal Dataset of Six Basic Emotions With Continuous Labels for Emotion Recognition

引用

IEEE Transactions on Affective Computing 2025年第2期16卷 969-985页

作者： Jiang, Wei-Bang Liu, Xuan-Hao Zheng, Wei-Long Lu, Bao-Liang Shanghai Jiao Tong University Center for Brain-Like Computing and Machine Intelligence Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Brain Science and Technology Research Center Department of Computer Science and Engineering Shanghai200240 China

Recognizing emotions from physiological signals is a topic that has garnered widespread interest, and research continues to develop novel techniques for perceiving emotions. However, the emergence of deep learning has highlighted the need for comprehensive and high-quality emotional datasets that enable the accurate decoding of human emotions. To systematically explore human emotions, we develop a multimodal dataset consisting of six basic (happiness, sadness, fear, disgust, surprise, and anger) emotions and the neutral emotion, named SEED-VII. This multimodal dataset includes electroencephalography (EEG) and eye movement signals. The seven emotions in SEED-VII are elicited by 80 different videos and fully investigated with continuous labels that indicate the intensity levels of the corresponding emotions. Additionally, we propose a novel Multimodal Adaptive Emotion Transformer (MAET), that can flexibly process both unimodal and multimodal inputs. Adversarial training is utilized in the MAET to mitigate subject discrepancies, which enhances domain generalization. Our extensive experiments, encompassing both subject-dependent and cross-subject conditions, demonstrate the superior performance of the MAET in terms of handling various inputs. Continuous labels are used to filter the data with high emotional intensity, and this strategy is proven to be effective for attaining improved emotion recognition performance. Furthermore, complementary properties between the EEG signals and eye movements and stable neural patterns of the seven emotions are observed. © 2010-2012 IEEE.

关键词： Eye movements

来源：评论

学校读者我要写书评

暂无评论

Med-Tuning: A New Parameter-Efficient Tuning Framework for Medical Volumetric Segmentation 7

Med-Tuning: A New Parameter-Efficient Tuning Framework for M...

引用

7th International Conference on Medical Imaging with Deep Learning, MIDL 2024

作者： Shen, Jiachen Wang, Wenxuan Chen, Chen Jiao, Jianbo Liu, Jing Zhang, Yan Song, Shanshan Li, Jiangyun School of Automation and Electrical Engineering University of Science and Technology Beijing China Center for Research in Computer Vision University of Central Florida United States School of Computer Science University of Birmingham United Kingdom Institute of Automation Chinese Academy of Sciences China

The "pre-training then fine-tuning (FT)" paradigm is widely adopted to boost the model performance of deep learning-based methods for medical volumetric segmentation. However, conventional full FT incurs high computational and memory costs. Thus, it is of increasing importance to fine-tune pre-trained models for medical volumetric segmentation tasks in a both effective and parameter-efficient manner. In this paper, we introduce a new framework named Med-Tuning to realize parameter-efficient tuning (PET) for medical volumetric segmentation task and an efficient plug-and-play module named Med-Adapter for task-specific feature extraction. With a small number of tuned parameters, our framework enhances the 2D baselines’s precision on segmentation tasks, which are pre-trained on natural images. Extensive experiments on three benchmark datasets (CT and MRI modalities) show that our method achieves better results than previous PET methods on volumetric segmentation tasks. Compared to full FT, Med-Tuning reduces the fine-tuned model parameters by up to 4×, with even better segmentation performance. Our project webpage is at https://***/Med-Tuning/. © 2024 CC-BY 4.0, J. Shen, W. Wang, C. Chen, J. Jiao, J. Liu, Y. Zhang, S. Song & J. Li.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Multilevel Self-Training Approach for Cross-Domain Semantic Segmentation in Intelligent Vehicles

引用

IEEE Intelligent Transportation Systems Magazine 2024年第1期16卷 148-161页

作者： Chen, Yung-Yao Jhong, Sin-Ye National Taiwan University of Science and Technology Department of Electronic and Computer Engineering Smart Electric Vehicle Research Center Taipei106335 Taiwan National Cheng Kung University Department of Engineering Science Tainan City701 Taiwan

The use of intelligent vehicle technology is increasing;however, this technology requires further improvement. Semantic segmentation enables intelligent vehicles to understand the environment. Although advances have been achieved in a deep learning model for semantic segmentation, large-scale real-world datasets with manual pixel-level annotations, which are expensive, are required for adequately training these models. Unsupervised domain adaptation (UDA) for semantic segmentation enables training on a synthetic source domain and allows a model to be adapted to the real-world target domain without target domain annotations. Self-training is a highly effective UDA method;however, current UDA methods struggle to shift domains effectively and rely heavily on aggressive image-based perturbations for consistency training, resulting in poor-quality pseudolabels during the early training phase and decreased training efficiency. Therefore, we propose a novel multilevel self-training UDA method for semantic segmentation. First, a feature guidance and resampling strategy is adopted to improve the learning of rare classes in the source domain, and a spatial-aware mixing method is then used for gradually and smoothly eliminating the domain gap through training in various cross-domain intermediate spaces. In addition, we developed an instance and prototype feature consistency technique that explores optimization in the feature space to improve the training process by increasing model consistency. We conducted large-scale experiments on two challenging UDA benchmarks, 'GTA5-to-Cityscapes' and 'SYNTHIA-to-Cityscapes.' Our method achieved similar or superior performance to that of previously developed UDA methods for semantic segmentation and has advantages in terms of training stability and convergence efficiency. © 2009-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An Adaptable Algorithm for Optimizing Bus Line Distribution Using the Clustering Method

引用

Wireless Personal Communications 2024年第4期134卷 2347-2370页

作者： Sheikhi, Fatemeh Rahmani, Amir Masoud Computer Engineering Department Science and Research Branch Islamic Azad University Tehran Iran Future Technology Research Center National Yunlin University of Science and Technology 123 University Road Section 3 Yunlin Douliou64002 Taiwan

The current fleet of cars requires reevaluation, upgrades, and replacement in response to the expanding human population, the increase in urban traffic volume, and the elevated levels of air pollution attributed to vehicular emissions. In densely populated cities, bus routes effectively compete with private transportation, optimize user accessibility, and provide access to all urban residents. This study proposes a novel method for optimizing bus routes, encompassing four primary processes: preprocessing, site clustering, ridership prediction, and optimization. The clustering process employs the K-means technique to classify available bus stops based on their geographical information. The suggested method utilizes an artificial neural network model to forecast the number of passengers at different locations. Subsequently, the bee colony optimization algorithm is implemented to determine bus frequencies and achieve an optimal distribution of buses across various traffic lines. Results obtained using a real traffic line dataset indicate a 32% increase in traffic fleet capacity and a 22.33% reduction in passenger waiting time upon application of the proposed method. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Mitigating Data Sparsity in Point-of-Interest Recommendation Systems Using Multi-Modal User Profiles 10

Mitigating Data Sparsity in Point-of-Interest Recommendation...

引用

10th International Conference on Digital Arts, Media and Technology and 8th ECTI Northern Section Conference on Electrical, Electronics, computer and Telecommunications Engineering, ECTI DAMT and NCON 2025

作者： Arthan, Sudarat Tamee, Kreangsak Naresuan University Department of Computer Science and Information Technology Phitsanulok Thailand Naresuan University Research Center for Academic Excellence in Nonlinear Analysis and Optimization Naresuan University Department of Computer Science and Information Technology Phitsanulok Thailand

ISBN: (纸本)9798331543273

This study presents a solution to the data sparsity issue in POI recommendation systems by introducing a multi-modal user profile approach called Visual-Textual Collaborative Filtering (VTCF). VTCF integrates textual POI descriptions from Wikipedia with user-generated photos to improve the representation of user preferences. Using publicly available geo-tagged photo datasets, we compared VTCF with various baseline methods, including traditional user-based collaborative filtering and approaches based on visual and contextual preferences. The experimental results demonstrate that our approach successfully addresses the challenges of sparse check-in data, resulting in more accurate and relevant recommendations. The findings suggest that VTCF is a promising method for improving recommendation accuracy. Future work could explore additional data sources and techniques to further enhance POI recommendation systems. Moreover, computational trade-offs and scalability should be considered, as integrating textual and visual data adds system complexity. Strategies such as batch processing and parallel computation could help mitigate these issues for large-scale applications. © 2025 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of CNN Models for Multiclass Detection on Colon Disease 9

Comparative Analysis of CNN Models for Multiclass Detection ...

引用

9th International Conference on Information Technology and Digital Applications, ICITDA 2024

作者： Sulistyawan, Jason Sebastian Nugroho, Kuncahyo Setyo Isnan, Mahmud Pardamean, Bens Binus Graduate Program Bina Nusantara University Computer Science Department Jakarta11480 Indonesia Bioinformatics and Data Science Research Center Bina Nusantara University Jakarta11480 Indonesia School of Computer Science Bina Nusantara University Computer Science Department Jakarta11480 Indonesia

ISBN: (纸本)9798331510732

Gastrointestinal diseases are significant health concerns that mostly affect the digestive and biliary tracts. These can only be observed internally through endoscopy, or a modern approach named Wireless Capsule Endoscopy. Though the approach has proven to work, the process relies heavily on medical experts, which is prone to error when given a considerably large load. The use of deep learning in detecting diseases with images has been proven to work in various cases and can be implemented for gastrointestinal diseases. This study compared four deep learning models based on Convolutional Neural Network architectures consisting of the VGG16, ResNet152V2, InceptionV3, and Xception for classifying colon disease images. The experiment showed that the ResNet152V2 performed the best, compared to the other three with a testing accuracy score of 0.9837. On the other hand, the VGG16 had the lowest performance with around accuracy score of 0.89 while the Xception and InceptionV3models yielded similar accuracy scores of 0.9587 and 0.9549, respectively. The results highlight the effectiveness of ResNet152V2 in handling the complexity of colon disease detection © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A Heuristic for Direct Product Graph Decomposition

引用

Journal of Graph Algorithms and Applications 2023年第7期27卷 581-601页

作者： Calderoni, Luca Margara, Luciano Marzolla, Moreno Dept. of Computer Science and Engineering University of Bologna Italy Center for Inter-Department Industrial Research ICT Università di Bologna Italy

In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph G with adjacency matrix Adj(G), our heuristic aims at identifying two graphs G1 and G2 such that G = G1 × G2, where G1 × G2 is the direct product of G1 and G2. For undirected, connected graphs it has been shown that graph decomposition is "at least as difficult" as graph isomorphism;therefore, polynomial-time algorithms for decomposing a general directed graph into factors are unlikely to exist. Although graph factorization is a problem that has been extensively investigated, the heuristic proposed in this paper represents – to the best of our knowledge – the first computational approach for general directed, unweighted graphs. We have implemented our algorithm using the MATLAB environment;we report on a set of experiments that show that the proposed heuristic solves reasonably-sized instances in a few seconds on general-purpose hardware. Although the proposed heuristic is not guaranteed to find a factorization, even if one exists;however, it always succeeds on all the randomly-generated instances used in the experimental evaluation. © 2023, Brown University. All rights reserved.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

A Robust Key Exchange and Tamper-Resistant Protocol for HAN and NAN Networks in Smart Grids

引用

IEEE Internet of Things Journal 2025年第12期12卷 21394-21403页

作者： Faizan Ayub, Muhammad Li, Xiong Mahmood, Khalid Shamshad, Salman Kumar Das, Ashok Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Douliu64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan International Institute of Information Technology Hyderabad Center for Security Theory and Algorithmic Research Hyderabad500032 India Korea University College of Informatics Department of Computer Science and Engineering Seoul02841 Korea Republic of Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China

Smart grids (SGs) rely on home area networks (HANs) and neighborhood area networks (NANs) to ensure efficient power distribution, real-time monitoring, and seamless communication between smart devices. Despite these advantages, the use of public communication channels in HAN and NAN networks introduces critical challenges, such as vulnerability to impersonation, physical tampering, and scalability issues in resource-constrained environments. These issues compromise the stability, reliability, and security of SG environments. Existing protocols often fail to adequately address these challenges, particularly in ensuring resistance to physical tampering of supply lines and impersonation attacks. Additionally, they struggle to minimize the computation, communication, and energy costs associated with securing a resource-constrained SG environment. Therefore, we propose a robust key exchange and tamper-resistant protocol for HAN and NAN networks to address these limitations. The proposed protocol leverages the physical unclonable function (PUF) mechanism to offer physical tampering resistance to smart meters. We validate our protocol formally using the Random or Real (RoR) model, which confirms its security robustness. Additionally, our informal security analysis highlights the protocol’s resilience against impersonation, physical tampering attacks, etc. We analyze and compare the performance of the proposed protocol, which further demonstrates our protocol’s effectiveness and security compared to competing protocols. Moreover, the proposed protocol achieves resource efficiency with 45.99% and 58.85% substantial reductions in computation overhead and energy overhead, respectively, compared to competing protocols. These results showcase the protocol’s enhanced security and practicality for resource-constrained SG environments. © 2014 IEEE.

关键词： Authentication Protocol

来源：评论

学校读者我要写书评

暂无评论

Automatic Multiple Choice Question Generation: A Systematic Literature Review 9

Automatic Multiple Choice Question Generation: A Systematic ...

引用

9th International Conference on Information Technology and Digital Applications, ICITDA 2024

作者： Henry, Matthew Martianus Heryanto, Nur Adhianti Isnan, Mahmud Nugroho, Kuncahyo Setyo Pardamean, Bens Bina Nusantara University Bioinformatics and Data Science Research Center Jakarta11480 Indonesia School of Computer Science Bina Nusantara University Computer Science Department Jakarta11480 Indonesia Bina Nusantara University Binus Graduate Program Computer Science Department Jakarta11480 Indonesia

ISBN: (纸本)9798331510732

Despite their drawbacks, multiple-choice questions (MCQ) have been widely used to assess the students' understanding of lectures through examinations. The development of automatic MCQ generation is beneficial, especially for educators. As a starting point for further development, a Systematic Literature Review (SLR) is conducted to uncover current trends, future challenges, and opportunities in automatic MCQ generation. Previously, an SLR was conducted, but it lacks coverage of the utilization of transformer-based models. This SLR covers the development of automatic MCQ generation using either traditional or advanced approaches such as Transformers. The Preferred Reporting Items for Systematic Reviews and Meta-Analyses framework was used to gather the data from Scopus, IEEE Xplore, SpringerLink, arXiv, and Semantic Scholar. The included articles must be open-access computer science conference papers or journal articles and written in English less than five years ago. Four independent reviewers analyzed the research workflow, evaluation metric, and dataset used in each study. There are 18 included studies, where 17% (n = 3) studies are from 2024, 33% (n = 6) studies are from 2023, 22% (n = 4) studies are from 2022, 11% (n = 2) studies are from 2021, and 17% (n = 3) studies are from 2020. There are 33% (n = 6) of the studies used the traditional feature-based engineering approach, 39% (n = 7) of the studies used the Transformer-based model fine-tuning approach, and the remaining used novel approaches. The study found that BERT variants are the most utilized Transformer-based model in automatic MCQ. The research notes some challenges, but also open various opportunities for further research, including Large Language Model (LLM) utilization for automatic MCQ generation, the utilization BERT-based models for standardized machine-learned evaluation metrics, and the initiative for the creation of an MCQ dataset benchmark. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：