341 research outputs found
Finite Computational Structures and Implementations
What is computable with limited resources? How can we verify the correctness
of computations? How to measure computational power with precision? Despite the
immense scientific and engineering progress in computing, we still have only
partial answers to these questions. In order to make these problems more
precise, we describe an abstract algebraic definition of classical computation,
generalizing traditional models to semigroups. The mathematical abstraction
also allows the investigation of different computing paradigms (e.g. cellular
automata, reversible computing) in the same framework. Here we summarize the
main questions and recent results of the research of finite computation.Comment: 12 pages, 3 figures, will be presented at CANDAR'16 and final version
published by IEEE Computer Societ
Encrypted control for networked systems -- An illustrative introduction and current challenges
Cloud computing and distributed computing are becoming ubiquitous in many
modern control systems such as smart grids, building automation, robot swarms
or intelligent transportation systems. Compared to "isolated" control systems,
the advantages of cloud-based and distributed control systems are, in
particular, resource pooling and outsourcing, rapid scalability, and high
performance. However, these capabilities do not come without risks. In fact,
the involved communication and processing of sensitive data via public networks
and on third-party platforms promote, among other cyberthreats, eavesdropping
and manipulation of data. Encrypted control addresses this security gap and
provides confidentiality of the processed data in the entire control loop. This
paper presents a tutorial-style introduction to this young but emerging field
in the framework of secure control for networked dynamical systems.Comment: The paper is a preprint of an accepted paper in the IEEE Control
Systems Magazin
Application of system theory to power processing problems
The work in power processing is reported. Input-output models, and Lie groups in control theory are discussed along with the methods of analysis for time invariant electrical networks
Privacy-Preserving Methods for Sharing Financial Risk Exposures
Unlike other industries in which intellectual property is patentable, the
financial industry relies on trade secrecy to protect its business processes
and methods, which can obscure critical financial risk exposures from
regulators and the public. We develop methods for sharing and aggregating such
risk exposures that protect the privacy of all parties involved and without the
need for a trusted third party. Our approach employs secure multi-party
computation techniques from cryptography in which multiple parties are able to
compute joint functions without revealing their individual inputs. In our
framework, individual financial institutions evaluate a protocol on their
proprietary data which cannot be inverted, leading to secure computations of
real-valued statistics such a concentration indexes, pairwise correlations, and
other single- and multi-point statistics. The proposed protocols are
computationally tractable on realistic sample sizes. Potential financial
applications include: the construction of privacy-preserving real-time indexes
of bank capital and leverage ratios; the monitoring of delegated portfolio
investments; financial audits; and the publication of new indexes of
proprietary trading strategies
On commutative asynchronous nondeterministic automata
In this paper, we deal with nondeterministic automata, in particular, commutative asynchronous ones. Our goal is to give their isomorphic representation under the serial product or equivalently, under the α0-product. It turns out that this class does not contain any finite isomorphically complete system with respect to the α0-product. On the other hand, we present an isomorphically complete system for this class which consists of one monotone nondeterministic automaton of three elements
- …