Patents by Inventor Romain Bellessort
Romain Bellessort 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: 9015269Abstract: 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: GrantFiled: June 19, 2012Date of Patent: April 21, 2015Assignee: Canon Kabushiki KaishaInventors: Herve Ruellan, Youenn Fablet, Romain Bellessort
-
Patent number: 8954457Abstract: 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: GrantFiled: June 13, 2012Date of Patent: February 10, 2015Assignee: Canon Kabushiki KaishaInventors: Youenn Fablet, Romain Bellessort, Hervé Ruellan
-
Publication number: 20150032804Abstract: The invention concerns a method of exchanging information items, e.g. HTTP headers, between a server device and a plurality of clients, and also concerns such a server device. The server device establishes connections with clients, wherein each connection involves a server-initiated indexing table for the server device to encode information items to be sent over the connection in the server-to-client direction. The method comprises the following steps performed at the server device: obtaining a same single indexing table as the server-initiated indexing table of the connections; in response to receiving a request for data from a client, pushing entries of the table to the client to configure the latter for item exchange in the server-to-client direction, encoding information items associated with the requested data using item indexing based on the table and sending the encoded information items to the client over the connection established with it.Type: ApplicationFiled: July 25, 2014Publication date: January 29, 2015Inventors: YOUENN FABLET, ROMAIN BELLESSORT, HERVE RUELLAN
-
Patent number: 8930924Abstract: 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: GrantFiled: June 15, 2010Date of Patent: January 6, 2015Assignee: Canon Kabushiki KaishaInventors: Youenn Fablet, Romain Bellessort, Franck Denoual, Hervé Ruellan
-
Publication number: 20140355627Abstract: 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: ApplicationFiled: November 5, 2012Publication date: December 4, 2014Applicant: CANON KABUSHIKI KAISHAInventors: Romain Bellessort, Youenn Fablet, Hervé Ruellan
-
Patent number: 8819232Abstract: 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: GrantFiled: January 17, 2012Date of Patent: August 26, 2014Assignee: Canon Kabushiki KaishaInventors: Romain Bellessort, Youenn Fablet, Herve Ruellan
-
Patent number: 8751678Abstract: 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: GrantFiled: November 5, 2010Date of Patent: June 10, 2014Assignee: Canon Kabushiki KaishaInventors: Romain Bellessort, Youenn Fablet, Hervé Ruellan
-
Patent number: 8706884Abstract: 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: GrantFiled: June 19, 2012Date of Patent: April 22, 2014Assignee: Canon Kabushiki KaishaInventors: Herve Ruellan, Romain Bellessort, Youenn Fablet
-
Patent number: 8698657Abstract: 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: GrantFiled: September 10, 2012Date of Patent: April 15, 2014Assignee: Canon Kabushiki KaishaInventors: Youenn Fablet, Romain Bellessort, Hervé Ruellan
-
Publication number: 20140075453Abstract: 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: ApplicationFiled: September 6, 2013Publication date: March 13, 2014Applicant: CANON KABUSHIKI KAISHAInventors: Romain BELLESSORT, Youenn FABLET, Herve RUELLAN
-
Publication number: 20140070966Abstract: 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: ApplicationFiled: September 10, 2012Publication date: March 13, 2014Applicant: CANON KABUSHIKI KAISHAInventors: Youenn Fablet, Romain Bellessort, Hervé Ruellan
-
Method and device for encoding a structured document and device for decoding a document thus encoded
Patent number: 8627200Abstract: The method of encoding hierarchized data organized in a plurality of events comprises: a step of obtaining an information set of at least one event to be encoded, and a step of recovering a grammar according to the information set, said grammar making it possible to describe at least said information set, a step of determining whether at least a part, defined by a predetermined criterion, of said information set of at least one event to be encoded can be predicted unequivocally from said grammar, if the result of the determination step is positive, a step of encoding so-called “conformity” information representing this positive result, and a step of encoding the information of each said event to be encoded not included in said information set.Type: GrantFiled: July 22, 2008Date of Patent: January 7, 2014Assignee: Canon Kabushiki KaishaInventors: Romain Bellessort, Youenn Fablet -
Publication number: 20130339472Abstract: 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: ApplicationFiled: June 19, 2012Publication date: December 19, 2013Applicant: CANON KABUSHIKI KAISHAInventors: Herve RUELLAN, Youenn FABLET, Romain BELLESSORT
-
Publication number: 20130339526Abstract: 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: ApplicationFiled: June 19, 2012Publication date: December 19, 2013Applicant: CANON KABUSHIKI KAISHAInventors: Herve RUELLAN, Romain BELLESSORT, Youenn FABLET
-
Publication number: 20130246583Abstract: 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: ApplicationFiled: March 11, 2013Publication date: September 19, 2013Applicant: CANON KABUSHIKI KAISHAInventors: ROMAIN BELLESSORT, YOUENN FABLET, Hervé RUELLAN
-
Patent number: 8533172Abstract: Coding information representing several versions of a content. Determining is performed by determining a structure comprising content items, and a plurality of versions of the content associated with the structure. Associating is performed by associating, with each content item of the structure, each value of the content associated with the item, in a version of the content, to provide a piece of association information. Coding is performed by coding a single file comprising a piece of information representing the association, the structure and the values of the versions of the content that is associated with the content items.Type: GrantFiled: November 18, 2008Date of Patent: September 10, 2013Assignee: Canon Kabushiki KaishaInventor: Romain Bellessort
-
Patent number: 8464231Abstract: A method and apparatus access a production among first and second groups of productions. The productions form rules for constructing hierarchical data of a structured electronic document. The first group is associated with a first group of events, each production being defined for an event type and contextual information including a name associated with an element in the hierarchical data. The second group is associated with a second group of events distinct from the first group of events, the events of the second group describing the hierarchical data of the structured electronic document. The device determines whether an event is of the first group including determining whether the event in question is defined by a name associated with an element in addition to an event type, and predicts a production from the second group that is associated with the event is determined to be of the first group.Type: GrantFiled: February 11, 2009Date of Patent: June 11, 2013Assignee: Canon Kabushiki KaishaInventor: Romain Bellessort
-
Patent number: 8381097Abstract: 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: GrantFiled: June 15, 2010Date of Patent: February 19, 2013Assignee: Canon Kabushiki KaishaInventors: Hervé Ruellan, Romain Bellessort
-
Patent number: 8364621Abstract: The method of coding a structured document comprises: a step (705) of determining whether a succession of correct predictions exists for items of a set of items of the document and if the result of said determining step is positive, a step (710) of coding the number of successive correct predictions. In embodiments, this method further comprises, if a set of items of the document possesses associated values, a step of coding said values associated with said set of items of the document.Type: GrantFiled: May 15, 2009Date of Patent: January 29, 2013Assignee: Canon Kabushiki KaishaInventors: Youenn Fablet, Romain Bellessort
-
Publication number: 20120330984Abstract: 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: ApplicationFiled: June 13, 2012Publication date: December 27, 2012Applicant: CANON KABUSHIKI KAISHAInventors: YOUENN FABLET, ROMAIN BELLESSORT, HERVÉ RUELLAN