摘要:
A method for determining a user intended number from a partial phone number includes steps for receiving a partial phone number, determining whether the partial phone number corresponds with at least one database number based on at least one selected criteria list and performing a system action based on the determination. The method may include prioritizing a list of database numbers that correspond to the partial number.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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.
摘要:
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 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.
摘要:
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.