Professor Jano van Hemert, MSc PhD SMIEEE FRSE

About me

Sat, 23 May 2026 00:00:00 +0000

I am the Director of Data Services EPCC and hold a Personal Chair of Data Infrastructure and Analytics at the University of Edinburgh.

For an up-to-date CV please see LinkedIn

Awards

IEEE Computer Society Distinguished Contributor award in 2021.
Scottish Crucible by National Endowment for Science, Technology and the Arts (UK) in 2009.
Talented Young Researcher by NWO (Netherlands Organisation for Research) in 2004.

Education

PhD in Mathematics and Physical Sciences, Leiden University, The Netherlands. Nov 2002.
MSc in Computer Science, Leiden University, The Netherlands. Sep 1998.

Current board, committee and professional memberships

Digital Health World Congress, London, 2019

Sun, 27 Oct 2019 11:00:00 +0000

In my talk entitled “Artificial intelligence in eye health care” I give a brief history of retinal imaging and diabetic retinopathy. These two should provide the perfect use case for artificial intelligence to support the ever-growing burden of diabetes. Yet, artificial intelligence has not found its way into the mainstream screening and care of diabetic retinopathy. I highlight the main obstacles that are often misrepresented.

Science and the Parliament

Wed, 15 Nov 2017 00:00:00 +0000

The 17th annual Science and the Parliament event concentrated on Science, Innovation & the Economy.

Below my talk, which was part of the panel discussion on Science & Industrial Strategy where I was given the question: Do we have the right policies in place to foster innovation that leads to economic growth?

A staggering number of reports and statistics try to answer that question. I have read quite a few and here is my two pennies’ worth.

Wide Field Ophthalmic Photography Image Storage SOP Classes; DICOM Supplement 173

Sun, 29 Mar 2015 00:00:00 +0000

With a small team comprising members from different companies and representatives of the American Academy of Ophthalmology, a new supplement was delivered from conception to approval in 14 months.

Supplement 173 defines Storage SOP Classes to enable anatomically correct measurements on wide field ophthalmic photography images.
Vendors have implemented new technology that enables the acquisition of OP images using wide field fundus photography. The Ophthalmic Photography IOD does not address wide fields, varied pixel spacing, and proper measurement of a stereographic projection or other methods of projection/mapping. Since the back of the eye is approximately a concave sphere, taking a very wide field image of it introduces large errors in any attempt to measure a lesion in that image (the error is very large when using a single value for the DICOM Pixel Spacing Attribute.). Therefore, DICOM WG 9 (Ophthalmology) has determined that two new Information Object Definitions (IODs) are necessary to adequately represent wide field fundus photography.

DICOM Confidential

Tue, 04 Mar 2014 00:00:00 +0000

Medical imaging acquired for clinical purposes can have several legitimate secondary uses in research projects and teaching libraries. For these uses, and when imaging is acquired directly for research, most personal data can be safely removed, but in many cases it is necessary to keep some personal data or a link with the personal data. At this moment, no commonly accepted solution exists because the amount of personal data that is required by researchers and teaching libraries varies case by case.

Rapid Portal Development

Thu, 02 May 2013 00:00:00 +0000

Rapid is a cost-effective and efficient way of designing and delivering portal interfaces to tasks that require remote compute resources. The aim of Rapid is to make completing these tasks as simple as purchasing a book or booking a ﬂight on the web.

The philosophy of Rapid is to deliver customised graphical user interfaces that enable domain specialists to achieve their tasks. These tasks make use of domain-speciﬁc applications that run on remote compute resources; a requirement which is satisﬁed by translating the task into one or several computational jobs to be performed on Grid and Cloud Computing infrastructures, and High-Performance Computing facilities.

Extracting features from travelling salesman instances

Sun, 12 Feb 2012 00:00:00 +0000

Contains a collection of source files authored by different people that put together allows the extraction of features from travelling salesman problem instances.

TSP-feature-extract-20120212.tar.gz

See these papers for a detailed description:

Discovering the suitability of optimisation algorithms by learning from evolved instances (K. Smith-Miles, J.I. van Hemert), In Annals of Mathematics and Artificial Intelligence, volume 61, 2011.
Evolving combinatorial problem instances that are difficult to solve (J.I. van Hemert), In Evolutionary Computation, volume 14, 2006.
Property analysis of symmetric travelling salesman problem instances acquired through evolution (J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005.
Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation (J.I. van Hemert, N.B. Urquhart), In Parallel Problem Solving from Nature (Xin Yao, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervós, John A. Bullinaria, Jonathan Rowe, Peter Ti\vno Ata Kabán, Hans-Paul Schwefel, eds.), Springer, volume 3242, 2004.

Disc-Cover

Sat, 20 May 2006 00:00:00 +0000

This library implements a framework for an evolutionary algorithm. It aims at including different techniques from the area of evolutionary computation, such as genetic algorithms and genetic programming, in one framework. It is setup such that new projects can be implemented by adjusting only the necessary parts in the library.

Get it from SourceForge or download below.

Changelog

Revisions: problems with latex-3 fixed, allmusic options works again, some new templates, new option template_list.

Dynamic Vehicle Routing Problem Generator

Sun, 26 Feb 2006 00:00:00 +0000

Description

This problem generator for dynamic routing problems can be used to study different aspects of real-time routing by changing parameters of the problem. It is written in Perl and has extensive documentation.

Downloads

dynvrp-generator

Travelling salesman problem instances evolved against Lin-Kernighan variants

Sat, 05 Mar 2005 00:00:00 +0000

These are travelling salesman problems that were created by an evolutionary algorithm with the objective function to maximise the time it takes to solve these problems by one of two Lin-Kernighan heuristic solvers.

See these papers for a detailed description:

Discovering the suitability of optimisation algorithms by learning from evolved instances (K. Smith-Miles, J.I. van Hemert), In Annals of Mathematics and Artificial Intelligence, volume 61, 2011.
Evolving combinatorial problem instances that are difficult to solve (J.I. van Hemert), In Evolutionary Computation, volume 14, 2006.
Property analysis of symmetric travelling salesman problem instances acquired through evolution (J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005.
Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation (J.I. van Hemert, N.B. Urquhart), In Parallel Problem Solving from Nature (Xin Yao, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervós, John A. Bullinaria, Jonathan Rowe, Peter Ti\vno Ata Kabán, Hans-Paul Schwefel, eds.), Springer, volume 3242, 2004.

Clustered travelling salesman problem instances

Mon, 10 Jan 2005 00:00:00 +0000

These are travelling salesman problems that were created by an evolutionary algorithm such that they contain clusters of cities.

clustered-phase-transition-tsp.tar.gz

See these papers for a detailed description:

Discovering the suitability of optimisation algorithms by learning from evolved instances (K. Smith-Miles, J.I. van Hemert), In Annals of Mathematics and Artificial Intelligence, volume 61, 2011.
Evolving combinatorial problem instances that are difficult to solve (J.I. van Hemert), In Evolutionary Computation, volume 14, 2006.
Property analysis of symmetric travelling salesman problem instances acquired through evolution (J.I. van Hemert), In Evolutionary Computation in Combinatorial Optimization (G. Raidl, J. Gottlieb, eds.), Springer, 2005.
Phase transition properties of clustered travelling salesman problem instances generated with evolutionary computation (J.I. van Hemert, N.B. Urquhart), In Parallel Problem Solving from Nature (Xin Yao, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervós, John A. Bullinaria, Jonathan Rowe, Peter Ti\vno Ata Kabán, Hans-Paul Schwefel, eds.), Springer, volume 3242, 2004.

Binary constraint satisfaction problem sets

Thu, 28 Oct 2004 00:00:00 +0000

These are binary constraint satisfaction problems created to test the performance of algorithms. The first set covers the landscape of solvable to non-solvable problems and covers the phase transition of easy to hard to easy. The second set comprises small to large problems.

See these papers for a detailed description:

Comparing Evolutionary Algorithms on Binary Constraint Satisfaction Problems (B.G.W. Craenen, A.E. Eiben, J.I. van Hemert), In IEEE Transactions on Evolutionary Computation, volume 7, 2003.
Application of Evolutionary Computation to Constraint Satisfaction and Data Mining (J.I. van Hemert), PhD thesis, Leiden University, 2002. (ISBN: 90-6734-057-X)

RandomCSP

Mon, 16 Feb 2004 00:00:00 +0000

Goals

To facilitate as a suit of programs to create and analyse randomly created binary constraint satisfaction problems, for those who do not like to work with libraries for any reason a suite of programs is included that provides a simple interface to the library. With these programs it is easy to create a set of random problem instances, to verify solutions and to analyse instances on a number of features.

Evolving abstract paintings - eArtWeb

Sun, 01 Apr 2001 00:00:00 +0000

This evolutionary art system is designed to be as general as possible. It makes it an easy to extend system, open to many different forms of art. The system also utilises a database to store the actions of its visitors, thereby creating an interesting pool of data for studying subjective user preferences regarding two dimensional visual art. It is completely written in Perl, making it very flexible and easy to maintain.

palm2bookmarks

Tue, 27 Mar 2001 00:00:00 +0000

Description

This page will transform your Netscape (Communicator’s) bookmark file into a Palm Pilot Database file suitable for List DB. This way your can carry around your bookmarks in an easy to view way without having to Graffiti all those bookmarks by hand. Just enter your file in the box (or use the browse button) and click on ‘Get PDB file’. A download window will appear with the file.

Downloads

Elm2Mutt

Tue, 17 Aug 1999 00:00:00 +0000

Description

Converts the mail aliases of Elm to a list of aliases suited for the Mutt mail reader.

Downloads

elm2mutt-1.3.tar.gz

Mondriaan Art

Sat, 01 May 1999 00:00:00 +0000

This application produces Mondriaan (also known as Mondrian) like art. To help people remember what Mondriaan’s art looks like the site is in style of the paintings he made during his last years. Black horizontal and vertical lines that intersect forming rectangular areas that are coloured exclusively using white, black or one of the primary colours. Static Linux version available.

Mondriaan Art

Library for Evolutionary Algorithm Programming

Tue, 01 Sep 1998 00:00:00 +0000

Description

Downloads

Coevolutionary Genetic Algorithm

Sun, 01 Mar 1998 00:00:00 +0000

Description

This program was used in research on random constraint satisfaction problems. The code is based on work and ideas of Jan Paredis.

Downloads

coga-0.1.tar.gz

Grouping Genetic Algorithm

Wed, 01 Oct 1997 00:00:00 +0000

For performing experiments on graph k-colouring with the Grouping Genetic Algorithm (GGA) as introduced by E. Falkenauer. For problem instances it uses the Graph Coloring Problem Generator by Joe Culberson. All results in the paper included as a separate archive.

See the following papers for more details.

Graph Coloring with Adaptive Evolutionary Algorithms (A.E. Eiben, J.K. van der Hauw, J.I. van Hemert), In Journal of Heuristics, Kluwer Academic Publishers, volume 4, 1998.
Comparison of the SAW-ing Evolutionary Algorithm and the Grouping Genetic Algorithm for Graph Coloring (J.I. van Hemert, A.E. Eiben), Technical report, Leiden University, 1997.

Genea

Wed, 01 Jan 1997 00:00:00 +0000

Description

This application implements the Stepwise Adaptation of Weigths Algorithm (SAW) and can be used to run experiments on graph k-colouring instances created using the Graph Coloring Problem Generator of Joe Culberson.

Downloads

genea.tar.gz

VIM Macros

Mon, 01 Jan 1996 00:00:00 +0000

A collection of extraordinary macros from long time ago to be used with the everlasting Vim text editor.

VIM Macros

License

Mon, 01 Jan 0001 00:00:00 +0000

Software published before 2012 on this website is licenced under the GNU General Public License 2.0.

Anything that is not software, e.g., experimental results, problem instances, released before 2012 on this website is licensed under the Academic Free License.

Anything released since 2012 on this website is licensed under the Academic Free License.