Algorithm for k-truncated metric dimension of trees

The k-truncated metric dimension of a graph is the minimum number of sensors (a subset of the vertex set) needed to uniquely identify every vertex in the graph based on its distance to the sensors, where the sensors have a measuring range of k. We give an algorithm with the goal that given any tree and any value for the measuring range of the...

Integration of variable selection heuristics into a MaxSAT solver for solving the multi-mode resource-constrained project scheduling problem

The multi-mode resource-constrained project scheduling problem (MRCPSP) is an extension of the resource-constrained project scheduling problem (RCPSP), which allows activities to be executed in multiple modes. The state-of-the-art solutions for solving this NP-Hard problem are dedicated algorithms and (meta-)heuristics. However, this paper...

Heuristic Augmentation of SAT Solvers for MRCPSP

The multi-mode resource-constrained project scheduling problem (MRCPSP) is an NP-hard scheduling problem that concerns activities with several execution modes connected by precedence relations. Precedence relations define a partial ordering in which activities must be processed. The execution mode of an activity defines its processing time and...

Matching in Multi-Agent Pathfinding using M*

Multi-agent pathfinding (MAPF) is the process of finding collision-free paths for multiple agents. MAPF can be extended by grouping agents into teams. In a team, agents need to be assigned (or matched) to one of the team's goals such that the sum of individual cost} is minimised. This extension is called MAPF with matching (MAPFM). M* is a...

eNose: An electronic nose for solid stools detection: Software perspective

This report details the software part of the development process of the eNose technology. The technology is posed by Momo Medical. Momo Medical is a start-up company located in Delft, it provides and develops non-intrusive monitoring systems in the nursing sector. The project is the next step in an already existing product: BedSense. BedSense...

Tail move rearrangement algorithm for rooted binary phylogenetic networks

A common tool for exploring the space of phylogenetic networks is applying rearrangement moves, such as <i>tail moves</i>. Recently, it has been shown by Janssen et al that, given a rooted binary phylogenetic network, it is possible to generate any other alternative network, using only tail moves. The aim of this report is to translate this...

Tree-child Network Containment

Interest in phylogenetic trees for histories of species and DNA has spawned many problems, one of which is TreeContainment; a problem that asks whether a tree is contained within a network. The TreeContainment problem is proven to be NP-hard for general trees and networks, however it is solvable in polynomial time for networks that meet the tree...

Detecting a patient’s heart rate from pressure sensor data using a microcontroller-implemented algorithm

Pressure ulcers develop when skin is subjected to a mechanical load over time, resulting in tissue damage. This occurs when a patient is in the same posture or position for a long period of time. To prevent this Momo Medical is developing a sensor plate that uses sensor data attained from the patient laying on his bed to guide the nurses, whom...

Computing Measures for Tree-Basedness of Phylogenetic Networks

Phylogenetic networks are a type of directed acyclic graph used to represent evolutionary relationships that contain events such as hybridization or horizontal gene transfer. When a network<br/>lacks such events it is a phylogenetic tree. Some phylogenetic networks that are not trees can<br/>however be represented as a tree with additional...

Ranking items: Is solving a seriation problem a good alternative for existing methods?

In this dissertation we look at the seriation problem and the applications of this problem. Given a set of items, we try to find an ordering based on the similarity between the items. We start by explaining the mathematical theory behind the seriation problem. Then we describe a couple of different methods that can be used to find a solution for...

Constructing non-parametric Bayesian networks from data

The objective of this thesis is to design an algorithm for learning the structure of non-parametric Bayesian networks (BNs) from data and has been written as part of acquiring the bachelor's degree at the Delft Institute of Applied Mathematics of the TU Delft. Inspiration for improving an existing algorithm while designing a new procedure was...