122,580 research outputs found
Building product suggestions for a BIM model based on rule sets and a semantic reasoning engine
The architecture, engineering and construction (AEC) industry today relies on different information systems and computational tools built to support and assist in the building design and construction. However, these systems and tools typically provide this support in isolation from each other. A good combination of these systems and tools is beneficial for a better coordination and information management. Semantic web technologies and a Linked Data approach can be used to fulfil this aim. In this paper, we indicate how these technologies can be applied for one particular objective, namely to check a building information model (BIM) and make suggestions for that model regarding the building elements. These suggestions are based on information obtained from different data sources, including a BIM model, regulations and catalogues of locally available building components. In this paper, we briefly discuss the results obtained in the application of this approach in a case study based on structural safety requirements
Semi-Markov Graph Dynamics
In this paper, we outline a model of graph (or network) dynamics based on two
ingredients. The first ingredient is a Markov chain on the space of possible
graphs. The second ingredient is a semi-Markov counting process of renewal
type. The model consists in subordinating the Markov chain to the semi-Markov
counting process. In simple words, this means that the chain transitions occur
at random time instants called epochs. The model is quite rich and its possible
connections with algebraic geometry are briefly discussed. Moreover, for the
sake of simplicity, we focus on the space of undirected graphs with a fixed
number of nodes. However, in an example, we present an interbank market model
where it is meaningful to use directed graphs or even weighted graphs.Comment: 25 pages, 4 figures, submitted to PLoS-ON
Proceedings of the 3rd Workshop on Domain-Specific Language Design and Implementation (DSLDI 2015)
The goal of the DSLDI workshop is to bring together researchers and
practitioners interested in sharing ideas on how DSLs should be designed,
implemented, supported by tools, and applied in realistic application contexts.
We are both interested in discovering how already known domains such as graph
processing or machine learning can be best supported by DSLs, but also in
exploring new domains that could be targeted by DSLs. More generally, we are
interested in building a community that can drive forward the development of
modern DSLs. These informal post-proceedings contain the submitted talk
abstracts to the 3rd DSLDI workshop (DSLDI'15), and a summary of the panel
discussion on Language Composition
Different approaches to community detection
A precise definition of what constitutes a community in networks has remained
elusive. Consequently, network scientists have compared community detection
algorithms on benchmark networks with a particular form of community structure
and classified them based on the mathematical techniques they employ. However,
this comparison can be misleading because apparent similarities in their
mathematical machinery can disguise different reasons for why we would want to
employ community detection in the first place. Here we provide a focused review
of these different motivations that underpin community detection. This
problem-driven classification is useful in applied network science, where it is
important to select an appropriate algorithm for the given purpose. Moreover,
highlighting the different approaches to community detection also delineates
the many lines of research and points out open directions and avenues for
future research.Comment: 14 pages, 2 figures. Written as a chapter for forthcoming Advances in
network clustering and blockmodeling, and based on an extended version of The
many facets of community detection in complex networks, Appl. Netw. Sci. 2: 4
(2017) by the same author
Compositional Performance Modelling with the TIPPtool
Stochastic process algebras have been proposed as compositional specification formalisms for performance models. In this paper, we describe a tool which aims at realising all beneficial aspects of compositional performance modelling, the TIPPtool. It incorporates methods for compositional specification as well as solution, based on state-of-the-art techniques, and wrapped in a user-friendly graphical front end. Apart from highlighting the general benefits of the tool, we also discuss some lessons learned during development and application of the TIPPtool. A non-trivial model of a real life communication system serves as a case study to illustrate benefits and limitations
Investigating the Cost of Anonymity on Dynamic Networks
In this paper we study the difficulty of counting nodes in a synchronous
dynamic network where nodes share the same identifier, they communicate by
using a broadcast with unlimited bandwidth and, at each synchronous round,
network topology may change. To count in such setting, it has been shown that
the presence of a leader is necessary. We focus on a particularly interesting
subset of dynamic networks, namely \textit{Persistent Distance} - PD, in which each node has a fixed distance from the leader across
rounds and such distance is at most . In these networks the dynamic diameter
is at most . We prove the number of rounds for counting in PD is at least logarithmic with respect to the network size .
Thanks to this result, we show that counting on any dynamic anonymous network
with constant w.r.t. takes at least
rounds where represents the additional cost to be
payed for handling anonymity. At the best of our knowledge this is the fist non
trivial, i.e. different from , lower bounds on counting in anonymous
interval connected networks with broadcast and unlimited bandwith
Organic Design of Massively Distributed Systems: A Complex Networks Perspective
The vision of Organic Computing addresses challenges that arise in the design
of future information systems that are comprised of numerous, heterogeneous,
resource-constrained and error-prone components or devices. Here, the notion
organic particularly highlights the idea that, in order to be manageable, such
systems should exhibit self-organization, self-adaptation and self-healing
characteristics similar to those of biological systems. In recent years, the
principles underlying many of the interesting characteristics of natural
systems have been investigated from the perspective of complex systems science,
particularly using the conceptual framework of statistical physics and
statistical mechanics. In this article, we review some of the interesting
relations between statistical physics and networked systems and discuss
applications in the engineering of organic networked computing systems with
predictable, quantifiable and controllable self-* properties.Comment: 17 pages, 14 figures, preprint of submission to Informatik-Spektrum
published by Springe
- âŠ