11,320 research outputs found
Degree Variance and Emotional Strategies Catalyze Cooperation in Dynamic Signed Networks
We study the problem of the emergence of cooperation in dynamic signed
networks where agent strategies coevolve with relational signs and network
topology. Running simulations based on an agent-based model, we compare results
obtained in a regular lattice initialization with those obtained on a
comparable random network initialization. We show that the increased degree
heterogeneity at the outset enlarges the parametric conditions in which
cooperation survives in the long run. Furthermore, we show how the presence of
sign-dependent emotional strategies catalyze the evolution of cooperation with
both network topology initializations.Comment: 16 Pages, Proceeding of the European Conference on Modelling and
Simumatio
Refactorings of Design Defects using Relational Concept Analysis
Software engineers often need to identify and correct design defects, ıe} recurring design problems that hinder development and maintenance\ud
by making programs harder to comprehend and--or evolve. While detection\ud
of design defects is an actively researched area, their correction---mainly\ud
a manual and time-consuming activity --- is yet to be extensively\ud
investigated for automation. In this paper, we propose an automated\ud
approach for suggesting defect-correcting refactorings using relational\ud
concept analysis (RCA). The added value of RCA consists in exploiting\ud
the links between formal objects which abound in a software re-engineering\ud
context. We validated our approach on instances of the <span class='textit'></span>Blob\ud
design defect taken from four different open-source programs
Kleene algebra with domain
We propose Kleene algebra with domain (KAD), an extension of Kleene algebra
with two equational axioms for a domain and a codomain operation, respectively.
KAD considerably augments the expressiveness of Kleene algebra, in particular
for the specification and analysis of state transition systems. We develop the
basic calculus, discuss some related theories and present the most important
models of KAD. We demonstrate applicability by two examples: First, an
algebraic reconstruction of Noethericity and well-foundedness; second, an
algebraic reconstruction of propositional Hoare logic.Comment: 40 page
Taylor's modularity conjecture and related problems for idempotent varieties
We provide a partial result on Taylor's modularity conjecture, and several
related problems. Namely, we show that the interpretability join of two
idempotent varieties that are not congruence modular is not congruence modular
either, and we prove an analogue for idempotent varieties with a cube term.
Also, similar results are proved for linear varieties and the properties of
congruence modularity, having a cube term, congruence -permutability for a
fixed , and satisfying a non-trivial congruence identity.Comment: 27 page
The Kinetic Basis of Self-Organized Pattern Formation
In his seminal paper on morphogenesis (1952), Alan Turing demonstrated that
different spatio-temporal patterns can arise due to instability of the
homogeneous state in reaction-diffusion systems, but at least two species are
necessary to produce even the simplest stationary patterns. This paper is aimed
to propose a novel model of the analog (continuous state) kinetic automaton and
to show that stationary and dynamic patterns can arise in one-component
networks of kinetic automata. Possible applicability of kinetic networks to
modeling of real-world phenomena is also discussed.Comment: 8 pages, submitted to the 14th International Conference on the
Synthesis and Simulation of Living Systems (Alife 14) on 23.03.2014, accepted
09.05.201
- …