ppxscal/embedding_network huggingface dataset:
Optimal Transmission Radius for Flooding in Large Scale Sensor Networks
Authors: Marco Zúñiga, Bhaskar Krishnamachari
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

One of the principal characteristics of large scale wireless sensor networks is their distributed, multi-hop nature. Due to this characteristic, applications such as query propagation rely regularly on network-wide flooding. Besides consuming energy and bandwidth resources, the flooded packet may keep the transmission medium within the network busy for too long, reducing overall network throughput. We analyze the impact of the transmission radius on the average settling time ¿ the time at which all nodes in the network finish transmitting theflooded packet. We show that for large wireless networks there exists a transmission range which minimizes the settling time ¿ corresponding to an optimal tradeoff between reception and contention times.
Techniques for computer administered examinations of restricted or confidential material
Authors: Leslie N. Davis, Daniel J. Macero
Venue: Proceedings of the sixth international conference on APL (1974)

The administration of examinations via computer techniques creates special problems of security. APL has been shown to be a powerful and versatile medium for sophisticated CAI programming and is well suited to computer administered examination (CAE) applications. The APL PLUS (distributed by Scientific Time Sharing Corp.) extensions to basic APL provide virtually every resource desireable for CAE schemes which are flexible and have a high degree of confidentials. The use of APL and APL PLUS in designing and administering CAI and CAE restricted or confidential material are discussed.
Projective representations for energy band calculations
Authors: Ray Head
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

This paper is then divided into two sections. In Section I we more precisely state the relation between the irreducible representations of the group of the wave vector and the projective representations of the associated point group and also develop needed machinery from the theory of projective representations. The algorithm is presented in Section II and the theorems required for its formulation are proved.
An instructional interpreter for basic
Authors: Avron Barr, Marian Beard
Venue: Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education (1976)

The BASIC Instructional Program (BIP) was developed to investigate tutorial modes of interaction in computer-assisted instruction (CAI). BIP is a problem-solving laboratory that helps students while they are solving introductory programming problems in the BASIC language. The problems are presented in an individualized sequence based on a representation of the structure of the curriculum and a model of the student's state of knowledge. This paper describes the BIP system, with emphasis on recently developed features. The goal of the tutorial laboratory is informative interaction with the student, which is provided by an instructional BASIC interpreter, information on BASIC syntax cross-referenced with the BIP student manual, and debugging aids. The system also has access through the curriculum representation to features that the student may use to help her solve her current problem. These features include hints, easier &ldquo;subtasks,&rdquo; a stored solution that can itself be executed, and an interactive flow chart representation of the solution. The nature of the student-BIP interaction is captured in an annotated student dialogue of a typical session.
Augmented Video Conferencing
Authors: Timothy K. Shih, Jung-Ken Chuang, Nigel H. Lin, Aiguo He
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

Distance learning programs use on-line video records to deliver pre-recorded lectures. And, video communication systems can be used as a discussion tool. In this paper, we start our discussion on a multimedia presentation recording system which we had developed. We thenpresent how the video recording concept can be further extended to realize an augmented video conferencing system, which can be used as a peer-to-peer discussion tool, as well as a lecture broadcasting system. We also point out that an object tracking technology can be further integrated to enhance the tool, to enable a more realistic and useful system for the discussion in distance education.
Interactive on-line computing in structural design
Authors: William H. Rowan,  Jr., Stanley D. Lindsey
Venue: Proceedings of the 7th Design Automation Workshop (1970)

An approach to building an open ended interactive structural design system for use from a remote time-sharing console is presented. The system is modular and hence may be modified by adding or deleting modules or adjusting various modules to reflect building code changes or the availability of new materials. The connectivity of the system is determined largely by the designer who provides the interface. As the designer becomes more familiar with a particular aspect of a design he may wish to take short cuts and have the system evaluate how successful he has been. Relative cost analysis of workable designs provides a basis for judging his success and in this sense the system could be used as a design game in design education. One of the greatest advantages of this system is the ability to retain current information that in the future may be needed to make modification to a particular design. The logging module may be used to retain a log of the current status of design results that have been retained in active files. A simplified example problem is presented to illustrate the use of the system in the design office.
A software system for Automated Placement And Wiring of LSI chips
Authors: Pao-Tsin Wang, P. E. Bassett
Venue: Proceedings of the 16th Design Automation Conference (1979)

This paper describes the Automated circuit Placement and Wiring programs used in IBM in conjunction with an FET Automatic Design System.
&ldquo;Automatic generation of data conversion programs using a data description language&rdquo;
Authors: J. A. Ramirez, N. A. Rin, N. S. Prywes
Venue: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) workshop on Data description, access and control (1974)

The paper describes the application of automatic program generation methodology in generating file conversion programs. The system, accepts as input descriptions of source and target files in a Data Description Language (DDL) and data manipulation specifications in a Data Manipulation Language (DML). It produces as an output a conversion program in PL/1 capable of converting the source file and producing the target file.
Updating systems specialists
Authors: Jacek Kryt
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

The proposition to update systems specialists begs two questions: who will do it and what they will teach? The area of computer studies is technology driven. Changes in technology echo through systems and methodologies. Hardware and languages come with detailed manuals. It is possible to incorporate them rapidly in our curricula. But a very essential area of Systems Analysis and Design (SAD) relates to application of technology to user functional systems. New areas of usefulness and new techniques are discovered and tested by best-practice installations. Only gradually they spread in industry. It may take years before the practice is universally accepted or rejected. For a long period of time the documentation of these new developments is sketchy. Ultimately textbooks appear. We can start teaching these topics with a delay of five to ten years, probably at the time when already another approach is used in industry. (Figure 1). Creating an Information Systems Research Centre is the step in the right direction. It opens a few direct and shorter communication channels between industry and academia. But an advanced SAD course, offered as a co-operative effort between industry and universities, with a high proportion of lectures given by leading-edge industry lecturers would be the ultimate weapon fighting obsolescence of both systems specialists and MIS teachers.
Some NP-complete geometric problems
Authors: M. R. Garey, R. L. Graham, D. S. Johnson
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

We show that the STEINER TREE problem and TRAVELING SALESMAN problem for points in the plane are NP-complete when distances are measured either by the rectilinear (Manhattan) metric or by a natural discretized version of the Euclidean metric. Our proofs also indicate that the problems are NP-hard if the distance measure is the (unmodified) Euclidean metric. However, for reasons we discuss, there is some question as to whether these problems, or even the well-solved MINIMUM SPANNING TREE problem, are in NP when the distance measure is the Euclidean metric.
Delinquency theories: An integrating simulation model
Authors: Jerald E. Maiers
Venue: Proceedings of the 9th conference on Winter simulation - Volume 1 (1977)

Five theories of the origin of juvenile delinquency are incorporated into a DYNAMO language social system simulation. The model framework includes population, education and economic systems. The model also contains cultural or value factors which are partially linked to the model framework. The model demonstrates the possibility of multidimensional sociological theory models and the need for quantitative modeling in the social science area. The juvenile delinquency theory model has shown that changes in even a single social system variable can generate counterintuitive outcomes. The model is offered as a potential tool for theoretical, policy and instructional use.
SETL-a very high level language oriented to software systems prototyping
Authors: Jack Schwartz
Venue: ACM SIGAPL APL Quote Quad (1981)

SETL, like APL, is a language which facilitates manipulation of large relatively abstract data objects, namely sets, vectors, and maps, whose elements may in turn be sets, vectors, or maps. This language has been used to develop executable prototypes of several large software packages, including a full compiler for the new DoD Ada language. This talk will describe the man semantic features of SETL, and assess its use as a software prototying tool.
Dismantling the mystique: The changing role of documentation
Authors: Karen Haider
Venue: Proceedings of the 10th annual ACM SIGUCCS conference on User services (1982)

The value of a product, whether a simple garden tool or a multimillion dollar computer, depends on how well it fulfills the function for which it was designed. If a product is difficult to use, it is unlikely its full capability will be utilized. One of the primary influences on the role of documentation today is the increasing emphasis on &ldquo;ease of use&rdquo;. Although the products of a high technology company are complex, the accompanying documentation does not necessarily have to mirror that complexity. Documentation must be designed and developed so that it aids the user in maximizing the usefulness of the tool that it describes. Within the computer industry, it appears that documentation rarely receives any attention until the design and development cycle nears completion. It is usually produced by programmers and developers with little understanding of how good documentation is developed. This process has resulted in a widespread fear and misunderstanding surrounding computer software and hardware; a mystique that computers are difficult to use or understand. However, if the flow of information during the product development cycle is restructured, a significant improvement in documentation and users' attitudes could take place. This paper discusses in general the factors influencing documentation today, how documentation has been done in the past and the problems that resulted from that process, some techniques to restructure the development cycle to eliminate these problems, and the benefits both internal and external of these new techniques.
A study of instruction cache organizations and replacement policies
Authors: James E. Smith, James R. Goodman
Venue: ACM SIGARCH Computer Architecture News (1983)

Instruction caches are analyzed both theoretically and experimentally. The theoretical analysis begins with a new model for cache referencing behavior&mdash;the loop model. This model is used to study cache organizations and replacement policies. It is concluded theoretically that random replacement is better than LRU and FIFO, and that under certain circumstances, a direct-mapped or set associative cache may perform better than a full associative cache organization. Experimental results using instruction trace data are then given. The experimental results are shown to support the theoretical conclusions.
Heuristics for the global optimization of microprograms
Authors: Michael D. Poe
Venue: Proceedings of the 13th annual workshop on Microprogramming (1980)

Most of the discussion in the microprogram optimization literature deals only with straight line segments. This paper discusses an implementation in progress that globally optimizes microprograms. The complete optimization of microprograms has been shown to be very expensive computationally. However, the use of heuristics, such as those described in this paper, can efficiently approximate exhaustive optimization of microprograms.
Lower bounds on the size of Boolean formulas: Preliminary Report
Authors: Michael J. Fischer, Albert R. Meyer, Michael S. Paterson
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

Let C(n)k be the Boolean function of n variables that equals one iff the number of arguments equal to one is a multiple of k. It is shown that every Boolean expression for C(n)k, allowing all of the 16 binary connectives, has size exceeding &egr;n log n/log log n, &egr;> 0. This result follows from a general criterion relating the minimum size expression for a Boolean function to the kinds of subfunctions obtainable through restriction. Lower bounds on formula size for several other functions are obtained. In some cases, the lower bounds are nearly achievable by known constructions.
Position paper on microprocessor assembly language draft standard IEEE task P694/D11
Authors: G. W. Gorsline
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

Among the early purposes of assembly languages must be included: 1) the use in the programming process of mnemonic operation codes and symbolic variables names instead of the bit patterns and relative addresses of machine code as an aid to the human programmer. Machine code programming has largely disappeared except as a temporary bootstrapping process in producing an early version of an assembler, a compiler, or an interpreter. We shall ignore it in this short note. Other reasons often cited as justification for employing an assembly language at the present time are: 2) the availability of all the machine resources and facilities, 3) the necessity of producing a program that executes as fast as possible, 4) the necessity of producing a program that is as parsimoneous of memory as possible, and 5) as the original bootstrap processor in producing compilers or interpretors for higher level systems and applications languages. We wish to emphasize that these reasons were often valid in the past; that these reasons are sometimes valid at present; and that these reasons will remain valid only under very special circumstances in the future.
Data processing and Computer Science graduates
Authors: Duane C. Abbey
Venue: Proceedings of the fifth SIGCSE technical symposium on Computer science education (1975)

The following paper presents the views, observations and concerns of an educator working in the field of information and data processing. The primary comments and suggestions are directed toward the academic community although suggestions and goals are also made which are applicable to the information and data processing field.
Design verification system for large-scale LSI designs
Authors: Michael Monachino
Venue: Proceedings of the 19th Design Automation Conference (1982)

This paper describes the changing environment of large-scale computer designs as they are influenced by the advance of technology. This changing environment makes it necessary for design verification to be part of the basic design cycle. The design verification methodology presented in this paper represents a minimum scheduled savings of 75% for an LSI machine as compared to any conventional type of design system. It allows the computer industry to design timely systems in the range of one-million circuits and to design them with a cost-effective design system. In addition to savings in schedule, the system described guarantees a high quality design with minimum impact on customer satisfaction because of design errors. The range of effectiveness that can be obtained on a product using this methodology is from 85-95% effective.
ILS&mdash;interactive logic simulator
Authors: Gregory D. Jordan, Brij B. Popli
Venue: Proceedings of the 20th Design Automation Conference (1983)

Due to increasing VLSI complexity, logic level simulators have become necessary tools for design verification and test generation. Logic simulators must respond to this increased demand by providing additional functionality in a user-friendly environment. ILS (Interactive Logic Simulator) currently under development in the CAD lab of Hewlett-Packard Co. provides these features. ILS accepts a hierarchical, scoped description of the network topology. This description may consist of libraries, blocks, ILS-defined primitives (transistors and gates), or user-defined primitives. These multiple levels simplify network description and allow ILS to accurately simulate a wide variety of circuits. The simulator incorporates a new modeling scheme which allows functional, logic, and circuit level primitives to communicate efficiently. In addition, ILS features a new concept in simulation control languages to facilitate generation of functional test programs. This paper will briefly review these significant benefits provided by the ILS simulator.
Recursive properties of abstract complexity classes (Preliminary Version)
Authors: L. H. Landweber, E. L. Robertson
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

It is proven that complexity classes of abstract measures of complexity need not be recursively enumerable. However, the complement of each class is r.e. Properties of effective enumerations of complexity classes are studied. For any measure there is another measure with 'almost' the same complexity classes such that almost every class admits an effective enumeration in terms of speedy devices. Finally complexity classes are shown to not be closed under intersection.
A data structure for interactive placement of rectangular objects
Authors: V. Jayakumar
Venue: Proceedings of the 17th Design Automation Conference (1980)

A data structure suitable for interactive placement of disjoint rectangular objects is presented. Area available for placing new objects is described in terms of a unique set of maximum empty rectangles (MERs), each of these MERs bounded by objects already placed or by the boundary. Algorithms for addition and deletion of objects have been developed. Deletion is achieved by using the addition procedure itself. Information can readily be derived from the data structure to identify regions where a given object may be placed, to determine whether a new object can be placed if an existing one is removed, to assess restrictions on linear dimensions and areas of objects that can be placed etc. Though the scheme has been developed for automated layout of PCBs and ICs, it is applicable to other areas such as layout and modification of shopping centers and cities, utilization of warehouse space etc. A distinct feature of the method is that the extent of search to update the data structure need not increase with the number of objects placed or with the density of placement.
An extension of the central server model
Authors: Udo Pooch, Don Warner
Venue: Proceedings of the 9th conference on Winter simulation - Volume 2 (1977)

An extension of the central server model as developed by Buzen is analytically developed. This model concerns itself with a computer system that is not heavily loaded. A simulation model is then developed for this lightly loaded computer system, and is used to validate the analytical results of this extended central server model. The analytical calculations regarding resource utilization, as well as the average degree of multiprogramming, generate very close results to those measured from the system.
Overallocation in a virtual circuit computer network
Authors: A. Kurinckx, G. Pujolle
Venue: Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation (1980)

In this paper, we study the end-to-end control through virtual circuits in a computer network built following the X.25 Recommendations. We develop a mathematical model to obtain the maximum overallocation of node buffers, in order for the probability of overflow not to exceed a given value.
Specifications for a design automation system
Authors: R. Mandell, G. Estrin
Venue: Proceedings of the SHARE design automation project (1965)

This paper is a brief discussion of the preliminary specifications design automation system (DAS) for digital devices. The goal of the proposed system is to allow a systems designer to describe his initial requirements to evaluate and modify his design as it passes through the various stages automatic implementation. The development of this system is motivated by need for eneration of an extensive library of designs for use in the UCLA Variable Structure Computer System1 and by the need for a framework in which optimization research studies may be carried out. It is hoped that this system may also provide information and tools for the many industrial organizations who cannot Justify investment in a design automation system. Design automation has been the subject of serious study both in universities and in industry for several years.2-7 Several programs for writing logical equations, 8,9 optimizing boolean equations,10,11 placing circuit modules, 12-14 routing wires, 15,16 simulation,17-19 and documenting systems have been developed. The emphasis in this work has been for the most the individual design and programs.
SIGOPS/SIGMINI(Paper Session)
Authors: B. D. Shriver J. W. Anderson, L. J. Waguespack, D. M. Hyams, R. A. Bombet, Elizabeth D. Rather, Charles H. Moore, David N. Cutler, Mario R. Pellegrini, Henry R. Bauer,  III, Gary D. Thomas, Jeffery Van Baalen
Venue: Proceedings of the 1976 annual conference (1976)

The four papers in this tutorial session discuss the design, implementation, and comprehension of minicomputer operating systems. A cross section of vendor and user developed operating systems will be presented. Insights into why vendors include some features and not others, or why it is necessary to write your own, will be offered.
ACM SIGPLAN history of programming languages conference APT language summary
Venue: ACM SIGPLAN Notices (1978)

APT is a programming language for describing how parts are to be produced by a numerically controlled machine tool. Within the language a programmer can define points, lines, planes, spheres, etc. and specify the movement of a cutting tool in terms of these shapes. In the accompanying paper on the origins of the APT language, Figures 7 and 9 give fairly self-explanatory examples of APT programs. This summary gives additional introductory information.