Decentralised control of material or traffic flows in networks using phase-synchronisation

We present a self-organising, decentralised control method for material flows in networks. The concept applies to networks where time sharing mechanisms between conflicting flows in nodes are required and where a coordination of these local switches on a system-wide level can improve the performance. We show that, under certain assumptions, the control of nodes can be mapped to a network of phase-oscillators. By synchronising these oscillators, the desired global coordination is achieved. We illustrate the method in the example of traffic signal control for road networks. The proposed concept is flexible, adaptive, robust and decentralised. It can be transferred to other queuing networks such as production systems. Our control approach makes use of simple synchronisation principles found in various biological systems in order to obtain collective behaviour from local interactions

Modeling a healthcare system as a queueing network:The case of a Belgian hospital.

The performance of health care systems in terms of patient flow times and utilization of critical resources can be assessed through queueing and simulation models. We model the orthopaedic department of the Middelheim hospital (Antwerpen, Belgium) focusing on the impact of outages (preemptive and nonpreemptive outages) on the effective utilization of resources and on the flowtime of patients. Several queueing network solution procedures are developed such as the decomposition and Brownian motion approaches. Simulation is used as a validation tool. We present new approaches to model outages. The model offers a valuable tool to study the trade-off between the capacity structure, sources of variability and patient flow times.Belgium; Brownian motion; Capacity management; Decomposition; Health care; Healthcare; Impact; Model; Models; Performance; Performance measurement; Queueing; Queueing theory; Simulation; Stochastic processes; Structure; Studies; Systems; Time; Tool; Validation; Variability;

Mesoscopic real space structures in aging spin-glasses: the Edwards-Anderson model

Isothermal simulational data for the 3D Edwards-Anderson spin glass are collected at several temperatures below $T_{\rm c}$ and, in analogy with a recent model of dense colloidal suspensions,interpreted in terms of clusters of contiguous spins overturned by quakes, non-equilibrium events linked to record sized energy fluctuations. We show numerically that, to a good approximation, these quakes are statistically independent and constitute a Poisson process whose average grows logarithmically in time. The overturned clusters are local projections on one of the two ground states of the model, and grow likewise logarithmically in time. Data collected at different temperatures $T$ can be collapsed by scaling them with $T^{1.75}$, a hitherto unnoticed feature of the E-A model, which we relate on the one hand to the geometry of configuration space and on the other to experimental memory and rejuvenation effects. The rate at which a cluster flips is shown to decrease exponentially with the size of the cluster, as recently assumed in a coarse grained model of dense colloidal dynamics. The evolving structure of clusters in real space is finally sssociated to the decay of the thermo-remanent magnetization. Our analysis provides an unconventional coarse-grained description of spin glass aging as statistically subordinated to a Poisson quaking process and highlights record dynamics as a viable common theoretical framework for aging in different systems.Comment: 13 pages, 6 figs. Revised text and notation, several typos correcte

Convergence of the Crank-Nicolson-Galerkin finite element method for a class of nonlocal parabolic systems with moving boundaries

The aim of this paper is to establish the convergence and error bounds to the fully discrete solution for a class of nonlinear systems of reaction-diffusion nonlocal type with moving boundaries, using a linearized Crank-Nicolson-Galerkin finite element method with polynomial approximations of any degree. A coordinate transformation which fixes the boundaries is used. Some numerical tests to compare our Matlab code with some existing moving finite elements methods are investigated

Asynchronous Multi-Context Systems

In this work, we present asynchronous multi-context systems (aMCSs), which provide a framework for loosely coupling different knowledge representation formalisms that allows for online reasoning in a dynamic environment. Systems of this kind may interact with the outside world via input and output streams and may therefore react to a continuous flow of external information. In contrast to recent proposals, contexts in an aMCS communicate with each other in an asynchronous way which fits the needs of many application domains and is beneficial for scalability. The federal semantics of aMCSs renders our framework an integration approach rather than a knowledge representation formalism itself. We illustrate the introduced concepts by means of an example scenario dealing with rescue services. In addition, we compare aMCSs to reactive multi-context systems and describe how to simulate the latter with our novel approach.Comment: International Workshop on Reactive Concepts in Knowledge Representation (ReactKnow 2014), co-located with the 21st European Conference on Artificial Intelligence (ECAI 2014). Proceedings of the International Workshop on Reactive Concepts in Knowledge Representation (ReactKnow 2014), pages 31-37, technical report, ISSN 1430-3701, Leipzig University, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-15056