公开(公告)号：US07844895B2

公开(公告)日：2010-11-30

申请号：US11617909

申请日：2006-12-29

申请人： Jorg Heuer ,  Andreas Hutter ,  Ulrich Niedermeier

发明人： Jorg Heuer ,  Andreas Hutter ,  Ulrich Niedermeier

IPC分类号： G06F17/00

CPC分类号： H04N21/2353 ,  H04N19/20 ,  H04N19/70 ,  H04N21/235 ,  H04N21/435 ,  Y10S707/99936 ,  Y10S707/99942

摘要： A method is provided 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. The method includes providing that each tree node represents an element of the content description and has a structure defined in a schema; providing the tree nodes in the binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code and, when appropriate, a position code; forming first and second tables for the schema branch codes when each node is being coded, the first table including complex elements containing child elements and the second table including complex elements as well as attributes and simple elements which represent leaves of the tree-like data structure; and forming a complete path by chaining together tree nodes in the binary representation.

摘要翻译： 提供了一种用于改进基于XML的内容描述的二进制表示的功能的方法，其中XML文档的任何实例的结构对应于树状数据结构。 该方法包括提供每个树节点表示内容描述的元素并且具有在模式中定义的结构; 使用树分支代码提供二进制表示中的树节点; 条件是相应的树分支代码具有模式分支代码，并且在适当时具有位置代码; 在编码每个节点时形成用于模式分支代码的第一和第二表，第一表包括包含子元素的复数元素，第二表包括复杂元素，以及表示树形数据结构的树叶的属性和简单元素 ; 并通过将二叉表示中的树节点链接在一起形成完整的路径。

公开(公告)号：US20060291471A1

公开(公告)日：2006-12-28

申请号：US10566740

申请日：2005-03-17

申请人： Jorg Heuer ,  Klaus Illgner-Fehns ,  Joachim Laier ,  Ulrich Nies ,  Uwe Rauschenbach ,  Gerhard Siemens ,  Martin Winter

发明人： Jorg Heuer ,  Klaus Illgner-Fehns ,  Joachim Laier ,  Ulrich Nies ,  Uwe Rauschenbach ,  Gerhard Siemens ,  Martin Winter

IPC分类号： H04L12/28

CPC分类号： H04L51/28 ,  H04L51/04 ,  H04L51/066 ,  H04L51/36 ,  H04L51/38 ,  H04L67/2819 ,  H04L67/2823 ,  H04L67/303 ,  H04L67/306

摘要： According to the disclosure, various service messages, such as multimedia messages, short messages, Email messges, fax messages, “Voice Mail” messages, “Instant Messaging” messages etc., available or provided in a service center, or generated in a terminal are transmitted between the service center and a terminal, without the terminal having to be embodied as a client with relation to the transmission and processing of the service message, whereby the service message is directly or indirectly transmitted from the service center to a server, embodied as message server, preparing the message using an intermediate server and sent from the above in prepared form, for output on a network specific terminal to the terminal and multimedia message content is transmitted in the reverse direction from the terminal to the server which generates multimedia messages from the content and then sends the above directly or indirectly to the service center.

摘要翻译： 根据本公开，可以在服务中心中可用或提供或在终端中生成的各种服务消息，例如多媒体消息，短消息，电子邮件消息，传真消息，“语音信箱”消息，“即时消息”消息等 在服务中心和终端之间传输，而不必将终端与服务消息的发送和处理相关联地体现为客户端，从而将服务消息从服务中心直接或间接传送到服务器 作为消息服务器，使用中间服务器准备消息并以准备的形式从上述发送消息，以在终端的特定于终端的特定终端上输出，并且从终端向生成彩信的服务器的相反方向发送多媒体消息内容 从内容，然后直接或间接发送到服务中心。

公开(公告)号：US20060089937A1

公开(公告)日：2006-04-27

申请号：US10521620

申请日：2003-06-30

申请人： Jorg Heuer ,  Andreas Hutter

发明人： Jorg Heuer ,  Andreas Hutter

IPC分类号： G06F7/00

CPC分类号： H03M7/14

摘要： 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.

摘要翻译： 本发明涉及用于对数据结构中数据元素的位置进行编码的方法。 根据该方法，位置码与预定序列中的数据元素相关联，以这样的方式选择位置码，如果位置码的长度不受限制，则可以在多个位置码之间任意分配许多其他位置码， 两个数据元素的位置，以便对其他数据元素的位置进行编码。 本发明还涉及一种用于对数据结构中的数据元素的位置进行编码的方法，其中位置代码以预定顺序与数据元素相关联，所述位置代码被选择为使得其他位置代码可以是 分配在两个相邻数据元素的位置之间，以便对其他数据元素的位置进行编码，至少一个其它位置代码长于两个相邻数据元素的最长位置代码。

公开(公告)号：US20050182778A1

公开(公告)日：2005-08-18

申请号：US10521832

申请日：2003-07-07

申请人： Jorg Heuer ,  Andreas Hutter ,  Ulrich Niedermeier

发明人： Jorg Heuer ,  Andreas Hutter ,  Ulrich Niedermeier

IPC分类号： G06F13/00 ,  G06F17/21 ,  G06F17/22 ,  H04N7/08 ,  H04N7/081 ,  H04N7/24 ,  G06F17/00

CPC分类号： H04N21/2353 ,  G06F17/2247 ,  G06F17/227 ,  H04N21/235 ,  H04N21/435 ,  Y10S707/99942

摘要： 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. According to the present invention, 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.

摘要翻译： 提供了用于对结构化文档，特别是XML文档进行编码/解码的方法和装置，其中借助于编码方法，从流模式生成位流或位流的一部分作为元空间的函数。 根据本发明，执行以下优化过程中的至少一个：将匿名类型与元素声明和属性声明和编码分离为自己的类型，其类型定义在模式定义中被实例化为顶级元素; 编码器侧语法树的归一化; 更换类型名称的字符串; 并传递继承树的信息。 解码考虑了这样的优化过程，并且相反地从比特流产生模式。

公开(公告)号：US20090270123A1

公开(公告)日：2009-10-29

申请号：US12298494

申请日：2007-04-24

申请人： Jorg Heuer ,  Uwe Rauschenbach

发明人： Jorg Heuer ,  Uwe Rauschenbach

IPC分类号： H04M1/00 ,  H04B1/06

CPC分类号： H04H20/26 ,  H04H20/57 ,  H04H20/72 ,  H04H40/27 ,  H04H60/37 ,  H04H60/44 ,  H04H60/51 ,  H04H60/65 ,  H04H60/70 ,  H04H60/91

摘要： The invention relates to a method for configuring a radio receiver, in which at least one parameter is received by a first receiving means via a first connection of a first network, at least one configuration parameter is generated by evaluating the parameter, and a second connection to a second network is established by a second receiving means of the radio receiver based on the configuration parameter. The invention further relates to said radio receiver as well as a first transmitter of the first network.

摘要翻译： 本发明涉及一种用于配置无线电接收机的方法，其中第一接收装置经由第一网络的第一连接接收至少一个参数，通过评估参数来生成至少一个配置参数，第二连接 基于配置参数，通过无线电接收机的第二接收装置建立到第二网络。 本发明还涉及所述无线电接收机以及第一网络的第一发射机。

公开(公告)号：US20080189310A1

公开(公告)日：2008-08-07

申请号：US11662057

申请日：2005-08-30

申请人： Jorg Heuer ,  Andreas Hutter ,  Uwe Rauschenbach

发明人： Jorg Heuer ,  Andreas Hutter ,  Uwe Rauschenbach

IPC分类号： G06F17/30

CPC分类号： H04N21/2353 ,  H04N21/235 ,  H04N21/435

摘要： The root element of an encoded fragment is stored in a table by name and the name of a parent element, i.e., according to their paths. The path is an absolute path which starts at the root node of the document tree and leads to an element of the document tree which is exclusively contained in a fragment, i.e., which is the root element of an encoded fragment. This table, the so-called context path table, is transmitted in advance to initialize a decoder. The encoder and decoder associate every entry of the context path table with a context code of a defined length. Before an encoded fragment is transmitted, the absolute path to the root element of the fragment is signaled as the context information by the ContextCode associated therewith. This ContextCode has a defined length for the period of transmission. The use of an initialization table allows free selection of the subdivision into fragments during initialization of transmission.

摘要翻译： 编码片段的根元素通过名称和父元素的名称（即根据它们的路径）存储在表中。 该路径是从文档树的根节点开始的绝对路径，并且导致专门包含在片段中的文档树的元素，即作为编码片段的根元素。 该表，即所谓的上下文路径表，被提前发送以初始化解码器。 编码器和解码器将上下文路径表的每个条目与定义长度的上下文代码相关联。 在发送编码片段之前，通过与其相关联的ContextCode将该片段的根元素的绝对路径信号发送为上下文信息。 该ContextCode具有传输周期的定义长度。 初始化表的使用允许在传输初始化期间将细分分割为片段。

公开(公告)号：US20070143494A1

公开(公告)日：2007-06-21

申请号：US10580801

申请日：2004-10-26

申请人： Jorg Heuer ,  Andreas Hutter ,  Gabriel Panis ,  Christian Timmerer

发明人： Jorg Heuer ,  Andreas Hutter ,  Gabriel Panis ,  Christian Timmerer

IPC分类号： G06F15/173

CPC分类号： H04N21/2353 ,  H04N21/235 ,  H04N21/435

摘要： 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.

摘要翻译： 本发明涉及一种用于产生和/或处理数据流描述的方法。 根据所述方法，使用数据流描述来写入和/或引用和/或分类数据流的部分，并且数据流描述可以通过使用变换的处理器进行变换，变换的数据流描述允许 适应数据流。 本发明的方法的特征在于，数据流描述的一个或多个部分被标记为处理单元，处理单元包含来自处理单元通过处理器转换为处理单元所需的数据流描述的所有信息 变换处理单元。 不需要对处理单元之外的数据流描述的部分进行访问。

公开(公告)号：US20060064424A1

公开(公告)日：2006-03-23

申请号：US10535166

申请日：2003-10-30

申请人： Jorg Heuer ,  Andreas Hutter ,  Andrea Kofler-Vogt ,  Harald Kosch

发明人： Jorg Heuer ,  Andreas Hutter ,  Andrea Kofler-Vogt ,  Harald Kosch

IPC分类号： G06F17/30

CPC分类号： H03M7/00 ,  G06F17/2247 ,  G06F17/227 ,  H03M7/30 ,  H04N21/235 ,  H04N21/2353 ,  H04N21/435 ,  H04N21/8543 ,  Y10S707/99943

摘要： A method is disclosed for creating a bit stream from an indexing tree including a plurality of hierarchical levels, to each of which one or several index nodes are assigned. The index nodes contain index data which is sorted in the indexing tree according to one or several given criteria. Index data of the index nodes is inserted into the bit stream, and the information concerning the position within the bit stream, where the index data of one or several index nodes of the hierarchical level located below the hierarchical level of the respective node is situated, is inserted into the bit stream for an index node.

摘要翻译： 公开了一种用于从包括多个分层级的索引树创建比特流到分配了一个或多个索引节点中的每一个的比特流的方法。 索引节点包含根据一个或几个给定标准在索引树中排序的索引数据。 将索引节点的索引数据插入到比特流中，并且关于比特流中位于相应节点的分层级别下方的分层级的一个或多个索引节点的索引数据所位于的位置的信息， 被插入到用于索引节点的比特流中。

公开(公告)号：US07882428B2

公开(公告)日：2011-02-01

申请号：US11617924

申请日：2006-12-29

申请人： Jorg Heuer ,  Andreas Hutter ,  Ulrich Niedermeier

发明人： Jorg Heuer ,  Andreas Hutter ,  Ulrich Niedermeier

IPC分类号： G06F17/00

CPC分类号： H04N21/2353 ,  H04N19/20 ,  H04N19/70 ,  H04N21/235 ,  H04N21/435 ,  Y10S707/99936 ,  Y10S707/99942

摘要： 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 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 the binary representation with tree branch codes, providing that the respective tree branch code has a schema branch code and, when there are multiple occurrences of an associated child node based on the definition of the schema, a position code, and re-sorting a complete path such that all the position codes are moved to an end of the respective complete path, thereby enabling simpler filtering of the binary representation.

摘要翻译： 一种用于改进基于XML的内容描述的二进制表示的功能的方法，其中提供了XML文档的任何实例的结构对应于树状数据结构。 该方法包括提供每个树节点表示内容描述的元素，并且具有在模式中定义的结构，用二叉表示中的树节点提供树分支代码，条件是相应的树分支代码具有模式分支 代码，并且当基于模式的定义存在相关联的子节点的多次出现时，位置代码和重新排序完整路径，使得所有位置代码被移动到相应的完整路径的结尾，从而 使得能够更简单地过滤二进制表示。

公开(公告)号：US07844628B2

公开(公告)日：2010-11-30

申请号：US11617943

申请日：2006-12-29

申请人： Jorg Heuer ,  Andreas Hutter ,  Ulrich Niedermeier

发明人： Jorg Heuer ,  Andreas Hutter ,  Ulrich Niedermeier

IPC分类号： G06F17/30

CPC分类号： H04N21/2353 ,  H04N19/20 ,  H04N19/70 ,  H04N21/235 ,  H04N21/435 ,  Y10S707/99936 ,  Y10S707/99942

摘要： 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, 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 the binary representation with tree branch codes; providing that the respective tree branch code has a schema branch code; and decoding, via a decoder within a telecommunications device, paths with new elements, which does not conform to a previous schema, by communicating to the decoder one of (a) the associated tree structure nodes beforehand, and (b) a completely new schema.

摘要翻译： 提供了一种用于改进基于XML的内容描述的二进制表示的功能的方法，其中XML文档的任何实例的结构对应于树状数据结构。 该方法包括提供每个树节点表示内容描述的元素并且具有在模式中定义的结构; 使用树分支代码提供二进制表示中的树节点; 提供相应的树分支代码具有模式分支代码; 以及通过经由电信设备中的解码器，通过与（a）相关联的树结构节点预先通信到解码器之一来解码不符合先前模式的新元素的路径，以及（b）全新的模式 。