Patents by Inventor David Geoffrey Slack-Smith

David Geoffrey Slack-Smith has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 7627644
    Abstract: A method (100) of caching data is disclosed. The method (100) optimises proactive caching of data by estimating future demand for particular data within a computer system (1900). The computer system (1900) is typically configured in accordance with the hybrid peer-to-peer model. The method (100) maintains the bandwidth cost of proactive caching in proportion to expected demand for particular data. The method (100) also determines the availability of a peer. The availability of a peer is defined herein as the probability of a peer being online, for example, when particular data is required by another peer.
    Type: Grant
    Filed: November 22, 2004
    Date of Patent: December 1, 2009
    Assignee: Canon Kabushiki Kaisha
    Inventor: David Geoffrey Slack-Smith
  • Patent number: 7594163
    Abstract: A method (100), apparatus (200) and computer program product for editing an electronic document is disclosed. Editorial modifications that a first collaborator has made to the document are published. Receipt of the modifications is acknowledged by one or more other collaborators and the published modifications are merged with any local modifications to produce a merged version of said modifications. The merged modifications are applied to the document to produce an edited version of the document including the editorial modifications. The edited version containing data incorporated therein indicating acknowledgment of the editorial modifications by one or more of the collaborators.
    Type: Grant
    Filed: July 29, 2004
    Date of Patent: September 22, 2009
    Assignee: Canon Kabushiki Kaisha
    Inventor: David Geoffrey Slack-Smith
  • Patent number: 7225447
    Abstract: A method (100) of connecting a first object to a second object is disclosed The first and second objects each comprise at least one associated interface defining a communication protocol for each of the objects. The method (100) examines the communications protocols associated with each of the interfaces of the first and second objects. The method (100) associates a first mapping pointing to the second object with the first object and associates a second mapping pointing to the first object with the second object, if the first and second objects use a compatible communications protocol and the interfaces associated with each of the first and second objects define different sides of the compatible communications protocol.
    Type: Grant
    Filed: September 5, 2002
    Date of Patent: May 29, 2007
    Assignee: Canon Kabushiki Kaisha
    Inventors: Martin Paul Tlaskal, David Geoffrey Slack-Smith
  • Publication number: 20030056024
    Abstract: A method (100) of connecting a first object to a second object is disclosed The first and second objects each comprise at least one associated interface defining a communication protocol for each of the objects. The method (100) examines the communications protocols associated with each of the interfaces of the first and second objects. The method (100) associates a first mapping pointing to the second object with the first object and associates a second mapping pointing to the first object with the second object, if the first and second objects use a compatible communications protocol and the interfaces associated with each of the first and second objects define different sides of the compatible communications protocol.
    Type: Application
    Filed: September 5, 2002
    Publication date: March 20, 2003
    Inventors: Martin Paul Tlaskal, David Geoffrey Slack-Smith
  • Publication number: 20030052919
    Abstract: A method of updating a route currently being executed by an animated state machine is disclosed. The animated state machine is associated with a graphical object and comprises a plurality of states each of which corresponds to a mode of rendering the graphical object. Each of the states has an associated state transition representing a transition of the graphical object between the states. The route comprises a first sequential plurality of the state transitions. The method removes any previously executed state transitions from the currently executing route and selects a second sequential plurality of remaining state transitions to represent a new route between a current state of the graphical object and a destination state.
    Type: Application
    Filed: September 5, 2002
    Publication date: March 20, 2003
    Inventors: Martin Paul Tlaskal, David Geoffrey Slack-Smith, Alexander Will