Abstract: A database system that can synchronize all or a part of its contents over a limited bandwidth link is described. The lowest layer of the system, the bedrock layer, implements a transactional block store. On top of this is a B+-tree that can efficiently compute a digest (hash) of the records within any range of key values in O(log n) time. The top level is a communication protocol that directs the synchronization process such that minimization of bits communicated, rounds of communication, and local computation are simultaneously addressed.

Abstract: An improved multistage intelligent database search method includes (1) a prefilter that uses a precomputed index to compute a list of most “promising” records that serves as input to the original multistage search method, resulting in dramatically faster response time; (2) a revised polygraph weighting scheme correcting an erroneous weighting scheme in the original method; (3) a method for providing visualization of character matching strength to users using the bipartite graphs computed by the multistage method; (4) a technique for complementing direct search of textual data with search of a phonetic version of the same data, in such a way that the results can be combined; and (5) several smaller improvements that further refine search quality, deal more effectively with multilingual data and Asian character sets, and make the multistage method a practical and more efficient technique for searching document repositories.

Abstract: An improved multistage intelligent database search method includes (1) a prefilter that uses a precomputed index to compute a list of most “promising” records that serves as input to the original multistage search method, resulting in dramatically faster response time; (2) a revised polygraph weighting scheme correcting an erroneous weighting scheme in the original method; (3) a method for providing visualization of character matching strength to users using the bipartite graphs computed by the multistage method; (4) a technique for complementing direct search of textual data with search of a phonetic version of the same data, in such a way that the results can be combined; and (5) several smaller improvements that further refine search quality, deal more effectively with multilingual data and Asian character sets, and make the multistage method a practical and more efficient technique for searching document repositories.

Abstract: A database system that can synchronize all or a part of its contents over a limited bandwidth link is described. The lowest layer of the system, the bedrock layer, implements a transactional block store. On top of this is a B+-tree that can efficiently compute a digest (hash) of the records within any range of key values in O(log n) time. The top level is a communication protocol that directs the synchronization process such that minimization of bits communicated, rounds of communication, and local computation are simultaneously addressed.

Abstract: Edit distance costs or similarity of two data strings is optimized, or the costs are minimized, based upon a learning algorithm using examples of similar strings, i.e. learning data. In this manner, the costs are learned rather than being a predetermined fixed or engineered table of entries.

Abstract: A multistage database search method includes a first stage that only considers textual polygraphic frequencies and a second stage that considers the location of the polygraphs and coarsely approximates the proper alignment between the query and the database strings and a third stage that provides a better approximation of the alignment. The final output is a listing of suggested database records ranked by their similarity to the query.

Abstract: A computer technique for bipartite matching of objects of one subset with objects of a different subset where multiple choices are permitted. A bipartite graph is formed in which the objects form nodes and the edges connecting pairs of nodes represent costs of matching the nodes connected. The original tour or graph is decomposed into a plurality of quasi-convex subtours or subgraphs and the minimum cost match of each subtour is found and the union of all such matches of the subtours is used as the desired match.

Abstract: A pattern recognition method uses unsupervised metric learning starting from a mixture of normal densities which explains well observed data. An improved decision rule is provided for selecting the reference database element most likely to correspond to a query.

Abstract: A queryless, multimedia database search method incorporating a Bayesian inference engine that refines its answer with each user response. The set of user responses includes of a series of displays and user actions, and is defined by a relatively simple user interface.

Abstract: A location technique in an electronic encyclopedia for presenting relevant articles in response to a user input of a query term. The technique employs a user controlled hierarchy of filter parameters. The user selects a subset of the identifying parameters into which all articles are classified; each article being classified into at least one identifying parameter. There are 107 parameters disclosed. The encyclopedia automatically locates each article that employs the input or query term in each of the parameters selected by the user.The 107 identifying parameters are divided into four Groups. The articles presented to the user are only those articles which are common to each of tex up to four Groups into which the user selected parameters are divided.An optimally useful set of articles is provided to the user. By a combination of the union of the articles within the user selected parameters within each of the Groups together with the intersection of the articles between Groups.

Abstract: An improvement in a electronic crossword puzzle solving machine to provide alternate words for a word that is input on the keyboard. A first actuation of a function key labeled "Second-Guess" initiates a search in which all words in memory having the same number of letters as the input word but differing with respect to only one of those letters is displayed. A second actuation of the "Second-Guess" key results in a search and display of all words differing from the input word with respect to two of the letters. Each successive actuation of the "Second-Guess" key increases the number of letters by which the alternate words found differ from the input word.

Abstract: A text is encoded as a file in electronic memory for reading and search purposes. A lexicon-file is established in which each term that can searched is incorporated. A text-file is established in which non-search terms are directly encoded and in which all of the search terms (that is all of the terms in the lexicon-file) are designated by linking numbers. The linking numbers link through each incidence of the lexicon word as a text word and finally link back to the same lexicon word in the lexicon-file and then from the lexicon-file back to the text-file. In this fashion, by using numbers to link through each incidence of a lexicon word in the text-file and the encoded lexicon word in the lexicon-file, the word is encoded in memory only once and all other entries for the word are in terms of linking numbers.

Abstract: Individual character templates for an alphanumeric display are provided. Each individual character template includes an M row by N column pixel matrix. The M row by N column pixel matrix provides MN pixels. Each of the N columns has a generally vertical shallow "S" shaped format. The pixels along the center rows of the pixel matrix are substantially square and the pixels along the upper and lower rows of the pixel matrix have corners that define a parallelogram and vertical edges that are curved. The template is energized using an electrode trace arrangement which has a plurality of horizontal traces and a plurality of approximately vertical sinuous traces. A segment of each of the vertical tracks within any character template has a shallow "S" shaped form. The first and second columnar trace segments in any given character template is connected to the next to last and last columnar trace segments of the preceding character template and the next lowest row.

Abstract: A color video generator for use with a digital computer and a color video display. The computer produces digital data signals, each of which is composed of plural bits which represent a color to be produced. The color video generator produces a color in a portion of the display in response to receipt of an associated one of the first data signals. The color is preselectable. The video generation means operates on a color subcarrier signal composed of three primary color signals and comprises a data code translator having an addressable memory and a video phase modulator having an addressable memory. The translator is responsive to said first data signals for providing second, plural bit digital signals to the phase modulator. The phase modulator operates in synchronism with a phase demodulator in the display and is responsive to receipt of respective ones of the second digital signals.

Abstract: The string comparator device for comparison of strings of indicia at high speeds for use in a system circuit in a computer system. The string comparison device provides a numeric measurement of the degree of similarity between the compared indicia strings as defined by a mathematical algorithm. The algorithm is solved through a new string comparator device or a new program in a computer system. The system circuit in chip form can be connected in a storage loop of a computer system to locate and quickly extract records that are very similar to the supplied query. Inexact queries will rapidly locate records similar with respect to indicia string related measurements of similarity. The method of indicia string comparison in the improved string comparator device can provide rapid response to queries in a computation time proportional to the average length of the indicia string.