ppxscal/embedding_network huggingface dataset:
Analysis of constructed mathematical responses by numeric tests for equivalence
Authors: Arthur E. Oldehoeft
Venue: Proceedings of the 1969 24th national conference (1969)

A method is described to determine if a constructed mathematical response is equivalent to the correct answer specified by the course author. Based on a combination of random evaluation and operator analysis, the method is theoretically justified for a general class of functions. Possible breakdowns due to computer arithmetic are discussed as well as the difficulties encountered when a function fails to fall in the general class. For CAI applications where a response is considered correct if it is equivalent to the correct answer, the method offers two possible advantages: (1) Only one form of the correct answer is specified. (2) Extensive and time consuming manipulation of expressions is avoided.
Parallel hardware implementation of handwritten character recognition system on wavefront array processor architecture
Authors: Young-Joon Kim, Seong-Whan Lee, Myung-Won Kim
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

In this paper, we describe a parallel hardware implementation of handwritten character recognition system with neural network classifier on wavefront array processor (WAP) architecture. The WAP architecture needs no global clock for controlling the entire processors and each processing element can even be clocked differently. Thus, the clock skew becomes no longer problem and it is possible to construct massively parallel networks which are required for handwritten character recognition. We also present experimental results for the recognition of unconstrained handwritten numerals with the WAP architecture. The results were very impressive in view of real world application.
Attributed translations(Extended Abstract)
Authors: P. M. Lewis, D. J. Rosenkrantz, R. E. Stearns
Venue: Proceedings of the fifth annual ACM symposium on Theory of computing (1973)

Attributed translations are a means of specifying the input-output relation of a language processing device, such as for example the lexical or syntax box of a compiler. Considered as a mathematical object, an attributed translation is a mapping of certain strings of attributed &ldquo;input symbols&rdquo; into strings of attributed &ldquo;action symbols&rdquo;. Under the interpretation that action symbols represent the act of emitting an attributed output or the performing of some other &ldquo;semantic actions&rdquo;, and the attributes represent &ldquo;semantic&rdquo; information associated with the symbols, the model can be applied in depth to practical compiling problems. Theorems are proved giving conditions under which an attributed translation can be performed by an augmented pushdown machine while it is parsing top down or bottom up. Attributed translations are based on the ideas of attributed grammars [1] and syntax directed translations [2,3]. Other relevant concepts are property grammars and table machines [4], and attributed grammars with relations [5].
An optimizing compiler for LISP for the Z80
Authors: Jed Marti
Venue: Proceedings of the 5th ACM SIGSMALL symposium on Small systems (1982)

This paper describes an optimizing compiler for the Z80. Described are the compilation mechanisms, optimization techniques, and performance statistics.
Application of microprogramming to medium scale computer design
Authors: John L. Wilkes
Venue: Conference record of the 7th annual workshop on Microprogramming (1974)

The concept of microprogrammable architectures can provide the system designer with a powerful development tool. This paper describes the development process of a medium scale computer system, using a specific microprogrammable processor. The hardware architecture used in this system is referred to as the MPP (microprogrammable processor) while the resulting computer system is referred to as the MP-60. The MPP hardware was designed to accomplish two primary goals; to shorten the lead time for computer system development by establishing a set of hardware building blocks, and to provide a mechanism for computer system emulation.
Towards an interactive high visual complexity animation system
Authors: C. Csuri, R. Hackathorn, R. Parent, W. Carlson, M. Howard
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

A computer animation system is discussed which employs interactive techniques and presents a unified approach to the graphical display of complex three dimensional data. The system facilitates the generation, manipulation and display of highly detailed data with the aid of interactive devices and a video interface to a standard color TV monitor. The system enables the animator to create a variety of objects (including texture) and to specify the necessary transformations for animation sequences. A run length processing technique combined with a brute force Z-buffer algorithm has been newly designed and implemented that can handle the intersection of several million faces, lines and points. This makes possible a full range of visual cues to simulate fire, smoke, water and complex 3-D texture such as grass, hair and bark. Basic concepts and approaches are described. The display algorithm and the procedure model to generate texture are presented and the implications of the system for computer animation are discussed. Extensions to the system are outlined which include a unique graphics display processor currently under construction that includes a partial implementation of the display algorithm in hardware.
BOP&mdash;An approach to building optimization
Authors: G. Neil Harper
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The problem of finding an appropriate building configuration to satisfy a client's building program is by no means rudimentary. When one imposes additional requirements that the building shall be an &ldquo;efficient&rdquo;, &ldquo;economical&rdquo;, or &ldquo;optimum cost&rdquo; building, the mathematical difficulties encountered in operating on a large data base to achieve some kind of optimum result are almost insurmountable. In the past, these formidable problems of searching out the best-or even an acceptable-solution have been solved largely on the basis of intuition and random investigation of a small number of possible solutions. The numerous successful buildings in our cities today are a testimony to man's remarkable and innate ability to intuit, evaluate, and synthesize. It is conceivable, however, that these as yet unexplained human abilities can be extended and magnified if proper use could be made of appropriate computer techniques dealing with information processing.
Government interest and involvement in design automation development the VHSIC perspective
Authors: Larry W. Sumney
Venue: Proceedings of the 18th Design Automation Conference (1981)

This paper describes the VHSIC Program and seeks to delineate the challenges for design automation which are vital to the Program's success. More than one-half of the VHSIC Program will focus on design architecture, software, and test. Because of the extreme importance of advanced militarized integrated circuits to our defense posture, alternatives to controlling the premature export of circuits, equipment, and technical data will be briefly reviewed. Finally, the opportunity to synergistically solve VHSIC design problems while significantly reducing software costs is discussed.
Treat - an applicative code generator
Authors: Jerald S. Schwarz, Dean Rubine
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

Treat is a special purpose language for use in compiler writing. A Treat program translates a graph into c-trees (the intermediate language of the pcc compiler) and uses the back end of the C compiler to generate code. Treat has been developed specifically for use in an AdaTM compiler. A Treat program consists of applicative transformation rules. Treat's distinctive aspects include triggering transformations during pattern matching, a context mechanism for dynamic binding and assignment in a language with lazy evaluation.
Information retrieval with APL by adaptive index and user guidance
Authors: Hans-Joerg Schek, Georg Walch
Venue: ACM SIGAPL APL Quote Quad (1979)

A system is described applicable for information retrieval and update both in formatted and unformatted files containing non-numerical data. It uses a new reference-string indexing technique which supports partial-match queries and similar-record search. The reference-string index is adapted to data usage or data. Those parts of records which are estimated by the program to be specified very often in queries are included as reference strings and inverted. For data access in the retrieval phase, the specified attribute values and their logical expressions are transformed into a logical expression between reference strings. Primary and secondary (index) data are stored as external files using auxiliary processors for access. The retrieval and update functions are combined with the user-guidance component used to describe data (dictionary), to teach system use, and to assist as a permanently available Help feature. As an internal structure it uses a semantic net to navigate the user from general to more specific information. A new interesting feature is the use of selected reference strings and selected combinations of them as a more detailed data description extracted automatically from the data or even data usage.
Patterns of experience in text editing
Authors: Mary Beth Rosson
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

What are the effects of experience on text editing behavior? Do users inevitably develop optimal strategies for getting their work done? The answer to such questions are becoming increasingly important, as more and more individuals begin to use word processing equipment routinely. In the best of all possible worlds, experienced users do become experts, able to quickly and accurately choose and execute optimal procedures to accomplish any given goal. Such a state of affairs would make designers of editing systems very happy indeed. But another alternative exists, that at least some proportion of experienced and frequent users stabilize at some nonoptimal level of skill. An initial survey of relevant research is encouraging. So, for example, Card, Moran, and Newell (1980) were able to deduce selection rules from experienced users' editing behavior that predicted 80% of their editing decisions, suggesting that experienced users have fairly well-defined heuristics for carrying out editing tasks. Tyler and Roth (1982) followed up on this work, demonstrating that novices were less likely to demonstrate selection rules than experienced users, preferring instead to rely on a single, sometimes inefficient, strategy. Finally, Folley and Williges (1982) demonstrated that when confronted with the description of a novel editor, users experienced on other systems make use of a greater number of commands in carrying out a paper-and-pencil application of the editor than do complete novices.
Characteristics and models of program behaviour
Authors: Patrice Burgevin, Jacques Leroudier
Venue: Proceedings of the 1976 annual conference (1976)

By interpreting the execution of programs on a CII 10070 computer, data on the characteristics of program behaviour during their execution have been collected. The results concern the activity of programs in their address space and the time interval distributions between the I/O requests of a program. These observations have been used to validate and to characterize models of program behaviour such as the LRU stack, the life-time function and the working-set, and to point out the relationships between these different models.
A multivalued switching algebra with Boolean properties
Authors: Jean Dussault, Gernot Metze, Moshe Krieger
Venue: Proceedings of the sixth international symposium on Multiple-valued logic (1976)

This paper introduces an N-valued (N&equil;2k) generalized Boolean algebra obtained by extending the set of operators of N-valued Boolean algebras. The additional operators, needed for functional completeness, are unary operators and were selected such that the basic structure and simplicity of Boolean algebras are retained. The characteristics of this switching algebra are investigated in detail and are compared with the characteristics of general N-valued algebras. It is seen that the proposed algebra is much simpler than the Post algebras and their extensions presently used and that many binary switching techniques can be generalized so that they apply to this algebra. To show this, manipulation and minimization procedures are outlined.
Determining probability distributions by maximum entropy and minimum cross-entropy
Authors: Rodney W. Johnson
Venue: ACM SIGAPL APL Quote Quad (1979)

The principle of maximum entropy and a generalization, the principle of minimum cross entropy, are prescriptions for solving problems of the following sort, which are encountered in a remarkable number of different fields. Namely, some system may be in any one of a given set of states; the probabilities of its being in the various states are not specified, but information about the probability distribution is available in the form of expectation values of given functions on the set of states. It is required to assign an optimal, or minimally prejudiced, set of state probabilities consistent with the given information. This paper describes the principles and presents APL functions that use the Newton-Raphson method to compute maximum-entropy and minimum-cross-entropy probability distributions for arbitrary sets of given expectation values. Example calculations are given.
World data communications as seen by the Data Processing Systems designer
Authors: George J. Lissandrello
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

Developments of national and international communication served Data Processing Systems is dependent upon not only the availability of facilities, but on the economics involved. The paper shows in graphic form the differences in the tariff structures in the countries and also a comparison of break-even costs when it is economically justified to lease telegraph or telephone lines versus utilizing the telex or the telephone switched facility. There will also be a comparison of available facilities by country, leased point-to-point, leased multipoint, switched telephone and telex. Included in this paper will be a comparison of attachment policies and a summary status of the remote computing services.
Combining management and technology in a master's degree for information system professionals
Authors: Thomas E. Kurtz, A. Kent Morton
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

By the early to middle 1970's it was clear that education in computer science and related fields was failing to meet many of the needs of business and industry. In self-defense, many firms adopted the practice of hiring PhD's to lead programming projects (on the grounds that the PhD's were bright). Other firms chose to hire bright Bachelors, most of whom had little or no formal training in programming or software engineering (on the grounds that bright people could learn on the job). A side effect of these practices was that most of the PhD's were being siphoned off into industry and were thus unavailable to staff the rapidly growing computer science departments in higher education. At the same time, bright computer science Bachelors were enticed directly into industry by high salaries, and thus did not pursue advanced degrees. These factors were no doubt part of the reason for the severe shortage of computer scientists available to higher education.
Structured design benefits to a process control software project
Authors: G. P. Benincasa, A. Daneels, P. Heymans, Ch. Serre
Venue: Proceedings of the first SIGMINI symposium on Small systems (1978)

A 12-man-year process control software project has been successfully completed in 12 months without interruption of the production process of CERN PS accelerators. After 6 months of careful preparation by a small team, 9 man-years of software, i.e. around 100 control programs amounting to more than 40'000 instructions, have been produced in 6 months by 6 experienced full-time software engineers and 24 part-time engineers and technicians, part of whom had never programmed before. The delivered product met the users specifications, was completed within schedule, conformed to the standards and was fully documented.
Anti-aliased line drawing using brush extrusion
Authors: Turner Whitted
Venue: ACM SIGGRAPH Computer Graphics (1983)

This algorithm draws lines on a gray-scale raster display by dragging a &ldquo;brush&rdquo; along the path of the line. The style of the line is determined by the properties of the brush. An anti-aliasing calculation is performed once for the brush itself and thereafter only a trivial additional operation is needed for each pixel through which the brush is dragged to yield an anti-aliased line. There are few constraints on the size, shape, and attributes of the brush. Lines can be curved as well as straight, It is possible to produce lines with a three dimensional appearance.
Optimal processor interconnection topologies
Authors: Mamoru Maekawa
Venue: Proceedings of the 8th annual symposium on Computer Architecture (1981)

This paper proposes the optimal processor interconnection topologies for parallel processing. The topologies are optimal with respect to the performance/cost ratio under the controlled message transfer delay and can be systematically constructed for an arbitrary number of processors. The addition and the deletion of processors are simple and done with the minimum number of bus reconnections. The message transfer delay, as well as the reliability, can be controlled by changing the degree of the topology. Owing to these properties, the optimal interconnection topologies are suitable for many kinds of parallel processing systems and algorithms.
Structured data interfacing for software systems
Authors: Chin-Kuei Cho
Venue: Proceedings of the 1977 annual conference (1977)

Structured programming has drawn considerable attention. Discussions have focused on language and data manipulations, however, and little has been done in the area of structuring data interfacing schemes for transferring data from one routine to another within a software system. Without proper rules governing the structuring of such schemes, it is difficult to trace the data interfacing flows. A structured data interfacing method, including selections of external routine usages, common file allocations, data naming techniques, and scheme construction criteria for solving the data traceability problem is suggested. As a result, the sources, destinations and types of the data in a data transferring flow are explicity traceable with the names of the data. The application of this method to a FORTRAN system is presented. Similar applications to systems in other languages will help to further the state of the art of software system development.
Description of dynamic manipulation of ALGOL68 values using a generative grammar.
Authors: C. F. Vansina
Venue: Proceedings of the Strathclyde ALGOL 68 conference (1977)

Code generation is very complex. Using ALGOL68, complexity increases due to the recursivity of the manipulated values. The set of routines manipulating values will be recursive too. Describing such a manipulating process with flow charts makes it less readable. To avoid that difficulty the description of the process will use a generative action grammar. With such a grammar recursivity is natural, so the description of a recursive process will be very readable. Moreover, such a grammar can easily be translated into a program, which will be very structured and modular. The produced code will be very structured too and that can be helpful for debugging and checking processes.
Some dimensions of the computer programming management problem at the federal level
Authors: Carl W. Clewlow
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

The rapid strides that are being made in the physical sciences and the relatively slower advancement in the administrative arts and sciences have worked together to create an ever-widening management gap. Perhaps nowhere is this gap more apparent than in the field of computer management, where the physical development of the computer has outstripped management's ability to come close to achieving an optimum or even a moderately effective utilization. My purpose in what follows is to explore some of the circumstances that have caused and maintained this gap, especially with regard to computer programming&mdash;but, more important, to identify those efforts and techniques which have given promise of its narrowing. While my remarks will be focused primarily on the Federal Government, this is not to say that the Federal Government has a corner on all of the problems in this area&mdash;or all the immediate solutions.
An approach to gate assignment and module placement for printed wiring boards
Authors: Ikuo Nishioka, Takuji Kurimoto, Seiji Yamamoto, Isao Shirakawa, Hiroshi Ozaki
Venue: Proceedings of the 15th Design Automation Conference (1978)

High density packaging is one of the most urgent requirements in the design of digital systems. In the assembly of such systems, printed wiring boards (PWB's) are used very often to provide the necessary interconnection among circuit modules. Thus, methods to raise wiring density of PWB's are continually under investigation. Given a router to realize 100 percent wiring, an efficient method for assigning logical gates to circuit modules and for determining the placement of the modules on a given PWB may contribute more toward raising the wirability than improving the existing routing scheme, especially when all available sophisticated routing algorithms have been attempted. The present paper proposes an algorithm to the problem of gate assignment and module placement, to be added to an existing router. It operates on a PDP 11/40 with 24K words core memory and 1.2M words disk storage coupled with a TEKTRONIX 4014 graphics terminal. We also show how effectively the described assignment and placement scheme improves the wirability of the router.
Perceptual embedded image coding using wavelet transforms
Authors: A. Mazzarri, R. Leonardi
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

We present a modified version of an embedded wavelet coding scheme, first suggested by Shapiro (see IEEE Transactions on Signal Processing, vol.41, no. 12, p.3445-3462, 1993), that improves the performance of the original algorithm in a visual subjective distortion sense. We preserve the features of the original Shapiro's embedded coder. It is possible to choose a fixed target bit rate, as the information needed to represent an image coded at some rate always contains the needed information for the same image coded at lower rates. Therefore, the decoder can cease decoding the bit stream at any point, simulating an image coded at a lower rate corresponding to the truncated bit stream. We also introduce some perceptive improvements by adopting different (more regular) filters with respect to the original QMF pyramid filters proposed by Simoncelli, Hingorani et al. (1987) and used by Shapiro. These filters are synthesized using a "wavelet approach" instead of a "subband approach", and this leads to a better control on their regularity properties, jointly with better perceptual performance.