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

Evolutionary Trainer-Based Deep Q-Network for Dynamic Flexible Job Shop Scheduling

IEEE Transactions on Evolutionary Computation 2024年第3期29卷 1-1页

作者： Liu, Yun Zhang, Fangfang Sun, Yanan Zhang, Mengjie College of Computer Science Sichuan University Chengdu PR China Center for Data Science and Artificial Intelligence and School of Engineering and Computer Science Victoria University of Wellington Wellington New Zealand

Dynamic flexible job shop scheduling (DFJSS) aims to achieve the optimal efficiency for production planning in the face of dynamic events. In practice, deep Q-network (DQN) algorithms have been intensively studied for solving various DFJSS problems. However, these algorithms often cause moving targets for the given job-shop state. This will inevitably lead to unstable training and severe deterioration of the performance. In this paper, we propose a training algorithm based on genetic algorithm to efficiently and effectively address this critical issue. Specifically, a state feature extraction method is first developed, which can effectively represent different job shop scenarios. Furthermore, a genetic encoding strategy is designed, which can reduce the encoding length to enhance search ability. In addition, an evaluation strategy is proposed to calculate a fixed target for each job-shop state, which can avoid the parameter update of target networks. With the designs, the DQNs could be stably trained, thus their performance is greatly improved. Extensive experiments demonstrate that the proposed algorithm outperforms the state-of-the-art peer competitors in terms of both effectiveness and generalizability to multiple scheduling scenarios with different scales. In addition, the ablation study also reveals that the proposed algorithm can outperform the DQN algorithms with different updating frequencies of target networks. IEEE

关键词： Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Dimensional-noise-aware battery lifetime prediction via an EM-TLS framework

引用

Progress in Natural science:Materials International 2025年第1期35卷 146-155页

作者： Chenlong Yu Ting Lu Guohua Liu Xiaoang Zhai Wuyan Deng Jiayu Wan Yang Liu Xin Li School of Computer Science and Technology Donghua University Future Battery Research Center Global Institute of Future Technology Shanghai Jiaotong University Data Science Research Center Duke Kunshan University

Machine learning has been massively utilized to construct data-driven solutions for predicting the lifetime of rechargeable batteries in recent years, which project the physical measurements obtained during the early charging/discharging cycles to the remaining useful lifetime. While most existing techniques train the prediction model through minimizing the prediction error only, the errors associated with the physical measurements can also induce negative impact to the prediction accuracy. Although total-least-squares(TLS) regression has been applied to address this issue, it relies on the unrealistic assumption that the distributions of measurement errors on all input variables are equivalent, and cannot appropriately capture the practical characteristics of battery degradation. In order to tackle this challenge, this work intends to model the variations along different input dimensions, thereby improving the accuracy and robustness of battery lifetime prediction. In specific, we propose an innovative EM-TLS framework that enhances the TLS-based prediction to accommodate dimension-variate errors, while simultaneously investigating the distributions of them using expectation-maximization(EM). Experiments have been conducted to validate the proposed method based on the data of commercial Lithium-Ion batteries, where it reduces the prediction error by up to 29.9 % compared with conventional TLS. This demonstrates the immense potential of the proposed method for advancing the R&D of rechargeable batteries.

关键词： Battery lifetime prediction Dimension-variate measurement error Energy storage Expectation-maximization Total-least-squares regression

来源：评论

学校读者我要写书评

暂无评论

Accurate and efficient floor localization with scalable spiking graph neural networks

引用

Satellite Navigation 2024年第1期5卷 191-206页

作者： Fuqiang Gu Fangming Guo Fangwen Yu Xianlei Long Chao Chen Kai Liu Xuke Hu Jianga Shang Songtao Guo College of Computer Science Chongqing UniversityChongqingChina Department of Precision Instrument Tsinghua UniversityBeijingChina Institute of Data Science German Aerospace Center(DLR)JenaGermany School of Computer Science China University of GeosciencesWuhanChina

Floor localization is crucial for various applications such as emergency response and rescue,indoor positioning,and recommender *** existing floor localization systems have many drawbacks,like low accuracy,poor scalability,and high computational *** this paper,we first frame the problem of floor localization as one of learning node embeddings to predict the floor label of a ***,we introduce FloorLocator,a deep learning-based method for floor localization that integrates efficient spiking neural networks with powerful graph neural *** approach offers high accuracy,easy scalability to new buildings,and computational *** results on using several public datasets demonstrate that FloorLocator outperforms state-of-the-art ***,in building B0,FloorLocator achieved recognition accuracy of 95.9%,exceeding state-of-the-art methods by at least 10%.In building B1,it reached an accuracy of 82.1%,surpassing the latest methods by at least 4%.These results indicate FloorLocator’s superiority in multi-floor building environment localization.

关键词： Indoor positioning Deep learning Floor localization Spiking neural networks Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

CBIR: a novel identification approach for college students in need based on consumer behavior psychology theory

引用

Neural Computing and Applications 2025年第6期37卷 4663-4677页

作者： Liu, Xinze Liu, Shixi Hu, Xiaojing Zhang, Yudong Fang, Xianwen School of Computer and Information Engineering Chuzhou University Chuzhou239000 China School of Computer Science and Engineering Southeast University Nanjing210096 China School of Mathematics and Big Data Anhui University of Science and Technology Huainan232001 China

The accurate identification of students in need is crucial for governments and colleges to allocate resources more effectively and enhance social equity and educational fairness. Existing approaches to identifying students in need rely on manual operations that include manually extracting consumption behavior information, statistical consumption characteristics and principal component analysis. However, this issue may lead to low prediction accuracy and inefficiency in identifying students in need. We design a three-stage framework to accurately identify college students in need from the perspective of consumer behavior psychology. The consumption behavior information is first obtained from the student consumption records using the consumption behavior clustering approach. The consumption behavior matrix is then built by extracting consumption and spatiotemporal information in different periods. Finally, a novel consumption behavior identification ResNeSt (CBIR) model is proposed to identify college students in need accurately. The experimental results on real datasets show that the CBIR model has higher prediction accuracy than the baseline models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Social psychology

来源：评论

学校读者我要写书评

暂无评论

Diluie: constructing diverse demonstrations of in-context learning with large language model for unified information extraction

引用

Neural Computing and Applications 2024年第22期36卷 13491-13512页

作者： Guo, Qian Guo, Yi Zhao, Jin Department of Computer Science and Engineering East China University of Science and Technology Shanghai200237 China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University Shanghai200433 China

Large language models (LLMs) have demonstrated promising in-context learning capabilities, especially with instructive prompts. However, recent studies have shown that existing large models still face challenges in specific information extraction (IE) tasks. Moreover, it could have more effectively utilized various prompts such as instruction tuning, diverse demonstrations of in-context learning, and long-range token sequences for assisting language modeling in understanding context. In this study, we propose DILUIE, a unified information extraction framework based on in-context learning with diverse demonstration examples. DILUIE is encoded with an EVA attention mechanism and incremental encoding technology. Based on the constructed diverse demonstrations, we expand the size of instances efficiently in both instruction tuning and in-context learning to gain insights into the potential benefits of utilizing diverse information extraction datasets. To deepen the understanding of context, we further design three auxiliary tasks to assist in aligning contextual semantics. Experimental results demonstrate that DILUIE achieves 2.23 and 2.53% improvements in terms of Micor-/Macor-F1 on average relative to the current state-of-the-art baseline, which also significantly outperforms the GPT-3.5-turbo in zero-shot settings, and the average token length of achieving the best performance over tasks is around 15k. Furthermore, we observe that in-context learning shows enhanced performance when provided with more demonstrations during multiple-shot instruction tuning (8 k). Additionally, increasing the length of instructions (10 k) can result in a more substantial improvement in the upper limits of scaling for in-context learning. Code is available on https://***/Phevos75/DILUIE. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Demonstrations

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Domain Adaptation on Point Clouds via High-Order Geometric Structure Modeling

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第12期5卷 6121-6133页

作者： Cheng, Jiang-Xing Lin, Huibin Zhang, Chun-Yang Chen, C. L. Philip Fuzhou University College of Computer and Data Science Fuzhou350108 China South China University of Technology School of Computer Science and Engineering Guangdong Guangzhou510006 China

Point clouds can capture the precise geometric information of objects and scenes, which are an important source of 3-D data and one of the most popular 3-D geometric data structures for cognitions in many real-world applications like automatic driving and remote sensing. However, due to the influence of sensors and varieties of objects, the point clouds obtained by different devices may suffer obvious geometric changes, resulting in domain gaps that are prone to the neural networks trained in one domain failing to preserve the performance in other domains. To alleviate the above problem, this article proposes an unsupervised domain adaptation framework, named HO-GSM, as the first attempt to model high-order geometric structures of point clouds. First, we construct multiple self-supervised tasks to learn the invariant semantic and geometric features of the source and target domains, especially to capture the feature invariance of high-order geometric structures of point clouds. Second, the discriminative feature space of target domain is acquired by using contrastive learning to refine domain alignment to specific class level. Experiments on the PointDA-10 and GraspNetPC-10 collection of datasets show that the proposed HO-GSM can significantly outperform the state-of-the-art counterparts. © 2020 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Towards High-Performance Graph Processing: From a Hardware/Software Co-Design Perspective

引用

Journal of computer science & Technology 2024年第2期39卷 245-266页

作者：廖小飞赵文举金海姚鹏程黄禹王庆刚赵进郑龙张宇邵志远 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graph processing has been widely used in many scenarios,from scientific computing to artificial *** processing exhibits irregular computational parallelism and random memory accesses,unlike traditional ***,running graph processing workloads on conventional architectures(e.g.,CPUs and GPUs)often shows a significantly low compute-memory ratio with few performance benefits,which can be,in many cases,even slower than a specialized single-thread graph *** domain-specific hardware designs are essential for graph processing,it is still challenging to transform the hardware capability to performance boost without coupled software *** article presents a graph processing ecosystem from hardware to *** start by introducing a series of hardware accelerators as the foundation of this ***,the codesigned parallel graph systems and their distributed techniques are presented to support graph ***,we introduce our efforts on novel graph applications and hardware *** results show that various graph applications can be efficiently accelerated in this graph processing ecosystem.

关键词： graph processing hardware accelerator software system high performance ecosystem

来源：评论

学校读者我要写书评

暂无评论

Knowledge Probabilization in Ensemble Distillation: Improving Accuracy and Uncertainty Quantification for Object Detectors

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第1期6卷 221-233页

作者： Yang, Yang Wang, Chao Gong, Lei Wu, Min Chen, Zhenghua Li, Xiang Chen, Xianglan Zhou, Xuehai University of Science and Technology of China School of Computer Science and Technology Hefei230026 China 138632 Singapore East China Normal University School of Data Science and Engineering Shanghai200062 China

Ensemble object detectors have demonstrated remarkable effectiveness in enhancing prediction accuracy and uncertainty quantification. However, their widespread adoption is hindered by significant computational and storage demands, limiting their feasibility in resource-constrained settings. To overcome this, researchers have focused on distilling the knowledge from ensemble object detectors into a single model. In this article, we introduce probabilization based ensemble distillation (ProbED), an innovative ensemble distillation framework that consolidates knowledge from multiple object detectors into a single, resource-efficient model. Unlike traditional ensemble distillation methods that average the outputs of subteachers, ProbED captures comprehensive outcome distributions from all subteachers, providing a more nuanced approach to knowledge transfer. ProbED employs knowledge probabilization to achieve a sophisticated and refined aggregation of teacher knowledge, including feature knowledge, semantic knowledge, and localization knowledge, resulting in dual improvements in prediction accuracy and uncertainty quantification for the student model. In particular, ProED's novel knowledge probabilization-based approach to aggregating teacher knowledge is inspired by our empirical observations, which demonstrate that knowledge probabilization excels in effectively representing uncertainty, improving prediction, and facilitating robust knowledge transfer. Furthermore, we introduce a random smoothing perturbation technique to modify inputs within ProbED, further enhancing the distillation process. Extensive experiments highlight ProbED's ability to significantly enhance the prediction accuracy and uncertainty quantification of various object detectors, demonstrating its superior performance compared to other state-of-the-art techniques. © 2024 IEEE.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

Weighted Probability Density Estimator with Updated Bandwidths

引用

Journal of Systems science & Complexity 2024年第2期37卷 886-906页

作者： WU Yi YU Wei WANG Xuejun PRAKASA RAO B L S School of Big Data and Artificial Intelligence Chizhou UniversityChizhou 247000China School of Big Data and Statistics Anhui UniversityHefei 230601China CR Rao Advanced Institute of Mathematics Statistics and Computer ScienceHyderabad 500046India

In this paper,the authors study a class of weighted version of probability density *** is shown that the weighted estimator contains some existing estimators of probability density,no matter they are recursive or *** statistical results including weak consistency,strong consistency,rate of strong consistency,and asymptotic normality are established under some mild ***,the random weighted estimator is also *** numerical simulations and a real data analysis are presented to study the numerical performances of the estimators.

关键词： Asymptotic normality consistency numerical simulation probability density real data analysis updated bandwidths weighted estimator

来源：评论

学校读者我要写书评

暂无评论

Faster Local Solvers for Graph Diffusion Equations 38

Faster Local Solvers for Graph Diffusion Equations

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Bai, Jiahe Zhou, Baojian Yang, Deqing Xiao, Yanghua The School of Data Science Fudan University China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China

Efficient computation of graph diffusion equations (GDEs), such as Personalized PageRank, Katz centrality, and the Heat kernel, is crucial for clustering, training neural networks, and many other graph-related problems. Standard iterative methods require accessing the whole graph per iteration, making them time-consuming for large-scale graphs. While existing local solvers approximate diffusion vectors through heuristic local updates, they often operate sequentially and are typically designed for specific diffusion types, limiting their applicability. Given that diffusion vectors are highly localizable, as measured by the participation ratio, this paper introduces a novel framework for approximately solving GDEs using a local diffusion process. This framework reveals the suboptimality of existing local solvers. Furthermore, our approach effectively localizes standard iterative solvers by designing simple and provably sublinear time algorithms. These new local solvers are highly parallelizable, making them well-suited for implementation on GPUs. We demonstrate the effectiveness of our framework in quickly obtaining approximate diffusion vectors, achieving up to a hundred-fold speed improvement, and its applicability to large-scale dynamic graphs. Our framework could also facilitate more efficient local message-passing mechanisms for GNNs. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：