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

Branch-and-cut-and-price for agile earth observation satellite scheduling

European Journal of Operational Research 2025年

作者： Peng, Guansheng Wang, Jianjiang Song, Guopeng Gunawan, Aldy Xing, Lining Vansteenwegen, Pieter School of Advanced Engineering and Great Bay Institute for Advanced Study Great Bay University Dongguan523000 China Defense Innovation Institute Chinese Academy of Military Science Beijing100071 China College of Systems Engineering National University of Defense Technology Changsha410073 China National Key Laboratory of Information Systems Engineering National University of Defense Technology Changsha410073 China School of Computing and Information Systems Singapore Management University Singapore178902 Singapore Research Institute of Intelligent Control and Manufacturing System Jiangsu University of Technology Changzhou213001 China KU Leuven Institute for Mobility - CIB Leuven3001 Belgium

The Agile Earth Observation Satellite scheduling selects and sequences satellite observations of possible targets on the Earth's surface, each with a specific profit and multiple time windows. The objective is to maximize the collected profit of all observations completed under some operational constraints. The problem can be modeled as a variant of the Team Orienteering Problem with Time Windows (TOPTW). The key differences with the regular TOPTW are twofold: first, a time-dependent transition time is required for each pair of consecutive observations to adjust the camera's look angles. Second, the time windows of each target vary during different observation cycles, called "orbits". Some targets are invisible during certain orbits. We call this variant the Time-dependent Team Orienteering Problem with Variable Time Windows. In this paper, we present an efficient branch-and-cut-and-price (BCP) algorithm that exploits the problem's characteristics to solve it to optimality. Some algorithmic enhancements have been implemented, such as a Lagrangian bound, an ng-path relaxation, a primal heuristic, and subset-row inequalities. Extensive experiments on different configurations of benchmark instances demonstrate the superior performance of the proposed BCP algorithm and its algorithmic enhancements. Moreover, the primal heuristic yields a high-quality lower bound and outperforms state-of-the-art heuristics. Finally, we adopt our framework to solve the well-known TOPTW, and our algorithm is much faster than state-of-the-art exact algorithms. © 2025 Elsevier B.V.

关键词： Branch and bound method

来源：评论

学校读者我要写书评

暂无评论

Photo-Based Monitoring of Particulate Matter in the Campus: A New Strategy for Student Health

Photo-Based Monitoring of Particulate Matter in the Campus: ...

引用

作者： Yonghui Zhang Ke Gu Zhifang Xia Junfei Qiao Faculty of Information Technology Beijing University of Technology Engineering Research Center of Intelligent Perception and Autonomous Control Ministry of Education Beijing Key Laboratory of Computational Intelligence and Intelligent System State Information Center

It is imperative for the students' future health to ensure the students in good physical levels. Recent years have witnessed the increasingly serious harm to student health caused by the continually growing concentration of Particulate Matters(PMs). Consequently, the task of preventing and controlling PM concentrations in the campus is eagerly required. A welldesigned model for the monitoring of PM(as the basis for PM prevention and control) has posed a big challenge. Prior works have revealed that photo-based methods are available for the monitoring of PM. Towards validating the effectiveness of existing methods for PM monitoring in the campus, we construct a novel dataset that involves 1,500 photos collected in the beijing University of Technology. Results confirm that stated-of-the-art methods are far from ideal for the monitoring of PM in the campus. To solve the aforesaid issue, this paper further proposes a novel photo-based PM monitoring model by using the weighted average method solved by LASSO regression to fuse the above methods' outputs tested to infer the PM values. Results demonstrate the superiority of our proposed model as compared to state-of-theart methods on the large-scale AQPDBJUT dataset.

关键词： LASSO Photo-Based Monitoring of Particulate Matter in the Campus A New Strategy for Student Health

来源：评论

学校读者我要写书评

暂无评论

GSLB: The Graph Structure Learning Benchmark

arXiv

引用

arXiv 2023年

作者： Li, Zhixun Wang, Liang Sun, Xin Luo, Yifan Zhu, Yanqiao Chen, Dingshuo Luo, Yingtao Zhou, Xiangxin Liu, Qiang Wu, Shu Yu, Jeffrey Xu Department of Systems Engineering and Engineering Management The Chinese University of Hong Kong Hong Kong Center for Research on Intelligent Perception Computing State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences China School of Artificial Intelligence University of Chinese Academy of Sciences China Department of Automation University of Science and Technology of China China School of Cyberspace Security Beijing University of Posts and Telecommunications China Department of Computer Science University of California Los Angeles United States Heinz College of Information Systems and Public Policy Machine Learning Department School of Computer Science Carnegie Mellon University United States

Graph Structure Learning (GSL) has recently garnered considerable attention due to its ability to optimize both the parameters of Graph Neural Networks (GNNs) and the computation graph structure simultaneously. Despite the proliferation of GSL methods developed in recent years, there is no standard experimental setting or fair comparison for performance evaluation, which creates a great obstacle to understanding the progress in this field. To fill this gap, we systematically analyze the performance of GSL in different scenarios and develop a comprehensive Graph Structure Learning Benchmark (GSLB) curated from 20 diverse graph datasets and 16 distinct GSL algorithms. Specifically, GSLB systematically investigates the characteristics of GSL in terms of three dimensions: effectiveness, robustness, and complexity. We comprehensively evaluate state-of-the-art GSL algorithms in node- and graph-level tasks, and analyze their performance in robust learning and model complexity. Further, to facilitate reproducible research, we have developed an easy-to-use library for training, evaluating, and visualizing different GSL methods. Empirical results of our extensive experiments demonstrate the ability of GSL and reveal its potential benefits on various downstream tasks, offering insights and opportunities for future research. The code of GSLB is available at: https://***/GSL-Benchmark/GSLB. © 2023, CC BY.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Weight-based Channel-model Matrix Framework provides a reasonable solution for EEG-based cross-dataset emotion recognition

arXiv

引用

arXiv 2022年

作者： Chen, Huayu He, Huanhuan Zhu, Jing Sun, Shuting Li, Jianxiu Shao, Xuexiao Li, Junxiang Li, Xiaowei Hu, Bin Gansu Provincial Key Laboratory of Wearable Computing School of Information Science and Engineering Lanzhou University Lanzhou China Brain Health Engineering Laboratory School of Medical Technology Beijing Institute of Technology Beijing China School of Information Science and Engineering Inner Mongolia University Inner Mongolia China Shandong Academy of Intelligent Computing Technology Jinan China Chinese Academy of Sciences Center for Excellence in Brain Science and Intelligence Technology Shanghai Institutes for Biological Sciences Chinese Academy of Sciences Shanghai China Joint Research Center for Cognitive Neurosensor Technology of Lanzhou University Institute of Semiconductors Chinese Academy of Sciences Lanzhou China Open Source Software and Real-Time System Lanzhou University Ministry of Education Lanzhou China

Cross-dataset emotion recognition as an extremely challenging task in the field of EEG-based affective computing is influenced by many factors, which makes the universal models yield unsatisfactory results. Facing the situation that lacks EEG information decoding research, we first analyzed the impact of different EEG information(individual, session, emotion and trial) for emotion recognition by sample space visualization, sample aggregation phenomena quantification, and energy pattern analysis on five public datasets. Based on these phenomena and patterns, we provided the processing methods and interpretable work of various EEG differences. Through the analysis of emotional feature distribution patterns, the Individual Emotional Feature Distribution Difference(IEFDD) was found, which was also considered as the main factor of the stability for emotion recognition. After analyzing the limitations of traditional modeling approach suffering from IEFDD, the Weight-based Channel-model Matrix Framework(WCMF) was proposed. To reasonably characterize emotional feature distribution patterns, four weight extraction methods were designed, and the optimal was the correction T-test(CT) weight extraction method. Finally, the performance of WCMF was validated on cross-dataset tasks in two kinds of experiments that simulated different practical scenarios, and the results showed that WCMF had more stable and better emotion recognition ability. Copyright © 2022, The Authors. All rights reserved.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Improved Adaptive Critic for Neural Optimal Control of Constrained Nonlinear Discrete-Time systems

Improved Adaptive Critic for Neural Optimal Control of Const...

引用

第三十九届中国控制会议

作者： Mingming Zhao Ding Wang Mingming Ha Faculty of Information Technology Beijing University of Technology Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing University of Technology School of Automation and Electrical Engineering University of Science and Technology Beijing

There always exist approximation errors during neural network control processes, which may cause the estimation value to exceed the control constraint when the optimal control input reaches to a neighborhood of the constraint. In this paper,through a new neural network training approach, the near-optimal control problem for a class of nonlinear discrete-time systems with control constraints is solved. Based on the nonquadratic performance index and the dual heuristic dynamic programming scheme, the iterative algorithm is developed with convergence guarantee and is also implemented by using three neural *** last, two examples are given to demonstrate the effectiveness of the proposed optimal control scheme.

关键词： Adaptive dynamic programming iterative adaptive critic control constraints neural networks nonlinear discrete-time systems

来源：评论

学校读者我要写书评

暂无评论

Training-free image style alignment for self-adapting domain shift on handheld ultrasound devices

arXiv

引用

arXiv 2024年

作者： Zeng, Hongye Zou, Ke Chen, Zhihao Gao, Yuchong Chen, Hongbo Zhang, Haibin Zhou, Kang Wang, Meng Goh, Rick Siow Mong Liu, Yong Jiang, Chang Zheng, Rui Fu, Huazhu School of Information Science and Technology ShanghaiTech University Shanghai China Shanghai Advanced Research Institute Chinese Academy of Sciences Shanghai China University of Chinese Academy of Sciences Beijing China National Key Laboratory of Fundamental Science on Synthetic Vision College of Computer Science Sichuan University Chengdu China College of Intelligence and Computing Tianjin University Tianjin China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Beth Israel Deaconess Medical Center Harvard Medical School Boston United States Institute of High Performance Computing Agency for Science Technology and Research Singapore Singapore Department of Orthopedics Zhongshan Hospital Fudan University Shanghai China Shanghai Engineering Research Center of Intelligent Vision and Imaging Shanghai China

Handheld ultrasound devices face usage limitations due to user inexperience and cannot benefit from supervised deep learning without extensive expert annotations. Moreover, the models trained on standard ultrasound device data are constrained by training data distribution and perform poorly when directly applied to handheld device data. In this study, we propose the Training-free Image Style Alignment (TISA) framework to align the style of handheld device data to those of standard devices. The proposed TISA can directly infer handheld device images without extra training and is suited for clinical applications. We show that TISA performs better and more stably in medical detection and segmentation tasks for handheld device data. We further validate TISA as the clinical model for automatic measurements of spinal curvature and carotid intima-media thickness. The automatic measurements agree well with manual measurements made by human experts and the measurement errors remain within clinically acceptable ranges. We demonstrate the potential for TISA to facilitate automatic diagnosis on handheld ultrasound devices and expedite their eventual widespread use. © 2024, CC BY-NC-SA.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Research and Implementation of Complex Task Based on DMP

Research and Implementation of Complex Task Based on DMP

引用

IEEE Joint International Information Technology and Artificial intelligence Conference (ITAIC)

作者： Jie Jia Yucan Wang Guoyu Zuo Yilin Cao Naigong Yu Faculty of Information Technology Beijing University of Technology Beijing China Beijing Key Laboratory of Computational Intelligence and Intelligent System Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing

ISBN: (数字)9781728152448

ISBN: (纸本)9781728152455

Aiming at the problem of poor task versatility in the strategy learning of complex tasks and cannot be generalized to obstacle environments, a method for robots learning from demonstration based on Dynamic Movement Primitive (DMP) is proposed. This method divides the demonstration task into several subtasks, and uses DMP to model each subtask. We utilize the local weighted regression algorithm to learn the corresponding weight of each subtask. Then the task trajectory is obtained by sequentially combining the generated subtask trajectory. The obstacle avoidance coupling item is added to the DMP framework to generate the obstacle avoidance task trajectory. The UR5 robotic arm is used to perform grasp and place tasks on the simulation platform as a demonstration task to verify the method in this article.

关键词： Couplings Dynamics Reinforcement learning Robot learning Trajectory Task analysis Collision avoidance

来源：评论

学校读者我要写书评

暂无评论

Complex Knowledge Base Question Answering: A Survey

arXiv

引用

arXiv 2021年

作者： Lan, Yunshi He, Gaole Jiang, Jinhao Jiang, Jing Zhao, Wayne Xin Wen, Ji-Rong School of Data Science and Engineering East China Normal University China School of Computing and Information System Singapore Management University Singapore The School of Information Renmin University of China Beijing Key Laboratory of Big Data Management and Analysis Methods China Gaoling School of Artificial Intelligence Renmin University of China China Beijing Key Laboratory of Big Data Management and Analysis Methods China

Knowledge base question answering (KBQA) aims to answer a question over a knowledge base (KB). Early studies mainly focused on answering simple questions over KBs and achieved great success. However, their performance on complex questions are still far from satisfaction. Therefore, in recent years, researchers propose a large number of novel methods, which looked into the challenges of answering complex questions. In this survey, we review recent advances on KBQA with the focus on solving complex questions, which usually contain multiple subjects, express compound relations, or involve numerical operations. In detail, we begin with introducing the complex KBQA task and relevant background. Then, we present two mainstream categories of methods for complex KBQA, namely semantic parsing-based (SP-based) methods and information retrieval-based (IR-based) methods. Specifically, we illustrate their procedures with flow designs and discuss their difference and similarity. Next, we summarize the challenges that these two categories of methods encounter when answering complex questions, and explicate advanced solutions as well as techniques used in existing work. After that, we discuss the potential impact of pre-trained language models (PLMs) on complex KBQA. To help readers catch up with SOTA methods, we also provide a comprehensive evaluation and resource about complex KBQA task. Finally, we conclude and discuss several promising directions related to complex KBQA for future research. Copyright © 2021, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Feedback-based Print Quality Improving Strategy for FDM 3D Printing: An Optimal Design Approach

Research Square

引用

Research Square 2021年

作者： Tami, Tariku Sinshaw Xiong, Gang Fang, Qihang Dong, Xisong Shen, Zhen Wang, Fei-Yue The State Key Laboratory for Management and Control of Complex Systems Beijing Engineering Research Center of Intelligent Systems and Technology Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China Guangdong Engineering Research Center of 3D Printing and Intelligent Manufacturing Cloud Computing Center Chinese Academy of Sciences Dongguan523808 China

Fused deposition modelling (FDM) 3D printing, as a supporting technology in social manufacturing and cloud manufacturing, is a rapidly growing technology in the era of industry 4.0. It produces objects with the layer-by-layer material accumulation technique. However, qualitative uncertainties are the common challenges yet. In order to assure print quality, studying the error causing parameters and minimizing their effects is important. This paper presents a feedback-based error compensation strategy, which integrates fuzzy inference system and grey wolf optimization algorithm. The objectives are twofold. First, the possible errors in FDM 3D printing are discussed in detail and optimal error causing parameters are obtained in percentage. This is used to understand the effects of the printing errors in every phase of the 3D printing process. From the nine optimization configuration trials used, Config-6 that has 100 number of iterations and 60 wolves is selected due to its higher convergence speed and best fitness value. The integral absolute error (IAE) is used as an objective function and the global minimum is achieved in the iteration interval [86, 100]. The outputs of this optimization problem is used to achieve the next objective. Second, a closed-loop quality monitoring approach comprising of inner-loops and an outer-loop is utilized. The three inner-loops are used to monitor the errors during pre-printing, printing, and post-printing, respectively. The outer-loop, on the other hand, is responsible for monitoring the aggregated errors in all the three 3D printing phases. The error compensation system simulation in Matlab is run for 10 seconds, and the results show that the "normal" range deformation factors are reached within less than 2 seconds for the inner-loops, whereas the outer-loop deformation factor is achieved within 7 seconds. The responses are within the acceptable time range. © 2021, CC BY.

关键词： 3D printers

来源：评论

学校读者我要写书评

暂无评论

Group-wise inhibition based feature regularization for robust classification

arXiv

引用

arXiv 2021年

作者： Liu, Haozhe Wu, Haoqian Xie, Weicheng Liu, Feng Shen, Linlin 1Computer Vision Institute College of Computer Science and Software Engineering 2SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society 3National Engineering Laboratory for Big Data System Computing Technology 4Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen 518060 China

The convolutional neural network (CNN) is vulnerable to degraded images with even very small variations (e.g. corrupted and adversarial samples). One of the possible reasons is that CNN pays more attention to the most discriminative regions, but ignores the auxiliary features when learning, leading to the lack of feature diversity for final judgment. In our method, we propose to dynamically suppress significant activation values of CNN by group-wise inhibition, but not fixedly or randomly handle them when training. The feature maps with different activation distribution are then processed separately to take the feature independence into account. CNN is finally guided to learn richer discriminative features hierarchically for robust classification according to the proposed regularization. Our method is comprehensively evaluated under multiple settings, including classification against corruptions, adversarial attacks and low data regime. Extensive experimental results show that the proposed method can achieve significant improvements in terms of both robustness and generalization performances, when compared with the state-of-the-art methods. Code is available at https://***/LinusWu/TENET_Training. Copyright © 2021, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：