Filetype
Automated cryptanalysis has seen a lot of attraction and success in the past decade, leading to new distinguishers or key-recovery attacks against various ciphers. We argue that the improved efficiency and usability of these new tools have been undervalued, especially for design processes. In this article, we break for the first time the classical iterative design paradigm for symmetric-key primit
There is a large variability between individuals in the response to anesthetic drugs, that seriously limits the achievable performance of closed-loop controlled drug dosing. Full individualization of patient models based on early clinical response data has been suggested as a means to improve performance with maintained robustness (safety). We use estimation theoretic analysis and realization theo
Numerous modelling efforts have attempted to characterize the effects of different non-pharmaceutical interventions (NPIs) on the Covid-19 spread. Arguably the most famous is one published in Nature by an Imperial College group. A slight variation of it was later published in Science by a group of Oxford researchers. Both publications are based on hierarchical Bayesian modelling that aims to expla
Novel methods for the inference of radiation intensityfunctions defined over known surfaces are proposed, intendedfor use in surveying applications with mobile spectrometers.Previous approaches, based on the maximum likelihoodexpectation maximization (ML-EM) framework with Poissonlikelihoods, are extended to better handle spatially continuousintensity statistics using ideas from Gaussian filtering
This article addresses the distributed cooperative control design for a class of sampled-data teleoperation systems with multiple slave mobile manipulators grasping an object in the presence of communication bandwidth limitation and time delays. Discrete-time information transmission with time-varying delays is assumed, and the Round-Robin (RR) scheduling protocol is used to regulate the data tran
A 32 Kb dual-port low-voltage SRAM in 28 nm FD-SOI, featuring foundry supplied high-density 6T bitcells, is presented. Dual-port configurability is realized by a unique dual-rail architecture, utilizing boost techniques that guarantee reliable operation in low-voltage. The area cost of the array is 62% lower, compared to widely used 8T two-port or dual-port SRAM arrays. The SRAM reliably operates
ControlSystems.jl enables the powerful features of the Julia language to be leveraged for control design and analysis.The toolbox provides types for state-space, transfer-function, and time-delay models, together with algorithms for design and analysis.Julia's mathematically-oriented syntax is convenient for implementing control algorithms, and its just-in-time compilation gives performance on par
AI solutions seem to appear in any and all application domains. As AI becomes more pervasive, the importance of quality assurance increases. Unfortunately, there is no consensus on what artificial intelligence means and interpretations range from simple statistical analysis to sentient humanoid robots. On top of that, quality is a notoriously hard concept to pinpoint. What does this mean for AI qu
In inverse optimal control, an optimal controller is synthesized with respect to a meaningful, a posteriori defined, cost functional. Our work illustrates the usefulness of this approach in the control of converter-based power systems and networked systems in general, and thereby in finding controllers with topological structure and known optimality properties. In particular, we design an inverse
Low-rank inducing unitarily invariant norms have been introduced to convexify problems with a low-rank/sparsity constraint. The most well-known member of this family is the so-called nuclear norm. To solve optimization problems involving such norms with proximal splitting methods, efficient ways of evaluating the proximal mapping of the low-rank inducing norms are needed. This is known for the nuc
We prove that for k ≫; 4√n regular resolution requires length nω(k) to establish that an ErdÅ's-Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent and also implies unconditional nω(k) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.
Engineers require high-quality data for the design and implementation of today’s software, especially in the context of machine learning (ML). This puts an emphasis on the need for the publication and sharing of data from and between organizations, public as well as private. Following the paradigm of open innovation, open data provide a mechanism to increase the availability of information, offeri
State estimators are crucial components of anomaly detectors that are used to monitor cyber-physical systems. Many frequently-used state estimators are suscepti- ble to model risk as they rely critically on the availability of an accurate state-space model. Modeling errors make it more difficult to distinguish whether deviations from expected behavior are due to anomalies or simply a lack of knowl
In order to improve the energy efficiency in district heating networks and the comfort of their customers, these networks need to overcome the problem of unfair heat distribution under heat deficits. This paper introduces a new strategy to achieve this thermal fairness objective: it is lowcost in terms of communication and computation. The proposed approach is illustrated on a simulation example.
Whilst network coordination games and network anti-coordination games have received a considerable amount of attention in the literature, network games with coexisting coordinating and anti-coordinating players are known to exhibit more complex behaviors. In fact, depending on the network structure, such games may even fail to have pure-strategy Nash equilibria. An example is represented by the we
We study extensions of the classical SIR model of epidemic spread. First, we consider a single population modified SIR epidemics model in which the contact rate is allowed to be an arbitrary function of the fraction of susceptible and infected individuals. This allows one to model either the reaction of individuals to the information about the spread of the disease or the result of government rest
The Bonacich centrality is a well-known measure of the relative importance of nodes in a network. This notion is, for example, at the core of Google’s Page Rank algorithm. In this paper we study a network formation game where each player corresponds to a node in the network to be formed. The action of a player consists in the assignment of m out-links and his utility is his own Bonacich centrality
We study deterministic continuous-time lossy dynamical flow networks with constant exogenous demands, fixed routing, and finite flow and buffer capacities. In the considered model, when the total net flow in a cell —consisting of the difference between the total flow directed towards it minus the outflow from it— exceeds a certain capacity constraint, then the exceeding part of it leaks out of the
