[DE Deutsch] [FR Francais] [translatable text] [howto help] [printable version] [Addenda]

Google
Coding System for Reducing Redundancybinary oriented set sequencingvisualising a processmarking used blockscompression on demandgenerating buying incentives from cooking recipes

Binary oriented set sequencing

An EPO patent, granted in 1997 with priority date 1994, on a method of information organisation commonly used in a recent world wide web standard. According to this method, all information is structured into atom identifiers and statements of relationsship between two identifiers. This allows a greater independence between data and methods of processing these data.
EC Class:
G06F17/30B
IP Class:
G06F17/30
priority date:
US19940356878 19941215
application number:
US19940356878 19941215
requested:
[_] EP0797806 (WO9618958), B1
applicant:
UFIL UNIFIED DATA TECHNOLOGIES
inventor:
AHMADI BABAK (CA)
publication date:
1997-11-04
patent number:
[_] US5684985
Name of the Invention:
Method and apparatus utilizing bond identifiers executed upon accessing of an endo-dynamic information node (EDIN)
patent application (A):
claims, description and abstract
granted version (B1):
The EPO publishes the patent as a collection of graphical files, which we concatenate into one huge PDF file and, by OCR batch processing, reduce to a text file.
[ Coding System for Reducing Redundancy → binary oriented set sequencing | visualising a process | distinguishing between used and unused memory blocks during cache error handling | transmitting compression requests | generating buying incentives from cooking recipes ]
Valid HTML 4.01!
http://swpat.ffii.org/pikta/mupli/ep797806/index.en.html
© 2005/01/06 (2002/11/20) Workgroup
english version 2004/08/16 by Hartmut PILCH