We present results from applying information theory based measures to simulated robots controlled by evolved Genetic Regulatory Networks. Measuring the information flow across sensory and effector surfaces, we create an information profile illustrated using area-proportional Venn diagrams. We examine the relationship between this information profile and various elements of the overall system in...

In this paper, we develop new methods for the analysis of decentralized control systems and we apply them to formation control problems. The basic set-up consists of a system with multiple agents represented by the nodes of a directed graph whose edges represent an available communication channel for the agents. We address the question of whether the information flow defined by the graph is suf...

Novel approaches for dynamic information flow monitoring are promising since they enable permissive (accepting a large subset of executions) yet sound (rejecting all unsecure executions) enforcement of non-interference. In this paper, we present a dynamic information flow monitor for a language supporting pointers. Our flow-sensitive monitor relies on prior static analysis in order to soundly e...

Computer security is a constant issue for computer systems; thus, many schemes have been proposed to stop specific attacks. In this paper, we present a software implementation of the Dynamic Information Flow Tracking (DIFT) system which is designed to stop a broad range of control flow attacks [9]. We modified the SimpleScalar/PISA simulator (v.3.0) to include an extended instruction set implem...

Drawings of water are the earliest, least abstract forms of flow diagram. Representations of ideal or generalised sequences for manufacturing or actual paths for materials between machines came next. Subsequently documentation of production and information flow become subjects for graphical representation. A similar level of abstraction was necessary for representations of invisible flows such ...

In this paper we introduce a new kind of flow networks, called flow graphs, different to that proposed by Ford and Fulkerson. Flow graphs are meant to be used as a mathematical tool to analysis of information flow in decision algorithms, in contrast to material flow optimization considered in classical flow network analysis. In the proposed approach branches of the flow graph are interpreted as...

Evaluating safety impacts of network planning alternatives have a potential to improve safety in a proactive manner at the system level and at a minor cost of additional analysis. This paper presents a computer-implemented GIS-based method of predicting safety for planning alternatives. Although applicable to large road networks, the method predicts crashes at the road facility level (intersect...

The contents of this thesis can be separated into two distinct divisions. The first is concerned with the development of a general theory of decomposition algorithms for optimization problems. The second develops an application of the methodology of the decomposition theory to a decentralized linear stochastic control problem. An indirect approach to the development of the theory of decompositi...

Many cryptographic schemes have been designed to enforce information flow policies. However, enterprise security requirements are often better encoded, or can only be encoded, using role-based access control policies rather than information flow policies. In this paper, we provide an alternative formulation of role-based access control that enables us to apply existing cryptographic schemes to ...

To gain competitive advantage, hospitals try to streamline their processes. In order to do so, it is essential to have an accurate view of the “careflows” under consideration. In this paper, we apply process mining techniques to obtain meaningful knowledge about these flows, e.g., to discover typical paths followed by particular groups of patients. This is a non-trivial task given the dynamic n...