-26-. . . Computer Programs, cont'd .Richard Lesniak, Michael Yates and Gerald M . Goldhaberand Dept . of Communication, SUNY-Buffalo, Buffalo, N .Y . 14260, U .S .A .and William Richards, Simon Fraser Univ ., Vancouver, B .C ., .Canada .I . NETPLOT : OUTPUT DESCRIPTIONSA . NETCHART (See Figure 1)NEGOPYandNETPLOT,ProgramCharacteristicsNetchart superimposes a <strong>for</strong>mal organization structure chart over actual communication groupings .Actual output consists of a <strong>for</strong>mal chart drawn as a set of rectangles each representing a functional unitand managerial level . Each functional unit and level is split into one rectangle <strong>for</strong> each network role(Isolate, Group Member, etc .) . All rectangles are connected by <strong>for</strong>mal reporting channel lines, linkingeach unit to its supervisor(s) .In order to maximize visual idenficication of each communication group, a unique color and hashlining is assigned to each communication group . Communication group 1 is identified by red hashing ata 45 0 line angle . Communication group 2 is assigned blue lines at 135 0 line angles, and so on . Eachnode is written in his respective unit by ordinal or by ordinal and name . In order to provide ease inblack and white photocopying, identification of groups and network roles is written into each rectangle .Charts which exceed the plotter page width are drawn in sections which may be overlaid to depictthe complete organization . This process is user selected by specifying which portion of the organizationis depicted on any one plotter page .B . NETLINKNETLINK uses output from NEGOPY to plot the relative positions of group members, liaisons and/orspecial nodes and the links which connect these nodes . It should be noted here that the output fromNETLINK cannot replace NEGOPY output . Indeed, the decisions concerning which groups, liaisons or specialnodes will be represented, as well as which link types will be used, can only be made on the basis of theresults of NEGOPY .The output of NETLINK takes two <strong>for</strong>ms . First, groups in the network that are linked with each othervia bridge or liaison links may be plotted along the circumference of a circle along with the liaisonnodes which connect these groups . Bridge and liaison links are then drawn, connecting the appropriatenode points along the circumference . It described, a list of special nodes which are of particularinterest to the user may be plotted along the circumference with the group members and liaisons, andtheir connecting links with the rest of the nodes in the plot may be drawn . Additionally, the programprovides the option of surpressing the plot of certain node types, so that groups may be plotted withoutliaisons or special nodes, liaisons and special nodes may be plotted without groups, etc .The second <strong>for</strong>m of output places special nodes in the center of a circle . The nodes which are linkedwith this special node are plotted along the circumference, and the appropriate linkages are drawn .This <strong>for</strong>m of output, then, describes a wheel in which the special node is the hub and the nodes' linksare spokes connecting the special node to nodes on the wheel's rim . The output may be modified byspecifying that only certain types of special node links (within-group, between-group, liaison, etc .) beincluded in the analysis .The limitations of the program involve the number of group, liaison or special nodes which may beplotted, due to spacing and legibility constraints . Using the largest available plotting surface, thegreatest density of nodes, and the smallest character size <strong>for</strong> node labels, approximately five hundrednodes may be included in a single plot . A number of plots would be required to clearly portray a largesystem . Secondly, due to the amount of in<strong>for</strong>mation which must be used by NETLINK, plotting large systemsinvolves the use of a good deal of core memory, which increases turn-around time markedly . Finally,since plotting costs more than regular printer output, the user should make careful decisions concerningthe number and type of plots required . Excessive use of the plotting programs presented here may proveto be a costly mistake if the user has not chosen the plots carefully on the basis of their unique in<strong>for</strong>mationvalue .
-27-. . . Computer Programs, cont'd .11 . NETPLOT : ALGORITHMS AND TECHNICAL REPORTThis section is intended to provide an overview of the algorithms, data structures and controlsequences of NETPLOT .A .IntroductionUnlike so called "canned" programs written in higher level languages intended <strong>for</strong> distribution tomany computer sites, NETPLOT was developed with a particular subset of vendors in mind . Since NEGOPY,William Richards' Network Analysis Program, takes advantage of the Control Data Corporation's 60 bitcentral memory word <strong>for</strong> simulation of record types including pointer fields <strong>for</strong> linked lists . NETPLOTwas designed <strong>for</strong> the same hardware . NETPLOT utilities the linked list data structures created inNEGOPY . The list structures are written to the punched output file and are directly input into NETPLOT<strong>for</strong> further analysis .B .NEGOPY OutputThe list structures produced by NEGOPY contain almost all of the calculated in<strong>for</strong>mation used in thenetwork analysis program . They represent, in extremely compact <strong>for</strong>m, all in<strong>for</strong>mation concerning eachnode in the organization, each link <strong>for</strong> each node, and how nodes cluster into communication groups alongwith their assigned communication roles in the organization . The reader is referred to the NetworkAnalysis Manual <strong>for</strong> descriptions of these roles . (See Richards, 1975) . What is important here is anunderstanding of the list output of NEGOPY .Four arrays named INDEX, GRID MEAN and LISTA contain the simulated linked lists of record types .INDEX is a general index to any in<strong>for</strong>mation <strong>for</strong> any given node . It contains a pointer to the node'slink structure (stored in LISTA), which communication group the node is assigned (if any), and fieldscontaining his assigned network role . GRID is an index to each communication network grouping . Eachcommunication network grouping is assigned an ordinal . <strong>On</strong>e word in the GRID array is assigned to eachgrouping . GRID points to the first and last member of the group and contains the total number of nodesin the Group . LISTA contains one word assigned to each link <strong>for</strong> each node in the network . Each linkpoints to the contactee, his group, the type of link and its strength . MEAN is not utilized in NETPLOT .The linked list structures of NEGOPY provide : 1) extremely compact storage of large quantities ofin<strong>for</strong>mation ; 2) extremely swift traversal of each interlocking list using CDC FTN supported statementfunctions which allow the shifting and masking out of any field in any word ; and 3) compact interprograminterface with a minimum of "card images" being transferred .CNETCHART InputThe first of the network plotter programs superimposes a <strong>for</strong>mal organization structure diagram withthe role and group assignments of NEGOPY . This process is accomplished by inputting of NEGOPY's INDEXand GRID arrays and a numerical description of the organization (LISTA is not needed in NETCHART) .Scalar-FunctionCodesIn order to nodes to be described in their <strong>for</strong>mal organizational role, some <strong>for</strong>m of code needs to begiven to each node . The solution to this problem was not easily determined since no universal classificationscheme is used to describe positions in an organization . Also adding to the problem are the manytypes of managerial structure which can be implemented in most organizations . The solution to thisproblem used in NETCHART is the Scalar-Function code . Each managerial and unit level in the organizationis assigned a level ordinal called a scalar code . The code "1" is given to the highest level of management(President, Board of Directors, Chief Executive) . Each subsequent lower level is assigned aninteger ordinal which increases by one until the lowest level is assigned some code N . In addition, eachfunctional unit is given a "function" code increasing from left to right which describes its placement onthe <strong>for</strong>mal organization chart . Every person in the organization is there<strong>for</strong>e assigned two numbers whichwill place him on the <strong>for</strong>mal organization chart . A supervisor of one or more units is assigned the highestfunction code of the units <strong>for</strong> which he is responsible . These scalar-function codes provide a flexiblemeans to describe organizations of any number of scalar levels and functional units . The scalarfunctioncodes are stored in INDEX <strong>for</strong> us in identifying the node in the organization . The codes areinput along with a name list <strong>for</strong> each and every node .
- Page 1 and 2: THE INTERNATIONAL NETWORK FOR SOCIA
- Page 3 and 4: - 3 -. . .Network Notebook, cont'd
- Page 6 and 7: - 6 -professionals are forming to s
- Page 8 and 9: - 8 -This winter, some members of I
- Page 10 and 11: [3] Milton Kotler, NeighborhoodGove
- Page 12 and 13: - 12 -MEETING CALENDARFourthAnnualC
- Page 14 and 15: - 14 -A Proposed Dictionaryof Netwo
- Page 16 and 17: . . .Research Reports, cont'dKappel
- Page 18 and 19: . . .Research Reports cont'dThe pro
- Page 20 and 21: - 20 -. . . Computer Programs, cont
- Page 22 and 23: - 22 -. . . Computer Programs, cont
- Page 24 and 25: - 24 -. . . Computer Programs, cont
- Page 28 and 29: . . . Computer Programs, cont'd .D
- Page 30 and 31: - 3 0 -Computer Programs, cont'd .3
- Page 32 and 33: - 3 2 -NEW BOOKSClaude S . Fischer,
- Page 34 and 35: - 3 4 -THESISSUMMARIESIndustrializa
- Page 36 and 37: - 3 6 -. . . Thesis Summaries, cont
- Page 38 and 39: - 3 8 -. . .Thesis Summaries, cont'
- Page 40 and 41: - 4 0 -. . . Abstracts, cont'd .tot
- Page 42 and 43: - 4 2 -. . . Abstracts, cont'dsubje
- Page 44 and 45: - 4 4 -. . . Abstracts, cont'd .Ken
- Page 46 and 47: . . . Abstracts, cont'd - 46 -A Com
- Page 48 and 49: - 4 8 -. . . Abstracts, cont'd .Sur
- Page 50 and 51: - 5 0 -. . . Abstracts, cont'd .Ald
- Page 52 and 53: - 5 2 -. . . Abstracts, cont'd .Joh
- Page 54 and 55: - 5 4 -. . . Abstracts by Ben Zion
- Page 56 and 57: - 5 6 -. . . Abstracts by Stanley S
- Page 58 and 59: - 5 8 -. . . Abstracts by Rolf T .
- Page 60 and 61: - 6 0 -COURSE OUTLINESOCIOLOGY 475
- Page 62 and 63: - 6 2 -. . . Course Outline, cont'd
- Page 64 and 65: - 6 4 -. . .Network Notebook cont'd
- Page 67 and 68: - 6 7 -NEW DIRECTORY LISTINGSRuth H
- Page 69 and 70: - 6 9 -networks of researchers and
- Page 71 and 72: Georges GueronFondation Internation
- Page 73 and 74: - 7 3 -Richard H . LesniakSurvey Re
- Page 75 and 76: - 7 5 -(1) Continuing work fromdiss
- Page 77 and 78:
- 7 7 -U .S . corporations 1886-190
- Page 79 and 80:
- 7 9 -424 Malrose StreetChicago, I
- Page 81 and 82:
- 81 -INSNAMEMBERSBY COUNTRY211 Ric
- Page 83 and 84:
226 Joanne M . Nigg227 Franz Urban
- Page 85 and 86:
- 85 -208 Camille, Jr . Lambert 208
- Page 87:
208 Camille, Jr . Lambert211 Richar