(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

Institute for Defense Analyses Computer and Software Engineering Division 1801 ,V. Beauregard St. Alexandria, VA 72313 USA
My favorite hack of all times is a freelist that you searched by executing it. It was a system I built while working on my PhD in the early 1960s. In those days, storage allocation and garbage collection were primitive and there was no literature. Everyone had to reinvent everything for themselves. I was using an IBM 7040, with 36-bit words divided into 3-bit op code, 15-bit ";decrement"; field, 3-bit ";tag,"; and 15-bit address.* [Footnote] * Lisp historians will recall that with the leftmost 15-bit address called the decrement and the rightmost 15 bits the ";address,"; one had consents of address register (CAR)and contents of decrement raiser (CDR). My blocks of free storage were a minimum of two words long and the top two words were arranged thus:
[Figure containing following caption omitted: First word: Decrement: size of this block Address: address of next free block Second word: Address: address to go to when a block of proper size was found]

My favorite hack of all times is a freelist that you searched by executing it. It was a system I built
while working on my PhD in the early 1960s. In those days, storage allocation and garbage
collection were primitive and there was no literature. Everyone had to reinvent everything for
themselves. I was using an IBM 7040, with 36-bit words divided into 3-bit op code, 15-bit
"decrement" field, 3-bit "tag," and 15-bit address.*1 My blocks of free storage were a minimum of
two words long and the top two words were arranged thus:

(Image Omitted: First word: Decrement: size of this block Address: address of next free block
Second word: Address: address to go to when a block of proper size was found)

However, the first word was not just data; it was a form of index test and branch instruction.
Executed, it would test its decrement field against the index register identified by the tag and, if
less than or equal to it, fall through to the next instruction, otherwise jump to the address. The
second word was a subroutine transfer that had the effect of putting its own address into a
specified register and transferring to the given addr...