Detailed Office
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claims 1 – 18 are rejected on the ground of nonstatutory double patenting as being unpatentable over claims 1 – 18 of U.S. Patent No. 12,034,463.
US Application 18/765,953
US Patent Number 12,034,463
(Claim 1)
A system for lossless compression of tabular numeric data, comprising: a memory; and a processor in communication with the memory, the processor: generating a table of integers based on a table of uncompressed numeric information; rewriting each row in the table of integers as a difference between integer values in a current row and a preceding row of the table of integers; converting an absolute value of each number in the table of integers into one or more strings; concatenating the one or more strings into a concatenated string; and creating a compressed data file based on the concatenated string.
(Claim 1)
A system for lossless compression of tabular numeric data, comprising: a memory; and a processor in communication with the memory, the processor: generating a table of integers based on a table of uncompressed numeric information; rewriting each row in the table of integers as a difference between integer values in a current row and a preceding row of the table of integers; converting an absolute value of each number in the table of integers into one or more strings; concatenating the one or more strings into a concatenated string; and creating a compressed data file by writing a byte for each pair of characters in the concatenated string.
(Claim 2)
The system of Claim 1, wherein the processor stores a sign of each number in the table of integers.
(Claim 2)
The system of claim 1, wherein the processor stores a sign of each number in the table of integers.
(Claim 3)
The system of Claim 1, wherein the processor calculates the absolute value of each number in table of integers.
(Claim 3)
The system of claim 1, wherein the processor calculates the absolute value of each number in table of integers.
(Claim 4)
The system of Claim 1, wherein the processor concatenates the strings by concatenating a base-14 string with separators based on the sign of each number.
(Claim 4)
The system of claim 1, wherein the processor concatenates the strings by concatenating a base-14 string with separators based on the sign of each number.
(Claim 5)
The system of Claim 4, wherein the processor reserves a new byte array with a length that is half of the concatenated base-14 string.
(Claim 5)
The system of claim 4, wherein the processor reserves the new byte array with a length that is half of the concatenated base-14 string.
(Claim 6)
The system of Claim 5, wherein the processor writes a byte in the new byte array for each pair of characters in the concatenated base-14 string.
(Claim 6)
The system of claim 5, wherein the processor writes the byte in a new byte array for each pair of characters in the concatenated base-14 string.
(Claim 7)
A method for lossless compression of tabular numeric data, comprising the steps of: generating by a processor a table of integers based on a table of uncompressed numeric information; rewriting each row in the table of integers as a difference between integer values in a current row and a preceding row of the table of integers; converting an absolute value of each number in the table of integers into one or more strings; concatenating the one or more strings into a concatenated string; and creating a compressed data file based on the concatenated string.
(Claim 7)
A method for lossless compression of tabular numeric data, comprising the steps of: generating by a processor a table of integers based on a table of uncompressed numeric information; rewriting each row in the table of integers as a difference between integer values in a current row and a preceding row of the table of integers; converting an absolute value of each number in the table of integers into one or more strings; concatenating the one or more strings into a concatenated string; and creating a compressed data file by writing a byte for each pair of characters in the concatenated string.
(Claim 8)
The method of Claim 7, further comprising storing by the processor a sign of each number in the table of integers.
(Claim 8)
The method of claim 7, further comprising storing by the processor a sign of each number in the table of integers.
(Claim 9)
The method of Claim 7, further comprising calculating by the processor the absolute value of each number in table of integers.
(Claim 9)
The method of claim 7, further comprising calculating by the processor the absolute value of each number in table of integers.
(Claim 10)
The method of Claim 7, further comprising concatenating by the processor the strings by concatenating a base-14 string with separators based on the sign of each number.
(Claim 10)
The method of claim 7, further comprising concatenating by the processor the strings by concatenating a base-14 string with separators based on the sign of each number.
(Claim 11)
The method of Claim 10, further comprising reserving by the processor a new byte array with a length that is half of the concatenated base-14 string.
(Claim 11)
The method of claim 10, further comprising reserving by the processor the new byte array with a length that is half of the concatenated base-14 string.
(Claim 12)
The method of Claim 11, further comprising writing by the processor a byte in the new byte array for each pair of characters in the concatenated base-14 string.
(Claim 12)
The method of claim 11, further comprising writing by the processor the byte in the new byte array for each pair of characters in the concatenated base-14 string.
(Claim 13)
A non-transitory, computer-readable medium having computer-readable instructions stored thereon which, when executed by a processor, cause the processor to perform the steps of: generating by a processor a table of integers based on a table of uncompressed numeric information; rewriting each row in the table of integers as a difference between integer values in a current row and a preceding row of the table of integers; converting an absolute value of each number in the table of integers into one or more strings; concatenating the one or more strings into a concatenated string; and creating a compressed data file based on the concatenated string.
(Claim 13)
A non-transitory, computer-readable medium having computer-readable instructions stored thereon which, when executed by a processor, cause the processor to perform the steps of: generating by a processor a table of integers based on a table of uncompressed numeric information; rewriting each row in the table of integers as a difference between integer values in a current row and a preceding row of the table of integers; converting an absolute value of each number in the table of integers into one or more strings; concatenating the one or more strings into a concatenated string; and creating a compressed data file by writing a byte for each pair of characters in the concatenated string.
(Claim 14)
The computer-readable medium of Claim 13, further comprising storing by the processor a sign of each number in the table of integers.
(Claim 14)
The computer-readable medium of claim 13, further comprising storing by the processor a sign of each number in the table of integers.
(Claim 15)
The computer-readable medium of Claim 13, further comprising calculating by the processor the absolute value of each number in table of integers.
(Claim 15)
The computer-readable medium of claim 13, further comprising calculating by the processor the absolute value of each number in table of integers.
(Claim 16)
The computer-readable medium of Claim 13, further comprising concatenating by the processor the strings by concatenating a base-14 string with separators based on the sign of each number.
(Claim 16)
The computer-readable medium of claim 13, further comprising concatenating by the processor the strings by concatenating a base-14 string with separators based on the sign of each number.
(Claim 17)
The computer-readable medium of Claim 16, further comprising reserving by the processor a new byte array with a length that is half of the concatenated base-14 string.
(Claim 17)
The computer-readable medium of claim 16, further comprising reserving by the processor the new byte array with a length that is half of the concatenated base-14 string.
(Claim 18)
The computer-readable medium of Claim 17, further comprising writing by the processor a byte in the new byte array for each pair of characters in the concatenated base-14 string.
(Claim 18)
The computer-readable medium of claim 17, further comprising writing by the processor the byte in the new byte array for each pair of characters in the concatenated base-14 string.
Although the conflicting claims are not identical, they are not patentably distinct from each other because “a limitation on a claim can broadly be thought of then as its ability to make a meaningful contribution to the definition of the invention in a claim. In other words, language that is not functionally interrelated with the useful acts, structure, or properties of the claimed invention will not serve as limitation” See In re Gulack, 217 USPQ 401 (CAFC 1983). It would have been obvious to one of ordinary skill in the art at the time the invention was made to use the US Patent Number 12,034,463 disclosure to perform the same function as US application 18/765,953 and one ordinary skilled in the art would recognize that both US patent Number 12,034,463 and US application 18/765,953 would perform the same function, work equally well and achieve the same end result.
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to JEAN BRUNER JEANGLAUDE whose telephone number is (571)272-1804. The examiner can normally be reached Monday-Thursday 7:00 AM-5:00 PM.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Dameon Levi can be reached at 571-272-2105. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/JEAN B JEANGLAUDE/Primary Examiner, Art Unit 2845