Hewlett-packard Development Company, L.p.

Hewlett-packard Company

Hewlett-packard Corporation

Samsung Electronics Co., Ltd.

David Murray Banks

Jonathan Jedwab

Anthony J Wiley

James Andrew Davis

Mark Henry Butler

John S Erickson

Costas Calamvokis

Frederick A Perner

Kenneth Kay Smith

Gary D Zimmerman

Stewart R Wyatt

Terrence L Skaggs

Duncan Smith

Enrico Fedrigo

Sarah Morris Brandenberger

Brian W McBride

David H McIntyre

Terrel Munden

Russell Perry

Neil MacDougall

Scott Alan Stanley

Emanuela Roncaldier

David Everett Reynolds

Ruel Calalo

A digital repositoryincludes 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 clientby sending from a client to the digital repositorya request to access a data item, wherein the repository provides an interface description documentfrom the digital repositoryto the clientas the response to the request. The clientcan then transmit a data processing request from the client to a serviceidentified by the data processing identifier of the interface description document, the data processing request including the identifier from the interface description document.

Database extension structure

A directed graph of data includes nodes, propertiesattached to nodes and resources. The nodes, propertiesand resourcesare classified as indexable or non indexable. At least one propertylinks 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.

Indexing for data having indexable and non-indexable parent nodes

A client acceptsan input query, rewritesthe query and forwardsthe query to a database server, which returnsresults which are then rewritten. 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 rewrittento 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.

Client and method for database

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.

Asynchronous messaging in web services

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.

Database security structure

A method of providing internet access to a data object repository comprising managing data objects hosted by said repository using a generalised repository directed graph data model having object nodes and resources, said resources comprising at least one of

Digital object repositories, models, protocol, apparatus, methods and software and data structures, relating thereto

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 () which ten allots an anonymous client identifier (clientID) to the client for the purposes of that session. The purchaser () contacts a vendor computer (), 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 (), the purchaser () provides the clientID to the repository computer ().

Method and system for controlling the on-line supply of digital products or the access to on-line services

A magnetic memory which in some embodiments compares compressed fault maps is disclosed. In one embodiment, the magnetic memory may include at least two magnetic memory cells which are configured to store data. The magnetic memory includes a control system configured to periodically obtain parametric values from the magnetic memory cells and generate a corresponding compressed fault map using the parametric values. In some embodiments, at least one of the compressed fault maps is compared to a previous one of the compressed fault maps, and an indication is provided if there are differences.

Magnetic memory which compares compressed fault maps

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.

Document encryption

A system for error correction coding and decoding information is disclosed. In one embodiment, the first and second encoders are each configured to encode the information, wherein the second encoder has a higher capability than the first encoder. First and second decoders are configured to recover the information, wherein the second decoder recovers the information encoded by the second encoder only if the first decoder cannot recover the information.

System for error correction coding and decoding

A network layer bridge for connection between network segments with different data link layer addressing. The bridge has includes: plurality of ports, each for connection to different network segments, wherein a first port is for connection to a first network segment and a second port for connection to respective first and second network segment. The bridge also has a memory for storing network layer addresses, for nodes together with corresponding port identifiers and data link layer addresses, and the memory is adapted to store data link layer addresses of more than one type; the bridge also has a means for and a unit for discovering corresponding port identifier and data link layer address for a network layer address. For which these are not already known. The bridge is adapted to forwards a message from a first node connected through the first network segment to the first port to a second node connected through the second -network segment to the second port when the corresponding port identifier and data link level address for both the first and second nodes are stored in the memory; the message being addressed with the network layer address of the second node, and the network layer bridge directs directing the message through the corresponding port to the corresponding data link level address for the second node.

Method and apparatus for bridging between networks

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.

Identifying uncorrectable codewords in a Reed-Solomon decoder for errors and erasures

A system for configuring solid-state storage devices comprises a solid-state storage device and an error correction code (ECC) selection system. The ECC selection system is configured to automatically select a set of error correction code based on an error rate of the storage device. The ECC selection system is further configured to install the selected set of error correction code in the solid-state storage device.

System and method for configuring a solid-state storage device with error correction coding

A single polynomial expanderis time multiplexed to produce firstly a modified syndrome polynomial T(x) and then an erasure located polynomial &#x39b;(x). T(x) is supplied to a key equation solving unitwhich solves the key equation to calculate an error locator polynomial &#x3c3;(x) and an errata evaluator polynomial &#x3c9;(x). These polynomials &#x3c3;(x), &#x39b;(x) and &#x3c9;(x) form three inputs to polynomial evaluatorsand a Forney blockfor determining the location and magnitude of each symbol error and symbol erasure, allowing the received codeword to be corrected in a correction block. Optionally, a transform blockis provided to avoid unnecessary delay and improve throughput when decoding shortened codewords.

Reed-solomon decoder and decoding method for errors and erasures decoding

Embodiments of the present invention provide a magnetic memory. In one embodiment, the magnetic memory comprises an array of memory cells configured to provide resistive states, and a read circuit. The read circuit is configured to sense a resistance through a memory cell in the array of memory cells to obtain a sense result and categorize the sense result into one of at least three different categories comprising a middle category situated between the resistive states.

Growing community of inventors

Bristol, United Kingdom

David Murray Banks