Refine
Has Fulltext
- yes (7)
Is part of the Bibliography
- yes (7)
Document Type
- Doctoral Thesis (3)
- Journal article (2)
- Preprint (2)
Language
- English (7) (remove)
Keywords
- complexity (7) (remove)
Why is our universe so fine-tuned? In this preprint we discuss that this is not a strange accident but that fine-tuned universes can be considered to be exceedingly large if one counts the number of observable different states (i.e. one aspect of the more general preprint http://www.opus-bayern.de/uni-wuerzburg/volltexte/2009/3353/). Looking at parameter variation for the same set of physical laws simple and complex processes (including life) and worlds in a multiverse are compared in simple examples. Next the anthropocentric principle is extended as many conditions which are generally interpreted anthropocentric only ensure a large space of different system states. In particular, the observed over-tuning beyond the level for our existence is explainable by these system considerations. More formally, the state space for different systems becomes measurable and comparable looking at their output behaviour. We show that highly interacting processes are more complex then Chaitin complexity, the latter denotes processes not compressible by shorter descriptions (Kolomogorov complexity). The complexity considerations help to better study and compare different processes (programs, living cells, environments and worlds) including dynamic behaviour and can be used for model selection in theoretical physics. Moreover, the large size (in terms of different states) of a world allowing complex processes including life can in a model calculation be determined applying discrete histories from quantum spin-loop theory. Nevertheless there remains a lot to be done - hopefully the preprint stimulates further efforts in this area.
The complexity of membership problems for finite recurrent systems and minimal triangulations
(2006)
The dissertation thesis studies the complexity of membership problems. Generally, membership problems consider the question whether a given object belongs to a set. Object and set are part of the input. The thesis studies the complexity of membership problems for two special kinds of sets. The first problem class asks whether a given natural number belongs to a set of natural numbers. The set of natural numbers is defined via finite recurrent systems: sets are built by iterative application of operations, like union, intersection, complementation and arithmetical operations, to already defined sets. This general problem implies further problems by restricting the set of used operations. The thesis contains completeness results for well-known complexity classes as well as undecidability results for these problems. The second problem class asks whether a given graph is a minimal triangulation of another graph. A graph is a triangulation of another graph, if it is a chordal spanning supergraph of the second graph. If no proper supergraph of the first graph is a triangulation of the second graph, the first graph is a minimal triangulation of the second graph. The complexity of the membership problem for minimal triangulations of several graph classes is investigated. Restricted variants are solved by linear-time algorithms. These algorithms rely on appropriate characterisations of minimal triangulations.
In a nice assay published in Nature in 1993 the physicist Richard God III started from a human observer and made a number of witty conclusions about our future prospects giving estimates for the existence of the Berlin Wall, the human race and all the rest of the universe. In the same spirit, we derive implications for "the meaning of life, the universe and all the rest" from few principles. Adams´ absurd answer "42" tells the lesson "garbage in / garbage out" - or suggests that the question is non calculable. We show that experience of "meaning" and to decide fundamental questions which can not be decided by formal systems imply central properties of life: Ever higher levels of internal representation of the world and an escalating tendency to become more complex. An observer, "collecting observations" and three measures for complexity are examined. A theory on living systems is derived focussing on their internal representation of information. Living systems are more complex than Kolmogorov complexity ("life is NOT simple") and overcome decision limits (Gödel theorem) for formal systems as illustrated for cell cycle. Only a world with very fine tuned environments allows life. Such a world is itself rather complex and hence excessive large in its space of different states – a living observer has thus a high probability to reside in a complex and fine tuned universe.
Given points in the plane, connect them using minimum ink. Though the task seems simple, it turns out to be very time consuming. In fact, scientists believe that computers cannot efficiently solve it. So, do we have to resign? This book examines such NP-hard network-design problems, from connectivity problems in graphs to polygonal drawing problems on the plane. First, we observe why it is so hard to optimally solve these problems. Then, we go over to attack them anyway. We develop fast algorithms that find approximate solutions that are very close to the optimal ones. Hence, connecting points with slightly more ink is not hard.
Homo- and heterochiral aggregation during crystallization of organic molecules has significance both for fundamental questions related to the origin of life as well as for the separation of homochiral compounds from their racemates in industrial processes. Herein, we analyse these phenomena at the lowest level of hierarchy - that is the self-assembly of a racemic mixture of (R,R)- and (S,S)-PBI into 1D supramolecular polymers. By a combination of UV/vis and NMR spectroscopy as well as atomic force microscopy, we demonstrate that homochiral aggregation of the racemic mixture leads to the formation of two types of supramolecular conglomerates under kinetic control, while under thermodynamic control heterochiral aggregation is preferred, affording a racemic supramolecular polymer. FT-IR spectroscopy and quantum-chemical calculations reveal unique packing arrangements and hydrogen-bonding patterns within these supramolecular polymers. Time-, concentration- and temperature-dependent UV/vis experiments provide further insights into the kinetic and thermodynamic control of the conglomerate and racemic supramolecular polymer formation. Homo- and heterochiral aggregation is a process of interest to prebiotic and chiral separation chemistry. Here, the authors analyze the self-assembly of a racemic mixture into 1D supramolecular polymers and find homochiral aggregation into conglomerates under kinetic control, while under thermodynamic control a racemic polymer is formed.
Stress granules (SGs) are cytoplasmic condensates containing untranslated mRNP complexes. They are induced by various proteotoxic conditions such as heat, oxidative, and osmotic stress. SGs are believed to protect mRNPs from degradation and to enable cells to rapidly resume translation when stress conditions subside. SG dynamics are controlled by various posttranslationalmodifications, but the role of the ubiquitin system has remained controversial. Here, we present a comparative analysis addressing the involvement of the ubiquitin system in SG clearance. Using high-resolution immuno-fluorescence microscopy, we found that ubiquitin associated to varying extent with SGs induced by heat, arsenite, H2O2, sorbitol, or combined puromycin and Hsp70 inhibitor treatment. SG-associated ubiquitin species included K48- and K63-linked conjugates, whereas free ubiquitin was not significantly enriched. Inhibition of the ubiquitin activating enzyme, deubiquitylating enzymes, the 26S proteasome and p97/VCP impaired the clearance of arsenite- and heat-induced SGs, whereas SGs induced by other stress conditions were little affected. Our data underline the differential involvement of the ubiquitin system in SG clearance, a process important to prevent the formation of disease-linked aberrant SGs.
Graphs provide a key means to model relationships between entities.
They consist of vertices representing the entities,
and edges representing relationships between pairs of entities.
To make people conceive the structure of a graph,
it is almost inevitable to visualize the graph.
We call such a visualization a graph drawing.
Moreover, we have a straight-line graph drawing
if each vertex is represented as a point
(or a small geometric object, e.g., a rectangle)
and each edge is represented as a line segment between its two vertices.
A polyline is a very simple straight-line graph drawing,
where the vertices form a sequence according to which the vertices are connected by edges.
An example of a polyline in practice is a GPS trajectory.
The underlying road network, in turn, can be modeled as a graph.
This book addresses problems that arise
when working with straight-line graph drawings and polylines.
In particular, we study algorithms
for recognizing certain graphs representable with line segments,
for generating straight-line graph drawings,
and for abstracting polylines.
In the first part, we first examine,
how and in which time we can decide
whether a given graph is a stick graph,
that is, whether its vertices can be represented as
vertical and horizontal line segments on a diagonal line,
which intersect if and only if there is an edge between them.
We then consider the visual complexity of graphs.
Specifically, we investigate, for certain classes of graphs,
how many line segments are necessary for any straight-line graph drawing,
and whether three (or more) different slopes of the line segments
are sufficient to draw all edges.
Last, we study the question,
how to assign (ordered) colors to the vertices of a graph
with both directed and undirected edges
such that no neighboring vertices get the same color
and colors are ascending along directed edges.
Here, the special property of the considered graph is
that the vertices can be represented as intervals
that overlap if and only if there is an edge between them.
The latter problem is motivated by an application
in automated drawing of cable plans with vertical and horizontal line segments,
which we cover in the second part.
We describe an algorithm that
gets the abstract description of a cable plan as input,
and generates a drawing that takes into account
the special properties of these cable plans,
like plugs and groups of wires.
We then experimentally evaluate the quality of the resulting drawings.
In the third part, we study the problem of abstracting (or simplifying)
a single polyline and a bundle of polylines.
In this problem, the objective is to remove as many vertices as possible from the given polyline(s)
while keeping each resulting polyline sufficiently similar to its original course
(according to a given similarity measure).