会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Z-coder: a fast adaptive binary arithmetic coder
    • US06281817B1
    • 2001-08-28
    • US09795395
    • 2001-02-28
    • Yoshua BengioLeon BottouPaul G. Howard
    • Yoshua BengioLeon BottouPaul G. Howard
    • A binary arithmetic coder and decoder provides improved coding accuracy due to improved probability estimation and adaptation. They also provide improved decoding speed through a “fast path” design wherein decoding of a most probable symbol requires few computational steps. Coded data represents data that is populated by more probable symbols (“MPS”) and less probable symbols (“LPS”). In an embodiment, a decoder receives a segment of the coded data as a binary fraction C. It defines a coding interval of possible values of C, the interval extending from a variable lower bound A to a constant upper bound 1. For each position in the decoded symbol string, the decoder computes a test value Z that subdivides the coding interval into sub-intervals according to the relative probabilities that an MPS or an LPS occurs in the position. A first sub-interval extends from the lower bound A to the test value Z; the second sub-interval extending from the test value Z to 1. If C is greater than Z, the decoder emits an MPS for the current position in the decoded symbol string and sets the lower bound A to the test variable Z for use during decoding of the next position in the decoded symbol string. If C is less than Z, the decoder emits an LPS and computes a new lower bound A and a new binary fraction C for use during decoding of the next position in the decoded symbol string. The encoder operates according to analogous techniques to compose coded data from original data.
    • 3. 发明授权
    • Z-coder: a fast adaptive binary arithmetic coder
    • Z编码器:快速自适应二进制算术编码器
    • US06225925B1
    • 2001-05-01
    • US09042007
    • 1998-03-13
    • Yoshua BengioLeon BottouPaul G. Howard
    • Yoshua BengioLeon BottouPaul G. Howard
    • H03M700
    • H03M7/4006
    • A binary arithmetic coder and decoder provides improved coding accuracy due to improved probability estimation and adaptation. They also provide improved decoding speed through a “fast path” design wherein decoding of a most probable symbol requires few computational steps. Coded data represents data that is populated by more probable symbols (“MPS”) and less probable symbols (“LPS”). In an embodiment, a decoder receives a segment of the coded data as a binary fraction C. It defines a coding interval of possible values of C, the interval extending from a variable lower bound A to a constant upper bound 1. For each position in the decoded symbol string, the decoder computes a test value Z that subdivides the coding interval into sub-intervals according to the relative probabilities that an MPS or an LPS occurs in the position. A first sub-interval extends from the lower bound A to the test value Z; the second sub-interval extending from the test value Z to 1. If C is greater than Z, the decoder emits an MPS for the current position in the decoded symbol string and sets the lower bound A to the test variable Z for use during decoding of the next position in the decoded symbol string. If C is less than Z, the decoder emits an LPS and computes a new lower bound A and a new binary fraction C for use during decoding of the next position in the decoded symbol string. The encoder operates according to analogous techniques to compose coded data from original data.
    • 二进制算术编码器和解码器由于改进的概率估计和适应性而提供改进的编码精度。 它们还通过“快速路径”设计提供改进的解码速度,其中对最可能符号的解码需要很少的计算步骤。 编码数据表示由更可能的符号(“MPS”)和较少的可能符号(“LPS”)填充的数据。 在一个实施例中,解码器接收编码数据的一段作为二进制分数C.它定义了C的可能值的编码间隔,C是从可变下界A延伸到恒定上限1的间隔。对于 解码符号串,解码器根据MPS或LPS发生在该位置的相对概率来计算将编码间隔分割为子间隔的测试值Z。 第一个子间隔从下限A延伸到测试值Z; 第二子区间从测试值Z延伸到1.如果C大于Z,则解码器针对解码的符号串中的当前位置发出MPS,并将下限A设置为测试变量Z以在解码期间使用 的解码符号串中的下一个位置。 如果C小于Z,则解码器发出LPS并计算新的下限A和新的二进制分数C,以便在解码的符号串中的下一个位置的解码期间使用。 编码器根据类似的技术操作以从原始数据构成编码数据。
    • 4. 发明授权
    • Simulated stone product
    • 模拟石制品
    • US5275852A
    • 1994-01-04
    • US623303
    • 1990-12-06
    • Anthony H. JonesPaul G. Howard
    • Anthony H. JonesPaul G. Howard
    • C04B14/36C04B26/02B44F9/04
    • C04B14/36C04B26/02C04B2111/542Y10T428/24405
    • A sodium chloride filler for resin-based simulated stone products is disclosed, as well as a simulated stone product including the sodium chloride filler, and a method of preparing same. The product includes a resin base, a catalyst capable of polymerizing the resin and particulate sodium chloride. Pigments and other fillers may be included to yield special aesthetic effects. The method of the invention comprises the steps of mixing a quantity of the resin with catalyst and particulate sodium chloride, and perhaps pigment and other fillers. Two sodium chloride filler particle size ranges are preferred. Finally, the mixture is transferred to a mold, the mold having been coated with a gel coat, and/or a coat of resin with an alternative filler, in preparation for receiving the mixture. A kit including the foregoing ingredients and instructions for combining same is also within the scope of the invention.
    • 公开了一种用于基于树脂的模拟石材产品的氯化钠填料,以及包括氯化钠填料的模拟石制品及其制备方法。 该产品包括树脂基料,能够使树脂聚合的催化剂和颗粒状氯化钠。 可以包括颜料和其它填料以产生特殊的美学效果。 本发明的方法包括以下步骤:将一定数量的树脂与催化剂和颗粒氯化钠混合,以及可能的颜料和其它填料。 两种氯化钠填料粒度范围是优选的。 最后,将混合物转移到模具中,模具已经涂覆有凝胶涂层,和/或具有替代填料的树脂涂层,以准备接收混合物。 包含上述成分的试剂盒和用于组合的说明书也在本发明的范围内。
    • 6. 发明授权
    • Z-coder: a fast adaptive binary arithmetic coder
    • Z编码器:快速自适应二进制算术编码器
    • US06476740B1
    • 2002-11-05
    • US10014907
    • 2001-12-14
    • Yoshua BengioLeon BottouPaul G. Howard
    • Yoshua BengioLeon BottouPaul G. Howard
    • H03M700
    • H03M7/4006
    • A binary arithmetic coder and decoder provides improved coding accuracy due to improved probability estimation and adaptation. They also provide improved decoding speed through a “fast path” design wherein decoding of a most probable symbol requires few computational steps. Coded data represents data that is populated by more probable symbols (“MPS”) and less probable symbols (“LPS”). In an embodiment, a decoder receives a segment of the coded data as a binary fraction C. It defines a coding interval of possible values of C, the interval extending from a variable lower bound A to a constant upper bound 1. For each position in the decoded symbol string, the decoder computes a test value Z that subdivides the coding interval into sub-intervals according to the relative probabilities that an MPS or an LPS occurs in the position. A first sub-interval extends from the lower bound A to the test value z; the second sub-interval extending from the test value Z to 1. If C is greater than Z, the decoder emits an MPS for the current position in the decoded symbol string and sets the lower bound A to the test variable Z for use during decoding of the next position in the decoded symbol string. If C is less than Z, the decoder emits an LPS and computes a new lower bound A and a new binary fraction C for use during decoding of the next position in the decoded symbol string. The encoder operates according to analogous techniques to compose coded data from original data.
    • 二进制算术编码器和解码器由于改进的概率估计和适应性而提供改进的编码精度。 它们还通过“快速路径”设计提供改进的解码速度,其中对最可能符号的解码需要很少的计算步骤。 编码数据表示由更可能的符号(“MPS”)和较少的可能符号(“LPS”)填充的数据。 在一个实施例中,解码器接收编码数据的一段作为二进制分数C.它定义了C的可能值的编码间隔,C是从可变下界A延伸到恒定上限1的间隔。对于 解码符号串,解码器根据MPS或LPS发生在该位置的相对概率来计算将编码间隔分割为子间隔的测试值Z。 第一个子间隔从下限A延伸到测试值z; 第二子区间从测试值Z延伸到1.如果C大于Z,则解码器针对解码的符号串中的当前位置发出MPS,并将下限A设置为测试变量Z以在解码期间使用 的解码符号串中的下一个位置。 如果C小于Z,则解码器发出LPS并计算新的下限A和新的二进制分数C,以便在解码的符号串中的下一个位置的解码期间使用。 编码器根据类似的技术操作以从原始数据构成编码数据。
    • 7. 发明授权
    • Z-coder: fast adaptive binary arithmetic coder
    • Z编码器:快速自适应二进制算术编码器
    • US06188334B1
    • 2001-02-13
    • US09565443
    • 2000-05-05
    • Yoshua BengioLeon BottouPaul G. Howard
    • Yoshua BengioLeon BottouPaul G. Howard
    • H03M700
    • H03M7/4006
    • A binary arithmetic coder and decoder provides improved coding accuracy due to improved probability estimation and adaptation. They also provide improved decoding speed through a “fast path” design wherein decoding of a most probable symbol requires few computational steps. Coded data represents data that is populated by more probable symbols (“MPS”) and less probable symbols (“LPS”). In an embodiment, a decoder receives a segment of the coded data as a binary fraction C. It defines a coding interval of possible values of C, the interval extending from a variable lower bound A to a constant upper bound 1. For each position in the decoded symbol string, the decoder computes a test value Z that subdivides the coding interval into sub-intervals according to the relative probabilities that an MPS or an LPS occurs in the position. A first sub-interval extends from the lower bound A to the test value Z; the second sub-interval extending from the test value Z to 1. If C is greater than Z, the decoder emits an MPS for the current position in the decoded symbol string and sets the lower bound A to the test variable Z for use during decoding of the next position in the decoded symbol string. If C is less than Z, the decoder emits an LPS and computes a new lower bound A and a new binary fraction C for use during decoding of the next position in the decoded symbol string. The encoder operates according to analogous techniques to compose coded data from original data.
    • 二进制算术编码器和解码器由于改进的概率估计和适应性而提供改进的编码精度。 它们还通过“快速路径”设计提供改进的解码速度,其中对最可能符号的解码需要很少的计算步骤。 编码数据表示由更可能的符号(“MPS”)和较少的可能符号(“LPS”)填充的数据。 在一个实施例中,解码器接收编码数据的一段作为二进制分数C.它定义了C的可能值的编码间隔,C是从可变下界A延伸到恒定上限1的间隔。对于 解码符号串,解码器根据MPS或LPS发生在该位置的相对概率来计算将编码间隔分割为子间隔的测试值Z。 第一个子间隔从下限A延伸到测试值Z; 第二子区间从测试值Z延伸到1.如果C大于Z,则解码器针对解码的符号串中的当前位置发出MPS,并将下限A设置为测试变量Z以在解码期间使用 的解码符号串中的下一个位置。 如果C小于Z,则解码器发出LPS并计算新的下限A和新的二进制分数C,以便在解码的符号串中的下一个位置的解码期间使用。 编码器根据类似的技术操作以从原始数据构成编码数据。