ppxscal/embedding_network huggingface dataset:
Urban transportation strategies model
Authors: Scott G. Shanks, Robert R. Hippler, P. N. Formica
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

A simulation model for evaluation of the effects of urban transportation strategies on vehicle usage has been developed. This computer program has been utilized to evaluate transportation strategies designed to reduce ambient air concentrations of pollutants. The interaction of factors such as parking availability, mass transit availability, and degree of congestion of roadways, are evaluated by a number of simulation runs which estimate citizen reaction to various mixes of these factors and estimate the degree of change in intermodal choice of transit. The range of results obtained can be quantified in terms of pollution levels utilizing standard emission rates for vehicles. A feature of the computer system is ease of application. Results are only hypothetical and depend on assumptions that are fed into the model structure. However, the user may obtain a reasonable range of likely results by varying the input factors.
Global router
Authors: J. Soukup
Venue: Proceedings of the 16th Design Automation Conference (1979)

The paper describes a new router which develops all connections simultaneously. Routes do not exist as lines, but rather as connected irregularly shaped areas which grow and retract in an amoeba-like manner. It is as if some routes are being rerouted, but it is all done at once. Because the cell map is scanned sequentially, the data handling and storage is vastly simplified.
Optimal scheduling of independent tasks on heterogeneous computing systems
Authors: Jane W. S. Liu, Ai-Tsung Yang
Venue: Proceedings of the 1974 annual conference - Volume 1 (1974)

In this paper, the problem of optimal scheduling of independent tasks on heterogeneous computing systems is considered. Optimal scheduling algorithms which produce preemptive schedules with minimal completion times and non-preemptive schedules with minimal mean flow times are described. A bound on mean flow times also provides us with information concerning the relative merit of different multiprocessor systems.
Complexity measures and hierarchies for the evaluation of integers, polynomials, and n-linear forms
Authors: Richard J. Lipton, David Dobkin
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

The difficulty of evaluating integers and polynomials has been studied in various frameworks ranging from the addition-chain approach [5] to integer evaluation to recent efforts aimed at generating polynomials that are hard to evaluate [2,8,10]. Here we consider the classes of integers and polynomials that can be evaluated within given complexity bounds and prove the existence of proper hierarchies of complexity classes. The framework in which our problems are cast is general enough to allow any finite set of binary operations rather than just addition, subtraction, multiplication, and division. The motivation for studying complexity classes rather than specific integers or polynomials is analogous to why complexity classes are studied in automata-based complexity: (i) the immense difficulty associated with computing the complexity of a specific integer or polynomial; (ii) the important insight obtained from discovering the structure of the complexity classes.
A partial solution to the reachability-problem for vector-addition systems
Authors: Jan van Leeuwen
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

With geometrical techniques we hope to bring new insight into the reachability problem for vector-addition systems, which is pertaining in many areas in computer science theory but unsolved ever since it was proposed by Karp and Miller. We show that the reachability-problem is decidable in dim. &le; 3 and give a partial solution for the general problem covering a wide instance of it. In both cases a semi-linear characterization is obtained for the complete set of solutions. Contrary to common belief the complete solution in dim. 3 does not immediately generalize, and our analysis gives evidence why. A few generalizations and application to long-standing classificational problems in language theory are discussed.
SDI-5, an advanced system for selective dissemination of information
Authors: A. B. Barnes, A. A. Briggs, J. Gauss, A. Resnick
Venue: Proceedings of the 1964 19th ACM national conference (1964)

Continued experimentation and operational experience have been incorporated into the programming of a new IBM 1401-7090 Data Processing System for Selective Dissemination of Information (SDI) now serving over 1200 scientific, technical and administrative personnel. The most significant new features are: Machine printing of all bibliographic information including abstracts and matching index terms. Control by the user of the type and quantity of information he receives. Segmentation of user's interest profiles into distinct interest areas. Weighting of user index terms. Extensive analysis routines to monitor user and system performance. Several procedures for automatically updating user interest profiles. Machine-controlled vocabulary guide for both user and document profiles.
A semantic model of types for applicative languages
Authors: D. B. MacQueen, Ravi Sethi
Venue: Proceedings of the 1982 ACM symposium on LISP and functional programming (1982)

If integer constants are added to the syntax of the pure lambda calculus, then primitive integer values have to be added to the underlying domain V of values. Unlike functions, primitive values should not be applied; we want a run-time error to occur if an attempt is made to apply them as functions. Expressions that might lead to run-time errors are separated out by imposing a &ldquo;type&rdquo; structure on expressions. A systematic model of types is developed, in which types are formalized as &ldquo;ideals&rdquo; (sets with a certain structure). Polymorphic functions are handled by introducing a quantifier for taking conjunctions of types. Operations for constructing new types from old lead to the consideration of higher-order or meta types, which are called &ldquo;kinds&rdquo; to avoid confusion with types. Finally, the semantic model of types is applied to show the soundness of a proof system for inferring the types of expressions.
Interprocess communication in real-time systems
Authors: P. G. Sorenson
Venue: ACM SIGOPS Operating Systems Review (1973)

A variety of solutions have been proposed for ensuring data integrity in nonreal-time systems (i.e. batch or on-line systems). A brief review is made of some of the techniques employed in these solutions. It is indicated why the data integrity problem is different in a real-time system than in a nonreal-time system. Two models of interprocess communication are presented and it is demonstrated that the models are sufficient to preserve data integrity in a real-time system.
Sources of government funding for college and universities
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

The panel is composed of representatives of a number of federal agencies that provide research support for colleges and universities. Each panelist will present a short overview of the research support provided by their agencies. This will be followed by a general decision of funding opportunities for computer science research in colleges and universities. The participants are Donald M. Austin, Department of Energy; Bruce H. Barnes, National Science Foundation; Timothy D. Evans, Army Research Office; Robert B. Grafton, Office of Naval Research; Ronald L. Larson, National Aeronautics and Space Agency; and John P. Thomas, Air Force Office of Scientific Research.
A systems manager's view of computer auditing
Authors: Raymond S. Perry
Venue: Proceedings of the 1979 annual conference (1979)

This talk will concentrate on how the audit report can help the systems manager. The speaker has the responsibility for development and operation of information systems budgeted in excess of fifty million dollars a year. These responsibilities are carried out by 430 people in a large, multinational corporation. It is from this perspective the speaker concludes that auditing has failed to deliver to the potential the function holds. Specific examples of lost opportunity will be sited. Basically, there has been a general misdirection of internal auditing objectives. Many audits concentrate on technical issues, such as efficiency of code and they view the application as an entity in isolation. All too frequently there is little or no evaluation of the application from an integrated systems perspective. Questions such as how does the implementation and operation of the application meet the required business objectives are not usually adequately addressed.
Computational experience with an algorithm for the lock box problem
Authors: R. L. Bulfin, V. E. Unger
Venue: Proceedings of the ACM annual conference (1973)

The lock box problem involves the location of post office boxes within a company's distribution area. Customer remittances are mailed to these boxes and the checks are processed by a local bank. The problem is to locate the boxes in a way that will minimize processing cost and the opportunity costs associated with the remittances while in transit (float costs). For m potential lock box locations and n customer groups, the problem can be formulated as a zero-one integer programming problem with mn + n variables and m + n constraints. The problem, however, can be partitioned in a way that results in a zero-one integer programming problem with only m variables. Once values have been established for these m variables, values for the remaining mn zero-one variables can be determined by a trivial process. Thus the problem reduces to determining values for the m zero-one variables. This is accomplished by an implicit enumeration procedure. Computational results are reported for problems involving up to 5050 variables.
Subtasking in APL
Authors: Alain Miville-deChêne, Louis P. A. Robichaud
Venue: Proceedings of the fourth international conference on APL (1972)

In this paper we discuss a modification to APL/360 which allows rather interesting modes of use of APL, such as subtasking, multitasking, working without a terminal, communicating between terminals synchronously or asynchronously, etc. By subtasking we mean the subdivision of a main program into parts called subtasks, which may be executed concurrently, permitting such things as the overlapping of input/output with processing. One might consider that multitasking is involved in a situation where a number of APL users are controlled by the same APL task.
EMMA-an industrial experience on large multiprocessing architectures
Authors: Luigi Stringa
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

EMMA (1) is a multiprocessor system designed and built by ELSAG of Genoa, Italy, to solve problems of pattern recognition arising in automatic mail sorting. The resulting architecture is modular, organizable around several levels, and offers a theoretically unlimited possibility of increasing the processor power. EMMA runs under a simple distributed operating system, supplying process communication, synchronization primitives and some diagnostic functions that complement analysis and reconfiguration modules residing in the supervisor.
Programming for everyone: A rationale and some teaching strategies
Authors: William J. Wagner
Venue: Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems (1980)

The importance of offering non-technical instruction about computers is discussed, and the importance of introducing these students to programming is argued. Two teaching experiences of the author are described in detail: a high school programming class with no math pre-requisite, and a community college short course about computers.
On syntax-directed transduction and tree transducers
Authors: David F. Martin, Steven A. Vere
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

Several topics of theoretical and practical importance to the field of translator writing systems are presented in this paper. These are (1). implementation of generalized syntax-directed transduction (GSDT) on a finite-state tree transducer; (2). implementation of GSDT on a tree-walking pushdown store transducer; (3). transformation of the context-free grammar underlying a GSDT and the resulting transformation of the transduction elements of that GSDT; (4). tree transduction of parse trees between equivalent context-free grammars.
Interactive graphics package for human engineering and layout of vehicle workspace
Authors: Gerald F. Rabideau, James Farnady
Venue: Proceedings of the 13th Design Automation Conference (1976)

The problem of vehicle workspace design is solved by use of an interactive graphics package. The package consists of an optimization programme (WOLAP), a biokinematic - anthropometric model and the use of a 3-D graphics display system. It is hoped that by use of this package the designer would have a more comprehensive tool by which to design and configure both the basic dimensions of workspaces for seated operators and the required controls and displays therein.
A Fuzzy Approach to Segment Document Images
Authors: Fabrizio Giorgini, Alberto Verrini, Silvana Dellepiane
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

A new method to segment characters and numbers in presence of colored background, texture and noise is presented. It also shows that it is able to work correctly on document with overlapped static and dynamic structures.This method, based on the concept of the fuzzy connectivity exploits both intensity information and continuity of direction which characterize structures belonging to the document. An image-scanning mechanism non-iterative and non-causal is used to propagate the information by following paths with maximum connectivity. The final result of this process is a gray levels image ( the "connectedness" image) where every value represents the degree of membership of the pixel to the object searched.
Software development and proofs of multi-level security
Authors: Peter G. Neumann, Richard J. Feiertag, Karl N. Levitt, Lawrence Robinson
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

This paper summarizes current research at RI aimed at developing secure operating systems and verifying certain critical properties of these systems. It is seen that proofs of design properties can be relatively straightforward when the design is specified in suitable formal specification language. These proofs demonstrate the correspondence between the desired properties and a specification of the system design. Various on-line tools aid considerably in this process. In addition, correctness proofs for implementations of such systems are now feasible, because of both various theoretical advances and the use of supporting tools.
A senior project course in a computer and information science department
Authors: Michael A. Baltrush
Venue: Proceedings of the twelfth SIGCSE technical symposium on Computer science education (1981)

The faculty and student viewpoints of the senior project course in the core curriculum of the Computer and Information Science Department at NJIT are presented. Each viewpoint is examined along with its impact on the mechanics of the course. The changes in course mechanics are related to the growing student population in the Department.
The proposed ICCP certification in systems analysis (CSA)
Authors: Fred G. Harold
Venue: The Proceedings of the Twentieth Annual Computer Personnel on Research Conference (1983)

Systems analysts occupy a unique position within the structure of information processing: They deal not only with the technology and with the creative dimensions of systems development, but also with the resolution of conflict between the objectives of product-oriented users and process-oriented programmers. While this conflict is frequently not open, a form of adversary relationship typically develops between users and software specialists, and the systems analyst becomes the focal point in reducing this alienation. Contemporary methodologies which aid in the systems development process have helped to reduce the friction, but the systems analyst still must frequently assume the role of arbitrator and diplomat. Coupled with the above role is the emerging position of the systems analyst as a quality assurance specialist. As organizations become increasingly dependent upon computer-based information systems, some of which are life-critical, systems analysts must assume greater responsibility for the results &mdash; good or bad &mdash; of the applications they develop and install. Accountability of this type has always been one distinguishing characteristic of the true professional. Although information processing is itself an evolving discipline, some computing professionals have responsibilities and requisite knowledge more clearly defined than those of the systems analyst. The bodies of knowledge relevant to the information systems manager and the senior programmer are well represented in the content of the two examinations currently offered by the Institute for Certification of Computer Professionals (ICCP): the Certificate in Data Processing (CDP) and the Certificate in Computer Programming (CCP), respectively. The systems analyst remains the primary computer professional not covered by a certification program.
Analysis of multiprocessor cache organizations with alternative main memory update policies
Authors: W. C. Yen, K. S. Fu
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

Cache memory has played a significant role in the memory hierarchy and has been used extensively in large systems and minisystems. The effectiveness of cache memories with alternative main memory update policies in a multiprocessor system is a major concern in this paper. The performances of write-through with write-allocation or no-write allocation, buffered write-through, flag-swap, and buffered flag-swap policies have been analyzed. Because of the dominating cost of the interface between processors and main memory modules in the multiprocessor system, the effect of varying the bus width or block size has also been considered. Queuing models were developed to analyze these alternative organizations, and results predicted by the models were validated by a set of simulations.
Hybrid simulation of interacting discrete and continuous systems
Authors: P. W. U. Graefe, L. K. Nenonen, K. A. Strobele
Venue: Proceedings of the 7th conference on Winter simulation - Volume 2 (1974)

In this paper, the simulation of interacting discrete and continuous systems on a hybrid computer is discussed. A hybrid computer was chosen mainly for the relative ease with which display facilities could be employed, and for the on-line interaction capability available in a hybrid computer environment.
A set of programs for MOS design
Authors: G. Sakauye, A. Lubiw, J. Royle, R. Epplett, J. Twidale, E. Shew, E. Attfield, F. Brglez, P. Wilcox
Venue: Proceedings of the 18th Design Automation Conference (1981)

A set of programs used in the design of custom hand packed and standard cell MOS circuits is described. The programs cover logic simulation, filter analysis, circuit simulation, timing simulation, circuit extraction from layout, design tolerance checking, connectivity checking and user interface facilities. A cell documentation system is used to tie together the various design support packages.
Performance enhancement of SISD processors
Authors: W. G. Rosocha, E. S. Lee
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

The automatic coordination of instruction execution of SISD processors is examined in the context of minimizing the effects of branch execution. Three areas, instruction prefetch, branch resolution, and issuer organization are examined for possible improvement. The thrust of these techniques is to extend conditional processing and to use look-ahead to detect branches. A structured instruction buffer, the converger, is used to buffer one or more levels of conditionally prefetched instructions. Conditioning schemes that permit a large degree of branch resolution overlap with instruction execution are presented. Issuer organization extensions, that promote a high issue rate and conditional instruction execution are presented.
INCOD: A system for Interactive Conceptual Data Base Design
Authors: C. Batini, M. Lenzerini
Venue: Proceedings of the 18th Design Automation Conference (1981)

In this paper we describe the general structure of a computer aided system for Interactive Conceptual Design (INCOD) of Data Bases. First of all, motivations are given for a system as INCOD that allows the incremental definition of a conceptual schema of a Data Base according both to a top-down and a bottom-up strategy. Afterwards, the general features, functions and architecture of the system are described.
Design considerations for a QM-1 based multimicroprocessor emulation system
Authors: Steve Crocker
Venue: ACM SIGMICRO Newsletter (1978)

Microprocessors, which are now readily available, are being used in the design of many systems. Soon avionic systems will be designed that use many microprocessors working together. Systems based on multiple microprocessors (MMP) will be designed to offer higher throughput and/or higher reliability than uniprocessor systems. There are now very few design tools to aid in developing or evaluating proposed microprocessor systems. One highly useful tool is an emulation facility for modeling, testing, and measuring proposed MMP systems.
An implementation-independent approach to teaching recursion
Authors: Gary Ford
Venue: ACM SIGCSE Bulletin (1984)

The principle of abstraction, of separating a concept from a particular implementation of that concept, is gaining increasingly widespread use in programming and problem solving, and in teaching these subjects. A method of teaching the abstract concept of recursion, independent of its implementation, is presented.
High level description and implementation of resource schedulers
Authors: Dennis W. Leinbaugh
Venue: Proceedings of the ACM '82 conference (1982)

Resource sharing problems can be described in three basically independent components. &bull; The constraints the resource places upon sharing because of physical limitations and consistency requirements. &bull; The desired ordering of resource requests to achieve efficiency&mdash;either efficiency of resource utilization or efficiency for processes making the requests. &bull; Modifications to the ordering, to prevent starvation of processes waiting for requests which might otherwise never receive service. A high level description language to specify these components of resource sharing problems is introduced. An implementation that lends itself to mechanical synthesis is described. Synthesis of the scheduler code by-passes the long and error- prone process of someone doing the coding themselves. Proof techniques at the high level description level are introduced to show how to prove schedulers, synthesized from their description, are or are not deadlock and starvation free. Solutions to the classical resource sharing problems of producer/consumer, reader/ writer, and disk scheduler (to the sector level) are shown to illustrate the expressiveness of this description language.
Complexity Of Computations
Authors: Shmuel Winograd
Venue: Proceedings of the 1978 annual conference (1978)

Construction of algorithms is a time honored mathematical activity. Euclid's algorithm for finding the greatest common divisor of two integers, as well as the many constructions by a ruler and compass are some of the fruits of the search for algorithms by the Greek mathematicians. In our days, we have the whole field of Numerical Analysis devoted to finding a variety of algorithms for numerical integration of differential equations.