ppxscal/embedding_network huggingface dataset:
Relationship of software engineering and simulation
Authors: Elwood Baas, James Ellis
Venue: ACM SIGSIM Simulation Digest (1976)

In response to the enormous annual dollar value spent on software, major emphasis is being placed within industry, Government and academia on the establishment of a rigorous discipline for the development of software&mdash;i. e., on the establishment of software engineering. This has significance in the realm of computer system simulation for two basic reasons: first, computer system simulation (any simulation for that matter) does itself involve the development of software; and second, computer system simulation is a technique/tool which can be applied to the discipline of software development. It will be the purpose of this workshop to discuss both the role of software engineering in computer system simulation and the role of computer system simulation in software engineering. Potential topics for discussion include, but are not limited to: a. Identification of software engineering b. Disciplines required for software engineering c. Software engineering in support of computer system simulation d. Computer system simulation as a tool in software engineering e. Recent progress in the direction of establishing the software engineering discipline.
An integrated software environment for localization
Authors: S. P. Mudur, Rekha Sharma, Keyur Shroff, Parvati Rajan
Venue: Proceedings of the 15th international conference on Computer communication (2002)

While the information revolution is surely and certainly having a profound impact on the developed world, developing nations are yet to explore these new digital opportunities presented by Information and Communication Technologies (ICT) to foster rapid growth and benefit the poor. Without urgent and satisfactory localization of digital systems, it is difficult to envisage any significant impact of ICT in less literate nations such as India, where over 92% of the population cannot communicate in English or in any of the other human languages supported today in these new innovation products. A major factor impeding localization is the less known fact that much like software development, localization is a very human intensive task covering the entire life-cycle of a digital system - from conception to retirement. The primary contribution of this research is the design of an integrated environment that will help ease this problem to a reasonable extent. This paper first presents the localization problem showing why it is human effort intensive. The localization process is then sketched. This is followed by a description of the integrated localization environment, including tools and activities covering the localized product life cycle. To the best of our knowledge, this is the first such attempt. The paper concludes describing the efforts in progress towards the creation of such an environment within the Linux platform, including a brief description of sample tools developed by the authors as part of this development - OS level support for enabling Indic scripts and an electronic glossary of GUI terms that can assist in the automation of localization.
SIMSCRIPT II.5 tutorial
Authors: Edward C. Russell
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

This tutorial will present the highlights of the SIMSCRIPT II.5 approach to building discrete event simulation models. The approach will be to construct a small example problem, implement the program in SIMSCRIPT II.5, and then to display the modularity which is possible with SIMSCRIPT by adding several &ldquo;real-world&rdquo; complexities to the model.
IFPS: A lot more than a spreadsheet
Authors: Donald R. Plane
Venue: Proceedings of the 15th conference on Winter Simulation - Volume 2 (1983)

The Interactive Financial Planning system (IFPS) is a powerful modeling language which can effectively be used by managers (with no computing background) and by computer professionals. Although a quick introduction to the system may leave the impression that IFPS is basically a spreadsheet system, it has capabilities far beyond the typical spreadsheet system. These capabilities include Monte Carlo simulation and optimization.
Automated building design
Authors: L. L. Bathurst
Venue: Proceedings of the SHARE design automation project (1965)

This paper is a general description of a system of Computer programs which perform all the routine functions, normally performed by an Engineer, encountered in designing and selecting the materials for a structural steel building from basic geometric and load data. The basic sequence of operations performed by the Engineer are: 1. Establish the geometry of the building. 2. Determine the loads to be supported. 3. Determine the lengths and location of each member in the building. 4. Distribute the loads to each member in the building. 5. Determine the interaction of the member loads to other members. 6. Combine loads and determine the maximum load and its location on each member. 7. Determine the strength required for each member using its maximum load. 8. Select the lightest commercially available steel hape which meets the strength requirements. Until recently only step 5 and sometimes 6 were accomplished on the computer. The MIT &ldquo;STRESS&rdquo; and the IBM &ldquo;FRAN&rdquo; are good examples of this type of program.
MATHNET: A representation and analysis technique for stochastic networks
Authors: Stephen L. Robinson
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The methodology presented here was developed in response to the need for a simple way to perform time-cost tradeoff analysis of research and development programs. MATHNET has been adopted by members of the managerial community as an effective tool for such analyses. Its enthusiastic reception can be directly traced to its development history. MATHNET was originally designed as a teaching aid for a seminar on the risk analysis of R D projects. As a result it is extremely simple to learn. Persons familiar with PERT, or other network representation schemes, have learned MATHNET in the course of very short training sessions. The extension of MATHNET's capabilities has been dictated by situations encountered by MATHEMATICA personnel in the course of conducting risk analyses of a wide class of programs. Most R D projects, therefore, are representable by existing MATHNET symbology. The modular design of MATHNET provides for the easy addition of symbols to represent decision types not presently incorporated in the system. MATHNET has already proven to be of great value in the risk analysis of several large-scale research and development programs. It is anticipated that MATHNET will have an impact on the analysis of programs requiring stochastic representations similar to the impact that PERT had on programs representable by deterministic networks.
A data driven system based on a microprogrammed processor module
Authors: R. W. Marczyński, J. Milewski
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

A hardware approach to the design of data driven computers using a microprogrammed processor as a building block is proposed. The data driven computer is a network of processors virtually implementing the data flow program graph. The flexibility of microprogramming provides a wide variety of possible implementations for the fixed data driven network structure. Due to the proposed organization of communication the network is deadlock-free.
Increased productivity from increased work(?)
Authors: Dennis P. Geller, Daniel P. Freedman
Venue: Proceedings of the thirteenth annual SIGCPR conference (1975)

Programmer productivity is clearly a function of the programmer's task: significant changes to the &ldquo;nature of programming&rdquo; would be most likely to effect productivity. We propose that this effect need not be adverse: requiring more work for the completion of a given project may actually increase productivity. In particular, we present a technique which seems to lead to better programs at lower cost, and discuss its implications.
The GPSS/360 random number generator
Authors: Harry Felder
Venue: Proceedings of the second conference on Applications of simulations (1968)

This study of yet another URNG has been designated with a particular user of URNG in mind: the General Purpose Simulation System/360 user. By eliminating from consideration such uses of the tested generator as large Monte Carlo calculations on nuclear energy problems, and considering only the typical uses of URNG by GPSS/360 problems, a more suitable testing procedure was devised. Appropriately enough, the URNG studied was the one included in GPSS/360.** (Actually, there are eight URNG in GPSS/360, but they use identical generation schemes.) Each of the eight GPSS/360 URNG has one parameter, a &ldquo;multiplier&rdquo;, which the user may alter, causing a new sequence of random numbers to be generated. The goal of this study was to locate multipliers whose sequences would meet a number of criteria desirable if the sequences are to be used in GPSS/360 simulations.
Simulation models for army manpower requirements
Authors: Charles Dale
Venue: Proceedings of the 16th conference on Winter simulation (1984)

The recent recruiting successes of the Army are unlikely to continue as the economy improves. The Army has been constructing a series of mathematical models to project the magnitude of future recruiting shortfalls, and to allocate new recruits to occupational specialties efficiently. A few of these models are described here.
A model of bureaucratic growth using GPSS
Authors: W. D. Rowe
Venue: Proceedings of the second conference on Applications of simulations (1968)

A model of bureaucratic growth, based completely upon the communication among people in an organizational structure, has been formulated and is described here. The model has been simulated using GPSS/360. The model uses less than 250 blocks and takes advantage of the interpretative language capability of GPSS. Results of the simulation show growth values similar to that of Parkinson and yield a great deal of information about organizations and communication within them. The model yields general results, since it is formulated in general terms. It can be used to simulate both abstractions of variety of organizations and various configurations of specific organizations when real data is available. The program requires parameter values and algorithms that describe action as input. While the model is indeterministic until these are supplied, the general nature of the solution is invariant as these change. This implies that the basic nature of the process has been modelled, not a particular situation.
Interactive budgeting models: A simulation tool for MIS education
Authors: Theodore J. Mock, Miklos A. Vasarhelyi
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A relatively new and innovative educational approach in graduate information systems is discussed. The thrust of the approach is to have student groups design computer-based simulations of the budgeting processes of a firm in the form of an interactive budgeting model. These are applied to the areas of financial planning, control and managerial decision making. Several different approaches were suggested to and adopted by students as main design philosophies including modular planning and a matrix accounting system. The various implemented systems are described and their features are classified.
48-bit absolute internet and Ethernet host numbers
Authors: Yogen K. Dalal, Robert S. Printis
Venue: Proceedings of the seventh symposium on Data communications (1981)

Xerox internets and Ethernet local computer networks use 48-bit absolute host numbers. This is a radical departure from practices currently in use in internetwork systems and local networks. This paper describes how the host numbering scheme was designed in the context of an overall internetwork and distributed systems architecture.
Adaptive power management a hierarchical/distributed system
Authors: William F. Honey
Venue: ACM SIGSMALL Newsletter (1981)

The automatic control of electrical system (ACES) for aircraft shipboard applications was first demonstrated at the Westinghouse Aerospace Electrical Division in 1970 [4]. This system was implemented on a single computer which controlled the hardware directly with discrete signals. Presently Hierarchical and Distributed computer architectures are being evaluated [3, 14], to perform the ACES task. Westinghouse is pursuing a combined Hierarchical/Distributed architecture for its Adaptive Power Management (APM) system [5]. The Hierarchical network performs system control, conflict resolution, and top level resource monitoring and adaption/reconfiguration. The Distributed network performs the system Input/Output functions, all direct control and coordination of the peripherial hardware and the adaption/reconfiguration of their resource/control tables (see Figure 10). In addition, APM complies with the Air Forces requirement to use the standard DAIS AN/AYK-15A processor [10, 11]; the standard higher order programming language as defined in MIL-STD-1589 [12], and interface and data bus multiplex system standard MIL-STD-1553B [8, 9].
Intersecting is easier than sorting
Authors: Bernard Chaselle
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

This paper settles a long-standing open question of computational geometry: Is it possible to compute all k intersections between n arbitrary line segments in time linear in k? We answer this question affirmatively by presenting the first algorithm with a running time of the form O(k + f(n)), where f is a subquadratic function of n. The function f we achieve is actually quasi-linear in n, which makes our algorithm the most efficient to date for each value of k. To obtain this result we must turn away from traditional, sweep-line-based schemes. Instead, we introduce a new hierarchical strategy for dealing with segments without ever reducing the dimensionality of the problem. This framework is used to solve other related problems. In particular, we are able to present the first subquadratic algorithm for counting intersections (as opposed to reporting each of them explicitly), and we give the first optimal algorithm for computing the intersections of a line arrangement with a query segment. Using duality arguments we also present an improved algorithm for a point enclosure problem.
Early experiences with Euclid
Authors: David B. Wortman, James R. Cordy
Venue: Proceedings of the 5th international conference on Software engineering (1981)

The programming language Euclid was designed to be used for the construction of reliable and efficient systems software. This paper discusses the authors' experience in the design and implementation of the first large (about 60,000 source lines) piece of software written in Euclid. The emphasis in this paper is on how the various language features in Euclid affected the implementation of the software.
POGO: Programmer-oriented graphics operation
Authors: J. E. Rieber, B. W. Boehm, V. R. Lamb, R. L. Mobley
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

POGO is an operational interactive graphics system which allows one to create inter- active graphics programs with relatively little elapsed time, programming expertise, or graphics expertise. It features a design program for composing CRT control &ldquo;pages&rdquo; by example instead of by programming, and facilities for cleanly inter- facing such pages with FORTRAN computational and control subroutines, and with a standard set of curve input and display pages. The presentation will include a description of our development and usage experience, and a film showing the use of POGO in creating interactive graphics programs for trajectory analysis, for analysis of fluid balance in the human body, and for creating parts of POGO itself.
Plots related to subgradient optimization
Authors: Claudio Sandl
Venue: Proceedings of seventh international conference on APL (1975)

The subgradient optimization procedure used first by Held and Karp for the travelling salesman problem and refined by Held Wolfe and Crowder in a recent paper, seems to be effective for many mathematical programming problems. In this paper some plots related to the concave function to be maximized in the subgradient method are suggested, in order to give insight of this method.
A computer science syllabus for gifted pre-college students
Authors: Richard E. Korf
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

A computer science syllabus was designed for and taught to a group of gifted and talented high school students. A core course included segments on programming in LISP, software systems, digital hardware, theoretical computer science, and artificial intelligence. In addition, some students elected an independent programming project course. It was found that gifted pre-college students can be taught computer science, as opposed to merely computer programming.
Placement of microinstructions in a two-dimensional address space
Authors: John F. Wakerly, Clifford R. Hollander, Daniel Davies
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

The problem of addressing a large address space with a limited number of address bits is an old one [Bell and Newell, 1971]. The problem occurs in mini-computers which, with their short instruction word lengths of 12 to 16 bits, allocate only 8 to 12 bits of each instruction for specifying operand addresses. Hence each instruction can directly access only 28 to 212 words of memory. In order to access the remainder of a large (say 216 word) memory, mechanisms such as bank switching, page registers, base registers, zero/current page addressing, and indirection have been used. Each of these mechanisms allows a subset of the entire address space to be accessed easily while requiring some additional overhead to access the remainder.
Introductory instruction in programming
Authors: Richard W. Conway
Venue: Proceedings of the fourth SIGCSE technical symposium on Computer science education (1974)

Cornell, like most other large schools, has been struggling with the problem of introductory programming instruction for years. The problem is not yet solved but in the last few years we have done some experimenting and seem to have made some progress. The situation seems worth reporting so that others can perhaps benefit from what has been successful and avoid what has not. The major problems seem to be volume and variety. Pedagogical techniques that are obviously effective with small classes are sometimes impractical when faced with more than a thousand students per year. This may be largely a question of economics, since one could presumably allocate enough resources to the task to have small classes, but this is just not realistic at Cornell and the real question becomes one of finding practical large-scale techniques. For example, the central computing facility at Cornell (a 360/65 under OS/HASP) cannot support a sufficient number of interactive terminals to make that mode of instruction practical. Hence our solution must operate within the constraint of a conventional non-inter-active computer service.
Languages for direct execution
Authors: Lee W. Hoevel
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The utility of a modern computing system lies in its capacity to perform a variety of transformations on input data under user control. In the earliest systems users exerted direct, low-level control, indicating the exact transformation to be applied to a data item manually at the time it was to be performed&mdash;in much the same manner as one now controls a small electronic calculator. With the passage of time, this user control medium has become much more sophisticated, culminating in the development of contemporary &ldquo;high-level&rdquo; user-oriented programming languages. The hardware used to implement these systems, however, has not yet reached correspondingly high levels of abstraction. This disparity has caused the implementation of modern computing systems to become increasingly complex&mdash;necessitating the evaluation of various time-space tradeoffs between different levels and/or types of processing. The long-term objective of the investigations described in this paper is to simplify the process of designing &ldquo;good&rdquo; systems, under the constraints imposed by contemporary technologies.
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
Authors: Eugene Fiume, Alain Fournier, Larry Rudolph
Venue: Proceedings of the 10th annual conference on Computer graphics and interactive techniques (1983)

Popular approaches to speeding up scan conversion often employ parallel processing. Recently, several special-purpose parallel architectures have been suggested. We propose an alternative to these systems: the general-purpose ultracomputer, a parallel processor with many autonomous processing elements and a shared memory. The &ldquo;serial semantics/parallel execution&rdquo; feature of this architecture is exploited in the formulation of a scan conversion algorithm. Hidden surfaces are removed using a single scanline, z-buffer algorithm. Since exact anti-aliasing is inherently slow, a novel parallel anti-aliasing algorithm is presented in which subpixel coverage by edges is approximated using a look-up table. The ultimate intensity of a pixel is the weighted sum of the intensity contribution of the closest edge, that of the &ldquo;losing&rdquo; edges, and that of the background. The algorithm is fast and accurate, it is attractive even in a serial environment, and it avoids several artifacts that commonly occur in animated sequences.
Professional development seminars: The horror of the frozen specification
Authors: Alan E. Brill
Venue: Proceedings of the ACM '82 conference (1982)

&ldquo;All that you do when you freeze the specification on a large project is to guarantee that the system you install will be obsolete!&rdquo; Can you imagine actually walking into the office of your most senior user and admitting that the new Whiz-Bang System, installed only last week after a 2-year development cycle, is obsolete? How are you going to explain that you just spent &dollar;12,000,000 to build a system that is 100% in sync with last year's needs? It's hard to imagine so painful a meeting, but when we freeze a spec, what we're doing is trying to serve a dynamic environment with a fixed product. No wonder so many systems face a plague of &ldquo;minor enhancements&rdquo; during the first months of their operating lives. &ldquo;Sure,&rdquo; you say, &ldquo;it's nice to talk about flexibility, but how can we ever get anything done if we can't freeze the specs? That's what this session is all about. How can you maximize flexibility without bogging the project down completely? You'll learn both technical and managerial concepts that can help you to avoid pre-implementation obsolescence and improve user satisfaction.