Bedrock Computer Technologies, LLC v. Softlayer Technologies, Inc. et al
Filing
846
Additional Attachments to Main Document: #845 MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed) MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed) MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed) MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed) MOTION for Judgment as a Matter of Law Regarding Invalidity (Renewed).. (Attachments: #1 Exhibit 13 - U.S. Patent 5,893,120 - PX-1, #2 Exhibit 14 - 1996 NRL IPv6 code key.c - DX-36, #3 Exhibit 15 - NRL Source Code - key.h - DX-35, #4 Exhibit 16 - Information Disclosure Statement - 6/2010 - DX-147C, #5 Exhibit 17 - Information Disclosure Statement -12-2010 - DX-147E, #6 Exhibit 18 - Transaction History for Patent Application - DX-147G, #7 Exhibit 19 - USPTO Notice of Intent to Issue - DX-147F, #8 Exhibit 20 - Ex Parte Reexamination Certificate for the '120 Patent - DX-147H, #9 Exhibit 21 - US. Patent 5,287,499 - DX-66, #10 Exhibit 22 - Telcordia documents re: patent application - DX-56, #11 Exhibit 23 - Yahoo!'s 2004 10K Annual Statement - PX-248)(Doan, Jennifer)
Exhibit 19
UNITED STATES PATENT AND TRADEMARK OFFICE
Commissioner for Patents
United States Patents and Trademark Office
P.O.Box 1450
Alexandria, VA 22313-1450
www.uspto.gov
THIRD PARTY REQUESTER'S CORRESPONDENCE ADDRESS
Date:
l . .; t 4- \l
Lissi M. Marquis
NOV AK DRUCE & QUIGG LLP
1000 Louisiana Street, 53rd Floor
Houston, TX 77002
EX PARTE REEXAMINATION COMMUNICATION TRANSMITTAL FORM
REEXAMINATION CONTROL NO. : 90010856
PATENT NO. : 5893120
ART UNIT : 3992
Enclosed is a copy of the latest communication from the United States Patent and Trademark
Office in the above identified ex parte reexamination proceeding (37 CFR 1.550(f)):
Where this copy is supplied after the reply by requester, 37 CFR 1.535, or the time for filing a
reply has passed, no submission on behalf of the ex parte reexamination requester will be
acknowledged or considered (37 CFR 1.550(g)).
YAH0000525578
Control No.
90/010,856
5893120
Examiner
Art Unit
ALEXANDER J.
KOSOWSKI
Notice of Intent to Issue
Ex. Parte Reexamination Certificate
Patent Under Reexamination
3992
-- The MAILING DA TE of this communication appears on the cover sheet with the correspondence address --
1.
0
Prosecution on the merits is (or remains) closed in this ex parte reexamination proceeding. This proceeding is
subject to reopening at the initiative of the Office or upon petition. Cf 37 CFR 1. 313(a). A Certificate will be
issued in view of
(a) r8l Patent owner's communication(s) filed: 23 November 2010.
(b) 0 Patent owner's late response filed: _ _
.
(c) 0 Patent owner's failure to file an appropriate response to the Office action mailed: _ _
.
(d) 0 Patent owner's failure to timely file an Appeal Brief (37 CFR 41.31).
(e) 0 Other: _ _
Status of Ex Parte Reexamination:
(f) Change in the Specification: 0 Yes r8l No
(g) Change in the Drawing(s):
0 Yes r8l No
(h) Status of the Claim(s):
(1) Patent claim(s) confirmed: 1,2,5 and 6.
(2) Patent claim(s) amended (including dependent on amended claim(s)): 3,4,7 and 8
(3) Patent claim(s) canceled: _ _ .
(4) Newly presented claim(s) patentable: 9-12.
(5) Newly presented canceled claims: ___
.
(6) Patent claim(s)
D
previously
D
currently disclaimed: _ _
(7) Patent claim(s) not subject to reexamination: _ _
.
2.
0
D
4. 0
5. D
6. D
3.
Note the attached statement of reasons for patentability and/or confirmation. Any comments considered
necessary by patent owner regarding reasons for patentability and/or confirmation must be submitted promptly
to avoid processing delays. Such submission(s) should be labeled: "Comments On Statement of Reasons for
Patentability and/or Confirmation."
.
Note attached NOTICE OF REFERENCES CITED (PTO-892).
Note attached LIST OF REFERENCES CITED (PTO/SB/08 or PTO/SB/08 substitute).
The drawing correction request filed on _ _ is:
0
approved
0
disapproved.
Acknowledgment is made of the priority claim under 35 U.S.C. § 119(a)-(d) or (f).
a)O All b)O Some*
c)O None
of the certified copies have
been received.
not been received.
been filed in Application No. _ _ .
been filed in reexamination Control No.
.
been received by the International Bureau in PCT Application No. _ _
.
o
o
o
o
o
* Certified copies not received: _ _
.
D
8. D
9. D
7.
Note attached Examiner's Amendment.
Note attached Interview Summary (PTO-474).
Other: _ _
.
cc: Requester (if third party requester)
u.s. Patent
and Trademark Office
YAH0000525579
I~ ,
Application/Control Number: 90/010,856
Page 2
Art Unit: 3992
DETAILED ACTION
1)
This Office action addresses claims 1-8 and new claims 9-12 of United States Patent
Number 5,893,120 (Nemes), for which it has been determined in the Order Granting Ex Parte
°
Reexamination (hereafter the "Order") mailed 3/2511 that a substantial new question of
patentability was raised in the Request for Ex Parte reexamination filed on 2/9/10 (hereafter the
"Request"). This is a response to the amendment filed 11123/1 o. Claims 1-12 are allowable
and/or confirmed below.
ST ATEMENT OF REASONS FOR PATENTABILITY AND/OR CONFIRMATION
2)
Claims 1-12 are allowable and/or confirmed.
Examiner notes that the amendment filed 11123110 has been considered in its entirety,
including the three separately submitted affidavits from Dr. Lawrence Pileggi.
In the amendment filed 1112311 0, patent owner (PO) has defined specific structure for the
means plus function system claims, and has amended all the method claims to impart similar
functionality. In view of these new definitions and amendments, examiner interprets how each
piece of prior art is overcome as follows:
The five issues from the
non~final
office action are rejections in view of Morrison,
Thatte, Morrison and Dirks, Morrison and Thatte and Dirks and Morris.
With regard to Morrison, PO has shown that there is no analysis of how Morrison
provides the required record search means or searching for a target record as recited.
YAH0000525580
.'
Application/Control Number: 901010,856
Page 3
Art Unit: 3992
With regard to Thatte, PO and Dr. Lawrence Pileggi have shown that operations in Thatte
are suspended while a reconciliation process executes. Therefore, linked list access and removal
of expired records cannot occur at the same time, as recited.
With regard to Dirks and Morris, PO and Dr. Lawrence Pileggi have shown that
modifying the linear array (open) has table of Dirks to utilize a chained hash table such as Morris
would not be obvious at such a modification would destroy the predictability of the Dirks design.
With regard to Morrison and Dirks and Morrison and Thatte, the persuasive arguments
above with regard to Morrison render these rejections moot.
Therefore, the following is an examiner's statement of reasons for patentability andlor
confirmation of the claims found patentable in this reexamination proceeding:
Referring to claim 1, the claim is allowable over the prior art that was explained in the
request and determined to raise a substantial new question of patentability in the order granting
reexamination and over the prior art that was applied and discussed by the examiner in the
present reexamination 'proceeding because that prior art does not explicitly teach an information
storage and retrieval system comprising means utilizing record search means for accessing a
linked list and, at the same time, removing at least some of the expired ones of the records in the
linked list, in combination with the remaining elements or features of the claimed invention.
Referring to claim 3, the claim is allowable over the prior art that was explained in the
request and determined to raise a substantial new question of patentability in the order granting
reexamination and over the prior art that was applied and discussed by the examiner in the
YAH0000525581
Application/Control Number: 901010,856
Page 4
Art Unit: 3992
• I
present reexamination proceeding because that prior art does not explicitly teach a method for
storing and retrieving information records using a linked list comprising accessing the linked list
of records to search for a target record and identifying at least some of the automatically expired
ones of the records while searching for the target record, in combination with the remaining
elements or features of the claimed invention.
Referring to claim 5, the claim is allowable over the prior art that was explained in the
request and determined to raise a substantial new question of patentability in the order granting
reexamination and over the prior art that was applied and discussed by the examiner in the
present reexamination proceeding because that prior art does not explicitly teach an information
storage and retrieval system comprising means utilizing record search means for inserting,
retrieving and deleting records from the system and, at the same time, removing at least some
expired ones of the records in the accessed linked list of records, in combination with the
remaining elements or features of the claimed invention.
Referring to claim 7, the claim is allowable over the prior art that was explained in the
request and determined to raise a substantial new question of patentability in the order granting
reexamination and over the prior art that was applied and discussed by the examiner in the
present reexamination proceeding because that prior art does not explicitly teach a method for
storing and retrieving information records using a hashing technique comprising accessing a
linked list of records having same hash address to search for a target record and identifying at
least some of the automatically expired ones of the records while searching for the target record,
in combination with the remaining elements or features of the claimed invention.
Claims 2, 4, 6 and 8-12 depend on allowable claims, and are therefore also allowable.
YAH0000525582
Page 5
Application/Control Number: 90/010,856
Art Unit: 3992
Any comments considered necessary ,by PATENT 0 WNER regarding the above
statement must be submitted promptly to avoid processing delays. Such submission by the
patent owner should be labeled: "Comments on Statement of Reasons for Patentability and/or
Confirmation" and will be placed in the reexamination file.
Conclusion
All correspondence relating to this ex parte reexamination proceeding should be directed
as follows:
. By U.S. Postal Service Mail to:
Mail Stop Ex Parte Reexam
ATTN: Central Reexamination Unit
Commissioner for Patents
P.O, Box 1450
Alexandria, VA 22313-1450
By FAX to:
(571) 273-9900
Central Reexamination Unit
By hand to:
Customer Service Window
Randolph Building
401 Dulany St.
Alexandria, VA 22314
By EFS-Web:
Registered users of EFS- Web may alternatively submit such correspondence via the
electronic filing system EFS- Web, at
YAH0000525583
,
.
Application/Control Number: 901010,856
Page 6
Art Unit: 3992
https:llsportal.uspto.gov/authenticate/authenti cateuser localepf.html
EFS-Web offers the benefit of quick submission to the particular area of the Office that
needs to act on the correspondence. Also, EFS-Web submissions are "soft scanned" (i.e.,
electronically uploaded) directly into the official file for the reexamination proceeding, which
offers parties the opportunity to review the content of their submissions after the "soft scanning"
process is complete ..
~
Any inquiry concerning this communication or earlier communications from the
Reexamination Legal Advisor or Examiner, or as to the status of this proceeding, should be
directed to the Central Reexamination Unit at telephone number (571) 272-7705.
IAlexander J Kosowskil
Primary Examiner, Art Unit 3992
YAH0000525584
64811
U.S. PTO
111111111111111111111111/11111111111111/1111111111
j ).61?4/10
Form PTO 1449
(Modified)
SHEET
U.S. OEPARTMENT OF COMMERCE
PATENT ANO TRADEMARK OFFICE
1
ATTY DOCKET NO.
4
CONTROL NO.
358121US91 RX
OF
90/010,856
INVENTOR
LIST OF REFERENCES CITED BY APPLICANT
Richard Michael NEMES
FILING DATE
GROUP
February 9, 2010
3992
u.s.
EXAMINER
INITIAL
DOCUMENT
NUMBER
PATENT DOCUMENTS
DATE
NAME
AA
5.701.432
12/23/1997
AB
4.695,949
09/22/1967
4.969,132
Pl/29/1991
4.996,663
P2/26/1991
Nemes
AE
5,043,885
06/27/1991
Robinson
AF
5,765,174
06/09/1998
Bishop
AG
5,778.430
07/07/1996
Ish, et al.
AH
5,991,775
11123/1999
Beardsley, et al.
AI
6,119,214
109/12/2000
Dirks
AJ
5,861.241
103/09/1999
Corbin
AK
6,243.667
106/05/2001
FILING DATE
IF APPROPRIATE
Mellender, et al.
AD
SUB
CLASS
Thatle.etal.
AC
CLASS
Kerr, et al.
Wong, et al.
Al
AM
AN
FOREIGN PATENT DOCUMENTS
DOCUMENT
NUMBER
DATE
TRANSLATION
COUNTRY
YES
NO
AO
AP
AQ
AR
AS
AT
AU
AV
OTHER REFERENCES (Including Author, Title, Date, Pertinent Pages, etc.)
Johnson. T. et al.; A Distributed, Replicated, Data-Balanced Search Structure; Pgs. 1-27
AW
Appel, A. W., et al.; Hash-consing Garbage Collection; Pgs. 1-18; 02/1993
AX
Bays, C.; Some Techniques for Structurin9 Chained Hash Tables; The Computer Journal; Vol. 16.; No.2; Pgs. 126-131;
AY
AZ
Examiner
04/1972
Bastani, F. B., et al.; Concurrent Maintenance of Data Structures in a
Distributed Environment; The Computer Journal; Vol. 31; No.2; 1986;
Pgs. 165-174
IAlexander Kosowski!
•
Additional References sheet{s) attached
Date Considered
01!05/2011
"Examiner: Initial if reference is considered, whether or not citation is in conformance with MPEP 609; Draw line through citation if not in
conformance and not considered. Include copy of this form with next communication to applicant.
ALL REFERENCES CONSIDERED EXCEPT WHERE LINED THROUGH, IAKI
YAH0000525585
SHEET
U.S. OEPARTMENT OF COMMERCE
PATENT ANO TRADEMARK OFFICE
Form PTO 1449
(ModifI8d)
.
2
OF
4
CONTROL NO.
AnY DOCKET NO.
358121 US91 RX
90/010,856
INVENTOR
LIST OF REFERENCES CITED BY APPLICANT
Richard Michael NEMES
GROUP
FILING DATE
February 9, 2010
3992
OTHER· REFERENCES (Including Author, Title, Date, Pertinent Pages. etc.)
AAA
Kruse, R. L., et al.; CD-ROM Prepared by Mailhot, P.A.; Prentice Hall- Data Structures and Program Design in C++; 2000;
717 Pgs.
Kirsch, A., et al; Hash-Based Techniques for High-Speed Packet Processing; Pgs. 1-40
AAB
/
Seligmann, J, el al.; Incremental Mature Garbage Collection Using the Train Algorithm; 1995; Pgs.
235~252
AAC
Bohannon, P., et al.; The Architecture of the Dali Main-Memory Storage Manager; 1997; Pgs. 115-151
AAD
Van Wyk, C. J., et al.; Algorithmica - The Complexity of Hashing with Lazy Deletion; 1986; Pgs. 17-29
AAE
Szymanski, T G., et al.; Special Feature: Goalie: A Space Efficient System for VLSI Artwork Analysis; 1985; Pgs. 64-72
AAF
van Rijsbergen, C. J.; Department of Computing Science - University of Glasgow; Information Retrieval; Pgs. 1-147
AAG
Jannick, J.; Sigmond Record, Vol. 24, No.1; Implementing Deletion in B+-Trees; 03/1995; Pgs. 33-38
AAH
Rusling; D. A.; The Linux Kernel; Version 0.8-3; Pgs. 1-176
AAI
AAJ
Chandranmenon, G. P.; et al.; IEEEIACM Transactions on Networking, Vol. 4, No.2; Trading Packet Headers for Packet
Processing; Pgs. 141-152; 1996
Ramakrishna, M. V.; Hashing in Practice, Analysis of Hashing and Universal Hashing; 1988; Pgs. 191-199
AAK
AAL
Varghese, G., et al.; Hashed and Hierarchical Timing Wheels: Data Structures for the Efficient Implementation of a Timer
FaCility; 1987; Pgs. 25-38
Waldvogel, M., et al.; Scalable High Speed IP Routing Lookups; 1997; Pgs. 25-36
AAM
AAN
Fagin, R., et al.; ACM Transactions on Database Systems, Vol. 4, No.3; Extendible Hashing - A Fast Access Method for
Dynamic Files; 09/1979; Pgs. 315-344
Schmidt, J. P., et al.; On Aspects of Universality and Performance for Closed Hashing; 1989; Pgs. 355-366
AAO
Larson, P. A; Algorithms and Data Structures; Dynamic Hash Tables, Volume 31, No.4; 04/1988; Pgs. 446-457
AAP
Chiang, K. W, et al.; Time Efficient VLSI Artwork Analysis Algorithms in GOALlE2; 1988; Pgs. 471-476
AAQ
Examiner
I
Date Considered
"Examiner: Initial if reference is considered, whether or not citation is in conformance with MPEP 609; Draw line through citation if not in
conformance and not considered. Include copy of this form with next communication to applicant.
ALL REFERENCES CONSIDERED EXCEPT WHERE LINED THROUGH. IAKI
YAH0000525586
SHEET
u.s. OEPARTMENT OF COMMERCE
PATENT AND TRADEMARK OFFICE
Form PTa 1449
(Modified)
ATTY DOCKET NO.
3
OF
4
CONTROL NO.
358121 US91 RX
90/010,856
INVENTOR
LIST OF REFERENCES CITED BY APPLICANT
Richard Michael NEMES
FILING DATE
GROUP
February 9,2010
3992
OTHER REFERENCES (Including Author, Title, Date, Pertinent Pages, etc.)
Maurer, W. D., et al.; Computing Surveys, Vol. 7, No.1; Hash Table Methods; 03/1975; Pgs. 5-19
AAA
AAB
Deutsch, L. P., et al.; Communications of the ACM, Vol. 19, No.9; An Efficient, Incremental, Automatic Garbage Collector;
09/1976; Pgs. 522-526
Graham, S. L., et al.; Communications of the ACM, Vol. 21, No.7; Pseudochaining in Hash Tables; 07/1978; Pgs. 554-557
AAC
AAD
Yao, A.; Journal of the Association for Computing Machinery, Vol. 28, No.3; Should Tables be Sorted?; 07/1981; Pgs. 615628
AAE
Karger, D., et al; Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the
World Wide Web; 1997; Pgs. 654-663
Celis, P., et al; Information Sciences 62, The Analysis of Hashing with lazy Deletions; 1992; Pgs. 13-26
AAF
Albers. S., et al.; Self-Organizing Data Structures; Pgs. 1·39
AAG
Seltzer, M.; A New Hashing Package for UNIX; Winter '91; Pgs. 173-184
AAH
Tamassia. R.; ACM Computing Surveys, Vol. 28, No.1; Data Structures; 03/1996; Pgs. 23-26
AAI
AAJ
Morrison, J. A" et al; SIAM J. Comp., Vol. 16, NO.6 - A Queuing AnalysiS of Hashing with lazy Deletion; 12/1987; Pgs.
1155-1164
Dietzfelbinger, M., et aI., Dynamic Perfect Hashing: Upper and lower Bounds, Revised Version; 01107/1990; Pgs. 1-33
AAK
AAl
Kenyon-Mathieu, C.M" et al.; General Methods for the Analysis of the Maximum Size of Dynamic Data Structures; Pgs. 473487
AAM
Mathieu, C. M., et al.; Rapports de Recherche N"851 , Maximum Queue Size and Hashing with lazy Deletion; 06/1988;
23 Pgs.
AAN
Aldous, D., et al.; SIAM J. Comp., Vol. 21, No.4, Maximum Size of a Dynamic Data Structure: Hashing with lazy Deletion
Revisited'; 08/1992; Pgs. 713-732
Printout - Ethernet Address ResolUtion Protocol; 7 Pgs.
AAP
AAQ
Examiner
Printout - Copyright (c) 1989, 1993· The Regents of University of California; Copyright (c) 1995· Paul Henning Kamp: 6
Pgs.
1
Date Considered
'Examiner: Initial if reference is considered, whether or not citation is in conformance with MPEP 609; Draw line through citation if not in
conformance and not considered. Include copy of this form with next communication to applicant.
ALL REFERENCES CONSIDERED EXCEPT WHERE LINED THROUGH. IAKI
YAH0000525587
SHEET
U.S. DEPARTMENT OF COMMERCE
PATENT AND TRADEMARK OFFICE
Fcnn PTO 1449
(Modified)
ATTY DOCKET NO.
4
OF
4
CONTROL NO.
90/010,856
358121US91RX
APPLICANT
LIST OF REFERENCES CITED BY APPLICANT
Richard Michael NEMES
FILING DATE
GROUP
3992
February 9,2010
OTHER REFERENCES (Including Author, Title, Date, Pertinent Pages, etc.)
Printout - Copyright (c) 1994 by Florian La Roche; Pgs. 1-20
AAA
Brown, E. W.; Execution Performance Issues in Full-Text Information Retrieval - Technical Report 95-81; 10/1995; 179 Pgs.
AAB
Costello, A. M., et al.; Redesigning the BSD Callout and TimerFacilities; 11102/1995; 12 Pgs.
AAC
Foster, J. M. - Senior Research Fellow, Dept. of Engineering, Aberdeen University; List Processing; 1967; 54 Pgs.
AAD
Printout - Wavelan Pcmcia driver, Jean II-HPLB '96; Pgs. 1-78
AAE
Van Wyk, C. J.; Data Structures & C Programs; 1988: 30 Pgs.
AAF
Sessions, R., Reusable Data Structures For C; 1989; 33 Pgs.
AAG
Frakes, W. B., et al.; Information Retrieval Data Structures & Algorithms, Chapter 13; 1992; Pgs. 293-305
AAH
Weiss, M. A.; Data Structures and Algorithm Analysis in C; 23 Pgs.
AAI
Keshav, S.; On the Efficient Implementation of Fair Queuing; Pgs. 1·20
AAJ
Kruse, R. L.; Data Structures and Program Design, 2'N Edition, Chapter 4; 1987, 1984; Pgs. 104·155
AAK
AAL
Varghese, G., et al.; Hashed and Hierarchical Timing and Wheels: Data Structures for the Efficient Implementation of a
Timer Facility; 1987; Pgs. 25·38
AAM
Xu, J.; IEEE Transactions on Computers, Vol. 51, No.9; Cost-Effective Flow Table' Designs for High-Speed Routers:
Architecture and Performance Evaluation; 09/2002; Pgs. 1089-1099
AAN
AAO
AAP
AAQ
Examiner
IAlexander Kosowskil
I
Date Considered
01/05/2011
-Examiner: Initial if reference Is considered, whether or not citation is in conformance with MPEP 609; Draw line through citation if not in
conformance and not considered. Include copy of this form with next communication to applicant.
ALL REFERENCES CONSIDERED EXCEPT WHERE LINED THROUGH. IAKI
YAH0000525588
Page 1 of 1
UNITED STATES PATENT AND TRADEMARK OFFICE
UNITED ST,\TES DEPARTMENT OF COMMERCE
United States Patent and Trademark Office
Address: COMMISSIONER FOR PATENTS
P.O. Box 1450
Alexandria. Virginia 22313·1450
www.uspto.gov
BIB DATA SHEET
CONFIRMATION NO. 3502
FILING or 371(c)
DATE
02/09/2010
SERIAL NUMBER
90/010,856
CLASS
GROUP ART UNIT
707
3992
ATTORNEY DOCKET
NO.
358121 US91 RX
J
RULE
APPLICANTS
5893120, Residence Not Provided;
Richard M. Nemes(OWNER), Brooklyn, NY;
NOVAK DRUCE & QUIGG LLP(3RD PTY REQ), Houston, TX;
Lissi M. Marquis, Houston, TX
** CONTINUING DATA *************************
This application is a REX of 08/775,864 01/02/1997 PAT 5,893,120
** FOREIGN APPLICATIONS *************************
** IF REQUIRED, FOREIGN FILING LICENSE GRANTED **
Foreign Priority claimed
35 USC 119(a-d)
Verified and
Acknowledged
0
conditi~t 0
Yes
Yes
l1J No
(tl No
o
Met after
Allowance
STATE OR
COUNTRY
SHEETS
DRAWINGS
InitIals
INDEPENDENT
CLAIMS
~
.,..,
Examine'!'!; Signathre
TOTAL
CLAIMS
4
I~
ADDRESS
OBLON, SPIVAK, MCCLELLAND MAIER & NEUSTADT, L.L.P.
1940 DUKE STREET
ALEXANDRIA. VA 22314
UNITED STATES
TITLE
METHODS AND APPARATUS FOR INFORMATION STORAGE AND RETRIEVAL USING A HASHING
TECHNIQUE WITH EXTERNAL CHAINING AND ON-THE-FLY REMOVAL OF EXPIRED DATA
10 All Fees
10 1.16 Fees (Filing)
FILING FEE FEES: Authority has been given in Paper
to charge/credit DEPOSIT ACCOUNT
RECEIVED No.
No.
for following:
2520
o 1.17 Fees (Processing Ext. of time)
01.18 Fees (Issue)
o Other
o Credit
BIB (Rev. 05/07).
YAH0000525589
Application/Control No.
90010856
II l1li1
II I
5893120
Examiner
Search Notes
Applicant(s)/Patent Under
Reexamination
Art Unit
ALEXANDER J KOSOWSKI
3992
SEARCHED
Class
I
Subclass
I
I
Date
I
I
Examiner
I
SEARCH NOTES
Search Notes
Date
Reviewed proposed prior art and patent prosecution history
Reviewed proposed prior art
Reviewed proposed prior art
Examiner
3/17/10
7/20/10
1/5/11
AJK
AJK
AJK
INTERFERENCE SEARCH
Class
I
I
u.s.
Patent and Trademark Office
Subclass
I
I
Date
I
Examiner
I
Part of Paper No. : 20101217
YAH0000525590
Application/Control No.
Reexamination
90010856
Certificate' Date
II II 1I11I1I1111
Applicant(s)/Patent Under
Reexamination
5893120
Certificate Number
(,.J...
Requester Correspondence Address:
D
Patent Owner
IZI
Third Party
NOVAK DRUCE & QUIGG, LLP
(NDQ REEXAMINATION GROUP)
1000 LOUISIANA STREET
FIFTY-THIRD FLOOR
HOUSTON, TX 77002
LlTIGA TION REVIEW
IZI
AJK
01/05/2011
(examiner initials)
(date)
Director Initials
Case Name
609-CV-269 (Bedrock Computer v. Softlayer Technologies)
/f5\(
kr 1Y
COPEN DING OFFICE PROCEEDINGS
TYPE OF PROCEEDING
NUMBER
1. None
U.S. Patent and Trademark Office
DOC. CODE RXFILJKT
YAH0000525591
Application/Control No.
90010856
5893120
Examiner
Art Unit
ALEXANDER J KOSOWSKI
Issue Classification
Applicant(s)/Patent Under Reexamination
3992
INTERNATIONAL CLASSIFICATION
ORIGINAL
CLASS
CLAIMED
SUBCLASS
G
999001
707
0
6
NON-CLAIMED
17 I 30 (2006.01.01)
F
CROSS REFERENCE(S)
SUBCLASS (ONE SUBCLASS PER BLOCK)
CLASS
707
999.1
~
999.101
999.202
999.206
E17.036
Claims renumbered in the same order as presented by applicant
Final
Original
Final
Original
Final
Original
Final
Original
D
Final
D
CPA
Original
Final
D
T.D.
Original
Final
R.1.47
Original
- - - - - - - --_.
Final
Original
-~
~~-~-
--
--
-
- - -- - - ------ ----
--~-
--
~--.---
--
-
NONE
Total Claims Allowed:
(Assistant Examiner)
12
(Date)
IALEXANDER J KOSOWSKII
Primary Examiner.Art Unit 3992
(Primary Examiner)
u.s.
Patent and Trademark Office
O.G. Print Claim(s)
(Date)
O.G. Print Figure
1
3
Part of Paper No. 20101217
YAH0000525592
Disclaimer: Justia Dockets & Filings provides public litigation records from the federal appellate and district courts. These filings and docket sheets should not be considered findings of fact or liability, nor do they necessarily reflect the view of Justia.
Why Is My Information Online?