
An Approach for Adaptive Automatic Threat Recognition Within 3D Computed Tomography Images for Baggage Security Screening
The screening of baggage using Xray scanners is now routine in aviation...
read it

ExBERT: An External Knowledge Enhanced BERT for Natural Language Inference
Neural language representation models such as BERT, pretrained on large...
read it

Generalized ZeroShot Domain Adaptation via Coupled Conditional Variational Autoencoders
Domain adaptation approaches aim to exploit useful information from the ...
read it

A Reference Architecture for Plausible Threat Image Projection (TIP) Within 3D Xray Computed Tomography Volumes
Threat Image Projection (TIP) is a technique used in Xray security bagg...
read it

A study of the effect of the illumination model on the generation of synthetic training datasets
The use of computer generated images to train Deep Neural Networks is a ...
read it

Watermark retrieval from 3D printed objects via synthetic data training
We present a deep neural network based method for the retrieval of water...
read it

DOOBNet: Deep Object Occlusion Boundary Detection from an Image
Object occlusion boundary detection is a fundamental and crucial researc...
read it

Eliminating the Blind Spot: Adapting 3D Object Detection and Monocular Depth Estimation to 360° Panoramic Imagery
Recent automotive vision work has focused almost exclusively on processi...
read it

Watermark Retrieval from 3D Printed Objects via Convolutional Neural Networks
We present a method for reading digital data embedded in planar 3D print...
read it

An Exploration of Dropout with RNNs for Natural Language Inference
Dropout is a crucial regularization technique for the Recurrent Neural N...
read it

A Reconfigurations Analogue of Brooks' Theorem and its Consequences
Let G be a simple undirected graph on n vertices with maximum degree Δ. ...
read it

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
We consider a natural restriction of the List Colouring problem: kRegul...
read it

Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide
A graph is (H_1,H_2)free for a pair of graphs H_1,H_2 if it contains no...
read it

Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity
We perform a systematic study in the computational complexity of the con...
read it

Finding Shortest Paths between Graph Colourings
The kcolouring reconfiguration problem asks whether, for a given graph ...
read it

A Bayesian computer model analysis of Robust Bayesian analyses
We harness the power of Bayesian emulation techniques, designed to aid t...
read it

Book embeddings of Reeb graphs
Let X be a simplicial complex with a piecewise linear function f:X→R. Th...
read it

Approximating persistent homology for a cloud of n points in a subquadratic time
The VietorisRips filtration for an npoint metric space is a sequence o...
read it

A nonordinary peridynamics implementation for anisotropic materials
Peridynamics (PD) represents a new approach for modelling fracture mecha...
read it

Connected Vertex Cover for (sP_1+P_5)Free Graphs
The Connected Vertex Cover problem is to decide if a graph G has a verte...
read it

Cliquewidth and WellQuasiOrdering of TriangleFree Graph Classes
Daligault, Rao and Thomassé asked whether every hereditary graph class t...
read it

On Colouring (2P_2,H)Free and (P_5,H)Free Graphs
The Colouring problem asks whether the vertices of a graph can be colour...
read it

On the hardness of losing weight
We study the complexity of local search for the Boolean constraint satis...
read it

Form Follows Function  Do algorithms and applications challenge or drag behind the hardware evolution?
We summarise some of the key statements made at the workshop Form Follow...
read it

Bayesian analysis of finite population sampling in multivariate coexchangeable structures with separable covariance matric
We explore the effect of finite population sampling in design problems w...
read it

Kernelization Lower Bounds for Finding Constant Size Subgraphs
Kernelization is an important tool in parameterized algorithmics. The go...
read it

Recovering treechild networks from shortest intertaxa distance information
Phylogenetic networks are a type of leaflabelled, acyclic, directed gra...
read it

Quasimatrixfree hybrid multigrid on dynamically adaptive Cartesian grids
We present a family of spacetreebased multigrid realizations using the ...
read it

Bayesian uncertainty analysis establishes the link between the parameter space of a complex model of hormonal crosstalk in Arabidopsis root development and experimental measure
A major challenge in plant developmental biology is to understand how pl...
read it

Known Boundary Emulation of Complex Computer Models
Computer models are now widely used across a range of scientific discipl...
read it

Searching for Maximum OutDegree Vertices in Tournaments
A vertex x in a tournament T is called a king if for every vertex y of T...
read it

Temporal Vertex Cover with a Sliding Time Window
Modern, inherently dynamic systems are usually characterized by a networ...
read it

Bayesian shape modelling of crosssectional geological data
Shape information is of great importance in many applications. For examp...
read it

On Trade in Bilateral Oligopolies with Altruistic and Spiteful Agents
This paper studies the effects of altruism and spitefulness in a twosid...
read it

Disconnected Cuts in Clawfree Graphs
A disconnected cut of a connected graph is a vertex cut that itself also...
read it

An Efficient SIMD Implementation of PseudoVerlet Lists for Neighbour Interactions in ParticleBased Codes
In particlebased simulations, neighbour finding (i.e finding pairs of p...
read it

Lower and Upper Bound for Computing the Size of All Second Neighbourhoods
We consider the problem of computing the size of each rneighbourhood fo...
read it

Simple Games versus Weighted Voting Games
A simple game (N,v) is given by a set N of n players and a partition of ...
read it

The Power of Genetic Algorithms: what remains of the pMSSM?
Genetic Algorithms (GAs) are explored as a tool for probing new physics ...
read it

A population protocol for exact majority with O(^5/3 n) stabilization time and asymptotically optimal number of states
A population protocol can be viewed as a sequence of pairwise interactio...
read it

The temporal explorer who returns to the base
In this paper we study the problem of exploring a temporal graph (i.e. a...
read it

On the influence of the interaction graph on a finite dynamical system
A finite dynamical system (FDS) is a system of multivariate functions ov...
read it

Enclave Tasking for Discontinuous Galerkin Methods on Dynamically Adaptive Meshes
Highorder Discontinuous Galerkin (DG) methods promise to be an excellen...
read it

Imprecise Monte Carlo simulation and iterative importance sampling for the estimation of lower previsions
We develop a theoretical framework for studying numerical estimation of ...
read it

SWIFT: Maintaining weakscalability with a dynamic range of 10^4 in timestep size to harness extreme adaptivity
Cosmological simulations require the use of a multiple timestepping sch...
read it

Reliability analysis of general phased mission systems with a new survival signature
It is often difficult for a phased mission system (PMS) to be highly rel...
read it

Improved linear programming methods for checking avoiding sure loss
We review the simplex method and two interiorpoint methods (the affine ...
read it

Nowcasting the Stance of Social Media Users in a Sudden Vote: The Case of the Greek Referendum
Modelling user voting intention in social media is an important research...
read it

Contracting to a Longest Path in HFree Graphs
We prove two dichotomy results for detecting long paths as patterns in a...
read it

Coloured and taskbased stencil codes
Simple stencil codes are and remain an important building block in scien...
read it
Durham University
Durham University is a collegiate public research university in Durham, England, founded by an Act of Parliament in 1832 and incorporated by royal charter in 1837.