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

作者： Jin, Yong Xu, Jia Xu, Lijie Liu, Linfeng Xiao, Fu Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Jiangsu Nanjing China School of Computer Science & Engineering Changshu Institute of Technology Jiangsu Changshu China

Public transportation system is one of the most effective ways to conserve energy and reduce carbon emissions. However, the traditional public transportation system does not provide customized service and cannot guarantee the arrival time to destination. To address these issues, we formulate the minimum shared bus scheduling problem to minimize the number of shared buses such that all orders can be completed under constraints of deadlines and capacity of shared bus. We propose the approximation algorithms, S-MBSA for the shared bus with strong endurance and E-MBSA for the large-scale order scenario, to solve the minimum shared bus scheduling problem. We further formulate the constrained maximum revenue shared bus scheduling problem to maximize the revenue under the limited number of shared buses, and propose an approximation algorithm, CMRBSA, to find the shared bus route schedules. Through the extensive simulations, we demonstrate the significant superiority of S-MBSA and E-MBSA in terms of number of shared buses. Furthermore, CMRBSA outperforms the benchmark algorithms significantly in terms of revenue. © 2022 John Wiley & Sons Ltd.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs

引用

Frontiers of Computer science 2023年第4期17卷 97-107页

作者： Jia LI Wenjun LI Yongjie YANG Xueying YANG School of Information Engineering Hunan Industry PolytechnicChangsha 410036China Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer and Communication EngineeringChangsha University of Science and TechnologyChangsha 410015China Chair of Economic Theory Saarland UniversitySaarbrücken 66123Germany

In the minimum degree vertex deletion problem,we are given a graph,a distinguished vertex in the graph,and an integer κ,and the question is whether we can delete at most κ vertices from the graph so that the distinguished vertex has the unique minimum *** maximum degree vertex deletion problem is defined analogously but here we want the distinguished vertex to have the unique maximum *** is known that both problems areΨ-hard and fixed-parameter intractable with respect to some natural *** this paper,we study the(parameterized)complexity of these two problems restricted to split graphs,p-degenerate graphs,and planar *** study provides a comprehensive complexity landscape of the two problems restricted to these special graphs.

关键词： minimum degree maximum degree vertex deletion split graphs planar graphs parameterized complexity

来源：评论

学校读者我要写书评

暂无评论

SparseCoder: Identifier-Aware Sparse Transformer for File-Level Code Summarization 31

SparseCoder: Identifier-Aware Sparse Transformer for File-Le...

引用

31st IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024

作者： Wang, Yanlin Huang, Yanxian Guo, Daya Zhang, Hongyu Zheng, Zibin School of Software Engineering Sun Yat-sen University China School of Computer Science and Technology Sun Yat-sen University China School of Big Data and Software Engineering Chongqing University China

ISBN: (纸本)9798350330663

Code summarization aims to generate natural language descriptions of source code, facilitating programmers to understand and maintain it rapidly. While previous code summarization efforts have predominantly focused on method-level, this paper studies file-level code summarization, which can assist programmers in understanding and maintaining large source code projects. Unlike method-level code summarization, file-level code summarization typically involves long source code within a single file, which makes it challenging for Transformer-based models to understand the code semantics for the maximum input length of these models is difficult to set to a large number that can handle long code input well, due to the quadratic scaling of computational complexity with the input sequence length. To address this challenge, we propose SparseCoder, an identifier-aware sparse transformer for effectively handling long code sequences. Specifically, the SparseCoder employs a sliding window mechanism for self-attention to model short-term dependencies and leverages the structure message of code to capture long-term dependencies among source code identifiers by introducing two types of sparse attention patterns named global and identifier attention. To evaluate the performance of SparseCoder, we construct a new dataset FILE-CS for file-level code summarization in Python. Experimental results show that our SparseCoder model achieves state-of-the-art performance compared with other pre-trained models, including full self-attention and sparse models. Additionally, our model has low memory overhead and achieves comparable performance with models using full self-attention mechanism. Furthermore, we verify the generality of SparseCoder on other code understanding tasks, i.e., code clone detection and code search, and results show that our model outperforms baseline models in both tasks, demonstrating that our model can generate better code representations for various downstream tasks. Our

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Labelrepair: Sequence Labelling for Compilation Errors Repair 31

Labelrepair: Sequence Labelling for Compilation Errors Repai...

引用

31st IEEE International Conference on Software Analysis, Evolution and Reengineering, SANER 2024

作者： Wu, Zhenyu Yang, Deheng Lei, Yan Xie, Huan Tang, Minghua Li, Maojin Academy of Military Sciences Beijing China School of Big Data & Software Engineering Chongqing University Chongqing China Peng Cheng Laboratory Shenzhen China Kunming University of Science and Technology Kunming China

ISBN: (纸本)9798350330663

Manual fixing of compilation errors could be a tedious and time-consuming task for novice programmers, and even for experienced ones. In recent years, an increasing number of automated repair techniques have been proposed to guide novice programmers and improve the efficiency of software development. Among them, learning-based automated repair techniques have achieved promising results in terms of repair accuracy. However, existing approaches neglect the time efficiency of patch generation, and often treat the compilation errors repair as a neural machine translation task. The end-to-end repair model decoding cannot be parallelized during the inference stage and suffers from redundant decoding search space. Furthermore, the large search space brought by the model poses a potential risk of semantic tampering. To this end, we propose Labelrepair, a novel repair technique that treats the repair of compilation errors as a sequence labelling task. Labelrepair discards the decoding model and converts the search for patches to a search for the error mapping actions between broken code and patch code pairs. In this way, the search space for patch tokens is plum-meted from the entire vocabulary to the size of edit action labels, and the logical semantics of the original program are preserved to some extent. The time complexity of inference is reduced from O(n) to O (1) owing to the parallel generation of edit action labels. Through a comprehensive evaluation of Labelrepair on two datasets, we demonstrate that Labelrepair is able to generate patches instantly (0.71ms on average), which is 28 times faster than existing end-to-end repair models. Compared with existing edit-based repair models, Labelrepair achieves the state-of-art repair accuracy. © 2024 IEEE.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Optimization of Performance Models for Interlayer Meltblown Nonwovens with Random Forest 2

Optimization of Performance Models for Interlayer Meltblown ...

引用

2nd International Conference on Health big data and Intelligent Healthcare, ICHIH 2023

作者： Wang, Pengjie Li, Ya Liang, Yuheng Zhu, Xiaolin Li, Tongfei Lv, Wei Alibaba Cloud College of Big Data Application Zhuhai College of Science and Technology Zhuhai China YGSOFT INC. Information Technology Application Innovation Platform Department Zhuhai China

ISBN: (纸本)9798350309324

In the context of rapid societal and technological advancements, there has been a pronounced elevation in public health awareness. Among various protective measures, meltblown nonwoven materials have emerged as an indispensable component in protective masks, offering a crucial respiratory barrier for users. This study endeavors to provide an in-depth examination of this pivotal material. By systematically analyzing extensive datasets of meltblown fabric manufacturing processes and taking into account key parameters such as receiving distance, air velocity, and material thickness, this paper, grounded on historical production parameters, harnesses advanced machine learning techniques to meticulously design and optimize the performance control model for interlayer melt-blown nonwoven materials. The central aim of this research is to further enhance the efficacy of this material in health protection applications. © 2023 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Fine-Tuned BERT Model for Hate Speech Detection in Political Discourse

Fine-Tuned BERT Model for Hate Speech Detection in Political...

引用

International Conference on ICT and Knowledge Engineering

作者： Steve Nwaiwu Nipat Jongsawat Anucha Tungkasthan Jarinya Thaloey Data and Information Science Faculty of Science and Technology RMUTT Pathum Thani Thailand Big Data Analytics and Management Faculty of Science and Technology RMUTT Pathum Thani Thailand

ISBN: (数字)9798350391435

ISBN: (纸本)9798350391442

This research tackles the challenge of detecting hate speech and offensive content in political discussions on social media. By employing natural language processing (NLP) techniques, the study aims to contribute to creating healthier online communities. The researchers started with a manually labeled dataset of Reddit comments centered on political discourse. To address the common issue of class imbalance in classification tasks, they used an oversampling strategy to ensure equal representation of each class. Additionally, they applied data augmentation, specifically synonym replacement, to increase the diversity of the training data, which helps improve the model's generalization. For text preprocessing, the Bidirectional Encoder Represen- tations from Transformers (BERT) tokenizer was used. This tokenizer converts text into subwords, which is especially useful for handling out-of-vocabulary terms. The model used in this study is a fine-tuned version of BERT base, trained with specific hyperparameters: a learning rate of 5e-5, a batch size of 24, and a weight decay of 0.01. Training was carried out over seven epochs using the Hugging Face Transformers library and NVIDIA Tesla P100 GPUs available on Kaggle. The model's performance was assessed using 5-fold cross- validation, resulting in impressive metrics: an average accuracy of 99.34 percent, precision of 99.36 percent, recall of 99.34 percent, F1-score of 99.34 percent, and an ROC-AUC score of 99.96 percent. These results highlight the model's effectiveness in identifying hate speech and offensive content across different data splits. Compared to earlier research, this approach shows significant improvement in performance metrics. It demonstrates the potential of combining BERT with data augmentation and oversampling techniques for detecting hate speech in political discourse on Reddit. This study lays the groundwork for future research into real-time detection systems and cross-lingual models.

关键词： Analytical models Social networking (online) Hate speech Training data Bidirectional control Transformers data augmentation Encoding Natural language processing data models

来源：评论

学校读者我要写书评

暂无评论

Magnificent Frigatebird Optimization: A New Bio-Inspired Metaheuristic Approach for Solving Optimization Problems

引用

Computers, Materials & Continua 2024年第8期80卷 2721-2741页

作者： Tareq Hamadneh Khalid Kaabneh Ibraheem AbuFalahah Gulnara Bektemyssova Galymzhan Shaikemelev Dauren Umutkulov Sayan Omarov Zeinab Monrazeri Frank Werner Mohammad Dehghani Department of Mathematics Al Zaytoonah University of JordanAmman11733Jordan Faculty of Information Technology Al-Ahliyya Amman UniversityAmman19328Jordan Department of Mathematics Faculty of ScienceThe Hashemite UniversityP.O.Box 330127Zarqa13133Jordan Department of Computer Engineering International Information Technology UniversityAlmaty050000Kazakhstan Department of Big Data Analytics and Data Science Software Development Company《QazCode》Almaty050063Kazakhstan Department of Electrical and Electronics Engineering Shiraz University of TechnologyShiraz***Iran Faculty of Mathematics Otto-von-Guericke UniversityP.O.Box 4120Magdeburg39016Germany

This paper introduces a groundbreaking metaheuristic algorithm named Magnificent Frigatebird Optimization(MFO),inspired by the unique behaviors observed in magnificent frigatebirds in their natural *** foundation of MFO is based on the kleptoparasitic behavior of these birds,where they steal prey from other *** this process,a magnificent frigatebird targets a food-carrying seabird,aggressively pecking at it until the seabird drops its *** frigatebird then swiftly dives to capture the abandoned prey before it falls into the *** theoretical framework of MFO is thoroughly detailed and mathematically represented,mimicking the frigatebird’s kleptoparasitic behavior in two distinct phases:exploration and *** the exploration phase,the algorithm searches for new potential solutions across a broad area,akin to the frigatebird scouting for vulnerable *** the exploitation phase,the algorithm fine-tunes the solutions,similar to the frigatebird focusing on a single target to secure its *** evaluate MFO’s performance,the algorithm is tested on twenty-three standard benchmark functions,including unimodal,high-dimensional multimodal,and fixed-dimensional multimodal *** results from these evaluations highlight MFO’s proficiency in balancing exploration and exploitation throughout the optimization *** studies with twelve well-known metaheuristic algo-rithms demonstrate that MFO consistently achieves superior optimization results,outperforming its competitors across various *** addition,the implementation of MFO on four engineering design problems shows the effectiveness of the proposed approach in handling real-world applications,thereby validating its practical utility and robustness.

关键词： Optimization metaheuristic magnificent frigatebirds exploration exploitation

来源：评论

学校读者我要写书评

暂无评论

Research on Instance Segmentation of High-Resolution Remote Sensing Images 7

Research on Instance Segmentation of High-Resolution Remote ...

引用

7th Asian Conference on Artificial Intelligence technology, ACAIT 2023

作者： Zhang, Xiaoying Yang, Houqun Li, Xuanyu Yang, Dangui Shen, Jie Xu, Gaodi Hainan University College of Computer Science And Technology Hainan Haikou China Hainan University Haikou Key Laboratory of Deep Learning And Big Data Application Technology Hainan Haikou China

ISBN: (纸本)9798350359145

Increasingly, high-resolution remote sensing images are being used in real life as a result of the continuous advancement of high-definition remote sensing imaging technology in recent years. They play a crucial role in urban planning, agriculture, oceans, ecological protection, and other fields. A growing amount of remote sensing image data has led to a growing interest in using image instance segmentation to decode remote sensing images by automatically extracting valuable information. The present paper examines and analyzes a large number of instance segmentation methods on remote sensing images. It begins with an explanation of the classification and research progress of natural image instance segmentation techniques, which are categorized into two-stage instance segmentation, single-stage instance segmentation, multi-stage instance segmentation and weakly supervised instance segmentation, and also analyzed in terms of their advantages and shortcomings. And then we discussed it in more detail of remote sensing image instance segmentation using deep learning, and it is explained that each of these methods can be classified into three types based on its technical characteristics: methods that combine multiscale feature fusion, methods that combine dilated convolution and methods that combine attention mechanisms, as well as the benefits and limitations of each method. The results of classical experiments on different datasets are presented, along with an explanation of the commonly used datasets and evaluation metrics in instance segmentation. This paper presents an overview of the current problems and challenges associated with remote sensing image instance segmentation, as well as future trends and developments. © 2023 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Hash Function Based on Quantum Walks with Two-Step Memory

Hash Function Based on Quantum Walks with Two-Step Memory

引用

2024 International Conference on Computing, Machine Learning and data science, CMLDS 2024

作者： Zhou, Qing Lu, Songfeng Yang, Hao Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Hubei Wuhan China Shenzhen Huazhong University of Science and Technology Research Institute Guangdong Shenzhen China

ISBN: (纸本)9798400716393

We propose a new quantum-walk-based hash function QHF2M by combining two types of quantum walks with two-step memory and numerically test its statistical performance. The test result shows that QHF2M is on a par with the state-of-the-art hash functions based on discrete quantum walks in terms of sensitivity of hash value to message, diffusion and confusion properties, uniform distribution property, and collision resistance property. Moreover, both unequal and equivalent coin angles used by the underlying quantum walks can lead to near-ideal statistical performance. This result indicates that neither using quantum walks with different memory length nor adopting distinct coin angles is a necessary condition for constructing good quantum-walk-with-memory-based hash functions. © 2024 ACM.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

MAQMC:Multi-Agent Deep Q-Network for Multi-Zone Residential HVAC Control

引用

Computer Modeling in Engineering & sciences 2023年第9期136卷 2759-2785页

作者： Zhengkai Ding Qiming Fu Jianping Chen You Lu Hongjie Wu Nengwei Fang Bin Xing School of Electronic and Information Engineering Suzhou University of Science and TechnologySuzhou215009China Jiangsu Province Key Laboratory of Intelligent Building Energy Efficiency Suzhou University of Science and TechnologySuzhou215009China School of Architecture and Urban Planning Suzhou University of Science and TechnologySuzhou215009China Chongqing Industrial Big Data Innovation Center Co. Ltd.Chongqing400707China

The optimization of multi-zone residential heating,ventilation,and air conditioning(HVAC)control is not an easy task due to its complex dynamic thermal model and the uncertainty of occupant-driven cooling *** reinforcement learning(DRL)methods have recently been proposed to address the HVAC control ***,the application of single-agent DRL formulti-zone residential HVAC controlmay lead to non-convergence or slow *** this paper,we propose MAQMC(Multi-Agent deep Q-network for multi-zone residential HVAC Control)to address this challenge with the goal of minimizing energy consumption while maintaining occupants’thermal *** is divided into MAQMC2(MAQMC with two agents:one agent controls the temperature of each zone,and the other agent controls the humidity of each zone)and MAQMC3(MAQMC with three agents:three agents control the temperature and humidity of three zones,respectively).The experimental results showthatMAQMC3 can reduce energy consumption by 6.27%andMAQMC2 by 3.73%compared with the fixed point;compared with the rule-based,MAQMC3 andMAQMC2 respectively can reduce 61.89%and 59.07%comfort *** addition,experiments with different regional weather data demonstrate that the well-trained MAQMC RL agents have the robustness and adaptability to unknown environments.

关键词： Deep reinforcement learning multi-zone residential HVAC multi-agent energy conservation comfort

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：