ppxscal/embedding_network huggingface dataset:
A unified algorithm for designing multidrop teleprocessing networks
Authors: W. Chou, A. Kershenbaum
Venue: Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design (1973)

The problem of designing minimum cost multidrop lines which connect remote terminals to a concentrator or a central data processing computer is studied. In some cases, optimal solutions can be obtained by using either linear integer programming or a branch-bound method. These approaches are not practical since they lack flexibility and require an enormous amount of computer time for most practical problems. As a consequence, heuristic algorithms have been developed by various authors. In this paper, we point out that all of these algorithms fall into the class of minimum spanning tree problems, constrained by traffic or response time requirements. The difference between them is mainly the sequential order with which a branch or a line is selected into the tree. Without the constraints, all algorithms converge to a minimum spanning tree. With the constraints, they form different sub-trees. Most of the algorithms can be unified into a modified Kruskal's minimum spanning tree algorithm. In the modified algorithm, a weight is associated with each terminal. Let Wi be the weight associated with terminal i, and dij be the cost for the line directed from terminal i to terminal j. When the algorithm fetches the cost for the line, it replaces it with dij - wi In some cases, Wi's need to be readjusted in the middle of the algorithm. The difference between all existing heuristic algorithms is in the way wi's are defined. If wi is zero for all i, the algorithm reduces to the unmodified Kruskal's algorithm; if wi is set to zero whenever a line incident to terminal i is selected as a tree branch, the algorithm reduces to Prim's minimum spanning tree algorithm. An extension of the algorithm to the solution of an associated problem of partitioning the terminals with respect to a predetermined set of concentrators, multiplexers, terminal interface processors, or central computers is also derived. The efficiency of an algorithm depends greatly on how it is implemented. The computational complexity of the unified algorithm is in the order of N2 log N for the most general case, where N is the number of terminals. By using good heuristics, it reduces to K1 K log N + K2 N, where K1 and K2 are constants, for many practical applications. The algorithm has been applied to large networks with over 1,000 terminals, yielding excellent results and using only 15 seconds of computer time on a CDC 6600 computer. Designs obtained by using different wi's are compared.
SIGSOC (Paper Session)
Authors: Lorraine Borman, Gregory J. Suski, Kenneth L. Kraemer, John A. Sonquist, Richard C. Roistacher, Barbara B. Noble, James L. Ross, Mark Hayes
Venue: Proceedings of the 1976 annual conference (1976)

How new computing techniques become adopted by academic and government users is not well understood. The papers and discussion in this session will explore the mix of human, organizational, and technical considerations which confront anyone who hopes to offer and develop the use of innovative computer services.
An algorithm and data structure for 3D object synthesis using surface patch intersections
Authors: Wayne E. Carlson
Venue: ACM SIGGRAPH Computer Graphics (1982)

There are several successful systems that provide algorithms that allow for the intersection of polygonal objects or other primitive shapes to create more complex objects. Our intent is to provide similar algorithms for intersecting surface patches. There have been contributions to this concept at the display algorithm level, that is, computing the intersection at the time the frame is generated. In an animation environment, however, it becomes important to incorporate the intersection in the data generation routines, in order that those parts of the intersected object that never contribute to an image are not processed by the display algorithm. This only increases the complexity of the object unnecessarily, and subsequently puts an additional burden on the display algorithms. An algorithm is described which uses a modified Catmull recursive subdivision scheme to find the space curve which is the intersection of two bicubic patches. An associated data structure is discussed which incorporates this curve of intersection in the patch description in a way suitable for efficient display of the intersected object. Sample output of these intersections are shown which serve to illustrate the capabilities and limitations of the described procedures.
Factor screening methods in computer simulation experiments
Authors: Douglas C. Montgomery,  Ph.D., Ginner Weatherby
Venue: Proceedings of the 11th conference on Winter simulation - Volume 2 (1979)

The use of a computer simulation model may be viewed as an experiment in which a set of k controllable factors are varied according to an experimental design, and the effect of these factors on the output observed. Usually not all k factors will be active, and considerable efficiency in the use of the model will result if the subset of active factors can be identified. Factor screening methods are useful in identifying the set of active factors. This paper discusses experimental design methods useful for factor screening in computer simulation. The general strategy recommended is group screening methods combined with 2k&minus;p fractional factorial designs. Some variance reduction considerations are also discussed.
Validating simulation models
Authors: Robert G. Sargent
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

In this paper we give a general introduction to model validation, define the various validation techniques, discuss conceptual and operational validity, and present a recommended model validation procedure.
Assessing the climate for change: A methodology for managing human factors in a computerized information system implementation
Authors: David G. Hopelain
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

It is now well established that computers and other information technologies are instruments of organizational change. That is, successful implementation of an information system will change the way in which organizational members do their work. There is an extensive literature on social change which characterizes the change process and how to manage it. In particular, there is a subset of this literature which concerns the implementation of computerized information systems
The design and implementation of a real-time sound generation system
Authors: Paul Dworak, Alice C. Parker, Richard Blum
Venue: Proceedings of the 4th annual symposium on Computer architecture (1977)

This paper describes the design and partial implementation of a real-time sound generation system currently being built at Carnegie-Mellon University. The overall design process is followed, and design decisions are discussed in the light of design goals and overall system constraints. The resulting system consists of a keyboard which is light controlled and an array of microprocessors functioning in a pipeline fashion.
Performance of algorithms for initial placement
Authors: Michael Palczewski
Venue: Proceedings of the 21st Design Automation Conference (1984)

This paper analyzes the performance of a commonly used class of methods for initial placement and describes several new classes. The classification in this paper is based on common methods of problem-solving used in artificial intelligence (AI) approaches. The paper does not describe the details of algorithms; instead it focuses on the qualitative performance.
A method for IC layout verification
Authors: Ola A. Marvik
Venue: Proceedings of the 21st Design Automation Conference (1984)

A method for MOS integrated circuit layout verification based on net list extraction and logic simulation is presented. The net list elements are on the gate level or higher, defined by the user. A self developed net list extractor, NETEX, is described. NETEX is interfaced to a commercially available layout system and logic simulator. Results show that this is a fast and reliable way of connectivity checking. Limitations and further improvements are discussed.
On finding the exact solution of a zero-one knapsack problem
Authors: A. V. Goldberg, A. Marchetti-Spaccamela
Venue: Proceedings of the sixteenth annual ACM symposium on Theory of computing (1984)

Given a 0-1 knapsack problem with input drawn from a certain probability distribution, we show that for every &egr; > 0, there is a self-checking polynomial-time algorithm that finds an optimal solution with probability at least 1 -&egr;. We also prove some upper and lower bounds on random variables related to the problem.
Computer science education for industry software personnel (Panel Session)
Authors: Thomas M. Kraly
Venue: Proceedings of the ACM 1980 annual conference (1980)

This panel discussion was convened to share experiences and ideas on an issue which is critical to our profession. Advances in computer science hold forth a promise of increased quality of software development in industry. Yet the industry is composed of a large number of very experienced personnel lacking this computer science knowledge. Thus the issue is how these experienced members of our profession can be taught computer science topics in a way which promotes the usage of the technology in industrial environments.
A place for assembler in structured programming
Authors: John Beidler
Venue: Proceedings of the seventh SIGCSE technical symposium on Computer science education (1977)

Today, with the thrust being made with structured programming, questions arise concerning the relevance of assembler language code. The purpose of this paper is to defend assembler language programming by showing its relevance and to show how we present the course with a structured programming emphasis. In the sections that follows, we show the relevance of assembler through two examples of the use of assembler language coding. These examples show two extremes, one involves the development of a theoretical result in mathematics, the other shows the use of assembler in a commercial environment. Section 3 provides an overview to our approach in the course and how we view the role of assemblers in structured programming. Section 4 illustrates our approach to programming assignments and section 5 describes our approach to evaluating assignments.
Inter-active graphic methods for automating mechanical engineering design and analyses
Authors: Jacob M. Miller
Venue: Proceedings of the 17th Design Automation Conference (1980)

Automating of mechanical engineering design, drafting, structural modelling and analyses is being implemented at EOSC with interactive graphic time share terminals. It was recognized that for reducing costs in mechanical engineering tasks and to stay competitive in the industry, these tasks had to be automated. Previously these tasks used labor intensive manual design and drafting methods, and structural modelling with batch processing. Trade-off evaluations and vendor surveys were conducted of several automated drafting and structural modelling systems. The decisions made after the evaluations was to use currently available soft-ware and Tektronix terminal equipment for inter-active communications with host computers. This paper discusses how mechanical design, and structural modelling and analyses have been automated at EOSC using inter-active graphics and time-share terminals.
Polynomial complete scheduling problems
Authors: J. D. Ullman
Venue: ACM SIGOPS Operating Systems Review (1973)

We show that the problem of finding an optimal schedule for a set of jobs is polynomial complete even in the following two restricted cases. (1) All jobs require one time unit. (2) All jobs require one or two time units, and there are only two processors. As a consequence, the general preemptive scheduling problem is also polynomial complete. These results are tantamount to showing that the scheduling problems mentioned are intractable.
Hardware support for concurrent programming in loosely coupled multiprocessors
Authors: H. K. Reghbati, V. C. Hamacher
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Various possible implementation schemes for concurrent programming concepts are surveyed. Based upon this examination, computer design features are proposed which assist in the efficient realization of concurrent programming concepts in a multiprocessor machine which is constructed from a number of self-contained processors, each with its own random access memory. It is indicated how the proposed architecture provides hardware support for creating and terminating parallel execution paths. The hardware supports scheduled sharing of resources as its basic design feature. In particular, the problem of implementing scheduled waits in monitors is examined in detail. This is done in an environment where processes distributed among several physical processors are using a common monitor. It is also shown how the practical aspects of error resynchronization can be handled efficiently.
Development of an intermediate course for applications programming
Authors: Thomas L. Gerber
Venue: Proceedings of the seventh annual conference on SIGCPR (1969)

There was much to be learned from the development of ICAP-we learned to be a little more hesitant about taking on a task of that difficulty again. ICAP taught its developers a great deal, because ICAP is an unusual, perhaps unique course. The idea of ICAP originated during November, 1965, in the minds of a select group of members of the Selection, Evaluation, and Training (SET) Committee of GUIDE. Their original desire was to produce an advanced programming course, but as they discussed it they realized that a greater need existed for intermediate training in programming.
Motivating freshmen engineering students
Authors: R. T. DeLorm, T. C. Smith
Venue: ACM SIGCSE Bulletin (1975)

In an effort to lower the rate of attrition of Engineering students, during the early years of their education, the University of Nebraska - Lincoln has instituted a series of two freshman engineering courses which are designed to motivate and retain these students. A description of each of these courses and the motivating factors of each are discussed. Creative plots and conceptual engineering design projects are used as a means of holding interest and teaching the basic engineering skills. Surveys taken over a number of years have shown an increase in the retention of engineering students since these courses were instituted. These surveys are discussed.
A contract can make your customers love you
Authors: Barbara B. Wolfe
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

Until quite recently contracts within user services or within a university computing center primarily dealt with vendors of hardware and software. Recently within the Wayne State University Computing Services Center the contract has been considered the most reasonable way to deal with customers. This has developed primarily because we have expanded our customer base to include extra-university projects, thereby appearing more like a service bureau. We are by no means experts in writing contracts and we do not have a lawyer on our staff. The reason I proposed this topic for SIGUCC is that I wanted to promote discussion of this topic since we at WSU are novices and perhaps could benefit from feedback from other centers. Consequently, this is not really a formal paper for presentation but rather my thinking on the topic which hopefully can generate some discussion.
Using a personal computer as a debug engine
Authors: Sten Minor, Per-Olov Nilsson
Venue: Proceedings of the 1983 ACM SIGSMALL symposium on Personal and small computers (1983)

Many debugging systems suffer from poor user interfaces (line oriented displays, obscure command structure). Modifying such systems can be difficult or impossible. However, the utility of an existing debugging system can be improved by using a high performance personal computer with graphic facilities to build a user interface to the debugger. This allows improving the user interaction by employing a more natural human &ldquo;language&rdquo;, and a more logical and understandable display, typically with a minimum investment of time and effort. The design and implementation of such a system are described, along with comments on the applicability of the technique to multiple host systems. A sample user session demonstrates the enhanced capability of the resulting system.
Information systems design through an existing simulation application
Authors: Gerald T. Mackulak, Dae S. Surh, Colin L. Moodie
Venue: Proceedings of the 13th conference on Winter simulation - Volume 2 (1981)

Large scale information systems have been finding increased application in areas of industrial control. Integrated system planning techniques require comprehensive examinations of all aspects of system integration if global optimization goals are to be realized. Simulation provides a methodology whereby potential information and control systems can receive such analysis prior to any system creation. In many cases, an existing simulation can prove to be sufficient for examination of data flow requirements in a general system design.
Region competition: unifying snakes, region growing, energy/Bayes/MDL for multi-band image segmentation
Authors: S. C. Zhu, T. S. Lee, A. L. Yuille
Venue: Proceedings of the Fifth International Conference on Computer Vision (1995)

We present a novel statistical and variational approach to image segmentation based on a new algorithm named region competition. This algorithm is derived by minimizing a generalized Bayes/MDL (Minimum Description Length) criterion using the variational principle. We show that existing techniques in early vision such as, snake/balloon models, region growing, and Bayes/MDL are addressing different aspects of the same problem and they can be unified within a common statistical framework which combines their advantages. We analyze how to optimize the precision of the resulting boundary location by studying the statistical properties of the region competition algorithm and discuss what are good initial conditions for the algorithm. Our method is generalized to color and texture segmentation and is demonstrated on grey level images, color images and texture images.
An experimental system for power/timing optimization of LSI chips
Authors: B. J. Agule, J. D. Lesser, A. E. Ruehli, P. K. Wolff
Venue: Proceedings of the 14th Design Automation Conference (1977)

An experimental system of programs is described which places logic gates on a chip, globally wires the gates and then optimizes the power required to drive them. Further power reductions are realized by using power-oriented placement improvement techniques. A companion paper describes how the optimization is accomplished by using the timing requirements of the chip as constraints and assigning delays to the logic gates so that these constraints are met and the power is minimized.
Industrial dynamics simulation of the effects of advertising on production&mdash;distribution system
Authors: C. L. Hwang, Reza Shojalashkari, L. T. Fan
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

Industrial dynamics simulation is employed to investigate the effects of some advertising practices on the behavior of production-distribution system. An advertising model is reformulated in the framework of industrial dynamics and is incorporated into the system model. Three different variations of the advertising model are considered: protracted, short-time intensive, and impulse type. The results of the system simulation, obtained on a DYNAMO compiler, are compared on the basis of such criteria as the total cost of production and inventory, fluctuations in system variables, and total sales generated. Protracted and impulse type campaigns seem to be the most feasible. The choice between the two depends on the product type as well as on the production and inventory policies.
A checklist for program design in a university environment
Authors: Herbert C. Kugel
Venue: Proceedings of the 8th annual ACM SIGUCCS conference on User services (1980)

The purpose of this paper is to consider a checklist of significant items in system design. The article considers problem definition and the general consideration of various classes of applications, and from this, goes on to consider problems of implementation both from the individual and the group frame of reference. Some significant items in system design are then discussed as are the ramifications of the choice of the high level language, procedural or non-procedural. Human factors are then considered with an emphasis in this area since it is felt that the long term success of the program (not the project) depends on these.
Selecting languages for pedagogical tools in the computer science curriculum
Authors: Carol Smith, Jon Rickman
Venue: Proceedings of the sixth SIGCSE technical symposium on Computer science education (1976)

The selection of languages for use as pedagogical aids in the teaching of computer science is still a big issue at most universities. The rebellion against FORTRAN has given rise to numerous heirs to the throne, eg, PL/1, ALGOL, PASCAL, etc. In deciding how to resolve this issue small departments have to consider the effect the decision might have on the productivity of their faculty. The analysis of this problem as viewed at SIU-Carbondale is described within. The analysis is performed by applying a set of criteria to a list of potential languages.
Performance of memory configurations for parallel-pipelined computers
Authors: Fayé A. Briggs
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

The performance of various memory configurations for parallel-pipelined computer which execute multiple instruction streams on multiple data streams is investigated. For a parallel-pipelined processor of order (s,p), which consists of p parallel processors each of which is a pipelined processor with s degrees of multiprogramming, there can be up to s p memory requests in each instruction cycle. The memory, which consists of N(&equil;2n) identical memory modules, is organized such that there are l(&equil;2i) lines and m(&equil;2n&minus;i) modules per line, where each module is characterized by the address cycle (address hold time)and memory cycle of a and c time units respectively. The performance which is affected by the memory interference problem is evaluated as a function of the memory configuration, (l, m), the module characteristics (a, c) and the processor order (s, p). Design considerations are discussed and an example given to illustrate possible design options.
Federal Funding For Basic Research In Computer Science
Authors: Kent Curtis, Marvin Denicoff, William Gevarter, James Poole
Venue: Proceedings of the 1978 annual conference (1978)

Each panelist, representing a different Federal agency, will discuss his agency's approach to the support of basic research in computer science and engineering. Some of the topics to be discussed include 1)areas of current activity; 2)budgets; and 3)procedures for making grant applications.
Problems facing large Health Information Systems
Authors: Lou S. Davis
Venue: Proceedings of the ACM annual conference (1973)

So many problems exist in implementing large Health Information Systems that a short position paper as this would hardly be able to list them all in the allotted space&mdash;let alone discuss them. Consequently, I would like to address just three significant fundamental problems. These three, I believe, are largely responsible for the delays in implementing large systems and possibly explain the fact that there are no successful comprehensive Health Information Systems working today.