Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-06-08
2009-12-08
Mofiz, Apu M (Department: 2161)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000, C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
07631001
ABSTRACT:
A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.
REFERENCES:
patent: 5287499 (1994-02-01), Nemes
patent: 5392390 (1995-02-01), Crozier
patent: 5394484 (1995-02-01), Casey et al.
patent: 5455901 (1995-10-01), Friend et al.
patent: 5546538 (1996-08-01), Cobbley et al.
patent: 5559897 (1996-09-01), Brown et al.
patent: 5588147 (1996-12-01), Neeman et al.
patent: 5600834 (1997-02-01), Howard
patent: 5710916 (1998-01-01), Barbara et al.
patent: 5806074 (1998-09-01), Souder
patent: 5911013 (1999-06-01), Taniishi
patent: 6240414 (2001-05-01), Beizer et al.
patent: 6292857 (2001-09-01), Sidoroff et al.
patent: 6377259 (2002-04-01), Tenev et al.
patent: 6442555 (2002-08-01), Shmueli et al.
patent: 6535897 (2003-03-01), Altman et al.
patent: 6603881 (2003-08-01), Perrone et al.
patent: 7016921 (2006-03-01), Berger
patent: 7085779 (2006-08-01), Holtz et al.
patent: 2001/0012401 (2001-08-01), Nagy
patent: 2002/0085002 (2002-07-01), Lamping et al.
patent: 2002/0133507 (2002-09-01), Holenstein et al.
patent: 2002/0191452 (2002-12-01), Fujihara
patent: 2003/0028851 (2003-02-01), Leung et al.
patent: 2006/0224610 (2006-10-01), Wakeam
“Robust Annotation Positioning in Digital Documents”, by: Gupta, Brush, Bargeron, and Cadiz, Published Sep. 22, 2000, ftp://ftp.research.microsoft.com/pub/tr/tr-2000-95.pdf.
H. Kitakami et al., “A Constraint Solver for Reconciling Heterogeneous Trees,” IC•AI '00 International Conference, 2000, pp. 1419-1425.
M. van Veller et al., “Methods in Vicariance Biogeography: Assessment of the Implementations of Assumptions 0, 1, and 2,” Cladistics 16, 2000, pp. 319-345.
V. V'yugin et al., “Tree Reconciliation: Reconstruction of Species Phylogeny by Phylogenetic Gene Trees,” Molecular Biology, vol. 36, No. 5, 2002, pp. 650-658.
H. Prodinger, “A q-Analog of the Path Length of Binary Search Trees,” Oct. 14, 1999, pp. 1-9.
R. Page, “Extracting Species Trees From Complex Gene Trees: Reconciled Trees and Vertebrate Phylogeny,” Molecular Phylogenetics and Evolution, vol. 14, No. 1, 2000, pp. 89-106.
M. van Veller et al., “A posteriori and a priori methodologies for testing hypotheses of causal processes in vicariance biogeography,” Willi Hennig Society, 2001, pp. 26.
A. Martin, “Choosing among Alternative Trees of Multigene Families,” Molecular Phylogenetics and Evolution, vol. 16, No. 3, 2000, pp. 430-439.
M.T. Hallett et al., “Efficient Algorithms for Lateral Gene Transfer Problems,” RECOMB, 2001, pp. 149-156.
R. Neininger, “On binary search tree recursions with monomials as toll functions,” Journal of Computational and Applied Mathematics, 2002, pp. 185-196.
M. Hofri et al., “Efficient Reorganization of Binary Search Trees,” Proceedings of the 2nd Italian Conference on Algorithms and Complexity, 1994, pp. 1-25.
M. Hallett et al., “New Algorithms for the Duplication-Loss Model,” RECOMB, 2000, pp. 138-146.
B. Ma et al., “From Gene Trees to Species Trees,” Second Annual International Conference on Computational Molecular Biology, 1998, pp. 1-29.
Hajime Kitakami et al., “Constraint Satisfaction for Reconciling Heterogeneous Tree Databases,” DEXA 2000, LNCS 1873, pp. 624-633.
Miklos Csuros, “Fast recovery of evolutionary trees with thousands of nodes,” Department of Computer Science, Yale University, 2002, 36 pages.
Ramachandran et al., “An Architecture for Ink Annotations on Web Documents,” Aug. 2003, vol. 1, pp. 256-260.
Gupta, et al., “Robust Annotation Positioning in Digital Documents,” Sep. 22, 2000, ftp://ftp.research.microsoft.com/pub/tr/tr-2000-95.pdf.
International Search Report, PCT/US03/26172, mailed Dec. 22, 2003.
Wilcox L et al Association for Computing Machinery: “Dynomite: a dynamically organized ink and audio notebook” CHI 97. Human Factors in Computing Systems. Atlanta, Mar. 22-27, 1997, Conference on Human Factors in Computing Systems, New York, ACM, US, Mar. 22, 1997, pp. 186-193.
Brad A Myers: “Using Handhelds Andpcs Together” Internet Citation, [Online] Nov. 2001, XP002351044 Retrieved from the Internet: URL:http://www.cs.cmu.edu/afs/cs.cmu.edu/project/pebbles/www/papers/pebblescacm.pdf> [retrieved on Oct. 26, 2005].
EP Search Report dtd Sep. 19, 2007, EP Appln. 03814403.
International Search Report, PCT/US03/26143, mailed Jun. 8, 2004.
International Search Report, PCT/US03/26171, mailed Feb. 27, 2004.
International Search Report, PCT/US03/26170, mailed Dec. 18, 2003.
Office Action dated Mar. 10, 2006 cited in U.S. Appl. No. 10/646,472.
Office Action dated Aug. 23, 2008 cited in U.S. Appl. No. 10/646,472.
Office Action dated Feb. 1, 2007 cited in U.S. Appl. No. 10/646,472.
Office Action dated Jul. 17, 2007 cited in U.S. Appl. No. 10/646,472.
Office Action dated Dec. 26, 2007 cited in U.S. Appl. No. 10/646,472.
Notice of Allowance dated Sep. 12, 2008 cited in U.S. Appl. No. 10/646,472.
Office Action dated Apr. 17, 2008 cited in U.S. Appl. No. 11/423,030.
Duncan Richard
Kannapel Timothy H.
Raghupathy Sashi
Sutanto Herry
Szilagyi Zoltan
Daye Chelcie
Microsoft Corporation
Mofiz Apu M
Workman Nydegger
LandOfFree
Electronic ink processing does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Electronic ink processing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Electronic ink processing will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4141188