← Back to Patent Explorer
US4486857A Expired / Lapsed US ⏱️ 0.0 years remaining

Display system for the suppression and regeneration of characters in a series of fields in a stored record

Assignee: QUICKVIEW SYSTEMS Inc
•
Filing: 1982-10-06
•
Granted: 1984-12-04
•
Expires: 2002-10-06
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A microprocessor having a limited display capability is programmed to display a series of data fields from a record in which certain characters are selectively suppressed so that the whole or a selected portion of a record is represented. Upon actuation a selected field will be restored to its full data length for temporary display on the display medium.

Inventors

  • 👤 Paul C. Heckel

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 14:01
CPC Classifications
G; G09; G09G; G09G1/00; Y; Y10; Y10S; Y10S707/00; Y10S707/99931; Y10S707/99933; Y10S707/99936

Claims Analysis

Total Claims: 24
Claim 1
Independent Claim 145 words
In a microprocessor system having an input subsystem, an output subsystem capable of displaying a string of alphanumeric characters of length S, and a storage subsystem capable of storing strings of alphanumeric characters, each made up of no more than n substrings F i of alphanumeric characters each of length L i , and a processor subsystem, an improved data display system comprising: means for recognizing certain preselected alphanumeric characters in each substring F i ; means for selectively removing the recognized preselected characters in each substring F i so that the length L i of F i is reduced to a shortened substring f i of predetermined length l i less than L i and then displaying the reduced-length substrings f i ; and means for displaying a full-length substring F i selectively chosen from one of the displayed reduced fields f i .
Claim 2
Dependent Claim 145 words
In a microprocessor system having an input subsystem, an output subsystem capable of displaying a string of alphanumeric characters of length S, and a storage subsystem capable of storing strings of alphanumeric characters, each made up of no more than n substrings F i of alphanumeric characters each of length L i , and a processor subsystem, an improved data display system comprising: means for recognizing certain preselected alphanumeric characters in each substring F i ; means for selectively removing the recognized preselected characters in each substring F i so that the length L i of F i is reduced to a shortened substring f i of predetermined length l i less than L i and then displaying the reduced-length substrings f i ; and means for displaying a full-length substring F i selectively chosen from one of the displayed reduced fields f i .
Claim 3
Dependent Claim 27 words
The improvement of claim 1 wherein the means for recognizing certain preselected characters includes computer programming to recognize the vowel characters a, e, i, o, and u.
Claim 4
Dependent Claim 35 words
The improvement of claim 2 wherein the means for selectively removing preselected characters includes computer programming to remove the rightmost vowel character unless that vowel character occurs after a space, a comma, or a period.
Claim 5
Dependent Claim 69 words
The improvement of claim 2 wherein the means for removing preselected characters includes programming means for successively removing vowel characters from the substring F i except vowel characters occurring after a space, a comma, or a period, starting with the rightmost vowel characters and continuing until L i is reduced to l i or until no more eligible vowel characters exist in the partially reduced substring F i .
Claim 6
Dependent Claim 35 words
The improvement of claim 4 wherein the programming means further includes means for successively removing the rightmost characters of the partially reduced length substring F i until L i is reduced to l i .
Claim 7
Dependent Claim 51 words
The improvement of claim 1 wherein the means for displaying a full-length substring F i includes means to suppress the display of the reduced substring f i and at least the adjacent reduced substrings f i -1 and f i +1 when i is greater than one and less than S.
Claim 8
Dependent Claim 36 words
The improvement of claim 1 wherein the means for displaying the full-length substring F 1 includes means to suppress the display of the reduced substring f 1 and at least the reduced substring f 2 .
Claim 9
Dependent Claim 33 words
The improvement of claim 1 wherein the means for displaying the full-length substring F n includes means to suppress the reduced substring f n and at least the reduced substring f n-1 .
Claim 10
Dependent Claim 52 words
The improvement of claim 6 wherein the means for displaying a full-length substring F i when L i is greater than S includes programming means to successively remove predetermined characters from F i one at a time over a predetermined time while displaying the remaining S leftmost characters of F i .
Claim 11
Dependent Claim 37 words
The improvement of claim 9 wherein the predetermined characters are initially selected from the vowel characters a, e, i, o, and u where the vowel characters occur other than after a space, a comma, or a period.
Claim 12
Dependent Claim 142 words
A programming system for a microprocessor having an input subsystem, an output subsystem capable of displaying a string of alphanumeric characters of length S, and a storage subsystem capable of storing strings of alphanumeric characters, each made up of no more than n substrings F i of alphanumeric characters each of length L i , and a processor subsystem, comprising: means for recognizing certain preselected alphanumeric characters in each substring F i ; means for selectively removing the recognized preselected characters in each substring F i so that the length L i of F i is reduced to a shortened substring f i of predetermined length l i less than L i and then displaying the reduced-length substrings f i ; and means for displaying a full-length substring F i selectively chosen from one of the displayed reduced fields f i .
Claim 13
Dependent Claim 142 words
A programming system for a microprocessor having an input subsystem, an output subsystem capable of displaying a string of alphanumeric characters of length S, and a storage subsystem capable of storing strings of alphanumeric characters, each made up of no more than n substrings F i of alphanumeric characters each of length L i , and a processor subsystem, comprising: means for recognizing certain preselected alphanumeric characters in each substring F i ; means for selectively removing the recognized preselected characters in each substring F i so that the length L i of F i is reduced to a shortened substring f i of predetermined length l i less than L i and then displaying the reduced-length substrings f i ; and means for displaying a full-length substring F i selectively chosen from one of the displayed reduced fields f i .
Claim 14
Dependent Claim 27 words
The program of claim 11 wherein the means for recognizing certain preselected characters includes computer programming to recognize the vowel characters a, e, i, o, and u.
Claim 15
Dependent Claim 35 words
The program of claim 12 wherein the means for selectively removing preselected characters includes computer programming to remove the rightmost vowel character unless that vowel character occurs after a space, a comma, or a period.
Claim 16
Dependent Claim 69 words
The program of claim 12 wherein the means for removing preselected characters includes programming means for successively removing vowel characters from the substring F i except vowel characters occurring after a space, a comma, or a period starting with the rightmost vowel character and continuing until L i is reduced to l i or until no more eligible vowel characters exist in the partially reduced substring F i .
Claim 17
Dependent Claim 33 words
The program of claim 14 wherein the programming means further includes means for successively removing the rightmost characters of the partially reduced length substring until L i is reduced to l i .
Claim 18
Dependent Claim 51 words
The program of claim 11 wherein the means for displaying a full-length substring F i includes means to suppress the display of the reduced substring f i and at least the adjacent reduced substrings f i -1 and f i +1 when i is greater than one and less than S.
Claim 19
Dependent Claim 36 words
The program of claim 11 wherein the means for displaying the full-length substring F 1 includes means to suppress the display of the reduced substring f 1 and at least the reduced substring f 2 .
Claim 20
Dependent Claim 33 words
The program of claim 11 wherein the means for displaying the full-length substring F n includes means to suppress the reduced substring f n and at least the reduced substring f n-1 .
Claim 21
Dependent Claim 52 words
The program of claim 16 wherein the means for displaying a full-length substring F i when L i is greater than S includes programming means to successively remove predetermined characters from F i one at a time over a predetermined time while displaying the remaining S leftmost characters of F i .
Claim 22
Dependent Claim 30 words
The program of claim 19 wherein the predetermined characters are initially selected from the vowel where the vowel characters occur other than after a space, a comma, or a period.
Claim 23
Dependent Claim 168 words
A computer program for operating on a file consisting of a plurality of records where each record consists of n ordered fields F i where n is greater than one and wherein each field F i consists of L i alphanumeric characters, the program operable on a computer having a display capability for S alphanumeric characters, where S is less than the length of the record, the program comprising: means for recognizing certain preselected alphanumeric characters in each field F i ; means for selectively removing the recognized preselected characters in each field F i so that the length L i of F i is reduced to a shortened substring f i of predetermined length l i less than L i and then displaying the reduced length substrings f i on the computer; and means for displaying a full-length substring F i selectively chosen from one of the displayed reduced fields f i while simultaneously displaying at least one other reduced field f i or f n .
Claim 24
Dependent Claim 168 words
A computer program for operating on a file consisting of a plurality of records where each record consists of n ordered fields F i where n is greater than one and wherein each field F i consists of L i alphanumeric characters, the program operable on a computer having a display capability for S alphanumeric characters, where S is less than the length of the record, the program comprising: means for recognizing certain preselected alphanumeric characters in each field F i ; means for selectively removing the recognized preselected characters in each field F i so that the length L i of F i is reduced to a shortened substring f i of predetermined length l i less than L i and then displaying the reduced length substrings f i on the computer; and means for displaying a full-length substring F i selectively chosen from one of the displayed reduced fields f i while simultaneously displaying at least one other reduced field f i or f n .

References Cited (Backward Citations)

US3895375A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-12-04 1988-06-04 1988-12-04 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-12-04 1992-06-04 1992-12-04 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-12-04 1996-06-04 1996-12-04 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag