Method, system, and program product for generating a virtual database
    1.
    发明授权
    Method, system, and program product for generating a virtual database 有权
    用于生成虚拟数据库的方法,系统和程序产品

    公开(公告)号:US07849114B2

    公开(公告)日:2010-12-07

    申请号:US11424938

    申请日:2006-06-19

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30566

    摘要: The present invention provides a virtual database as well as a method, system, and program product for generating a virtual database. Specifically, under the present invention, Service Data Objects (SDOs) corresponding to a plurality of database tables are provided within a virtual container. Once provided, two or more of the SDOs are interrelated to yield the virtual database (having a Virtual Bounded Persistent Memory). In accordance with the present invention, the database tables can be stored within a single (e.g., conventional) database, or databases. In addition, the virtual database can be generated and removed on-demand. Still yet, the virtual database of the present invention can be queried using standard Structured Query Language (SQL) queries.

    摘要翻译: 本发明提供一种虚拟数据库以及用于生成虚拟数据库的方法,系统和程序产品。 具体而言,在本发明中,在虚拟容器内设置与多个数据库表对应的服务数据对象(SDO)。 一旦提供,两个或多个SDO是相互关联的,以产生虚拟数据库(具有虚拟有界持久存储器)。 根据本发明,数据库表可以存储在单个(例如,传统的)数据库或数据库中。 此外,可以根据需要生成和删除虚拟数据库。 然而,本发明的虚拟数据库可以使用标准结构化查询语言(SQL)查询来查询。

    METHOD, SYSTEM, AND PROGRAM PRODUCT FOR GENERATING A VIRTUAL DATABASE
    2.
    发明申请
    METHOD, SYSTEM, AND PROGRAM PRODUCT FOR GENERATING A VIRTUAL DATABASE 有权
    用于生成虚拟数据库的方法,系统和程序产品

    公开(公告)号:US20070294215A1

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

    申请号:US11424938

    申请日:2006-06-19

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30566

    摘要: The present invention provides a virtual database as well as a method, system, and program product for generating a virtual database. Specifically, under the present invention, Service Data Objects (SDOs) corresponding to a plurality of database tables are provided within a virtual container. Once provided, two or more of the SDOs are interrelated to yield the virtual database (having a Virtual Bounded Persistent Memory). In accordance with the present invention, the database tables can be stored within a single (e.g., conventional) database, or databases. In addition, the virtual database can be generated and removed on-demand. Still yet, the virtual database of the present invention can be queried using standard Structured Query Language (SQL) queries.

    摘要翻译: 本发明提供一种虚拟数据库以及用于生成虚拟数据库的方法,系统和程序产品。 具体而言,在本发明中,在虚拟容器内设置与多个数据库表对应的服务数据对象(SDO)。 一旦提供,两个或多个SDO是相互关联的,以产生虚拟数据库(具有虚拟有界持久存储器)。 根据本发明,数据库表可以存储在单个(例如,传统的)数据库或数据库中。 此外,可以根据需要生成和删除虚拟数据库。 然而,本发明的虚拟数据库可以使用标准结构化查询语言(SQL)查询来查询。

    Particulate Matter Generator For Use With An Emissions Control Device Aging System
    4.
    发明申请
    Particulate Matter Generator For Use With An Emissions Control Device Aging System 有权
    用于排放控制装置老化系统的颗粒物发电机

    公开(公告)号:US20120252130A1

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

    申请号:US13076621

    申请日:2011-03-31

    IPC分类号: G01N1/28

    摘要: A particulate matter generator implemented as a “mini-burner”, and used in conjunction with a larger test system for the specific purpose of enhancing the particulate matter content of exhaust gas. The exhaust stream of the larger system is supplemented with exhaust from the mini-burner to produce exhaust with desired particulate matter characteristics. The exhaust gas may then be used for various test purposes, such as testing emissions control devices.

    摘要翻译: 实现为微型燃烧器的颗粒物质发生器,并且与用于增强废气的颗粒物质含量的特定目的的较大测试系统结合使用。 较大系统的排气流补充有来自微型燃烧器的废气以产生具有所需颗粒物特性的排气。 废气可以用于各种测试目的,例如测试排放控制装置。

    Bevel locking system for a sliding compound miter saw
    6.
    发明授权
    Bevel locking system for a sliding compound miter saw 失效
    用于滑动复合斜切锯的斜角锁定系统

    公开(公告)号:US06823765B2

    公开(公告)日:2004-11-30

    申请号:US10302687

    申请日:2002-11-22

    IPC分类号: B27D529

    摘要: A compound miter saw includes a table on which a workpiece is placed, a miter saw unit supporting a saw blade, and a housing pivotally supporting the miter saw unit related to the table in such a manner that the miter saw unit is at least laterally pivotable. Further, the miter saw includes a bevel mechanism for selectively determining the lateral position of the miter saw unit at any of a plurality of pivoted positions, including a vertical position where the saw blade is positioned substantially vertically relative to the table, and leftward and rightward pivoted positions where the blade is inclined laterally leftwardly and laterally rightwardly from the vertical position. The bevel mechanism includes a movable rod and three fixed stop members, the rod being operable to move between a first rod position abutting one of the fixed stop members and a second rod position not abutting the one of the fixed stop members so as to permit the lateral pivotal movement of the miter saw unit. The first fixed stop member is disposed so that the rod abuts the first fixed stop member when the miter saw unit is at the vertical position. Similarly, the second fixed stop member is disposed so that the rod abuts the second fixed stop member when the miter saw unit is leftwardly pivoted at a first predetermined angle from the vertical position. Further, the third fixed stop member is disposed so that the rod abuts the third fixed stop member when the miter saw unit is rightwardly pivoted at a second predetermined angle from the vertical position.

    摘要翻译: 复合斜切锯包括其上放置有工件的工作台,支撑锯片的斜切锯单元和以与斜面相关的斜切锯单元枢转地支撑的壳体,使得斜切锯单元至少可横向枢转 。 此外,斜切锯包括斜面机构,用于选择性地确定斜切锯单元在多个枢转位置中的任一个处的横向位置,包括垂直位置,其中锯片相对于工作台基本垂直地定位,以及向左和向右 枢转位置,其中叶片从垂直位置横向向左和向右横向倾斜。 所述斜面机构包括可动杆和三个固定止动构件,所述杆可操作以在抵靠所述固定止动构件中的一个的第一杆位置与不邻接所述固定止动构件之一之间的第二杆位置之间移动, 斜切锯单元的侧向枢转运动。 第一固定止动构件设置成当斜切锯单元处于垂直位置时,杆抵靠第一固定止动构件。 类似地,第二固定止动构件设置成当斜切单元从垂直位置以第一预定角度向左枢转时,杆抵靠第二固定止动构件。 此外,第三固定止动构件设置成当斜切单元从垂直位置以第二预定角度向右枢转时,杆抵靠第三固定止动构件。

    Method and system for incrementally improving a program layout
    7.
    发明授权
    Method and system for incrementally improving a program layout 失效
    逐步改进程序布局的方法和系统

    公开(公告)号:US06381740B1

    公开(公告)日:2002-04-30

    申请号:US08931151

    申请日:1997-09-16

    IPC分类号: G06F900

    CPC分类号: G06F8/445

    摘要: A method and system for incrementally improving the layout of a program image of a computer program to reduce the working set. The system iteratively selects pairs of basic blocks and reorders the basic blocks in the range delimited by the selected pair of basic blocks. The system selects the pairs of basic blocks so that the working set of the computer program is improved by reordering the basic block in the range. Thus, during each iteration, the working set is improved. The system continues with these iterations until a termination condition (e.g., number of iterations) is satisfied. In one embodiment, during each iteration the system designates one of the basic blocks as an initial anchor basic block. The system then repeats the following until the same range of basic blocks is identified twice in a row. The system first finds a basic block such that when the basic blocks in the range from the anchor basic block to the found basic block are reordered, the working set is more favorable than reordering any other range that ends with the anchor basic block. The system then designates the found basic block as the new anchor basic block. When the same range is found twice in a row, the system reorders the basic blocks in the range. This process is repeated for each iteration until a termination condition is satisfied. The resulting reordered program image has its working set improved.

    摘要翻译: 一种用于逐步改进计算机程序的程序图像的布局以减少工作集合的方法和系统。 系统迭代地选择一对基本块,并且在由所选择的一对基本块分隔的范围内重新排序基本块。 系统选择基本块对,通过重新排序该范围内的基本块来提高计算机程序的工作集。 因此,在每次迭代期间,改进了工作集。 系统继续进行这些迭代,直到满足终止条件(例如,迭代次数)为止。 在一个实施例中,在每次迭代期间,系统将基本块中的一个指定为初始锚基本块。 然后,系统重复以下操作,直到相同范围的基本块被连续两次识别。 系统首先找到一个基本块,使得当从锚基本块到找到的基本块的范围内的基本块被重新排序时,工作集比重新排序以锚基本块结束的任何其他范围更有利。 然后,系统将找到的基本块指定为新的锚基本块。 当连续两次找到相同的范围时,系统重新排列范围内的基本块。 对于每个迭代重复该过程,直到满足终止条件。 所产生的重新排序的程序图像的工作集改进了。

    Computer implemented methods for constructing a compressed data
structure from a data string and for using the data structure to find
data patterns in the data string
    8.
    发明授权
    Computer implemented methods for constructing a compressed data structure from a data string and for using the data structure to find data patterns in the data string 失效
    用于从数据串构造压缩数据结构并使用数据结构来查找数据串中的数据模式的计算机实现的方法

    公开(公告)号:US6119120A

    公开(公告)日:2000-09-12

    申请号:US673427

    申请日:1996-06-28

    申请人: John W. Miller

    发明人: John W. Miller

    IPC分类号: G06F7/02 G06F17/30

    摘要: A method for constructing a data structure for a data string of characters includes producing a matrix of sorted rotations of the data string. This matrix defines an A array which is a sorted list of the characters in the data string, a B array which is a permutation of the data string, and a correspondence array C which contains correspondence entries linking the characters in the A array to the same characters in the B array. A reduced A' array is computed to identify each unique character in the A array and a reduced C' array is computed to contain every s.sup.th entry of the C array. The B array is segmented into blocks of size s. During a search, the A' and C' arrays are used to index the B array to reconstruct any desired row from the matrix of rotations. Through this representation, the matrix of rotations can thus be used as a conventional sorted list for pattern matching or information retrieval applications. A data structure containing only the A', B, and C' has very little memory overhead. The B array contains the same number of characters as the original data string, and can be compressed in a block wise manner to reduce its size. The A' array is a fixed size equal to the size of the alphabet used to construct the data string, and the C' array is variable size according to the relationship n/s, where n is the number of characters in the data string and s is the size of the blocks of the B array. Accordingly, the data structure enables a tradeoff between access speed and memory overhead, the product of which is constant with respect to block size s.

    摘要翻译: 用于构造字符数据串的数据结构的方法包括产生数据串的排序旋转的矩阵。 该矩阵定义了A数组,其是数据串中的字符的排序列表,作为数据串的排列的B数组,以及对应数组C,其包含将A阵列中的字符链接到相同的对应项 B数组中的字符。 计算一个缩减的A'数组以识别A数组中的每个唯一字符,并且计算一个减少的C'数组以包含C数组的每个sth条目。 B阵列被分割成大小为s的块。 在搜索期间,A'和C'数组用于对B数组进行索引以从旋转矩阵中重构任何所需的行。 通过这种表示,旋转矩阵因此可以用作用于模式匹配或信息检索应用的常规排序列表。 仅包含A',B和C'的数据结构具有非常少的内存开销。 B数组包含与原始数据串相同数量的字符,并且可以以块方式压缩以减小其大小。 A'数组是一个等于构造数据字符串的字母大小的固定大小,C'数组根据关系n / s可变大小,其中n是数据字符串中的字符数, s是B数组的块的大小。 因此,数据结构使得访问速度和存储器开销之间的折衷,其乘积相对于块大小s是恒定的。

    Word prediction system
    10.
    发明授权
    Word prediction system 失效
    词预测系统

    公开(公告)号:US5805911A

    公开(公告)日:1998-09-08

    申请号:US382074

    申请日:1995-02-01

    申请人: John W. Miller

    发明人: John W. Miller

    IPC分类号: G06F17/27 G06F15/00

    CPC分类号: G06F17/276

    摘要: A computer-implemented method of providing and selecting multiple text prediction from text entered from multiple windows of a computer system using an application-independent text prediction system. Application-independence is the ability to work with many different applications without being customized for each applications. Because different prediction methods are appropriate for different applications, multiple prediction components called "prediction modules" provide text predictions based on each prediction module's prediction method from which the best prediction may be displayed. The best prediction from the results of the multiple methods may be displayed. In accordance with providing multiple predictions from various modules, a method is provided for choosing which modules' predictions should be used from the set of possibly contradictory predictions. Each prediction module produces a weighted list of predictions. The prediction module weights are based on the prediction modules' estimation of the probability that the completion text will be entered by the user. The resulting best prediction or predictions with the greatest weights may then be presented to the user.

    摘要翻译: 一种计算机实现的方法,其使用与应用无关的文本预测系统从计算机系统的多个窗口输入的文本提供和选择多个文本预测。 应用程序独立性是在不为每个应用程序定制的情况下处理许多不同应用程序的能力。 由于不同的预测方法适用于不同的应用,所以称为“预测模块”的多个预测组件基于每个预测模块的预测方法提供文本预测,从该预测方法可以显示最佳预测。 可以显示来自多种方法的结果的最佳预测。 根据提供来自各种模块的多个预测,提供了一种用于从可能相互矛盾的预测集中选择哪些模块的预测应用的方法。 每个预测模块产生加权预测列表。 预测模块权重基于预测模块对用户输入完成文本的概率的估计。 然后可以向用户呈现所得到的具有最大权重的最佳预测或预测。