NEW FEATURES Supported Algorithms & Modules Dyad Reciprocity C • Expanded Scientometrics Functionality - The Network Arc Reciprocity C Adjacency Transitivity C Workbench tool provides significant functionality for scientometricians, including the ability to analyze, clean, and create networks derived from lOAD lANGuage Extract and Annotate Attractors scholarly data sources, such as ISI, Scopus, the NSF grant database, BibTeX Load and Clean ISI File Java Extract K-Core Java and Endnote reference formats. Directory Hierarchy Reader Java Annotate K-Coreness Java • New Preprocessing Algorithms - New algorithms for trimming Merge Node and Edge Files Java CAN Search Java networks by attribute values, normalizing text, and slicing tables by time Chord Search Java period. Preprocessing k Random-Walk Search Java • Discrete Network Dynamics (DND) - A cutting-edge algorithm Extract Top Nodes Java Random Breadth First Search Java used in creating and analyzing discrete dynamic network models. Originally Extract Nodes Above or Below Value Java Burst Detection Java developed for analyzing biological systems, but can be applied to other Delete High Degree Nodes Java domains as well. Delete Random Nodes Java SearCH • Improved Export Capability - Three algorithms with Delete Isolates Java CAN Search Java the annotation capability can now export to PostScript (.eps), and Gnuplot Extract Top Edges Java Chord Search Java can now export to PDF. Extract Edges Above or Below Value Java k Random-Walk Search Java • More Comprehensive Documentation - The majority of Remove Self Loops Java Random Breadth First Search Java algorithms included in Network Workbench are now documented on the Trim by Degree Java NWB Community Wiki (http://nwb.slis.indiana.edu/community/?n=Main. Pathfinder Network Scaling Java HomePage) Snowball Sampling Java Visualization • Plus many more improvements GUESS Jython/Java Node Sampling Java Gnuplot Edge Sampling Java DrL (VxOrd) C++/Java Supported File Formats Symmetrize Java Specified (prefuse beta) Java Dichotomize Java Circular (JUNG) Java • GraphML (*.xml or *.graphml) • Scopus (*.scopus) Multipartite Joining Java Radial Tree / Graph (prefuse alpha) Java • XGMML (*.xml) • NSF (*.nsf) Normalize Text Java Radial Tree / Graph with Annotation (prefuse beta) Java • Pajek .NET (*.net) • Endnote (*.enw) Slice by Time Java Tree (prefuse beta) Java • Pajek .Matrix (*.mat) • Bibtex (*.bib) Tree View (prefuse beta) Java • NWB (*.nwb) Modeling Balloon Graph (prefuse alpha) Java • TreeML (*.xml) Random Graph FORTRAN Force Directed with Annotation (prefuse beta) Java • Edge list (*.edge) Watts-Strogatz Small World FORTRAN Kamada-Kawai (JUNG) Java • CSV (*.csv) Barabási-Albert Scale-Free FORTRAN Fruchterman-Rheingold (JUNG) Java • ISI (*.isi) CAN Java Fruchterman-Rheingold with Annotation (prefuse beta) Java Chord Java Spring (JUNG) Java Hypergrid Java Small World (prefuse alpha) Java Core Conversion Graph PRU Java Parallel Coordinations (demo) Java TArl Java LaNet ocaml Discrete Network Dynamics (DND) Java SCIENTOMETRICS Analysis Remove ISI Duplicate Records Java Network Analysis Toolkit (NAT) Java Remove Rows with Multitudinous Fields Java Node Degree FORTRAN Detect Duplicate Nodes Java Degree Distribution FORTRAN Update Network by Merging Nodes Java Undirected k-Nearest Neighbor FORTRAN Extract Directed Network Java Watts-Strogatz Clustering Coefficient FORTRAN Extract Paper Citation Network Java Watts-Strogatz Clustering CoefficientV ersus Degree FORTRAN Extract Author Paper Network Java Diameter FORTRAN Extract Co-Occurrence Network Java Average Shortest Path FORTRAN Extract Word Co-Occurrence Network Java Shortest Path Distribution FORTRAN Extract Co-Author Network Java Node Betweenness Centrality FORTRAN Extract Reference Co-Occurrence Network Java Connected Components FORTRAN Extract Document Co-Citation Network Java Weak Component Clustering Java Extract Co-Citation Similarity Network Java Node Indegree FORTRAN Node Outdegree FORTRAN Other plug-ins Indegree Distribution FORTRAN Scheduler Tester Java Outdegree Distribution FORTRAN Converter Tester Java Directed k-Nearest Neighbor FORTRAN Preferences Java Single Node In-Out Degree Correlations FORTRAN Split Graph to Node and Edge Files Java Page Rank FORTRAN

Please cite the project as follows: NWB Team. (2006). Network Workbench Tool. Indiana University, Northeastern University, and University of Michigan, http://nwb.slis.indiana.edu