Abstract: A data visualization system is disclosed that includes a data value memory, a display, and contour generator. The data value memory maintains a finite set of data values. The display is arranged to display a representation of each data value centered on respective data points. The contour generator is arranged to generate and display a representation having a cross-sectional shape of a bell-shaped curve in which each data point is displayed as an apex of the bell-shaped curve. Also disclosed is a method of data visualization and a data visualization computer program.

Abstract: A data visualisation system is disclosed that includes a data value memory, a display, and contour generator. The data value memory maintains a finite set of data values. The display is arranged to display a representation of each data value centered on respective data points. The contour generator is arranged to generate and display a representation having a cross-sectional shape of a bell-shaped curve in which each data point is displayed as an apex of the bell-shaped curve. Also disclosed is a method of data visualisation and a data visualisation computer program.

Abstract: The invention provides a data visualization system comprising a data value memory in which is maintained a finite set of data values and display means arranged to display a contoured representation. One or more of the data values are displayed as contours around one or more data points and each data value is centered on a data point. The invention also provides a method of data visualization and a data visualization computer program.

Abstract: The invention provides a data visualisation system comprising a data value memory in which is maintained a finite set of data values and display means arranged to display a contoured representation. One or more of the data values are displayed as contours around one or more data points and each data value is centred on a data point. The invention also provides a method of data visualisation and a data visualisation computer program.

Abstract: The invention provides a data visualisation system comprising a data value memory in which is maintained a finite set of data values and display means arranged to display a contoured representation. One or more of the data values are displayed as contours around one or more data points and each data value is centred on a data point. The invention also provides a method of data visualisation and a data visualisation computer program.

Abstract: The invention provides an electronic document indexing system comprising a memory in which is stored one or more index entries, each index entry comprising a unique keyword and one or more data items, one or more of the data items representing the address of an electronic document accessible over a network; a query component configured to parse a user query into terms and operators relating the terms; a search engine configured to retrieve one or more index entries satisfying the query from the memory; a retrieval component configured to extract one or more electronic document addresses from the retrieved index entry or entries and to retrieve the electronic document(s) over the network; and a display configured to present the retrieved electronic documents to a user. The invention further provides a related electronic document index and a method of indexing electronic documents.

Abstract: The present invention provides a method of planning a travel route including maintaining in a memory a reference database comprising one or more travel data sets, each travel data set representing a travel option from a travel origin to a travel destination and including an origin identifier and a destination identifier, obtaining one or more travel preferences for a travel route from a user, retrieving one or more travel data sets from the reference database to construct one or more candidate travel plans, calculating a plurality of penalty values based on the user travel preferences, each penalty value associated with a corresponding travel data set, and selecting one or more candidate travel plans so as to minimize the sum of penalty values associated with the travel data sets of a candidate travel plan. The present invention encompasses hardware, software and firmware suitable to accomplish the method.

Abstract: The invention provides a method of generating a surface to represent a finite set of data points. The method comprises the steps of calculating the value of each data in the finite set, calculating the value of additional data points which are not members of the finite set based on the distance of the additional data points from one or more neighbouring data points in the finite set, and displaying the surface by displaying representations of the values of the data points in the finite set and representations of the values of the additional data points. The invention in another form provides an associated system for generating a surface and an associated computer program for generating a surface.

Abstract: The invention provides a method of generating a graphical representation of two or more finite sets of elements, the method comprising the steps of calculating the number of elements in each set, the number of elements in the union of all sets, and the number of elements in each set intersection; displaying a plurality of closed curves, the closed curves representing respective sets, the are bounded by each closed curve being proportional to the ratio of the number of elements in the corresponding set to the number of elements in the union of all sets; and aligning each closed curve relative to each other closed curve, the area bounded by the overlap of each curve being proportional to the ratio of the number of elements in the corresponding set intersection to the number of elements in the union of all sets.

Abstract: The present invention provides a method of planning a travel route including maintaining in a memory a reference database comprising one or more travel data sets, each travel data set representing a travel option from a travel origin to a travel destination and including an origin identifier and a destination identifier, obtaining one or more travel preferences for a travel route from a user, retrieving one or more travel data sets from the reference database to construct one or more candidate travel plans, calculating a plurality of penalty values based on the user travel preferences, each penalty value associated with a corresponding travel data set, and selecting one or more candidate travel plans so as to minimize the sum of penalty values associated with the travel data sets of a candidate travel plan. The present invention encompasses hardware, software and firmware suitable to accomplish the method.

Abstract: The present invention provides a method of matching data sets including the steps of Maintaining one or more user data sets in a user data memory, maintaining one or more reference data sets in a reference data memory, retrieving a user data set from the user data memory, retrieving one or more reference data sets from the reference data memory, the one or more retrieved reference data sets matching or partially matching the user data set, and compiling a list of candidate reference data sets from the one or more retrieved reference data sets.