SearcharxivSearch

arXiv subjects

Rafael Wisniewski

Publications and source records attributed to Rafael Wisniewski.

At least 19 recordsLinked to original sources

Virtual Smart Metering in District Heating Networks via Heterogeneous Spatial-Temporal Graph Neural Networks

Intelligent operation of thermal energy networks aims to improve energy efficiency, reliability, and operational flexibility through data-driven control, predictive optimization, and early fault detection. Achieving these goals relies on sufficient observability, requiring continuous and well-distributed monitoring of thermal and hydraulic states. However, district heating systems are typically sparsely instrumented and frequently affected by sensor faults, limiting monitoring. Virtual sensing offers a cost-effective means to enhance observability, yet its development and validation remain limited in practice. Existing data-driven methods generally assume dense synchronized data, while analytical models rely on simplified hydraulic and thermal assumptions that may not adequately capture the behavior of heterogeneous network topologies. Consequently, modeling the coupled nonlinear dependencies between pressure, flow, and temperature under realistic operating conditions remains challenging. In addition, the lack of publicly available benchmark datasets hinders systematic comparison of virtual sensing approaches. To address these challenges, we propose a heterogeneous spatial-temporal graph neural network (HSTGNN) for constructing virtual smart heat meters. The model incorporates the functional relationships inherent in district heating networks and employs dedicated branches to learn graph structures and temporal dynamics for flow, temperature, and pressure measurements, thereby enabling the joint modeling of cross-variable and spatial correlations. To support further research, we introduce a controlled laboratory dataset collected at the Aalborg Smart Water Infrastructure Laboratory, providing synchronized high-resolution measurements representative of real operating conditions. Extensive experiments demonstrate that the proposed approach significantly outperforms existing baselines.

cs.LG

Lyapunov Densities For Markov Processes: An Application To Quantum Systems With Non-Demolition Measurements

Stochastic convergence of discrete time Markov processes has been analysed based on a dual Lyapunov approach. Using some existing results on ergodic theory of Markov processes, it has been shown that existence of a properly subinvariant function (counterpart of the Lyapunov density in deterministic systems) implies sweeping of a Markov process out of the sets where this function is integrable. Such a function can be used as a certificate of convergence in probability of a stochastic system. We apply this technique to Markov processes induced by a quantum system with non-demolition measurement and propose dual Lyapunov certificates to certify sweeping.

math.DS

Secure PAC Bayesian Regression via Real Shamir Secret Sharing

A common approach of system identification and machine learning is to generate a model by using training data to predict the test data instances as accurate as possible. Nonetheless, concerns about data privacy are increasingly raised, but not always addressed. We present a secure protocol for learning a linear model relying on recently described technique called real number secret sharing. We take as our starting point the PAC Bayesian bounds and deduce a closed form for the model parameters which depends on the data and the prior from the PAC Bayesian bounds. To obtain the model parameters one needs to solve a linear system. However, we consider the situation where several parties hold different data instances and they are not willing to give up the privacy of the data. Hence, we suggest to use real number secret sharing and multiparty computation to share the data and solve the linear regression in a secure way without violating the privacy of data. We suggest two methods; a secure inverse method and a secure Gaussian elimination method, and compare these methods at the end. The benefit of using secret sharing directly on real numbers is reflected in the simplicity of the protocols and the number of rounds needed. However, this comes with the drawback that a share might leak a small amount of information, but in our analysis we argue that the leakage is small.

cs.LG

PAC-Bayesian bounds for learning LTI-ss systems with input from empirical loss

In this paper we derive a Probably Approxilmately Correct(PAC)-Bayesian error bound for linear time-invariant (LTI) stochastic dynamical systems with inputs. Such bounds are widespread in machine learning, and they are useful for characterizing the predictive power of models learned from finitely many data points. In particular, with the bound derived in this paper relates future average prediction errors with the prediction error generated by the model on the data used for learning. In turn, this allows us to provide finite-sample error bounds for a wide class of learning/system identification algorithms. Furthermore, as LTI systems are a sub-class of recurrent neural networks (RNNs), these error bounds could be a first step towards PAC-Bayesian bounds for RNNs.

stat.ML

Privacy in Distributed Computations based on Real Number Secret Sharing

Privacy preservation in distributed computations is an important subject as digitization and new technologies enable collection and storage of vast amounts of data, including private data belonging to individuals. To this end, there is a need for a privacy preserving computation framework that minimises the leak of private information during computations while being efficient enough for practical usage. This paper presents a step towards such a framework with the proposal of a real number secret sharing scheme that works directly on real numbers without the need for conversion to integers which is the case in related schemes. The scheme offers computations like addition, multiplication, and division to be performed directly on secret shared data (the cipher text version of the data). Simulations show that the scheme is much more efficient in terms of accuracy than its counterpart version based on integers and finite field arithmetic. The drawback with the proposed scheme is that it is not perfectly secure. However, we provide a privacy analysis of the scheme, where we show that the leaked information can be upper bounded and asymptotically goes to zero. To demonstrate the scheme, we use it to perform Kalman filtering directly on secret shared data.

cs.CR

Privacy Preservation in Epidemic Data Collection

This work is inspired by the outbreak of COVID-19, and some of the challenges we have observed with gathering data about the disease. To this end, we aim to help collect data about citizens and the disease without risking the privacy of individuals. Specifically, we focus on how to determine the density of the population across the country, how to trace contact between citizens, how to determine the location of infections, and how to determine the timeline of the spread of the disease. Our proposed methods are privacy-preserving and rely on an app to be voluntarily installed on citizens' smartphones. Thus, any individual can choose not to participate. However, the accurateness of the methods relies on the participation of a large percentage of the population.

cs.CR

Model reduction of linear hybrid systems

The paper proposes a model reduction algorithm for linear hybrid systems, i.e., hybrid systems with externally induced discrete events, with linear continuous subsystems, and linear reset maps. The model reduction algorithm is based on balanced truncation. Moreover, the paper also proves an analytical error bound for the difference between the input-output behaviors of the original and the reduced order model. This error bound is formulated in terms of singular values of the Gramians used for model reduction.

math.DS

Optimization and Positivity Certificates of Rational Functions using Bernstein Form

Rational functions of total degree $l$ in n variables have a representation in the Bernstein form defined over $n$ dimensional simplex. The range of a rational function is bounded by the smallest and the largest rational Bernstein coefficients over a simplex. Convergence properties of the bounds to the range are reviewed. Algebraic identities certifying the positivity of a given rational function over a simplex are given. Subsequently, a bound established in this work does not depend on the given dimension.

math.OC

On the Almost Everywhere Stability of Discrete-Time Dynamical Systems

For a dynamical system, it is known that the existence of a Lyapunov-type density function, called Lyapunov density or Rantzer's density function, implies convergence of Lebesgue almost all solutions to an equilibrium. Using the duality between Frobenius-Perron and Koopmann operators, we generalize this result from equilibrium to invariant sets, both for continuous- and discrete-time. Furthermore, some redundant assumptions that exist in the literature of almost everywhere stability for discrete-time, such as the local stability of the attractor and the compactness of the state space, has been removed.

nlin.AO

On Robust Stability of Switched Systems in the Context of Filippov Solutions

The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates solutions with infinite switching in finite time and sliding modes in the neighborhood of the switching surfaces. In this regard, a Lyapunov-like stability theorem, based on the theory of differential inclusions, is formulated. Additionally, the results are extended to switched systems with simplical uncertainty. It is also demonstrated that, for the special case of polynomial switched systems defined on semi-algebraic sets, stability analysis can be checked based on sum of squares programming techniques.

math.OC

Moment matching for bilinear systems with nice selections

The paper develops a method for model reduction of bilinear control systems. It leans upon the observation that the input-output map of a bilinear system has a particularly simple Fliess series expansion. Subsequently, a model reduction algorithm is formulated such that the coefficients of Fliess series expansion for the original and reduced systems match up to certain predefined sets - nice selections. Algorithms for computing matrix representations of unobservability and reachability spaces complying with a nice selection are provided. Subsequently, they are used for calculating a partial realization of a given input-output map.

math.OC

Moment Matching Based Model Reduction for LPV State-Space Models

We present a novel algorithm for reducing the state dimension, i.e. order, of linear parameter varying (LPV) discrete-time state-space (SS) models with affine dependence on the scheduling variable. The input-output behavior of the reduced order model approximates that of the original model. In fact, for input and scheduling sequences of a certain length, the input-output behaviors of the reduced and original model coincide. The proposed method can also be interpreted as a reachability and observability reduction (minimization) procedure for LPV-SS representations with affine dependence.

eess.SY

Model Reduction by Moment Matching for Linear Switched Systems

Two moment-matching methods for model reduction of linear switched systems (LSSs) are presented. The methods are similar to the Krylov subspace methods used for moment matching for linear systems. The more general one of the two methods, is based on the so called "nice selection" of some vectors in the reachability or observability space of the LSS. The underlying theory is closely related to the (partial) realization theory of LSSs. In this paper, the connection of the methods to the realization theory of LSSs is provided, and algorithms are developed for the purpose of model reduction. Conditions for applicability of the methods for model reduction are stated and finally the results are illustrated on numerical examples.

eess.SY

Modeling Populations of Thermostatic Loads with Switching Rate Actuation

We model thermostatic devices using a stochastic hybrid description, and introduce an external actuation mechanism that creates random switch events in the discrete dynamics. We then conjecture the form of the Fokker-Planck equation and successfully verify it numerically using Monte Carlo simulations. The actuation mechanism and subsequent modeling result are relevant for power system operation.

eess.SY

Stochastic Analysis of Synchronization in a Supermarket Refrigeration System

Display cases in supermarket systems often exhibit synchronization, in which the expansion valves in the display cases turn on and off at exactly the same time. The study of the influence of switching noise on synchronization in supermarket refrigeration systems is the subject matter of this work. For this purpose, we model it as a hybrid system, for which synchronization corresponds to a periodic trajectory. Subsequently, we investigate the influence of switching noise. We develop a statistical method for computing an intensity function, which measures how often the refrigeration system stays synchronized. By analyzing the intensity, we conclude that the increase in measurement uncertainty yields the decrease at the prevalence of synchronization.

eess.SY

Proceedings 4th Workshop on Hybrid Autonomous Systems

The interest in autonomous systems is increasing both in industry and academia. Such systems must operate with limited human intervention in a changing environment and must be able to compensate for significant system failures without external intervention. The most appropriate models of autonomous systems can be found in the class of hybrid systems that interact with their environment. This workshop brings together researchers interested in all aspects of autonomy and resilience of hybrid systems.

eess.SY

Fatigue Estimation Methods Comparison for Wind Turbine Control

Fatigue is a critical factor in structures as wind turbines exposed to harsh operating conditions, both in the design stage and control during their operation. In the present paper the most recognized approaches to estimate the damage caused by fatigue are discussed and compared, with special focus on their applicability for wind turbine control. The aim of this paper is to serve as a guide among the vast literature on fatigue and shed some light on the underlying relationships between these methods.

math.OC

Model Reduction of Linear Switched Systems by Restricting Discrete Dynamics

We present a procedure for reducing the number of continuous states of discrete-time linear switched systems, such that the reduced system has the same behavior as the original system for a subset of switching sequences. The proposed method is expected to be useful for abstraction based control synthesis methods for hybrid systems.

eess.SY