This paper investigates how to make decentralised networks, amenable to external control, i.e., how to ensure that they are appropriately organised so that they can be effectively ‘reprogrammed’. In particular, we study networked systems whose interaction dynamics are given by a nearest-neighbour averaging rule, with one leader node providing the control input to the entire system. The main res...

The Möbius-Kantor map {4 + 4, 3} [CMo, §8.8, 8.9] is a regular orientable map of type {8, 3} and genus 2. It is a 2-sheeted covering of the cube {4, 3}, branched over the centers of its six faces, each of which lifts to an octagonal face. Its (orientation-preserving) automorphism group is isomorphic to GL2(3), a double covering of the automorphism group PGL2(3) ∼= S4 of the cube. The aim of thi...

This paper introduces a system which converts scanned line graphs into a data format which is interpretable by a haptic device. A virtual line graph can then be rendered and explored through touch by using the haptic device. This system provides an alternative method for blind or visually impaired people to access printed graphs. This method has a simpler production process than the conventiona...

We report an experiment in which people were asked to make a judgement about the gradient of a simple line graph. As part of the MultiVis project on data visualisation for blind people our aim was to discover how accurately linear graphs can be rendered using relatively simple technology: raised paper, and a haptic force-feedback mouse. Results show that both media allowed very accurate perform...

Department of Computing and Information Technology, Fudan University, Shanghai, China 2 Theoretical Systems Biology Lab , School of Life Science, Fudan University, Shanghai, China Human Genetics Center, University of Texas Health Science Center at Houston, Houston, TX 77225, USA Abstract In recent years, evaluating graph distance has become more and more important in a variety of real applicati...

One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...