(Cat? OR feline) AND NOT dog?
Cat? W/5 behavior
(Cat? OR feline) AND traits
Cat AND charact*

This guide provides a more detailed description of the syntax that is supported along with examples.

This search box also supports the look-up of an IP.com Digital Signature (also referred to as Fingerprint); enter the 72-, 48-, or 32-character code to retrieve details of the associated file or submission.

Concept Search - What can I type?

For a concept search, you can enter phrases, sentences, or full paragraphs in English. For example, copy and paste the abstract of a patent application or paragraphs from an article.

Concept search eliminates the need for complex Boolean syntax to inform retrieval. Our Semantic Gist engine uses advanced cognitive semantic analysis to extract the meaning of data. This reduces the chances of missing valuable information, that may result from traditional keyword searching.

hashing algorithm

Publishing Venue

IBM

Abstract

Disclosed is a simple way to build hashing algorithm for alphanumeric strings and similar. The procedure is divided into two steps: first of all it transforms each string into an only-numeric array (step1), then it uses whatever hashing algorithm for numeric arrays. It could be useful in inventory processing.
Step 1
If A is a set of symbols (here called, for simplicity, an alphabet) and a is a function a: A N 4 {0} which associates to each symbol g c A a positive integer n c N 4 {0}, it is possible to define a correspondence c between an array v c V a Z ...( t times, t c N ... Z (where V is the cartesian product of whatever combination of A and N 4 {0}) and N 4 {0} N 4 {0} ... N 4 {0} a Z ...(m times, m c N, t m m ... Z in this way:
c : V N 4 {0} N 4 {0} ... N 4 {0}

Country

United States

Language

English (United States)

This text was extracted from a PDF file.

This is the abbreviated version, containing approximately
66% of the total text.

Page 1 of 2

hashing algorithm

Disclosed is a simple way to build hashing algorithm for alphanumeric strings and similar. The procedure is divided into two steps: first of all it transforms each string into an only-numeric array (step1), then it uses whatever hashing algorithm for numeric arrays. It could be useful in inventory processing.

Step 1

If A is a set of symbols (here called, for simplicity, an alphabet) and a is a function a: A -----> N 4 {0} which associates to each symbol gcA a positive integer nc N 4 {0}, it is possible to define a correspondence c between an array v c V a Z %...(t times, tc N) ...% Z (where V is the cartesian product of whatever combination of A and N 4 {0}) and N 4 {0} % N 4 {0} % ... % N 4 {0} a Z %...(m times, mc N,t m m) ...% Z in this way:

Since c(v) = w must be an element of Z %...(m times, mc N,m m t) ...% Z, all w components which are not in Img(c(v)) are set to zero. This is needed since c compresses several v components into one component of w , depending on the nature of v.

EXAMPLE:

A = {latin alphabet} h { a,b,c,d,...,z }

a: A-----> N 4 {0} is the application that associates to each letter of A the