Sparsity-Sensitive Finite Abstraction

Abstraction of a continuous-space model into a finite state and input dynamical model is a key step in formal controller synthesis tools. To date, these software tools have been limited to systems of modest size (typically $\leq$ 6 dimensions) because the abstraction procedure suffers from an exponential runtime with respect to the sum of state and input dimensions. We present a simple modification to the abstraction algorithm that dramatically reduces the computation time for systems exhibiting a sparse interconnection structure. This modified procedure recovers the same abstraction as the one computed by a brute force algorithm that disregards the sparsity. Examples highlight speed-ups from existing benchmarks in the literature, synthesis of a safety supervisory controller for a 12-dimensional and abstraction of a 51-dimensional vehicular traffic network

Abstraction in decision-makers with limited information processing capabilities

A distinctive property of human and animal intelligence is the ability to form abstractions by neglecting irrelevant information which allows to separate structure from noise. From an information theoretic point of view abstractions are desirable because they allow for very efficient information processing. In artificial systems abstractions are often implemented through computationally costly formations of groups or clusters. In this work we establish the relation between the free-energy framework for decision making and rate-distortion theory and demonstrate how the application of rate-distortion for decision-making leads to the emergence of abstractions. We argue that abstractions are induced due to a limit in information processing capacity.Comment: Presented at the NIPS 2013 Workshop on Planning with Information Constraint

SCOR: Software-defined Constrained Optimal Routing Platform for SDN

A Software-defined Constrained Optimal Routing (SCOR) platform is introduced as a Northbound interface in SDN architecture. It is based on constraint programming techniques and is implemented in MiniZinc modelling language. Using constraint programming techniques in this Northbound interface has created an efficient tool for implementing complex Quality of Service routing applications in a few lines of code. The code includes only the problem statement and the solution is found by a general solver program. A routing framework is introduced based on SDN's architecture model which uses SCOR as its Northbound interface and an upper layer of applications implemented in SCOR. Performance of a few implemented routing applications are evaluated in different network topologies, network sizes and various number of concurrent flows.Comment: 19 pages, 11 figures, 11 algorithms, 3 table

Excitable Media Seminar

The simulation data presented here, and the conceptual framework developed for their interpretation are, both, in need of substantial refinement and extension. However, granting that they are initial pointers of some merit, and elementary indicators of general principles, several implications follow: the activity patterns of neurons and their assemblies are\ud interdependent with the extracellular milieu in which they are embedded, and to whose time varying composition they contribute. The complexity of this interdependence in the temporal dimension forecloses any time and context invariant relation between what the experimenter may consider stimulus input and its representation in neural activity. Hence, ideas of coding by (quasi)-digital neurons are called in question by the mutual interdependence of neurons and their\ud humoral milieu. Instead, concepts of 'mass action' in the Nervous system gain a new perspective: this time augmented by including the chemical medium surrounding neurons as part of the dynamics of the system as a whole. Accordingly, a meaningful way to describe activity in a neuron assembly would be in terms of a state space in which it can move along an infinite number of trajectories.\u