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

19th IEEE International Conference on e-Business engineering, ICEBE 2023

作者： Qin, Zhuorui Wu, Xiaoqian Zheng, Yimin Wu, Qingyao South China University of Technology School of Software Engineering Guangzhou China Key Laboratory of Big Data and Intelligent Robot Ministry of Education China Shenzhen Bangqi Technology Intelligent Development Co. Ltd Shenzhen China Pazhou Lab Guangzhou China

ISBN: (纸本)9798350325553

Driven by the latest advances in industrial artificial intelligence, automatic guided vehicles (AGVs) have been widely used for material handling in flexible workshops. In the pursuit of agile and flexible production transportation planning, the ability to handle unpredictable and dynamic events is becoming increasingly important. In order to achieve this real-time dynamic control, this study proposes a distributed multi-agent architecture to solve the dynamic Multi-AGVs scheduling problem. Double Deep Q-Network algorithm is used to train the scheduling agent, capture the relationship between production transportation operation information and scheduling goals, and make real-time scheduling decisions for flexible jobs with constant arrival intervals. Specialized state, action, and reward representations are proposed to handle variable specifications of dynamic scheduling problems. The performance of this method under different scene scales was verified through simulation studies. Numerical results show that compared with existing traditional heuristic scheduling strategies, this method not only has superior performance, but also its advantages persist even if the manufacturing system job scale changes. © 2023 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

arXiv

引用

arXiv 2025年

作者： Bi, Zhangqian Wan, Yao Chu, Zhaoyang Hu, Yufei Zhang, Junyi Zhang, Hongyu Xu, Guandong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is computationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks. © 2025, CC BY-NC-SA.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Multi-Dimensional Training Optimization for Efficient Federated Synergy Learning

引用

IEEE Transactions on Mobile Computing 2025年

作者： Fu, Shucun Dong, Fang Chen, Runze Shen, Dian Zhang, Jinghui He, Qiang Southeast University School of Computer Science and Engineering Nanjing China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan China

Edge learning (EL) is an end-to-edge collaborative learning paradigm enabling devices to participate in model training and data analysis, opening countless opportunities for edge intelligence. As a promising EL framework, federated synergy learning (FSyL) mitigates the computation and communication overhead on resource-constrained devices by offloading partial model layers to the edge server for synergistic training. Nevertheless, due to the system and statistical heterogeneity, naively using existing FSyL methods is significantly time-consuming and causes accuracy degradation. Motivated by this issue, this paper introduces a novel FSyL framework that integrates multi-dimensional training optimization and formulates the edge learning cost minimization (ELCM) problem. To tackle the ELCM efficiently, we design OL-MG, an OnLine Model Splitting and Resource Provisioning Game. Specifically, we first reformulate and decompose the original ELCM based on data quality evaluation. Then, given a model splitting decision, we determine the optimal resource provisioning in Sub-problem1, based on which optimal model splitting in Sub-problem2 is modeled as a potential game. Subsequently, we introduce a decentralized algorithm to find a Nash equilibrium (NE) solution. Furthermore, we further extend OL-MG to support a budget-aware multi-edge scenario. Extensive experiments demonstrate that the proposed mechanism significantly outperforms state-of-the-art methods in cost-saving and accuracy improvement. © 2025 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

How to Select Pre-Trained Code Models for Reuse? A Learning ...

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Zhangqian Bi Yao Wan Zhaoyang Chu Yufei Hu Junyi Zhang Hongyu Zhang Guandong Xu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

ISBN: (数字)9798331535100

ISBN: (纸本)9798331535117

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is compu-tationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks.

关键词： Phase change materials Analytical models Adaptation models Codes Costs Computational modeling Training data Machine learning Software Software development management

来源：评论

学校读者我要写书评

暂无评论

Application of Diffusion Artificial Hummingbird Algorithm for Multimodal Transportation Logistics Distribution Routing Problem

Application of Diffusion Artificial Hummingbird Algorithm fo...

引用

2023 China Automation Congress, CAC 2023

作者： Yang, Fan Yue, Lei Zhang, Xu Yto Express Co. Ltd. Shanghai China Post Industry Technology Research and Development Center of State Posts Bureau Post Big Data Technology and Application Engineering Research Center of Jiangsu Province Nanjing University of Posts and Telecommunications Nanjing China Anhui Yougu Express Intelligent Technology Co. Ltd Wuhu China

ISBN: (纸本)9798350303759

With the rapid development of e-commerce and the logistics industry, logistics transportation networks based on different modes of transport have gradually become increasingly complex. Currently, the multimodal transportation logistics distribution routing problem, which is considered a complex vehicle routing problem, has gained significant attention. Therefore, the selection of appropriate routes plays a crucial role in enhancing the economic efficiency and rationality of logistics planning. In order to obtain optimal routes, this paper proposes an improved diffusion artificial hummingbird algorithm based on the hummingbird swarm diffusion flight strategy. This algorithm improves the population initialization method to cover the solution space as comprehensively as possible. In addition, a migration diffusion strategy is proposed, by spreading the worst solution to the outer area of the population to find the optimal solution, thereby improving the global search capability of the algorithm. In order to verify the convergence performance of the algorithm, this paper conducts comparative tests with multiple algorithms, effectively verifying the high accuracy and fast convergence performance of the DAHA algorithm. Applying it to the multimodal logistics distribution path problem can effectively avoid excessively slow convergence speed and The disadvantage of low convergence accuracy. Finally, the feasibility and effectiveness of the algorithm are verified through experiments. © 2023 IEEE.

关键词： Diffusion

来源：评论

学校读者我要写书评

暂无评论

Character-Level Street View Text Spotting Based on Deep Multisegmentation Network for Smarter Autonomous Driving

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2022年第2期3卷 297-308页

作者： Zhang, Chongsheng Tao, Yuefeng Du, Kai Ding, Weiping Wang, Bin Liu, Ji Wang, Wei Henan Provincial Key Laboratory of Big Data Analysis and Processing Laboratory of the Yellow River Cultural Heritage Henan University Kaifeng475001 China School of Information Science and Technology Nantong University Nantong226019 China School of Electrical Engineering Zhejiang University Hangzhou310058 China Big Data Lab Baidu Inc. Beijing100044 China School of Computer and Information Technology Beijing Jiaotong University Beijing100044 China

Urban scenes are full of street entities with sign boards. Therefore, in autonomous driving, street view text spotting techniques will play a significant role in the precise understanding of surrounding scenes during driving, because texts contained in the images usually provide important clues for accurate image understanding, while it is often ambiguous for existing computer vision algorithms to understand scene images without texts. In this work, we propose a Multi-Segmentation network for character-level scene Text Detection (MSTD). The MSTD introduces a densely connected atrous spatial pyramid pooling module to enlarge the receptive field of the feature extraction layer, so as to localize long as well as large-sized text instances. Moreover, it devises a double segmentation subnetwork to utilize two independent but inherently complementary losses to co-optimize the network and increase the reliability of the confidence scores in predicting the text/nontext areas. With the character instances detected by the MSTD, one can easily perform scene text spotting with classic object recognition networks such as ResNet and DenseNet. We carried out extensive experiments on nine scene text datasets to demonstrate the outstanding performance of the MSTD on character-level and line-level text instance localization and scene text recognition, where the MSTD significantly outperforms the state-of-the-art scene text detection methods and the sequence-to-sequence-learning-based scene text recognizers. © 2020 IEEE.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

ChestBox: Enabling Fast State Sharing for Stateful Serverless Computing with State Functions

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable Computing 2024年

作者： Zhang, Xinmin Wu, Song Gu, Lin He, Qiang Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan Hubei430074 China

This paper presents ChestBox, a novel approach that utilizes state functions to facilitate low-latency state sharing for stateful serverless computing. When an application function needs to share a state, the state function creates a memory space with Linux's shared memory object to store the state. Other application functions can then read the state directly from the shared memory. ChestBox enables fast state sharing that avoids excessive memory overhead without compromising on-demand resource allocation compared to existing solutions. This effectively reduces the energy consumption of serverless computing and promotes sustainable computing. The implementation of ChestBox on Apache OpenWhisk unearths two major implementation challenges, which we address with respective optimization techniques, i.e., state function channel and state swapping. The evaluation of ChestBox with four real-world applications shows that compared with the state-of-The-Art approach, it can reduce state-sharing latency by up to 99.71%, while reducing execution costs by 24.59% and storage costs by 99.76%. © 2016 IEEE.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

Semantic-Reconstructed Graph Transformer Network for Event Detection

Semantic-Reconstructed Graph Transformer Network for Event D...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zhuochun Miao Xingrui Zhuo Gongqing Wu Chenyang Bu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Anhui China

Event detection (ED) is a key subtask of information extraction to extract key events, such as stock rise and fall and social public opinion, from news or social media. Although current GCN-based event detection methods achieve remarkable success via building graphs with dependency trees, they typically suffer from two challenges: 1) They use sequence models to learn contextual information of sentences, ignoring the longterm dependencies problem of sequence models might learn ineffective information and make it propagate in GCN layers. 2) Most methods do not exploit global dependency label information and grammatical structure information that convey rich linguistic knowledge directly, and only consider local dependency label information. To cope with these challenges, we propose a novel event detection model via semantic-reconstructed graph transformer networks (SRGTNED), which incorporates semantic reconstruction and path information collection methods. Using the semantic reconstruction method, we assign a pruned sequence to each word based on the path information to capture contextual information consistent with sentence semantics. Moreover, to better utilize global dependency label information and grammatical structure information, a Graph Transformer Network (GTN)-based heterogeneous graph embedding framework is introduced to automatically learn path information between important words by converting sentences as heterogeneous graphs. We conduct experiments on the ACE2005 dataset and the Commodity News dataset, and the experimental results demonstrate that our method significantly outperforms 11 state-of-the-art baselines in terms of the F1-score.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Controller Optimization of an Automated Force Calibration Device Based on an Improved Particle Swarm Algorithm

Controller Optimization of an Automated Force Calibration De...

引用

Sensors and Information technology (ICSI), International Conference on

作者： Jiming Jiang Xiang Dong Qiang Li Huibin Cao School of Electrical Engineering and Automation Anhui University Hefei China Department of Computer Science and Technology College of Big Data and Internet Shenzhen Technology University Shenzhen China Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei Anhui China

ISBN: (数字)9798331542887

ISBN: (纸本)9798331542894

This paper presents a PID controller optimization method based on an Improved Particle Swarm Optimization (IPSO) algorithm, aimed at enhancing the design and performance of automated force calibration devices. Traditional force calibration systems often suffer from limitations in automation and force application accuracy, which this method seeks to address. The IPSO algorithm incorporates logistic chaotic mapping to initialize particle positions and enhances the standard particle swarm algorithm through nonlinear decreasing weights and adaptive learning factors, resulting in improved global search capabilities and faster local convergence. Additionally, the objective function is refined by normalizing and weighting the integral of time-multiplied absolute error (ITAE) and the overshoot, thereby further enhancing the force application accuracy of the PID controller. Simulation results demonstrate that the IPSO algorithm offers significant advantages in terms of settling time, overshoot, and ITAE error when compared to traditional PID tuning methods (e.g., Ziegler-Nichols) and other optimization algorithms (e.g., GA, GWO). Experimental results validate the effectiveness and practicality of the IPSO algorithm, providing an efficient solution for the automation and high-precision control of force sensor calibration systems.

关键词： Performance evaluation Accuracy Automation Force Optimization methods Systems modeling Calibration Particle swarm optimization Tuning Standards

来源：评论

学校读者我要写书评

暂无评论

Multivariate Time Series Classification via Hierarchical Graph Embedding

Multivariate Time Series Classification via Hierarchical Gra...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Wenhao Niu Xingrui Zhuo Gongqing Wu JunWei Lv Zan Zhang Chenyang Bu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Anhui China

Multivariate time series classification aims to determine the labels for multivariate time series samples. Although variable interaction relationships and sample similarity relationships exist in multivariate time series, the available related methods usually ignore the rich relationships and are ineffective in exploiting these. To solve this problem, we propose a Hierarchical Graph Embedding for Multivariate Time Series Classification (MTSC-HGE), which consists of a variable-wise attentive graph pooling module and a sample-wise graph convolutional module to obtain the relationships of variables and samples. Specifically, we design an attentive graph pooling module based on self-attention, which can obtain sample features fusing temporal patterns and variable interaction relationships in samples. Furthermore, we propose a graph mapping criterion that converts the MTS dataset into a graph based on dynamic time warping to explicitly reflect the similarity relationships between samples. To capture latent sample relationships, a GCN module is utilized on the sample graph to integrate sample features obtained from the attentive graph pool module. In addition, a classifier takes the rich representation output by the model to get the final predicted class. Extensive experiments on 14 public datasets show that MTSC-HGE significantly outperforms state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：