We introduce a hybrid two-dimensional multiscale model of angiogenesis, the process by which endothelial cells (ECs) migrate from a pre-existing vascular bed in response to local environmental cues and cell-cell interactions, to create a new vascular network. Recent experimental studies have highlighted a central role of cell rearrangements in the formation of angiogenic networks. Our model accounts for this phenomenon via the heterogeneous response of ECs to their microenvironment. These cell rearrangements, in turn, dynamically remodel the local environment. The model reproduces characteristic features of angiogenic sprouting that include branching, chemotactic sensitivity, the brush border effect, and cell mixing. These properties, rather than being hardwired into the model, emerge naturally from the gene expression patterns of individual cells. After calibrating and validating our model against experimental data, we use it to predict how the structure of the vascular network changes as the baseline gene expression levels of the VEGF-Delta-Notch pathway, and the composition of the extracellular environment, vary. In order to investigate the impact of cell rearrangements on the vascular network structure, we introduce the mixing measure, a scalar metric that quantifies cell mixing as the vascular network grows. We calculate the mixing measure for the simulated vascular networks generated by ECs of different lineages (wild type cells and mutant cells with impaired expression of a specific receptor). Our results show that the time evolution of the mixing measure is directly correlated to the generic features of the vascular branching pattern, thus, supporting the hypothesis that cell rearrangements play an essential role in sprouting angiogenesis. Furthermore, we predict that lower cell rearrangement leads to an imbalance between branching and sprout elongation. Since the computation of this statistic requires only individual cell trajectories, it can be computed for networks generated in biological experiments, making it a potential biomarker for pathological angiogenesis.

General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal ? Take down policyIf you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.

No abstract

No abstract

No abstract

Knowledge graphs (KGs) are huge collections of primarily encyclopedic facts that are widely used in entity recognition, structured search, question answering, and similar. Rule mining is commonly applied to discover patterns in KGs. However, unlike in traditional association rule mining, KGs provide a setting with a high degree of incompleteness, which may result in the wrong estimation of the quality of mined rules, leading to erroneous beliefs such as all artists have won an award. In this paper we propose to use (in-)completeness meta-information to better assess the quality of rules learned from incomplete KGs. We introduce completeness-aware scoring functions for relational association rules. Experimental evaluation both on real and synthetic datasets shows that the proposed rule ranking approaches have remarkably higher accuracy than the state-of-the-art methods in uncovering missing facts.

While Answer-Set Programming (ASP) is a prominent approach to declarative problem solving, optimisation problems can still be a challenge for it. Large-Neighbourhood Search (LNS) is a metaheuristic for optimisation where parts of a solution are alternately destroyed and reconstructed that has high but untapped potential for ASP solving. We present a framework for LNS optimisation in answer-set solving, in which neighbourhoods can be specified either declaratively as part of the ASP encoding, or automatically generated by code. To effectively explore different neighbourhoods, we focus on multi-shot solving as it allows to avoid program regrounding. We illustrate the framework on different optimisation problems, some of which are notoriously difficult, including shift planning and a parallel machine scheduling problem from semi-conductor production which demonstrate the effectiveness of the LNS approach.

Smart factories are equipped with machines that can sense their manufacturing environments, interact with each other, and control production processes. Smooth operation of such factories requires that the machines and engineering personnel that conduct their monitoring and diagnostics share a detailed common industrial knowledge about the factory, e.g., in the form of knowledge graphs. Creation and maintenance of such knowledge is expensive and requires automation. In this work we show how machine learning that is specifically tailored towards industrial applications can help in knowledge graph completion. In particular, we show how knowledge completion can benefit from event logs that are common in smart factories. We evaluate this on the knowledge graph from a real worldinspired smart factory with encouraging results.