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

2024 China Automation Congress, CAC 2024

作者： Liu, Xiao Chen, Luefeng Lu, Chengda Fan, Haipeng Wu, Min Pedrycz, Witold School of Automation The Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems The Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education China University of Geosciences Wuhan430074 China Department of Electrical and Computer Engineering University of Alberta EdmontonABT6G 2R3 Canada Systems Research Institute Polish Academy of Sciences Warsaw00-901 Poland Department of Computer Engineering Istinye University Sariyer Istanbul34396 Turkey

ISBN: (纸本)9798350368604

During the coal seam drilling process, the drill string is subject to compressive deformation, compounded by unpredictable variations in formation hardness and borehole wall friction, leading to challenges in maintaining a stable feeding speed. This paper presents a novel approach by introducing uncertain parameters to describe the effects of formation hardness and borehole wall friction. Drill string axial movement model is modeled as a polyhedral system based on a lumped parameter representation. To meet industrial performance requirements, we design a robust H∞ controller to achieve consistent feeding speed control. Our simulation results demonstrate the controller’s effectiveness in ensuring system stability despite fluctuations in formation hardness and drill string friction. © 2024 IEEE.

关键词： Coal deposits

来源：评论

学校读者我要写书评

暂无评论

Towards efficient deep spiking neural networks construction with spiking activity based pruning 24

Towards efficient deep spiking neural networks construction ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Yaxin Li Qi Xu Jiangrong Shen Hongming Xu Long Chen Gang Pan School of Computer Science and Technology Dalian University of Technology Dalian China and Guangdong Laboratory of Artificial Intelligence and Digital Economy Shenzhen China School of Computer Science and Technology Dalian University of Technology Dalian China College of Computer Science and Technology Zhejiang University Hangzhou China Centre for Systems Engineering and Innovation Imperial College London London UK

The emergence of deep and large-scale spiking neural networks (SNNs) exhibiting high performance across diverse complex datasets has led to a need for compressing network models due to the presence of a significant number of redundant structural units, aiming to more effectively leverage their low-power consumption and biological interpretability advantages. Currently, most model compression techniques for SNNs are based on unstructured pruning of individual connections, which requires specific hardware support. Hence, we propose a structured pruning approach based on the activity levels of convolutional kernels named Spiking Channel Activity-based (SCA) network pruning framework. Inspired by synaptic plasticity mechanisms, our method dynamically adjusts the network's structure by pruning and regenerating convolutional kernels during training, enhancing the model's adaptation to the current target task. While maintaining model performance, this approach refines the network architecture, ultimately reducing computational load and accelerating the inference process. This indicates that structured dynamic sparse learning methods can better facilitate the application of deep SNNs in low-power and high-efficiency scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Entrywise Inference for Missing Panel Data: A Simple and Instance-Optimal Approach

arXiv

引用

arXiv 2024年

作者： Yan, Yuling Wainwright, Martin J. Institute for Data Systems and Society Massachusetts Institute of Technology United States Laboratory for Information and Decision Systems Massachusetts Institute of Technology United States Department of Electrical Engineering and Computer Sciences Massachusetts Institute of Technology United States Department of Mathematics Massachusetts Institute of Technology United States

Longitudinal or panel data can be represented as a matrix with rows indexed by units and columns indexed by time. We consider inferential questions associated with the missing data version of panel data induced by staggered adoption. We propose a computationally efficient procedure for estimation, involving only simple matrix algebra and singular value decomposition, and prove non-asymptotic and high-probability bounds on its error in estimating each missing entry. By controlling proximity to a suitably scaled Gaussian variable, we develop and analyze a data-driven procedure for constructing entrywise confidence intervals with pre-specified coverage. Despite its simplicity, our procedure turns out to be instance-optimal: we prove that the width of our confidence intervals match a non-asymptotic instance-wise lower bound derived via a Bayesian Cramér-Rao argument. We illustrate the sharpness of our theoretical characterization on a variety of numerical examples. Our analysis is based on a general inferential toolbox for SVD-based algorithm applied to the matrix denoising model, which might be of independent interest. Copyright © 2024, The Authors. All rights reserved.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Optimal Sensor Placement for Full-Set TDOA Localization Accounting for Sensor Location Errors

引用

IEEE Transactions on Aerospace and Electronic systems 2025年

作者： Zhang, Chengjie Han, Xinyang Kong, He Ho, K.C. Southern University of Science and Technology Shenzhen Key Laboratory of Control Theory and Intelligent Systems Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology Shenzhen518055 China University of Missouri Electrical Engineering and Computer Science Department ColumbiaMO65211 United States

The positioning accuracy of a signal source is influenced by where the sensors are deployed. Studies in the literature for the optimal sensor placement (OSP) of localization often ignore the presence of sensor position errors. In practice, however, it is impossible to place the sensors precisely at the desired locations. This work designs OSP by accounting for the presence of Gaussian sensor position errors that are independent and identically distributed (IID), with the full set of Time Difference of Arrival measurements corrupted by Gaussian IID noise. The criterion is the A-optimality equal to the trace of the source position Cramer-Rao Bound (CRB). We show that the presence of sensor position errors introduces a multiplication factor to the same criterion for the case without sensor position errors. The latter factor is dependent on the ratio of the sensor position error power to the range difference noise power but independent of the sensor positions, implying that the A-optimality OSP in the presence of sensor position errors is the same as in the absence. To our knowledge, this is the first time such results have been derived. Simulation studies validate the derived OSP, show the minimal OSP performance gap with sensor positioning error and without, and illustrate the better source localization accuracy by OSP. © 1965-2011 IEEE.

关键词： Cramer-Rao bounds

来源：评论

学校读者我要写书评

暂无评论

Learning Reduced-Order Linear Parameter-Varying Models of Nonlinear systems ⁎

引用

IFAC-PapersOnLine 2024年第15期58卷 265-270页

作者： Patrick J.W. Koelewijn Rajiv Singh Peter Seiler Roland Tóth Sioux Technologies B.V. Eindhoven The Netherlands Control Systems Group Eindhoven University of Technology Eindhoven The Netherlands The MathWorks Inc. Natick USA Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor USA Systems and Control Laboratory HUN-REN Institute for Computer Science and Control Budapest Hungary

In this paper, we consider the learning of a Reduced-Order Linear Parameter-Varying Model (ROLPVM) of a nonlinear dynamical system based on data. This is achieved by a two-step procedure. In the first step, we learn a projection to a lower dimensional state-space. In step two, an LPV model is learned on the reduced-order state-space using a novel, efficient parameterization in terms of neural networks. The improved modeling accuracy of the method compared to an existing method is demonstrated by simulation examples.

关键词： Reduced-order modeling Neural Networks Linear Parameter-Varying Models

来源：评论

学校读者我要写书评

暂无评论

Reinforcement learning-enhanced dynamic multi-objective evolutionary algorithm for cooperative shovel scheduling in open-pit mining

Reinforcement learning-enhanced dynamic multi-objective evol...

引用

2024 China Automation Congress, CAC 2024

作者： Zhang, Zihao Li, Changhe Yang, Shengxiang School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan430074 China School of Artificial Intelligence Anhui University of Science & Technology Hefei232001 China School of Computer Science and Informatics De Montfort University Leicester United Kingdom

ISBN: (纸本)9798350368604

Aiming at the ore blending problem in the open-pit mining scenario, the optimization objective is to minimize the grade variance of the sliding window of the ore flow, and a cooperative shovel scheduling model for real-time ore blending is established. A reinforcement learning-enhanced dynamic multi- objective evolutionary algorithm is proposed, where a Q-learning operator selection mechanism is introduced to reuse the information from the previous environment for tracking the optimal solution in the dynamic environment. Experimental results show that the proposed method can effectively control the grade fluctuation of the ore flow and dynamically respond to external events, and can find a better solution in real time compared with the traditional operator selection algorithm. © 2024 IEEE.

关键词： Open pit mining

来源：评论

学校读者我要写书评

暂无评论

Adaptive Constraint Partition Based Optimization Framework for Large-Scale Integer Linear Programming 37

Adaptive Constraint Partition Based Optimization Framework f...

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Ye, Huigen Wang, Hongyan Xu, Hua Wang, Chengming Jiang, Yu State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing100084 China School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Meituan Inc. Block F&G Wangjing International R&D Park No.6 Wang Jing East Rd Chaoyang District Beijing100102 China

ISBN: (纸本)9781577358800

Integer programming problems (IPs) are challenging to be solved efficiently due to the NP-hardness, especially for large-scale IPs. To solve this type of IPs, Large neighborhood search (LNS) uses an initial feasible solution and iteratively improves it by searching a large neighborhood around the current solution. However, LNS easily steps into local optima and ignores the correlation between variables to be optimized, leading to compromised performance. This paper presents a general adaptive constraint partition-based optimization framework (ACP) for large-scale IPs that can efficiently use any existing optimization solver as a subroutine. Specifically, ACP first randomly partitions the constraints into blocks, where the number of blocks is adaptively adjusted to avoid local optima. Then, ACP uses a subroutine solver to optimize the decision variables in a randomly selected block of constraints to enhance the variable correlation. ACP is compared with LNS framework with different subroutine solvers on four IPs and a real-world IP. The experimental results demonstrate that in specified wall-clock time ACP shows better performance than SCIP and Gurobi. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

StyleTalk++: A Unified Framework for Controlling the Speaking Styles of Talking Heads

arXiv

引用

arXiv 2024年

作者： Wang, Suzhen Ma, Yifeng Ding, Yu Hu, Zhipeng Fan, Changjie Lv, Tangjie Deng, Zhidong Yu, Xin Fuxi AI Lab Netease Zhejiang Hangzhou China Department of Computer Science and Technology BNRist THUAI State Key Laboratory of Intelligent Technology and Systems Tsinghua University China The School of Computer Science The University of Queensland Brisbane Australia

Individuals have unique facial expression and head pose styles that reflect their personalized speaking styles. Existing one-shot talking head methods cannot capture such personalized characteristics and therefore fail to produce diverse speaking styles in the final videos. To address this challenge, we propose a one-shot style-controllable talking face generation method that can obtain speaking styles from reference speaking videos and drive the one-shot portrait to speak with the reference speaking styles and another piece of audio. Our method aims to synthesize the style-controllable coefficients of a 3D Morphable Model (3DMM), including facial expressions and head movements, in a unified framework. Specifically, the proposed framework first leverages a style encoder to extract the desired speaking styles from the reference videos and transform them into style codes. Then, the framework uses a style-aware decoder to synthesize the coefficients of 3DMM from the audio input and style codes. During decoding, our framework adopts a two-branch architecture, which generates the stylized facial expression coefficients and stylized head movement coefficients, respectively. After obtaining the coefficients of 3DMM, an image renderer renders the expression coefficients into a specific person's talking-head video. Extensive experiments demonstrate that our method generates visually authentic talking head videos with diverse speaking styles from only one portrait image and an audio clip. Copyright © 2024, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Transi-Net: An Explainable Deep Learning Model Ensemble For Prostate's Transition Zone Segmentation 23

Transi-Net: An Explainable Deep Learning Model Ensemble For ...

引用

23rd IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2023

作者： Zaridis, Dimitrios I. Mylona, Eugenia Tachos, Nikolaos S. Kalantzopoulos, Charalampos Marias, Kostas Tsiknakis, Manolis Koutsouris, Dimitrios D. Matsopoulos, George K. Fotiadis, Dimitrios I. Biomedical Engineering Laboratory School of Electrical & Computer Engineering Biomedical Research Institute National Technical University of Athens FORTH Athens Ioannina Greece Biomedical Research Institute FORTH Ioannina Greece Computational Biomedicine Laboratory FORTH Heraklion Greece Biomedical Engineering Laboratory School of Electrical & Computer Engineering National Technical University of Athens Athens Greece Biomedical Research Institute Unit of Medical Technology and Intelligent Information Systems FORTH University of Ioannina Ioannina Greece

ISBN: (纸本)9798350393118

The identification of the location of prostate cancer is of paramount importance for improved treatment. This process is strictly bonded with the accurate segmentation of the prostate gland and its zones, on MR images. In the present study, an ensemble of 3 deep learning models along with a Meta-learner module able to refine the outcomes of the models, is proposed (Transi-Net) to segment the prostate's transition zone. A method to quantify the model's uncertainty is introduced to measure the confidence of an architecture with respect to its final decision. The backbone of Transi-Net consist the original U-net, Dense2U-net and Bridged U-net models. The proposed model showcased significant improvement in comparison with its base components as well as an independent model, the USE-Net, while it was proven more confident about its decision. The proposed model resulted in an improvement of 5%, 3%, 3% and 4% for Sensitivity, Balanced Accuracy, Dice Score and Rand Error Index respectively, compared to the second best, USE-Net. © 2023 IEEE.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

SCARF: Scalable Continual Learning Framework for Memory-efficient Multiple Neural Radiance Fields

arXiv

引用

arXiv 2024年

作者： Wang, Yuze Wang, Junyi Wang, Chen Duan, Wantong Bao, Yongtang Qi, Yue State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang University China School of Computer Science and Technology Shandong University China School of Computer and Artificial Intelligence Beijing Technology and Business University China Jingdezhen Research Institute Beihang University China Shandong University of Science and Technology China

This paper introduces a novel continual learning framework for synthesising novel views of multiple scenes, learning multiple 3D scenes incrementally, and updating the network parameters only with the training data of the upcoming new scene. We build on Neural Radiance Fields (NeRF), which uses multi-layer perceptron to model the density and radiance field of a scene as the implicit function. While NeRF and its extensions have shown a powerful capability of rendering photo-realistic novel views in a single 3D scene, managing these growing 3D NeRF assets efficiently is a new scientific problem. Very few works focus on the efficient representation or continuous learning capability of multiple scenes, which is crucial for the practical applications of NeRF. To achieve these goals, our key idea is to represent multiple scenes as the linear combination of a cross-scene weight matrix and a set of scene-specific weight matrices generated from a global parameter generator. Furthermore, we propose an uncertain surface knowledge distillation strategy to transfer the radiance field knowledge of previous scenes to the new model. Representing multiple 3D scenes with such weight matrices significantly reduces memory requirements. At the same time, the uncertain surface distillation strategy greatly overcomes the catastrophic forgetting problem and maintains the photo-realistic rendering quality of previous scenes. Experiments show that the proposed approach achieves state-of-the-art rendering quality of continual learning NeRF on NeRF-Synthetic, LLFF, and TanksAndTemples datasets while preserving extra low storage cost. Copyright © 2024, The Authors. All rights reserved.

关键词： Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：