83,239 research outputs found
Satisfaction, Restriction and Amalgamation of Constraints in the Framework of M-Adhesive Categories
Application conditions for rules and constraints for graphs are well-known in
the theory of graph transformation and have been extended already to M-adhesive
transformation systems. According to the literature we distinguish between two
kinds of satisfaction for constraints, called general and initial satisfaction
of constraints, where initial satisfaction is defined for constraints over an
initial object of the base category. Unfortunately, the standard definition of
general satisfaction is not compatible with negation in contrast to initial
satisfaction.
Based on the well-known restriction of objects along type morphisms, we study
in this paper restriction and amalgamation of application conditions and
constraints together with their solutions. In our main result, we show
compatibility of initial satisfaction for positive constraints with restriction
and amalgamation, while general satisfaction fails in general.
Our main result is based on the compatibility of composition via pushouts
with restriction, which is ensured by the horizontal van Kampen property in
addition to the vertical one that is generally satisfied in M-adhesive
categories.Comment: In Proceedings ACCAT 2012, arXiv:1208.430
Metallic tube type energy absorbers: a synopsis
This paper presents an overview of energy absorbers in the form of tubes in which the material used is predominantly mild steel and/or aluminium. A brief summary is also made of frusta type energy absorbers. The common modes of deformation such as lateral and axial compression, indentation and inversion are reviewed. Theoretical, numerical and experimental methods which help to understand the behaviour of such devices under various loading conditions are outlined. Although other forms of energy absorbing materials and structures exist such as composites and honeycombs, this is deemed outside the scope of this review. However, a brief description will be given on these materials. It is hoped that this work will provide a useful platform for researchers and design engineers to gain a useful insight into the progress made over the last few decades in the field of tube type energy absorbers
The Joys of Graph Transformation
We believe that the technique of graph transformation offers a very natural way to specify semantics for languages that have dynamic allocation and linking structure; for instance, object-oriented programming languages, but also languages for mobility. In this note we expose, on a rather informal level, the reasons for this belief. Our hope in doing this is to raise interest in this technique and so generate more interest in the fascinating possibilities and open questions of this area.\u
Towards a navigational logic for graphical structures
One of the main advantages of the Logic of Nested Conditions, defined by Habel and Pennemann, for reasoning about graphs, is its generality: this logic can be used in the framework of many classes of graphs and graphical structures. It is enough that the category of these structures satisfies certain basic conditions.
In a previous paper [14], we extended this logic to be able to deal with graph properties including paths, but this extension was only defined for the category of untyped directed graphs. In addition it seemed difficult to talk about paths abstractly, that is, independently of the given category of graphical structures. In this paper we approach this problem. In particular, given an arbitrary category of graphical structures, we assume that for every object of this category there is an associated edge relation that can be used to define a path relation. Moreover, we consider that edges have some kind of labels and paths can be specified by associating them to a set of label sequences. Then, after the presentation of that general framework, we show how it can be applied to several classes of graphs. Moreover, we present a set of sound inference rules for reasoning in the logic.Peer ReviewedPostprint (author's final draft
Data modelling for emergency response
Emergency response is one of the most demanding phases in disaster management. The fire brigade, paramedics, police and municipality are the organisations involved in the first response to the incident. They coordinate their work based on welldefined policies and procedures, but they also need the most complete and up-todate information about the incident, which would allow a reliable decision-making.\ud
There is a variety of systems answering the needs of different emergency responders, but they have many drawbacks: the systems are developed for a specific sector; it is difficult to exchange information between systems; the systems offer too much or little information, etc. Several systems have been developed to share information during emergencies but usually they maintain the nformation that is coming from field operations in an unstructured way.\ud
This report presents a data model for organisation of dynamic data (operational and situational data) for emergency response. The model is developed within the RGI-239 project ‘Geographical Data Infrastructure for Disaster Management’ (GDI4DM)
Recommended from our members
BDEF : the behavioral design data exchange format
BDDB is a Behavioral Design Data Base that manages the design data produced and consumed by different behavioral synthesis tools. These different design tools retrieve design data from BDDB, manipulate the data, and then store the results back into the data base. BDDB thus needs to address the following two issues: (1) a design data exchange approach and (2) customized design data interfaces. To address the first issue, we have developed a textual description format for describing design data objects and relationships. This language, referred to as the Behavioral Design Data Exchange Format (BDEF), is used as common format for exchanging design data between BDDB and the design tools in the behavioral synthesis environment. To address the second issue, we have developed a behavioral object type description language (generally referred to as schema definition language) for describing the global data structures required by design tools as well as the desired design subviews of this global BDDB design information. One design view class, namely, BDEF, is the topic of this report.In this report we give a formal definition of the BDEF format. Then we describe a comprehensive example of applying BDEF to the behavioral synthesis domain. That is, we present the complete BDEF syntax for the Extended Control/Data Flow Graph Model (ECDFG), which is the design representation model used by most behavioral synthesis tools in the UCI CADLAB synthesis system. We also present several example descriptions of designs using this ECDFG model. A parser/graph compiler from BDEF into the generalized ECDFG design representation as well as a BDEF generator from the ECDFG data structures into the BDEF format have been implemented
Exploring the potential for cross-nesting structures in airport-choice analysis: A case-study of the Greater London area
The analysis of air-passengers’ choices of departure airport in multi-airport regions is a crucial component of transportation planning in many large metropolitan areas, and has been the topic of an increasing number of studies over recent years. In this paper, we advance the state of the art of modelling in this area of research by making use of a Cross-Nested Logit (CNL) structure that allows for the joint representation of inter-alternative correlation along the three choice dimensions of airport, airline and access-mode. The analysis uses data collected in the Greater London area, which arguably has the highest levels of inter-airport competition of any multi-airport region; the authors of this paper are not aware of any previous effort to jointly analyse the choice of airport, airline and access-mode in this area. The results of the analysis reveal significant influences on passenger behaviour by access-time, access-cost, flight-frequency and flight-time. A structural comparison of the different models shows that the cross-nested structure offers significant improvements over simple Nested Logit (NL) models, which in turn outperform the Multinomial Logit (MNL) model used as the base model
- …