Data structure and methods for transforming stream of bits to electronic document and generation of bit stream from electronic document based on said data structure

FIELD: syntactic analysis of bit stream, containing data having structure and content, matching certain format, possible use for generation of tree-like representation of said stream.

SUBSTANCE: proposed scheme is produced from XML, making it possible to describe encoding format in generalized form. Such scheme is used for performing syntactic analysis of stream of bits for production of document, which represents a stream of bits, which acts as a sample of aforementioned scheme, or for generation of stream of bits from document, representing the stream of bits.

EFFECT: increased resistance to interference.

7 cl, 3 dwg, 4 app

 

The present invention relates to a method for converting the electronic document of the bit stream that contains the data that have a structure and content that match a certain format, and the above-mentioned method is designed to generate a tree view of the above-mentioned flow. The invention also relates to a method of forming a bit-stream according to a certain format of the document, which is a tree view of the above bit stream and which contains the data, particularly the data being imported, through the use of some import mode. The invention also relates to a data structure, forming a circuit for converting a bit stream in an electronic document and determining one or more types of data, which may have one or several aspects, and contains many elements for which it describes a name, data type, location with overlapping manner, and a predetermined or random number of occurrences, and the appearance of the element is mandatory or optional.

The invention also relates to computer programs for carrying out such methods, the processing unit comprising a memory means for storing the aforementioned data structures and computer programs, as well as to the system p is passing, containing at least the source object and the object's destination, and the source contains the aforementioned processing unit.

The invention can be applied in the field of editing, editing, and merging the content. An example of the application of the invention is the adaptation of content to transfer to the recipient as a function of the user profile (screen, computing performance, memory, communication channel used for transmission and so on). This adaptation allows to avoid useless data that the recipient will not be able to use, and, thus, to save on bandwidth.

In this regard, the application for French patent No. 0101530 filed 05/02/2001 Koninklijke Philips Electronics N.V., already described method of generating a file with some characteristic properties of the main document written in a markup language and describes the basic sequential file, and the above-mentioned method comprises a phase transformation to generate a transformed document by applying to the main document, a predetermined transformation, which is a function of the mentioned characteristic properties, and file with the mentioned characteristic properties is generated from the converted document. This method includes the execution of the necessary transformation of the main document, which is an obvious structure of a sequential file. This eliminates the need to decode the basic sequential file to re-encode otherwise.

However, this method of file generation means the generation of the main document, which describes the basic sequential file, and then generate another file from the converted document.

The present invention is the creation of automatically executing a generalized method for performing such operations.

In accordance with the invention this result is achieved by a data structure that forms a circuit for converting a bit stream in an electronic document in the markup language, or Vice versa, determines one or more types of data, which may have one or more aspects, and aspect corresponds to the constraint imposed on the set of values of type data and contains many elements for which it describes a name, data type, location with overlapping manner, and a predetermined or random number of occurrences, and the appearance of the element is mandatory or optional, and specifies one or more data types that correspond to binary the words of predefined length or lengths and which have, at m is re, the aspect related to the above length. The above data structure is different in that it defines one or more variables, compiled by data access, and it contains one or more conditional branches to describe the various structures or possible content as a function of the values mentioned one or more variables, and, optionally, is at least one of the following characteristic symptoms: the above data structure defines the data type that corresponds to the binary segments of indefinite length and which has, at least, an aspect that indicates whether the binary segments to be translated and entered into an electronic document or a binary segments should be contained in a binary file, and pointers to the binary file must be entered in the electronic document, and the aspect relating to the flag stop binary segment, and the data structure determines the aspect relating to the filling bits contained in said binary words of predefined length or lengths.

In addition, in accordance with the invention, a method of converting the bit stream into an electronic document in the markup language that contains the data structure and content according to a certain format, and the electronic document is a tree representation of the UPR is analogo bit-stream contains the steps of reading the data structure, the search in the above-mentioned stream of data bits that correspond to items contained in a linked data structure, generate an instance of the above mentioned data structure that contains the data found in the aforementioned bit stream, and which is referred to the tree view.

In addition, in accordance with the invention, a method of forming a bit-stream according to a certain format of the electronic document in the markup language that represents a tree view of the bit stream containing data to be imported through the use of data transformation in order to enter data into an electronic document, or through the use of pointers to a binary file containing the data, includes the steps of reading the above document, the parallel read data structure that describes a generic manner mentioned format, the encoding of such data as a function of the type being defined, compiling bit stream of encoded data.

The invention also relates to a computer program containing commands and providing, when loaded into the processor executing processor way to convert a bit stream in an electronic document in the markup language and method of forming the bit stream according to some is concerning the format of the electronic document in the markup language.

In addition, in accordance with the invention, the processing unit includes memory means for storing data structures and memory means for storing the program that contains commands for implementing the method parsing the bit stream based on the above data structure for forming a document markup language, which is referred to a stream of bits, which is an instance of the above mentioned data structures, and/or a program that contains commands for implementing the method of forming a bit-stream based on the above data structure and document representing the said stream of bits, which is an instance of the above mentioned data structures.

The invention also relates to a transmission system containing at least a source object and, at least, an object of the destination and the source object contain the specified processing unit.

The invention is illustrated below with reference to the drawings showing the following:

figure 1 - block diagram illustrating the parse in the way of converting the bit stream into an electronic document according to the invention,

figure 2 is a block diagram illustrating a method of creating a bit-stream according to the invention and

figure 3 - example of a transmission system according to the invention.

On f is 1 presents the block diagram, explaining the basic mode of the method of converting the bit stream into an electronic document. The block B1 is a stream of bits in accordance with a predefined format. The block B2 is scheme, which is summarized describes referred to a predefined format. Block B3 is the parser, which allows you to parse a stream of bits B1 to create a document B4, which is a tree representation of the flow of B1 bits, and the schema instance B2.

Scheme B2 describes the syntax of the bit stream. In particular, it defines the type of data that may occur in the bit stream, and the method by which they should be included in the document. Tree view B4 is created based on analysis of stream B1 bits.

Figure 2 presents a block diagram explaining the principle of the generation of the bit stream according to the invention. The block'2 represents a schema that describes the encoding format in the aggregate. Block In'4 represents a document that is an instance of the schema'2. Block In'3 is the generator of a stream of bits, which allows parallel reading of the document In'4 and schemes In 2'to create a thread In'1 bits. Preferably, scheme B2 and'2, is used for one encoding format, identifying the us.

The document'4 is read by the scheme In 2'to determine the type of data contained in the document'4. For values read from the document'4 corresponding to the data type found in the schema'2, determines the encoding mode that should be used for encoding the above-mentioned values.

In General, of course, is not necessary to provide the full details of the structure of the encoding format in the schema. The degree of detail depends on the considered application. For the application described in the application for French patent No. 0101530 mentioned in the introductory part of this application (the generation method of the file - such as JPEG2000 file - characteristic properties which are adapted to the profile of the recipient), some segments markers JPEG2000 should be given in detail, the parameter for the option to restore these parameters and modifying them. Other segments of the markers are treated as blocks, as there is no need to have access to the parameters they contain.

Documents B4 and'4 are preferably documents extensible markup language (XML), and circuit B2 and'2, it is written in a new language, derived from the schema language for XML. XML is a recommendation of the world wide web consortium (extensible markup language, version 1.0, 06.10.2000), and the XML schema is with the battle of the draft recommendation, world wide web consortium, dated 24.10.2000. The XML recommendation and the draft recommendation, XML schema is available on the Internet site http://www.w3.org/. However, this is not limiting, and the principles of the invention, which is described in detail in the rest of the description, can be applied when using languages other types, for example languages like structure description document (DSD), proposed by AT&T and BRICS University gorjus in Denmark, and is available on the website in the Internet http://www.brics.dk/DSD/.

From the physical point of view the XML document contains, in particular, the elements that can be analyzed and can contain text, i.e. a sequence of characters belonging to a predefined set of characters, and representing the tag or text data.

From the point of view of logic XML document contains one or more elements, the boundaries of which are indicated by a start flag and a flag stop. Elements can be included in other items (which forms a location overlapping). Each element is identified by the name that is specified in the start flag and flag stop. The element can have a value. The value element is placed between the start flag and the flag of the breakpoint.

In the example described below, data is selected for placement directly in the elements of the XML document to simplify i.e. monitoring) reference is Yu (ie the data contained in the XML document, constitute the values of XML elements).

An XML schema represents the schema language that allows the definition of the content and structure of an XML document: in particular, XML schema allows us to describe the elements and for each element name, data type, location overlap, the order and number of occurrences. The order and number of occurrences can be pre-determined or to be uncertain. The appearance of the element may be mandatory or optional.

The schema defines a class of XML documents. An instance of an XML schema is an XML document that is valid against the above schema.

In the following description, in order to give a concrete example of the invention, considered the bit streams of the JPEG2000 format. This is not limiting, and it is clear that the invention can be applied to other formats. For some formats, it may be necessary to add other data types to those described here.

Appendix a contains an example of a schema that describes the format of the JPEG2000 encoding. In this scheme uses simple data types, which are generic and which are defined in Appendix b, and simple data types derived from these generic types that are defined in Appendix C. Appendix D contains XML document which is an instance of the schema is given in Appendix a, and which represents the JPEG2000 bit stream. In annexes a, b and C and in the following description, the letters ≪xsd≫ indicate the tools that are defined in the XML schema. And the letters ≪bsd≫ indicate the tools that are added by the invention.

According to the invention scheme B2 (which is identical to the scheme In'2 in the following description defines the type of all data that may be contained in the stream according to the JPEG2000 format. Some types of data already exist in the schema language for XML and can be used directly. Others need to be modified. Others need to be added.

The flow of data according to JPEG2000 more specifically contains the following data types:

1) binary segments of indeterminate length, the contents of which can be imported into an XML document by using the first or second import mode, described below,

2) binary words of different lengths, which may contain bits of padding, which are not older,

3) markers, the value of which is determined in the hex code in the JPEG2000 standard and which are imported in the hex code in the XML document. This import in the hex code is the third mode of import.

First import mode contains transformed the representation of binary data into characters, which belong to a predefined set of characters used in XML. To this end preferably uses the encoding method, known as the ≪base 64≫ and are described in section 6.8 of RFC 2045, published Target group engineering support Internet. This method includes the separation of binary data and converting them into groups of 6 bits and associating each group of 6 bits with the sign from a predefined set of characters. This first import mode causes the expansion data by 33%.

In the second mode of import instead of converting binary data into characters to insert them directly into an XML document, the XML document is entered pointers on the area of the binary file containing the mentioned binary data. The XML document then becomes dependent on the mentioned binary file.

In the description language XML schema defines the data type as a triplet, which contains:

- a set of values, called the value space

- the set of lexical representations, called its lexical space,

- a set of aspects and aspect corresponds to the restriction imposed on the space of values.

To the invention, the encoding of the data that is recorded in the bit stream must be unambiguous and explicit. Directly using the tsya some types of data, which previously took place in the XML schema and are unambiguous and explicit: in this case, for example, data types ≪xsd: unsignedShort≫that represent an integer from -32768 to +32767 and which, therefore, can be implicitly encoded in two bytes. This is also the case ≪xsd: unsignedint≫ and ≪xsd: unsignedByte≫.

According to the invention also uses the data type ≪xsd:binary≫but through its modification:

1) is appended To the aspect relating to the flag stop, called ≪bsd: stopFlagExclusive≫. This aspect is used to indicate the end of the binary segment of indeterminate length: for example, the JPEG2000 packets, which are binary segments of indeterminate length, defined either by token SOP (start of packet), or marker SOT (start element mosaic image), or marker EOC (end of code stream); thus, for JPEG2000 package this aspect takes one of three values: FF51 (SOP), FF90 (SOT) or FFD9 (AGM).

2) a New possible value is added to the aspect ≪encoding≫that already exists in the schema language for XML with values ≪hex≫ for hex code and ≪base 64≫ to import after conversion code Base-64. New added value called ≪externalData≫. It is used to indicate that data is imported into an XML document through the your use of the above-mentioned second mode import (introduction to XML document pointer which indicates the region of the bit stream that contains the data).

This modified type of data is called ≪binaryNoLength≫ and is defined as follows in the Application:

<xsd:simpleType name="binaryNoLength">

<xsd:annotation>

<xsd:appinfo>

<!-- Reading data before the detection flag -->

<xsd:hasFacet name="stopFlagExclusive"/>

<!-- As binary data must be assigned values: -->

<!-- base64, hex (same as for xsd:binary) -->

<!-- externalData (universal resource identifier (URI)that points to the external segment of the data object) -->

<xsd:has Facet name="encoding"/>

</xsd:appinfo>

</xsd:annotation>

<xsd:restriction base="xsd:anySimpleType"/>

</xsd:simpleType>

This modified data type, which is a generic type, is then used to obtain other types of specific data, which can be found in the bit stream of XML. For example, as indicated in Annex b type ≪PacketDataTYpe≫that is matched packets JPEG2000, is obtained from the generalized type ≪binaryNoLength≫. In this example, we see that the data contained in these packages are imported into an XML document by using the second import mode (the pointer to the region of the bit stream that contains the data). You can also see that the package JPEG2000 is determined by the token, which has one of the following three values: FF51, FFD9 Il is FF90.

<xsd:simpleType name="packetDataType">

<xsd:restriction base="bsd:binaryNoLength">

<xsd:encoding value="externalData"/>

<bsd:stopFlagExclusive value="FF51|FFD9|FF90"/>

</xsd:restriction>

</xsd:simpleType>

Although reference is made to Appendix a, it is believed that other elements are derived from ≪binaryNoLength≫for example, an element called ≪Data≫ complex type SOS. This element ≪Data≫ has the aspect of ≪encoding≫whose value is ≪base 64≫which means that the corresponding import data from a bit stream into an XML document resulting from the use of conversion code Base-64.

<xsd:complexType name="COCType">

<xsd:sequence>

<xsd: element name="Marker≫type="jp2:markerType≫ fixed="ff53"/>

<xsd:element name="Lcoc≫ type="xsd:unsignedShort"/>

<xsd:element name="data">

<xsd:simpleType>

<xsd:restriction base="xsd:binary">

<xsd:length value="SLcoc"/>

<xsd:encoding value="base64"/>

</xsd:restriction>

</xsd:simpleType>

</xsd:element>

</xsd:sequence>

</xsd:complexType>

The invention also provides for adding a new data type, which is used for the binary words of predefined length. This new data type called ≪bsd:bitsArray≫and it contains three aspects: one aspect is called ≪bitsLength≫refers to the length binary words, one aspect named ≪prePadding≫refers to the number of bits for the filling up, located in front of the highest bit or higher bits, and one aspect is called ≪postPadding≫refers to the number of bits fill past the high order bit or bits. This new data type is defined in Annex C as follows:

<xsd:simpleType name="bitsArray">

<xsd:annotation>

<xsd:appinfo>

<xsd:hasFacet name="bitsLength"/>

<xsd:has Facet name="prePadding"/>

<xsd:has Facet name="postPadding"/>

</xsd:appinfo>

</xsd:annotation>

<xsd:restriction base="xsd:anySimpleType"/>

</xsd:simpleType>

As indicated in Appendix b, this new data type, which is a generic data type is then used to retrieve specific data types that can be found in JPEG2000 stream. For example, the data type, called ≪11b≫, which is obtained from the generalized data type ≪bitsArray≫, corresponds to a binary word of 11 bits, which does not contain bits of filling:

<xsd:simpleType name="11b">

<xsd:restriction base="bsd:bitsArray">

<bsd:bitsLength value="11"/>

</xsd:restriction>

</xsd:simpleType>

And data type called ≪5b3p≫, which is also obtained from the generalized data type ≪bitsArray≫, corresponds to a binary word of 5 bits contains 2 bits, followed by 3 bits of padding.

<xsd:simpleType name="5b3p">

<xsd:restriction base="bsd:bitsArray">

<bsd:bitsLength value="5"/>

<bsd:postPadding value="3"/>

</xsd:restriction>

lt; /xsd:simpleType>

Co a link to the Application And determines that the data type ≪11b≫for example, for an item called ≪mantissa≫:

<xsd:element name=″mantissatype="jp2:11b"/>

and what data type ≪5b3p≫ used, for example, for an element called ≪exponent≫:

<xsd:element name=″exponenttype="jp2:5b3p"/>

From the point of view of the structure of the invention uses the following tools that already exist in the XML schema:

- simple and complex data types ≪xsd:simple Type≫ and ≪xsd: complex Type≫,

elements ≪xsd: element≫,

- group model ≪xsd: group≫,

- connectors ≪xsd: sequence≫, ≪xsd: all≫ and, perhaps ≪xsd: choice≫.

The parser B3 reads the stream of bits B1 to scheme B2 to create a tree view B4 stream B1 bits. This tree view B4 is an instance of a stream B2. It is created recursively by interpreting connectors found in the schema.

More specifically, connector ≪xsd: sequence≫ is interpreted by the parser as follows:

when the parser finds connector ≪xsd: sequence≫he reads the elements in the bit stream in the same order as in the diagram. For example, connector ≪xsd: sequence≫ used with elements of type #x0226A; CodestreamType≫defined in Appendix A.

<xsd:complexType name="CodestreamType">

<xsd:sequence>

<xsd:element name=″MainHeadertype="jp2:MainHeaderType"/>

<xsd:element name=″Tiletype="jp2:TileType"/>

<xsd:element name="EOCtype="jp2:EOCType"/>

</xsd:sequence>

</xsd:complexType>

According to this definition, the element ≪Codestream≫ must contain the element ≪MainHeader≫followed by the element ≪Tile≫followed by the element ≪AGM≫.

Connector ≪xsd: all≫ is interpreted by the parser as follows: when the parser detects the connector ≪xsd: all≫he tries to read the first declared element in the connector ≪xsd: all≫and, if it fails, it tries to read the second item and so When he finds an item, the search of which he performs, he moves to the next element in the connector ≪xsd: all≫. He moves to the next connector only when you have viewed all of the elements of the connector ≪xsd: all≫.

The item found in the stream of bits does not match the item search which is carried out when the schema specifies a fixed value for this item or element of the elements it contains, and when this value does not correspond to testing the structure, which is detected in the bit stream. For example, when the parser tries to realize the item ≪SIZ≫, the element read from the bit-stream is not an element, a search which, if it does not begin with ≪FF51≫that is the value assigned to the token ≪SIZ≫ in the JPEG2000 standard.

Connector ≪xsd: all≫, for example, is used in elements of type ≪MainHeader Type≫defined in Appendix A.

<xsd:complexType name="MainHeaderType">

<xsd:sequence>

<xsd:element name="SOC" type="jp2:SOCType"/>

<xsd:element name="SIZ" type="jp2:SIZType"/>

<xsd:group>

<xsd:all>

<xsd:element name="COD" type="jp2:CODType" minOccurs="0"/>

<xsd:element name="QCD" type="jp2:QCDType" minOccurs="0"/>

<xsd:element name="COC" type="jp2:COCType" minOccurs="0"/>

<xsd:element name="QCC" type="jp2:QCCType" minOccurs="0"/>

<xsd:element name="RGN" type="jp2:RGNType" minOccurs="0"/>

<xsd:element name="POC" type="jp2:POCType" minOccurs="0"/>

<xsd:element name="PPM" type="jp2:PPMType" minOccurs="0"/>

<xsd:element name="TLM" type="jp2:TLMType" minOccurs="0"/>

<xsd:element name="PLM" type="jp2:PLMType" minOccurs="0"/>

<xsd:element name="CRG" type="jp2:CRGType" minOccurs="0"/>

<xsd:element name="COM" type="jp2:COMType" minOccurs="0"/>

</xsd:all>

</xsd:group>

</xsd:sequence>

</xsd:complexType>

According to this definition, the element ≪MainHeader≫ must contain the element ≪SOC≫followed by the element ≪SIZ≫followed by a group which can contain one, or more, or n is one of the following elements, taken in an undefined order: ≪COD≫, ≪QCD≫, ≪COC≫, ≪QCC≫, ≪RGN≫, ≪ROS≫, ≪PPM≫, ≪TLM≫, ≪PLM≫, ≪CRG≫.

Although the Application is not given any example, can also be used connector ≪xsd: choice≫. When the parser detects the connector ≪xsd: choice≫he attempts to read into the bit stream of the first element declared in the connector ≪xsd: choice≫. When the parser encounters an item, the search of which he performs, he moves on to the next connector in the diagram. If the read element is not an element, which is, the parser moves to the next element in the same connector ≪xsd: choice≫.

In addition, the invention provides for the use of variables in the schemes. The concept of variable is used in the language conversion of extensible stylesheet language (XSLT). XSLT is a language defined by the world wide web consortium, which allows you to define transformations that can be applied to XML documents. Specifically, the variable is a string of characters associated with a single value. It may appear in a certain position in the document and can be used in the other the place. In accordance with the syntax defined in XSLT, access to the value of the variable identified by a character string by placing the $ sign before the string of characters (in other words, $ZZZ is the value of the variable identified by the character string ZZZ). The value of the variable is specified when defining the variable. The invention allows to determine the value of a variable in a path of the XML tree, through the use of syntax defined in the Xpath language description language (XML path). Xpath is a language defined by the world wide web consortium. Specification of XSLT and Xpath are available on the Internet site http://www.w3.org.

The use of the variable allows, for example, to determine the number of elements by setting instead of defining a constant value. When the parameter value is given at the beginning of the bit stream and informs about the structure or content of the rest of the bit stream, then the value of the variable is determined through the use of the syntax of the Xpath language.

For example, JPEG2000 number of components ≪comp-siz≫contained in the segment SIZ marker is defined in the parameter ≪Csiz≫, which is placed at the beginning of the segment SIZ marker. In Appendix a, item ≪Csiz≫ is defined as a variable. Its value is determined by puting constructed tree view: in this expression ≪ SIZ/Csiz≫ indicates that ≪Csiz≫ is generated by the element ≪SIZ≫. Then, during the definition of the complex type ≪SIZ≫ this variable is called ≪Csiz≫ to determine the number of occurrences of the element ≪comp-siz≫.

<xsl:variable name="Csiz">

<xsl:value-of select="SIZ/Csiz"/>

</xsl:variable>

<xsd:element name="Comp_siz" minOccurs="$Csiz" maxOccurs="$Csiz">

The invention also provides for adding a new group model ≪bsd:conditionalChoice≫ and two new connectors ≪xsl: if≫ and ≪xsl: choose≫. This allows you to enter conditional branching schemes and, thus, to Express the conditional choice that may exist in the format that you want to describe. It should be noted that connectors ≪xsl: if≫ and ≪xsl: choose≫ are defined in the XSLT language. According to the specifications of the XSLT connectors ≪xsl: if≫ and ≪xsl: choose≫ use the attribute ≪test≫, which allows you to define the selection function test result. Connector ≪xsl: if≫ allows you to define the selection as a function of the value of a logical variable. Connector ≪xsl: choose≫ allows you to define a variety of options.

As an example, the JPEG2000 format ensures that the presence of certain elements or that the data type depends on the value of the parameter, which is specified at the beginning of the bit stream.

what then, in particular, manifests itself in the element ≪Spcod≫, which is contained in the element ≪COD≫. The item ≪Spcod≫ contains element ≪PredinctSize≫ only when the variable ≪PredinctsUsed≫ has a value of 1. This limitation is expressed in the schema, which uses the connector ≪xsl: if≫.

<xsd:element name="SPcod">

<xsd:complexType>

<xsd:sequence>

<xsd:element name="nDecompLevels" type="xsd:unsignedByte"/>

<xsd:element name="codeBlockWidth" type="jp2:4p4b"/>

<xsd:element name="codeBlockHeight" type="jp2:4p4b"/>

<xsd:element name="codeBlockStyle">

<xsd:complexType>

<xsd:sequence>

<xsd:element name="optSegMarkers" type="jp2:2p1b"/>

<xsd:element name="optErTerm" type="jp2:1b"/>

<xsd:element name="optVertStrCausal" type="jp2:1b"/>

<xsd:element name="optRegTerm" type="jp2:1b"/>

<xsd:element name="optResetMQ" type="jp2:1b"/>

<xsd:element name="optByPass" type="jp2:1b"/>

</xsd:sequence>

</xsd:complexType>

</xsd:element>

<xsd:element name="Transfonnation" type="xsd:unsignedByte"/>

<xsl:if test="$PrecinctsUsed=1">

<xsd:element name="PrecinctSize" minOccurs="0">

<xsd:complexType>

<xsd:sequence>

<xsd:element name="PPy" type="jp2:4b"/>

<xsd:element name="PPx" type="jp2:4b"/>

</xsd:sequence>

</xsd:complexType>

</xsd:element>

</xsd:sequence>

</xsl:if>

</xsd:complexType>

</xsd:element>

The item ≪QCD≫ is an example of the group ≪bsd: conditionalChoice≫that uses connectors ≪xsl: choose≫ to specify that the type of the next element (Spqcd_1≫, Spqcd_2 or Spqcd_3) depends on the values of the s parameter ≪ quantStyle≫whose position is in the currently processed tree view is determined by ≪QCD/Sqcd/QuantStyle≫.

<bsd:conditionalChoice>

<xsl:choose>

<xsl:when test="QCD/Sqcd/quantStyle='0"'>

<xsd:element name="Spqcd_1" minOccurs="3*$nDecompLevels+1" maxOccurs="3*$nDecompLevels+1">

<xsd:complexType>

<xsd:sequence>

<xsd:element name="exponent" type="jp2:5b3p"/>

</xsd:sequence>

</xsd:complexType>

</xsd:element>

</xsl:when>

<xsl:when test="QCD/Sqcd/quantStyle='1'">

<xsd:element name="Spqcd_2" minOccurs="1" maxOccurs="1">

<xsd:complexType>

<xsd:sequence>

<xsd:element name="exponent" type="jp2:5b"/>

<xsd:element name="mantissa" type="jp2:11b"/>

</xsd:sequence>

</xsd:complexType>

</xsd:element>

</xsl:when>

<xsl:when test="QCD/Sqcd/quantStyle='2"'>

<xsd:element name="Spqcd_3"minOccurs="3*$nDecompLevels+1" maxOccurs="3*$nDecompLevels+1">

<xsd:complexType>

<xsd:sequence>

<xsd:element name="exponent" type="jp2:5b"/>

<xsd:element name="mantissa" type="jp2:11b"/>

</xsd:sequence>

</xsd:complexType>

</xsd:element>

</xsl:when>

</xsl:choose>

</bsd:conditionalChoice

When the parser reads the bit stream, he consistently creates an XML tree. When it encounters a variable in the schema, for example in the attribute ≪test≫ connector ≪if≫he evaluates this variable by applying the specified path.

It should be noted that XML allows you to define your own extensions. The first embodiment of the invention, thus is m, contains add new tools offered by the invention as extensions to an existing schema language for XML. Another embodiment of the invention contains a complete redefinition of a new language, which applies the tools of XML schema and adds new tools offered by the invention.

Figure 3 shows an example of a transmission system in accordance with the invention. Transmission system, shown in figure 3, contains the server SV and a lot of customers ARTICLE. The server SV and clients ARTICLE associated with the world wide web of the Internet. The server SV includes a tool MEM memory and processing means PROC. Memory means contains, in particular, scheme B2, the first stream of bits B1 and computer program PG1 for implementing the method of syntactic analysis according to the invention for receiving the first document B4, which represents the first stream of bits B1 and which represents a schema instance B2. Means MEM memory also preferably contains a computer program PG2 for implementing the method of creating the second thread To'1 bits of document In'4, representing him, and from the scheme B2.

As an example, the document'4 is obtained by applying the transform to the document B4, and this transformation depends on the customer's profile, which previously has requested the transmission of the bit stream.

1. With ructure (B2) data which forms a circuit for converting a stream (B1) bits in the electronic document (B4) markup language, or Vice versa,

the mentioned data structure defines one or more types of data, which may have one or more aspects, and aspect corresponds to the constraint imposed on the set of values of type data and contains many elements for which it describes a name, data type, location with overlapping manner, and a predetermined or random number of occurrences, and the appearance of the element is mandatory or optional,

the above schema defines one or more data types that correspond to the binary words of predefined length or lengths and which have, at least, the aspect related to the mentioned length

characterized in that

the mentioned data structure defines one or more variables, compiled by data access, and it contains one or more conditional branches to describe the various structures or possible content as a function of the values mentioned one or more variables,

and optionally has at least one of the following characteristic features:

the mentioned data structure defines the data type that corresponds to the DVO is cnym segments of indefinite length and which has, at least the aspect that indicates whether the binary segments to be translated and entered into an electronic document or a binary segments must be contained in a binary file and pointers to the binary file must be entered in the electronic document, and the aspect relating to the flag stop binary segment,

moreover, the data structure defines the aspect relating to the filling bits contained in said binary words of predefined length or lengths.

2. The method of flow transformations (B1) bits in the electronic document (B4) markup language, and the bit stream contains data that have the structure and content according to a certain format, and the electronic document is a tree representation of the above bit stream, and the said method comprises the steps

A) reading patterns (B2) data according to claim 1,

B) searching in said stream of data bits that correspond to items contained in a linked data structure

C) generate an instance of the above mentioned data structure that contains the data found in the aforementioned bit stream, and which is referred to the tree view.

3. A computer program (PG1)that contains commands, which when loaded into the processor (SV) provides execution by the processor with the person of the conversion in paragraph 2.

4. The method of forming thread (B1) bits according to a certain format of the electronic document (B4') markup language, which is a tree view of the above bit stream and which contains the data, especially data that is imported through the use of data transformation, therefore, to enter data into an electronic document, or through the use of pointers to a binary file that contains the data, and the method comprises the steps

A) read the above document,

B) parallel read data structure (B2) according to claim 1, which describes a generic manner mentioned format

C) encoding the mentioned data as a function of the type being defined,

D) compiling flow (B1) bits of the encoded data.

5. A computer program (PG1)that contains commands, which when loaded into the processor (SV) ensure the execution processor of the generation of the bit stream according to claim 4.

6. The processing unit (SV), which contains the memory means (MEM) for storing a data structure (B2) according to claim 1 and a memory means (MEM) for storing programs (PG1), which contains commands for implementing the method parse stream (B1) bits based on the above data structure for the document (B4) on the markup language, to which that is referred to a stream of bits, which is an instance of the above mentioned data structures, and/or the program (PG2), which contains commands for implementing the method of forming thread (B1) bits based on the aforementioned structure (B2) data and document (B4'), which referred to a stream of bits, which is an instance of the above mentioned data structures.

7. Transmission system containing at least a source object and, at least, an object of the destination and the source contains a processing unit (SV) 6.



 

Same patents:

FIELD: statistical language models, used in speech recognition systems.

SUBSTANCE: word indexes of bigrams are stored in form of common base with characteristic shifting. In one variant of realization, memory volume required for serial storage of bigram word indexes is compared to volume of memory, required for storage of indexes of bigram words in form of common base with characteristic shifting. Then indexes of bigram words are stored for minimization of size of data file of language model.

EFFECT: decreased memory volume needed for storing data structure of language model.

7 cl, 4 dwg

FIELD: communication systems; method for storing geographical information in communications center.

SUBSTANCE: geographical data is received, authentication query is sent to geographical data authentication database, which communicated with communications center. Answer for authentication query is received, and geographical data is stored in informational storage, which is a database, which communicates with communications center.

EFFECT: increased accuracy of service rendering corresponding to location in communication network on the basis of previously stored location information.

10 cl, 5 dwg

FIELD: information search means, database structures.

SUBSTANCE: two data areas are created. At least one of them is resident area, and at least one other area is non-resident for searched data object query source. Control data objects array is created in resident area, and/or control data objects array with corresponding to each object initial hyperlinks as linked data. In nonresident area control associated information data objects array is created and/or control associated information data objects array with corresponding to each object associated data and/or at least one secondary hyperlink.

EFFECT: simplified logical and physical database organization with permanent renewal of control associated information data objects, and increased performance of system due to simplified functioning of informational network communication nodes.

37 cl, 1 tbl

FIELD: computer engineering, automated system for collecting and processing electronic polls data.

SUBSTANCE: system consists of input messages receiving unit, data from server database receiving unit, election committee identification unit, first and second units for candidates base addresses identification, polls results disclosure time cycles selection unit, polls results recording time cycles selection unit, input messages receiving time cycles selection unit, database read and write signals forming unit, final polls results data forming unit.

EFFECT: increased system performance due to database entries address localization using receiving messages identifiers and forming of progressive total of polls results in real-time.

9 dwg

FIELD: computer engineering, systems for supporting informational identity of geographically distributed databases of airline companies.

SUBSTANCE: systems consists of address identifiers unit, memory area identification unit, input message target selection unit, database entries base address selection unit, adder, read signal forming unit, six registers, database entries identification unit, entries quantity identification unit, counter, control signal forming unit, OR elements.

EFFECT: increased system performance due to database entries addresses localization using data sources and flights identifiers.

9 dwg

FIELD: computer engineering; system for data distribution control in information analytical center network of air company commerce unit.

SUBSTANCE: system contains three registers, renewed data entries address identification device, client query data address identification device, decoder, data read control signal forming unit, and data output channels commutation unit.

EFFECT: simplified system, increased performance by excluding memory buffer blocks and time interval selector, and asynchronous mode of server-client interaction implementation.

5 dwg

FIELD: computer engineering; structure-statistical analysis of informational arrays.

SUBSTANCE: device contains current evaluation signal former, evaluation zones discriminator, pulse distributor, time intervals counter, commutator, search variable former, adding counters, storage units, division units, classifier, search strategy register, reset signals former, data representation and write unit, threshold signals change unit, current day timer, cutoff threshold former unit, structural analyzer.

EFFECT: increased informativity of traffic values, which define informational arrays structure due to structural analysis of determinate combinations.

2 cl, 3 dwg, 1 apl

FIELD: digital data processing using electrical devices; informational search means and database structures; foreign language learning.

SUBSTANCE: electronic documents data is entered into the computer. Electronic documents objects to be searched in informational system are discovered. Electronic documents objects to be searched in informational system are compared to informational system database objects. Electronic documents data is transformed by marking objects of electronic documents. Electronic documents with marked electronic documents data objects are visualized. Before entering electronic documents data into the computer data objects to be searched in informational system are entered, data objects to be searched in informational system are compared to informational system database data objects and buffer database of data objects is formed. Comparison of electronic documents objects to be searched in informational system is done with data objects in buffer database of data objects.

EFFECT: creation of effective method for searching and marking of information data, that is to implement the learning function "learned repetition", which is based on individual approach to learning.

18 cl

FIELD: distribution devices, terminal devices.

SUBSTANCE: in distribution device groups of two or more informational products which represent digital informational content are stored with information about policy administration which indicates user's rights to this group by interrelated method. Distribution device transfers the user requested informational content from group to the terminal device with license certificate (LC), refreshes information about policy administration decreasing policy validity. On return of the renewed LC distribution device increases the decreased policy validity taking into account the part of policy validity which is indicated in the renewed LC. On user's demand distribution device again transfers LC or other digital informational content.

EFFECT: distribution of digital content for a more complete satisfaction of user's demand.

22 cl, 58 dwg

FIELD: technology for setting up logical connections between a set of data files, such as files in Internet.

SUBSTANCE: device contains: display means; means for determining area of display for first file, made with possible selection of second area, which represent second files logically connected to first files, and for determining additional display files for other files, logically connected to first file; input means, made with possible selection of display area, appropriate for one of files. Procedures for assigning display areas may be performed iteratively, so that a certain diagram of interconnections between these areas is formed.

EFFECT: simplified setting up of connections between data files of various types.

6 cl, 34 dwg

FIELD: data access technologies.

SUBSTANCE: method includes assignment of simplified network address, recording URL and converting numbers into storage system with net access, inputting assigned number into computer, transferring inputted number to storage system, converting number to URL, receiving page matching URL, and displaying it. Method for use in operation systems for message transfer include intercepting system level messages to certain objects and forming pseudonym messages during that. Systems realize said methods.

EFFECT: broader functional capabilities.

12 cl, 30 dwg

FIELD: computers.

SUBSTANCE: system has entries memory block, words memory block, control block, substitutions block, n blocks for searching and replacing.

EFFECT: broader functional capabilities.

17 dwg

FIELD: computers.

SUBSTANCE: system has nine registers, four address selectors, triggers, AND elements, OR elements and delay elements.

EFFECT: higher speed.

8 dwg

FIELD: computers.

SUBSTANCE: system has operation mode setting block, first and second blocks for selecting records addresses, block for forming addresses for reading records, data output block, first and second record codes comparison blocks, records quality comparison block, year intervals comparison block, records selection control block, register, adder and OR elements.

EFFECT: higher speed of operation.

10 dwg

FIELD: computers.

SUBSTANCE: system has memory for programs, including browser, display block, database for storing documents, addressing control block, while each document of base has at least one link with indicator of its unique number and indicator with address of program for control stored in addressing control block, system contains also, connected by data buses and control of other blocks of system, memory for links of couples of unique numbers of links and forming means for lists of unique numbers of documents links, which are interconnected.

EFFECT: higher efficiency.

2 cl, 1 dwg

FIELD: telecommunication networks.

SUBSTANCE: messages, sent by cell phones, are formed by means of printed and public-distributed classifier, wherein at least one category is made with possible detection of at least one identifier of individual mark of object, identifier is sent by sender via at least one message to computer server with software, which transfers such message into database record at server for its transfer to at least one receiver, or searches for such record in database at server in accordance to received message and transfers to sender of such message at least one found database record.

EFFECT: broader functional capabilities.

2 dwg

FIELD: web technologies.

SUBSTANCE: method for integration of printed business documents, requiring original signature, with electronic data concerning these documents and later extraction of data, inputted for forming documents, is characterized by steps for forcing end user or agent to input all necessary data for forming of required document, saving collected data in database, linking saved data to unique ID code and printing unique ID code on printed document during printing. Printed documents is signed by end user and sent together with supporting documentation. When document is received by business-client, business-client inputs ID code, which is then used for access to saved data, and updates private database of business-client with all data, used for creation of original documents.

EFFECT: higher efficiency.

2 cl, 7 dwg

FIELD: computer science.

SUBSTANCE: device has string memory block, comparator, memory block for words and substitutes, block for analysis and forming of displacement results, block for storing string address, control block.

EFFECT: broader functional capabilities, higher reliability.

10 dwg

FIELD: data bases.

SUBSTANCE: method includes presenting operations at all levels of company in form typical product life cycle tree, wherein existing objective functional-technological connections of each manufacture stage are decomposed, and forming information system in form of pertinent-relevant complex information system and search, for which typical structure-information modules of information system are formed, system objective information requirements of data consumers, being a result of decompositions by levels of operations and problems, are determined as precisely as possible, data base of found documents in form of files is formed of key nodes with set of elementary data block for each system information requirement and files of information system modules, starting from lower levels of current stage and then upwards, while each data block has a list of pertinent documents ordered by determined information requirements.

EFFECT: higher search efficiency.

13 cl, 11 dwg

FIELD: computer science.

SUBSTANCE: system has first, second, third, fourth and fifth registers, first and second memory blocks, first, second and third decoders, triggers, elements AND, OR and delay elements.

EFFECT: higher speed of operation.

1 dwg

Up!