92 research outputs found
HyperâHeuristics and Metaheuristics for Selected BioâInspired Combinatorial Optimization Problems
Many decision and optimization problems arising in bioinformatics field are time demanding, and several algorithms are designed to solve these problems or to improve their current best solution approach. Modeling and implementing a new heuristic algorithm may be timeâconsuming but has strong motivations: on the one hand, even a small improvement of the new solution may be worth the long time spent on the construction of a new method; on the other hand, there are problems for which goodâenough solutions are acceptable which could be achieved at a much lower computational cost. In the first case, specially designed heuristics or metaheuristics are needed, while the latter hyperâheuristics can be proposed. The paper will describe both approaches in different domain problems
Parallel computing 2011, ParCo 2011: book of abstracts
This book contains the abstracts of the presentations at the conference Parallel Computing 2011, 30 August - 2 September 2011, Ghent, Belgiu
Algorithmic Results for Clustering and Refined Physarum Analysis
In the first part of this thesis, we study the Binary -Rank- problem which given a binary matrix and a positive integer , seeks to find a rank- binary matrix minimizing the number of non-zero entries of . A central open question is whether this problem admits a polynomial time approximation scheme. We give an affirmative answer to this question by designing the first randomized almost-linear time approximation scheme for constant over the reals, , and the Boolean semiring. In addition, we give novel algorithms for important variants of -low rank approximation.
The second part of this dissertation, studies a popular and successful heuristic, known as Approximate Spectral Clustering (ASC), for partitioning the nodes of a graph into clusters with small conductance. We give a comprehensive analysis, showing that ASC runs efficiently and yields a good approximation of an optimal -way node partition of .
In the final part of this thesis, we present two results on slime mold computations: i) the continuous undirected Physarum dynamics converges for undirected linear programs with a non-negative cost vector; and ii) for the discrete directed Physarum dynamics, we give a refined analysis that yields strengthened and close to optimal convergence rate bounds, and shows that the model can be initialized with any strongly dominating point.Im ersten Teil dieser Arbeit untersuchen wir das Binary -Rank- Problem. Hier sind eine bin{\"a}re Matrix und eine positive ganze Zahl gegeben und gesucht wird eine bin{\"a}re Matrix mit Rang , welche die Anzahl von nicht null Eintr{\"a}gen in minimiert. Wir stellen das erste randomisierte, nahezu lineare Aproximationsschema vor konstantes {\"u}ber die reellen Zahlen, und den Booleschen Semiring. Zus{\"a}tzlich erzielen wir neue Algorithmen f{\"u}r wichtige Varianten der -low rank Approximation.
Der zweite Teil dieser Dissertation besch{\"a}ftigt sich mit einer beliebten und erfolgreichen Heuristik, die unter dem Namen Approximate Spectral Cluster (ASC) bekannt ist. ASC partitioniert die Knoten eines gegeben Graphen in Cluster kleiner Conductance. Wir geben eine umfassende Analyse von ASC, die zeigt, dass ASC eine effiziente Laufzeit besitzt und eine gute Approximation einer optimale -Weg-Knoten Partition f{\"u}r berechnet.
Im letzten Teil dieser Dissertation pr{\"a}sentieren wir zwei Ergebnisse {\"u}ber Berechnungen mit Hilfe von Schleimpilzen: i) die kontinuierliche ungerichtete Physarum Dynamik konvergiert f{\"u}r ungerichtete lineare Programme mit einem nicht negativen Kostenvektor; und ii) f{\"u}r die diskrete gerichtete Physikum Dynamik geben wir eine verfeinerte Analyse, die st{\"a}rkere und beinahe optimale Schranken f{\"u}r ihre Konvergenzraten liefert und zeigt, dass das Model mit einem beliebigen stark dominierender Punkt initialisiert werden kann
Whole-Body Regeneration
This Open Access volume provides a comprehensive overview of the latest tools available to scientists to study the many facets of whole-body regeneration (WBR). The chapters in this book are organized into six parts. Part One provides a historical overview on the study of the WBR phenomena focusing on the primary challenges of this research. Parts Two and Three explore a series of non-vertebrate zoological contexts that provide experimental models for WBR, showing how they can be approached with cellular tools. Parts Four, Five, and Six discuss the future advancements of WBR, reporting about the cutting-edge techniques in genetics and omics used to dissect the underlying mechanisms of WBR, and systems biology approaches to reach a synthetic view of WBR. Written in the highly successful Methods in Molecular Biology series format, chapters include introductions to their respective topics, lists of the necessary materials and reagents, step-by-step, readily reproducible laboratory protocols, and tips on troubleshooting and avoiding known pitfalls. Authoritative and thorough, Whole-Body Regeneration: Methods and Protocols is a valuable resource for scientists and researchers who want to learn more about this important and developing field
Biotic analogies for self-organising cities
Nature has inspired generations of urban designers and planners in pursuit of harmonious and functional built environments. Research regarding self-organisation has encouraged urbanists to consider the role of bottom-up approaches in generating urban order. However, the extent to which self-organisation-inspired approaches draw directly from nature is not always clear. Here, we examined the biological basis of urban research, focusing on self-organisation. We conducted a systematic literature search of self-organisation in urban design and biology, mapped the relationship between key biological terms across the two fields and assessed the quality and validity of biological comparisons in the urban design literature. Finding deep inconsistencies in the mapping of central terms between the two fields, a preponderance for cross-level analogies and comparisons that spanned molecules to ecosystems, we developed a biotic framework to visualise the analogical space and elucidate areas where new inspiration may be sought
- âŠ