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

Determination and printout of reference line

Assignee: International Business Machines Corp
•
Filing: 1973-12-26
•
Granted: 1976-10-19
•
Expires: 1993-12-26
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In the IBM Mag Card II, data read from the cards into the shift register buffer can be scanned without printing the data out and rerecorded on a magnetic card with proper pagination decisions made based on an operator entered line count. A system is provided for printing out a reference line near the end of each page based on the operator entered line count such that the operator can determine that the page has ended at a proper point. In addition, the system provides a control technique such that when a sufficient number of lines have been scanned to satisfy the line count, the reference print line will neither be the next to the last line of a paragraph nor the first line of a paragraph. This control is in accordance with established word processing procedures in that it is undesirable to end the page with the first line of a paragraph or to begin a subsequent page with the last line of a paragraph. Logic is provided to accomplish this printout in accordance with the above rules.

Inventors

  • 👤 William Weller Boyd

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-25 04:40
CPC Classifications
B; B41; B41J; B41J5/00; B41J5/30; B41J5/31; B41J5/40

Claims Analysis

Total Claims: 15
Claim 1
Independent Claim 197 words
In a word processing system usable by an operator for playout of previously stored control and textual codes to present a visual textual representation thereof for editing purposes, said system comprising: means for storing said control and textual codes; means for providing an operator readable output to said operator; first logic means connected to said storing means for converting said control and textual codes into operator readable text lines; means connected to said first logic means operable to allow said operator to enter a desired line count representing the desired number of lines which will constitute a page of information; and second logic means connecting said first logic means and said operator readable output means and connected to said line count means, said second logic means being operative to count text lines from the beginning of a page in said storing means and for gating a single particular text line to said output means, the line count of said single particular text line being approximately equal to said desired line count with the exceptions that said particular text line is neither the next to the last line of a paragraph nor the first line of a paragraph.
Claim 2
Dependent Claim 197 words
In a word processing system usable by an operator for playout of previously stored control and textual codes to present a visual textual representation thereof for editing purposes, said system comprising: means for storing said control and textual codes; means for providing an operator readable output to said operator; first logic means connected to said storing means for converting said control and textual codes into operator readable text lines; means connected to said first logic means operable to allow said operator to enter a desired line count representing the desired number of lines which will constitute a page of information; and second logic means connecting said first logic means and said operator readable output means and connected to said line count means, said second logic means being operative to count text lines from the beginning of a page in said storing means and for gating a single particular text line to said output means, the line count of said single particular text line being approximately equal to said desired line count with the exceptions that said particular text line is neither the next to the last line of a paragraph nor the first line of a paragraph.
Claim 3
Dependent Claim 38 words
The word processing system of claim 1 further including hyphenation logic means for allowing said operator to make hyphenation decisions in the event a hyphenation sequence is required in said single particular text line presented to said operator.
Claim 4
Dependent Claim 20 words
The word processing system of claim 2 wherein said means for storing includes a bulk store and a working store;
Claim 5
Dependent Claim 40 words
means for reading said coded data from said bulk store into said working store; and means for connecting said working store to said first logic means and to said hyphenation logic means to provide said control and textual codes thereto.
Claim 6
Dependent Claim 40 words
means for reading said coded data from said bulk store into said working store; and means for connecting said working store to said first logic means and to said hyphenation logic means to provide said control and textual codes thereto.
Claim 7
Dependent Claim 25 words
The word processing system of claim 3 wherein said working store is a recirculating memory and said bulk store is at least one magnetic card.
Claim 8
Dependent Claim 15 words
The word processing system of claim 4 wherein said recirculating memory is a shift register.
Claim 9
Dependent Claim 53 words
The word processing system of claim 1 wherein said means for storing includes a bulk store and working store; means for reading said coded data from said bulk store into said working store; and means for connecting said working store to said first logic means to provide said control and textual codes thereto.
Claim 10
Dependent Claim 26 words
The word processing system of claim 6 further wherein said working store is a recirculating memory and said bulk store is at least one magnetic card.
Claim 11
Dependent Claim 17 words
The word processing system of claim 7 further wherein said operator readable output means is a printer.
Claim 12
Dependent Claim 52 words
The word processing system of claim 8 including means connecting said recirculating memory to said at least one magnetic card operative, following printing out of said single particular text line, to allow said operator to record said control and textual codes in said recirculating memory onto said at least one magnetic card.
Claim 13
Dependent Claim 15 words
The word processing system of claim 9 wherein said recirculating memory is a shift register.
Claim 14
Independent Claim 121 words
A method of pagination including the steps of: storing control and textual codes representative of text lines, including line ending codes, in a store; entering a desired page line count into control logic; scanning said control and textual codes in said store by means of said control logic to count said line ending codes; comparing said count of said line ending codes with said desired page line count; and visually presenting to an operator for a pagination decision a single particular text line, the line count of said single particular text line corresponding to said desired page line count, provided said visually presented line is neither the next to last line of a paragraph nor the first line of a paragraph.
Claim 15
Independent Claim 121 words
A method of pagination including the steps of: storing control and textual codes representative of text lines, including line ending codes, in a store; entering a desired page line count into control logic; scanning said control and textual codes in said store by means of said control logic to count said line ending codes; comparing said count of said line ending codes with said desired page line count; and visually presenting to an operator for a pagination decision a single particular text line, the line count of said single particular text line corresponding to said desired page line count, provided said visually presented line is neither the next to last line of a paragraph nor the first line of a paragraph.

References Cited (Backward Citations)

US3618032A Cited
US3706075A Cited
US3755784A Cited
US3772655A Cited
US3764986A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1979-10-19 1980-04-19 1980-10-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1983-10-19 1984-04-19 1984-10-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1987-10-19 1988-04-19 1988-10-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag