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

arXiv 2022年

作者： Maurer, Jona Tschuch, Nicolai Krebs, Stefan Bhattacharya, Kankar Cañizares, Claudio Hohmann, Sören Karlsruhe Institute of Technology Institute of Control Systems Wilhelm-Jordan-Weg 1 Karlsruhe76131 Germany Department of Electrical and Computer Engineering University of Waterloo ONN2L3G1 Canada

Although electric power networks and district heating networks are physically coupled, they are not operated in a coordinated manner. With increasing penetration of renewable energy sources, a coordinated market-based operation of the two networks can yield significant advantages, as reduced need for grid reinforcements, by optimizing the power flows in the coupled systems. Transactive control has been developed as a promising approach based on market and control mechanisms to coordinate supply and demand in energy systems, which when applied to power systems is being referred to as transactive energy. However, this approach has not been fully investigated in the context of market-based operation of coupled electric power and district heating networks. Therefore, this paper proposes a transactive control approach to coordinate flexible producers and consumers while taking into account the operational aspects of both networks, for the benefit of all participants and considering their privacy. A nonlinear model predictive control approach is applied in this work to maximize the social welfare of both networks, taking into account system operational limits, while reducing losses and considering system dynamics and forecasted power supply and demand of inflexible producers and consumers. A subtle approximation of the operational optimization problem is used to enable the practical application of the proposed approach in real time. The presented technique is implemented, tested, and demonstrated in a realistic test system, illustrating its benefits. © 2022, CC BY-NC-ND.

关键词： Renewable energy resources

来源：评论

学校读者我要写书评

暂无评论

Short - Term Prediction of Coke Pushing Current Peak Based on Improved ARIMA Model

Short - Term Prediction of Coke Pushing Current Peak Based o...

引用

Industrial Cyber-Physical systems (ICPS)

作者： Haiyang Wei Luefeng Chen Jie Hu Yi Ren Min Wu Witold Pedrycz Kaoru Hirota School of Automation China University of Geosciences Wuhan China Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada Tokyo Institute of Technology Yokohama Japan

Coke pushing current is an indicator to evaluate the difficulty of coke pushing operation. The higher coke pushing current is, the greater coke pushing resistance is, and the more difficult coke is to push out. Accurate prediction of current peak during future coke pushing operation can provide more time for production personnel to adjust production status and avoid difficult coke pushing in carbonization chamber. In this paper, a combination prediction model based on VMD (Variational Mode Decomposition) and improved ARIMA (Autoregressive Integrated Moving Average) models is proposed. Firstly, VMD algorithm is used to decompose time series of coke pushing current peak, de-noising data, and extracting main information of time series. Then, ARIMA model is used to predict mean change of linear elasticity and GARCH (Generalized Autore-gressive Conditional Heteroskedasticity) model is introduced to predict ARIMA model residual and improve heteroscedasticity of nonlinear part of time series, and then ARIMA-GARCH model is established. Finally, predicted value is obtained by the sum of each component prediction. The experimental results show that the proposed prediction model has a high prediction accuracy in the short-term prediction of coke pushing current peak. The scheme is applied to actual coking production to guide production of coke.

关键词： Resistance Ovens Time series analysis Noise reduction Production Predictive models Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Empirical Risk Minimization with Relative Entropy Regularization: Optimality and Sensitivity Analysis

Empirical Risk Minimization with Relative Entropy Regulariza...

引用

IEEE International Symposium on Information Theory

作者： Samir M. Perlaza Gaetan Bisson Iñ aki Esnaola Alain Jean-Marie Stefano Rini INRIA Sophia Antipolis France Laboratoire de Math&#x00E9 matiques GAATI Universit&#x00E9 de la Polyn&#x00E9 sie Fran&#x00E7 aise Faaa French Polynesia Department of Automatic Control and Systems Engineering University of Sheffield Sheffield United Kingdom Department of Electrical and Computer Engineering National Chao Tung University Hsinchu Taiwan Department of Electrical and Computer Engineering Princeton University Princeton NJ USA

ISBN: (数字)9781665421591

ISBN: (纸本)9781665421607

The optimality and sensitivity of the empirical risk minimization problem with relative entropy regularization (ERM-RER) are investigated for the case in which the reference is a σ-finite measure instead of a probability measure. This generalization allows for a larger degree of flexibility in the incorporation of prior knowledge over the set of models. In this setting, the interplay of the regularization parameter, the reference measure, the risk function, and the empirical risk induced by the solution of the ERM-RER problem is characterized. This characterization yields necessary and sufficient conditions for the existence of regularization parameters that achieve arbitrarily small empirical risk with arbitrarily high probability. Additionally, the sensitivity of the expected empirical risk to deviations from the solution of the ERM-RER problem is studied. Dataset-dependent and dataset-independent upper bounds on the absolute value of the sensitivity are presented. In a special case, it is shown that the expectation (with respect to the datasets) of the absolute value of the sensitivity is upper bounded, up to a constant factor, by the square root of the lautum information between the models and the datasets.

关键词： Sufficient conditions Upper bound Sensitivity analysis Entropy Risk management Information theory

来源：评论

学校读者我要写书评

暂无评论

COMBINING PHYSICS AND MACHINE LEARNING FOR NETWORK FLOW ESTIMATION 9

COMBINING PHYSICS AND MACHINE LEARNING FOR NETWORK FLOW ESTI...

引用

9th International Conference on Learning Representations, ICLR 2021

作者： Silva, Arlei Kocayusufoglu, Furkan Jafarpour, Saber Bullo, Francesco Swami, Ananthram Singh, Ambuj Computer Science Department UC Santa BarbaraCA93106-5110 United States Mechanical Engineering Department The Center of Control Dynamical Systems and Computation UC Santa BarbaraCA93106-5070 United States U.S. Army Research Lab AdelphiMD20783 United States

The flow estimation problem consists of predicting missing edge flows in a network (e.g., traffic, power, and water) based on partial observations. These missing flows depend both on the underlying physics (edge features and a flow conservation law) as well as the observed edge flows. This paper introduces an optimization framework for computing missing edge flows and solves the problem using bilevel optimization and deep learning. More specifically, we learn regularizers that depend on edge features (e.g., number of lanes in a road, resistance of a power line) using neural networks. Empirical results show that our method accurately predicts missing flows, outperforming the best baseline, and is able to capture relevant physical properties in traffic and power networks. © 2021 ICLR 2021 - 9th International Conference on Learning Representations. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Jseun: Joint Semantic-Instance Segmentation of Point Cloud Via Neighbor Features for Indoor Scenes

SSRN

引用

SSRN 2023年

作者： Chen, Hui Jiang, Jinlong Chen, Wanlou Liu, Wanquan Liu, Peter Xiaoping College of Automation Engineering Shanghai University of Electric Power Shanghai200090 China Laboratory of System Control and Information Processing Ministry of Education Shanghai200240 China Nanovision Medical Technology Co. Ltd Shanghai200000 China School of Intelligent Systems Engineering Sun Yat-sen University Guangzhou510275 China Department of Systems and Computer Engineering Carleton University OttawaONK1S 5B6 Canada

Efficient and accurate segmentation of the point cloud for indoor scenes is an important task for 3D scene understanding. Due to the complexity of indoor environments. It is difficult to fully extract the details of point cloud, resulting in poor recognizability in existing models. In this paper, a novel framework called joint semantic-instance segmentation via enhancedutilization of neighbor features is proposed to achieve semantic and instance segmentation of indoor scenes. This framework mines point cloud information from a local scale, but it is different from other models in that it focuses on the full mining of point cloud neighbor information. In this regard, a new neighbor feature extraction module is developed to enrich the expression of neighborhood information and enlarge the construction of the neighborhood neighbor scope. Besides, semantic and instance segmentations take advantages of each other by constructing a mutual promotion model of semantic and instance, which can obtain more accurate semantic and instance predictions for indoor scenes. The proposed scheme is evaluated on the S3DIS dataset and compared with existing methods. Experimental results demonstrate that this method is more effective and efficient than previous approaches in joint 3D semantic and instance segmentation. © 2023, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

NeurAR: Neural Uncertainty for Autonomous 3D Reconstruction with Implicit Neural Representations

arXiv

引用

arXiv 2022年

作者： Ran, Yunlong Zeng, Jing He, Shibo Chen, Jiming Li, Lincheng Chen, Yingfeng Lee, Gimhee Ye, Qi The College of Control Science and Engineering Zhejiang University Hangzhou China The College of Control Science and Engineering The State Key Laboratory of Industrial Control Technology Zhejiang University The Key Laboratory of Collaborative Sensing and Autonomous Unmanned Systems of Zhejiang Province China Fuxi AI Lab NetEase Inc. Hangzhou China The Department of Computer Science National University of Singapore Singapore

Implicit neural representations have shown compelling results in offline 3D reconstruction and also recently demonstrated the potential for online SLAM systems. However, applying them to autonomous 3D reconstruction, where a robot is required to explore a scene and plan a view path for the reconstruction, has not been studied. In this paper, we explore for the first time the possibility of using implicit neural representations for autonomous 3D scene reconstruction by addressing two key challenges: 1) seeking a criterion to measure the quality of the candidate viewpoints for the view planning based on the new representations, and 2) learning the criterion from data that can generalize to different scenes instead of a hand-crafting one. To solve the challenges, firstly, a proxy of Peak Signal-to-Noise Ratio (PSNR) is proposed to quantify a viewpoint quality;secondly, the proxy is optimized jointly with the parameters of an implicit neural network for the scene. With the proposed view quality criterion from neural networks (termed as Neural Uncertainty), we can then apply implicit representations to autonomous 3D reconstruction. Our method demonstrates significant improvements on various metrics for the rendered image quality and the geometry quality of the reconstructed 3D models when compared with variants using TSDF or reconstruction without view planning. Project webpage https://***/NeurAR/. Copyright © 2022, The Authors. All rights reserved.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

High throughput event filtering: The interpolation-based DIF algorithm hardware architecture

引用

Microprocessors and Microsystems 2025年

作者： Marcin Kowalczyk Tomasz Kryjak Embedded Vision Systems Group Department of Automatic Control and Robotics Faculty of Electrical Engineering Automatics Computer Science and Biomedical Engineering AGH University of Krakow Poland

In recent years, there has been rapid development in the field of event vision. It manifests itself both on the technical side, as better and better event sensors are available, and on the algorithmic side, as more and more applications of this technology are proposed and scientific papers are published. However, the data stream from these sensors typically contains a significant amount of noise, which varies depending on factors such as the degree of illumination in the observed scene or the temperature of the sensor. We propose a hardware architecture of the Distance-based Interpolation with Frequency Weights(DIF) filter and implement it on an FPGA chip. To evaluate the algorithm and compare it with other solutions, we have prepared a new high-resolution event dataset, which we are also releasing to the community. Our architecture achieved a throughput of 403.39 million events per second (MEPS) for a sensor resolution of 1280 × 720 and 428.45 MEPS for a resolution of 640 × 480. The averagevalues of the Area Under the Receiver Operating Characteristic (AUROC) index ranged from 0.844 to 0.999, depending on the dataset, which is comparable to the state-of-the-art filtering solutions, but with much higher throughput and better operation over a wide range of noise levels.

关键词： Dataset Denoising DVS FPGA High-throughput

来源：评论

学校读者我要写书评

暂无评论

Compressed Gradient Tracking Algorithms for Distributed Nonconvex Optimization

arXiv

引用

arXiv 2023年

作者： Xu, Lei Yi, Xinlei Wen, Guanghui Shi, Yang Johansson, Karl H. Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Systems Science School of Mathematics Southeast University Nanjing210096 China The Department of Mechanical Engineering University of Victoria VictoriaBCV8W 2Y2 Canada The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm100 44 Sweden

In this paper, we study the distributed nonconvex optimization problem, aiming to minimize the average value of the local nonconvex cost functions using local information exchange. To reduce the communication overhead, we introduce three general classes of compressors, i.e., compressors with bounded relative compression error, compressors with globally bounded absolute compression error, and compressors with locally bounded absolute compression error. By integrating them, respectively, with the distributed gradient tracking algorithm, we then propose three corresponding compressed distributed nonconvex optimization algorithms. Motivated by the state-of-the-art BEER algorithm proposed in [1], which is an efficient compressed algorithm integrating gradient tracking with biased and contractive compressors, our first proposed algorithm extends this algorithm to accommodate both biased and non-contractive compressors. For each algorithm, we design a novel Lyapunov function to demonstrate its sublinear convergence to a stationary point if the local cost functions are smooth. Furthermore, when the global cost function satisfies the Polyak–Lojasiewicz (P–L) condition, we show that our proposed algorithms linearly converge to a global optimal point. It is worth noting that, for compressors with bounded relative compression error and globally bounded absolute compression error, our proposed algorithms’ parameters do not require prior knowledge of the P–L constant. The theoretical results are illustrated by numerical examples, demonstrating the effectiveness of the proposed algorithms in significantly reducing the communication burden while maintaining the convergence performance. Moreover, simulation results show that the proposed algorithms outperform the state-of-the-art compressed distributed nonconvex optimization algorithms. Copyright © 2023, The Authors. All rights reserved.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Fast monte carlo simulation of dynamic power systems under continuous random disturbances

Fast monte carlo simulation of dynamic power systems under c...

引用

2020 IEEE Power and Energy Society General Meeting, PESGM 2020

作者： Qiu, Yiwei Lin, Jin Chen, Xiaoshuang Liu, Feng Songy, Yonghua Tsinghua University State Key Laboratory of Control and Simulation of Power Systems and Generation Equipment Department of Electrical Engineering Beijing100084 China The University of Macau Department of Electrical and Computer Engineering 999078 China

ISBN: (纸本)9781728155081

Continuous-time random disturbances from the renewable generation pose a significant impact on power system dynamic behavior. In evaluating this impact, the disturbances must be considered as continuous-time random processes instead of random variables that do not vary with time to ensure accuracy. Monte Carlo simulation (MCs) is a nonintrusive method to evaluate such impact that can be performed on commercial power system simulation software and is easy for power utilities to use, but is computationally cumbersome. Fast samplings methods such as Latin hypercube sampling (LHS) have been introduced to speed up sampling random variables, but yet cannot be applied to sample continuous disturbances. To overcome this limitation, this paper proposes a fast MCs method that enables the LHS to speed up sampling continuous disturbances, which is based on the Itô process model of the disturbances and the approximation of the Itô process by functions of independent normal random variables. A case study of the IEEE 39-Bus System shows that the proposed method is 47.6 and 6.7 times faster to converge compared to the traditional MCs in evaluating the expectation and variance of the system dynamic response. © 2020 IEEE.

关键词： Random processes

来源：评论

学校读者我要写书评

暂无评论

Distributed CPU Scheduling Subject to Nonlinear Constraints

arXiv

引用

arXiv 2022年

作者： Doostmohammadian, Mohammadreza Aghasi, Alireza Rikos, Apostolos I. Grammenos, Andreas Kalyvianaki, Evangelia Hadjicostis, Christoforos N. Johansson, Karl H. Charalambous, Themistoklis The School of Electrical Engineering Aalto University Finland Georgia State University GA United States The Department of Computer Science and Technology University of Cambridge Cambridge The Alan Turing Institute London United Kingdom Department of Computer Science and Technology University of Cambridge Cambridge United Kingdom The Department of Electrical and Computer Engineering University of Cyprus Cyprus Cyprus The Division of Decision and Control Systems KTH Royal Institute of Technology Sweden

This paper considers a network of collaborating agents for local resource allocation subject to nonlinear model constraints. In many applications, it is required (or desirable) that the solution be anytime feasible in terms of satisfying the sum-preserving global constraint. Motivated by this, sufficient conditions on the nonlinear mapping for anytime feasibility (or non-asymptotic feasibility) are addressed in this paper. For the two proposed distributed solutions, one converges over directed weight-balanced networks and the other one over undirected networks. In particular, we elaborate on uniform quantization and discuss the notion of Ε-accurate solution, which gives an estimate of how close we can get to the exact optimizer subject to different quantization levels. This work, further, handles general (possibly non-quadratic) strictly convex objective functions with application to CPU allocation among a cloud of data centers via distributed solutions. The results can be used as a coordination mechanism to optimally balance the tasks and CPU resources among a group of networked servers while addressing quantization or limited server capacity. © 2022, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：