Abstract:
A method of invoking a service of a Web service provider using a client terminal comprises obtaining a template WSDL binding definition, communicating with the Web service to request the generation of a concrete WSDL binding and invoking the Web service using the concrete WSDL binding. A method is also provided for a Web services provider to provide asynchronous callback messages to a client, as well as the client and Web server apparatus.
Abstract:
Encryption of documents is used to restrict access to such documents to those users who have the appropriate decryption keys. The encryption of documents on public web servers hitherto has prevented indexing by search engines. By keeping words and possible sentences or paragraphs intact in the encrypted document but re-ordering elements of the document to prevent the document being human-readable, the possibility of encrypted documents being indexed by search engines is provided.
Abstract:
A client accepts 20 an input query, rewrites 22 the query and forwards 24 the query to a database server, which returns 26 results which are then rewritten 28. The database includes classes arranged hierarchically as superclasses and subclasses, and/or properties also arranged hierarchically as superproperties and subproperties. In embodiments, the query is rewritten 22 to replace each instance of each class and each property in the input query with the transitive closure of the respective class or property. The client allows inferencing whether or not this is supported by the database server.
Abstract:
A method and apparatus for identifying uncorrectable Reed-Solomon codewords in the presence of Reed-Solomon codewords which may have errors and erasures and otherwise be correctable.
Abstract:
A single polynomial expander 22 is time multiplexed to produce firstly a modified syndrome polynomial T(x) and then an erasure located polynomial Λ(x). T(x) is supplied to a key equation solving unit 32 which solves the key equation to calculate an error locator polynomial σ(x) and an errata evaluator polynomial ω(x). These polynomials σ(x), Λ(x) and ω(x) form three inputs to polynomial evaluators 52–56 and a Forney block 62 for determining the location and magnitude of each symbol error and symbol erasure, allowing the received codeword to be corrected in a correction block 72. Optionally, a transform block 42 is provided to avoid unnecessary delay and improve throughput when decoding shortened codewords.
Abstract:
A database structure that may be used for semistructured databases assigns each node of a database to a collection. For each collection, create rights, retrieve rights, associate rights and dissassociate rights are provided to one or more users, the rights being assigned in common for all nodes of the collection. Users can only carry out the task if they have the appropriate rights. In this way, a flexible database security structure is provided that can deliver appropriate security for different elements of a semistructured database.
Abstract:
An information storage device is disclosed. In one embodiment, the information storage device includes first and second memory cells which store complementary first and second logic states. An error detection system coupled to the first and second memory cells is configured to indicate an error if a difference between a first current flowing through the first memory cell and a second current flowing through the second memory cell is less than a predefined value.
Abstract:
A digital repository 20 includes data items. A user can add additional functionality or program routines to data item by including as a data item a data processing identifier pointing to at least one data processing routine. Such routines are accessed by a client 22 by sending from a client to the digital repository 20 a request to access a data item, wherein the repository provides an interface description document 32 from the digital repository 20 to the client 22 as the response to the request. The client 22 can then transmit a data processing request from the client to a service 26 identified by the data processing identifier of the interface description document 32, the data processing request including the identifier from the interface description document.
Abstract:
A directed graph of data includes nodes 10, properties 22 attached to nodes and resources 34. The nodes 10, properties 22 and resources 34 are classified as indexable or non indexable. At least one property 30 links a pair of nodes, one node being a parent and one being a child. An indexing algorithm indexes each indexable property pointing to a resource as related to any respective indexable nodes linked to the node to which the indexable property is attached through a chain of indexable links from child to parent through intermediate nodes, all of which are non-indexable.
Abstract:
The invention is concerned with enabling substantially anonymous purchases of media products or other products (or access to an on-line service) to be made on-line. In order to initiate a purchasing session, consisting of one or more purchasing transactions, the purchaser authenticates himself to a home provider computer (3) which ten allots an anonymous client identifier (clientID) to the client for the purposes of that session. The purchaser (1) contacts a vendor computer (6), using the anonymous identifier (clientID) and an anonymising HTTP proxy, in order to place an order for one or more products or services for which the vendor computer has the right to authorize delivery. In order to obtain delivery of the product or service from the repository computer (5), the purchaser (1) provides the clientID to the repository computer (3).