UNITED STATES PATENT AND TRADEMARK OFFICE
`____________
`BEFORE THE PATENT TRIAL AND APPEAL BOARD
`____________
`ORACLE CORPORATION
`Petitioner
`v.
`CLOUDING IP, LLC
`Patent Owner
`____________
`Case IPR2013-00073 (JL)
`Patent 6,738,799
`____________
`
`REPLACEMENT COPY OF PATENT OWNER’S EXHIBIT 2007
`
`
`
`
`
`

`
`
`
`
`
`
`
`
`
`Exhibit List
`
`U.S. Patent 6,012,087 to Freivald et al.
`
`U.S. Patent 6,101,507 to Cane et al.
`
`Transcript of Deposition of Andrew Grimshaw, Ph.D.,
`May 29, 2013.
`
`Declaration of Wesley W. Chu, Ph.D.
`
`Excerpt from File Wrapper of U.S. Application
`10/452,156.
`
`Excerpt from File Wrapper of U.S. Application
`09/303,958.
`
`Declaration of Wesley W. Chu, Ph.D.
`
`
`
`ii  
`
`  
`
`2001
`
`2002
`
`2003
`
`2004
`
`2005
`
`
`2006
`
`
`2007
`
`
`
`
`
`  
`
`

`
`  
`
`
`
`Submitted herewith is a replacement copy of Patent Owner’s Exhibit
`
`2007. Subsequent to the filing of Exhibit 2007 on June 24, 2013, it was
`
`discovered that, through error and without deceptive intent, only the signature
`
`page of Dr. Chu’s Declaration had been uploaded though the Patent Review
`
`Processing System. This replacement copy of Exhibit 2007 is Dr. Chu’s
`
`declaration in its entirety.
`
`Petitioner Oracle Corporation has graciously stipulated to the filing of
`
`this replacement copy of Exhibit 2007 in support of the Patent Owner’s
`
`Motion to Amend. The Board granted leave to file this replacement copy of
`
`Exhibit 2007 during a conference call on July 2, 2013.
`
`
`
`For at least the foregoing reasons, entry of this replacement copy of
`
`Exhibit 2007 is respectfully requested.
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`
`Dated: July 3, 21013
`
`
`
`
`
`
`
`
`
`Fahmi, Sellers, Embert & Davitz
`84 W. Santa Clara St., Suite 550
`San Jose, CA 95113
`
`
`
`
`
`
`
`Respectfully submitted,
`/Tarek N. Fahmi/
`
`Tarek N. Fahmi
`Reg. No. 41,402
`
`Tel: 866-877-4883
`Fax: 408-773-6177
`Email: patents@fseip.com
`
`  
`
`1  
`
`

`
`UNITED STATES PATENT AND TRADEMARK OFFICE
`
`____________
`
`BEFORE THE PATENT TRIAL AND APPEAL BOARD
`
`____________
`
`ORACLE CORPORATION
`
`Petitioner
`
`v.
`
`CLOUDING IP, LLC
`
`Patent Owner
`
`____________
`
`Case IPR2013-00073
`
`Patent 6,738,799
`
`____________
`
`
`
`DECLARATION OF WESLEY W. CHU, PH.D.
`
`
`
`I, WESLEY W. CHU, Ph.D. declare:
`
`1.
`
`I am currently a Distinguished Professor (emeritus) at the
`
`University of California, Los Angeles (UCLA) within the Computer
`
`Science Department and have been since 2009. I have worked at the
`
`Computer Science Department of UCLA since 1969 in the following
`
`positions: Professor (since 1975); Department Chair (1988-91),
`
`  
`
`1  
`
`Clouding  Exhibit  2007  
`
`

`
`Distinguished Professor (since 1998), and Emeritus Distinguished
`
`Professor (since 2009).
`
`2.
`
`For more than 47 years, I have worked in the field of
`
`computer science, with a particular focus on distributed processing,
`
`computer networks, real-time distributed processing systems and
`
`distributed databases for 31 years (1969-2000).
`
`3. My pioneering work in file allocation and directory design for
`
`distributed databases aided the design and development of domain
`
`name servers for the web and current cloud computing systems. I
`
`was elected as an IEEE Fellow for these accomplishments.
`
`4.
`
`I am the sole author of a seminal publication in the
`
`distributed data base field entitled Optimal File Allocation in a
`
`Multiple Computer System.1 Additionally, I am an author or co-
`                                                                                                                
`1  W. W. Chu, Optimal File Allocation in a Multiple Computer
`
`author of more than 150 publications in the computer science field.
`
`System, IEEE Transactions on Computers, Vol. c-18, No. 10,
`
`October 1969, pp. 885-889.
`
`  
`
`  
`2  
`
`Clouding  Exhibit  2007  
`
`

`
`I have been an editor of three textbooks on information technology
`
`and am a co-author of a reference book about data mining. Below is
`
`a list of my publications that are most relevant topics at issue in this
`
`Inter Partes Review:
`
`a. Articles:
`
`i. Chu, W. W., M. T. Lan and J. Hellerstein,
`
`"Estimation of Intermodule Communication (IMC)
`
`and Its Application in Distributed Processing
`
`Systems", IEEE Transactions on Computers,
`
`August 1984, pp.691-699.
`
`ii. Chu, W. W. and K. K. Leung, "Task Response
`
`Time Model and Its Applications for Real-Time
`
`Distributed Processing Systems", Proceedings of
`
`the Real Time Systems Symposium, December
`
`1984, pp. 225-236.
`
`iii. Chu, W. W. and J. Hellerstein, "The Exclusive-
`
`  
`
`Writer Approach to Updating Replicated Files in
`
`  
`3  
`
`Clouding  Exhibit  2007  
`
`

`
`Distributed Processing Systems", IEEE
`
`Transactions on Computers, Vol. C-34, No. 6, pp.
`
`489-500, June 1985.
`
`iv. Jung Min An and Wesley W. Chu, “A Resilient
`
`Commit Protocol for Real Time Systems”
`
`Proceedings of the Real-time Systems Symposium,
`
`December 1985. pp. 25-29
`
`v. Wesley W. Chu and Jung M. An “ Fault tolerant
`
`Locking for Tightly Coupled Systems, Proceedings
`
`of the 5th Symposium on Reliability in
`
`Distributed Systems, Jan 13-15, 1986, Los Angeles,
`
`CA
`
`vi. Chu, W. W. and M. T. Lan, "Task Allocation and
`
`Precedence Relations for Distributed Real-Time
`
`Systems", IEEE Transactions on Computers, June
`
`1987, pp. 667-679.
`
`  
`
`  
`4  
`
`Clouding  Exhibit  2007  
`
`

`
`vii. Chu, W. W. and K. K. Leung, "Module Replication
`
`and Assignment for Real-Time Distributed
`
`Processing Systems", Special Issue on Distributed
`
`Data Bases, IEEE Proceedings, May 1987, pp. 547-
`
`562.
`
`viii. Chu, W. W. and C. M. Sit, "A Batch Service
`
`Scheduling Algorithm with Time-Out for Real-
`
`Time Distributed Processing Systems", 7th
`
`International Conference on Distributed
`
`Computing Systems, September 1987.
`
`ix. Chu, W. W., C. M. Sit and K. K. Leung, "Task
`
`Response Time for Real-Time Distributed Systems
`
`with Resource Contentions", IEEE Transactions
`
`on Software Engineering, October 1991.
`
`x. Bagrodia, R., W. W. Chu, L. Kleinrock, and G.
`
`Popek, "Vision, Issues, and Architecture for
`
`  
`
`  
`5  
`
`Clouding  Exhibit  2007  
`
`

`
`Nomadic Computing", IEEE Personal
`
`Communications, December 1995.
`
`xi. Chu, W. W., "Optimal File Allocation in Multiple
`
`Computer Systems", IEEE Transaction on
`
`Computers, October 1969, pp. 885-889.
`
`xii. Chu, W. W., "Performance of File Directory
`
`Systems for Data Bases in Star and Distributed
`
`Networks", AFIPS Conf. Proc., Volume 45, pps.
`
`577-587, June 1976.
`
`xiii. Chu, W. W. and P. Hurley, "Optimal Query
`
`Processing for Distributed Database Systems",
`
`IEEE Transactions on Computers, September
`
`1982, pp. 835-850.
`
`xiv. Chu, W. W. and I. T. Ieong, "A Transaction-Based
`
`Approach to Vertical Partitioning for Relational
`
`Database Systems", IEEE Transactions on
`
`  
`
`Software Engineering, August 1993, pp. 804-812.
`
`  
`6  
`
`Clouding  Exhibit  2007  
`
`

`
`b. Books, Chapters in Books, Editorships:
`
`i. Jianming He and Wesley W. Chu. "Design
`
`Considerations for a Social Network Based
`
`Recommender System". Community-Built
`
`Databases: Research and Development, 2011
`
`ii. Jianming He and Wesley W. Chu. "Protecting
`
`Private Information in Online Social Networks"
`
`Chapter 14 in Intelligence and Security
`
`Informatics (edited by H. Chen and C.C. Yang),
`
`SCI 135, pp. 249-273, 2008.
`
`iii. Yu Chen and Wesley W. Chu. "Protection of
`
`Database Security via Collaborative Inference
`
`Detection" Chapter 15 in Intelligence and Security
`
`Informatics (edited by H. Chen and C.C. Yang),
`
`SCI 135, pp. 275-303, 2008.
`
`iv. Wesley W. Chu, Victor Liu, Wenlei Mao and
`
`  
`
`Qinghua Zou "KMeX: A Knowledge-based Digital
`
`  
`7  
`
`Clouding  Exhibit  2007  
`
`

`
`Library or retrieving Scenario-specific Medical
`
`Text Documents" Chapter 14 in Biomedical
`
`Information Technology, (edited by D. Feng)
`
`Elsevier Academic Press Series in Biomedical
`
`Engineering, 2008.
`
`v. Wesley W. Chu and S. Liu. " Cooperative XML
`
`(CoXML) Query Answering". B. Wah, ed.
`
`Encyclopedia of Electrical and Electronic
`
`Engineering, John Wiley & Son, Inc., Dec. 2007.
`
`vi. Zou, Q., Y. Chen, W.W.Chu, X. Lu. "Mining
`
`Association Rules from Tabular Data Guided by
`
`Maximal Frequent Itemsets", in Foundations and
`
`Advances in Data Mining. Chu, W.W. and T.Y.
`
`Lin, eds. Springer, 2005.
`
`vii. Chu, W. W. and T.Y. Lin, Editors. Foundations
`
`and Advances in Data Mining." Springer, 2005.
`
`5.
`
`  
`
`I am an inventor for seven US Patents:
`
`  
`8  
`
`Clouding  Exhibit  2007  
`
`

`
`a. “System and Methods for Evaluating Inferences for
`
`Unknown Attributes in a Social Network” U.S. Patent
`
`No. 8,160,993 April 17,2012, Lead inventor, Wesley W.
`
`Chu.
`
`b. “System and Method for Retrieving Scenario Specific
`
`Documents” U.S. Patent No. 7, 548,910, June 2009, Lead
`
`inventor, Wesley W. Chu.
`
`c. “Database Event Detection and Notification System
`
`Using Type Abstraction Hierarchy (TAH)” U.S. Patent
`
`No. 6,247,146, July 2002.
`
`d. “Database System with query relaxation using Type
`
`Abstraction Hierarchy (TAH) as Query Condition
`
`Relaxation Structure” U.S. Patent No. 6,427,146, Sept
`
`1999.
`
`e. “Statistical Multiplexing Systems for Computer
`
`Communications,” U.S. patent number 4,082,922, April
`
`  
`
`1978; US Patent No. 4,093,823, June 1978.
`
`  
`9  
`
`Clouding  Exhibit  2007  
`
`

`
`f. “Multi-access Memory Module for Data Processing
`
`System,” (co-invented with P. Korff), U.S. Patent No.
`
`4,109,719, August 1978.
`
`g. “Multiplexed MOS Multi-accessed Memory System” (co-
`
`invented with D. Hibbits), U.S. Patent No. 4,415,991,
`
`November 1983.
`
`6.
`
`I have received numerous awards from the IEEE and was
`
`awarded a Life Fellowship in 2004.
`
`7.
`
`I earned my B.S. and M.S. in electrical engineering from the
`
`University of Michigan in 1960 and 1961, respectively and my Ph.D.
`
`in electrical engineering from Stanford University in 1966.
`
`8.
`
`A copy of my curriculum vitae, which details my experience
`
`that is relevant to these proceedings, is attached to this Declaration
`
`as Appendix A.
`
`9.
`
` I have read and understood U.S. Patent 6,739,799 (the ‘799
`
`patent) as well as Oracle Corporation’s Petition for Inter Partes
`
`Review and the exhibits cited therein, including Dr. Grimshaw’s
`
`  
`
`  
`10  
`
`Clouding  Exhibit  2007  
`
`

`
`Declaration, the Patent Owner’s Preliminary Response, the Patent
`
`Trial and Appeal Board’s Decision Instituting the Inter Partes
`
`Review proceeding, and the transcript of Dr. Grimshaw’s
`
`deposition, taken May 29, 2013. I have also reviewed and agree with
`
`the rationale set forth in the Patent Owner’s Contingent Motion to
`
`Amend.
`
`
`
`I. State of the Art at the Time of the ‘799 Patent.
`
`10.
`
`In 1996, Trigdale and Mackerras reported on the rsync
`
`algorithm; a mechanism for updating a file on one computer to be
`
`identical to a file on another computer. Andrew Trigdale and Paul
`
`Mackerras, “The rsync algorithm”, The Australian National
`
`University Joint Computer Science Technical Report Series, TR-
`
`CS-95-05 (June 1996) (Appendix A-6 to Oracle Ex. 1007). To
`
`accommodate low-bandwidth communication links connecting the
`
`two computers, rsync identified portions of the file that were the
`
`same on each computer and exchanged only differences
`
`  
`
`  
`11  
`
`Clouding  Exhibit  2007  
`
`

`
`therebetween. Id. at p. 1. To identify the differences between the
`
`files, rsync requires a receiving computer to send a transmitting
`
`computer, representations of blocks of the version of the file stored
`
`by the receiving computer. The transmitting computer compares
`
`these representations to representations of blocks of the file stored
`
`by the transmitting computer. Based on these comparisons, the
`
`transmitting computer sends the receiving computer those blocks of
`
`its file that did not have matching blocks in the receiving
`
`computer’s version of the file along with information for how to
`
`merge those blocks into the receiving computer’s version of the file.
`
`Id. at p. 2. For blocks where the transmitting computer did find a
`
`match in the receiving computer’s version of the file, the
`
`transmitting computer sends references to those blocks to the
`
`receiving computer. Id. The receiving computer uses its version of
`
`the file along with the references to matching blocks, raw missing
`
`blocks, and instructions for merging the raw missing blocks sent by
`
`the transmitting computer to updates its copy of the file. Id. at pp.
`
`1-2.
`
`  
`
`  
`12  
`
`Clouding  Exhibit  2007  
`
`

`
`
`
`II. Overview of U.S. Patent 6,738,799.
`
`11. U.S. Patent 6,738,799 (the “’799 Patent”) (Oracle Ex. 1001)
`
`describes systems and methods for generating update files that
`
`permit a computer to generate a current version of a file from a copy
`
`of an earlier version thereof. Ex. 1001 at Abstract; 3:45-49. To
`
`facilitate this process, files are segmented and each segment is
`
`represented by a signature. Id. at 8:7 et seq. Signatures are
`
`representations of variable length segments of a subject file, which
`
`representations serve to identify the segments from which they are
`
`determined. Id. at Fig. 4; 8:18-20, 29-54. One example of a signature
`
`list provided in the ‘799 Patent is a table of hashes. Id. at col. 8:20-
`
`28.
`
`12. The process taught in the ‘799 Patent makes use of the
`
`signatures to determine whether a file has been modified. By
`
`comparing an earlier version of a signature list (representing an
`
`earlier version of a subject file) to a signature list that corresponds
`
`  
`
`  
`13  
`
`Clouding  Exhibit  2007  
`
`

`
`to a current version of the file, differences between the current and
`
`former versions of the file can be readily
`
`determined. See, e.g., id. at col. 10:5-14.
`
`Based on these differences, an update file is
`
`constructed. Id. at col. 10:66 – 11:50. The
`
`update file includes instructions (e.g., copy,
`
`insert) for a recipient computer to construct the current version of
`
`the subject file from its earlier copy thereof and data included in the
`
`update file. Id. and see Fig. 11.   Once created, the update file can be
`
`provided to the recipient computer, for example via email. Id. at
`
`11:51-52.
`
`13. Unlike the rsync algorithm, the process described and claimed
`
`in the ‘799 Patent allows one computer to determine whether a
`
`second computer has a latest version of a file and, if not, to generate
`
`an update file without interaction with the second computer. See,
`
`e.g., Id. at 18:32-39.
`
`
`
`  
`
`  
`14  
`
`Clouding  Exhibit  2007  
`
`

`
`III. Materials and information Provided To Me.
`
`14.
`
`I am advised that in proceedings before the USPTO, the
`
`claims of an unexpired patent are to be given their broadest
`
`reasonable interpretation in view of the specification from the
`
`perspective of one of ordinary skill in the art. I have been informed
`
`that the ’799 Patent has not expired. Therefore, in comparing the
`
`claims of the ’799 Patent to the cited references, I have given the
`
`claims their broadest reasonable interpretation in view of the
`
`specification from the perspective of one of ordinary skill in the art.
`
`15.
`
`I have been informed that “a person of ordinary skill in the
`
`art” is a hypothetical person to whom an expert in the relevant field
`
`could assign a routine task with reasonable confidence that the task
`
`would be successfully carried out. I have been informed that the
`
`level of skill in the art may be evidenced by references published at
`
`or around the time of the filing of the patent under consideration.
`
`In performing my analysis I have applied the level of ordinary skill
`
`in the art based upon such information as well as my experience
`
`and knowledge in the relevant field.
`
`  
`
`  
`15  
`
`Clouding  Exhibit  2007  
`
`

`
`16. Based on my experience, I have an understanding of the
`
`capabilities of a person of ordinary skill in the relevant art. I have
`
`supervised and directed many such persons over the course of my
`
`career. Further, I had those capabilities myself at the time the
`
`patent was filed.
`
`17.
`
`I am informed that the ‘799 Patent was filed on June 2, 2003,
`
`as a continuation of Application No. 09/303,958, filed May 3, 1999.
`
`Thus a reference qualifies as prior art only if it disclosed or
`
`suggested the claimed invention of the ‘799 Patent prior to May 3,
`
`1999.
`
`18.
`
`I am advised that claims may be found unpatentable as
`
`anticipated if a single prior art reference discloses each limitation of
`
`the claim, either expressly or inherently. I understand a limitation to
`
`be inherently disclosed only if it is necessarily present in the
`
`reference.
`
`19.
`
`I am advised that a patent claim can be found unpatentable as
`
`obvious where the differences between the subject matter of the
`
`  
`
`  
`16  
`
`Clouding  Exhibit  2007  
`
`

`
`claim and the prior art are such that the subject matter as a whole
`
`would have been obvious at the time the invention was made to a
`
`person having ordinary skill in the art. I understand that an
`
`obviousness analysis involves a consideration of (1) the scope and
`
`content of the prior art; (2) the differences between the claimed
`
`invention and the prior art; (3) the level of ordinary skill in the
`
`pertinent field; and (4) secondary considerations of obviousness.
`
`
`
`IV. Discussion of the Cited References and Patent Owner’s
`
`Proposed Contingent Amendments.
`
`20.
`
`I understand that the Patent Owner is proposing substitute
`
`claims for original Claims 1, 5-10, 23, 24 and 37, and that these
`
`substitutions are strictly contingent on the Board finding each
`
`respective original independent claim unpatentable,
`
`21.
`
`I further understand that Proposed Substitute Claim 47 and
`
`Proposed Substitute Claim 54 recite all of the limitations of original
`
`  
`
`  
`17  
`
`Clouding  Exhibit  2007  
`
`

`
`Claim 1 and original Claim 23, respectively, and narrow those
`
`features by adding a limitation concerning how the delimiters of the
`
`file segments are determined. Specifically, the proposed substitute
`
`claims each recite, “wherein ends of each of the second plurality of
`
`file segments are determined by segment delimiters that are
`
`statistically determined to be optimal division points for the
`
`segments”.
`
`22.
`
`I also understand that Proposed Claim 56 recites all of the
`
`limitations of original Claim 37 and specifies, “determining whether
`
`the second computer has a latest version of a file, wherein said
`
`determining is performed by the first computer without interaction
`
`with the second computer by comparing representations of
`
`segments of the latest version of the file with representations of
`
`segments of an earlier version of the file in which ends of each of
`
`the segments of the earlier version of the file are defined by
`
`segment delimiters that are statistically determined to be optimal
`
`division points for the segments”.
`
`23. A person of ordinary skill in the art would understand the new
`
`  
`
`  
`18  
`
`Clouding  Exhibit  2007  
`
`

`
`features of Proposed Substitute Claims 47, 54 and 56 to mean that a
`
`statistical procedure is used to determine optimal locations for file
`
`segment delimiters. In the context of a process for enabling a first
`
`computer to generate an update for transmission to a second
`
`computer that permits the second computer to generate a copy of a
`
`current version of a file comprised of a first plurality of file
`
`segments from a copy of an earlier version of the file comprised of a
`
`second plurality of file segments, to my knowledge, this use of
`
`variable length file segments, where ends of each of the second
`
`plurality of file segments are determined by segment delimiters that
`
`are statistically determined to be optimal division points for the
`
`segments, was not previously known in the art at the time of the
`
`invention of the ‘799 Patent.
`
`24. Likewise, in the context of method for a first computer to
`
`provide updates for transmission to a second computer that permits
`
`the second computer to obtain most recent versions of files, to my
`
`knowledge, determining whether the second computer has a latest
`
`version of a file, wherein said determining is performed by the first
`
`  
`
`  
`19  
`
`Clouding  Exhibit  2007  
`
`

`
`computer without interaction with the second computer by
`
`comparing representations of segments of the latest version of the
`
`file with representations of segments of an earlier version of the file
`
`in which ends of each of the segments of the earlier version of the
`
`file are defined by segment delimiters that are statistically
`
`determined to be optimal division points for the segments was not
`
`previously known in the art at the time of the invention of the ‘799
`
`Patent.
`
`25.
`
`In my view then, the closest prior art to the inventions recited
`
`in Proposed Substitute Claims 47, 54 and 56 are various ones of
`
`references cited by the Petitioner in these proceedings. I discuss
`
`these references in the context of the Proposed Substitute Claims
`
`below.
`
`26. U.S. Patent 6,233,589, to Balcha et al. (“Balcha”) (Oracle Ex.
`
`1003) relates generally to the backup and synchronization of files,
`
`and in particular relates to a method and system for reflecting
`
`differences between two files (a base file and a revised file). Ex. 1003
`
`at 1:5-7. The differences between the two files are reflected in a
`
`  
`
`  
`20  
`
`Clouding  Exhibit  2007  
`
`

`
`delta file and the delta file is created based on a comparison of a
`
`base signature file (which represents the base file), a revised
`
`signature file (which represents the revised file) and the revised file
`
`itself. Id. at 7:46 – 8:6. To determine the signature files, Balcha
`
`teaches the use of fixed size segments. Ex. 1001 at 6:32-33. Fixed
`
`size segments would not have delimiters at locations statistically
`
`determined to be optimal division points for the segments.
`
`27. Freivald, U.S. Patent 5,898,836 (Ex. 1005) describes a
`
`subscription service in which users that wish to be notified of
`
`changes to Web pages (e.g., when information thereon is updated),
`
`“register” those pages and an associated subscription server (or
`
`“minder”) periodically checks to see if the registered Web pages
`
`have changed since the such check. Upon detecting any changes,
`
`the server notifies the user that registered the subject page by way
`
`of email. Ex. 1005. at FIGs. 2-4; col 5, ll. 24-29. In an enhanced
`
`version of the service, users are allowed to specify portions of
`
`interest of Web pages so that they receive notices only when those
`
`portions of interest have changed. Id. at col. 7, ll. 3-54.
`
`  
`
`  
`21  
`
`Clouding  Exhibit  2007  
`
`

`
`28. Even if one interprets the email messages with attached Web
`
`pages as “updates”, Freivald teaches the use of segments delimited
`
`by HTML codes. Id. at 9:47-52. Segments having delimiters that
`
`depend on the presence of HTML tags would not correspond to
`
`delimiters at locations statistically determined to be optimal division
`
`points for the segments.
`
`29. Williams, U.S. Patent 5,990,810 (Ex. 1006), describes a fine-
`
`grained incremental backup system that includes two entities, (e.g.,
`
`two computers on a network) E1 and E2, that wish to repeatedly
`
`backup a file, X, as modified and stored on E1. “Each time E1
`
`performs a backup operation, it partitions X into subblocks and
`
`writes the hashes of the subblocks to a shadow file S. Ex. 1006 at
`
`19:35-37. When X is modified, the hash S will only correspond to
`
`the previously saved version of X, which Williams refers to as “Y.”
`
`In connection with the backup process, Wiliams teaches the use of
`
`variable length segments, id. at 12:6-9, but does not suggest that the
`
`variable lengths be statistically determined to be optimal division
`
`points for the segments.
`
`  
`
`  
`22  
`
`Clouding  Exhibit  2007  
`
`

`
`30. Accordingly, none of the closest known prior art references,
`
`whether considered separately or in combination, teach or suggest
`
`the subject matter of Proposed Claims 47, 54 and 56.
`
`31.
`
`For my efforts in connection with the preparation of this
`
`declaration I have been compensated at my regular hourly rate for
`
`this type of consulting activity. My compensation is in no way
`
`dependent or contingent upon the outcome of these proceedings or
`
`any other proceedings relating to the subject ‘799 Patent.
`
`32.
`
`I hereby declare that all statements made of my own
`
`knowledge are true and all statements made on information are
`
`believed to be true and further that the statements were made with
`
`the knowledge that willful false statements and the like so made are
`
`punishable by fine or imprisonment or both under § 1001 of Title
`
`lil of the United States Code, and that such willful false statements
`
`may jeopardize the Validity of this patent.
`
`Date:
`
`‘7 l ‘3
`
`Q‘ L(’§“r
`
`Wesley W. Chu, Ph.D.
`
`7'2
`
`(‘lnnrlina Fvhihif 7007
`
`

`
`
`
`APPENDIX A
`APPENDIX A
`
`

`
`WESLEY W. CHU
`
`
`Computer Science Department
`University of California, Los Angeles (UCLA)
`3731 Boelter Hall
`Los Angeles, CA 90095
`wwc@cs.ucla.edu
`http://www.cs.ucla.edu/~wwc
`
`  
`
`
`
`Biography
`
`Dr. Wesley W. Chu is a Distinguished Professor (emeritus) at the University of
`California, Los Angeles. His academic background includes B.S. and M.S. degrees (EE)
`from the University of Michigan, and a Ph.D. (EE) from Stanford University.
`Early in his career, Dr. Chu worked on the design of large-scale computers at IBM; this
`was followed by a three-year stint at Bell Laboratories and a focus on computer
`communications and distributed databases. He joined the faculty of UCLA in 1969 and
`later served as department chair for three years. Dr. Chu is the author or coauthor of more
`than 150 articles, an editor of three textbooks on information technology, and the co-
`editor of a reference book on data mining.
`
`Early in his career, Dr. Chu's research focus was on computer communication and
`networks, distributed databases, memory management, real-time distributed processing
`systems, and statistical multiplexing - the latter contributing to the development of ATM
`networks. His pioneering work in file allocation and directory design for distributed
`databases aided the design and development of domain name servers for the web and
`current cloud computing systems. Dr. Chu was named an IEEE Fellow for his
`contributions in these areas.
`
`Over the past two decades, Dr. Chu's research interests evolved to include intelligent
`(knowledge-based) information systems and knowledge acquisition for large information
`systems. Using his methodology for relaxing query constraints, he led the development of
`CoBase, a cooperative database system for structured data, and KMed, a knowledge-
`based multimedia medical image system.
`
`Under the KMed project, a Medical Digital Library was developed that provides
`approximate content-matching and navigation; the library will serve as a cornerstone for
`future paperless hospitals. In recent years, Dr. Chu also worked on inference techniques
`for data security and privacy protection (ISP) and social network-based recommender
`system (SNRS).
`
`Together with his students, Dr. Chu has received numerous best paper awards at
`conferences and workshops, and also a certificate of merit for work on the Medical
`
`1  
`
`  
`
`

`
`Digital Library system. He is the recipient of the IEEE Computer Society's Technical
`Achievement Award for contributions to intelligent information systems.
`
`Service to the technology community has been a significant factor in Dr. Chu's career:
`ACM SIGCOMM chairman for three years; associate editor for IEEE Transactions on
`Computers for Computer Networking and Distributed Processing Systems for four years;
`chair, co-chair or technical chair of numerous workshops and conferences on systems
`management, data communications, very-large databases, information knowledge sharing,
`and entity relationships. For his services to IEEE, he received both a meritorious award
`and a certificate of appreciation.
`
`Education
`University of Michigan Electrical Engineering B.S. 1960
`University of Michigan Electrical Engineering M.S. 1961
`Stanford University Electrical Engineering Ph.D. 1966
`
`Academic Appointment
`Computer Science Department
`University of California, Los Angeles
`
`1969 to present: Professor (since 1975); Department Chair (1988-91), Distinguished
`Professor (since 1998). Emeritus distinguished professor (sine 2009)
`Industrial Experience
` 1995-2005 Xerox Corporation
` El Segundo, CA
` Consultant, Fault tolerant computing, design and develop word
` processing systems.
`
`
`1985-1988 Unisys SDC Corp,
` Huntsville, Alabama
` Consultant, Design and develop of a real time distributed data base
`system for missile defense applications
`
`
`
`  
`
`
`1983--1986 Titan Systems Inc,
` Inglewood, CA
` Consultant, Develop, evaluate and validate for the SENTRY
`Distributed Data Base System
`
`
`1982-1984 Western Union Corporation
` Upper Saddle River, NJ
`
`2  
`
`

`
`Executive Consultant to VP Engineering and Member of the
`Technical Review Board. Duties include:
`Evaluate and plan for the Western Union Packet Switched Network,
`Easylink, and other value added services.
`Develop transition plans for network modernization, integration with
`existing networks and for future network growth.
`Critique on going and proposed enhancement plans and compare with
`other viable alternatives for effectiveness.
`
`1966-1969 Bell Telephone Laboratories
` Holmdel, NJ
`Member of Technical Staff. Research on computer communications
`and file allocations in distributed data base systems.
`
` 1964-1966 IBM
`San Jose, California,
`Engineer. Simulation of magnetic memory systems. Logical design of
`computers.
`
` 1961-1962 GE (now Honeywell) Computer Department
`Phoenix, Arizona
`Electronic engineer. Design of electronic switching circuits for
`computers.
`
`
`
`Selected Publications
`
`Social Network Based Recommender System
`Jianming He and Wesley W. Chu. "A Social Network Based Recommender System".
`Annals of Information Systems: Special Issue on Data Mining for Social Network Data
`(AIS-DMSND), 2010.
`
`Security and Privacy
`Y. Chen and W. W. Chu "Protection of Database Security via Collaborative Inference
`Detection" In IEEE Transactions on Knowledge and Data Engineering (TKDE), Special
`Issue on Intelligence and Security Informatics, Vol 20, No 8, August 2008, PP.1013-1027
`
`J. He, W. W. Chu and Z. Liu "Inferring Privacy Information from Social Networks", In
`Proc. of IEEE Intelligence and Security Informatics Conference (ISI 2006), San Diego,
`California, USA, May 2006.
`
`Y. Chen and W. W. Chu "Database Security Protection via Inference Detection", In
`Proc. of IEEE Intelligence and Security Informatics Conference (ISI 2006), San Diego,
`California, USA, May 2006.
`
`
`3  
`
`  
`
`

`
`
`
`Intelligent Information Systems
`
`Sanghyun Park, S-W Kim and Wesley W. Chu. "SBASS: Segment Based Approach for
`Subsequence Search in Sequence Databases" In International Journal of Computer
`Science & Engineering, 2007
`
`Shaorong Liu and Wesley W. Chu. "CoXML: A Cooperative XML Query Answering
`System" In the 8th International Conference on Web-Age Information Management, 2007
`
`Weslely W Chu and Shaorong Liu. "CoXML: Cooperative XML Query Answering" In
`The Encyclopedia of Computer Science and Engineering, Edit by B. Wah, John Wiley &
`Sons, Inc, 2007
`
`Shaorong Liu, Wesley W. Chu, and Ruzan Shahinian. "Vague Content and Structure
`(VCAS) Retreival for Document-centric XML Collections". In WebDB (in conjunction
`with SIGMOD), 2005.
`
`S. Liu, W. W. Chu and R. S. Shahinian "Vague Content and Structure (VCAS) Retreival
`for Document-Centric XML Collections", In Proc. of the Eighth International Workshop
`on the Web and Databases (WebDB), Baltimore, Maryland, USA, June 2005.
`
`Zou, Q., S. Liu, and W. W. Chu "Using a Compact Tree to Index and Query XML
`Data", Proceedings of the Conference on Information and Knowledge Management
`(CIKM), 2004.
`
`Liu, S., Q. Zou and W. W. Chu "Configurable Indexing and Ranking for XML
`Information Retrieval", ACM Proceeding of Special Interest Group on Information