ppxscal/embedding_network huggingface dataset:
A Simulation/optimization-based planning and decision support system
Authors: William T. Scherer, Chelsea C. White,  III
Venue: Proceedings of the 16th conference on Winter simulation (1984)

A decision support system (DSS) was developed for determining the number of items to purchase of a capital intensive commodity and when these items should be purchased in order to satisfy projected operational requirements. Such decisionmaking represents a major planning effort of many organizations such as airlines, trucking companies, and satellite telecommunications firms. The determination of these decisions is complicated by the length of time necessary to produce the commodity, the potential for failure, uncertain future costs and capacity requirements, multiple, conflicting, and noncommensurate objectives, and various exogenous factors. The DSS that was developed uses the simulation of a large Markov decision process (MDP) to evaluate purchase strategies generated by (1) domain experts, (2) heuristic procedures, and (3) the solution of an aggregated version of the MDP. Application of the DSS to a spacecraft purchase problem of INTELSAT is discussed and is used to motivate the developments.
Cognitive predictors of success in computer programmer training
Authors: Stuart J. Jacobs
Venue: Proceedings of the eleventh annual SIGCPS computer personnel research conference (1973)

The aptitudes and abilities required for the position of programmer, within the computer industry, have yet to be fully studied and their inter-relationships known. Although the industry is relatively new, a substantial amount of research in the areas of personnel selection, evaluation and job requirements has been undertaken. Yet these studies have confined themselves primarily to the use of interest scales, aptitude and achievement tests as overall predictors for on-the-job success rather than in the study of the cognitive factors pertinent to the tasks of which programming is composed. In a study by Deutsch and Shea, Inc. (1963), the relationship between the programmer and the computer is seen as analogous to that of the mahout and his elephant. As with the mahout, the programmer uses his intelligence, skills and abilities in the control and guidance of a powerful and flexible, yet non-intelligent, tool in the performance of specific finite operations which contribute to the completion of more complex tasks. It is the programmer who, when presented with a problem from science, engineering or business, must work out a solution. John and Miller (1957) state that all problems have two general parts: the specific components involved (i.e., data, etc.) and the relationships which are the orderings of or changes to the specific components.
Local area networks for the automated office - a survey
Authors: Arthur R. Braun
Venue: Proceedings of the seventh symposium on Data communications (1981)

This paper looks at the characteristics of the three types of information that can be expected to exist in the Automated Office of the Future:. voice, data and video. Then, it presents the three technologies (or methods), known as Local Area Networks, to support these types of information. The Local Area Networks considered here are: Central Switches, Rings and Buses. Two classes of Central Switches are considered: Circuit and Packet. Furthermore, two classes of Bus structures are also considered: Baseband and Broadband. Finally, this paper discusses the implications of each technology upon supporting each of the three types of information.
Image interpretation using contextual feedback
Authors: G. C. Lai, R. J. P. De Figueiredo
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

We present a methodology for scene analysis using contextual feedback and demonstrate the approach in a simple example. In our approach, we combine bottom-up and top-down decision making into a systematic mechanism. From feedback of high-level descriptions, the system iteratively arrives at improved identification. The implementation uses OINNs (optimal interpolative neural networks) to determine plausibility and enforce constraints in label assignments. The proposed method can be extended for the analysis of more complex scenes.
Speech synthesis under APL
Authors: Donald B. Rueter
Venue: Proceedings of the sixth international conference on APL (1974)

Electronic speech synthesis is new a reality. Within the past few years there have been developed a number of devices having the capability of producing remarkably understandable speech electronically. Digital speech devices are of basically two types: they either withdraw prerecorded speech sounds from some direct-access storage device and connect them into words and phrases; or they electronically synthesize speech sounds using tone generators and appropriate shaping and filtering circuits. This paper discusses the second type. For a few years, now, there has been available from the Federal Screw Works of Troy, Michigan, a device called the Votrax voice synthesizer. This device may be connected to a computer, among other things, and digital codes can be entered into its internal buffer. The device is then instructed to speak the contents of its buffer through a loudspeaker. Coast Community College District obtained its first of the current two Votrax devices late in the 1972-73 school year and spent several months using a keyboard to load the buffer in a manual mode. In September, 1973, it became possible to connect the device to the computer in parallel with a Tektronix 4010 graphic display terminal under APL, which was then done as shown in Figure 1. Using this convention the Votrax sees all characters sent to the terminal, and does not transmit any data or line control voltages back to the terminal controller.
Production control on the disk file
Authors: Charles E. Richardson
Venue: Proceedings of the 1961 16th ACM national meeting (1961)

Production Control in a manufacturing concern can either be an ingratiating system or the most grotesque complex procedure in operation. In a large company, the manual application of the system in question becomes unwieldy and economically impossible. The necessity of mechanizing Production Control thus becomes increasingly obvious, and, because of its effect to the total systems concepts, this mechanization must be handled with the upmost of care... The next level of consideration becomes the mode of mechanization. The major criteria in Production Control are rapid access in seeking information regarding the location and status on any order or group of orders, immediate addition, updating, and deletion of orders in the file, and the ability to readily purge this file periodically. The establishment of the order file in punched cards would greatly relieve the economics of the system, but access to a large volume of orders over a days time would be extremely burdensome; even its application to magnetic tape would leave us with a cumbersome routine. The third storage device under consideration is the disk file which quite aptly satisfies the requirements: high volume of storage, 10 million BCD characters, or 100,000 sectors of 100 positions each; rapid access to any of these sectors, average seek time 600 milliseconds; and a file that can be readily purged, 150 minutes to dump the disk file on to the tape.
The &ldquo;highly intelligent&rdquo; tablet as an efficient pointing device for interactive graphics (Preliminary Report)
Authors: Henry Fuchs, Zvi M. Kedem
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

Described is a simple, efficient algorithm for determining the nearest displayed point on a screen to an arbitrary cursor position. The algorithm seems particularly appropriate for interactive systems using a data tablet with a &ldquo;smart&rdquo; controller. The algorithm is based on partitioning the screen among the currently displayed points and minimally modifing this structure as points are added and deleted. Finding the nearest point for cursor position consists then of moving through this partitioning structure until the region is determined. A divide-and-conquer method is used for both inclusion testing in a particular region and also for speeding the search for the proper nearest point.
The Roscoe distributed operating system
Authors: Marvin H. Solomon, Raphael A. Finkel
Venue: Proceedings of the seventh ACM symposium on Operating systems principles (1979)

Roscoe is an operating system implemented at the University of Wisconsin that allows a network of microcomputers to cooperate to provide a general-purpose computing facility. After presenting an overview of the structure of Roscoe, this paper reports on experience with Roscoe and presents several problems currently being investigated by the Roscoe project.
Imbedding GPSS in a general purpose programming language
Authors: Jerrold Rubin
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

GPSS has proven to be an excellent simulation language, but was not designed to perform the logical and computational tasks of a programming language. Strategies for improvement can take one of two paths: building adequate analytic constructs into the existing GPSS language, or building GPSS-like constructs into an existing general purpose programming language. The second choice can be made easier by use of a language-building utility program to translate simulation constructs into the selected programming language. It is also simplified by the fact that some GPSS statements (such as input-output and control) may be dropped, since any good programming language will provide native facilities for these functions. Such a fusion between the constructs of a good simulation language, and those of a good programming language, provides a far more flexible system than either alone. This paper discusses PL/I GPSS, an implementation of GPSS in a PL/I environment which uses PL/I variables as transaction variables and permits use of general PL/I expressions for most GPSS statement parameters.
Scientific computation using micro-computers
Authors: E. L. Battiste
Venue: Proceedings of the ACM 1980 annual conference (1980)

Rapid migration of micro-computers into industry, universities, and research laboratories is coupled with a need to make robust, accurate software available to those environments. The economics of such production relates to whether production investment will result in software which can be transported to other environments, and to whether the languages and software on which such software is based are acceptable. The cost of such production must relate to potential revenues. This may seem large if numbers of users is considered, but must be quite small in terms of unit price.
A Requirements Tracing Tool
Authors: Robert A. Pierce
Venue: Proceedings of the software quality assurance workshop on Functional and performance issues (1978)

A software development aid termed the Requirements Tracing Tool is described. Though originally designed to facilitate requirements analysis and thus simplify system verification and validation, it has also proven useful as an aid for coping with changing software requirements and estimating their consequent cost and schedule impacts. This tool provides system analysts with a mechanism for automated construction, maintenance, and access to a requirements data base&mdash;an integrated file containing all types and levels of system requirements. This tool was used during the development of a large Navy undersea acoustic sensor system. It is presently being used to support the Cruise Missile Mission Planning Project. An outline version of this tool is under development.
Estimation of the cumulative by fourier series methods and application to the insertion problem
Authors: Michael E Tarter
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

In a paper published in last year's A.C.M. Proceedings a new method for estimating the population density, i.e., f, was described1 The procedure was based upon the use of sample trigonometric moments as unbiased estimates of density f's Fourier coefficients. It was noted, but not further discussed, that the cumulative distribution function F associated with density f could be approximated by an estimator &Fcirc;m associated with density estimator &fcirc;m, and that &Fcirc;m possessed the following properties: The coefficients &Bcirc;k are unbiased estimators of the Fourier coefficients of the function F(x)&minus;[(x&minus;a)/(b&minus;a)] and therefore simple M.I.S.E. (Mean Integrated Square Error) expressions could be obtained for estimator &Fcirc;m. Also as m&rarr;@@, &Fcirc;m&rarr;F* where F* represents the sample cumulative (step function). In this paper the estimator &Fcirc;m will be more fully discussed and an application to the problem of address calculation insertion will be described.
Measurements of sharing in Multics
Authors: Warren A. Montgomery
Venue: ACM SIGOPS Operating Systems Review (1977)

There are many good arguments for implementing information systems as distributed systems. These arguments depend on the extent to which interactions between machines in the distributed implementation can be minimized. Sharing among users of a computer utility is a type of interaction that may be difficult to provide in a distributed system. This paper defines a number of parameters that can be used to characterize such sharing. This paper reports measurements that were made on the M.I.T. Multics system in order to obtain estimates of the values of these parameters for that system. These estimates are upper bounds on the amount of sharing and show that although Multics was designed to provide active sharing among its users, very little sharing actually takes place. Most of the sharing that does take place is sharing of system programs, such as the compilers and editors.
Guidelines for creating a debuggable processor
Authors: R. E. McLear, D. M. Scheibelhut, E. Tammaru
Venue: ACM SIGARCH Computer Architecture News (1982)

Hardware without software is of little use. Systems that ease the task of debugging software reduce cost and speed development. This paper presents guidelines for designing processors that ease debugging for real-time computer systems. Special hardware can aid the debugging process by tracing execution and accesses to memory. Such hardware requires access to signals that may not be readily available. Other, less exotic hardware provides an interface to the programmer and other processors. The hardware and software of the debugging system should not alter the real-time characteristics of the system under test and should be able to operate on a field-grade processor. It is undesirable to require special versions of processor hardware and software for the debugging system.
APL transmission path analysis for design of a local area network
Authors: A. A. Friedrich, R. D. Love
Venue: ACM SIGAPL APL Quote Quad (1984)

A method of analyzing the transmission capabilities and limitations of a Local Area Network communications channel is presented. A description is given of how APL was used to generate the eye patterns used to evaluate cable, transformer, and filter effects on the transmitted signal. These eye patterns were used to make design decisions regarding the network, and for generating the parametric data for another APL program package which calculates the length of cable permissible for a given configuration. This second package which evaluates signal attenuation and crosstalk resulting from each length of cable and each node, is used to synthesize valid configurations. A design example is presented.
I/O buffer performance in a virtual memory system
Authors: Stephen W. Sherman, Richard S. Brice
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

In this study we construct a simulator of a data base management system running in a virtual memory environment. We use the simulator to investigate the value of using an I/O buffer in this environment. The simulator is driven by trace data obtained with a software probe. The simulator is validated and is used to verify a theoretical model which predicts paging and disk access rates produced by use of an I/O buffer in a virtual memory environment. Results from a multi-factor set of simulation experiments are analyzed. The factors include three page replacement algorithms, four buffer management algorithms, five virtual buffer sizes, three values for real memory and six well known and widely differing distributions for creating sequences of requests to the simulated data base management system.
Hashing schemes for extendible arrays (Extended Abstract)
Authors: Arnold L. Rosenberg, Larry J. Stockmeyer
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The use of hashing schemes for storing extendible arrays is investigated. It is shown that extendible hashing schemes whose worst-case access behavior is close to optimal must utilize storage inefficiently; conversely, hashing schemes that utilize storage too conservatively are inevitably poor in expected access time. If requirements on the utilization of storage are relaxed slightly, then one can find rather efficient extendible hashing schemes. Specifically, for any dimensionality of arrays, one can find extendible hashing schemes which at once utilize storage well [fewer than 2p storage locations need be set aside for storing arrays having p or fewer positions] and enjoy good access characteristics [expected access time is 0(1), and worst-case access time is 0(log log p) for p- or fewer-position arrays]. Moreover, at the cost of only an additive increase in access time, storage demands can be decreased to (l+&egr;)p locations for arbitrary &egr;>0. In fact, if one will abide a more drastic degradation of access efficiency, one can lower storage demands to p+o(p) locations.
A directed search approach to selecting a sequencing rule
Authors: James C. Hershauer, Ronald J. Ebert
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A standard approach to selecting a simple sequencing rule for decentralized application throughout a job shop is developed and illustrated. Search procedures are applied to a response function which is an expectation of relevant cost per order. The cost for each order observed is a weighted combination of the multiple responses that exist in a job-shop environment. An expectation of cost per order is found by sampling the processing of orders within a computer simulation model for a particular sequencing rule. Each sequencing rule is determined by the coefficients in a priority function which is a weighted combination of identified decision variables The search procedure thus tests different sequencing rules by varying the coefficients in the priority function and generating associated cost expectations through simulation. Rather than leading to a &ldquo;single best rule&rdquo; for all job shops, the appreach is a &ldquo;method for finding&rdquo; a sequencing rule for any specific situation.
Representing and using procedural bugs for educational purposes
Authors: John Seely Brown, Richard R. Burton, Kathy M. Larkin
Venue: Proceedings of the 1977 annual conference (1977)

&ldquo;If you can both listen to children and accept their answers not as things to just be judged right or wrong but as pieces of information which may reveal what the child is thinking you will have taken a giant step toward becoming a master teacher rather than merely a disseminator of information.&rdquo; &mdash;J.A. Easley, Jr. Russell E. Zwoyer
The elements of SETL style.
Authors: Robert B.K. Dewar, Edmond Schonberg
Venue: Proceedings of the 1979 annual conference (1979)

Associated with every programming language is a style of programming which is encouraged by the semantic and syntactic features of this language. We are all familiar with the phenomenon of a FORTRAN programmer approaching APL for the first time and writing correct APL programs which are nevertheless emphatically criticized for not displaying the proper APL style. Indeed we may consider this 'APL style' to be the most important contribution of the language to the art of programming, rather than the specific language features out of which this style emerges. Controversies about the value of APL (and other programming languages) focus precisely around this issue of style. It is also around this issue that we want to center our presentation of SETL. Briefly stated, SETL is a very-high level programming language whose basic semantic constructs are those of the mathematical theory of sets. Primitive operations in SETL include set membership, union, intersection, power set construction, etc. SETL provides two basic aggregate data types : unordered sets, and sequences, or tuples. The elements of sets and the components of tuples can themselves be of arbitrary type, including sets and tuples. In particular, sets of pairs (i.e. tuples of length 2) can be used as maps with perfectly general domain and range types.
Academic support vs. information support: Bringing information management to the community college
Authors: Larry Lambert, Jane-Ellen Miller
Venue: Proceedings of the 12th annual ACM SIGUCCS conference on User services (1984)

TRADITIONAL USER SUPPORT at institutions of higher education has revolved around the idea that the staff of the computer center should provide resources and consultation primarily for applications considered more traditional in nature: registration, financial aid, data processing/computer science applications such as languages (COBOL, FORTRAN, BASIC, JCL, etc.), Computer Assisted Instruction (CAI), and research projects which might utilize a statistical package like SAS or SPSS. This has most certainly been true at four-year institutions and to only a lesser degree at community colleges. However, as the number and types of user groups within the institution have become more diverse, the computer center has shifted its support away from more traditional classroom applications toward becoming an information service consultant for the institutional workforce. This has been done to acknowledge the fact that the computer center's user groups have become more diverse and many times more dependent on its support functions. This paper will discuss some of the major issues which have accompanied this shift from academic instructional support to information services support as it has been addressed by one major community college. Most notably, it will discuss: the steps taken to implement a comprehensive management information system; Planning mechanisms required to implement the necessary training support for new applications, including education programs, presentational and supplemental materials, along with media and hardware support; and the use of feedback mechanisms to aid the definition and development of training programs required by this transition from traditional academic consulting to information management user services.
Introduction to Demos
Authors: Graham Birtwistle
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Demos [1,2] is yet another discrete event simulation language hosted in Simula. It was released in 1979 and is now running on IBM, DEC, UNIVAC, and CDC hardwares amongst others. The paper contains a short introduction to Simula's object and context features; an explanation of the process approach to simulation; a brief comparison of Simula and GPSS; and finally, the main features of Demos are presented via an example.