Abstract: A structured document having at least one informational unit with at least one character is divided, according to a first base type, into sections of a second base type. The sections are compressed according to specified compression instructions for the second base type to achieve an increased rate of compression. The informational elements may be expressed in an XML language. The compression method and corresponding compression unit, decompression method and decompression unit can be applied in the area of initialization of end devices, such as in systems engineering or in the IT consumer industry.

Abstract: A method for communicating between an electric vehicle and a charging station for electrically charging at least one energy storage device of the electric vehicle. The electric vehicle is connected to the charging station during the charging process by a lockable mechanical coupling between a terminal of charging cable connected to the vehicle and a terminal of the charging station. Charging current is fed from the charging station through the charging cable. Information is transferred in the course of the charging process based on a communication between the electric vehicle and the charging station. The information includes a signal transmitted from the electric vehicle to the charging station for locking and/or unlocking the mechanical coupling. The signal triggers the locking and/or unlocking of the mechanical coupling between the terminal of the charging cable and the terminal at the charging station.

Abstract: in a method and a device for placing units, such as motes, for executing an application in a distributed system, a placement of the units by a service layer and a communication between the units by a communication layer are provided. One field of application is for example process automation, such as in industrial or building management installations. Such installations have sensors and actuators with communication interfaces. The method and the device allow the energy demand of the installation to be reduced. Communication is preferably performed wirelessly. Network management is for example conducted according to the wireless HART protocol.

Abstract: In a method for communicating between a number of first services and a number of second services. The number of first services belongs to a service-oriented architecture, in which a respective first service is provided by messages based on a question-answer mechanism by a first protocol. The number of second services belongs to a data-based architecture, in which second services can be switched together by a second protocol. The second protocol specifies data input and data output of the second service and transfers the data between the second services. A message of a first service, entering into the service converter, is converted into data input of a second service associated with the first service and/or data output of a second service, entering into the service converter is converted into a message emitted by the service converter, of a first service associated with the second service.

Abstract: The present invention relates to a method for coding positions of data elements in a data structure. According to the method, position codes are associated with the data elements in a pre-determined sequence, the position codes being selected in such a way that, if the lengths of the position codes are unlimited, many other position codes can be arbitrarily allocated between the positions of two data elements in order to code positions of other data elements. The present invention also relates to a method for coding positions of data elements in a data structure, whereby position codes are associated with the data elements in a pre-determined sequence, the position codes being selected in such a way that other position codes can be allocated between the positions of two adjacent data elements in order to code positions of other data elements, at least one other position code being longer than the longest position codes of the two adjacent data elements.

Abstract: A method for the temporal synchronization of data packets of at least one media data flow with scene data files describing at least one scene and/or the data packets of said data files, in a unidirectional broadcast system. The data packets of the media data flow are each provided with a first time mark relating to a first reference time, and the scene data files and/or the data packets thereof are each provided with a second time mark relating to a second reference time. At least one time mark allocation data flow is transmitted from the transmitter to the receiver, the first time marks of the media data flow and the second time marks of the scene data files and/or the data packets thereof being respectively associated with a third time mark relating to a third reference time.

Abstract: A method for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML-document corresponds to a tree-like data structure including a plurality of tree nodes, is provided. The method includes providing that each tree node represents an element of the content description and has a structure which is defined in a schema; providing the tree nodes in binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code; extending an existing schema by utilizing unused schema branch codes in a tree node for extensions with new elements until the unused schema branch codes are all used up, and increasing a bit length of the schema branch code as necessary; and communicating a bit length change to a decoder for correctly decoding the content description in the binary representation.

Abstract: A schema definition, which is known to the encoder and to the decoder or transmitted from the encoder to the decoder, specifies information for calculating code concerning the elements or data types contained in the name subspace and enabling this information to be clearly assigned in this manner to each code in the name subspace. Only a portion of the entire name space including the number of the elements or data types lacking for the code calculation have to be transmitted for the configuration of a code which generally means a significantly smaller volume of data than the volume of data that would be required for the entire name space. In addition, the code tables are smaller than in entirely known name spaces which requires less storage space in the codec and enables a faster encoding and decoding.

Abstract: Certain exemplary embodiments can provide and/or utilize a system, device, and/or method for managing changes to data, such as a method that includes transmitting a change to a static object (SO1) by means of a change object (SO*) in a data distribution service that communicates a plurality of static objects (SO1, . . . , SO5) via a carousel transmission (KUE) and real time data (RD) via a streaming transmission (SUE), wherein the change object (SO*) is formed on the basis of at least one information item (I*) to be changed and on the basis of at least one change rule (R*) specifying a procedure for carrying out the change, and the change object (SO*) is communicated via the streaming transmission (SUE).

Abstract: A method for improving functionality of a binary representation of an XML-based content description, wherein a structure of any instance of an XML-document corresponds to a tree-like data structure including a plurality of tree nodes, is provided. The method includes providing that each tree node represents an element of the content description and has a structure which is defined in a schema; providing the tree nodes in binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code; extending an existing schema by utilizing unused schema branch codes in a tree node for extensions with new elements until the unused schema branch codes are all used up, and increasing a bit length of the schema branch code as necessary; and communicating a bit length change to a decoder for correctly decoding the content description in the binary representation.

Abstract: The present invention relates to the description of a data stream having data stream subdomains, which can be referenced and classified, and a data stream syntax. According to the present invention, the data stream subdomains are referenced and classified by division into at least one respective class of a classification, whereby the classification is at least partially independent of the syntax of the data stream.

Abstract: A method is disclosed for coding a structured document, wherein a plurality of codes is generated by use of one or more schemata and/or name spaces. For a schema and/or a name space and/or for a group of schemata and/or name spaces independent codes for the elements defined or declared in the schemata and/or in the groups of schemata and/or name spaces are allocated. For every schema and/or name space an allocation to additional schemata and/or name spaces is carried out. A corresponding coding method, a coding device, a decoding device and a coding/decoding device are also disclosed.

Abstract: A method is provided for encoding string-based data types, which have, for example, a tree-type structure, in such a way that signal bits (flags) for optional sections and/or for length information concerning the codes that are of variable length are placed in a defined sequence at the beginning of the created bitstream, thus accelerating the search for data via a sorting process and bit mask queries. A more efficient encoding is also provided of the #position field by, among other things, the assignment of code fragments for each group of regular expressions.

Abstract: For processing of XML data by use of a finite state automaton, the XML data is based on a predetermined XML schema and the finite state automaton has states and transitions being arranged based on the predetermined XML schema. In the finite state automaton, at least one of the transitions of the finite state automaton, which refers to an element or attribute of the XML schema, has a variable length binary code, the variable length binary code being arranged to code the element or attribute of the XML schema. An improved handling of XML data in several systems or devices of several technical areas is provided, wherein saving of memory resources and processing resources or costs in the systems and devices is enabled.

Abstract: This invention relates to a method for producing and/or processing a data stream description. According to said method, the data stream description is used to write and/or reference and/or classify sections of a data stream and the data stream description can be transformed by means of a processor using a transformation, the transformed data stream description allowing an adaptation of the data stream. The inventive method is characterized in that one or more sections of a data stream description are marked as processing units, a processing unit containing all information from the data stream description that is required for the transformation of the processing unit by means of the processor into a transformed processing unit. An access to sections of the data stream description outside the processing unit is not required for transformation.

Abstract: Methods and devices are provided for encoding/decoding structured documents, particularly XML documents, wherein a bit stream or part of a bit stream is produced from a schema as a function of a metaschema with the aid of an encoding method. Under an exemplary embodiment, at least one of the following optimization processes is carried out: separation of anonymous types from element declarations and attribute declarations and encoding as own type, the type definition thereof being instantiated in the schema definition as a top level element; normalization of the syntax trees on the encoder side; replacement of the character strings of type names; and transmission of information for the inheritance tree. The decoding takes such optimization processes into account and conversely produces a schema from the bit stream.

Abstract: A method for the temporal synchronization of data packets of at least one media data flow with scene data files describing at least one scene and/or the data packets of said data files, in a unidirectional broadcast system. The data packets of the media data flow are each provided with a first time mark relating to a first reference time, and the scene data files and/or the data packets thereof are each provided with a second time mark relating to a second reference time. At least one time mark allocation data flow is transmitted from the transmitter to the receiver, the first time marks of the media data flow and the second time marks of the scene data files and/or the data packets thereof being respectively associated with a third time mark relating to a third reference time.

Abstract: The invention relates to a method and a first device for updating at least one data element in a data carousel, in which an updating element is added to the data carousel for at least one group of at least one data element, wherein the updating element indicates either the time of update of at least one of the data elements of the group, or a time interval for checking an update of at least one of the data elements of the group. The invention also comprises a method and a second device for checking an update of a data element in a data carousel, wherein the checking of at least one of the data elements is performed on the basis of an updating element that is added in the data carousel for at least one group of data elements. Finally, the invention comprises a data flow that has an updating element in the data carousel for at least one group of data elements.

Abstract: The present invention relates to a method for coding positions of data elements in a data structure. According to the method, position codes are associated with the data elements in a pre-determined sequence, the position codes being selected in such a way that, if the lengths of the position codes are unlimited, many other position codes can be arbitrarily allocated between the positions of two data elements in order to code positions of other data elements. The present invention also relates to a method for coding positions of data elements in a data structure, whereby position codes are associated with the data elements in a pre-determined sequence, the position codes being selected in such a way that other position codes can be allocated between the positions of two adjacent data elements in order to code positions of other data elements, at least one other position code being longer than the longest position codes of the two adjacent data elements.

Abstract: A method is for encoding a structured document, particularly an XML document, during which the contents of the document are converted into a binary representation. This binary representation is divided into encoding units, which form an encoded data flow and can be read out from the encoded data flow. The encoded data flow contains configuration data, with which configuration information concerning the division of the binary representation into encoding units can be read out before the reading out of one of more encoding units.