ppxscal/embedding_network huggingface dataset:
Software requirements: Are they really a problem?
Authors: T. E. Bell, T. A. Thayer
Venue: Proceedings of the 2nd international conference on Software engineering (1976)

Do requirements arise naturally from an obvious need, or do they come about only through diligent effort&mdash;and even then contain problems? Data on two very different types of software requirements were analyzed to determine what kinds of problems occur and whether these problems are important. The results are dramatic: software requirements are important, and their problems are surprisingly similar across projects. New software engineering techniques are clearly needed to improve both the development and statement of requirements.
Iterated pushdown automata and complexity classes
Authors: Joost Engelfriet
Venue: Proceedings of the fifteenth annual ACM symposium on Theory of computing (1983)

An iterated pushdown is a pushdown of pushdowns of ... of pushdowns. An iterated exponential function is 2 to the 2 to the ... to the 2 to some polynomial. The main result is that nondeterministic 2-way and multi-head iterated pushdown automata characterize deterministic iterated exponential time complexity classes. This is proved by investigating both nondeterministic and alternating auxiliary iterated pushdown automata, for which similar characterization results are given. In particular it is shown that alternation corresponds to one more iteration of pushdowns. These results are applied to the 1-way iterated pushdown automata: (1) they form a proper hierarchy with respect to the number of iterations, (2) their emptiness problem is complete in deterministic iterated exponential time.
Implementation of an interpreter for abstract equations
Authors: Christoph M. Hoffmann, Michael J. O`Donnell
Venue: Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1984)

This paper summarizes a project, introduced in [HO79, HO82b], whose goal is the implementation of a useful interpreter for abstract equations that is absolutely faithful to the logical semantics of equations. The Interpreter was first distributed to Berkeley UNIX VAX sites in May, 1983. The main novelties of the interpreter are (1) strict adherence to semantics based on logical consequences; (2) &ldquo;lazy&rdquo; (outermost)evaluation applied uniformly; (3) an implementation based on table-driven pattern matching, with no run-time penalty for large sets of equations; (4) strict separation of syntactic and semantic processing, so that different syntaxes may be used for different problems.
Image resizing in the discrete cosine transform domain
Authors: S. A. Martucci
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2 (1995)

Image resizing is a task that must often be done when processing digital images. We present a novel approach to resize images by operating entirely in the discrete cosine transform (DCT) domain. We implement the lowpass filter for anti-aliasing or anti-imaging using the convolution-multiplication property of the DCT. We perform the equivalent of pixel-domain downsampling or upsampling by simple manipulation of the DCT coefficients. Our approach can be used as a standalone image resizing tool or it can be integrated into any image compression system based on a block DCT, such as JPEG, to provide an image resizing capability with relatively little additional complexity.
A general analysis system for document's layout structure recognition
Authors: Y. H. Liu-Gong, B. Dubuisson, H. N. Pham
Venue: Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2 (1995)

This paper introduces a new method for transforming the images of a document into its layout structure by the use of an analysis system and several models. The analysis system is independent of the document, and can recognize various documents with the help of some generic models. The definition of a model is based on a document's generic layout structure. The models contain rules necessary for identifying layout structure components.
Comparison of models of individual choice in a complex setting
Authors: Alan Goldberg, Eugene E. Kaczka
Venue: Proceedings of the 11th conference on Winter simulation - Volume 1 (1979)

In response to gasoline shortages, pollution problems and the rise in oil prices, it is clear that individual commuting habits may be modified. To assist planners in evaluating the impact of alternative policies, models of individual behavior in complex mode choice environments are necessary. This paper examines the use of simulation in association with statistical methodologies to verify models of traveler behavior. The data employed in the calibration and evaluation of the models was derived in a large scale longitudinal study. In conjunction with an UMTA demonstration project, policy makers were able to manipulate the cost and service of the transportation alternatives and observe in detail the responses over time of a large sample of individual users for whom extensive amounts of socio-economic data had been collected.
Ternary logic in digital computers
Authors: Roy D. Merrill,  Jr.
Venue: Proceedings of the SHARE design automation project (1965)

Although the states as well as the number representation of virtually every digital computer are implemented for the most part with binary logic, there are other systems such as the ternary or quinary that could just as well be used. The choice of which logic system to use should be determined primarily on the basis of cost, reliability, and operating speeds of the physical realization. This paper will be concerned with the potential of ternary logic, advantages of this logic, and whether in the future it could be expected to be utilized in digital systems.
Description and simulation of microcode execution
Authors: Alice C. Parker, Andrew Nagle
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

This paper presents a facility for the description and simulation of the inner machine of microprogrammable processors. The use of this facility for teaching microprogramming and for research is discussed. Twelve simulations are described, and an example simulation shown. Observations about the research are presented, and future research outlined.
A microsequencer architecture with firmware support for modular microprogramming
Authors: Christos A. Papachristou, Satnam Sing Gambhir
Venue: Proceedings of the 15th annual workshop on Microprogramming (1982)

The aim of this paper is to propose a microsequencer architecture and supporting firmware that are suitable for implementing modular microprogramming. The structure consists of a PLA sequencer store, a microcode store (memory) and an address processor. The latter, operating under sequencing commands issued by the PLA, generates the effective address for both stores. The supporting firmware primitives or transactions, stored in PLA, are suitable for structured microprogramming constructs, e.g., while-do, if-then-else, etc. This capability is extended to complex sequencing structures which are then implemented by context-free transaction blocks. Such sequencing is required to achieve migration of complicated. software functions, such as operating systems, in firmware. It is expected that the proposed method is compatible with LSI/VLSI array technology.
Application of axiomatic methods to a specification analyser
Authors: Susan L. Gerhart
Venue: Proceedings of the 7th international conference on Software engineering (1984)

The goal of this paper was to model a specification language and its analyser using axiomatic methods derived from those applied previously to abstract data type and state transition specifications. The models attempt to cover many interesting features of PSL/PSA, a widely used specification language and analyser for information systems. Simple properties expected to hold for actual PSL/PSA were formalized and proved about some models, with assumptions about undefined parts. Both model formulation and property proofs were performed within the AFFIRM Specification and Verification System. The results show (1) the applicability of axiomatic methods for modeling a new kind of software system, (2) insights into the PSL/PSA class of specification system, (3) a possible route for formal definition of such analysers, and (4) additional lessons on the art of specification, modeling, verification, and validation.
An analysis of code density for the two level programmable control of the Nanodata QM-1
Authors: Gideon Frieder, Jill Miller
Venue: Proceedings of the 10th annual workshop on Microprogramming (1977)

Several microinstruction formats which utilize hybrid combinations of horizontal and vertical formats are described. The microinstruction plus nanoinstruction format of two machines is described, and the existing nanocode of the Nanodata QM-1 is statistically analyzed. This analysis shows that the present encoding of these instructions is optimal for the flexible machine architecture.
GASP IV: A combined continuous/discrete, fortran based simulation language
Authors: Nicholas R. Hurst, A. Alan B Pritsker
Venue: Proceedings of the 6th conference on Winter simulation (1973)

GASP IV is an extension of the next event simulation language GASP II. A generalization definition of &ldquo;event&rdquo; and additions to language structure enable GASP IV to be used continuous or combined models while retaining full power of GASP II for discrete models. Continuous system state description may be in the form of a set of algebraic and/or differential equations. GASP IV handles the details of state and event control (including state variable integration when necessary), information storage and retrieval, system performance data collection and analysis, and report and plot generation. In addition to the models which can be coded in GASP II, the following types of models have been successfully coded in GASP IV: Systems Dynamics Models (Industrial, Urban, and World Dynamics Models); Mechanical Impact Models; and Chemical Process Models.
Managing the Complexity of Match in Retrieval by Spatial Arrangement
Authors: S. Berretti, A. Del Bimbo, E. Vicario
Venue: Proceedings of the 10th International Conference on Image Analysis and Processing (1999)

Image retrieval by spatial arrangement underlies a matching algorithm, which ``interprets'' entities specified in the user query on the entities appearing in the image of the database, and which jointly compares their features and their spatial relationships.In this paper, we provide a graph-theoretical formulation and we discuss the size for the problem of spatial matching as encountered in the specific application context of retrieval by visual content. We then expound and evaluate three state-space search algorithms which support efficient comparison of models through a heuristic bounding approach.
Linear algorithms to recognize interval graphs and test for the consecutive ones property
Authors: Kellogg S. Booth, George S. Lueker
Venue: Proceedings of seventh annual ACM symposium on Theory of computing (1975)

A matrix of zeroes and ones is said to have the consecutive ones property if there is a permutation of its rows such that the ones in each column appear consecutively. This paper develops a data structure which may be used to test a matrix for the consecutive ones property, and produce the desired permutation of the rows, in linear time. One application of the consecutive ones property is in recognizing interval graphs. A graph is an interval graph if there exists a 1-1 correspondence between its vertices and a set of intervals on the real line such that two vertices are adjacent if and only if the corresponding intervals have a nonempty intersection. Fulkerson and Gross have characterized interval graphs as those for which the clique versus vertex incidence matrix has the consecutive ones property. In testing this particular matrix for the consecutive ones property we may process the columns in a special order to simplify the algorithm. This yields the interval graph recognition algorithm which is presented in section 2; section 3 indicates how this algorithm may be extended to the general consecutive ones problem.
Efficient storage management in APL
Authors: Roy A. Sykes,  Jr.
Venue: Proceedings of the international conference on APL: part 1 (1979)

This paper discusses dynamic storage allocation in APL, its costs, and how they can be reduced in both real and virtual environments. It also discusses measures to avoid WS FULL's, and how the APL System itself attempts to conserve storage.
Architectural implications of abstract data type implementation
Authors: Virgil D. Gligor
Venue: Proceedings of the 6th annual symposium on Computer architecture (1979)

Some protection mechanisms support the implementation of abstract type objects. The &ldquo;separation of privilege&rdquo; and the &ldquo;least privilege&rdquo; principles define several requirements that must guide the design of such protection mechanisms. Some of these requirements can be used to eliminate inadequate or unnecessary mechanisms. Type protection mechanisms and some of the requirements of the least privilege principle have either practical theoretical limitations. To mitigate these limitations, a capability-based architecture must support (1) the migration of abstract type objects outside the control of their type manager, and (2) inexpensive, small segments. To meet the requiements of the &ldquo;separation of privilege&rdquo; and &ldquo;least privilege&rdquo; principles, a capability-based architecture only needs to support (1) protected procedures and (2) &ldquo;explicit&rdquo; mechanisms for separating access privileges to objects and to object representations.
An APL-guided tour through the elements of multi-dimensional geometry
Authors: Norman D. Thomson
Venue: Proceedings of the international conference on APL (1982)

APL provides a powerful and succinct way of describing geometric elements in spaces of multiple dimensions. This paper gives notes on how simplexes, cross polytopes and measure polytopes can be modelled in a manner which enables them to be drawn on graphics terminals, which thus become valuable tools for geometrical insight.
An experimental evaluation of Monte Carlo simulation in MIS project decisions
Authors: John B. Wallace,  Jr.
Venue: Proceedings of the 6th conference on Winter simulation (1973)

The paper describes the methodology and results of an experimental application of Monte Carlo Risk Analysis to the process of selecting and controlling Management Information System development projects. The investigator tested hypotheses concerning tradeoffs among sophistication of the risk analysis simulation programs, alternative techniques for estimating benefits of an MIS, and managerial acceptance of the results of simulation programs as guides to project decisions. The experiment was conducted using four different computer programs (two Monte Carlo and two non Monte Carlo) and three benefit-estimation paradigms (incorporating the managerial viewpoint, the management science viewpoint, and the opportunity-cost viewpoint, respectively) as applied to two actual MIS development projects. The data of the experiment were collected using structured interviews and taped de-briefing sessions.
The PL/EXUS language and virtual machine
Authors: Gary A. Sitton, Thomas A. Kendrick, A. Gil Carrick,  Jr.
Venue: Proceedings of the ACM-IEEE symposium on High-level-language computer architecture (1973)

This paper describes a high level general purpose language which evolved from another high level systems programming language. As well, the compiler, pseudocode, and virtual machine are discussed in some detail. The new language is a powerful PL/1 dialect, as is its parent language, XPL 1. PL/EXUS (Programming Language/Extended XPL Users' Superset), was created to satisfy a particular set of needs. A highly machine independent, mobile, compact, and powerful programming system was needed for implementation of programs to manipulate medical record data on modestly configured minicomputers. The primary extensions to XPL were semantic and dictated the structure of a host virtual machine. Because of the number of different data types and implicit mixed mode conversion rules, the virtual machine has a tagged data architecture. This results in a small instruction set of under 64 operators and thus enables powerful, implicit, run time instruction interpretation. The PL/EXUS virtual machine has a basic eight bit word size. Its virtual memory capabilities require only a fraction of the program and data to be in real memory at a time. The ability to specify storage space for most data types results in parsimonious space allocation in spite of the presence of tag words (one eight-bit byte per identifier or constant). Some instructions were specifically created to allow the compiler to &ldquo;peep-hole&rdquo; (i.e., locally) optimize generated pseudocode programs. The compiler itself is written in XPL, which permits self-compilation and makes possible its execution on the virtual machine or a simulated (interpretive) version of it.
Filling regions in binary raster images: A graph-theoretic approach
Authors: Uri Shani
Venue: ACM SIGGRAPH Computer Graphics (1980)

Filling regions in raster images is the term given to the problem of extracting a connected region (that contains some preselected seed pixel) and filling it with some color. A connected region is formally defined as the collection of all pixels that are in the transitive closure of a pixel-connectivity operator that is applied to the seed. For example, the 4-pixel-connectivity operator selects all pixels that are (spatially) 4-connected to the pixel operand, and have the same color. This problem can be solved relatively easily if the fill color is distinguishable so that every pixel, once colored (i.e. flagged OLD) will not be considered again. In binary images, the fill &ldquo;color&rdquo; is usually a binary pattern and therefore, a &ldquo;colored&rdquo; pixel may still have its previous (e.g., black or white) color. This fact makes the problem non-trivial. In this paper, a region to be filled is represented as a connected directed a-cyclic planar graph in which nodes are regular regions (defined below) that are easy to handle. An arc connects a regular region to its neighbor below which shares a common horizontal sub-boundary. Based on this abstract representation of a region, a formulation of the filling problem is developed as a variant of graph traversing. The difficulties imposed by filling with a binary pattern, and the avoidance of an explicit description of the graph are explored and a solution is presented. This solution utilizes the frame buffer (that is used to display the image) for improved efficiency of a graph traversal algorithm. This method turns out to be similar to [Lieberman-78], that is shown here to be incorrect. The complexity of the new algorithm is 0(N*L+ N*Log N), compared to 0(N*L*Log N) there, where N is the number of nodes in the graph and L is the average composite degree of each node. A proof of correctness for the new algorithm is given too.
Questionnaire results
Venue: Proceedings of the conference on APL (1969)

As a result of the Conference, a questionnaire was mailed to about 120 registrants, one to an installation, requesting that they submit a priority list of their desires in terms of additional APL support or further elements of implementation. About 50 questionnaires were returned; some of these were from 1130 users, some were from installations that had little or no experience with APL. There was a rather distinct, definable pattern of response. The items are listed below, in an order which closely reflects the priority of response indicated in the questionnaires. As you will note, the items are not necessarily disjointed in concept, and some of the requests were subject to interpretation. For instance, the suggestion of &ldquo;batch mode&rdquo; and a &ldquo;compiler&rdquo; might be interpreted as either or both, and they also might be involved in the support of additional &ldquo;I/O devices&rdquo;. Similarly, the ability to share workspaces relates to file access or file handling.
Functional programming and logical programming for the telegram analysis problem
Authors: Koji Torii, Yuji Sugiyama, Yoshitomi Morisawa, Tadao Kasami
Venue: Proceedings of the 7th international conference on Software engineering (1984)

The telegram analysis problem posed by P. Henderson and R.A. Snowdon has been repeatedly taken into account. This paper adds yet another contribution to this problem. We propose rigorous specification methods, and describe how programs can be derived from those in two different ways. One is from BNF to Definite Clause Grammar in Prolog and the other is a functional programming by which procedural programs can be easily derived from a formal specification in the form of an abstract sequential machine, too. The first method is especially useful for prototyping, and has been applied to file manipulation. The second method has been applied to sorting, file handlers and High Level Data Link Control Procedures.
Learning text editor semantics by analogy
Authors: Sarah A. Douglas, Thomas P. Moran
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (1983)

This paper presents a cognitive model for one aspect of how novices learn text editors&mdash;the acquisition of procedural skill by problem solving in problem spaces and the use of analogy for building a representation of the semantics of text-editor commands (which we call operators). Protocol data of computer-naive subjects learning the EMACS text editor suggests that they use their knowledge of typewriting to decide which commands to use in performing editing tasks. We propose a formal method of analysis that compares operators in two problem spaces and generates misconceptions. The comparison of these predicted misconceptions with verbal comments, error data, and task difficulty lends support to this analysis.
Laplace transform computer program
Authors: Robert H. Soli
Venue: Proceedings of the 6th annual Design Automation Conference (1969)

This paper describes a FORTRAN IV Laplace transform computer program, various algorithms used in the program, and an error evaluation of various portions of the program. It is a unified, 1000-card program that provides virtually all of the power associated with classical Laplace transform analysis. A further feature of the program is that the systems to be analyzed are described naturally by using Laplace transforms for the coding. An example is that the impedance of a series RLC circuit can be coded as: Z &equil; R + L*S + 1./(C*S) Capabilities of the program are: &bull;Bode plots &bull;Nichols plots &bull;Time response with plotting &bull;Fourier series with plotting &bull;RMS response to white noise inputs &bull;Evaluation of residues The program performs these computations using the complex arithmetic capabilities of FORTRAN IV. The program has been thoroughly debugged and has run successfully on various computer systems. It has been programmed to be run with FORTRAN IV in batch processing and the compiled program requires approximately 16K words of core.