Custodian suggestion for efficient legal e-discovery
    11.
    发明授权
    Custodian suggestion for efficient legal e-discovery 有权
    托管人建议有效的合法电子发现

    公开(公告)号:US08832126B2

    公开(公告)日:2014-09-09

    申请号:US13220013

    申请日:2011-08-29

    CPC classification number: G06Q10/10 G06F17/30011 G06Q50/18

    Abstract: Given a set of documents relevant to a litigation hold and a seed set of custodians, a second set of custodians can be generated and suggested to a user. After receiving a seed set of keywords and/or custodians, documents are identified based on their relevance. Relevant documents are searched for custodian names, and appropriate custodian names are presented to a user. Additionally, based on a first set of custodians, a suggested set of custodians can be provided to a user based on relationships between the sets of custodians.

    Abstract translation: 鉴于一系列与诉讼保持有关的文件和种子保管人,可以向用户生成并建议第二组保管人。 在收到关键字和/或保管人的种子后,根据其相关性来识别文件。 搜索相关文件的保管人姓名,并向用户显示适当的保管人姓名。 另外,根据第一套保管人,可以根据保管人组之间的关系向用户提供一组建议的保管人。

    Query suggestion for efficient legal E-discovery
    12.
    发明授权
    Query suggestion for efficient legal E-discovery 有权
    查询有效合法电子发现的建议

    公开(公告)号:US08583669B2

    公开(公告)日:2013-11-12

    申请号:US13219869

    申请日:2011-08-29

    Applicant: Shailesh Kumar

    Inventor: Shailesh Kumar

    CPC classification number: G06F17/3064

    Abstract: Given a set of training documents relevant to a litigation hold, properties common to the documents relevant to the case and not common or missing in the non-relevant documents can be identified and used to generate a litigation hold query to be suggested to a user. After receiving a training set of documents, one or more common properties between the relevant training documents are identified. Based on the common properties, a suggested litigation hold query can be generated to return documents in a larger set that are representative of the relevant documents in the training set. Additionally, a query can be generated by iteratively improving a base query to return documents sharing characteristics of a training set of documents. Suggested queries may evolve as the training set evolves.

    Abstract translation: 鉴于与诉讼保持有关的一套培训文件,可以识别与非相关文件相关的文件相关文件与常见或不相关的文件共有的属性,并用于生成向用户建议的诉讼保留查询。 在收到一套文件后,确定了相关培训文件之间的一个或多个常见属性。 根据共同属性,可以生成建议的诉讼保留查询,以返回代表培训集中相关文档的较大集合中的文档。 此外,可以通过迭代地改进基本查询以返回共享文档训练集的特征的文档来生成查询。 建议的查询可能随培训集演变而发展。

    Signature Detection in E-Mails
    13.
    发明申请
    Signature Detection in E-Mails 审中-公开
    电子邮件中的签名检测

    公开(公告)号:US20120254166A1

    公开(公告)日:2012-10-04

    申请号:US13219864

    申请日:2011-08-29

    CPC classification number: G06Q10/107 G06F16/353

    Abstract: In an electronic discovery search tool, non-substantive information, such as signatures in e-mail, can bias a search tool and add processing time. A method and system for identifying recurring non-substantive text in documents has been developed so that non-substantive text may be processed or ignored by the search tool, as needed.

    Abstract translation: 在电子发现搜索工具中,非实质性信息(例如电子邮件中的签名)可能偏向搜索工具并添加处理时间。 已经开发了一种在文件中识别重复的非实质性文本的方法和系统,以便根据需要,搜索工具可以处理或忽略非实质文本。

    BOND PAD FOR SEMICONDUCTOR DIE
    14.
    发明申请

    公开(公告)号:US20120049389A1

    公开(公告)日:2012-03-01

    申请号:US12874204

    申请日:2010-09-01

    Abstract: A semiconductor die has rows of bond pads along the edges of a major surface. The corners of the die are designated as keep out areas, with design layout rules prohibiting a probe-able bond pad from being placed in the keep out areas so that a minimum distance may be maintained between distal ends of adjacent rows of bond pads (i.e., bond pads along adjacent edges). The bond pads of each row have IO pad areas that are aligned with each other and IO probe areas that are aligned with each other. A generally L-shaped bond pad includes a first, vertical part that extends inwardly from an edge of the semiconductor die and a second, horizontal part connected to the vertical part. The L-shaped bond pad may be placed between a last bond pad in a row and a corner keep out area, and the second part of the L-shaped bond pad extends into the corner keep out area. The first part has an IO pad area that is in alignment with the IO pad areas of the other bond pads in the same row, and the second part has an IO probe area that is in alignment with the IO probe areas of the bond pads in the adjacent row. The L-shaped bond pad does not violate design rules even though a part of the pad extends into the corner keep out area.

    Abstract translation: 半导体管芯沿着主表面的边缘具有一排接合焊盘。 模具的角被指定为保留区域,其设计布局规则禁止可探测的焊盘放置在保留区域中,使得可以在相邻排的焊盘的末端之间保持最小距离(即 ,沿着相邻边缘的接合垫)。 每行的接合焊盘具有彼此对准的IO焊盘区域和彼此对准的IO探针区域。 大致L形接合焊盘包括从半导体管芯的边缘向内延伸的第一垂直部分和连接到垂直部分的第二水平部分。 L形接合焊盘可以放置在一行中的最后接合焊盘和拐角保持区域之间,并且L形接合焊盘的第二部分延伸到角落保持区域中。 第一部分具有与同一行中的其它接合焊盘的IO焊盘区域对准的IO焊盘区域,并且第二部分具有与焊盘的IO探针区域对准的IO探针区域 相邻行。 即使垫的一部分延伸到角落保持区域,L形接合垫也不违反设计规则。

    Method for verification of file-based media content
    15.
    发明授权
    Method for verification of file-based media content 失效
    验证基于文件的媒体内容的方法

    公开(公告)号:US08001486B2

    公开(公告)日:2011-08-16

    申请号:US11807546

    申请日:2007-05-29

    CPC classification number: H04N7/24 H04N21/23418

    Abstract: A method for automatically verifying one or more features of file-based media content (108) is disclosed. This file-based media content includes one or more media content files. The method includes customizing (204) a test plan on the basis of the one or more features. Customizing the test plan includes creating, modifying or utilizing at least one media content check of one or more media content checks. A media content check verifies at least one feature of the one or more features of the file-based media content. Further, the method includes verifying (206) the one or more features, based on the customized test plan. The method also includes documenting (208) the results obtained from the verification of the one or more features.

    Abstract translation: 公开了一种用于自动验证基于文件的媒体内容(108)的一个或多个特征的方法。 该基于文件的媒体内容包括一个或多个媒体内容文件。 该方法包括基于一个或多个特征定制(204)测试计划。 定制测试计划包括创建,修改或利用对一个或多个媒体内容检查的至少一个媒体内容检查。 媒体内容检查验证基于文件的媒体内容的一个或多个特征的至少一个特征。 此外,该方法包括基于定制的测试计划来验证(206)一个或多个特征。 该方法还包括记录(208)从一个或多个特征的验证获得的结果。

    Method and system for calculating interlace artifact in motion pictures
    16.
    发明申请
    Method and system for calculating interlace artifact in motion pictures 失效
    用于计算运动图像中的交错伪影的方法和系统

    公开(公告)号:US20100085475A1

    公开(公告)日:2010-04-08

    申请号:US12286798

    申请日:2008-10-02

    CPC classification number: H04N17/00 H04N5/142 H04N5/145

    Abstract: A method and system for calculating an interlace artifact in image data are disclosed. A motion picture of the image data comprises a series of frames, captured at a predefined interval of time. During processing of the motion picture, the frames are divided into fields, each field comprising one or more pixels. A difference between the pixels of the fields is calculated. Thereafter, edges of the pixels are calculated in the fields. The method and system then identify the focused area in the fields. To calculate the interlace artifact in the motion picture, the displacement of the focused area is calculated by using motion vectors. The artifacts are calculated as a ratio of a number of pixels based on motion vector calculation.

    Abstract translation: 公开了一种用于计算图像数据中的隔行伪影的方法和系统。 图像数据的运动图像包括以预定的时间间隔捕获的一系列帧。 在运动图像的处理期间,帧被分成场,每个场包括一个或多个像素。 计算场的像素之间的差异。 此后,在场中计算像素的边缘。 然后,该方法和系统确定了该领域的重点领域。 为了计算运动图像中的交错伪影,通过使用运动矢量来计算聚焦区域的位移。 伪像被计算为基于运动矢量计算的像素数的比率。

    Purchase Sequence Browser
    17.
    发明申请
    Purchase Sequence Browser 有权
    采购序列浏览器

    公开(公告)号:US20070282699A1

    公开(公告)日:2007-12-06

    申请号:US11551683

    申请日:2006-10-20

    Abstract: The invention provides a purchase sequence browser (PuSB), i.e. a graphical user interface (GUI) that facilitates insight discovery and exploration of product affinities across time, generated by a purchase sequence analysis of a retailer's transaction data. A purchase sequence browser allows the user to browse the most significant product phrases discovered by an exhaustive search of the product affinities across time; explore the retail grammar to create both forward and backward phrase trees or alternate purchase paths starting from, or ending in, a product; generate consistent purchase sequences given some constraints on the products and their order; and profile the value of a product across time with regard to other products fixed in time.

    Abstract translation: 本发明提供了购买序列浏览器(PuSB),即图形用户界面(GUI),其通过零售商的交易数据的购买序列分析产生的促进对时间的产品亲和力的洞察发现和探索。 购买序列浏览器允许用户浏览通过对产品亲和力的详尽搜索发现的最重要的产品短语; 探索零售语法,从产品开始或结束时创建向前和向后的短语树或替代购买路径; 产生一致的采购顺序,给产品及其顺序带来一些限制; 并对与其他产品及时相关的产品的价值进行分析。

    Recursive on-line wavelet data compression technique for use in data storage and communications
    18.
    发明授权
    Recursive on-line wavelet data compression technique for use in data storage and communications 失效
    递归在线小波数据压缩技术用于数据存储和通信

    公开(公告)号:US06215907B1

    公开(公告)日:2001-04-10

    申请号:US09105950

    申请日:1998-06-26

    CPC classification number: H03M7/30 H04N19/124 H04N19/63 H04N19/96

    Abstract: A recursive on-line wavelet data compression technique which may be used in, for example, a process control network, compresses a stream of data points on-line or in real-time (e.g., as the data arrives or is generated) without requiring the storage of a large amount of uncompressed data. The data compression system includes a data receiver that receives the data points in a sequential manner and a compression tree computation device that determines approximation coefficients and detail coefficients of a multi-layer wavelet compression tree from the received data points. The compression tree computation device determines all of the coefficients of the higher level layers of the compression tree that can be determined after the data receiver receives each of the data points to thereby perform on-line or real-time data compression. A memory stores the determined approximation coefficients of the compression tree, a comparator compares the determined detail coefficient magnitudes or other error measurements to one or more thresholds to determine if construction of the compression tree should be halted and a compression data generator selects a subset of the determined coefficients to create a set of compressed data corresponding to the received data points when the comparator determines that construction of the compression tree should be halted.

    Abstract translation: 可以在例如过程控制网络中使用的递归在线小波数据压缩技术在线或实时地压缩数据流流(例如,随着数据到达或被产生)而不需要 存储大量的未压缩数据。 数据压缩系统包括以顺序方式接收数据点的数据接收器和从所接收的数据点确定多层小波压缩树的近似系数和细节系数的压缩树计算装置。 压缩树计算装置确定在数据接收器接收到每个数据点之后可以确定的压缩树的较高级别的所有系数,从而执行在线或实时数据压缩。 存储器存储所确定的压缩树的近似系数,比较器将所确定的细节系数量值或其他误差测量值与一个或多个阈值进行比较,以确定是否停止压缩树的构造,并且压缩数据生成器选择 当比较器确定应该停止压缩树的构造时,确定系数以创建与所接收的数据点相对应的一组压缩数据。

Patent Agency Ranking