2,874 research outputs found
Continuous cellular automata on irregular tessellations : mimicking steady-state heat flow
Leaving a few exceptions aside, cellular automata (CA) and the intimately related coupled-map lattices (CML), commonly known as continuous cellular automata (CCA), as well as models that are based upon one of these paradigms, employ a regular tessellation of an Euclidean space in spite of the various drawbacks this kind of tessellation entails such as its inability to cover surfaces with an intricate geometry, or the anisotropy it causes in the simulation results. Recently, a CCA-based model describing steady-state heat flow has been proposed as an alternative to Laplace's equation that is, among other things, commonly used to describe this process, yet, also this model suffers from the aforementioned drawbacks since it is based on the classical CCA paradigm. To overcome these problems, we first conceive CCA on irregular tessellations of an Euclidean space after which we show how the presented approach allows a straightforward simulation of steady-state heat flow on surfaces with an intricate geometry, and, as such, constitutes an full-fledged alternative for the commonly used and easy-to-implement finite difference method, and the more intricate finite element method
Tracking uncertainty in a spatially explicit susceptible-infected epidemic model
In this paper we conceive an interval-valued continuous cellular automaton for describing the spatio-temporal dynamics of an epidemic, in which the magnitude of the initial outbreak and/or the epidemic properties are only imprecisely known. In contrast to well-established approaches that rely on probability distributions for keeping track of the uncertainty in spatio-temporal models, we resort to an interval representation of uncertainty. Such an approach lowers the amount of computing power that is needed to run model simulations, and reduces the need for data that are indispensable for constructing the probability distributions upon which other paradigms are based
On the decomposition of stochastic cellular automata
In this paper we present two interesting properties of stochastic cellular
automata that can be helpful in analyzing the dynamical behavior of such
automata. The first property allows for calculating cell-wise probability
distributions over the state set of a stochastic cellular automaton, i.e.
images that show the average state of each cell during the evolution of the
stochastic cellular automaton. The second property shows that stochastic
cellular automata are equivalent to so-called stochastic mixtures of
deterministic cellular automata. Based on this property, any stochastic
cellular automaton can be decomposed into a set of deterministic cellular
automata, each of which contributes to the behavior of the stochastic cellular
automaton.Comment: Submitted to Journal of Computation Science, Special Issue on
Cellular Automata Application
Identification of cellular automata based on incomplete observations with bounded time gaps
In this paper, the problem of identifying the cellular automata (CAs) is considered. We frame and solve this problem in the context of incomplete observations, i.e., prerecorded, incomplete configurations of the system at certain, and unknown time stamps. We consider 1-D, deterministic, two-state CAs only. An identification method based on a genetic algorithm with individuals of variable length is proposed. The experimental results show that the proposed method is highly effective. In addition, connections between the dynamical properties of CAs (Lyapunov exponents and behavioral classes) and the performance of the identification algorithm are established and analyzed
Analysis of a batch-service queue with variable service capacity, correlated customer types and generally distributed class-dependent service times
Queueing models with batch service have been studied frequently, for instance in the domain of telecommunications or manufacturing. Although the batch server's capacity may be variable in practice, only a few authors have included variable capacity in their models. We analyse a batch server with multiple customer classes and a variable service capacity that depends on both the number of waiting customers and their classes. The service times are generally distributed and class-dependent. These features complicate the analysis in a non-trivial way. We tackle it by examining the system state at embedded points, and studying the resulting Markov Chain.
We first establish the joint probability generating function (pgf) of the service capacity and the number of customers left behind in the queue immediately after service initiation epochs. From this joint pgf, we extract the pgf for the number of customers in the queue and in the system respectively at service initiation epochs and departure epochs, and the pgf of the actual server capacity. Combined with additional techniques, we also obtain the pgf of the queue and system content at customer arrival epochs and random slot boundaries, and the pgf of the delay of a random customer. In the numerical experiments, we focus on the impact of correlation between the classes of consecutive customers, and on the influence of different service time distributions on the system performance. (C) 2019 Elsevier B.V. All rights reserved
An evolutionary approach to the identification of Cellular Automata based on partial observations
In this paper we consider the identification problem of Cellular Automata
(CAs). The problem is defined and solved in the context of partial observations
with time gaps of unknown length, i.e. pre-recorded, partial configurations of
the system at certain, unknown time steps. A solution method based on a
modified variant of a Genetic Algorithm (GA) is proposed and illustrated with
brief experimental results.Comment: IEEE CEC 201
Delay analysis of a two-class batch-service queue with class-dependent variable server capacity
In this paper, we analyse the delay of a random customer in a two-class batch-service queueing model with variable server capacity, where all customers are accommodated in a common single-server first-come-first-served queue. The server can only process customers that belong to the same class, so that the size of a batch is determined by the length of a sequence of same-class customers. This type of batch server can be found in telecommunications systems and production environments. We first determine the steady state partial probability generating function of the queue occupancy at customer arrival epochs. Using a spectral decomposition technique, we obtain the steady state probability generating function of the delay of a random customer. We also show that the distribution of the delay of a random customer corresponds to a phase-type distribution. Finally, some numerical examples are given that provide further insight in the impact of asymmetry and variance in the arrival process on the number of customers in the system and the delay of a random customer
An analysis of a batch server with variable and class-dependent service capacity
In many studies on batch service queueing systems, the service capacity is assumed to
be constant. However, this service capacity often depends on the content of the queue. In
this paper, we analyse a discrete-time single server batch server queue with general inde-
pendent arrivals. We distinguish two dierent classes in the arrival stream and products of
both classes are added to the tail of a single queue. The single batch server can group all
waiting customers at the head of the queue that belong to the same product class up to
a certain class-dependent maximum capacity. This results in a stochastic service capacity
that depends on both the number of customers in the queue and their respective classes.
Since it is clear that the length of a sequence of same-class customers will have a signicant
impact on the performance of the system, we also include correlation between the classes
of consecutive customers. Applications of this type of batch server can, for instance, be
found in the pacemaker loop of a Lean manufacturing system. In the course of the analysis,
we calculate the probability generating function of the system occupancy at service initi-
ation opportunities. In the numerical experiments, we will look at the impact of dierent
parameters on both the mean system occupancy and the probability that the server is idle
at a random service initiation opportunity. We also provide a number of guidelines to pick
between the exact solution and an approximated approach with unlimited service capacities,
by looking at the trade-o between accuracy and computational complexity
Delay analysis of a variable-capacity batch-server queue with general class-dependent service times
In manufacturing, a batch server groups multiple customers that require the same type of service based on a specific characteristic, such as temperature or destination. In this paper, we extend previous work with the analysis of the delay in a variable-capacity batch-service queueing system with general class-dependent service times and customer-based correlation in the arrival process. The impact of asymmetry and correlation in the arrival process on the mean delay of a random customer and the tail distribution of the delay is investigated as well
- …