ppxscal/embedding_network huggingface dataset:
SUGAR: A high-level programming language for geographical analysis and mapping
Authors: Mark P. Kriger
Venue: ACM SIGGRAPH Computer Graphics (1976)

This paper presents the recently designed interactive computer language for cartography called SUGAR. It is intended for use by non-computer specialists, especially geographers, city planners and landscape architects to make maps by computer. The syntax given is based on English key words with a grammar easily understood by specialists with a non-mathematical background. Different keyword dialects for SUGAR are being designed for different cartographic applications within the basic syntax. A version of SUGAR being implemented is a prototype interpreter for an interactive choropleth mapping program called INPOM. Examples of the graphics capabilities of INPOM are included together with examples of the INPOM dialect of SUGAR. The useability of the language in the batch program environment is discussed as well as directions of further research and implementation.
On &ggr;-reducibility versus polynomial time many-one reducibility(Extended Abstract)
Authors: Timothy J. Long
Venue: Proceedings of the eleventh annual ACM symposium on Theory of computing (1979)

We prove that a class of functions (denoted by NPCPt), whose graphs can be accepted in non-deterministic polynomial time, can be evaluated in deterministic polynomial time if and only if &ggr;-reducibility is equivalent to polynomial time many-one reducibility. We also modify the proof technique used to obtain part of this result to obtain the stronger result that if every &ggr;-reduction can be replaced by a polynomial time Turing reduction then every function in NPCPt can be evaluated in deterministic polynomial time.
Mathematical properties of Boolean transformations
Authors: Ytzhak Levendel, Melvin A. Breuer
Venue: Proceedings of the eighth international symposium on Multiple-valued logic (1978)

This paper is concerned with the study of special aspects of the transformation &Ybarbelow;&equil;&fbarbelow;(&ybarbelow;,&xbarbelow;) which occurs as the &ldquo;next state function&rdquo; in the study of sequential circuits. To study this function we employ three models, namely a Boolean equation form, a Boolean matrix form, and a linear matrix form. The latter is based upon the Reed-Muller expansion of a Boolean function. Our major results deal with the study of the interrelationships between these models as well as the computation of path and cycle lengths associated with state transitions.
MASS&mdash;a mail service simulation
Authors: Paul L. Tuan, David S. Nee
Venue: Proceedings of the third conference on Applications of simulation (1969)

This model was developed for the U.S. Post Office Department for the purpose of evaluating the relative merits of alternative mail processing, handling, and transportation plans. It may be used to evaluate proposed mail sorting and routing schemes, man-power allocations, new mail processing equipment, transportation scheduling, and mail volume fluctuations.
SIGBDP 6 (Panel Discussion): Innovations on computer charging mechanisms
Venue: Proceedings of the 1975 annual conference (1975)

The management of computers operating in shared environments and computer networks has become an increasingly common and complex problem. This session is oriented around new concepts and methodologies related to the management of computer resources in these situations. In the 1950's the basis for charging mechanisms for the usage of computer systems was fairly simple and straight-forward due to the serial processing nature of the systems then in use. Since that time, the nature of the problem has complicated significantly due to the evolution of both the multi-programming and multi-processor systems as well as the more prevalent use of sharing computers on computer networks. Today we find ourselves in the environment where resource sharing of computational and communications capabilities is the norm, and with it comes a significant requirement for efficient, logical, and effective charging mechanisms not only to provide a basis for equitably distributing costs but also to provide a basis for a reasonable mechanism for sharing of these resources among the various users.
Measurements of the virtual memory demands of Algol-60 programs (Extended Abstract)
Authors: A. P. Batson, R. E. Brundage
Venue: ACM SIGMETRICS Performance Evaluation Review (1974)

Programming languages such as Algol-60 use block structure to express the way in which the name space of the current environment, in the contour model (1) sense of that word, changes during program execution. This dynamically-varying name space corresponds to the virtual memory required by the process during its execution on a computer system. The research to be presented is an empirical study of the nature of the memory demands made by a collection of Algol-60 programs during execution. The essential characteristics of any such resource requiest are the amount of memory requested, and the holding time for which the resource is retained and these distributions will be presented for several components of the virtual memory required by the Algol programs.
A Formal Theory Of Language Acquisition
Authors: Kenneth Wexler
Venue: Proceedings of the 1978 annual conference (1978)

The theory of language learnability is described. We investigate formal learning procedures which can learn formally specified classes of grammars from particular kinds of inputs. For a theory to be adequate the class of grammars must be like the class of grammars for natural language and the inputs must be like the inputs available to a child. A positive result is attained; under certain kinds of input, a class of transformational grammars is learnable. The inputs can be quite simple. In order to attain the result it is necessary to constrain the class of grammars in interesting ways that can be subject to empirical test. Implications are discussed for questions such as the efficiency of the system and the possibilities for a general theory of learning.
The graphically accessed interactive design of industrial pipe systems
Authors: Melvin R. Corley, John J. Allan,  III
Venue: Proceedings of the 9th Design Automation Workshop (1972)

For several years the digital computer has been used to aid in the process of designing industrial pipe systems that will be structurally safe under loads imposed by the thermal expansion of the pipe material. Using these programs an analytical approach may be taken when determining stresses and deflections at points throughout pipe systems of great complexity. These analyses are subject only to the constraints of static loading and elastic behavior of the pipe material. Typically, such an analysis procedure is designed for use in batch-processing systems. Programs that have been adapted for use on interactive systems still retain most of the characteristics of the batch processing programs. These programs fail in one important aspect; they require the input/output data for the program to be a string of alphanumeric and special symbols. Quite apart from this convention, piping flexibility analysis problems are invariably presented in a graphical format. Thus, the engineer with a problem to be solved is faced with the time-consuming and potentially error-laden task of expressing the schematic diagram of the proposed pipe system in the alphanumeric input format of the program.
A data base language for FORTRAN
Authors: John M. Tyler, Chester M. Smith, Robert W. Drake, Melvin E. Black, Seth S. Cohen, Thomas J. Harris, John B. McLean, Kenneth Sperka, Wood Rehling
Venue: Proceedings of the 1977 annual conference (1977)

It is becoming increasingly apparent that standardization of data base languages is one of the best ways to ward off the trauma of conversion and the impact of major new hardware announcements. This paper presents an overview of the CODASYL data base committee's specifications of one such data base language for FORTRAN.
Translating recursion equations into flow charts
Authors: H. R. Strong,  Jr.
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

This paper proposes the foundations for a systematic study of the translation of recursive function definitions into flow charts (often called the removal of recursions). Several notions of translation are presented. Emphasis is placed on translation which could be performed mechanically, operating only on the syntactical structure of the recursion equations. Systems of recursion equations are classified by structure and by the dynamics of their implicit computations. Theorems on the limitations of translation are based on these classifications. An effective first approximation to a syntactic characterization of one notion of translatability is presented. Finally, open problems are discussed. Space limitations prevent the inclusion of proofs or lengthy definitions.
A software engineering experience in the management, design and implementation of a data secure system
Authors: David K. Hsiao
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

HSDMS (Highly Secure Data Management System) is a secure, on-line and multi-user experimental database management system developed on the Digital Equipment Corporation's PDP-10 computer system. It is a vehicle for testing new facilities and applications of data management and access control. Furthermore the development of HSDMS itself has been aimed at the outset as an exercise in software engineering management and control. In the first part of the paper, the software engineering techniques that were used in the management and control of the programming team and efforts are discussed. The discussion centers on the application of some of the known concepts such as the chief programmer team, structured programming and composite design to programming of the database management system. In the second part of the paper, system goals and capabilities are presented. The goals for HSDMS were to achieve data independence, efficient storage and access, effective user interface, and secure access control. The ability of HSDMS to meet the goals result from the utilization and integration of a number of design concepts and implementation approaches. For each system goal the concepts and approaches that have provided HSDMS with the capabilities to achieve the goal are shown. In the final part of the paper, we attempt to relate this single experience with HSDMS to its possible impact on software engineering of database management systems in general and to data secure systems in particular.
The theory of signature testing for VLSI
Authors: J. Lawrence Carter
Venue: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982)

Several methods for testing VLSI chips can be classified as signature methods. Both conventional and signature testing methods apply a number of test patterns to the inputs of the circuit. The difference is that a conventional method examines each output, while a signature method first accumulates the outputs in some data compression device, then examines the signature - the final contents of the accumulator - to see if it agrees with the signature produced by a good chip. Signature testing methods have several advantages, but they run the risk that masking may occur. Masking is said to occur if a faulty chip and a good chip behave differently on the test patterns, but the signatures are identical. When masking occurs, the signature testing method will incorrectly conclude that the chip is good, whereas a conventional method would discover that the chip is defective. This paper gives theoretical justification to the use of several signature testing techniques. We show that for these methods, the probability that masking will occur is small. An important difference between this and other work is that our results require very few assumptions about the behavior of faulty chips. They hold even in the presence of so-called correlated errors or even if the circuit were subject to sabatoge. When we speak of the probability of masking, we use the probabilistic approach of Gill, Rabin and others. That is, we introduce randomness into the testing method in a way which can be controlled by the designer. Thus, one theorem assumes that the order of the input patterns - or the patterns themselves - is random; another assumes that the connections between the chip and the signature accumulator are made randomly, and a third assumes that the signature accumulator itself incorporates a random choice. Most of the results of this paper use a particularly simple and practical signature accumulator based on a linear feedback shift register.
Crossing the machine interface
Authors: A. G. Olbert
Venue: ACM SIGMICRO Newsletter (1982)

The concepts and theory behind a specific type of hardware accelerator, oar &ldquo;assist&rdquo;, are presented. Such accelerators are specific extensions to an existing, generalized data processor architecture. Both the software system and the hardware implementation are changed by the extensions. For the accelerators discussed here, the hardware implementation is accomplished solely in microcode. The generalized architecture can be compatible across a line of data processors. The accelerators are defacto extensions to the basic architecture and are normally only defined on a subset of the processor line. These architectural extensions consist of functions migrated from &ldquo;above&rdquo; the generalized architecture (i.e. software functions) into the processor architecture and processor implementation. The accelerators provide a method of improving system performance that is complementary to improving performance through modification of the generalized processor architecture itself or the underlying circuitry implementation.
Minimizing the retrieval time of scatter storage techniques
Authors: Thomas C. Irby
Venue: Proceedings of the 1978 annual conference - Volume 2 (1978)

A technique is described for minimizing the number of probes needed to retrieve a given set of entries from a hash table using a specific hash code. The method is useful for tables where the expected number of retrievals is large. An example is given which illustrates the usefulness of the method for an assembler operation code table. Comparisons of the method are made with other hashing techniques and with binary search methods.
The Boolean Vector Machine [BVM]
Authors: Robert A. Wagner
Venue: Proceedings of the 10th annual international symposium on Computer architecture (1983)

We describe the architecture of a class of machines intended to solve computationally intensive problems much faster than can today's machines, at no increase in cost. We have investigated the programming of the BVM for several interesting algorithms on a BVM of 2k bit positions per register. More theoretical study of implementations of such highly parallel algorithms is motivated.
Capturing more world knowledge in the requirements specification
Authors: Sol J. Greenspan, John Mylopoulos, Alex Borgida
Venue: Proceedings of the 6th international conference on Software engineering (1982)

The view is adopted that software requirements involve the representation (modeling) of considerable real-world knowledge, not just functional specifications. A framework (RMF) for requirements models is presented and its main features are illustrated. RMF allows information about three types of conceptual entities (objects, activities, and assertions) to be recorded uniformly using the notion of properties. By grouping all entities into classes or metaclasses, and by organizing classes into generalization (specialization) hierarchies, RMF supports three abstraction principles (classification, aggregation, and generalization) which appear to be of universal importance in the development and organization of complex descriptions. Finally, by providing a mathematical model underlying our terminology, we achieve both unambiguity and the potential to verify consistency of the model.
Quantitative evaluation of detail-preserving and noise-removal abilities of morphological filters
Authors: W. Li, V. Haese-Coat, J. Ronsin
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

In this paper, a quantitative evaluation methodology for morphological filters is presented. The goal of this evaluation scheme is to measure simultaneously the ability of morphological filters in edge sharpness preservation and noise suppression. A general morphological gradient criterion is proposed to divide an image into a series of regions according to its local spatial activity levels. The local mean-square-error (MSE) and local mean-absolute-error (MAE) are used to verify and compare performances of different tested filters. Several efficient and simple structured detail-preserving and noise-removal morphological filters are proposed and tested on simulated images by this scheme to prove its efficiency. For real image processing procedures, a combined filter structure is proposed to improve filter results.
A Framework for Forms Processing Using an Enhanced-Line-Shared-Adjacent Format
Authors: Yuki Hirayama
Venue: Proceedings of the Fifth International Conference on Document Analysis and Recognition (1999)

The objective of this paper is to introduce a novel framework for forms processing that provides seamless processing of two different kinds of formats: physical formats, whose fields have rigidly defined positions and sizes, and topological formats, in which variations in the positions and sizes of fields are acceptable as long the topological relations between pairs of fields are preserved. A line-shared-adjacent (LSA) cell relation and an LSA format are introduced to define topological formats, and are then enhanced to describe physical information as enhanced LSA (e-LSA) and an enhanced line oriented (e-LO) formats. The e-LSA format has good flexibility for defining not only physical and topological formats but also hybrid formats, on which our framework is based. It has characteristics of both physical and topological formats, and enables the framework to handle the two kinds of information seamlessly. The framework consists of four modules: - a format generator, a format converter, a format class manager, and a form processor - which perform all the processes for field detection on which our research focuses. In this paper, the way in which these modules collaborate is illustrated with some examples, which confirms the effectiveness of our framework. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Segmented FIFO page replacement
Authors: Rollins Turner, Henry Levy
Venue: Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1981)

A fixed-space page replacement algorithm is presented. A variant of FIFO management using a secondary FIFO buffer, this algorithm provides a family of performance curves lying between FIFO and LRU. The implementation is simple, requires no periodic scanning, and uses no special hardware support. Simulations are used to determine the performance of the algorithm for several memory reference traces. Both the fault rates and overhead cost are examined.
LORES - Logic Reorganization System
Authors: Shunichiro Nakamura, Shinichi Murai, Chiyoji Tanaka, Masayuki Terai, Hideo Fujiwara, Kozo Kinoshita
Venue: Proceedings of the 15th Design Automation Conference (1978)

Described is the outline and the experimental results of the system which automatically restructures and partitions a logic circuit consisting of standard SSI's and MSI's so that the gate types and the numbers of input/output terminals of the reorganized circuits are within the restrictions of the specified LSI.
A skeptical view of computer literacy
Authors: Daniel D. McCracken
Venue: Proceedings of the ACM 12th annual computer science conference on SIGCSE symposium (1984)

Text of a presentation to be made at the Computer Science Conference of the Association for Computing Machinery (ACM) and the ACM Special Interest Group on Computer Science Education (SIGCSE) Technical Symposium, February 16, 1984, at Philadelphia. A lot of people seem to believe that &ldquo;everybody&rdquo; needs &ldquo;computer literacy.&rdquo; The proponents seldom offer a definition of what computer literacy is, but what comes out of a hand-waving argument generally turns out to be a programming course, most often in Basic. The reasons given for this sudden need for universal computer literacy are similarly vague. Sometimes it's vocational: there will be lots of jobs working with computers, and every other field will be impacted by them, so &ldquo;everybody&rdquo; needs to know... well, something. Other times the reason is that computers will be so pervasive that it is important the man in the street not be afraid of them. And sometimes the argument seems to be that &ldquo;everybody&rdquo; needs to know about computers because so many policy decisions (privacy, employment, transborder data flow, etc.) will involve computers.
Am2900 Bipolar Microprocessor family
Authors: John R. Mick
Venue: Proceedings of the 8th annual workshop on Microprogramming (1975)

The Am2900 Bipolar Microprocessor family provides LSI building blocks applicable to numerous high-speed system configurations. The building blocks in this family handle the data path signals, the microprogram control functions, the input/output bus interconnections and the interrupt and timing/control requirements applicable to most digital systems. These building blocks are well suited for computer or central processor emulation, peripheral controllers, communications and voice processors, and special dedicated digital signal processors. This paper describes the functional characteristics of the first group of Am2900 devices to be introduced. This family of circuits operates with standard bipolar RAMs, ROMs, and PROMs as the memory elements. The advantage of using bipolar microprocessor circuit configurations is, of course, the operating speed and the flexibility associated with the microprogrammed architecture.
Modeling and simulation in product development
Authors: Douglas G. Boike, Edward H. Ernst
Venue: Proceedings of the 15th annual symposium on Simulation (1982)

As part of the product development cycle, the Xerox Corporation has evolved a modeling and simulation methodology. This paper describes the approach, its use, and value in product development. To provide a common basis for understanding the modeling activities to be discussed, a brief overview of the xerographic process as used in our current duplicator copier products is described. Each of the functions is discussed in terms of how they contribute to the overall systems model and how they are linked together in this model. A brief description of the data acquisition system used for model validation is included. A discussion of the FORTRAN-based simulation language, analysis tools, and its flexibility is presented. The application of this modeling approach at Xerox is illustrated. The applications are the optimization of performance parameters, subsystem requirements, tolerances, aging, and setpoints, as well as the examination of the performance of a population. These population studies encompass customer utilization and service interactions. The advantages of this process will be discussed, including the design efficiencies enabled, service policy optimization, and field performance projection of the product population.