. . . Computer Programs, cont'd .D . NETCHART AlgorithmsNETCHART reads the NEGOPY list structures and control parameters from an environmental file namedNEGOUT . The NETCHART control parameters are read in along with a FORTRAN <strong>for</strong>mat specifier <strong>for</strong> thenamelist (if any) . Next, the scalar-function codes are input <strong>for</strong> each node in the network along with hisname, title or other textual in<strong>for</strong>mation to be associated with the node . These codes are checked <strong>for</strong>legality and completeness . If any node has not been assigned a scalar-function code, the program activatesthe TRACE parameter and deactivates the DRAW control since an incomplete plot would surely result .If all input requirements are properly satisfied, area calculations commence . Each unit isassembled by gathering those nodes who have identical scalar-function codes and communication networkroles . A one pass search through INDEX creates pointers in GRID which allow the easy access of anyparticular unit by locating the first member in INDEX who satisfies the necessary requirements of thesearch . The list can then be traversed by finding the next node in any communication group who is pointedto by the last node in that group . Each unit is then ordered by communication network role . <strong>On</strong>ce allunits are identified, spacing in both horizontal and vertical dimensions is achieved by calculating theamount of area to be within all units, verses the amount of space between units (HPROP and VPROP are usedto provide this ratio) . Each unit rectangle is then assigned X and Y rectangular coordinates <strong>for</strong> itslower, left hand point . The remaining corners are calculated and stored in an array in labeled common .<strong>On</strong>ce all rectangular coordinates are assigned, each rectangle is given an ordinal which is used <strong>for</strong>indexing later in the program .Actual plotting begins by stepping through the array of coordinates of each rectangle and instructingthe plotter to plot its perimeter . This is achieved by using a routine which plots straight linesgiven two point coordinates . Names and node ordinals are plotted and spaced within each rectangle .Finally, each unit rectangle is connected to its superior level . Connection is no trivial operation .Shared units and the supervision of several units by one node make this process complex . An input textis written to identify the chart . As each rectangle is plotted, an identifier, unique <strong>for</strong> each communicationgrouping, is superimposed over the rectangle to provide visual aid in recognition of each communicationgrouping .E .NETCHART OutputAside from the plotted organizational <strong>for</strong>mal diagram with communication groupings and roles indicated,NETCHART also produces complete numerical descriptions of all calculations and plottings if in TRACEmode . This output is useful <strong>for</strong> debugging and <strong>for</strong> checking actual run precision . Also the numericaloutput can be used to convert the program to other off line plot devices such as a graphics terminal orpage plotter .NETCHART, like NEGOPY, used dynamic memory allocation <strong>for</strong> blank common to assure optimum executiontimes and minimal costs per plot Memory allocation is handled by an assembly routine linked to the NOSoperating system .F .NETLINK InputThe second NETPLOT program produces plots of linkings between special nodes, groups and/or liaisons .Special nodes are defined as any node <strong>for</strong> which a complete link analysis is to be per<strong>for</strong>med . Plots areproduced with each group, node and/or liaison plotted on the circumference of a circle . Links arerepresented by lines connecting each node, group and/or liaison as per user request from input .NETLINK utilizes the same list structures as NETCHART in addition to using LISTA, punched in thesame NEGOPY output as INDEX and GRID . LISTA provides in<strong>for</strong>mation regarding which nodes or groups arelinked with various link types . Additionally, NETLINK expects a name list and <strong>for</strong>mat to be input if oneis requested with a NAMWID control parameter .G .NETLINK AlgorithmsNETLINK begins much the same as NETCHART . The NEGOPY data structures are read in from NEGOUT .Next, user input determines which if any nodes, groups or liaisons are to be given attention on the plot .User input specifies any node numbers, group ordinals, liaison ordinals and/or special link types . Alogic table is followed in the program to assure proper existence of data . For example : specifying nolink types would cause the program to cease execution since no linkings could possibly be plotted . Inany case, if some user error occurs, TRACE, the boolean tracing switch, is activated if not already activated.After all control and run parameters have been successfully read, NETLINKS removes all unnecessaryin<strong>for</strong>mation from INDEX, GRID and LISTA (which reside in black common) and per<strong>for</strong>ms an elementary garbage
- 2 9 -. . . Computer Programs, cont'd .collection to compact storage . Control then passes to subroutines which calculate circle size and position<strong>for</strong> each node, group and liaison . Polar coordinates are stored in a general indexing array <strong>for</strong> eachrequested <strong>for</strong> analysis as well as <strong>for</strong> each group member .Plotting begins by drawing each node of group on the circumference of the circle . If any specialnode is to be given key attention, it is placed in the center of the <strong>for</strong>m . All links are drawn by traversingLISTA and indexing the polar coordinates of both line terminators . Polar coordinates areconverted to rectangular coordinates at all times . The CalComp software package accepts only therectangular set .Finally, a title is written onto the plot . The complete process is continued <strong>for</strong> each special nodeby repositioning the plotter drum to a new origin and repeating the algorithm until all user requests aresatisfied .H .NETLINK OutputAside from plotter output, NETLINK provides aprocess onto output . This output closely resemblesI . LIMITATIONScompleteNETCHARTnumericaloutput .Plotter packages usually present strict limitations . NETPLOT isthe run time limitations <strong>for</strong> each program :1 . NETCHARTdescription of the plottingno exception . Listed below areTotal number of nodes allowed 4095Total number of links allowedMaximum scalar codeNA511Maximum function code 511Maximum number of Groupings 50Maximum name widthMaximum total plot size20 characters24 by 34 in .2 . NETLINKMaximum number of nodes 4095Maximum number of groups 50Maximum number of links 32767Maximum name widthMaximum diameter of circle2- characters36 in .Ronald BurtDept . of Sociology, Univ . of Cali<strong>for</strong>nia,Berkeley, Calif . 94720, U .S .A .STRUCTURE :A Computer Program Providing Basic Data <strong>for</strong> the Analysisof Empirical Positions in a System of ActorsSTRUCTURE is a computer package <strong>for</strong> conducting multiple network analyses on systems composed of upto 150 actors/positions interconnected by relations in up to 9 networks in a system . The purpose of theprogram is to implement the general conception of relational structure in a system as a social topology(Burt, 1976, 1977a, 1977b) . Traditional sociometry and blockmodels are included features of the package .For each analysis, the program takes one or more networks of relations as input and produces the followingoutput as requested :1 . <strong>Social</strong>/role distances emong actors/positions (Burt, 1976, 1977a) .2 . Hierarchical cluster analyses of the inter-actor/position distances using Johnson's (1967) twoalgorithms .
- 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 26 and 27: -26-. . . Computer Programs, cont'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