Abstract: Generating reference structural patterns representing hierarchized data, by extracting primary structural patterns. Each primary structural pattern represents a set of pieces of structural information. The degree of use of extracted primary structural patterns is determined based on of the number of hierarchized pieces of data able to be represented by the primary structural patterns. Primary structural patterns are grouped based on the degree of use and a distance between primary structural patterns. One reference structural pattern per group is determined, the reference structural pattern representing the primary structural patterns of the associated group.

Abstract: The present invention concerns a method of generating a web feed (10) composed of entries (12) corresponding to content elements (14), and an associated system. The method comprises: a. determining (E110) a number (NIA) of content elements to be added to a web feed (10), according to a number (NI) of available content elements to be published (20, 24, 26) and according to a predefined visibility period (T) associated with said web feed, b. selecting (E120) said number of content elements (14) from said content elements (20, 24, 26) to be published, and c. creating (E135, E140), in said web feed (10), entries (12) corresponding to said selected elements (22).

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.

Abstract: The invention relates to methods and devices for binary coding and decoding by similarities for structured documents After having decomposed the data to code into a series of symbols, each item of data being at least partially represented by a symbol, and having selected at least one item of data to code, a search is carried out for a first sequence of symbols coded beforehand, identical to a second sequence of symbols to code, comprising a symbol representing a part of said data. Similarly, a search is carried out for a third sequence of symbols coded beforehand of which one symbol is distinct from the symbol corresponding to a fourth sequence of symbols to code comprising said symbol representing said part of said data. In response to the comparison of their coding efficiency, the second or the fourth sequence is coded.

Abstract: This invention relates to a method of encoding a path (1) in layered form so as to allow partial decoding and progressive rendering while decoding. The path (1) is made of an original sequence (20, 23) of original draw commands, each corresponding to an original portion of a drawing. The method of encoding comprises the following steps: transforming (E120, E230, E430, E440, E450) 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 (25); encoding (E130, E250) said reduced sequence (25) into an encoded reduced sequence; and encoding (E150, E260) a reconstruction information set (26) representing the difference between the reduced sequence (25) and the original sequence (20, 23). The invention is particularly suitable for graphics description languages, such as SVG.

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.

Abstract: The present invention concerns a method and device for coding or decoding a structured document, for example an XML document, using a structure-describing file of the XML Schema type. The method comprises a step of configuring an encoder or decoder including the obtaining of data describing a document structure model and their storage in the form of recordings, and a step of calculating a number of items, referred to as “possible items”, able to succeed, according to the structure model, an item of said model, said number of possible items being stored in a recording associated with said item. In order to facilitate calculations, the recordings comprise the minimum and maximum numbers of occurrences of the item defined by the structure model.

Abstract: The client obtains an interface of a data object from the server, selects a function to be applied to the data object from the obtained interface, determines types of different results that can be sent back from the server as a result of an execution of the function by the server, where the types of different results are determined from result type identification, encoded in the interface, selects at least one desired result type from the determined different result types, generates a message including the at least one selected desired result type for invoking the function; the server receives the message, extracts arguments of the function invoked by the message, extracts at least one desired result type from the message, executes the function, generates a function execution response containing the selected execution result desired by the client and sends the function execution response to the client.

Abstract: The method of coding a structured document comprises: —a step of obtaining at least one pattern designated as “primary” representing at least one of the pieces of structural information of data of said document, —a step (200 to 230) of obtaining a part of the document different from the entirety of the document, —a step of creating at least one derived pattern formed by modifying a primary pattern, representing data of said part of the document and —a step of coding data of the document to provide a code, said code associating a pattern with at least one piece of coded data. In embodiments, during the coding step, a step is carried out of determining a pattern that best describes data to code, the pattern associated with said data being that closest pattern.

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.

Abstract: The invention relates to methods and devices for binary coding and decoding by similarities for structured documents After having decomposed the data to code into a series of symbols, each item of data being at least partially represented by a symbol, and having selected at least one item of data to code, a search is carried out for a first sequence of symbols coded beforehand, identical to a second sequence of symbols to code, comprising a symbol representing a part of said data. Similarly, a search is carried out for a third sequence of symbols coded beforehand of which one symbol is distinct from the symbol corresponding to a fourth sequence of symbols to code comprising said symbol representing said part of said data. In response to the comparison of their coding efficiency, the second or the fourth sequence is coded.

Abstract: The present invention concerns methods of accessing and modifying a part of a coded document, for example a structured document of Binary XML type, as well as associated devices. In particular, the accessing method comprises the decoding of the part to access using a decoding table (300?, 310?) having entries each of which associating a non-coded item (220) with a coded field (225). The method is particular in comprising a step (430, 530) of forming said table for the decoding from: at least one initial coding/decoding table (300, 310) grouping together entries corresponding to a plurality of coded fields of the document and comprising, for at least one entry, an indication of the first occurrence (320, 330), within the coded document, of the item associated with the entry; and a determined location (L), within the coded document, of a first coded field of said part to access.

Abstract: The invention concerns iterative binary coding/decoding for a document comprising values to code or to decode. For the coding, after having created (400) a dictionary on the basis of the values to code, differences between consecutive elements of the dictionary created are calculated (440). These creating and calculating steps are repeated (460) by substituting the values to code by differences between the values of the dictionary created previously. The values of the document are then coded (480) on the basis of said created dictionaries. For the decoding, after having obtained (610, 640) a set of values representing differences between elements of a dictionary on the basis of coded values, elements of the dictionary are calculated (650) on the basis of said values obtained. These steps are repeated by substituting the values representing differences by the values of the dictionary calculated previously (630). The values are then decoded (670) on the basis of said calculated dictionaries.

Abstract: A table is obtained comprising, for each request emanating from the client device, at least one line of correspondence between at least the address (U) of the request, a first filter (f) defining information to be kept for the request without modifying the sense of the request, a location containing a simplified request resulting from the application of the first filter to the request, and a location containing a response. In response to a request emanating from a client device, the corresponding line is selected, at least one condition for the supply of the response from the corresponding location is verified and, in the case of positive verification, the response is supplied to the client device from the location containing said response.

Abstract: A method of translating a message represented in a first markup language comprising a succession of blocks associated respectively with an address attribute is adapted to translate the message into a second markup language comprising two groups of blocks (BH, BB). The method comprises a step (S4) of selecting a first set of blocks (BF, BR) associated with an address attribute comprising a reference to the recipient station of the communication network and of adding (S5, S8) this first set of blocks (BF, BR) to the second group of blocks (BB); a step (S12) of obtaining the number of blocks written in the second group of blocks (BB); and, if the number of blocks is equal to zero a step (S15, S19) of adding a single block (BG), chosen from the second set of blocks, to the second group (BB).

Abstract: Execution of a function execution request is performed by a server, where the receives the function execution request, which includes a set of functions and a sorting criterion. The server identifies, from the received function execution request, the set of functions included in the request, and reads the sorting criterion included in the received request. The server then sorts the identified set of functions included in the function execution request using the read sorting criterion, and executes the identified set of functions sorted in the sorting step based on a sorted order.

Abstract: Undoing a function requested by a first client station on a computer object stored on a server station of a communication network is provided. The execution of the function is adapted to manipulate the object from an earlier state to a manipulated state. The undoing is performed by receiving a request to undo the execution of the function. The earlier state of the manipulated object is obtained. Then, a response is sent to the first client station via the communication network, the response comprising a sum of money less than or equal to an execution cost associated with the function.

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.

Abstract: The invention concerns a method of evaluating an expression on items of a structured document, an expression comprising a set of elementary sub-expressions, that comprises the following prior steps: generating, from the expression, all the target nodes (920) corresponding to items to be sought in the structured document; generating a logical representation (930) of the expression, a logical representation comprising a set of nodes, representing the elementary sub-expressions of the expression, linked according to the relationships between these elementary sub-expressions; a step of evaluating the expression on items of the structured document from all the target nodes generated and the logical representation generated.

Abstract: A method of creating an animation with a sequence of images which includes the steps of optimising requests for obtaining images from a remote terminal depending on at least one criterion, and creating a file comprising the optimised requests. For example, two computers may be employed wherein a first computer is used to submit requests which are received by the second computer. The second computer optimises the received requests in the form of animations, creates a file, and sends the corresponding data back to the first computer in digital form.