ppxscal/embedding_network huggingface dataset:
Digital communications technology (Tutorial)
Authors: Henry S. McDonald
Venue: Proceedings of the 1971 26th annual conference (1971)

Projected advances in integrated circuit technology will change the economics of the speed-complexity trade-off in future data sets. Automatic equalizers, multi-level vestigial sideband modulation and high performance reverse channels are examples of the components of terminals which, although expensive today, will rapidly come down in cost. Future data sets will probably adjust their parameters for each dialed-up connection such that the average data rate over a voice channel will go up substantially. Systems improvement made possible by high performance reverse channels will double the throughput in many applications by eliminating data set turnarounds. As a result, the average cost for sending data over the telephone network within the next five years should come down as much as four to one in many cases.
A flexible environment for program development based on a symbolic interpreter
Authors: P. Asirelli, P. Degano, G. Levi, A. Martèlli, U. Montanari, G. Pacini, F. Sirovich, F. Turini
Venue: Proceedings of the 4th international conference on Software engineering (1979)

The paper describes an interactive programming system which provides an integrated collection of tools for dealing with the whole process of program development. The pivot tool, the symbolic interpreter, may cover a broad range of applications, from testing to correctness Proving. The aspects in which the symbolic interpreter differs from a conventional interpreter, i.e. the possibility of handling nondeterministic branching at choice points and the presence of a system for manipulating symbolic expressions, are described. Furthermore, the main features of a programming language, around which the programming system is built, are presented.
Verification testing
Authors: E. J. McCluskey
Venue: Proceedings of the 19th Design Automation Conference (1982)

A new approach to test pattern generation which is particularly suitable for self-test is described. Required computation time is much less than for present-day automatic test pattern generation (ATPG) programs. Fault simulation is not required. More patterns may be obtained than from standard ATPG programs. However, fault coverage is much higher - all irredundant multiple as well as single stuck faults are detected. Test length is easily controlled. The test patterns are easily generated algorithmically either by program or hardware.
An algorithm for shading of regions on vector display devices
Authors: Kurt E. Brassel, Robin Fegeas
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

The display of shaded polygons by line, cross-hatch, and dot patterns on vector devices is a task frequently used in computer graphics and computer cartography. In applications such as the production of shaded maps polygon shading turns out to be critical with respect to time requirements, and the development of efficient algorithms is of importance. Given an arbitrary polygon in the plane without self-crossing edges (simply-connected polygon), the task at hand is to shade this polygon with one or two sets of parallel lines where for each set a shading angle and a line distance are given. The basic concept of this new algorithm is to decompose the polygon into a set of mutually exclusive trapezoids (in special cases triangles) where the parallel edges of the trapezoids are parallel to the desired shading lines. These trapezoids and triangles are then shaded in a fast procedure. In its present form the algorithm handles regions with up to 300 islands. Possible extensions include the construction of dash and cross patterns.
A design verification methodology based on concurrent simulation and clock suppression
Authors: Ernst Ulrich
Venue: Proceedings of the 20th Design Automation Conference (1983)

This Paper outlines a methodology for design verification of very large networks based on Concurrent Simulation and Clock Suppression. Concurrent Simulation is expected to yield a 30:1 to 600:1 speed advantage over conventional (serial) simulation when roughly 5,000 &ldquo;good machines&rdquo; are simulated concurrently. This speed advantage increases with the number of concurrent machines. Clock Suppression is an auxiliary technique to avoid simulation slowdowns if very large networks with very large clock fanouts must be simulated. The methodology proposed here for design verification is &ldquo;Concurrent Case Simulation&rdquo;, i.e., the simultaneous simulation of distinct sets of input patterns. Advantages of this method are (1) speed, (2) the fundamental ability to simulate cases concurrently, (3) to observe differences between cases in a more economic, simpler, and more natural style than with serial simulation, (4) to run many more cases than would be possible with serial simulation, (5) and the fact that running cases against each other establishes a powerful design verification philosophy.
A spiral approach to software engineering project management education
Authors: Joseph C. Spicer
Venue: Proceedings of the 7th international conference on Software engineering (1984)

This paper describes the experiences of an instructor, experienced in management, teaching a software engineering project management course at a school that specializes in software education. A "spiral approach" was used to provide for the parallel acquisition of management knowledge and experience, while building on recently acquired skills in software technology and developing confidence through the successful development of a software product. This paper describes the reason for selecting the approach, the course content, the observation of the students and the instructor, the advantages and disadvantages of the approach as applied, and conclusions. Course objectives were met and course evaluations by students indicated a much higher level of acceptance than previous traditional approaches. The observations indicated that the approach may extend beyond the classroom to the industrial setting where on the job training, career path planning, and management development are of concern.
Adaptive testing
Authors: Dennis W. Cooper
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

The primary vehicle for demonstrating the performance of Ballistic Missile Defense (BMD) software is testing in a simulated environment. The complexity of BMD software logic and the large volumes of input data preclude exhaustive testing. The problem is compounded by limitations on testing time, complicated test procedures, and lack of systematic procedures for performance analysis. This paper describes an approach towards providing an effective means for identifying the boundary of performance of BMD software. The approach, called Adaptive Testing, uses performance data to systematically redefine input data that will produce some specified level of system performance. Components of the Adaptive Testing technology include an interactive scenario generator, a performance evaluator, an adaptive algorithm for test case perturbation, and a System, Environment, and Threat Simulator (SETS). Problems associated with the approach are discussed as well as the expected payoff.
Four-valued threshold logic full adder circuit implementations
Authors: K. W. Current, D. A. Mow
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

A four-valued logic full adder accepts two four-valued inputs and a binary carry input and produces a two-quaternary-digit, base-four, output word that is the sum of the values of the inputs. In this paper we present two new current-mode logic realizations of the four-valued logic full adder. Also reviewed is a recent I2L realization of this function. In some applications, the use of these four-valued logic full adders requires fewer than 50% of the devices necessary to implement the same function with binary full adders.
A Bayesian batch means methodology for analysis of simulation output
Authors: Richard W. Andrews, Thomas J. Schriber
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

The purpose of this research is to investigate the use of Bayesian methodology in the analysis of simulation output. Specifically, the Bayesian methodology is introduced in the context of the batch means procedure for building a confidence interval for the output mean. We assume that the output process is at steady state or equivalently that the output process is second order stationary. We also assume that the length is fixed at say n. So the output process can be given by X1, X2, ..., Xn,a sequence of observations from a continuous state stationary stochastic process with mean M, variance O2x and autocorrelation function {Pi}@@@@I&equil;l This Bayesian batch means methodology has been thoroughly tested. The five measures of effectiveness suggested in Schriber and Andrews (1981) are reported for a variety of simulated theoretical output processes. In addition, each run is compared with various batch means procedures.
A function oriented corporate network
Authors: P. S.-C. Wang, S. R. Kimbleton
Venue: Proceedings of the eighth symposium on Data communications (1983)

The ITT/NET is an internal corporate network built to satisfy the distributed programming requirements of ITT technology and engineering communities. This paper describes the network: its goals, its architecture, its operational environment and prototype development activities. The various issues involved in the construction of a Corporate Network based upon diverse, existing systems and communication methods are described in detail. The architectural and implementation decisions are discussed and justified. The programming process and the methodologies adopted are presented and some conclusions are drawn as to the practicality and usefulness of formal development methods in the context of this particular project.
Computing futures: SIGUCC User Services Conference V
Authors: Jean Bonney
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

In the final session of the ACM SIGUCC User Services Conference V, all conferees were asked to consider &ldquo;The Future of User Services.&rdquo; Approximately 125 university computing-center staffers&mdash;including programmers, writers, consultants, and directors&mdash;brainstormed in groups of six to ten. Each group then attempted to organize and document their thoughts&mdash;a tall order in three hours. The workshop provided a time to reflect without the pressures of the normal &ldquo;priority-interrupt&rdquo; working world, and to assimilate ideas accumulated from previous sessions. This is, I think, a productive approach; I would like to see it applied more often by the User Services community.
Applications of the G and B transforms to the Laplace transform
Authors: H. L. Gray, T. A. Atchison
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

In several recent papers the present authors have introduced some new nonlinear transformations which are useful in numerical evaluation of improper integrals of the first kind.1,2,3 A question which naturally arises is, to what extent are these transformations useful in the numerical evaluation of certain integral transforms? In this paper the use of these transformations in numerical evaluation of Laplace transformations is investigated. Some simple examples are included.
Analysis of Queueing Network Models with population size constraints and delayed blocked customers
Authors: Alexander Thomasian, Paul Bay
Venue: ACM SIGMETRICS Performance Evaluation Review (1984)

Queueing Network Models - QNM's with population size constraints and delayed blocked customers occur due to MultiProgramming Level - MPL constraints in computer systems and window flow-control mechanisms in Computer Communication Networks - CCN's. The computational cost of existing algorithms is unacceptable for large numbers of chains and high population sizes. A fast approximate solution technique based on load concealment is presented to solve such QNM's. The solution procedure is non-iterative in the case of fixed rate Poisson arrivals, while iteration is required in the case of quasi-random arrivals. Each iteration requires the solution of a single chain network of queues comprised of stations visited by each chain. We then present an algorithm to detect saturated chains and determine their maximum throughput. A fast solution algorithm due to Reiser for closed chains is also extended to the case of quasi-random arrivals. The accuracy of the proposed solution techniques is compared to previous techniques by applying it to a test case, reported in the literature, and a set of randomly generated examples.
Vertical integration in group learning
Authors: R. D. Parslow
Venue: Proceedings of the eleventh SIGCSE technical symposium on Computer science education (1980)

This paper is mainly concerned with the teaching of Computer Science to first year (freshman) students. The method outlined is an attempt to change their generally 'convergent' attitudes into a more 'divergent' way of tackling problems. One of the most wasteful features of modern education is the vertical separation of students, so that the collective wisdom acquired by one generation is unavailable to the next. Merely talking to those who have successfully overcome their problems is a great encouragement, and the presence of a senior acts as a catalyst in a group. One special feature of the Brunel University position is that third and second year students have experienced work periods as &ldquo;students.&rdquo; Few of the lectures can comment on this aspect of the course from personal experience, so if real guidance is to be given it must be from &ldquo;older&rdquo; students. These students will have assimilated the group methods used in industry, commerce and research and will be able to organize their group to pass on their experience by example. Our attempt at vertical integration involves treating all the students in a less paternalistic fashion and one feature of this, is to make the participation of senior students voluntary, with no &ldquo;credits&rdquo; for work contributed. We hope that as well as enjoying the experience, they will respond and gain from the reflection on other subjects.
Presburger arithmetic with bounded quantifier alternation
Authors: C. R. Reddy, D. W. Loveland
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

This paper concerns both the complexity aspects of PA and the pragmatics of improving algorithms for dealing with restricted subcases of PA for uses such as program verification. We improve the Cooper-Presburger decision procedure and show that the improved version permits us to obtain time and space upper bounds for PA classes restricted to a bounded number of alternations of quantifiers. The improvement is one exponent less than the upper bounds for the decision problem for full PA. The pragmatists not interested in complexity bounds can read the results as substantiation of the intuitive feeling that the improvement to the Cooper-Presburger algorithm is a real, rather than ineffectual, improvement. (It can be easily shown that the bounds obtained here are not achievable using the Cooper-Presburger procedure).
Corsim - a dynamic assembly line simulation
Authors: R. C. Pasternak
Venue: Proceedings of the second conference on Applications of simulations (1968)

Corsim is a GPSS program used to experiment with and evaluate changes to an assembly line process for assembling computer memory core planes. The program handles such typical tasks as: two shift operation with independent product assembly but intermixed product test; on the spot transfer of operators to alleviate waiting lines; random defect generation in products with proportionate corrective delays. Corsim is not a generalized assembly line program, but it does demonstrate techniques which can be applied to similar manufacturing simulations.
SIGART (Paper Session)
Authors: Robert Wilensky, Robert F. Simmons, Arvin Levine, Mitchell Marcus
Venue: Proceedings of the 1976 annual conference (1976)

Natural language processing has had a spurt of interest in recent years, due in part to a new focus on the representation and structure of knowledge. The papers in this session cover all ends of natural language research, parsing, generating, and memory and inference. The advances to be reported on here indicate that the possibility of natural communication with machines may be closer than had been anticipated.
A case for teaching program verification: Its importance in the CS curriculum
Authors: Ali Mili
Venue: Proceedings of the fourteenth SIGCSE technical symposium on Computer science education (1983)

Because of its relevance to program analysis and, ultimately, to program synthesis, the area of formal verification of program correctness is an important part of the education of the programmer and the computer scientist. A case is presented in this paper to advocate the teaching of the formal verification of computer programs. This case is based on three major arguments: - The Why, i.e. the need for including a course on program verification in the computer science curriculum, - The What, i.e. the technical contents of such a course as highlighted by the current state of the art, - The How, i.e. the logistic feasibility of such a course within a fifteen-week semester.
A computerized interactive financial forecasting system
Authors: Philip M. Wolfe, Donald F. Deutsch
Venue: Proceedings of the 6th conference on Winter simulation (1973)

A computerized interactive forecasting system has been developed for the Finance Department at the Semiconductor Products Division of Motorola Inc. While being basic in its operation, the financial forecasting system has permitted the analysis of large amounts of data on a timely basis. Interactive profit and loss forecasting models have been developed which represent the various operating levels of responsibility in the Division in both domestic and international areas. The financial analyst, from a remote terminal, can communicate with the computer to access, update and report forecast data as well as manipulate any or all of the financial models. The forecasting system was designed to place complete control of operation in the hands of the users, and also to provide flexibility in adapting to constantly changing financial forecasting requirements.
A Q-GERT network simulation model for a voice-data communication system
Authors: Philip Y. Huang
Venue: Proceedings of the 15th conference on Winter simulation - Volume 1 (1983)

A generalizable Q-GERT network simulation model for a hypothetical voice-data communication system with infinite buffer system, two transmission channels, and random server interruptions is provided in this paper. Simulation results of various traffic intensities and interruption processes are provided to demonstrate the flexibility of this simulation model. Experiments have been conducted under following conditions: 1) Poisson arrivals, 2) constant data transmission rate, 3) geometric talkspurts, 4) two geometric silence gaps (short and long), and 5) three discrete probability distributions of having a short silence gap. The results have indicated a dramatic increase in buffer storage requirement when there are more frequent data arrivals and more short silence gaps.
UCAD: Building Design Automation with general purpose software tools on UNIX
Authors: James H Tomkinson
Venue: Proceedings of the 20th Design Automation Conference (1983)

This paper describes a unique approach to a successful Design Automation system. It is an evolutionary approach, building on flexible, general purpose UNIX software tools. It is useful in such areas of design as circuit schematics, custom IC, backplanes, software code generation, building space management, music composition and many others. Examples from a two year design automation effort known as UCAD are included.
A theoretical performance analysis of polling and carrier sense collision detection communication systems
Authors: E. Arthurs, B. W. Stuck
Venue: Proceedings of the seventh symposium on Data communications (1981)

A set of stations wish to transmit messages to one another over a shared link. Messages are generated either according to so called finite source or infinite source arrival statistics. The message lengths are independent identically distributed random variables. Two policies for arbitrating contention are compared: polling, and carrier sense collision detection. The maximum mean throughput rate and mean message delay is calculated as a function of model parameters.
APL comparison tolerance
Authors: R. H. Lathwell
Venue: Proceedings of the eighth international conference on APL (1976)

An important aspect of the original implementation of APL\360 was the treatment of arithmetic functions as abstract functions defined on the continuous set of real numbers [1,2]. This had various consequences, including automatic conversion between different machine representations of numbers so that storage and other aspects of System/360 architecture could be used efficiently while suppressing its details. [2] &ldquo;Fuzzy&rdquo; comparisons were introduced so that the actual discrete, fixed-precision, hexadecimal representation could be partly disguised The technique used in the original implementation was to regard numbers whose difference was zero in the first twelve (of fourteen) hexadecimal digits to be equal. The definitions in [3] were developed by M. A. Jenkins and R. H. Lathwell in 1968 when it was found that, for some values, implications of relational functions such as B> A&larr;&rar;&tilde; B&le; A were violated. It was later discovered that these definitions did not completely correct the difficulty, and when APL system variables were introduced [4], the tolerant functions were rederived, resulting in the definitions given here.
A space improvement in the alternating semantic evaluator
Authors: Mehdi Jazayeri, Diene Pozefsky
Venue: Proceedings of the ACM 1980 annual conference (1980)

It is possible to reduce the space requirements of pass-oriented attribute grammar evaluators by abandoning the traditional bias towards evaluating an attribute as early as possible. Two techniques for achieving this improvement are presented. Empirical data show the superiority of these techniques over traditional evaluation methods.
Picture primitives in device independent graphics systems
Authors: R. Daniel Bergeron
Venue: ACM SIGGRAPH Computer Graphics (1976)

Current device independent graphics systems define their graphical output primitives (picture primitives) in a very ad hoc manner. This paper identifies the approaches taken by some typical systems, suggests a formalization of the concept of a picture primitive, and proposes an implementation framework for a device independent graphics system.
On the compactification and enumeration of distinct fuzzy switching functions
Authors: Abraham Kandel
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

In this paper we are concerned with the study of compactification and enumeration of fuzzy switching functions. We use compactness in the sense of achieving a greater degree of simplification in the mode of representation of these functions, similarly to the way used in Zadeh (1976). Novel techniques for the enumeration of fuzzy switching functions are discussed. The approach described in this paper provides a framework for solving the enumeration problem through the use of combinatorial arguments.