(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.

Publishing Venue

Related People

Abstract

Disclosed is a method for generating a unique identifier based on a timestamp even if the latter's resolution is lower than that needed for the shortest interval of identifier generations.

Country

United States

Language

English (United States)

This text was extracted from an ASCII text file.

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

Method for Generating Unique Identifiers by Using
Low-Resolution Timestamps

Disclosed is
a method for generating a unique identifier based
on a timestamp even if the latter's resolution is lower than that
needed for the shortest interval of identifier generations.

Let the
resolution (minimum effective unit) of timestamps be T
and the shortest interval between identifier generation requests be
R. Existing identifier generation
methods based on a timestamp
assume that T is sufficient for R (T <
R). In this case, we can use
a timestamp as a unique identifier, because every identifier
generation request obtains a different timestamp. On the other hand,
if a timestamp has a low resolution (T >
R), it cannot be used as a
unique identifier, because there is a possibility that two or more
identical (non-unique) identifiers would be generated. The proposed
method is effective in the latter case.

This method
requires an integer variable V with the restriction
of (T/R) <= 2(N), where N is the
bit-width of V. Each identifier
generation request increases the value of V by 1. A combination of T
and a value of V has sufficient resolution for R and can be used as a
unique identifier. For example, if T=10
msec and R=1 msec, we need a
variable V with a bit-width of at least 4 (2(3)
< 10 < 2(4)).

There is no
need to keep V in secondary storage, because T has
a different value every time an application starts up, and any
combin...