Graph theory is fascinating branch of math. Leonhard Euler introduced the concept of Graph Theory in his paper about the seven bridges of Konigsberg published in 1736. In a nutshell, graph theory is the study of pair-wise relationships between objects. Each object is represented…
Braided rivers are one of the most complex and unpredictable natural systems on Earth. Found worldwide, they are easily identified from above by their distinctive morphology (a large network of interlinked channels divided by interspersed sedimentary deposits). Their propensity …
This PhD thesis is formed of work completed while studying at Royal Holloway, University of London. The three chapters that form the majority of the thesis each represent distinct projects that were studied in this time. Chronologically, the research forming the first chapter, o…
In program analysis, unknown properties for terms are typically represented symbolically as variables. Bound constraints on these variables can then specify multiple optimisation goals for computer programs and nd application in areas such as type theory, security, alias analysi…
This thesis is concerned with one important question in artificial neural networks, that is, how biologically inspired connectivity of a network affects its associative memory performance. In recent years, research on the mammalian cerebral cortex, which has the main responsibil…
Analysis of functional connectivity of simultaneously recorded multiple spike trains is one of the major issues in the neuroscience. The progress of the statistical methods to the analysis of functional connectivity of multiple spike trains is relatively slow. In this thesis two…
While polynomial-time approximation algorithms remain a dominant notion in tackling computationally hard problems, the framework of parameterized complexity has been emerging rapidly in recent years. Roughly speaking, the analytic framework of parameterized complexity attempts t…
Random NP-Complete problems have come under study as an important tool used in the analysis of optimization algorithms and help in our understanding of how to properly address issues of computational intractability. In this thesis, the Number Partition Problem and the Hamiltonia…
For digraphs D and H, a homomorphism of D to H is a mapping f : V (D)→V( H) such that uv ∈ A( D) implies f(u)f( v) ∈ A(H). Suppose D and H are two digraphs, and ci( u), u ∈ V (D), i ∈ V(H), are nonnegative integer costs. The cost of the homomorphism f of D to H is ∑u∈V (D) cf(u)…
Manually repairing code is quite time-consuming for programmers and costly for companies. We observe that the repairs for dependency-related build failures are typically hand-worked and highly rule-based.
In this thesis, we discuss both standard and novel approaches to inducibility problems.We begin by establishing basic concepts and definitions along with a brief history ofinducibility problems, and give an overview of flag algebras and the basic flag algebramethod. Established …
The long-term goal of this research is to ensure the flaw-free production of metal parts made using additive manufacturing (AM, 3D printing). As a step towards this long-term goal, the goal of this dissertation is to understand and predict the spatiotemporal temperature distribu…
Rates of suicide have steadily increased across all age cohorts, revealing a particularly concerning rise in suicide among much younger age groups (10-15 years old). Recent efforts aimed at understanding suicide in youth have leveraged work from the adult literature to more poin…
Metal Additive manufacturing (AM) processes build 3D objects by heating and consolidating material in a point-by-point manner. Unlike traditional manufacturing methods, AM allows the material properties of each point in the build to vary by controlling process conditions locally…