Related papers: Computing subsignatures of systems with exchangeab…
Post-silicon clock tuning elements are widely used in high-performance designs to mitigate the effects of process variations and aging. Located on clock paths to flip-flops, these tuning elements can be configured through the scan chain so…
We consider here systems with piecewise linear dynamics that are periodically sampled with a given period {\tau} . At each sampling time, the mode of the system, i.e., the parameters of the linear dynamics, can be switched, according to a…
In principle, all the natural systems such as biological, ecological and economical systems are structure-variable systems (in which some environment parameters are not fixed). In this Letter we show that data sequences from many…
The study of complex systems has produced a huge library of different descriptive statistics that scientists can use to describe the various emergent patterns that characterize complex systems. The problem of engineering systems to display…
Subset Simulation is a Markov chain Monte Carlo method used to compute small failure probabilities in structural reliability problems. This is done by iteratively sampling from nested subsets in the input space of a performance function,…
We study the possibility of varying the measured lifetime of a decaying particle based on the technique of weak value amplification in which an additional filtering process called postselection is performed. Our analysis made in a direct…
Detecting variation in the evolutionary process along chromosomes is increasingly important as whole-genome data becomes more widely available. For example, factors such as incomplete lineage sorting, horizontal gene transfer, and…
Towards a solution to the sign problem in the simulations of systems having indefinite or complex-valued measures, we propose a new approach which yields statistical errors smaller than the crude Monte Carlo using absolute values of the…
The review presents a parameter switching algorithm and his applications which allows numerical approximation of any attractor of a class of continuous-time dynamical systems depending linearly on a real parameter. The considered classes of…
As input distributions evolve over a mission lifetime, maintaining performance of learning-based models becomes challenging. This paper presents a framework to incrementally retrain a model by selecting a subset of test inputs to label,…
In this short paper we introduce a new class of performance measures based on certainty equivalents defined via scaled utility functions. We analyse their properties, show that the corresponding portfolio optimization problem is well-posed…
Like natural complex systems such as the Earth's climate or a living cell, semiconductor lithography systems are characterized by nonlinear dynamics across more than a dozen orders of magnitude in space and time. Thousands of sensors…
An algorithm for the unbiased simulation of continuous max-(resp.\ min-)id stochastic processes is developed. The algorithm only requires the simulation of finite Poisson random measures on the space of continuous functions and avoids the…
To tackle the sign problem in the simulations of systems having indefinite or complex-valued measures, we propose a new approach which yields statistical errors smaller than the crude Monte Carlo using absolute values of the original…
Sequential and temporal data arise in many fields of research, such as quantitative finance, medicine, or computer vision. A novel approach for sequential learning, called the signature method and rooted in rough path theory, is considered.…
This paper addresses the issue of specifying, simulating, and verifying reactive systems in rewriting logic. It presents an executable semantics for probabilistic, timed, and spatial concurrent constraint programming -- here called…
Traditional saliency map methods, popularized in computer vision, highlight individual points (pixels) of the input that contribute the most to the model's output. However, in time series, they offer limited insights, as semantically…
In Computational Science, Engineering and Finance (CSEF) scripts typically serve as the "glue" between potentially highly complex and computationally expensive external subprograms. Differentiability of the resulting programs turns out to…
Verifying safety and liveness over array systems is a highly challenging problem. Array systems naturally capture parameterized systems such as distributed protocols with an unbounded number of processes. Such distributed protocols often…
We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically…