557 research outputs found
Linear trees in uniform hypergraphs
Given a tree T on v vertices and an integer k exceeding one. One can define
the k-expansion T^k as a k-uniform linear hypergraph by enlarging each edge
with a new, distinct set of (k-2) vertices. Then T^k has v+ (v-1)(k-2)
vertices. The aim of this paper is to show that using the delta-system method
one can easily determine asymptotically the size of the largest T^k-free
n-vertex hypergraph, i.e., the Turan number of T^k.Comment: Slightly revised, 14 pages, originally presented on Eurocomb 201
Toward a Formal Semantics for Autonomic Components
Autonomic management can improve the QoS provided by parallel/ distributed
applications. Within the CoreGRID Component Model, the autonomic management is
tailored to the automatic - monitoring-driven - alteration of the component
assembly and, therefore, is defined as the effect of (distributed) management
code. This work yields a semantics based on hypergraph rewriting suitable to
model the dynamic evolution and non-functional aspects of Service Oriented
Architectures and component-based autonomic applications. In this regard, our
main goal is to provide a formal description of adaptation operations that are
typically only informally specified. We contend that our approach makes easier
to raise the level of abstraction of management code in autonomic and adaptive
applications.Comment: 11 pages + cover pag
- …