Lucent Technologies Inc.

At+t Corp.

Brenda Sue Baker

Eric Henry Grosse

Raffaele Giancarlo

Kenneth Ward Church

Jonathan Isaac Helfman

Udi Manber

Brian W Kernighan

A technique for detecting similarities in large sets of binary code files, e.g., bytecode files, without requiring access or knowledge of the actual source code itself. In accordance with the technique, bytecode files are disassembled and preprocessed using positional encoding to prepare the disassembled bytecode files for use in conjunction with similarity detection tools.

Detecting similarities in Java sources from bytecodes

Multiple approaches are used with a filter to handle naming ambiguities when requesting access to a plurality of network resources through a public network such as the Internet. One approach is to consider responses from the public network as well as requested URLs in determining whether to allow or deny resources. The response information used may include header information or the resource itself. If the header information includes a new URL, the new URL can be forwarded to the requester, or submitted to the public network. A permission database is queried to determine whether a resource corresponding to the new URL should be forwarded to the requestor. A checksum database can also be used to determine if a specific resource should be forwarded to the requestor. Another approach is to record and maintain a database of aliases for URLs. When a URL is requested, the alias URLs are determined for that URL. The alias URLs can then be queried in the permission database to determine if the resource corresponding to the aliases can be accessed by the requesting terminal before the URL is requested from the public network.

Filtering for public databases with naming ambiguities

Multiple approaches are used with a filter to handle naming ambiguities when requesting access to a plurality of network resources through a public network such as the Internet. One approach is to consider responses from the public network as well as requested URLs in determining whether to allow or deny resources. The response information used may include header information or the resource itself. If the header information includes a new URL, the new URL can be forwarded to the requestor, or submitted to the public network. A permission database is queried to determine whether a resource corresponding to the new URL should be forwarded to the requestor. A checksum database can also be used to determine if a specific resource should be forwarded to the requestor. Another approach is to record and maintain a database of aliases for URLs. When a URL is requested, the alias URLs are determined for that URL. The alias URLs can then be queried in the permission database to determine if the resource corresponding to the aliases can be accessed by the requesting terminal before the URL is requested from the public network.

Interactive Methods and apparatus for studying similarities of values in very large data sets. The methods and apparatus employ a dotplot in an interactive graphical user interface to make the relationship between the similarities and the data set visible. A variety of filtering, weighting, and compression techniques make it possible to employ the dot plot with sequences of more than 10,000 tokens and to interactively magnify the dot plot, change weighting and display quantization, and view the underlying data. Also disclosed is a technique which is employed in the apparatus for identifying long sequences of similar tokens. The apparatus is used in the study of large bodies of text and code.

Methods and apparatus for detecting and displaying similarities in large

A system and method for selectively controlling database access by providing a system and method that allows a network administrator or manager to restrict specific system users from accessing information from certain public or otherwise uncontrolled databases (i.e., the WWW and the Internet). The invention employs a relational database to determine access rights, and this database may be readily updated and modified by an administrator. Within this relational database specific resource identifiers (i.e., URLs) are classified as being in a particular access group. The relational database is arranged so that for each user of the system a request for a particular resource will only be passed on from the local network to a server providing a link to the public/uncontrolled database if the resource identifier is in an access group for which the user has been assigned specific permissions by an administrator. The invention is implemented as part of a proxy server within the user's local network.

System and method for database access control

A system and method for selectively controlling database access by providing a system and method that allows a network administrator or manager to restrict specific system users from accessing information from certain public or otherwise uncontrolled databases (i.e., the WWW and the Internet). The invention employs a relational database to determine access rights, and this database may be readily updated and modified by an administrator. Within this relational database specific resource identifiers (i.e., URLs) are classified as being in a particular access group. The relational database is arranged so that for each user of the system a request for a particular resource will only be passed on from the local network to a server providing a link to the public/uncontrolled database if the resource identifier is in an access group for which the user has been assigned specific permissions by an administrator. In one preferred embodiment, the invention is implemented as part of a proxy server within the user's local network.

System and method for restricting user access rights on the internet

Methods are disclosed for finding maximal matches in data strings and for finding matches in parameterized strings, that is, strings containing symbols from more than one alphabet in which the symbols from one of the alphabet are treated as parameters. In general, such maximal matches are found by creating a suffix tree representing the data string, generating lists for each node in the tree indicating the left contexts of all suffixes associated with that node and reporting matches for pairs of suffixes having different left contexts. One method of finding parameterized matches is to substitute a common symbol for the symbols of the alphabet representing the parameters before creating the suffix tree and then discarding matches found for which the actual parameters are not consistent. Another, preferred, method of finding parameterized matches is to substitute integers for the symbols of the alphabet representing the parameters, such symbols being chosen to create a linked list in the data string for each different symbol in such alphabet. Matches found by the suffix tree are then consistent and no matches need be discarded. Other methods of finding matches are disclosed in which suffix trees are used in conjunction with square matrices to analyze the data strings.

Method of identifying pattern matches in parameterized strings and

Methods are disclosed for finding maximal matches in data strings and for finding matches in parameterized strings, that is, strings containing symbols from more than one alphabet in which the symbols from one of the alphabets are treated as parameters. In general, such maximal matches are found by creating a suffix tree representing the data string, generating lists for each node in the tree indicating the left contexts of all suffixes associated with that node and reporting matches for pairs of suffixes having different left contexts. One method of finding parameterized matches is to substitute a common symbol for the symbols of the alphabet representing the parameters before creating the suffix tree and then discarding matches found for which the actual parameters are not consistent. Another, preferred, method of finding parameterized matches is to substitute integers for the symbols of the alphabet representing the parameters, such symbols being chosen to create a linked list in the data string for each different symbol in such alphabet. Matches found by the suffix tree are then consistent and no matches need be discarded. Other methods of finding matches are disclosed in which suffix trees are used in conjunction with square matrices to analyze the data strings.

Growing community of inventors

Berkeley Heights, NJ, United States of America

Brenda Sue Baker