ppxscal/embedding_network huggingface dataset:
Some uses of truncated Boolean vectors in analysis
Authors: Howard J. Smith,  Jr.
Venue: ACM SIGAPL APL Quote Quad (1990)

The truncated first occurrence vector (TFOV) is a data construct which the author has found useful in a variety of application areas. It is based on comparisons of adjacent items in a set ordered by some criterion. The use of the TFOV and its several derivatives improve efficiency and reduce the load on system resources. A contributing factor in performance improvement is the algorithm used in the APL implementations of monadic grade and its offshoot dyadic grade. It is interesting to note that an ordered set improves the efficiency of processes other than those utilizing the TFOV. Calculation of the range and median of a numeric set is an example of this. As new primitives have been added to APL, construction and generation of the TFOV has been simplified. The paper shows both the early and the later idioms used in programs. The techniques for calculating frequency distributions and the related statistical mode or modes are shown. The development of sub-totals by group in simple (single criterion) and hierarchical cases are illustrated. The generation of (ordered) defining subsets and &ldquo;arrival&rdquo; and &ldquo;departure&rdquo; sequences are shown. Along with the ordered defining subset (ODS) a pointer to the ODS can be developed. This technique has been found useful in applications requiring data compaction. The TFOV has proven useful in the development of control vectors for formatting tables especially for insertion of sub-total. A function for pagination of documents which eliminates &ldquo;widows&rdquo; has been developed, as have functions for reformatting paragraphs in text processing. In these latter cases, while the ordering algorithm is simply that of position, the concept is a direct outgrowth of experience with the TFOV. The techniques and concepts discussed in this paper are not intended to be exhaustive but are intended to stimulate programmers in considering an approach often overlooked. It is interesting to note that, while these ideas are applicable in other languages, their recognition required the primitives and arrays of APL.
Recognizing circle graphs in polynomial time
Authors: Csaba P. Gabor, Kenneth J. Supowit, Wen-Lian Hsu
Venue: Journal of the ACM (JACM) (1989)

The main result of this paper is an 0([V] x [E]) time algorithm for deciding whether a given graph is a circle graph, that is, the intersection graph of a set of chords on a circle. The algorithm utilizes two new graph-theoretic results, regarding necessary induced subgraphs of graphs having neither articulation points nor similar pairs of vertices. Furthermore, as a substep of the algorithm, it is shown how to find in 0([V] x [E]) time a decomposition of a graph into prime graphs, thereby improving on a result of Cunningham.
A decidable fragment of the elementary theory of relations and some applications
Authors: D. Cantone, V. Cutello
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

The class of purely universal formulae of the elementary theory of relations with equality is shown to have an NP-complete satisfiability problem, under the assumption that there is an a priori bound on the length of quantifier prefixes and the arities of relation variables. In the second part of the paper we discuss possible applications in the field of theorem proving in set and graph theory and of consistency checking for queries in relational databases.
MINION: an environment to organize mathematical problem solving
Authors: J. M. Purtilo
Venue: Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation (1989)

Existing computer algebra systems relieve us of having to perform tedious mathematical computations manually, thus enabling us to gain insight on the abstract problems at hand. Often these systems suggest alternate solution techniques directly. However, existing systems do little to help us manage the interactive computing environment as the scale of the problem grows: when the number of mathematical objects being studied increases, the complexity for a user to manage those objects in his environment seems to grow disproportionately. We need tools to relieve us of tedious organizational overhead every bit as much as we need the mathematical tools themselves. In response to this need, we are constructing a management assistant that works in conjunction with existing symbolic computation systems. Called Minion, it allows users to express simple plans for solving large problems in the interactive environment, and then guides the user's interaction according to that plan. Key features of this assistant are that plans are easy to construct (whether statically or during the problem solving session); the assistant helps a user visualize progress towards solving the global problem; and individual steps within a plan can be executed by arbitrary software tools, whether symbolic-, numeric- or logic-based in their implementation. Our prototype of Minion is made possible by the Polylith software interconnection system [Purt85, Purt88]. Previously we showed how Polylith's general software tool-bus based organization could help overcome the so-called 'symbolic-numeric gap' [Purt86]. Our current work with Minion takes advantage of that interconnection technology in order to focus on the management problems inherent within large scale, mathematical problem solving efforts. This paper briefly portrays the organizational problem that must be treated, and motivates the need for structure management tools in mathematical problem solving environments. We detail features of our Minion prototype that meet these needs. After a brief update on the status of our existing Polylith system, we describe how Minion is implemented using our interconnection resource.
Hypercube algorithms for neural network simulation: the Crystal_Accumulator and the Crystal Router
Authors: G. C. Fox, W. Furmanski
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

We discuss communication algorithms relevant for neural network modeling on distributed memory concurrent computers with a hypercube topology. Full, intermediate (medium range) and sparse network connectivities are analyzed. We point out that the flexible hypercube topology allows for the efficient implementation of the broad class of network algorithms with variety of connectivity patterns. We find algorithms index, crystal_router, fold and crystal_ accumulator which are appropriate in different cases depending on the sparseness and regularity of the network interconnect. We show that there are natural analogies between biological communication paths and the interconnects of a distributed memory concurrent computer.
Model Construction and Shape Recognition from Occluding Contours
Authors: C. H. Chien, J. K. Aggarwal
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A technique is presented for recognizing a 3D object (a model in an image library) from a single 2D silhouette using information such as corners (points with high positive curvatures) and occluding contours, rather than straight line segments. The silhouette is assumed to be a parallel projection of the object. Each model is stored as a set of the principal quadtrees, from which the volume/surface octree of the model is generated. Feature points (i.e. corners) are extracted to guide the recognition process. Four-point correspondences between the 2D feature points of the observed object and 3D feature points of each model are hypothesized, and then verified by applying a variety of constraints to their associated viewing parameters. The result of the hypothesis and verification process is further validated by 2D contour matching. This approach allows for a method of handling both planar and curved objects in a uniform manner, and provides a solution to the recognition of multiple objects with occlusion as demonstrated by the experimental results.
Teaching load and the quality of education
Authors: S. L. Sanders
Venue: ACM SIGCSE Bulletin (1989)

This paper presents a summary of a daily log detailing my work as a Computer Science teacher with a load of 106 students in 4 different meeting sections and 3 different courses. This data, together with my experience of twelve years on the Computer Science faculty at SUNY-Geneseo suggest that teaching is no easy life. Indeed, it is necessary to work nights, weekends, and holidays to do an adequate job. Under such teaching loads, there is no time for family without taking time away from preparation, grading, and individual student teaching. The same is true of committee work, research, publishing, and other important professional activity. It is suggested that such heavy teaching loads reduce the quality and quantity of educational services to students; a situation that is exacerbated when extra-classroom duties are required.
Acquisition of semantic patterns from a natural corpus of texts
Authors: P. Velardi, M. T. Pazienza, S. Magrini
Venue: Issue 108 (April 1989) (1989)

In this paper we present a methodology and a program, PETRARCA, for the extensive acquisition of a case based semantic dictionary. The major limitation of existing NLP systems is a poor encoding of semantic knowledge; on the other side, it is unrealistic to assume a manual codification of word senses, including idiomatic expressions and metaphors.The system presented in this paper analyzes a large sample of sentences including a given word, and produces for that word one or more entries in the semantic dictionary (one entry for each word sense). Sentences are provided by an on-line corpus of press agency releases on finance and economics.In PETRARCA, a target word sense definition is represented by a detailed list of use-types, called surface semantic patterns (SSPs). SSPs mirror the way humans most naturally explain a new word sense; in fact, people tend to give associations related to words rather than to provide conceptual categories.To derive these associations, the system uses a high-coverage morphosyntactic analyzer, a catalogue of phrasal-patterns/semantic-interpretation pairs, and a set of selectional restriction rules on semantic interpretation types.This paper claims that surface semantics is a reasonable descriptive framework to build a working computer program for language processing. It is general, and makes it possible to establish in a systematic way the rules of semantic encoding. We believe this being a useful contribution towards a more complete system of language learning.
Reasoning about knowledge and time in asynchronous systems
Authors: Joseph Halpern, Vardi
Venue: Proceedings of the twentieth annual ACM symposium on Theory of computing (1988)

We investigate the complexity of reasoning about knowledge and time, with emphasis on the case of asynchronous time. We show that in the case of no forgetting (Ladner and Reif's Tree Logic of Protocols, TLP) the validity problem is complete for nonelementary time. This settles the open problem of [HV86, LR86]. This result is somewhat surprising in light of Ladner and Reif's undecidability result for a similar logic, LLP. We show that the undecidability result for LLP is caused by two quite natural properties of models in that logic, which we call no learning and unique initial state. Both of these properties are necessary for the undecidability result in [LR86]. We completely characterize the complexity of all ninety-six logics that result by varying the relevant parameters. Many of the results are quite delicate, and require substantially new techniques.
Fast algorithm for calculation of Dirac's gamma-matrices traces
Authors: V. A. Ilyin, A. P. Kryukov, A. Y. Rodioniov, A. Y. Taranov
Venue: ACM SIGSAM Bulletin (1989)

This paper describes a fast algorithm for calculation of traces of Dirac's gamma-matrices proposed by Kennedy and Cvitanovich. Comparison with standard REDUCE calculations shows that Kennedy-Cvitanovich algorithm is preferable when space-time dimension exceeds 4.
A comparison of several methods of integrating stiff ordinary differential equations on parallel computing architectures
Authors: A. Bose, I. Nelken, J. Gelfand
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2 (1989)

Many physical systems lead to initial value problems where the system of stiff ordinary differential equations is loosely coupled. Thus, in some cases the variables may be directly mapped onto sparsely connected parallel architectures such as the hypercube. This paper investigates various methods of implementing Gear's algorithm on parallel computers. Two conventional corrector methods utilize either functional or Newton Raphson iteration. We consider both alternatives and show that they exhibit similar speedups on an n node hypercube. In addition a polynomial corrector is investigated. It has the advantage of not having to solve a linear system as in the Newton Raphson method, yet it converges faster than functional iteration.
Forward semantic: a compiler-assisted instruction fetch method for heavily pipelined processors
Authors: P.-H. Chang, W.-M. W. Hwu
Venue: Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture (1989)

A new instruction fetch method, forward semantic, is offered to enable the deeply pipelined processors to fetch one useful instruction every cycle. Forward semantic is an improved alternative to the delayed branching (with or without squashing), with five major advantages. Fist, no restriction is imposed on the type of instructions filling the branch slots, which allows a large number of slots to be filled. Second, no modification to the offsets and displacements is necessary when an instruction is copied to fill a branch slot, which simplifies the linker implementation. Third, an interrupted program can resume execution with a single program counter, eliminating the need for reloading the instruction pipeline before resuming execution. Fourth, programs compiled with N slots can execute on pipelines requiring K (K &le; N) slots, which makes family architecture compatibility possible . Lastly, the filling of branch slots is totally transparent to code compaction and software interlocking schemes. These advantages combine to provide an efficient instruction fetch mechanism and to eliminate artificial penalties on branch cost. At the cost of 11% static code expansion, forward semantic achieves an instruction fetch cost of 1.2 cycles for pipelines requiring 10 slots for each taken branch. This level of instruction fetch efficiency has never been achieved before with conventional instruction fetch methods. The branch cost is dictated by the accuracy of the compile-time branch prediction rather than artificial limitations, such as data dependencies, which prevent the slots from being filled. These results are measured from the execution of real UNIX and CAD programs with complex control structures.
GTEX&mdash;A group technology expert system
Authors: Luca Bonani, Paolo Calvo, Giovanni Contri
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

In this paper we describe GTEX, an expert system that solves the problem of modifying the production plant layout, from job-shop to cells layout in the medium and short term, using Group Technology criteria. We also describe and discuss the development methodologies and the A.I. technology impact on the problem solution. Though the Group Technology problem has been deeply investigated in the past years, this project represents a new approach to it in that the solution is achieved by introducing hypothetical reasoning, heuristic criteria integrated with simple algorithms and interaction with the user. At present a first release of the system is under test against real production data supplied by a manufacturing company.
Hierarchical Construction of Orientation and Velocity Selective Filters
Authors: D. J. Fleet, A. D. Jepson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

As a step towards the early measurement of visual primitives, the authors outline design criteria for the extraction of orientation and velocity information, and present a variety of tools useful in the construction of simple linear filters. A hierarchical parallel-processing scheme is used in which nodes compute a weighted sum of inputs from within a small spatio-temporal neighborhood. The resulting scheme is easily analyzed and provides mechanisms sensitive to narrow ranges of both image velocity and orientation. The hierarchical approach in combination with separability in the first levels yields an efficient implementation.
Can networks make an organization?
Authors: Tamar Bermann, Kari Thoresen
Venue: Proceedings of the 1988 ACM conference on Computer-supported cooperative work (1988)

Based on earlier work in Scandinavia, systems development is seen as both reflecting and shaping organizations. An ongoing action-research project at a large municipal hospital in Norway is taken as an example. This is a cooperative project in which nursing supervisors and researchers participate in shaping a learning process and designing a computer system. Some inherent contradictions, conflicts and challenges are indicated. Strengthening cooperation among themselves was the main reason for the nurses to embark on the project. It may be assumed that neither good intentions, nor the most advanced technology for cooperative work will necessarily result in a product which enhances cooperation and mutual support.
Rhetoric and human-computer interaction: investigations into the writing of user-centered documentation
Authors: R. Johnson
Venue: Proceedings of the 7th annual international conference on Systems documentation (1989)

This paper investigates the need for a user-centered theory of writing documentation. User-centered approaches present new challenges for writers, and it is argued that rhetoric and human-computer interaction are the most appropriate fields for developing a theory to meet those challenges. In addition, applications of the theory are proposed to aid writers in solving common documentation problems. &ldquo;They perfect nature, and are perfected by experience.&rdquo; (Francis Bacon. Of Studies, 1625) In Beckett's &ldquo;Waiting for Godot,&rdquo; two men spend the entire play waiting for something that never happens. They converse until the end and then depart, having never met up with Godot. Many critics have argued that Beckett's play is a symbol for the despair of twentieth century man: he lives in a world where meaning is always being sought, but can never be found. Another interpretation of this play, however, is that modern man is always waiting - simply waiting for something to happen. It is with this second theme that I would like to draw an analogy to the writing of computer documentation. We, the writers and teachers of computer documentation, are waiting for coherent guidelines which will aid us in our design tasks. We are not at the point of despair (far from that, we are at a point of grasping unprecedented power in our profession), but we, too, are waiting for something to happen. The purpose of this present investigation is to argue that the period of waiting is nearing an end, but that we must seize the moment in a conscious, thoughtful, and open-minded manner for any advances to be fruitful. Too often a field will launch into new applications with tremendous intensity, but because it is done with little reflection as to purpose, the results are smothered by the heat. In addition, because the movement is so quick, there is not time to consider alternative or novel solutions. With these cautions in mind, I propose in the following discussion to investigate how we might move toward a theory of user-centered documentation. To achieve this, we will look at two fields - rhetoric and human-computer interaction (HCI) - to see how they can help in the development of such a theory. To give a conceptual framework to this discussion, let us begin by turning to some of the problems that documentation writing theory faces.
Necessary and sufficient conditions for hyperplane transversals
Authors: R. Pollack, R. Wenger
Venue: Proceedings of the fifth annual symposium on Computational geometry (1989)

We will prove that a finite family B = {B1, B2, &hellip;, Bn} of connected compact sets in Rd has a hyperplane transversal if and only if for some k there exists a set of points P = {P1, P2, &hellip;, Pn} (i.e. a k-dimensional labeling of the family) which spans Rk and every k + 2 sets of B are met by a k-flat consistent with the order type of P. This is a common generalization of theorems of Hadwiger, Katchalski, Goodman-Pollack and Wenger.
A functional model of clocked microarchitectures
Authors: C. c. Charlton, D. Jackson, P. H. Leng
Venue: ACM SIGMICRO Newsletter (1989)

Models for the simulation of computer systems at the microarchitectural level are widely used to assist in design analysis and verification, and the development of microcode. The general model we describe here represents the behaviour of a clocked microarchitecture through the application of functions to component states and signal values. The operational semantics of the model are based partly on data flow and partly on graph reduction, allowing use to be made of the concept of 'lazy' evaluation to aid efficient simulation.
Finite-grain message passing concurrent computers
Authors: W. J. Dally
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

Fine-grain concurrent computers, by operating at a fine grain, increase the amount of concurrency that can be efficiently exploited in a given problem. Programming is simplified because programs may be partitioned into natural units of methods and objects and these objects are addressed uniformly whether they are local or remote. The construction of these machines poses challenging problems in reducing overhead, increasing communication bandwidth, and developing resource management techniques. This paper describes this class of machines, the challenges posed by their construction, and recent progress toward meeting these challenges.
A study of the applicability of hopfield decision neural nets to VLSI CAD
Authors: M. L. Yu
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

Hopfield decision neural nets have been claimed to be good for solving a class of optimization problems such as the traveling salesman's problem. A study was undertaken to determine if these techniques were applicable to the many optimization problems that occur in VLSI circuit design and layout. Module placement was chosen as a representative problem. It was observed that the convergence process closely resembles that of greedy hill climbing algorithms. Apart from the known problems of long simulation times and hardware implementation complexity, it was noted that the quality of solution was mediocre, at best, and highly sensitive to network parameters. Various modifications were attempted, none of which significantly improved the result. It is concluded that Hopfield neural nets do not, in their present form, provide an interesting solution to this class of CAD problems.