会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Method for generating and/or processing a data stream description
    • 用于生成和/或处理数据流描述的方法
    • US07769879B2
    • 2010-08-03
    • US10580801
    • 2004-10-26
    • Jörg HeuerAndreas HutterGabriel PanisChristian Timmerer
    • Jörg HeuerAndreas HutterGabriel PanisChristian Timmerer
    • G06F13/00
    • H04N21/2353H04N21/235H04N21/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.
    • 本发明涉及一种用于产生和/或处理数据流描述的方法。 根据所述方法,使用数据流描述来写入和/或引用和/或分类数据流的部分,并且数据流描述可以通过使用变换的处理器进行变换,变换的数据流描述允许 适应数据流。 本发明的方法的特征在于,数据流描述的一个或多个部分被标记为处理单元,处理单元包含来自处理单元通过处理器转换为处理单元所需的数据流描述的所有信息 变换处理单元。 不需要对处理单元之外的数据流描述的部分进行访问。
    • 5. 发明授权
    • Coding positions of data elements in a data structure
    • 在数据结构中编码数据元素的位置
    • US08117236B2
    • 2012-02-14
    • US12480397
    • 2009-06-08
    • Jörg HeuerAndreas Hutter
    • Jörg HeuerAndreas Hutter
    • G06F17/30
    • 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.
    • 本发明涉及用于对数据结构中数据元素的位置进行编码的方法。 根据该方法,位置码与预定序列中的数据元素相关联,以这样的方式选择位置码,如果位置码的长度不受限制,则可以在多个位置码之间任意分配许多其他位置码, 两个数据元素的位置,以便对其他数据元素的位置进行编码。 本发明还涉及一种用于对数据结构中的数据元素的位置进行编码的方法,其中位置代码以预定顺序与数据元素相关联,所述位置代码被选择为使得其他位置代码可以是 分配在两个相邻数据元素的位置之间,以便对其他数据元素的位置进行编码,至少一个其它位置代码长于两个相邻数据元素的最长位置代码。
    • 6. 发明申请
    • Coding Positions of Data Elements In A Data Structure
    • 数据结构中数据元素的编码位置
    • US20090307243A1
    • 2009-12-10
    • US12480397
    • 2009-06-08
    • Jörg HeuerAndreas Hutter
    • Jörg HeuerAndreas Hutter
    • G06F17/30
    • 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.
    • 本发明涉及用于对数据结构中数据元素的位置进行编码的方法。 根据该方法,位置码与预定序列中的数据元素相关联,以这样的方式选择位置码,如果位置码的长度不受限制,则可以在多个位置码之间任意分配许多其他位置码, 两个数据元素的位置,以便对其他数据元素的位置进行编码。 本发明还涉及一种用于对数据结构中的数据元素的位置进行编码的方法,其中位置代码以预定顺序与数据元素相关联,所述位置代码被选择为使得其他位置代码可以是 分配在两个相邻数据元素的位置之间,以便对其他数据元素的位置进行编码,至少一个其它位置代码长于两个相邻数据元素的最长位置代码。
    • 7. 发明授权
    • Method for coding positions of data elements in a data structure
    • 用于对数据结构中的数据元素的位置进行编码的方法
    • US07546303B2
    • 2009-06-09
    • US10521620
    • 2003-06-30
    • Jörg HeuerAndreas Hutter
    • Jörg HeuerAndreas Hutter
    • G06F17/30
    • 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 predetermined 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.
    • 本发明涉及用于对数据结构中数据元素的位置进行编码的方法。 根据该方法,位置码与预定序列中的数据元素相关联,以这样的方式选择位置码,如果位置码的长度不受限制,则可以在多个位置码之间任意分配许多其他位置码, 两个数据元素的位置,以便对其他数据元素的位置进行编码。 本发明还涉及一种用于对数据结构中的数据元素的位置进行编码的方法,其中位置代码以预定顺序与数据元素相关联,所述位置代码被选择为使得可以在 两个相邻数据元素的位置,以便编码其他数据元素的位置,至少一个其它位置代码长于两个相邻数据元素的最长位置代码。
    • 9. 发明申请
    • METHOD FOR IMPROVING THE FUNCTIONALITY OF A BINARY REPRESENTATION
    • 改进二进制表示功能的方法
    • US20110055684A1
    • 2011-03-03
    • US12862973
    • 2010-08-25
    • Jörg HeuerAndreas HutterUlrich Niedermeier
    • Jörg HeuerAndreas HutterUlrich Niedermeier
    • G06F17/00
    • H04N21/2353H04N19/20H04N19/70H04N21/235H04N21/435Y10S707/99936Y10S707/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 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.
    • 提供了一种用于改进基于XML的内容描述的二进制表示的功能的方法,其中XML文档的任何实例的结构对应于包括多个树节点的树状数据结构。 该方法包括提供每个树节点表示内容描述的元素并且具有在模式中定义的结构; 用树分支代码提供具有二进制表示的树节点; 提供相应的树分支代码具有模式分支代码; 通过利用树节点中的未使用的模式分支代码扩展现有模式,用于具有新元素的扩展,直到未使用的模式分支代码全部消耗,并且根据需要增加模式分支代码的位长度; 以及将比特长度改变传送到解码器,以正确解码二进制表示中的内容描述。