[Home] [Databases] [World Law] [Multidatabase Search] [Help] [Feedback] | ||
England and Wales High Court (Patents Court) Decisions |
||
You are here: BAILII >> Databases >> England and Wales High Court (Patents Court) Decisions >> Cappellini & Bloomberg, Re [2007] EWHC 476 (Pat) (13 March 2007) URL: http://www.bailii.org/ew/cases/EWHC/Patents/2007/476.html Cite as: [2007] FSR 26, [2007] EWHC 476 (Pat), [2007] Info TLR 97 |
[New search] [Printable RTF version] [Help]
(2) CH/2006/APP/0481 |
CHANCERY DIVISION
PATENTS COURT
Royal Courts of Justice Strand, London, WC2A 2LL |
||
B e f o r e :
____________________
IN THE MATTER OF THE PATENTS ACT 1977 |
||
- and - |
||
(1) IN THE MATTER OF UK Patent Application No. GB 2381884A in the name of PABLO CAPPELLINI AND IN THE MATTER OF AN APPEAL from the decision of the Comptroller-General of Patents dated 13 June 2006 -and- (2) IN THE MATTER OF UK Patent Application No. GB 2395941A in the name of BLOOMBERG LP AND IN THE MATTER OF AN APPEAL from the decision of the Comptroller -General of Patents dated 15 June 2006 |
____________________
Richard Davis (instructed by Marks & Clerk Patent Attorneys) for Bloomberg LP
Michael Tappin (instructed by Treasury Solicitor) for the Comptroller-General
Hearing dates: (1) 11 December 2006 (2) 12 December 2006
____________________
Crown Copyright ©
Mr Justice Pumfrey :
Introduction
Section 1(2) – the Law
"42. No-one could quarrel with the first step – construction. You first have to decide what the monopoly is before going on to the question of whether it is excluded. Any test must involve this first step.
43. The second step – identify the contribution – is said to be more problematical. How do you assess the contribution? [Counsel] submits the test is workable – it is an exercise in judgment probably involving the problem said to be solved, how the invention works, what its advantages are. What has the inventor really added to human knowledge perhaps best sums up the exercise. The formulation involves looking at substance not form – which is surely what the legislator intended.
44. [Counsel] added the words "or alleged contribution" in his formulation of the second step. That will do at the application stage – where the Office must generally perforce accept what the inventor says is his contribution. It cannot actually be conclusive, however. If an inventor claims a computer when programmed with his new program, it will not assist him if he alleges wrongly that he has invented the computer itself, even if he specifies all the detailed elements of a computer in his claim. In the end the test must be what contribution has actually been made, not what the inventor says he has made.
45. The third step – is the contribution solely of excluded matter? – is merely an expression of the "as such" qualification of Art.52(3). During the course of argument [Counsel] accepted a re-formulation of the third step: Ask whether the contribution thus identified consists of excluded subject matter as such? We think either formulation will do – they mean the same thing.
46. The fourth step – check whether the contribution is "technical" – may not be necessary because the third step should have covered that. It is a necessary check however if one is to follow Merrill Lynch as we must."
"[The four steps ask] the same questions but in a different order. Fujitsu asks first whether there is a technical contribution (which involves two questions: what is the contribution? is it technical?) and then added the rider that a contribution which consists solely of excluded matter will not count as a technical contribution."
Bloomberg LP's Application
"1. A method of distributing data to users of a computer system, comprising:
identifying, from a plurality of formatted financial data records, data records to be electronically transferred to a plurality of users of the computer system in accordance with data indicating the data record or records that are to be delivered to respective users; and
mapping each identified data record for each user to whom the record is to be transferred in accordance with data indicating mapping of the respective data record for at least one application operable on a computer terminal accessible by the user to whom the data record is to be delivered.
2. A method according to claim 1, wherein the step of mapping each identified data record comprises mapping each identified data record in accordance with data specific to each of the plurality of users.
…
5. Computer readable medium or media having programming stored thereon for causing a computer system to:
identify, from a plurality of formatted financial data records, data records to be electronically transferred to a plurality of users of the computer system in accordance with data indicating the data record or records that are to be delivered to respective users; and
map each identified data record for each user to whom the record is to be transferred in accordance with data indicating mapping of the respective data record for at least one application operable on a computer terminal accessible by the user to whom the data record is to be delivered.
…
14. The medium or media of claim 5 or claim 6, wherein the programming causes the computer system to map data records in accordance with data indicating different mappings for a plurality of applications."
What does Claim 1 cover?
"One or more programs installed in the computer system or network, for example on traders' terminals and/or trading firms' network computers, e.g., servers and host computers, and/or on servers provided by financial information providers, receive input from the respective clients, or users, (or from one or more user sub-systems associated with such clients, for example individual traders' terminals installed for trading firm clients), specifying those portions of the data stream the client or each subclient (user) wishes to receive (in the case of a larger client system, the union of all subclient requests), and a format (or table of formats) in which the user wishes the data to be mapped. Mapping can include both the order of data subrecords (a subrecord comprising one or more data elements) within individual data records and the format of the subrecords (e.g., typeface, decimal placement, scientific notation, etc.), as well as the order in which the records are routed to and stored by the requesting user. Alternatively or in addition, mapping may include the filtering of individual elements or subrecords, so that only selected elements or record subsets are received by a given user."
The advantage of mapping data in this way is explained earlier in the specification at page 2 line 11:
"Systems and methods according to the invention facilitate downloading and distribution of streams of financial data, such as information relating to transactions in stocks or bonds, currency exchange, and present and forward interests in energy and other commodities, from a financial data source such as the BLOOMBERG PROFESSIONAL® system to one or more networks or computer systems, for use in and/or further processing by, for example, applications such as spreadsheets run on terminals. Systems and methods according to the invention facilitate the use of such data by mapping data identified for distribution to users of applications such as spreadsheets run on client, or user, terminals into forms specified by the users for use with their applications. Data may be mapped by, for example, modifying identifiers such as record type tags associated with the data according to user specifications, modifying the order and/or format of individual data elements included in data records, deleting portions of records, associating portions of individual records with each other, and assigning to data records specific addresses within data structures usable by the applications for which the data records are mapped."
The physical aspects of the system are described at page 13 line 1 and the structure of the software at page 8 line 28. It is not suggested, I think, that any of the hardware specified cannot be met by a conventional general-purpose computer programmed to operate in a suitable networked environment.
Mr Cappellini's Application
"A computer implemented search and retrieval system of trajectory-related capabilities, which can be represented by flexibly-defined paths applicable to the search of transportation-related routes representing available transportation-related capabilities, providing also for these an optional reservation system. A location system is used to define locations and to define loci in the proximity of these locations in order to represent catchment operation areas. The system can search for single independent service providers as well as a combination of two or more independent service providers, capable of fulfilling the transport-related requirements specified by a service user or an information seeker. The transportation-related paths representing available transportation related capabilities are defined by elements comprising waypoints and associated spaces or areas, as well as with other constraints such as time windows and capacity, which are input into path database as well as organized and associated in a series of indexes in a structure format, typically with the aid of a spatial or geographical information system. The associated spaces or areas of the transportation-related paths permit the system to find matches by proximity between the service provider and the transport requirements of the service user, or combinations by proximity, of service providers between each other, to fulfil a specified transport requirement."
"10. … But to avoid any misunderstanding over what I have considered the advance to be, I shall restate it using my own words. As I understand it, Mr Cappellini's invention is a new algorithm for planning a delivery route for a package, using a network of carriers. The algorithm is said to be new and not obvious because it permits the individual carriers in the network to deviate from their normal, predefined route in order to create new meeting places (called "nodes" or "relay points") where (in practice) two or more carriers can exchange one or more packages.
11. The movement and/or delivery of the packages themselves is not part of the invention as claimed, but nothing rests on this distinction. When the claims are correctly construed, the heart of the invention, and the contribution to the art, is the algorithm that works out where potential nodes or relay points in a distribution network could be generated.
12. According to the prior art, as Mr Cappellini explained it to me, the algorithm would only have searched for relay points among existing nodes – i.e. times and places where the different carriers were routinely scheduled to meet. In order to expand such an algorithm to include the additional flexibility that is provided by allowing the carriers to deviate from their normal routes, Mr Cappellini has had to redesign the interface that is used to input the flexible paths to the algorithm, as well as the core of the algorithm that searches for potential relay points."
The Hearing Officer set out claim 1 of the specification. I think it is helpful to consider the claims of the specification as they are annexed to the Decision. I shall, accordingly, consider the family of claims set out below:
"1. A relay detection and coordination system for a computer-implemented geographically-simulated network of flexibly-defined paths, said paths corresponding to paths of real transportation carriers each having a predefined degree of geographical operational flexibility, which are to be coordinated, said system comprising:
(a) a computerised geographical information system comprising a location system
[(b)] a computerised relational path database, wherein for each flexibly-defined path there is provided:
at least a waypoint or node,
at least an associated area related to said waypoint or node, said area representing a predefined degree of geographical operational flexibility, both said waypoints and said areas, identifiable by coordinates in said location system, and
a linkability condition,
(c) an interface means for the input of a first location and at least a second location which need to be connected together by means of a relay,
(d) a computer-implemented detection algorithm that, in use, uses data obtained from the interface means, the relation path database and from the geographical information system, said detection algorithm arranged to detect a relay according to a predefined criteria, wherein a set of detected paths constituting the relay is linked between each other by using at least one associated area of at least one of said detected paths,
(e) an output means set up to transmit operational coordination data to each real transportation carrier represented by each of the detected paths, whereby each real transportation carrier can, in use, be coordinated using this data, within its predefined area of geographical operational flexibility, so as to become a functional part of a real transport relay operation that mimics the relay detected in the geographically-simulated network.
…
11. A method of coordinating a transportation process involving a relay, based on detection of a relay in a computer-implemented geographically-simulated network of flexibly-defined paths, said paths corresponding to paths of real transportation carriers each having a predefined degree of geographical operational flexibility, which are to be coordinated, said method comprising:
providing a computerised geographical information system comprising a location system,
providing a computerised relational path database, wherein for each flexibly defined path there is provided:
at least a waypoint or node,
at least an associated area related to said waypoint or node, said area representing a predefined degree of geographical operational flexibility, both said waypoints and said areas, identifiable by coordinates in said location system, and
a linkability condition,
providing an interface means for the input of a first location and at least a second location which need to be connected together by means of a relay,
providing a computer-implemented detection algorithm that uses data obtained from the interface means, the relation path database and the geographical information system
detecting with said computer-implemented detection algorithm a relay according to a predefined criteria, wherein a set of detected paths constituting the relay is linked between each other by using at least one associated area of at least one of said detected paths,
providing an output means set up to transmit operational coordination data to each real transportation carrier represented by each of the detected paths,
transmitting operational coordination data to each said real transportation carriers, whereby each said real transportation carriers can be coordinated using this data, within its predefined area of geographical operational flexibility, so as to become a functional part of a real transport relay operation that mimics the relay detected in the geographically-simulated network,
the operational coordination data for use in the coordination or control of an industrial transportation process involving a relay.
12. A network relay transportation system comprising a distributed management and coordination system and a plurality of transport carriers that form a network, the management and/or control system comprising:
a communications means (066, 053),
spatial information and location means (059, 058) capable of discrete storage, retrieval, manipulation and computation of spatial or geographic data related to spatial or geographically-coded elements capable of identifying a location in the said location means
an operative link to an electronic relational database (5106, 075) representative of the network to be managed, the database having stored therein a plurality of carrier transport paths representing the functional operation or future functional operations of said plurality of transport carriers said paths defined by at least one waypoint parameter (031, 2736), at least an associated area/space (030, 106, 108, 2754) and at least a link ability condition (110 in part, 2756) both said area/space and link condition related to said at least one waypoint parameter (110)
computerised search and retrieval means (065) operatively linked to said database for finding and assembling combinations of said paths or partial parts of said paths which linked together can perform the said requested task
input/output means (053) operatively linked to first interface means (2700-2954) arranged for inputting data, relating to at least [one] of said transport paths, into said electronic relational database, said interface means comprising means for defining:
a waypoint parameter (2736)
an associated area/space (2746)
and a link ability (2748) condition,
said input/output means (053) further operatively linked to second interface means (2955-2994) arranged for inputting data, relating to a transport connection task between a first location and at least a second location, into said electronic relational database, said interface means comprising:
means for defining said first location (5110),
means for defining one of (i) a second location (5112) or (ii) a function parameter (5140)
means for default selection, or third interface means for active selection (1434) of at least one possible option (1430) available for the requested task, said third interface means operatively linked to said input/output means,
said input/output means (053) further capable, upon active or default selection on said selection means, of conveying carrier task instructions (1460, 1462, 1468, 1470, 3010, 3012, 3016, 3018, 2994, 095, 1462, 3012), for the execution of a connection task,
said communication means arranged, in combination with said output means, and upon said active or default selection, to relay a plurality of connection task instructions, to a plurality of system-selected carriers involved in the selected possible option(s) (1420),
said system-selected carriers having their operations represented in said database, instruction receiving means and operator means for modifying their functional operation according to said task instructions in a manner so that said carriers can be linked between each other to form a relay that performs the said transport connection task.
13. A method of processing of loads comprising the steps of
Providing a GIS system that converts at least one flexible path planned by a carrier, each path defined by at least one waypoint parameter and at least one associated area parameter, into a set of coordinates that represent the said flexible path,
Storing said paths along with at least one linking condition for at least one waypoint parameter or associated area, into a searchable database,
Providing an interface to accept a load processing request from a first location to at least a second location,
Said GIS system further capable of converting said first and second locations into a second set of coordinates that represent said locations,
Determining coordinate match between said location coordinates and said flexible path coordinates,
Retrieving from the said database a set of flexible path coordinates corresponding to each path where at least one coordinate has been matched to the first location and to each path where at least one coordinate has been matched to the at least second location, said set being only of coordinates related to the at least one waypoint or associated area that was stored with at least one linking condition,
Determining coordinate match between at least two of said set of coordinates corresponding to different paths, at least one matched with the first location and at least another matched with at least one second location,
Determining a relay between two paths whose flexible area combined matches that of the first location and at least one of the second locations,
Coordinating the carriers represented by the two paths, by transmitting operative data for mimicking the said relay determined in the above step, so as to process a load according to the said load processing request,
Said method for use in the coordination, or control-via-operator-or-transducer of the physical processing of loads in relay fashion."