.......... Load... was selected. Documentation: http://wiki.cns.iu.edu/display/CISHELL/Data+Formats Loaded: C:\Documents and Settings\dapolley\Desktop\sci2-win32.win32.x86\sampledata\scientometrics\nsf\Cornell.nsf .......... Load... was selected. Documentation: http://wiki.cns.iu.edu/display/CISHELL/Data+Formats Loaded: C:\Documents and Settings\dapolley\Desktop\sci2-win32.win32.x86\sampledata\scientometrics\nsf\Michigan.nsf .......... Load... was selected. Documentation: http://wiki.cns.iu.edu/display/CISHELL/Data+Formats Loaded: C:\Documents and Settings\dapolley\Desktop\sci2-win32.win32.x86\sampledata\scientometrics\nsf\Indiana.nsf .......... Extract Co-Occurrence Network was selected. Implementer(s): Timothy Kelley Integrator(s): Timothy Kelley Documentation: http://wiki.cns.iu.edu/display/CISHELL/Extract+Co-Occurrence+Network Input Parameters: Aggregation Function File: C:/Documents and Settings/dapolley/Desktop/sci2-win32.win32.x86/sampledata/scientometrics/properties/nsfCoPI.properties Text Delimiter: | Column Name: All Investigators .......... Extract Co-Occurrence Network was selected. Implementer(s): Timothy Kelley Integrator(s): Timothy Kelley Documentation: http://wiki.cns.iu.edu/display/CISHELL/Extract+Co-Occurrence+Network Input Parameters: Aggregation Function File: C:/Documents and Settings/dapolley/Desktop/sci2-win32.win32.x86/sampledata/scientometrics/properties/nsfCoPI.properties Text Delimiter: | Column Name: All Investigators .......... Extract Co-Occurrence Network was selected. Implementer(s): Timothy Kelley Integrator(s): Timothy Kelley Documentation: http://wiki.cns.iu.edu/display/CISHELL/Extract+Co-Occurrence+Network Input Parameters: Aggregation Function File: C:/Documents and Settings/dapolley/Desktop/sci2-win32.win32.x86/sampledata/scientometrics/properties/nsfCoPI.properties Text Delimiter: | Column Name: All Investigators .......... Network Analysis Toolkit (NAT) was selected. Implementer(s): Timothy Kelley Integrator(s): Timothy Kelley Reference: Robert Sedgewick. Algorithms in Java, Third Edition, Part 5 - Graph Algorithms. Addison-Wesley, 2002. ISBN 0-201-31663-3. Section 19.8, pp.205 Documentation: http://wiki.cns.iu.edu/display/CISHELL/Network+Analysis+Toolkit+%28NAT%29 This graph claims to be undirected. Nodes: 548 Isolated nodes: 173 Node attributes present: label, ExpirationDate, TotalAwardMoney, Awards, StartDate Edges: 573 No self loops were discovered. No parallel edges were discovered. Edge attributes: Did not detect any nonnumeric attributes. Numeric attributes: min max mean CoInves... 1 4 1.04538 weight 1 4 1.04538 This network seems to be valued. Average degree: 2.0912 This graph is not weakly connected. There are 251 weakly connected components. (173 isolates) The largest connected component consists of 67 nodes. Did not calculate strong connectedness because this graph was not directed. Density (disregarding weights): 0.0038 Additional Densities by Numeric Attribute .......... Delete Isolates was selected. Implementer(s): Patrick Phillips Integrator(s): Patrick Phillips Documentation: http://wiki.cns.iu.edu/display/CISHELL/Delete+Isolates Removed 173 isolate nodes. .......... Network Analysis Toolkit (NAT) was selected. Implementer(s): Timothy Kelley Integrator(s): Timothy Kelley Reference: Robert Sedgewick. Algorithms in Java, Third Edition, Part 5 - Graph Algorithms. Addison-Wesley, 2002. ISBN 0-201-31663-3. Section 19.8, pp.205 Documentation: http://wiki.cns.iu.edu/display/CISHELL/Network+Analysis+Toolkit+%28NAT%29 This graph claims to be undirected. Nodes: 710 Isolated nodes: 213 Node attributes present: label, ExpirationDate, TotalAwardMoney, Awards, StartDate Edges: 672 No self loops were discovered. No parallel edges were discovered. Edge attributes: Did not detect any nonnumeric attributes. Numeric attributes: min max mean CoInves... 1 3 1.06696 weight 1 3 1.06696 This network seems to be valued. Average degree: 1.893 This graph is not weakly connected. There are 330 weakly connected components. (213 isolates) The largest connected component consists of 55 nodes. Did not calculate strong connectedness because this graph was not directed. Density (disregarding weights): 0.0027 Additional Densities by Numeric Attribute .......... Delete Isolates was selected. Implementer(s): Patrick Phillips Integrator(s): Patrick Phillips Documentation: http://wiki.cns.iu.edu/display/CISHELL/Delete+Isolates Removed 213 isolate nodes. .......... Network Analysis Toolkit (NAT) was selected. Implementer(s): Timothy Kelley Integrator(s): Timothy Kelley Reference: Robert Sedgewick. Algorithms in Java, Third Edition, Part 5 - Graph Algorithms. Addison-Wesley, 2002. ISBN 0-201-31663-3. Section 19.8, pp.205 Documentation: http://wiki.cns.iu.edu/display/CISHELL/Network+Analysis+Toolkit+%28NAT%29 This graph claims to be undirected. Nodes: 318 Isolated nodes: 95 Node attributes present: label, ExpirationDate, TotalAwardMoney, Awards, StartDate Edges: 312 No self loops were discovered. No parallel edges were discovered. Edge attributes: Did not detect any nonnumeric attributes. Numeric attributes: min max mean CoInves... 1 3 1.01603 weight 1 3 1.01603 This network seems to be valued. Average degree: 1.9623 This graph is not weakly connected. There are 147 weakly connected components. (95 isolates) The largest connected component consists of 19 nodes. Did not calculate strong connectedness because this graph was not directed. Density (disregarding weights): 0.0062 Additional Densities by Numeric Attribute .......... Delete Isolates was selected. Implementer(s): Patrick Phillips Integrator(s): Patrick Phillips Documentation: http://wiki.cns.iu.edu/display/CISHELL/Delete+Isolates Removed 95 isolate nodes. .......... GUESS was selected. Author(s): Eytan Adar Implementer(s): Eytan Adar (GUESS), Russell Duhon (resizeLinear, colorize fix) Integrator(s): Russell Duhon Reference: Adar, Eytan, "GUESS: A Language and Interface for Graph Exploration," CHI 2006 (http://graphexploration.cond.org/) Documentation: http://wiki.cns.iu.edu/display/CISHELL/GUESS ECHO is off. Starting GUESS... ECHO is off. The initial layout for your visualization is random. For a clearer visualization, please run a layout from the Layout menu. (We recommend GEM.) ECHO is off. GUESS log file for this session can be found in C:\DOCUME~1\dapolley\LOCALS~1\Temp\CIShell-Session-1655006373470509834\StaticExecutableRunner-8421524927547054100\ALGORITHM\guesslog.txt .......... Weak Component Clustering was selected. Implementer(s): Russell Duhon Integrator(s): Russell Duhon Documentation: http://wiki.cns.iu.edu/display/CISHELL/Weak+Component+Clustering Input Parameters: Number of top clusters: 1 78 clusters found, generating graphs for the top 1 clusters. .......... Weak Component Clustering was selected. Implementer(s): Russell Duhon Integrator(s): Russell Duhon Documentation: http://wiki.cns.iu.edu/display/CISHELL/Weak+Component+Clustering Input Parameters: Number of top clusters: 1 117 clusters found, generating graphs for the top 1 clusters. .......... Weak Component Clustering was selected. Implementer(s): Russell Duhon Integrator(s): Russell Duhon Documentation: http://wiki.cns.iu.edu/display/CISHELL/Weak+Component+Clustering Input Parameters: Number of top clusters: 1 52 clusters found, generating graphs for the top 1 clusters. .......... GUESS was selected. Author(s): Eytan Adar Implementer(s): Eytan Adar (GUESS), Russell Duhon (resizeLinear, colorize fix) Integrator(s): Russell Duhon Reference: Adar, Eytan, "GUESS: A Language and Interface for Graph Exploration," CHI 2006 (http://graphexploration.cond.org/) Documentation: http://wiki.cns.iu.edu/display/CISHELL/GUESS ECHO is off. Starting GUESS... ECHO is off. The initial layout for your visualization is random. For a clearer visualization, please run a layout from the Layout menu. (We recommend GEM.) ECHO is off. GUESS log file for this session can be found in C:\DOCUME~1\dapolley\LOCALS~1\Temp\CIShell-Session-1655006373470509834\StaticExecutableRunner-6106130744864649333\ALGORITHM\guesslog.txt