Patent US5315655A successfully refreshed from Google Patents.
US5315655A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for encoding data objects on a computer system
Assignee: Notable Technologies Inc
•
Filing: 1992-12-16
•
Granted: 1994-05-24
•
Expires: 2012-12-16
Abstract
Abstract A method and apparatus for real-time encoding and decoding of data on a computer system. The present invention is used preferably with a utility which causes data objects to be encoded and decoded. Such utilities include data compression utilities, data encryption utilities and security utilities. The general method involves the steps of opening an encoded data object; starting operation of an encoding/decoding means; encoding a decoded data object from a list of decoded data objects; removing the decoded data object from the list of decoded data objects; decoding the encoded data object; posting the encoded data object to the list of decoded data objects; terminating execution of the encoding/decoding utility; and invoking an application associated with said data object that was just decoded. Data objects may be comprised of sub-objects of a plurality of sub-objects. In such instances, the encoding and decoding occurs at the sub-object level.
Inventors
- 👤 Michael Chaplin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 13:52
CPC Classifications
G; G06; G06F; G06F16/00; G06F16/20; G06F16/25
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
261 words
In a computer system having a compression/decompression means for compressing and decompressing data objects, a method for managing the operation of said compression/decompression means to transparently cause data objects to be, compressed said method comprising the steps of: a) compressing a first data object and a second data object; b) when a user causes said first data object to be opened: c) determining whether said second data object is stored uncompressed; d) if said second data object is stored uncompressed: e) re-compressing said second data object; f) storing said second data object as compressed; g) removing an indication that said second data object is stored uncompressed; h) decompressing said first data object; i) when said user causes said first data object to be closed: j) storing said first data object uncompressed; k) indicating that said first data object is stored uncompressed; l) when said user causes said second data object to be opened: m) determining whether said first data object is stored uncompressed; n) if said first data object is stored uncompressed: o) recompressing said first data object; p) storing said first data object as compressed; q) removing an indication that said first data object is stored uncompressed; r) decompressing said second data object; s) when said user causes said second data object to be closed: t) storing said second data object uncompressed; u) indicating that said second data object is stored uncompressed; v) repeating steps b-k each time said first data object is opened and closed; w) repeating steps l-u each time said second data object is opened and closed.
Claim 2
Dependent Claim
261 words
In a computer system having a compression/decompression means for compressing and decompressing data objects, a method for managing the operation of said compression/decompression means to transparently cause data objects to be, compressed said method comprising the steps of: a) compressing a first data object and a second data object; b) when a user causes said first data object to be opened: c) determining whether said second data object is stored uncompressed; d) if said second data object is stored uncompressed: e) re-compressing said second data object; f) storing said second data object as compressed; g) removing an indication that said second data object is stored uncompressed; h) decompressing said first data object; i) when said user causes said first data object to be closed: j) storing said first data object uncompressed; k) indicating that said first data object is stored uncompressed; l) when said user causes said second data object to be opened: m) determining whether said first data object is stored uncompressed; n) if said first data object is stored uncompressed: o) recompressing said first data object; p) storing said first data object as compressed; q) removing an indication that said first data object is stored uncompressed; r) decompressing said second data object; s) when said user causes said second data object to be closed: t) storing said second data object uncompressed; u) indicating that said second data object is stored uncompressed; v) repeating steps b-k each time said first data object is opened and closed; w) repeating steps l-u each time said second data object is opened and closed.
Claim 3
Dependent Claim
66 words
The method as recited in claim 1 wherein said data objects are comprised of a plurality of sub-objects, said re-compressing steps are further comprised of the steps of: a) marking said data object as compressed; b) encoding a sub-object marked as decompressed; c) marking said sub-object as compressed; and d) repeating steps b)-c) for all sub-objects of said decoded data object which are marked as decompressed.
Claim 4
Dependent Claim
55 words
The method as recited in claim 2 wherein said step of decompressing said first encoded data object is further comprised of the steps of: a) decoding a sub-object marked as encoded; b) marking said sub-object as decoded; c) repeating steps a)-b) for all sub-objects marked as decoded; and d) marking said data object as decoded.
Claim 5
Dependent Claim
23 words
The method as recited in claim 3 is further comprised of the step of invoking an application associated with said first data object.
Claim 6
Dependent Claim
50 words
The method of claim 1 further comprising the steps of: determining if memory is available for decompressing a sub-object of said first data object; if memory is available, decompressing said sub-object and marking said sub-object as decompressed; if memory is not available, terminating the decompression of said first data object.
Claim 7
Dependent Claim
59 words
The method of claim 1 further comprising the steps of: determining if said first data object is in use; if said first data object is not in use, identifying said first data object as requiring compression; if said first object is in use, identifying a third data object that is not in use and compressing said third data object.
Claim 8
Dependent Claim
20 words
The method of claim 1 further comprising the step of invoking an application program associated with said second data object.
Claim 9
Dependent Claim
211 words
A computer system having a processor, execution memory, program storage memory, and data storage for storing data objects, said computer system having means for transparently encoding and decoding data objects further comprising: a) data object encoding means for encoding a first decoded data object and a second decoded data object; b) data object decoding means for decoding a first encoded data object and a second encoded data object; c) storage means for storing a list of decoded data objects that have been decoded by said data object decoding means; d) means for detecting that a user has requested that said first encoded data object be opened; e) means for invoking said data object decoding means responsive to, detecting that said user has requested that said first encoded data object be opened, said means for invoking said data object decoding means for starting the decoding of said first encoded data object; f) means for invoking said data object encoding means responsive to detecting that said user has requested that said first encoded data object be opened, said means for invoking said data object means for starting the encoding of said second decoded data object; g) means for storing said first decoded data object; h) means for storing said second encoded data object.
Claim 10
Dependent Claim
211 words
A computer system having a processor, execution memory, program storage memory, and data storage for storing data objects, said computer system having means for transparently encoding and decoding data objects further comprising: a) data object encoding means for encoding a first decoded data object and a second decoded data object; b) data object decoding means for decoding a first encoded data object and a second encoded data object; c) storage means for storing a list of decoded data objects that have been decoded by said data object decoding means; d) means for detecting that a user has requested that said first encoded data object be opened; e) means for invoking said data object decoding means responsive to, detecting that said user has requested that said first encoded data object be opened, said means for invoking said data object decoding means for starting the decoding of said first encoded data object; f) means for invoking said data object encoding means responsive to detecting that said user has requested that said first encoded data object be opened, said means for invoking said data object means for starting the encoding of said second decoded data object; g) means for storing said first decoded data object; h) means for storing said second encoded data object.
Claim 11
Dependent Claim
61 words
The computer system as recited in claim 8 wherein said computer system is further comprised of: a) means for adding a decoded data object to said list of decoded data objects; b) means for removing a decoded data object from said list of decoded data objects; and c) means for identifying that a decoded data object is no longer in use.
Claim 12
Dependent Claim
57 words
The computer system of claim 8 further comprising means for determining whether there is enough memory available in said computer system for decoding a sub-object of said first encoded data, wherein said sub-object is decoded and marked as decoded if said memory is available and wherein said sub-object is not decoded if said memory is not available.
Claim 13
Dependent Claim
20 words
The computer system of claim 8 further comprising means for invoking an application program associated with said first encoded data.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-05-23 | 1997-11-22 | 1998-05-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-05-23 | 2001-11-22 | 2002-05-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-05-23 | 2005-11-22 | 2006-05-24 | $7700.00 | Window Closed / Lapsed |