2,094 research outputs found
Persistence of complex food webs in metacommunities
Metacommunity theory is considered a promising approach for explaining
species diversity and food web complexity. Recently Pillai et al. proposed a
simple modeling framework for the dynamics of food webs at the metacommunity
level. Here, we employ this framework to compute general conditions for the
persistence of complex food webs in metacommunities. The persistence conditions
found depend on the connectivity of the resource patches and the structure of
the assembled food web, thus linking the underlying spatial patch-network and
the species interaction network. We find that the persistence of omnivores is
more likely when it is feeding on (a) prey on low trophic levels, and (b) prey
on similar trophic levels
Stadtökologie und Stadtplanung
Wissenschaftliches Kolloquium vom 24. bis 26. Juni 1986 in Weimar an der Hochschule für Architektur und Bauwesen zum Thema: 'Der wissenschaftlich-technische Fortschritt und die sozial-kulturellen Funktionen von Architektur und industrieller Formgestaltung in unserer Epoche
Early fragmentation in the adaptive voter model on directed networks
We consider voter dynamics on a directed adaptive network with fixed
out-degree distribution. A transition between an active phase and a fragmented
phase is observed. This transition is similar to the undirected case if the
networks are sufficiently dense and have a narrow out-degree distribution.
However, if a significant number of nodes with low out degree is present, then
fragmentation can occur even far below the estimated critical point due to the
formation of self-stabilizing structures that nucleate fragmentation. This
process may be relevant for fragmentation in current political opinion
formation processes.Comment: 9 pages, 8 figures as published in Phys. Rev.
Encoding monomorphic and polymorphic types
Many automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter when translating monomorphic to un-typed first-order logic. Here we pursue this approach systematically, analysing formally a variety of encodings that further improve on efficiency while retaining soundness and completeness. We extend the approach to rank-1 polymorphism and present alternative schemes that lighten the translation of polymorphic symbols based on the novel notion of “cover”. The new encodings are implemented in Isabelle/HOL as part of the Sledgehammer tool. We include informal proofs of soundness and correctness, and have formalized the monomorphic part of this work in Isabelle/HOL. Our evaluation finds the new encodings vastly superior to previous schemes
Encoding monomorphic and polymorphic types
Most automatic theorem provers are restricted to untyped logics, and existing translations from typed logics are bulky or unsound. Recent research proposes monotonicity as a means to remove some clutter. Here we pursue this approach systematically, analysing formally a variety of encodings that further improve on efficiency while retaining soundness and completeness. We extend the approach to rank-1 polymorphism and present alternative schemes that lighten
the translation of polymorphic symbols based on the novel notion of “cover”. The new encodings are implemented, and partly proved correct, in Isabelle/HOL. Our evaluation finds them vastly superior to previous schemes
Counterion condensation and effective charge of PAMAM dendrimers
PAMAM dendrimers are used as a model system to investigate the effects of counterion condensation and the effective charge for spherical polyelectrolytes. Because of their amino groups, PAMAM dendrimers are weak polyelectrolytes. Lowering the pH results in an increasing protonation of the amino groups which is monitored via the proton chemical shifts of the adjacent CH2 groups. The effective charge is determined from a combination of diffusion and electrophoresis NMR. The fraction of the charges, which are effective for the interaction with an external electric field or other charges, decreases with increasing generation (size) of the dendrimers
List precoloring extension in planar graphs
A celebrated result of Thomassen states that not only can every planar graph
be colored properly with five colors, but no matter how arbitrary palettes of
five colors are assigned to vertices, one can choose a color from the
corresponding palette for each vertex so that the resulting coloring is proper.
This result is referred to as 5-choosability of planar graphs. Albertson asked
whether Thomassen's theorem can be extended by precoloring some vertices which
are at a large enough distance apart in a graph. Here, among others, we answer
the question in the case when the graph does not contain short cycles
separating precolored vertices and when there is a "wide" Steiner tree
containing all the precolored vertices.Comment: v2: 15 pages, 11 figres, corrected typos and new proof of Theorem
3(2
A Proof Strategy Language and Proof Script Generation for Isabelle/HOL
We introduce a language, PSL, designed to capture high level proof strategies
in Isabelle/HOL. Given a strategy and a proof obligation, PSL's runtime system
generates and combines various tactics to explore a large search space with low
memory usage. Upon success, PSL generates an efficient proof script, which
bypasses a large part of the proof search. We also present PSL's monadic
interpreter to show that the underlying idea of PSL is transferable to other
ITPs.Comment: This paper has been submitted to CADE2
XWeB: the XML Warehouse Benchmark
With the emergence of XML as a standard for representing business data, new
decision support applications are being developed. These XML data warehouses
aim at supporting On-Line Analytical Processing (OLAP) operations that
manipulate irregular XML data. To ensure feasibility of these new tools,
important performance issues must be addressed. Performance is customarily
assessed with the help of benchmarks. However, decision support benchmarks do
not currently support XML features. In this paper, we introduce the XML
Warehouse Benchmark (XWeB), which aims at filling this gap. XWeB derives from
the relational decision support benchmark TPC-H. It is mainly composed of a
test data warehouse that is based on a unified reference model for XML
warehouses and that features XML-specific structures, and its associate XQuery
decision support workload. XWeB's usage is illustrated by experiments on
several XML database management systems
- …