Entity

Time filter

Source Type


Pake A.D.B.,ABB | Schumacher J.M.,Centrum voor Wiskunde en Informatica
European Control Conference, ECC 1999 - Conference Proceedings | Year: 2015

In this paper a problem of industrial interest is presented: the control of an industrial gas compressor. The main feature of the problem is that the throughput of a gas compressor is limited both above and below. When the compressor should supply a lower flow rate, an additional valve must be opened. Thus the controller has a natural two-mode structure, making it particularly suited for hybrid control. A model of the gas compressor system and a hybrid controller are presented. Some simulations results are presented, showing that the proposed controller performs well, even under rapid changes in the boundary conditions. © 1999 EUCA. Source


Su R.,TU Eindhoven | van Schuppen J.H.,Centrum voor Wiskunde en Informatica | Rooda J.E.,TU Eindhoven | Hofkamp A.T.,TU Eindhoven
Automatica | Year: 2010

In Ramadge-Wonham supervisory control theory we often need to check nonconflict of plants and corresponding synthesized supervisors. For a large system such a check imposes a great computational challenge because of the complexity incurred by the composition of plants and supervisors. In this paper we present a novel procedure based on automaton abstractions, which removes internal transitions of relevant automata at each step, allowing the nonconflict check to be performed on relatively small automata, even though the original product system can be fairly large. © 2010 Elsevier Ltd. All rights reserved. Source


Kiltz E.,Centrum voor Wiskunde en Informatica | O'Neill A.,Georgia Institute of Technology | Smith A.,Pennsylvania State University
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2010

We show that the widely deployed RSA-OAEP encryption scheme of Bellare and Rogaway (Eurocrypt 1994), which combines RSA with two rounds of an underlying Feistel network whose hash (i.e., round) functions are modeled as random oracles, meets indistinguishability under chosen-plaintext attack (IND-CPA) in the standard model based on simple, non-interactive, and non-interdependent assumptions on RSA and the hash functions. To prove this, we first give a result on a more general notion called "padding-based" encryption, saying that such a scheme is IND-CPA if (1) its underlying padding transform satisfies a "fooling" condition against small-range distinguishers on a class of high-entropy input distributions, and (2) its trapdoor permutation is sufficiently lossy as defined by Peikert and Waters (STOC 2008). We then show that the first round of OAEP satifies condition (1) if its hash function is t-wise independent for appopriate t and that RSA satisfies condition (2) under the Φ-Hiding Assumption of Cachin et al. (Eurocrypt 1999). This appears to be the first non-trivial positive result about the instantiability of RSA-OAEP. In particular, it increases our confidence that chosen-plaintext attacks are unlikely to be found against the scheme. In contrast, RSA-OAEP's predecessor in PKCS #1 v1.5 was shown to be vulnerable to such attacks by Coron et al. (Eurocrypt 2000). © 2010 Springer-Verlag Berlin Heidelberg. Source


Segers H.,University of Antwerp | Palenstijn W.J.,University of Antwerp | Batenburg K.J.,Centrum voor Wiskunde en Informatica | Sijbers J.,University of Antwerp
Fundamenta Informaticae | Year: 2013

Discrete tomography (DT) is concerned with the tomographic reconstruction of images that consist of only a small number of grey levels. Recently, DART, a practical algorithm was introduced for discrete tomography, which was validated in the domain of X-ray computed and electron tomography. In this paper, DART is introduced for magnetic resonance imaging. Using simulation experiments, it is shown that the proposed MRI-DART algorithm is capable of computing high quality reconstructions from substantially fewer data compared to state-of-the-art MRI reconstruction methods. Source


Petreczky M.,Maastricht University | van Schuppen J.H.,Centrum voor Wiskunde en Informatica
Systems and Control Letters | Year: 2010

In this paper we introduce the novel concept of a hybrid generating series and show that continuous state and output trajectories of bilinear hybrid systems can be described in terms of these series. The results represent an extension of the Fliess-series expansion for bilinear systems to hybrid systems. © 2010 Elsevier B.V. All rights reserved. Source

Discover hidden collaborations