Related papers: Saturation algorithms for model-checking pushdown …

In this paper we consider different model reduction techniques for systems with moving loads. Due to the time-dependency of the input and output matrices, the application of time-varying projection matrices for the reduction offers new…

We illustrate the use of tools (asymptotic theories of standard error quantification using appropriate statistical models, bootstrapping, model comparison techniques) in addition to sensitivity that may be employed to determine the…

In this paper, we study the saturation effect in the energy or mass spectra of three quantum models with energy-dependent potentials: the harmonic oscillator, the hydrogen atom, and the heavy quarkonia. We used the method proposed in…

Model checking has been successfully applied to verification of computer hardware and software, communication systems and even biological systems. In this paper, we further push the boundary of its applications and show that it can be…

Robust model predictive control algorithms are essential for addressing unavoidable errors due to the uncertainty in predicting real-world systems. However, the formulation of such algorithms typically results in a trade-off between…

We consider the matrix completion problem where the aim is to esti-mate a large data matrix for which only a relatively small random subset of its entries is observed. Quite popular approaches to matrix completion problem are iterative…

While the evaluation of explanations is an important step towards trustworthy models, it needs to be done carefully, and the employed metrics need to be well-understood. Specifically model randomization testing is often overestimated and…

We present a statistical perspective on boosting. Special emphasis is given to estimating potentially complex parametric or nonparametric models, including generalized linear and additive models as well as regression models for survival…

Comment on ``Boosting Algorithms: Regularization, Prediction and Model Fitting'' [arXiv:0804.2752]

An algorithm for measurement of entropy in multiparticle systems, based on recently published proposal of the present authors, is given. Dependence on discretization of the system and effects of multiparticle correlations are discussed in…

In this article, we establish a class of new accelerated modulus-based iteration methods for solving the linear complementarity problem. When the system matrix is an $H_+$-matrix, we present appropriate criteria for the convergence…

Matrix element reweighting is a powerful experimental technique widely employed to maximize the amount of information that can be extracted from a collider data set. We present a procedure that allows to automatically evaluate the weights…

In this paper we deal with verification of safety properties of parameterized systems with a tree topology. The verification problem is translated to a purely logical problem of finding a finite countermodel for a first-order formula, which…

Markov decision processes are useful models of concurrency optimisation problems, but are often intractable for exhaustive verification methods. Recent work has introduced lightweight approximative techniques that sample directly from…

The calibration method is used to identify some minimizers of the Mumford-Shah functional. The method is then extended to more general free discontinuity problems.

We propose a novel framework for model-order reduction of hyperbolic differential equations. The approach combines a relaxation formulation of the hyperbolic equations with a discretization using shifted base functions. Model-order…

Sensorless control of Permanent-Magnet Synchronous Motors at low velocity remains a challenging task. A now well-established method consists in injecting a high-frequency signal and use the rotor saliency, both geometric and…

This article proposes a test procedure that can be used to test ML models and ML-based systems independently of the actual training process. In this way, the typical quality statements such as accuracy and precision of these models and…

Load balancing algorithms play critical roles in systems where the workload has to be distributed across multiple resources, such as cores in multiprocessor system, computers in distributed computing, and network links. In this paper, we…

In this paper, we propose a novel method for matrix completion under general non-uniform missing structures. By controlling an upper bound of a novel balancing error, we construct weights that can actively adjust for the non-uniformity in…