Data processing: artificial intelligence – Knowledge processing system
Reexamination Certificate
2006-11-16
2010-02-16
Vincent, David R (Department: 2129)
Data processing: artificial intelligence
Knowledge processing system
Reexamination Certificate
active
07664719
ABSTRACT:
Methods of analyzing data are provided. An expert system receives input from at least a first source. Data is imported and analyzed by an expert system, wherein the expert system makes at least one first decision, which characterizes the data based on a rule base. The at least one first decision is displayable and modifiable by a first input from a first source. In response to the first input from the first source, the rule base may be re-applied to make at least one second decision, wherein the at least one second decision is different from the at least one first decision, or the at least one first decision may be accepted. The at least one first decision or the at least one second decision is then displayable and modifiable in response to a first input from a second source. In response to the first input from the second source, the rule base is either re-applied to make at least one third decision, wherein the third decision is different from the second decision, or either the first or second decisions are accepted.
REFERENCES:
patent: 5121443 (1992-06-01), Tomlinson
patent: 5161204 (1992-11-01), Hutcheson et al.
patent: 5273632 (1993-12-01), Stockham et al.
patent: 5325466 (1994-06-01), Kornacker
patent: 5374527 (1994-12-01), Grossman
patent: 5442562 (1995-08-01), Hopkins et al.
patent: 5470710 (1995-11-01), Weiss et al.
patent: 5541067 (1996-07-01), Perlin
patent: 5559940 (1996-09-01), Hutson
patent: 5580728 (1996-12-01), Perlin
patent: 5759369 (1998-06-01), Menchen et al.
patent: 5761685 (1998-06-01), Hutson
patent: 5813005 (1998-09-01), Tsuchida et al.
patent: 5876933 (1999-03-01), Perlin
patent: 5884320 (1999-03-01), Agrawal et al.
patent: 5926812 (1999-07-01), Hilsenrath et al.
patent: 6026397 (2000-02-01), Sheppard
patent: 6054268 (2000-04-01), Perlin
patent: 6100901 (2000-08-01), Mohda et al.
patent: 6122628 (2000-09-01), Castelli et al.
patent: 6134541 (2000-10-01), Castelli et al.
patent: 6438499 (2002-08-01), Hayashi
patent: 6490582 (2002-12-01), Fayyad et al.
patent: 6598054 (2003-07-01), Scheutze et al.
patent: 6741983 (2004-05-01), Birdwell et al.
patent: 6750011 (2004-06-01), Perlin
patent: 6807490 (2004-10-01), Perlin
patent: 2002/0086289 (2002-07-01), Straus
patent: 2002/0116135 (2002-08-01), Pasika et al.
patent: 2002/0152035 (2002-10-01), Perlin
patent: 2003/0081102 (2003-05-01), Roztocil
patent: 2003/0134320 (2003-07-01), Barrus et al.
patent: 2003/0143554 (2003-07-01), Berres et al.
patent: 2003/0225530 (2003-12-01), Lowe et al.
patent: 2004/0215401 (2004-10-01), Krane et al.
patent: 2006/0178762 (2006-08-01), Wroblewski et al.
patent: 2007/0018984 (2007-01-01), Sauvageau
patent: 2008/0154517 (2008-06-01), Barrus et al.
patent: 99/53423 (1999-10-01), None
patent: 9953423 (1999-10-01), None
Novel algorithm for automated genotyping of microsatellites, Toshiko Matsumoto, Wataru Yukawa, Yasuyuki Nozaki, Ryo Nakashige, Minori Shinya,1,3 Satoshi Makino,3 Masaru Yagura,3 Tomoki Ikuta,1,3 Tadashi Imanishi,4 Hidetoshi Inoko,1,3,4 Gen Tamiya,1,3 and Takashi Gojobori, Nucleic Acids Res. 2004; 32(20): 6069-6077. Published online 2004 Nov. 1.
Thomas H. Cormen, et al., “Introduction to Algorithms,” MIT Press (Cambridge, MA)/McGraw-Hill (New York), 1990.
A. Guttman, “R trees: a dynamic index structure for spatial searching,” ACM, 1984, 47-57.
T. Sellis, et al., “The R*-tree: a dynamic index for multi-dimensional objects,” Tech. Rept. UMI-ACS TR 87 3, CSS TR 1975, University of Maryland, Feb. 1987, 1-24.
Robert C. Holte, “Very Simple Classification Rules Perform Well on Most Commonly Used Datasets,” Machine Learning, II, 1993, pp. 63-90.
Juha Karhunen et al., “Locally Linear Independent component analysis,” International Joint Conference on Neural Networks, 1999, vol. 2, pp. 882-887.
Message Passing Interface Forum, MPI: A Message-Passing Interface Standard, version 1.1, Jun. 1995. Also at http://www-unix.mcs.anl.gov/mpi/ and http://www.mpi-forum.org/docs/mpi-11-html.
Universal Data Option for Informix Dynamic Server, version 9.14 for Windows NT and Unix. Also at http://www.informix.com/informix/techbriefs/udo/udo.pdf.
A. Geist et al., “PVM: Parallel Virtual Machine: A User's Guide and Tutorial for Networked Parallel Computing,” MIT Press, 1994.
G. Strang, Linear Algebra and its Applications, 2nd ed., Academic Press, New York, 1980.
Bruce Budowle et al., “Genotype profiles for six population groups at the 13 CODIS short tandem repeat core loci and other PCR based loci,” Forensic Science Communications, FBI Laboratory Division Publication 99-06, U.S. Department of Justice, Federal Bureau of Investigation, Jul. 1999, V. 1, n. 2.
J. R. Quinlan, “Induction of decision trees,” Machine Learning 1:81-106, 1986.
Michael W. Berry et al., “Matrices, vector spaces, and information retrieval,” SIAM Review 41:335-362. 1999.
Message Passing Interface Forum, MPI-2: Extensions to the Message-Passing Interface, Jul. 18, 1997. Also at http://www.mpi-forum.org/docs/mpi-20-html/mpi2-report.html.
Atsuo Yoshitaka et al., “A Survey on Content-Based Retrieval for Multimedia Databases,” IEEE Transactions On Knowledge And Data Engineering, vol. 11, No. 1, Jan./Feb. 1999, pp. 81-93.
Peter N. Yianilos, “Excluded Middle Vantage Point Forests for Nearest Neighbor Search,” Jul. 20, 1998 (revised Sep. 11, 1998), pp. 1-12.
Peter N. Yianilos, “Data Structures and Algorithms for Nearest Search in General Metric Spaces,” 1993, 11 Pages.
Marvin Shapiro, “The Choice of Reference Points in Best-Match File Searching,”Communications of the ACM, vol. 20, No. 5, May 1977, pp. 339-343.
Davood Rafiei et al., “Similarity-Based Queries for Time Series Data,” Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, May 1997, pp. 1-13.
King-Ip Lin et al., “The TV-tree—an index structure for high-dimensional data,” 1994, pp. 1-30.
Paolo Ciaccia et al., “M-tree: An Efficient Access Method for Similarity Search in Metric Spaces,” Proceedings of the 23rd VLDB Conference, Athens, Greece, 1997, 10 Pages.
W. A. Burkhard et al., “Some Approaches to Best-Match File Searching,” Communications of the ACM, vol. 16, No. 4, Apr. 1973, pp. 230-236.
Sergey Brin, “Near Neighbor Search in Large Metric Spaces,” Proceedings of the 21st VLDB Conference, Zurich, Switzerland, 1997, 11 Pages.
Tolga Bozkaya et al., “Distance-Based Indexing for High-Dimensional Metric Spaces,” 1997, 12 Pages.
Andrew Berman et al., “Selecting Good Keys for Triangle-Inequality-Based Pruning Algorithms,” IEEE, 1997, pp. 12-19.
Norbert Beckmann et al., “The R*-tree: An Efficient and Robust Access Method for Points and Rectangles,” ACM, 1990, pp. 322-331.
Richardo Baeza-Yates et al., “Proximity Matching Using Fixed-Queries Trees,” 1994, 13 Pages.
Franz Aurenhammer, “Voronoi Diagrams—Survey of a Fundamental Geometric Data Structure,” ACM Computing Surveys, vol. 23, No. 3, Sep. 1991, pp. 345-405.
Thomas E. Anderson et al., “A Case for NOW (Networks of Workstations),” IEEE, 1995, pp. 54-64.
Brian Tierney et al., “NetLogger: A Toolkit for Distributed System Performance Tuning and Debugging,” Dec. 10, 2002, pp. 1-8.
Rajkumar Buyya et al., “Gardmon: A Java-based Monitoring Took for Gardens Non-dedicated Cluster Computing System,” 1999, pp. 1-7.
Henri Casanova et al., “NetSolve: A Network Server for Solving Computational Science Problems,” Apr. 26, 1996, pp. 1-14.
Luiz De Rose et al., “An Approach to Immersive Performance Visualization of Parallel and Wide-Area Distributed Applications,” 1999, 8 Pages.
The Falcon Monitoring and Steering System, printed from http://www.cc.gatech.edu/systems/projects/FALCON/ printed on Jan. 29, 2004, 3 Pages.
Ian Foster et al., “Globus: A Metacomputing Infrastructure Toolkit,” 1997, pp. 1-16.
Daniel E.
Birdwell John Douglas
Pendleton Jared
Stansberry Dale V.
Wang Tse-Wei
Jackson Thomas H.
Olude-Afolabi Ola
PCT Law Group, PLLC
University of Tennessee Research Foundation
Vincent David R
LandOfFree
Interaction method with an expert system that utilizes... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Interaction method with an expert system that utilizes..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interaction method with an expert system that utilizes... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4196547