ppxscal/embedding_network huggingface dataset:
An overall structure of intelligent computer program in China
Authors: Q. Gao, H. Chen, K. Zhang, C. Wang
Venue: Proceedings of the 1987 Fall Joint Computer Conference on Exploring technology: today and tomorrow (1987)

This paper is a brief introduction to the structure of the development program of intelligent computer system in China, which mainly includes the following topics: (1) Basic theory of intelligent computer; (2) The architecture of intelligent computer system; (3) Intelligent computer interface; and (4) Software and supporting environment for intelligent computer systems. In the spring of 1987, the high technology development program was established in China. Seven priority research areas are included in this program: biotechnology, space technology, information technology, laser technology, automation technology, energy technology and advanced materials. Since China is at present not in a position to finance a comprehensive program, not even all branches within the seven areas, arrangements have been made on the basis of the country's actual capabilities and to give prominence to priorities. In the information technology area, emphasis will be focused on technologies promising significant breakthroughs and extensive application at the beginning of the next century: (1) Intelligent computer system; (2) Optoelectronic devices and microelectronic/optoelectronic system integration technology; and (3) Information acquisition and processing technology. In the Outline of the Hi-Tech Development Program, the aims of the development of the intelligent computer systems in China by the year 2000 can be described as: Efforts will be made to develop computers with intelligent hierarchical structure and knowledge/intelligence processing capability, and to introduce man-machine interface in natural languages and software automation technology. The application of artificial intelligence will be promoted to lay the foundation for the intelligent computer industry. For attainment of the aims mentioned above, an overall structure of the Intelligent Computer Program which includes four generic areas of research, i.e. basic theory of the intelligent computer, the architecture of the intelligent computer systems, the intelligent interfaces of the intelligent computer, and intelligent software and its supporting environment, has been enacted. In most cases, the achievement of those generic areas of research will support some very important application projects. The study and applications on intelligent computer systems should be closely linked with other projects in the High Technology Development Program (e.g. Automation Technology, etc.) and with plans of other research and industrial production. The structure of the development program of intelligent computer system in China can be shown as a pyramid (fig. 1), and explanation will be given briefly.
A Simulation Study of Decoupled Architecture Computers
Authors: James E. Smith, Shlomo Weiss, Nicholas Y. Pang
Venue: IEEE Transactions on Computers (1986)

Decoupled architectures achieve high scalar performance by cleanly splitting instruction processing into memory access and execution tasks. Several decoupled architectures have been proposed, and they all have two characteristics in common: 1) they have two separate sets of instructions, one for accessing memory and one for performing function execution. 2) The memory accessing task and the execution task communicate via architectural queues.
Throughput Analysis of Cache-Based Multiprocessors with Multiple Buses
Authors: M. Dubois
Venue: IEEE Transactions on Computers (1988)

The performance of cache-based multiprocessors for general-purpose computing and for multitasking is analyzed with simple throughput models. A private cache is associated with each processor, and multiple buses connect the processors to the shared, interleaved memory. Simple models based on dynamic instruction mix statistics are introduced to evaluate upper bounds on the throughput when independent tasks are run on each processor. With these models, one can obtain a first estimate of the MIPS (millions of instructions per second) rate of a multiprocessor.
Automatic Solder Joint Inspection
Authors: S. L. Bartlett, P. J. Besl, C. L. Cole, Ramesh Jain, D. Mukherjee
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1988)

The task of automating the visual inspection of pin-in-hole solder joints is addressed. Two approaches are explored: statistical pattern recognition and expert systems. An objective dimensionality-reduction method is used to enhance the performance of traditional statistical pattern recognition approaches by decorrelating feature data, generating feature weights, and reducing run-time computations. The expert system uses features in a manner more analogous to the visual clues that a human inspector would rely on for classification. Rules using these cues are developed, and a voting scheme is implemented to accumulate classification evidence incrementally. Both methods compared favorably with human inspector performance.
Programming in VS Fortran on the IBM 3090 for Maximum Vector Performance
Authors: Bowen Liu, Nelson Strother
Venue: Computer (1988)

Programming techniques necessary for high performance on the 3090 Vector Facilities are illustrated, showing that VS Fortran programs can achieve near-maximum execution rates. Relevant features of the 3090 architecture are reviewed, stressing the need to make efficient use of a hierarchical storage system and take advantage of the compound vector instructions. The key programming techniques for managing the storage hierarchy are loop sectioning, loop distribution, and data compaction. Vector register, cache reuse, and virtual memory, storage format, and page reuse are shown to lead to efficient use of the vector registers, the high speed cache, and the virtual memory system, respectively. The multiply-and-add compound instruction is discussed.
Automated temperature scanning for hyperthermia therapy
Authors: Mark J. Engler, Michael L. Gleicher
Venue: ACM SIGSMALL/PC Notes (1988)

Hyperthermia is a recently legitimized method for the treatment of cancer. Hyperthermia treatments consist of raising tumor temperatures above 42 deg;C. These temperatures are usually induced with electromagnetic or ultrasonic applicators. Hyperthermia has been found especially effective in conjunction with conventional radiotherapy. In comparison with other more established therapies, hyperthermia is in an early state of technological development.
WYSIWIS revised: early experiences with multiuser interfaces
Authors: M. Stefik, D. G. Bobrow, G. Foster, S. Lanning, D. Tatar
Venue: ACM Transactions on Information Systems (TOIS) (1987)

WYSIWIS (What You See Is What I See) is a foundational abstraction for multiuser interfaces that expresses many of the characteristics of a chalkboard in face-to-face meetings. In its strictest interpretation, it means that everyone can also see the same written information and also see where anyone else is pointing. In our attempts to build software support for collaboration in meetings, we have discovered that WYSIWIS is crucial, yet too inflexible when strictly enforced. This paper is about the design issues and choices that arose in our first generation of meeting tools based on WYSIWIS. Several examples of multiuser interfaces that start from this abstraction are presented. These tools illustrate that there are inherent conflicts between the needs of a group and the needs of individuals, since user interfaces compete for the same display space and meeting time. To help minimize the effect of these conflicts, constraints were relaxed along four key dimensions of WYSIWIS: display space, time of display, subgroup population, and congruence of view. Meeting tools must be designed to support the changing needs of information sharing during process transitions, as subgroups are formed and dissolved, as individuals shift their focus of activity, and as the group shifts from multiple parallel activities to a single focused activity and back again.
Ensuring Fault Tolerance of Phase-Locked Clocks
Authors: C. M. Krishna, Kang G. Shin, Ricky W. Butler
Venue: IEEE Transactions on Computers (1985)

Processors within a real-time multiprocessor system must be synchronized with as little overhead as possible. Although synchronization can be achieved via both software (e.g., interactive convergence and interactive consistency algorithms) and hardware (e.g., multistage synchronizers and phase-locked clocks), phase-locked clocks are most attractive due to their small overheads.
Planar NAE3SAT is in P
Authors: B. M. E. Moret
Venue: ACM SIGACT News (1988)

Lichtenstein proposed the use of a "planar" version of 3SAT as a departure point for proofs of NP -completeness that would at once prove the general graph problem as well as its restriction to planar graphs to be NP-complete. Dyer and Frieze later proved that Planar lin3SAT is also NP-complete. Of the three standard versions of 3SAT, only NAE3SAT remained open. We provide a very simple reduction from NAE3SAT to Simple MaxCut, which respects Lichtenstein's conditions; since it is known that the planar version of (Simple) MaxCut is in P, so is the planar version of NAE3SAT, thereby setting the question (if in a somewhat unexpected way).
Grosch's law re-revisited: CPU power and the cost of computation
Authors: Phillip Ein-Dor
Venue: Communications of the ACM (1985)

Does Grosch's law, which postulated that the costs of computer systems increase at a rate equivalent to the square root of their power, still hold? The age of mini-, micro-, and supercomputers seems to have complicated the situation. When computers are grouped according to their size and power, Grosch's law seems to hold within each group, but not between different groups.
A routine for converting regression algorithms into corresponding orthogonal regression algorithms
Authors: Larry Ammann, John Van Ness
Venue: ACM Transactions on Mathematical Software (TOMS) (1988)

The routine converts any standard regression algorithm (that calculates both the coefficients and residuals) into a corresponding orthogonal regression algorithm. Thus, a standard, or robust, or L1 regression algorithm is converted into the corresponding standard, or robust, or L1 orthogonal algorithm. Such orthogonal procedures are important for three basic reasons. First, they solve the classical errors-in-variables (EV) regression problem. Standard L2 orthogonal regression, obtained by converting ordinary least squares regression, is the maximum likelihood solution of the EV problem under Gaussian assumptions. However, this L2 solution is known to be unstable under even slight deviations from the model. Thus this routine's ability to create robust orthogonal regression algorithms from robust ordinary regression algorithms will also be very useful in practice. Second, orthogonal regression is intimately related to principal components procedures. Therefore, this routine can also be used to create corresponding L1, robust, etc., principal components algorithms. And third, orthogonal regression treats the x and y variables symmetrically. This is very important in many science and engineering modeling problems. Monte Carlo studies, which test the effectiveness of the routine under a variety of types of data, are given.
Microprogrammable processor for object-oriented architecture
Authors: T. Nojiri, S. Kawasaki, K. Sakoda
Venue: ACM SIGARCH Computer Architecture News (1986)

An advanced microprocessor has been developed for the high performance execution of object oriented language programs. In object oriented languages, improvement of frequent or complex operations such as dynamic type checking, procedure calls, and storage management, contributes toward the increase of overall performance. In order to improve their performance, the microprocessor adopts large on-chip register files, a large EPROM for microstore, and ingenious instruction dispatching and tag-handling mechanisms. By specially treating frequently accessed data, i.e., allocating activation records in register files, much of the data traffic can be effectively localized within the chip, and the complexity of procedure calls as well as the burden imposed on storage management can be alleviated. The tag-handling mechanisms efficiently perform dynamic type checking. As the result, the microprocessor, together with an efficient microprogram, executes object oriented language programs much faster than existing computers. Furthermore, it can efficiently execute other high-level languages by using corresponding microprograms, especially AI-languages.
Dynamic Configuration for Distributed Systems
Authors: Jeff Kramer, Jeff Magee
Venue: IEEE Transactions on Software Engineering (1985)

Dynamic system configuration is the ability to modify and extend a system while it is running. The facility is a requirement in large distributed systems where it may not be possible or economic to stop the entire system to allow modification to part of its hardware or software. It is also useful during production of the system to aid incremental integration of component parts, and during operation to aid system evolution. The paper introduces a model of the configuration process which permits dynamic incremental modification and extension. Using this model we determine the properties required by languages and their execution environments to support dynamic configuration. CONIC, the distributed system which has been developed at Imperial College with the specific objective of supporting dynamic configuration, is described to illustrate the feasibility of the model.
An efficient routing control for the SIGMA network Σ(4)
Authors: A. Seznec
Venue: ACM SIGARCH Computer Architecture News (1986)

When processing vectors on SIMD computers, the interconnection network may become the bottleneck for performances if it lacks an efficient routing control unit. In the pass, many multistage networks have been designed, but general algorithms to control them cannot be used at execution time : they are too time consuming. This has led many manufacturers to use crossbar networks in the design of SIMD computers. In [Se84a],[Se84b], we defined the Sigma network &Sgr;(n) and we gave realistic algorithms to control it for performing families of permutations covering standard needs in vector processing. Here, we expose the design of a very efficient control unit for the Sigma network &Sgr;(4) (16 entries, 16 exits).
Concurrency control for distributed real-time databases
Authors: Lui Sha, Ragunathan Rajkumar, John P. Lehooczky
Venue: ACM SIGMOD Record (1988)

The concurrency control of transactions in a real-time database must satisfy not only the consistency constraints of the database but also the timing constraints of individual transactions. In this paper, we present a real-time concurrency control protocol that can be used in a distributed and decomposable real-time database. The protocol is based on the integration of a modular concurrency control theory with a real-time scheduling protocol called the priority ceiling protocol. This protocol supports the replication of data objects and avoids the formation of deadlocks. Finally, an analysis of the performance of this protocol is presented.
Understanding the office: A social-analytic perspective
Authors: R. A. Hirschheim
Venue: ACM Transactions on Information Systems (TOIS) (1986)

In order to apply office automation in a meaningful fashion, it is apparent that some understanding of the office is necessary. Most descriptive studies of the office have placed great emphasis on manifest office actions, suggesting that offices are the embodiment of these actions. The meanings of these actions or tasks, however, have been given scant attention. There exist a number of office activity or task taxonomies, but they do little more than provide a simple and limited structure through which to conceive of an office. From a social-analytic perspective this appears to be overly simplistic and misses the richness of social action in an office. Focusing on the overt and manifest aspects of the office may very well lead to its misrepresentation. This paper takes a critical look at the way offices are conceived in the office automation literature and suggests alternatives that may provide a better understanding of the real functions of an office.
The implementation of Prolog via VAX 8600 microcode
Authors: J. Gee, S. W. Melvin, Y. N. Patt
Venue: Proceedings of the 19th annual workshop on Microprogramming (1986)

We have implemented a high performance Prolog engine by directly executing in microcode the constructs of Warren's Abstract Machine. The implementation vehicle is the VAX 8600 computer. The VAX 8600 is a general purpose processor containing 8K words of writable control store. In our system, each of the Warren Abstract Machine instructions is implemented as a VAX 8600 machine level instruction. Other Prolog built-ins are either implemented directly in microcode or executed by the general VAX instruction set. Initial results indicate that our system is the fastest implementation of Prolog on a commercially available general purpose processor.
Browsing within time-driven multimedia documents
Authors: Stavros Christodulakis, Stephen Graham
Venue: Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems (1988)

We present the software design and the interfaces of an interactive browser for time-driven multimedia objects. Time-driven multimedia objects may have as their main resource voice or animation sequences. Several important application environments such as training systems, home entertainment systems, do-it-yourself manuals may involve time-driven multimedia objects and they may be implemented with such browsing interfaces. Such applications may be implemented using easy to replicate optical disks such as CD-ROMs, and distributed to a large user community.
Communications standards review
Authors: Avi Schonbach
Venue: ACM SIGSMALL/PC Notes (1987)

This is the first in a series of reports which will survey activities in the area of communications standards. The increasingly strong influence of such standards on the computer industry is plainly manifested in the move from central to distributed computing. The main relevance of communications to small systems lies in the fact that they are necessary to both distributed processing and resource sharing. Small systems have limited resources locally; in an interlinked environment jobs which are too large for the local resources can be submitted for execution on other systems. As well, special servers can be shared by a large number of users, thereby reducing overall cost. Communications provide the user of a small system with access to remote information systems, and with support of networked interest groups through applications such as electronic mail and bulletin board.
Algorithmic specifications: a constructive specification method for abstract data types
Authors: Jacques Loeckx
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1987)

This paper presents a new specification method for abstract data types and a pertaining logic. The specification method proposed differs from the classical algebraic one by its constructive, yet abstract nature. Although it leads to a different style in specification, the method avoids some fundamental problems inherent in the algebraic specification method. The logic proposed is essentially a first-order logic for strict (partial) functions. It allows in particular the expression of the semantic conditions guaranteeing the consistency of a specification.
A standard for a graph representation for functional programs
Authors: Mike Joy, Tom Axford
Venue: ACM SIGPLAN Notices (1988)

The data structures used in the authors' functional language graph reduction implementations are described, together with a standard notation for representing the graphs in a textual format. The graphs employed are compatible with FLIC and with the functional languages in use at Birmingham and Warwick. The textual format is designed to be transmittable easily across networks.
Fault-Tolerant Multiprocessors with Redundant-Path Interconnection Networks
Authors: C. S. Raghavendra, Anujan Varma
Venue: IEEE Transactions on Computers (1986)

In this paper, we study fault-tolerant multiprocessor systems employing redundant-path multistage interconnection networks. Such systems permit interprocessor communication in the presence of faulty components in the network. The interconnection network considered is a delta network augmented with an extra switching stage in front. When the first and last stages are fault-free, the extra-stage delta networks continue to provide full access in the presence of all single and many multiple faults in switching elements of the intermediate stages. In this paper, we use graph-theoretic techniques to study the problem of routing permutations in extra-stage delta networks when faults are present in the network. We first formulate the problem of performing an arbitrary permutation on the fault-free network as a vertex-coloring problem and later extend this to networks with noncritical faults. Although the general problem of realizing a permutation in the minimum number of passes is intractable, classes of permutations with some regularity can be routed optimally. To illustrate the idea, we consider the class of BPC (bit permute-complement) permutations: algorithms for performing arbitrary permutations in this class on the extra-stage delta network are given, both for the fault-free network and for a network with noncritical faults.
Parallel speedup of sequential machines: a defense of parallel computation thesis
Authors: I Parberry
Venue: ACM SIGACT News (1986)

It is reasonable to expect parallel machines to be faster than sequential ones. But exactly how much faster do we expect them to be? Various authors have observed that an exponential speedup is possible if sufficiently many processors are available. One such author has claimed (erroneously) that this is a counterexample to the parallel computation thesis. We show that even more startling speedups are possible. In fact, if enough processors are used, any recursive function can be computed in constant time. Although such machines clearly do not obey the parallel computation thesis, we argue that they still provide evidence in favour of it. In contrast, we show that an arbitrary polynomial speedup of sequential machines is possible on a model which satisfies the parallel computation thesis. If, as widely conjectured, P #8840;POLYLOGSPACE, then there can be no exponential speedup on such a model.
Restricting logic grammars with government-binding theory
Authors: Edward P. Stabler
Venue: Computational Linguistics (1987)

A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes some of the constraints suggested by recent Chomskian linguistic theory. In spite of these restrictions, this formalism allows for relatively elegant characterizations of natural languages that can be translated into efficient prolog parsers.
Third normal form made easy
Authors: Betty Salzberg
Venue: ACM SIGMOD Record (1986)

Third normal form is defined in different inequivalent ways in elementary data base textbooks. The method given in many of these books for decomposing a file into third normal form is non-algorithmic, depends on human recognition of a pattern, and has severe limitations and unexplained complexities. This is not necessary. There is an excellent algorithmic method available which is easy to learn, and which can be programmed. The objective of this paper is to examine the differences concerning how third normal form is presented in various textbooks, and to present an easy way of introducing it to students. This article appeared previously in the June 1986 issue of SIGCSE BULLETIN.