会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 32. 发明授权
    • Dynamic test coverage
    • 动态测试覆盖
    • US08381184B2
    • 2013-02-19
    • US12202464
    • 2008-09-02
    • Sandra K. JohnsonSharad MishraJoan L. MitchellAnil Kumar ThiramdasDavid Ward
    • Sandra K. JohnsonSharad MishraJoan L. MitchellAnil Kumar ThiramdasDavid Ward
    • G06F9/44
    • G06F11/3676
    • Dynamic test coverage to evaluate an artifact code is provided. Code of an artifact to be tested is identified. The code coverage of the test code is analyzed. The current coverage information is stored. Code coverage information for one or more prior versions of the test code is retrieved. The current coverage information is compared with the prior coverage information. Responsive to a determination that a difference between the current coverage information and the prior coverage information exists, the difference is collected. Responsive to a determination that test cases are to be generated automatically, generating, automatically, new test cases based on the difference. The new test cases are stored. Code coverage of the test code is analyzed based on the new test case. The new coverage information is stored. The new coverage information is sent to the user.
    • 提供动态测试覆盖以评估工件代码。 确定要测试的工件的代码。 分析测试代码的代码覆盖率。 当前覆盖信息被存储。 检索一个或多个先前版本的测试代码的代码覆盖率信息。 将当前的覆盖信息与先前的覆盖信息进行比较。 响应于确定当前覆盖信息和先前覆盖信息之间的差异的确定,收集差异。 响应于自动生成测试用例的确定,根据差异自动生成新的测试用例。 新的测试用例被存储。 基于新的测试用例分析测试代码的代码覆盖率。 新的覆盖信息被存储。 新的覆盖信息被发送给用户。
    • 36. 发明授权
    • Automatic capture of associations between content within a content framework system
    • 自动捕获内容框架系统内的内容之间的关联
    • US07310643B2
    • 2007-12-18
    • US11043530
    • 2005-01-25
    • Grant D. MillerJoan L. Mitchell
    • Grant D. MillerJoan L. Mitchell
    • G06F17/30G06F7/00
    • G06F17/30011Y10S707/99942Y10S707/99943Y10S707/99945
    • A content framework system and method. The content framework system comprises a content infrastructure, a content flow management system, and a content association system. The content infrastructure comprises content management systems. Each of the content management systems comprises content. The content flow management system comprises an acquisition tool comprising an agent tool. The content flow management system controls a flow of each of the content within and between each of the content management systems. The acquisition tool provides an interface between the content flow management system and the content infrastructure. The content association system generates a first set of associations metadata comprising a first set of links for linking the content management systems together. The agent tool monitors the content from each of the content management systems and adding to a registry, a description of the content from each of the content management systems based on the monitoring.
    • 内容框架系统和方法。 内容框架系统包括内容基础设施,内容流管理系统和内容关联系统。 内容基础设施包括内容管理系统。 每个内容管理系统包括内容。 内容流管理系统包括包括代理工具的获取工具。 内容流管理系统控制每个内容管理系统之内和之中每个内容的流程。 采集工具提供内容流管理系统和内容基础设施之间的接口。 内容关联系统生成第一组关联元数据,其包括用于将内容管理系统链接在一起的第一组链接。 代理工具监视来自每个内容管理系统的内容,并且基于监视向每个内容管理系统添加对注册表的内容的描述。
    • 37. 发明授权
    • Enhancing compression while transcoding JPEG images
    • 在JPEG图像转码时增强压缩
    • US07260265B2
    • 2007-08-21
    • US10263653
    • 2002-10-04
    • Ravi PrakashJoan L. Mitchell
    • Ravi PrakashJoan L. Mitchell
    • G06K9/36G06K9/46
    • G06T9/007
    • Further compression of data allowing economical storage of data for extended periods of time in high-speed access memory is performed in reduced time by performing further compression during transcoding in the transform domain and without restoring image data to its original image data form. The reduction in processing time is achieved by exploiting the large number of zero-valued quantization transform coefficients and not changing quantized transform coefficients at zig-zag scan positions where non-zero coefficients are rare during range reduction of the entropy decoded quantized transformed data. The range can be restored by computation or estimation of an altered quantization table which is stored with the further compressed a quantization values. Further advantages accrue from use of JPEG packed format for the data during transcoding.
    • 通过在变换域中的代码转换期间执行进一步的压缩,并且不将图像数据恢复到其原始图像数据形式,可以在缩短的时间内执行进一步压缩数据以允许在高速存取存储器中长时间地经济地存储数据。 处理时间的缩短通过利用大量的零值量化变换系数来实现,并且在熵解码的量化变换数据的范围缩小期间不改变非零系数是罕见的Z字形扫描位置处不改变量化变换系数来实现。 可以通过计算或估计与进一步压缩的量化值一起存储的改变的量化表来恢复该范围。 在转码过程中,使用JPEG压缩格式为数据提供了进一步的优势。
    • 38. 发明授权
    • Hybrid domain processing of multi-dimensional transformed data
    • 混合域处理多维变换数据
    • US06675185B1
    • 2004-01-06
    • US09588477
    • 2000-06-07
    • Joan L. MitchellMarco MartensTimothy J. Trenary
    • Joan L. MitchellMarco MartensTimothy J. Trenary
    • G06F1714
    • G06F17/147
    • A one-dimensional (1D) Inverse Discrete Cosine Transform (IDCT) is applied to an input two-dimensional (2D) transform block along the axis to be modified. Since the one-dimensional IDCT is not performed on the other axis, each block is left in a one-dimensional transform space (called hybrid space). For a shift (merge), the appropriate “m” elements are picked up from one block and the “8−m” elements are picked up from the other block and are used as input to the one-dimensional forward DCT (FDCT) along that same axis. For two-dimensional shifts or merges, the results of the first one-dimensional IDCT and FDCT can be stored with extra precision to be used as input to a second one-dimensional IDCT and FDCT along the other axis. The execution time worst case conditions are approximately constant for all shift/merger amounts. Taking advantage of fast paths can improve the execution times for typical blocks.
    • 沿着要修改的轴将一维(1D)逆离散余弦变换(IDCT)应用于输入二维(2D)变换块。 由于不在另一轴上执行一维IDCT,所以每个块留在一维变换空间中(称为混合空间)。 对于移位(合并),从一个块中拾取适当的“m”个元素,并从另一个块中拾取“8-m”个元素,并将其用作一维前向DCT(FDCT)的输入 同一轴。 对于二维移位或合并,可以以额外的精度存储第一个一维IDCT和FDCT的结果,作为沿着另一轴的第二个一维IDCT和FDCT的输入。 所有转移/合并金额的执行时间最差情况条件近似恒定。 利用快速路径可以提高典型块的执行时间。
    • 40. 发明授权
    • Probability adaptation for arithmetic coders
    • 算术编码器的概率适应
    • US5099440A
    • 1992-03-24
    • US461210
    • 1990-01-05
    • William B. PennebakerJoan L. Mitchell
    • William B. PennebakerJoan L. Mitchell
    • H03M7/40
    • H03M7/4006
    • The present invention relates to computer apparatus and methodology for adapting the value of a probability of the occurrence of a first of two binary symbols which includes (a) maintaining a count of the number k of occurrences of the first symbol; (b) maintaining a total count of the number n of occurrences of all symbols; (c) selecting confidence limits for the probability; and (d) when the probability is outside the confidence limits, effectuating a revision in the value of the probability directed toward restoring confidence in the probability value. The number of allowed probabilities is, optionally, less than the total number of possible probabilities given the probability precision. Moreover, an approximation is employed which limits the number of probabilities to which a current probability can be changed, thereby enabling the probability adaptation to be implemented as a deterministic finite state machine.
    • 本发明涉及用于调整两个二进制符号中的第一个符号的出现概率的值的计算机装置和方法,其包括(a)维持第一符号的出现次数k的计数; (b)维持所有符号出现次数n的总计数; (c)选择概率的置信限; 和(d)当概率超出置信限度时,对针对恢复概率值置信度的概率值进行修正。 可允许概率的数量可选地小于给定概率精度的可能概率的总数。 此外,采用近似来限制可以改变当前概率的概率的数目,从而使概率适配能够被实现为确定性的有限状态机。