ppxscal/embedding_network huggingface dataset:
Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
Authors: Andreas Wächter, Lorenz T. Biegler
Venue: SIAM Journal on Computing (1987)

Line search methods are proposed for nonlinear programming using Fletcher and Leyffer's filter method [Math. Program., 91 (2002), pp. 239--269], which replaces the traditional merit function. Their global convergence properties are analyzed. The presented framework is applied to active set sequential quadratic programming (SQP) and barrier interior point algorithms. Under mild assumptions it is shown that every limit point of the sequence of iterates generated by the algorithm is feasible, and that there exists at least one limit point that is a stationary point for the problem under consideration. A new alternative filter approach employing the Lagrangian function instead of the objective function with identical global convergence properties is briefly discussed.
On Access Checking in Capability-Based Systems
Authors: Richard Y. Kain, Carl E. Landwehr
Venue: IEEE Transactions on Software Engineering (1987)

Public descriptions of capability-based system designs often do not clarify the necessary details concerning the propagation of access rights within the systems. A casual reader may assume that it is adequate for capabilities to be passed in accordance with the rules for data copying. A system using such a rule cannot enforce either the military security policy or the Bell and LaPadula rules. The paper shows why this problem arises and provides a taxonomy of capability-based designs. Within the space of design options defined by the taxonomy we identify a class of designs that cannot enforce the Bell-LaPadula rules and two designs that do allow their enforcement.
Profiles in computing: Allan L. Scherr
Authors: Karen A. Frenkel
Venue: Communications of the ACM (1987)

"Most of the work I've done has been done to break things into existence that didn't exist before. . . . In a sense, my whole career's been about building organizations that didn't exist before, creating processes to do things that have never been done before, and solving technical problems that hadn't been solved before. The work I did at MIT was that way as well. There was no real foundation to build on, and I had to make it up as I went along. That's characterized, if not my whole career, at least the parts of my career that I consider the most rewarding." "Pioneers are also the people that get arrows shot through them. That's the downside, and I've had my share of arrows pulled out of my hide."
The packer filter: an efficient mechanism for user-level network code
Authors: J. Mogul, R. Rashid, M. Accetta
Venue: Proceedings of the eleventh ACM Symposium on Operating systems principles (1987)

Code to implement network protocols can be either inside the kernel of an operating system or in user-level processes. Kernel-resident code is hard to develop, debug, and maintain, but user-level implementations typically incur significant overhead and perform poorly.The performance of user-level network code depends on the mechanism used to demultiplex received packets. Demultiplexing in a user-level process increases the rate of context switches and system calls, resulting in poor performance. Demultiplexing in the kernel eliminates unnecessary overhead.This paper describes the packet filter, a kernel-resident, protocol-independent packet demultiplexer. Individual user processes have great flexibility in selecting which packets they will receive. Protocol implementations using the packet filter perform quite well, and have been in production use for several years.
Applications of hashing in algebraic manipulation (an annotated bibliography)
Authors: Carl D. Ponder
Venue: ACM SIGSAM Bulletin (1987)

There are several ways of applying hashing techniques in symbolic manipulation systems. Hashing can be used to reduce the time and space requirements of programs, as well as provide powerful techniques of pattern matching. Descriptions and references are given for innovative applications of hashing.
Implementation of an FP-Shell
Authors: Y. H. Kamath, M. M. Matthews
Venue: IEEE Transactions on Software Engineering (1987)

One of the best features of the UNIX Shell is that it provides a framework which can be used to build complex programs by interconnecting existing simple programs. However, it is limited to linear combinations of programs, and building of more complex programs must be accomplished by executing sequences of commands. This paper introduces Backus' FP (Functional Programming) as an alternative command language for UNIX. In FP, programs are true functions and another distinctive feature of FP languages is that they contain functional forms, which are constructs for combining programs to build new programs. Also, the functional style of programming provides a natural way of exploiting parallel machine architecture.
Anatomy of a compact user interface development tool
Authors: Jack W. Stott, Jeffrey E. Kottemann
Venue: Communications of the ACM (1988)

Many contemporary user oriented applications require a combination of attributes from both window and forms management systems. PANES was developed as a tool to fill this niche by providing a simple, yet flexible tool for both the moderately trained, as well as the more sophisticated programmer, while allowing the development of user friendly, modeless application software.
Integration of Liouvillian functions with special functions
Authors: P. H. Knowles
Venue: Proceedings of the fifth ACM symposium on Symbolic and algebraic computation (1986)

In this paper, we discuss a decision procedure for the indefinite integration of transcendental Liouvillian functions in terms of elementary functions and logarithmic integrals. We also discuss a decision procedure for the integration of a large class of transcendental Liouvillian functions in terms of elementary functions and error-functions.
An approach to image retrieval from large image databases
Authors: F. Rabitti, P. Stanchev
Venue: Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval (1987)

In this paper we address the problem of retrieving images from large image databases, giving a partial description of the image content. This approach allows a limited automatic analysis for image belonging to a domain described in advance to the system using a formalism based on fuzzy sets. The image query processing is based on special access structures generated from the image analysis process.
Log files: an extended file service exploiting write-once storage
Authors: R. Finlayson, D. Cheriton
Venue: ACM SIGOPS Operating Systems Review (1987)

A log service provides efficient storage and retrieval of data that is written sequentially (append-only) and not subsequently modified. Application programs and subsystems use log services for recovery, to record security audit trails, and for performance monitoring. Ideally, a log service should accommodate very large, long-lived logs, and provide efficient retrieval and low space overhead.In this paper, we describe the design and implementation of the Clio log service. Clio provides the abstraction of log files: readable, append-only files that are accessed in the same way as conventional files. The underlying storage medium is required only to be append-only; more general types of write access are not necessary. We show how log files can be implemented efficiently and robustly on top of such storage media&mdash;in particular, write-once optical disk.In addition, we describe a general application software storage architecture that makes use of log files.This work was supported in part by the Defense Advanced Research Projects Agency under contracts N00039-84-C-0211 and N00039-86-K-0431, by National Science Foundation grant DCR-83-52048, and by Digital Equipment Corporation, Bell-Northern Research and AT T Information Systems.
The Path Prefix Software Testing Strategy
Authors: R. E. Prather, J. P. Myers,  Jr.
Venue: IEEE Transactions on Software Engineering (1987)

A new software testing strategy is described. The strategy is "adaptive" in that previous test paths (inputs) are used as a guide in the selection of subsequent paths (inputs). Preliminary implementations have successfully exploited the method's inherent user-interactive capability. The method ensures branch coverage, requires only "order n" tests (n being the number of decision nodes in the program flowgraph), and offers considerable advantages over existing strategies in its computational requirements.
The concept of a supercompiler
Authors: Valentin F. Turchin
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1986)

A supercompiler is a program transformer of a certain type. It traces the possible generalized histories of computation by the original program, and compiles an equivalent program, reducing in the process the redundancy that could be present in the original program. The nature of the redundancy that can be eliminated by supercompilation may be various, e.g., some variables might have predefined values (as in partial evaluation), or the structure of control transfer could be made more efficient (as in lazy evaluation), or it could simply be the fact that the same variable is used more than once. The general principles of supercompilation are described and compared with the usual approach to program transformation as a stepwise application of a number of equivalence rules. It is argued that the language Refal serves the needs of supercompilation best. Refal is formally defined and compared with Prolog and other languages. Examples are given of the operation of a Refal supercompiler implemented at CCNY on an IBM/370.
Intermedia: The architecture and construction of an object-oriented hypemedia system and applications framework
Authors: Norman Meyrowitz
Venue: ACM SIGPLAN Notices (1986)

This article presents a case study of the development of the Intermedia system, a large, object-oriented hypermedia system and associated applications development framework providing sophisticated document linkages. First it presents the educational and technological objectives underlying the project. Subsequent sections capture the process of developing the Intermedia product and detail its architecture and construction, concentrating on the areas in which object-oriented technology has had a significant role. Finally, the successes and failures of the development approach are examined, and several areas of standardization and research that would enhance the process are proposed.
The 'Neural' Phonetic Typewriter
Authors: Teuvo Kohonen
Venue: Computer (1988)

The factors that make speech recognition difficult are examined, and the potential of neural computers for this purpose is discussed. A speaker-adaptive system that transcribes dictation using an unlimited vocabulary is presented that is based on a neural network processor for the recognition of phonetic units of speech. The acoustic preprocessing, vector quantization, neural network model, and shortcut learning algorithm used are described. The utilization of phonotopic maps and of postprocessing in symbolic forms are discussed. Hardware implementations and performance of the neural networks are considered.
The coloring and maximum independent set problems on planar perfect graphs
Authors: Wen-Lian Hsu
Venue: Journal of the ACM (JACM) (1988)

Efficient decomposition algorithms for the weighted maximum independent set, minimum coloring, and minimum clique cover problems on planar perfect graphs are presented. These planar graphs can also be characterized by the absence of induced odd cycles of length greater than 3 (odd holes). The algorithm in this paper is based on decomposing these graphs into essentially two special classes of inseparable component graphs whose optimization problems are easy to solve, finding the solutions for these components and combining them to form a solution for the original graph. These two classes are (i) planar comparability graphs and (ii) planar line graphs of those planar bipartite graphs whose maximum degrees are no greater than three. The same techniques can be applied to other classes of perfect graphs, provided that efficient algorithms are available for their inseparable component graphs.
A history of the Promis technology: an effective human interface
Authors: Jan Schultz
Venue: Proceedings of the ACM Conference on The history of personal workstations (1986)

Scientific computing systems for individuals were pioneered early at Hewlett-Packard, beginning with the 9100A Desktop Calculator in 1968. Extensions of this first machine were soon seen in Personal Peripherals, such as Printers, Tape Cartridges, and Plotters, and followed by Graphic CRT Displays. By early 1972, the Desktop unit had been augmented by a very powerful Pocket Calculator, the ground-breaking HP 35A.This paper traces the evolution of these machines to the present day, following four main themes: 1. Scientific Desktop Computers; 2. Personal Calculators and Portable Computers; 3. Personal Peripherals; and 4. Personal Business Computers.The underlying technologies are described, as well as the product definitions and the market development. The company organization is described in some detail, since it appears both unorthodox in the industry and particularly appropriate for certain elements of the accomplishments.Some of the key people will be highlighted for their personal contributions, but the theme will revolve rather around the Team structure that seems responsible for the continued success in many of these product sectors.The paper concludes with considerations about two corollary impacts of this pioneering effort: 1. The development of Data-Domain design and test methodologies; and 2. The impact of Pocket Calculators on the mathematical skills and procedures of our society.
An approach to natural language for document retrieval
Authors: B. Croft
Venue: Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval (1987)

Document retrieval systems have been restricted, by the nature of the task, to techniques that can be used with large numbers of documents and broad domains. The most effective techniques that have been developed are based on the statistics of word occurrences in text. In this paper, we describe an approach to using natural language processing (NLP) techniques for what is essentially a natural language problem - the comparison of a request text with the text of document titles and abstracts. The proposed NLP techniques are used to develop a request model based on &ldquo;conceptual case frames&rdquo; and to compare this model with the texts of candidate documents. The request model is also used to provide information to statistical search techniques that identify the candidate documents. As part of a preliminary evaluation of this approach, case frame representations of a set of requests from the CACM collection were constructed. Statistical searches carried out using dependency and relative importance information derived from the request models indicate that performance benefits can be obtained.
Toward compiler implementation correctness proofs
Authors: Laurian M. Chirica, David F. Martin
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1986)

Aspect of the interaction between compiler theory and practice is addressed. Presented is a technique for the syntax-directed specification of compilers together with a method for proving the correctness of their parse-driven implementations. The subject matter is presented in an order-algebraic framework; while not strictly necessary, this approach imposes beneficial structure and modularity on the resulting specifications and implementation correctness proofs. Compilers are specified using an order-algebraic definition of attribute grammars. A practical class of compiler implementations is considered, consisting of those driven by LR(k) or LL(k) parsers which cause a sequence of translation routine activations to modify a suitably initialized collection of data structures (called a translation environment). The implementation correctness criterion consists of appropriately comparing, for each source program, the corresponding object program (contained in the final translation environment) produced by the compiler implementation to the object program dictated by the compiler specification. Provided that suitable intermediate assertions (called translation invariants) are supplied, the program consisting of the (parse-induced) sequence of translation routine activations can be proven partially correct via standard inductive assertion methods.
Data Compression in Scientific and Statistical Databases
Authors: M. A. Bassiouni
Venue: IEEE Transactions on Software Engineering (1985)

Scientific and statistical database systems heavily depend on data compression techniques to make possible the management and storage of their large databases. The efficiency of data compression methods has a signficant impact on the overall performance of these systems. The purpose of this paper is to show the importance of data compression to scientific/statistical databases, to discuss the pros and cons of data compression, and to survey data compression techniques relevant to scientific/statistical databases. The emphasis is on the basic idea, motivation, and tradeoffs of each approach. Both software and hardware methods are covered. The paper is concluded by a discussion of several points of research that seem worthy of further investigation.
Byzantine clock synchronization
Authors: Leslie Lamport, P M Melliar Smith
Venue: ACM SIGOPS Operating Systems Review (1986)

An informal description is given of three fault-tolerant clock-synchronization algorithms. These algorithms work in the presence of arbitrary kinds of failure, including "two-faced" clocks. Two of the algorithms are derived from Byzantine Generals solutions.
An experimental program investigating color-enhanced and graphical information presentation: an integration of the findings
Authors: Izak Benbasat, Albert S. Dexter, Peter Todd
Venue: Communications of the ACM (1986)

A series of three laboratory experiments were conducted to assess the influence of graphical and color-enhanced information presentation modes on decision quality, decision making time, use of information, and user perceptions. The experimental design allowed for the unconfounded study of line graphs and color using a variety of information presentation designs for the same decision making task. Based on the findings of these studies, propositions about the impact of graphics and color on individual decision makers are presented. The influence of presentation mode on human performance and the perceived value of information is related to how well it supports the solution approach to a particular task. The benefits of graphics are limited to reducing decision making time but only when the graphical report has been designed to directly assist in solving the task. Multicolor reports aid in decision making, but only in specific circumstances, that is, their benefits are not pervasive. It appears that color is more advantageous when associated with graphical reports, for certain decision maker types, during learning periods, and in time constrained environments.
Modeling a transport layer protocol using first-order logic
Authors: H P Lin
Venue: Proceedings of the ACM SIGCOMM conference on Communications architectures protocols (1986)

We use a hybrid model based on the first-order logic to specify and verify a transport layer protocol. In this model we specify a protocol as a set of state machines. Time expressions are used to describe the temporal relations of transitions. Given the specification of a protocol, we verify its properties by logical deduction. Reasoning techniques such as decomposition and abstraction are used to reduce the verification complexity. The transport protocol consists of an active process, a passive process, and two communication channels. Each of these components is specified by this model. An outline of verification of this protocol is given.
Intelligent information-sharing systems
Authors: Thomas W Malone, Kenneth R Grant, Franklyn A Turbak, Stephen A Brobst, Michael D Cohen
Venue: Communications of the ACM (1987)

The Information Lens system is a prototype intelligent information-sharing system that is designed to include not only good user interfaces for supporting the problem-solving activity of individuals, but also good organizational interfaces for supporting the problem-solving activities of groups.
Reference model for the integration of tools in the EUREKA software factory
Authors: B. Gasch, U. Kelter, H. Kopfer, H. Weber
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

EUREKA is a multi-national European research and development program supporting the advancement of the European technological base in the most important high-tech domains. The EUREKA SOFTWARE FACTORY (ESF) is one of the projects supported under this program. The main goals of ESF are the development of concepts for the construction of integrated software engineering environments with such characteristics as openness (i.e. the possibility to add new tools to an existing environment), plug-in capability (i.e. to provide standard interfaces for the connection of tools), and reuse capability (i.e. the reuse of tools in different environments). In order to achieve these goals the ESF concept is making provisions for the integration of tools based on a reference model that serves as a standardized framework for the interaction of tools. This paper describes the reference model and explains the integration problems that will be overcome with its use.
Three-dimensional object recognition
Authors: Paul J. Besl, Ramesh C. Jain
Venue: ACM Computing Surveys (CSUR) (1985)

A general-purpose computer vision system must be capable of recognizing three-dimensional (3-D) objects. This paper proposes a precise definition of the 3-D object recognition problem, discusses basic concepts associated with this problem, and reviews the relevant literature. Because range images (or depth maps) are often used as sensor input instead of intensity images, techniques for obtaining, processing, and characterizing range data are also surveyed.
Handing of significant deviations from boilerplate text
Authors: G. Morris, K. Taylor, M. Harwood
Venue: Proceedings of the 1st international conference on Artificial intelligence and law (1987)

We are attempting to extract information automatically from large legal documents. SPADES is an expert system for screening pension plans submitted to the Internal Revenue Service (IRS), a task which has resisted prior automation attempts. Nearly all pension plans are prepared by plan preparation specialists. Most of a pension plan document consists of boilerplate text, which is reused by the preparer in nearly every plan. We describe techniques used for dealing with plans which essentially follow the boilerplate model for a particular preparer, but contain significant deviations. A significant deviation is found to be any extra paragraph in a new plan which was not predicted by the boilerplate model. Other deviations from the boilerplate model can be handled fairly easily. Treatment of a significant deviation is affected by whether the topic of the extra paragraph can be identified. When it can, the logical impact of the extra text may be deduced by the system, or the system may guide an IRS Agent in analyzing the extra paragraph.