Appeal No. 2002-0288
Application No. 08/883,241
levels, the tree structure having a highest node level, the
method comprising:
designating one of the nodes in the tree structure as a root
node;
designating a deepest node level of the tree structure, the
deepest node level being the same as or below the level of the
root node; and
downloading, into the memory of the local computer system,
documents in the nodes on levels that are in and between the root
node and the node at the deepest node level.
The examiner relies on the following references:
Sanderman 5,794,006 Aug. 11, 1998
(filed Aug. 18, 1995)
Anderson 5,825,363 Oct. 20, 1998
(filed May 24, 1996)
Leshem et al. (Leshem) 5,870,559 Feb. 9, 1999
(filed Apr. 11, 1997)
Hughes et al. (Hughes) 5,892,908 Apr. 6, 1999
(filed Sep. 10, 1996)
Claims 1-26 stand rejected under 35 U.S.C. § 103. As
evidence of obviousness, the examiner cites Sanderman and Hughes
with regard to claim 1, adding Leshem with regard to claims 2-8
and further adding Anderson with regard to claims 9-26.
Reference is made to the brief and answer for the respective
positions of appellants and the examiner.
OPINION
In rejecting claims under 35 U.S.C. § 103, it is incumbent
-3–
Page: Previous 1 2 3 4 5 6 7 8 9 10 11 12 Next
Last modified: November 3, 2007