ppxscal/embedding_network huggingface dataset:
A method for asynchronous parallelization
Authors: P. R. Itzigehl
Venue: Proceedings of the 10th international conference on Software engineering (1988)

Asynchronous parallelization assists the utilization of parallel hardware by sequential software: A sequential program is decomposed into a program network according a given partition. Each generated program may run autonomous, dependencies are realized by communication statements. An algorithm is presented decomposing PASCAL programs and producing a Distributed-PASCAL program network. At last there is a description of an existing tool using the presented method, and an example will illustrate the method.
APL graphics for learning mathematics
Authors: M. Kikkawa
Venue: ACM SIGAPL APL Quote Quad (1987)

Since 1972, math-teachers at Shokei Jogakuin Senior High School have been using computers in their classes. In 1982, they changed from FORTRAN to APL, because APL had more possibilities for enriching math classes. At present, they are using APL Graphics to help students grasp abstract concepts in Mathematics. This paper discusses the use of APL Graphics in the classroom by both teachers and students, and the evaluation of its value in teaching.
An entity-life modeling approach to the design of concurrent software
Authors: Bo Sanden
Venue: Communications of the ACM (1989)

Using the idea of Entity-Life Modeling for task decomposition, the design of a prototypical elevator control system is explored and compared to an earlier JSD solution.
A Structured Approach for VLSI Circuit Design
Authors: J. Gu, K. F. Smith
Venue: Computer (1989)

The authors review the research done on a structured, symbol-based IC design method called path programmable logic (PPL). They explain the logic partitioning strategy on which PPL is based. Compared to full-custom design methods, the PPL methods permits an order of magnitude reduction in design time. In most cases, the density of the circuits designed using the PPL method approaches or surpasses that of the practical full-custom designs. Compared to semicustom design techniques such as standard cells and gate arrays, PPL reduces the design time by a factor of three while improving the densities by a factor of two to three.
Implementing a mainframe architecture in a 9370 processor
Authors: James Mitchell
Venue: ACM SIGMICRO Newsletter (1988)

This paper develops a high level view of the central electronics complex in the 9373 and 9375 systems, showing how the hardware and microcode elements combine to create a central processor as defined by the System/370 architecture. Within the context of this discussion, the logical subsystems described here will be defined as the working base architecture. The hardware implementation of the central processor will be examined in detail, both in terms of hardware subsystems, and as resources to be used by the various microprograms to provide the correct System/370 interface and function.
The evolution of user services
Authors: Richard B. Garret
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

In order to fully comprehend the evolution of User Services and peer into the future through our computing crystal ball, one must necessarily begin the journey with an exploration of our past achievements and then make a careful analysis of the trends for future computing requirements. The purpose of this paper is to trace the advancements of User Services from its infancy into the present and beyond. From its inception it quickly became apparent that the primary focus of User Services would be education and research. User Services quickly adapted to the rapidly evolving computer environments to provide the educational and research services that were required by the user community to make efficient use of the available computing resources. Serving a select few individuals within the faculty, staff, and student body community, User Services began its growth which would soon result in its expansion into every facet of the academic and administrative life as well as the surrounding communities of users. As we continue our exploration of the history of User Services, we can begin to understand the significance that the role of technological advances within the computing facilities played upon the expansion of services provided to the computing community. With the acquisition of more and more powerful computers came the realization of distributed computing. User Services extended support to not only larger numbers of faculty, staff, and students; but also groups not directly associated with the University. Soon this support would include a vast array of administrative functions as well. With the vast growth in the user community came the introduction of large numbers of users who required the computing power afforded by these technological giants, but who had little computer related expertise. User Services once again was on-hand to provide the needed support &mdash; consulting. Soon technological advances would introduce minicomputers and microcomputers into the computing facilities of the University. With the burgeoning computer facilities, came the need for the dissemination of information to the user community at large. User Services would once again expand its role to include publishing and documentation as a part of the services provided to the user community. Finally as microcomputers became more prevalent the need for networking of computer resources became more apparent. Along with the responsibility came the need for support of the following: equipment evaluation and acquisition, software evaluation and acquisition, and repair and maintenance of computer equipment. From the cursory examination of the past we are able to recognize that the future of User Services is driven by the technological advances in the computer industry and therefore the increased needs of the user community. User Services' role will continue to evolve to incorporate these changing needs into its area of responsibility.
The use of microcode instrumentation for development, debugging and tuning of operating system kernels
Authors: S. W. Melvin, Y. N. Patt
Venue: Proceedings of the 1988 ACM SIGMETRICS conference on Measurement and modeling of computer systems (1988)

We have developed a tool based on microcode modifications to a VAX 8600 which allows a wide variety of operating system measurements to be taken with minimal perturbation and without the need to modify any operating system software. A trace of interrupts, exceptions, system calls and context switches is generated as a side-effect to normal execution. In this paper we describe the tool we have developed and present some results we have gathered under both UNIX 4.3 BSD and VAX/VMS V4.5. We compare the process fork behavior of two different command shells under UNIX, look at context switch rates for interactive and batch workloads and generate a histogram for network interrupt service time.
Probabilistic computation and linear time
Authors: L. Fortnow, M. Sipser
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

In this paper, we give an oracle under which BPP is equal to probabilistic linear time, an unusual collapse of a complexity time hierarchy. In addition, we also give oracles where &Dgr;P2 is contained in probabilistic linear time and where BPP has linear sized circuits, as well as oracles for the negation of these questions. This indicates that these questions will not be solved by techniques that relativize. Finally, we note that probabilistic linear time can not contain both NP and BPP, implying that there are languages solvable by interactive proof systems that can not be solved in probabilistic linear time.
A graph-oriented mapping strategy for a hypercube
Authors: W-K. Chen, E. F. Gehringer
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

The mapping problem is the problem of implementing a computational task on a target architecture in order to maximize some performance metric. For a hypercube-interconnected multiprocessor, the mapping problem arises when the topology of a task graph is different from a hypercube. It is desirable to find a mapping of tasks to processors that minimizes average path length and hence interprocessor communication. The problem of finding an optimal mapping, however, has been proven to be NP-complete. Several different approaches have been taken to discover suitable mappings for a variety of target architectures. Since the mapping problem is NP-complete, approximation algorithms are used to find good mappings instead of optimal ones. Usually, greedy and/or local search algorithms are introduced to approximate the optimal solutions. This paper presents a greedy mapping algorithm for hypercube interconnection structures, which utilizes the graph-oriented mapping strategy to map a communication graph to a hypercube. The strategy is compared to previous strategies for attacking the mapping problem. A simulation is performed to estimate both the worst-case bounds for the greedy mapping strategy and the average performance.
Comments, on 'A Signed Bit-Sequential Multiplier' by T. Rhyne and N.R. Strader II
Authors: S. G. Smith
Venue: IEEE Transactions on Computers (1989)

With reference to the above mentioned paper, it is stated that the authors' introduction, in which they claim that the references all deal with algorithms for processing unsigned operands, is erroneous. One of their references most certainly does not deal with unsigned operands, as a two's complement number system is one of the module interfacing conventions germane to R. Lyon's (1981) methodology. Moreover, in the authors' conclusions they state that they 'have now extended bit-sequential multiplication to signed, two's complement binary operands', which may give the (doubtless unintended) impression that this has not been done before.
Learnability of CFLs: inferring syntactic models from constituent structure
Authors: L. F. Fass
Venue: Issue 108 (April 1989) (1989)

Inductive inference is a learning process based on discovering models for bodies of knowledge, given sample information. The inference process we discuss here is concerned with inductive acquisition of syntactic models for context-free languages (CFLs), given appropriate language samples. The knowledge to be modeled in this case is any CFL L, with the model to be determined a recognitive or generative characterization of L's syntactic structure. L will be learned syntactically once a machine M recognizing L, or a context-free grammar (CFG) G generating L, is inductively inferred from a sentence sample. The capability of distinguishing between L and its complement, or of generating all and only L's sentences, is the knowledge acquired, with the learner (inference process) gaining this knowledge by acquiring M or G. An observer (informant, teacher, or oracle) has such knowledge of L and can provide the learner with appropriate sample information to ensure that M or G is correctly identified.
A review of automated debugging systems: knowledge, strategies and techniques
Authors: M. Ducassé, A.-M. Emde
Venue: Proceedings of the 10th international conference on Software engineering (1988)

Our review is based on descriptions of 18 existing automated systems on program debugging and of a dozen cognitive studies on debugging. We propose a classification of debugging knowledge, and a description of the corresponding knowledge representation in the systems. Then we propose a classification of global debugging strategies used in the systems, and a description of the corresponding techniques. We assess the identified strategies from a real world program development point of view. The knowledge types we have identified are 1) knowledge of the intended program, 2) knowledge of the actual program, 3) understanding of the programming language, 4) general programming expertise, 5) knowledge of the application domain, 6) knowledge of bugs, 7) knowledge on debugging methods. The strategies we have identified are 1) filtering, 2) checking computational equivalence of intended program and actual one, 3) checking the well-formedness of actual program and 4) recognizing stereotyped errors.
The importance of individual differences in end-user training: The case for learning style
Authors: R. P. Bostrom, L. Olfman, M. K. Sein
Venue: Proceedings of the ACM SIGCPR conference on Management of information systems personnel (1988)

The importance of effective training in ensuring the success of End-User Computing (EUC) has been emphasized by several researchers in MIS. A vast amount of evidence from research in such related areas as educational psychology suggest that individual differences, such as a novice end user's learning style may effect his/her learning of a new EUC software. This paper reports the findings of a series of studies that examined the influence of a novice's learning style in learning of typical EUC tools such as spreadsheets and electronic mail. A consistent pattern of findings emerged that indicate that learning style is an important predictor of learning performance, both by itself and in interaction with training methods. The findings suggest that in the design of training, it is essential to match training methods to individual difference variables. Based on these findings, guidelines are suggested for IS professional involved in EUC training.
Precision Edge Contrast and Orientation Estimation
Authors: E. P. Lyvers, O. R. Mitchell
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

The contrast and orientation estimation accuracy of several edge operators that have been proposed in the literature is examined both for the noiseless case and in the presence of additive Gaussian noise. The test image is an ideal step edge that has been sampled with a square-aperture grid. The effects of subpixel translations and rotations of the edge on the performance of the operators are studied. It is shown that the effect of subpixel translations of an edge can generate more error than moderate noise levels. Methods with improved results are presented for Sobel angle estimates and the Nevatia-Babu operator, and theoretical noise performance evaluations are also provided. An edge operator based on two-dimensional spatial moments is presented. All methods are compared according to worst-case and RMS error in an ideal noiseless situation and RMS error under various noise levels.
Modeling class hierarchies with contradictions
Authors: A. Borgida
Venue: Proceedings of the 1988 ACM SIGMOD international conference on Management of data (1988)

One characteristic feature of object-oriented systems and knowledge bases (semantic data models, conceptual modeling languages, Al frames) is that they offer as a basic paradigm the notion of objects grouped into classes, which are themselves organized in subclass hierarchies. Through ideas such as inheritance and bounded polymorphism, this feature supports the technique of &ldquo;abstraction by generalization&rdquo;, which has been argued to be of importance in designing Information Systems [11, 2]. We provide in this paper examples demonstrating that in some applications over-generalization is likely to occur an occasional natural subclass may contradict in some way one if its superclass definitions, and thus turn out not to be a strict subtype of this superclass. A similar problem arises when an object is allowed to be a member of several classes which make incompatible predictions about its type. We argue that none of the previous approaches suggested to deal with such situations is entirely satisfactory. A language feature is therefore presented to permit class definitions which contradict aspects of other classes, such as superclasses, in an object-based language. In essence, the approach requires contradictions among class definitions to be explicitly acknowledged. We define a semantics of the resulting language, which restores the condition that subclasses are both subsets and subtypes, and deals correctly with the case when an object can belong to several classes. This is done by separating the notions of &ldquo;class&rdquo; and &ldquo;type&rdquo;, and it allows query compilers to detect type errors as well as eliminate some run-time checks in queries, even in the presence of &ldquo;contradictory&rdquo; class definitions.
On the complexity of radio communication
Authors: N. Alon, A. Bar-Noy, N. Linial, D. Peleg
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

A radio network is a synchronous network of processors that communicate by transmitting messages to their neighbors. A processor receives a message in a given step if and only if it is silent then and precisely one of its neighbors transmits. This stringent rule poses serious difficulties in performing even the simplest tasks. This is true even under the overly optimistic assumptions of centralized coordination and complete knowledge of the network topology. This paper is concerned with lower and upper bounds for the complexity of realizing various communication primitives for radio networks. Our first result deals with the broadcast operation. We prove the existence of a family of radius-2 networks on n vertices for which any broadcast schedule requires at least &OHgr;(log2 n) rounds of transmissions. This matches an upper bound of O(log2 n) rounds for networks of radius 2 proved earlier by Bar-Yehuda, Goldreich and Itai [BGI]. It is worth mentioning that this lower bound holds even under optimal centralized coordination, while the (randomized) algorithm of [BGI] is distributed. We then look at the question of simulating two of the standard message-passing models on a radio network. Both models can easily simulate the radio model with no overhead. In the other direction, we propose and study a primitive called the single-round simulation (SRS), enabling the simulation of a single round of an algorithm designed for the standard message models. We give lower bounds for the length of SRS schedules for both models, and supply constructions or existence proofs for schedules of matching (or almost matching) lengths. Finally we give tight bounds for the length of schedules for computing census functions on a radio network.
Communication-sensitive heuristics and algorithms for mapping compilers
Authors: Bernd Stramm, Francine Berman
Venue: Proceedings of the ACM/SIGPLAN conference on Parallel programming: experience with applications, languages and systems (1988)

The mapping problem arises when parallel algorithms are implemented on parallel machines. When the number of processes exceeds the number of available processing elements, the mapping problem includes the contraction problem. In this paper, we identify communication-sensitive heuristics which promote good contractions for graph-based parallel algorithms on non-shared memory multiprocessors. We present algorithms which utilize these heuristics and discuss their performance on a group of diverse benchmarks.
Alternative modeling perspectives: finding the creative spark
Authors: J. O. Henriksen
Venue: Proceedings of the 21st conference on Winter simulation (1989)

This paper is a teaching piece. It is the latest of a series of papers by the author on the general subjects of modeling and problem solving (see Henriksen 1981, Henriksen 1986, Henriksen 1987, and Henriksen 1988). For the fourth year in a row, Dr. Alan Pritsker is also presenting a paper in a very similar vein (see Pritsker 1986, Pritsker 1987, Pritsker 1988, and Pritsker 1989). This paper examines nine tradeoffs which should be considered in developing or applying approaches to modeling. To illustrate these tradeoffs, this paper revisits a number of the examples used in previous papers and introduces some new examples.
Exact real computer arithmetic with continued fractions
Authors: Jean Vuillemin
Venue: Proceedings of the 1988 ACM conference on LISP and functional programming (1988)

We introduce a representation of the computable real numbers by continued fractions. This deals with the subtle points of undecidable comparison an integer division, as well as representing the infinite 1/0 and undefined 0/0 numbers. Two general algorithms for performing arithmetic operations are introduced. The algebraic algorithm, which computes sums and products of continued fractions as a special case, basically operates in a positional manner, producing one term of output for each term of input. The transcendental algorithm uses a general formula of Gauss to compute the continued fractions of exponentials, logarithms, trigonometric functions, as well as a wide class of special functions. A prototype system has been implemented in LeLisp, and the performance of these algorithms is promising.
INQUEST: A prototype intelligence tool
Authors: David Hillman
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

Military intelligence analysis is the process of sifting and sorting information to identify, isolate, and interpret significant items of interest. It is based on an intelligence analyst's judgment and knowledge in a number of areas including military operations, organizations, military equipment and weapons, geography, politics, economics, sociology, and history. There are a number of areas in which intelligence analysis is performed, one area is the retrieval of database information in order to analyze a situation or event. The analysis of data from intelligence databases is based on the pertinence, reliability, and accuracy of both the query and retrieved data. Pertinence indicates the importance of retrieved data to a particular problem and its use to support a hypothesis or to perform an assessment. Reliability is the faith in the source of retrieved data and is based on the potential for corroboratation of that data. The accuracy of retrieved data is important because of the conclusions that may be drawn from the analysis of the original data. These three factors: pertinence, reliability, and accuracy, are important because they directly influence the validity of data analysis. The intelligence data analysis process consists of interpretation of data based upon correlation of information to a situation or problem. This information is organized as: who, what, where, and when. &ldquo;Who&rdquo; is someone or an organization, &ldquo;what&rdquo; is a piece of equipment, &ldquo;where&rdquo; is a location or place, and &ldquo;when&rdquo; is a date or time of an event. These four types of information can be extracted from a question or situation of interest to an intelligence analyst. From this information, specific queries can be developed in order to retrieve data from ???
Scannerless NSLR(1) parsing of programming languages
Authors: D. J. Salomon, G. V. Cormack
Venue: ACM SIGPLAN Notices (1989)

The disadvantages of traditional two-phase parsing (a scanner phase preprocessing input for a parser phase) are discussed. We present metalanguage enhancements for context-free grammars that allow the syntax of programming languages to be completely described in a single grammar. The enhancements consist of two new grammar rules, the exclusion rule, and the adjacency-restriction rule. We also present parser construction techniques for building parsers from these enhanced grammars, that eliminate the need for a scanner phase.