Patents by Inventor Herve Ruellan

Herve Ruellan 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).

  • Publication number: 20150019676
    Abstract: The present invention relates to the exchange of data between a server and a receiving device. The exchange method comprises receiving, at the receiving device, a push message comprising pushed data from the server; storing received pushed data in a cache memory of the receiving device, the stored data being identified as being of push type; transmitting, from the receiving device to the server, a request for data comprising information about pushed data stored in the cache memory of the receiving device; and receiving, from the server, at the receiving device, a response to said request comprising requested data.
    Type: Application
    Filed: July 9, 2014
    Publication date: January 15, 2015
    Inventors: YOUENN FABLET, NAEL OUEDRAOGO, HERVE RUELLAN
  • Patent number: 8930924
    Abstract: This invention relates to a method of encoding a path in layered form so as to allow partial decoding and progressive rendering while decoding. The path is made of an original sequence of original draw commands, each corresponding to an original portion of a drawing. The method of encoding includes transforming at least one original draw command into an approximating draw command according to a geometrical approximation of the corresponding original portion of a drawing, to obtain a reduced sequence, encoding the reduced sequence into an encoded reduced sequence, and encoding a reconstruction information set representing the difference between the reduced sequence and the original sequence.
    Type: Grant
    Filed: June 15, 2010
    Date of Patent: January 6, 2015
    Assignee: Canon Kabushiki Kaisha
    Inventors: Youenn Fablet, Romain Bellessort, Franck Denoual, Hervé Ruellan
  • Publication number: 20140355627
    Abstract: Methods and devices for encoding or decoding messages, each message including a list of information items. The encoding method comprises determining a first list of indexes associated with information items that are already indexed in a local indexing table and a second list of literal values of other information items not yet indexed in said indexing table; encoding the indexes of the first list; binary compressing at least a serialized binary representation of the literal values of the second list; and concatenating the first list and the second list together to obtain an encoded bitstream of the information items. When the messages are sent over a plurality of connections, a global table is shared between the connections to store the indexed items of information; and a local indexing table for each connection associates indexes with references to an entry of the shared global table.
    Type: Application
    Filed: November 5, 2012
    Publication date: December 4, 2014
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Romain Bellessort, Youenn Fablet, Hervé Ruellan
  • Patent number: 8819232
    Abstract: The present invention relates to a method and a system for managing access to a resource, copies of which are hosted in apparatuses of one or more networks. The method comprises obtaining a list comprising a plurality of references pointing to the plurality of copies of the resource; for each of said references, determining at least one accessibility rating representing the accessibility of the corresponding copy for the given user device, and, based on the at least one accessibility rating, deciding between keeping the corresponding reference in the list or deleting it therefrom, to obtain an updated list; and selecting a reference from the updated list for the given user device to access the resource.
    Type: Grant
    Filed: January 17, 2012
    Date of Patent: August 26, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Romain Bellessort, Youenn Fablet, Herve Ruellan
  • Patent number: 8788509
    Abstract: The method of coding a hierarchized document comprises, for at least one element contained in the document: a step (200, 210, 220) of creating at least one pattern which describes at least structural information of said element and a step (230, 330) of selecting use, or not, of at least one of the created patterns, said selection depending on the efficiency of a coding operation of a set of instances of the created pattern, said coding operation implementing said created pattern. Preferentially, the method comprises a step of creating at least two patterns which describe at least structural information of said element and a step of selecting a pattern from among the created patterns, on the basis of the efficiency of each coding operation of a set of instances of the created patterns, by implementing one of the created patterns.
    Type: Grant
    Filed: April 2, 2008
    Date of Patent: July 22, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Hervé Ruellan, Roamin Bellessort
  • Patent number: 8751678
    Abstract: The present invention concerns a method of generating a syndication web feed (10) composed of entries (12) corresponding to content elements, and an associated system. The method comprises the steps consisting of: determining (E110, E221, E300) at least one activity parameter (A) representing a frequency of obtaining content elements to be published; calculating (E620, E770) at least one similarity value (SI) between a content element (IT) to be published in the web stream (10) and at least one entry (E) in said web stream; selecting (E130, E640) an entry (EP) in said web stream according to the at least one calculated similarity value (SI) and the at least one determined activity parameter (A); adding (E140) said content element to be published (IT) to said selected entry.
    Type: Grant
    Filed: November 5, 2010
    Date of Patent: June 10, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Romain Bellessort, Youenn Fablet, Hervé Ruellan
  • Patent number: 8706884
    Abstract: The present invention relates to an augmented data structure representing the availability of resources in a communication device, such as an augmented Bloom filter. A method of generating and using the augmented data structure comprises: providing first and additional groups of resources available in the same communication device; providing one or more hash functions for each of the first and additional groups, and calculating one or more hash values for each resource using the one or more corresponding hash functions; mapping each obtained hash value onto one entry of a data structure, wherein the hash values obtained from a resource of the first group are mapped onto a first subpart of the data structure only, such as a conventional Bloom array, and the hash values obtained from a resource of an additional group are mapped onto a portion of the data structure including the first subpart and an additional subpart.
    Type: Grant
    Filed: June 19, 2012
    Date of Patent: April 22, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Herve Ruellan, Romain Bellessort, Youenn Fablet
  • Patent number: 8698657
    Abstract: The present invention relates to data compression using compression dictionary. A compression method according to the invention comprises obtaining an initial compression dictionary and a separate secondary dictionary SD; determining at least one subpart of the secondary dictionary that correlates with a block of data DB to compress; updating the initial compression dictionary by inserting the determined at least one subpart therein, to obtain an updated compression dictionary used for compressing the block of data; and compressing the block of data using one or more references to entries of the obtained updated compression dictionary.
    Type: Grant
    Filed: September 10, 2012
    Date of Patent: April 15, 2014
    Assignee: Canon Kabushiki Kaisha
    Inventors: Youenn Fablet, Romain Bellessort, Hervé Ruellan
  • Publication number: 20140070966
    Abstract: The present invention relates to data compression using compression dictionary. A compression method according to the invention comprises obtaining an initial compression dictionary and a separate secondary dictionary SD; determining at least one subpart of the secondary dictionary that correlates with a block of data DB to compress; updating the initial compression dictionary by inserting the determined at least one subpart therein, to obtain an updated compression dictionary used for compressing the block of data; and compressing the block of data using one or more references to entries of the obtained updated compression dictionary.
    Type: Application
    Filed: September 10, 2012
    Publication date: March 13, 2014
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Youenn Fablet, Romain Bellessort, Hervé Ruellan
  • Publication number: 20140075453
    Abstract: The invention relates to a method for controlling communication between web applications in a web runtime environment such as a web browser. The method comprises the step of: executing code of a service provider application by the web runtime environment thereby providing a data object; obtaining a list of one or more service requester applications, each service requester application being adapted to generate a service request and implementing an interface for receiving a data object in response to the generated service request; enabling the selection, among the obtained list, of one or more requester applications adapted to receive data objects of the same type as the provided data object; and communicating the provided data object to the selected one or more requester applications via their corresponding interface. The invention also relates to a computer program and a processing device adapted to execute the method.
    Type: Application
    Filed: September 6, 2013
    Publication date: March 13, 2014
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Romain BELLESSORT, Youenn FABLET, Herve RUELLAN
  • Publication number: 20130339472
    Abstract: The present invention relates to the notification of a server device with the availability of resources in cache memories of a client device and to the serving of digital resources in such a client-server communication system. The notifying method comprises: obtaining a first list of resources available in the cache memories of the client device; filtering the first list according to filtering criteria relating to a resource parameter, to obtain a filtered list of fewer resources available in the client device or splitting the first list according to splitting criteria relating to a resource parameter, to obtain a plurality of sub-lists of resources available in the client device; and notifying the server device with data structures representing the filtered list or sub-lists of resources.
    Type: Application
    Filed: June 19, 2012
    Publication date: December 19, 2013
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Herve RUELLAN, Youenn FABLET, Romain BELLESSORT
  • Publication number: 20130339526
    Abstract: The present invention relates to an augmented data structure representing the availability of resources in a communication device, such as an augmented Bloom filter. A method of generating and using the augmented data structure comprises: providing first and additional groups of resources available in the same communication device; providing one or more hash functions for each of the first and additional groups, and calculating one or more hash values for each resource using the one or more corresponding hash functions; mapping each obtained hash value onto one entry of a data structure, wherein the hash values obtained from a resource of the first group are mapped onto a first subpart of the data structure only, such as a conventional Bloom array, and the hash values obtained from a resource of an additional group are mapped onto a portion of the data structure including the first subpart and an additional subpart.
    Type: Application
    Filed: June 19, 2012
    Publication date: December 19, 2013
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Herve RUELLAN, Romain BELLESSORT, Youenn FABLET
  • Publication number: 20130246583
    Abstract: The present invention relates to transmitting a digital resource in a client-server communication system. A disclosed method comprises at a main server device: receiving a request for a main resource from a client device; determining at least one missing secondary resource, wherein the at least one missing secondary resource is at least one resource associated with said requested main resource and missing at the main server device; and requesting a secondary server device to push the at least one missing secondary resource to the client device. Thanks to the push initiated by the main server device, the secondary resources required by the main resource become available at the client device before the latter discovers that they are required to exploit or display the main resource.
    Type: Application
    Filed: March 11, 2013
    Publication date: September 19, 2013
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: ROMAIN BELLESSORT, YOUENN FABLET, Hervé RUELLAN
  • Patent number: 8381097
    Abstract: Method and device for binary coding a structured document comprising a plurality of data are disclosed. After having determined (130) at least one parameter of a first coding scheme (130) and of at least one second coding scheme (140) according to said at least one parameter of said first coding scheme, said first and said at least one second coding scheme being of the same type, at least one item of data of said plurality of data is obtained. The coding efficiencies of said at least one item of data according to said first and said at least one second coding schemes are evaluated and compared (160). Depending on said comparison, said at least one item of data is coded (170) according to said first or said at least one second coding scheme.
    Type: Grant
    Filed: June 15, 2010
    Date of Patent: February 19, 2013
    Assignee: Canon Kabushiki Kaisha
    Inventors: Hervé Ruellan, Romain Bellessort
  • Publication number: 20120330984
    Abstract: The present invention concerns a method for processing a structured document to render, such as XML or HTML files. The method comprises the steps of: parsing the structured document into parsed tokens TK of structured data; constructing a first tree structure DTree storing the structured data of parsed tokens; constructing a render tree structure RTree storing the document content to render, said render tree structure being synchronized with the first tree structure; rendering the structured document based on the render tree structure RTree; wherein constructing the first tree structure DTree comprises deciding, for each parsed token TK, whether or not the parsed token is to be stored in said first tree structure, and storing the structured data of the parsed token therein only in case of positive decision. Partial first (DOM) tree DTree is therefore stored in memory, reducing memory use and processing time before rendering the structured document.
    Type: Application
    Filed: June 13, 2012
    Publication date: December 27, 2012
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: YOUENN FABLET, ROMAIN BELLESSORT, HERVÉ RUELLAN
  • Patent number: 8341129
    Abstract: A structured document is coded as a bit stream. The structured document can be described in Extensible Markup Language (XML). The structured document can be decoded to access a subpart of the document. Hierarchized events included in the structured document are coded as corresponding events using at least one encoding table, which is updated during the coding. Hierarchized events involved in an update of the at least one encoding table are determined. Marking information is associated with the coded events corresponding to the hierarchized events determined to be involved in the update of the at least one encoding table.
    Type: Grant
    Filed: September 30, 2009
    Date of Patent: December 25, 2012
    Assignee: Canon Kabushiki Kaisha
    Inventors: Franck Denoual, Hervé Ruellan
  • Patent number: 8234288
    Abstract: Reference patterns are generated which represent hierarchized data, the hierarchized data being structured in accordance with a schema and being organized in a plurality of items. Primary structural patterns are extracted from the schema, each of the primary structural patterns representing a set of structural information. A list of instances is created for at least one extracted primary structural pattern, each instance associating items of the plurality of items with a primary structural pattern. Instances of one and a same primary structural pattern are grouped into groups of instances according to a predetermined criterion applied on items of distinct instances. For each group, at least one piece of structural information common to each instance of one of the groups of instances is extracted. A reference pattern is generated from the primary structural pattern associated with the one group of instances, the reference pattern including the extracted piece of structural information.
    Type: Grant
    Filed: October 22, 2007
    Date of Patent: July 31, 2012
    Assignee: Canon Kabushiki Kaisha
    Inventor: Hervé Ruellan
  • Publication number: 20120185596
    Abstract: The present invention relates to a method and a system for managing access to a resource, copies of which are hosted in apparatuses of one or more networks. The method comprises obtaining a list comprising a plurality of references pointing to the plurality of copies of the resource; for each of said references, determining at least one accessibility rating representing the accessibility of the corresponding copy for the given user device, and, based on the at least one accessibility rating, deciding between keeping the corresponding reference in the list or deleting it therefrom, to obtain an updated list; and selecting a reference from the updated list for the given user device to access the resource.
    Type: Application
    Filed: January 17, 2012
    Publication date: July 19, 2012
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: ROMAIN BELLESSORT, YOUENN FABLET, HERVE RUELLAN
  • Publication number: 20120150828
    Abstract: A method for decoding encoded structured data from a bit-stream comprising a plurality of encoded data units having the steps of, obtaining unit information comprising positions of the encoded data units within the bit-stream, retrieving the encoded data units from the bit-stream based on the unit information, creating decoding tasks for decoding the retrieved encoded data units, assigning the created decoding tasks to cores of a multi-core decoder, based on estimated decoding costs of the encoded data units, running the tasks on their assigned cores to decode the encoded data units in parallel is disclosed. It is applied to the decoding of XML documents in the EXI format.
    Type: Application
    Filed: December 9, 2010
    Publication date: June 14, 2012
    Applicant: CANON KABUSHIKI KAISHA
    Inventors: Youenn Fablet, Hervé Ruellan, Romain Bellesort
  • Patent number: 8051188
    Abstract: A server computer sends, to a client computer, a service description document comprising information relating to a communication protocol used for exchanging messages, the service description document including a description of at least one functionality implemented by the communication protocol for an execution of the service over on the communication network using the protocol. The client computer analyzes the service description document by extracting the description of the functionalities implemented by the protocol from the service description document, verifying that each functionality is supported by the client computer of the communication network, and adding the protocol to a list of protocols usable for the execution of the service supplied by the server computer if all the functionalities associated with the communication protocol are supported by the client computer.
    Type: Grant
    Filed: September 4, 2003
    Date of Patent: November 1, 2011
    Assignee: Canon Kabushiki Kaisha
    Inventors: Jean-Jacques Moreau, Hervé Ruellan, Youenn Fablet