Skip to main content

Research Repository

Advanced Search

Outputs (224)

Using Deep Convolutional Neural Network Architectures for Object Classification and Detection within X-ray Baggage Security Imagery (2018)
Journal Article
Akcay, S., Kundegorski, M., Willcocks, C., & Breckon, T. (2018). Using Deep Convolutional Neural Network Architectures for Object Classification and Detection within X-ray Baggage Security Imagery. IEEE Transactions on Information Forensics and Security, 13(9), 2203-2215. https://doi.org/10.1109/tifs.2018.2812196

We consider the use of deep Convolutional Neural Networks (CNN) with transfer learning for the image classification and detection problems posed within the context of X-ray baggage security imagery. The use of the CNN approach requires large amounts... Read More about Using Deep Convolutional Neural Network Architectures for Object Classification and Detection within X-ray Baggage Security Imagery.

Recovering normal networks from shortest inter-taxa distance information (2018)
Journal Article
Bordewich, M., Huber, K. T., Moulton, V., & Semple, C. (2018). Recovering normal networks from shortest inter-taxa distance information. Journal of Mathematical Biology, 77(3), 571-594. https://doi.org/10.1007/s00285-018-1218-x

Phylogenetic networks are a type of leaf-labelled, acyclic, directed graph used by biologists to represent the evolutionary history of species whose past includes reticulation events. A phylogenetic network is tree–child if each non-leaf vertex is th... Read More about Recovering normal networks from shortest inter-taxa distance information.

Erdős–Ko–Rado theorems for a family of trees (2018)
Journal Article
Feghali, C., Johnson, M., & Thomas, D. (2018). Erdős–Ko–Rado theorems for a family of trees. Discrete Applied Mathematics, 236, 464-471. https://doi.org/10.1016/j.dam.2017.10.009

A family of sets is intersecting if any two sets in the family intersect. Given a graph and an integer , let denote the family of independent sets of size of . For a vertex of , let denote the family of independent sets of size that contain . This fa... Read More about Erdős–Ko–Rado theorems for a family of trees.

Self-Stabilizing Balls and Bins in Batches (2018)
Journal Article
Berenbrink, P., Friedetzky, T., Kling, P., Mallmann-Trenn, F., Nagel, L., & Wastell, C. (2018). Self-Stabilizing Balls and Bins in Batches. Algorithmica, 80(12), 3673-3703. https://doi.org/10.1007/s00453-018-0411-z

A fundamental problem in distributed computing is the distribution of requests to a set of uniform servers without a centralized controller. Classically, such problems are modeled as static balls into bins processes, where m balls (tasks) are to be d... Read More about Self-Stabilizing Balls and Bins in Batches.

Solver Composition Across the PDE/Linear Algebra Barrier (2018)
Journal Article
Kirby, R. C., & Mitchell, L. (2018). Solver Composition Across the PDE/Linear Algebra Barrier. SIAM Journal on Scientific Computing, 40(1), C76-C98. https://doi.org/10.1137/17m1133208

The efficient solution of discretizations of coupled systems of partial differential equations (PDEs) is at the core of much of numerical simulation. Significant effort has been expended on scalable algorithms to precondition Krylov iterations for th... Read More about Solver Composition Across the PDE/Linear Algebra Barrier.