ppxscal/embedding_network huggingface dataset:
Object engineering (abstract)
Authors: R. Stonewall Ballard
Venue: ACM SIGPLAN OOPS Messenger (1993)

Object Engineering R. Stonewall Ballard, Component Software Corporation Converting an object-oriented design into class definitions in an object-oriented language often requires many engineering decisions. It is easy to make these decisions incorrectly for languages that give the programmer a lot of control over data representation, such as C++. This tutorial covers low-level issues in building extensible and evolvable programs, issues that are important if you want to build well-balanced abstractions. It describes how to use multiple inheritance properly in spite of the compiler, when to use forwarding instead of inheritance, how to encapsulate state, and when to use references instead of copying objects. This tutorial teaches how to convert object-oriented designs into code that is easy to extend and reuse. Many of the issues are more interesting to C++ programmers than Smalltalk programmers, and C++ is the language used for examples, but most of the issues are language independent.
An automatic selection method of key search algorithms based on expert knowledge bases
Authors: Ki-hong Park, Jun-ichi Aoe, Masami Shishibori, Hisatoshi Arita
Venue: ACM SIGIR Forum (1994)

This paper proposes an automatic selection method for key search algorithms. The methodology has been implemented in a system called KEALASE (KEy-search Algorithm SElection). Key search algorithms are selected according to the user's requirements through interaction with KEALSE which bases its inferences on an evaluation table. The evaluation table contains values rating the performance of each key search algorithm for the different searching properties. The proposed selection algorithm is based on a step by step reduction of key search algorithms and searching properties. The paper also proposes assistance facilities that consist of both a support function and a program synthesis function. Experimental results show that the appropriate key search algorithms are effectively selected, and that the necessary number of questions asked, to select the appropriate algorithm, is reduced to less than half of the total number of possible questions. The support function is useful for the user during the selection process, and the program synthesis function fully translates a selected key search algorithm into high level language in an average of less than 1 hour.
The technical committee for human interface (SICE-Japan)&mdash;an introduction
Authors: Masaaki Kurosu
Venue: ACM SIGCHI Bulletin (1993)

In Japan, several of the academic associations are supporting research activity on the human interface from various approaches (e.g., information processing, cognitive science, artificial intelligence, human factors, etc.). Among them, the Technical Committee (TC) for Human Interface of the Society of Instrument and Control Engineers (SICE) is a representative one in the size of its membership and the variety of the activities.
Experiences with the partitions model
Authors: Brian Dobbing
Venue: ACM SIGAda Ada Letters (1993)

Alsys has implemented a distributed Ada system known as AdaMap which is based on a program partitioning model almost identical to that being proposed for Ada9X, although the user interface for the inter-partition communications system is based on an input-output package rather than on remote procedure call. This paper examines the benefits of the partitions model including a simple demonstration program built using AdaMap, and is intended to give confidene in the viability of the partitions model for Ada9X.
Analyzing refinements of state based specifications: the case of TB nets
Authors: Miguel Felder, Carlo Ghezzi, Mauro Pezzè
Venue: Proceedings of the 1993 ACM SIGSOFT international symposium on Software testing and analysis (1993)

We describe how formal specifications given in terms of a high-level timed Petri net formalism (TB nets) can be analyzed to check the temporal properties of bounded invariance (the systems stays in a given state until time &tgr;) and bounded response (the system will enter a given state within time &tgr;). In particular, we concentrate on specifications given in a hierarchical, top-down manner, where one specification level refines a more abstract level. Our goal is to define the conditions under which the properties that are proven to hold at a given abstraction level are preserved at the next refined level. To do so, we define the concept of correct refinement, and we show that bounded invariance and bounded response are preserved by a correct refinement. We also provide a set of constructive rules that may be applied to refine a net in such a way that the resulting net is a correct refinement.
Original Contribution: Strongly diluted networks with selfinteraction
Authors: Harald Englisch, Yegao Xiao, Kailun Yao
Venue: Neural Networks (1993)

The retrieval quality for the strongly diluted network with selfinteraction is calculated rigorously for any time step and arbitrary distribution of the stabilities. For the network with a delta and a Gaussian distribution of the stabilities, respectively, the optimal strength of the selfinteraction for one time step is given by an explicit expression. Different definitions for the critical storage capacity of the net with constant stabilities are analyzed. According to the most usual definition, the net with optimal selfinteraction has an infinite storage capacity. The approximated optimal retrieval quality found by neglection of correlations is larger than the exact optimal retrieval quality.
Human performance using computer input devices in the preferred and non-preferred hands
Authors: Paul Kabbash, I. Scott MacKenzie, William Buxton
Venue: Proceedings of the INTERACT '93 and CHI '93 conference on Human factors in computing systems (1993)

Subjects' performance was compared in pointing and dragging tasks using the preferred and non-preferred hands. Tasks were tested using three different input devices: a mouse, a trackball, and a tablet-with-stylus. The trackball had the least degradation across hands in performing the tasks, however it remained inferior to both the mouse and stylus. For small distances and small targets, the preferred hand was superior. However, for larger targets and larger distances, both hands performed about the same. The experiment shows that the non-preferred hand is more than a poor approximation of the preferred hand. The hands are complementary, each having its own strength and weakness. One design implication is that the non-preferred hand is well suited for tasks that do not require precise action, such as scrolling.
Teamwork between non-equals: check-in check-out model for producing documents in a hierarchy
Authors: Hinrich E. G. Bonin
Venue: ACM SIGOIS Bulletin (1992)

When a hierarchical organization (e.g. an office of public administration) produces a document, several office workers will be involved. This paper presents a proposal for supporting teamwork between those people of different interests, expertise and competence on different hierarchical levels (teamwork between non-equals).For that purpose it combines a revision control system (check-in amp; check-out model) with an electronic mail system (transportation of circulation folders) to provide a useful environment for computer supported collaboration within the framework of 'hierarchies of directives', i.e. an organization in which the flow of orders is more or less rigid. The approach supervises the evolution of the document, handles a 'family' of text contributions with competing modifications and protects the individual work phase. A prototype we have implemented uses the Unix tools rcs and mail.
Fast phylogenetic analysis on a massively parallel machine
Authors: Hideo Matsuda, Gary J. Olsen, Ross Overbeek, Yukio Kaneda
Venue: Proceedings of the 8th international conference on Supercomputing (1994)

We developed a parallel processing system for analyzing phylogenetic relationships of microorganisms based on a maximum likelihood method. Methods for inferring relationships from molecular sequence data are especially valuable, given the enormous increases in DNA sequence data. The maximum likelihood method uses concrete models of the evolutionary process and are well-motivated statistically, but the computational cost has hindered the use of this method for inferring trees with more than about 20 organisms. We parallelized the maximum likelihood method by utilizing two types of parallelism, parallel evaluation of phylogenetic trees and parallel computation of likelihood values. By combining these two parallelisms, we obtained significant speedup on the Intel Touchstone DELTA.
A library of high level control operators
Authors: Christian Queinnec
Venue: ACM SIGPLAN Lisp Pointers (1993)

Numerous high-level control operators, with various properties, exist in the literature. To understand or compare them is difficult since their definitions use quite different theoretical frameworks; moreover, to our knowledge, no implementation offers them all. This paper tries to explain control operators by the often simple stack manipulation they perform. We therefore present what we think these operators are, in an executable framework derived from abstract continuations. This library is published in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. For instance, we do not claim our implementation to be faithful nor we attempt to formally derive these implementations from their original definitions. The goal is to give a flavor of what control operators are, from an implementation point of view. Last but worth to say, all errors are mine.
Template-driven interfaces for numerical subroutines
Authors: Jon L. Bentley, Mary F. Fernandez, Brian W. Kernighan, Norman L. Schryer
Venue: ACM Transactions on Mathematical Software (TOMS) (1993)

This paper describes a set of interfaces for numerical subroutines. Typing a short (often one-line) description allows one to solve problems in application domains including least-squares data fitting, differential equations, minimization, root finding, and integration. Our approach of &ldquo;template-driven programming&rdquo; makes it easy to build such an interface: a simple one takes a few hours to construct, while a few days suffice to build the most complex program we describe.
Extended commitment ordering, or guaranteeing global serializability by applying commitment order selectively to global transactions
Authors: Yoav Raz
Venue: Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1993)

The Extended Commitment Ordering (ECO) property of transaction histories (schedules) generalizes the Commitment Ordering (CO) property defined in [Raz 90]. In a multi resource manager (RM) environment ECO guarantees global serializability when supported locally by each RM that participates in global transactions (i.e., transactions that span more than a single RM) and provides local serializability (by any mechanism). ECO assumes that a RM has the knowledge to distinguish local transactions (i.e., transactions confined to that RM) from global transactions. ECO imposes an order condition, similar to the CO condition, on the commit events of global transactions only, and thus, it is less constraining than CO. Like CO, ECO provides a fully distributed solution to the long standing problem of guaranteeing global serializability across RMs with different concurrency control mechanisms. Also, like CO, no communication beyond atomic commitment (AC) protocol messages is required to enforce ECO. When RMs are provided with the information about transactions being local, and are coordinated solely via AC protocols (have the extended knowledge autonomy property), ECO, applied locally together with local serializability in each RM involved with global transactions, is a necessary condition for guaranteeing global serializability. ECO reduces to CO when all the transactions are assumed to be global (e.g. if no knowledge about the transactions being local is available).
The representation of a program in the Blum-Shub-Smale theory of computation over an arbitrary ring
Authors: Hu Xiao-Long
Venue: ACM SIGACT News (1993)

In the paper "On a Theory of Computation and Complexity over the Real Numbers: NP Completeness, Recursive Functions and Universal machines" (BSS 1989), the authors, Lenore Blum, Mike Shub, and Steve Smale, generalize the notion of computability from the set of natural numbers to an arbitrary ordered ring. In particular they discuss the existence of a Universal Machine over such a ring and the "godel" number or "code" of machines defined on such a ring. In this short paper we wish to correct some minor error in their definition of a "code" of a machine.
Superconcentrators of depths 2 and 3; odd levels help (rarely)
Authors: Noga Alon, Pavel Pudlak
Venue: Journal of Computer and System Sciences (1994)

It is shown that the minimum possible number of edges in an n-superconcentrator of depth 3 is @Q(n log log n), whereas the minimum possible number of edges in an n-superconcentrator of depth 2 is @W(n(log n)^3^/^2) (and is O(n(log n)^2)).
Circle packing representation in the plane and other surfaces
Authors: Bojan Mohar
Venue: ACM SIGACT News (1993)

The angular resolution of a drawing of graph G is the minimum angle between two incident edges that appears in the drawing. In this talk the state of the art is presented how to maximize the angular resolution. First the general technique by Formann et al. [FOCS'90] is reviewed, then a refinement for planar graphs is given. A recent paper of Malitz/Papakostas [STOC'92] shows that planar graphs can be drawn planar with minimum angle only depending on the maximum degree of the vertices. At the end, some aspect on the relationship of resolution and area are discussed.
Processor allocation policies for message-passing parallel computers
Authors: Cathy McCann, John Zahorjan
Venue: ACM SIGMETRICS Performance Evaluation Review (1994)

When multiple jobs compete for processing resources on a parallel computer, the operating system kernel's processor allocation policy determines how many and which processors to allocate to each. In this paper we investigate the issues involved in constructing a processor allocation policy for large scale, message-passing parallel computers supporting a scientific workload. We make four specific contributions: We define the concept of efficiency preservation as a characteristic of processor allocation policies. Efficiency preservation is the degree to which the decisions of the processor allocator degrade the processor efficiencies experienced by individual applications relative to their efficiencies when run alone. We identify the interplay between the kernel processor allocation policy and the application load distribution policy as a determinant of efficiency preservation. We specify the details of two families of processor allocation policies, called Equipartition and Folding. Within each family, different member policies cover a range of efficiency preservation values, from very high to very low. By comparing policies within each family as well as between families, we show that high efficiency preservation is essential to good performance, and that efficiency preservation is a more dominant factor in obtaining good performance than is equality of resource allocation.
Variable coupling of agents to their environment (abstract): combining situated and symbolic automata
Authors: George Kiss
Venue: ACM SIGOIS Bulletin (1992)

The paper identifies generality and power (processing work per unit time) as two major but conflicting requirements for the design of autonomous intelligent agents. A separation of these two concerns leads to the notion of a variable degree of causal coupling between parts of a mechanism and its environment in terms of space and time. An implementation strategy for variable coupling can be a layered architecture, where higher layers support generality and lower layers support power. The consequences of these distinctions for the choice of representations and processing strategies is discussed and illustrated. Some speculations are offered about the need for an agent self subsystem in the architecture in order to support mechanisms for full intentionality.
Parallel computing using idle workstations
Authors: Jiubin Ju, Gaochao Xu, Jie Tao
Venue: ACM SIGOPS Operating Systems Review (1993)

Enormous aggregate computing capacity in distributed computing systems composed of workstations connected by high speed local area networks may exceed that supercomputers often have. The Sidle (for Sharing Idle Workstatinos), a system for scheduling idle workstations and remote executing which is currently running on 19 SUN4 workstations connected by an Ethernet is presented in this paper. Sidle enables user's many programs or sections of a program to be executed parallelly on many idle workstations. Sidle has many features compared with existing systems: It allows more than one job to be run on an idle workstation and nested remote executing, makes use of CPU utilization much better, with more higher transparency to the users and better performance.
Using statistical testing in the evaluation of retrieval experiments
Authors: David Hull
Venue: Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval (1993)

The standard strategies for evaluation based on precision and recall are examined and their relative advantages and disadvantages are discussed. In particular, it is suggested that relevance feedback be evaluated from the perspective of the user. A number of different statistical tests are described for determining if differences in performance between retrieval methods are significant. These tests have often been ignored in the past because most are based on an assumption of normality which is not strictly valid for the standard performance measures. However, one can test this assumption using simple diagnostic plots, and if it is a poor approximation, there are a number of non-parametric alternatives.
Single versus multiple inheritance in object oriented programming
Authors: Ghan Bir Singh
Venue: ACM SIGPLAN OOPS Messenger (1994)

Inheritance is one of the key elements of Object oriented programming. Inheritance is characterized as single or multiple depending on the number of classes a class can inherit from. Single inheritance is simple but restrictive. Multiple inheritance on the other hand is complex but allows a more natural definition of relationships between classes. There has been a significant amount of discussion on the value of multiple inheritance over single inheritance considering the complexity multiple inheritance adds. This paper reviews the two types of inheritance and examines their benefits. The paper then examines the issues and objections that have been raised on the two inheritance mechanisms. Graph, Linear, and Tree oriented implementations of multiple inheritance are reviewed to see how multiple inheritance issues are handled by various object oriented languages.
The facilitation role in group support systems environments
Authors: Victoria K. Clawson, Robert P. Bostrom
Venue: Proceedings of the 1993 conference on Computer personnel research (1993)

The introduction of group support systems (GSS) into organizations has created a new role -- the GSS facilitator. None of the research to date has defined the role of the facilitator in depth or has provided empirically grounded guidelines for effectively performing this role. This paper presents the results of a rigorous assessment of the role of the facilitator in computer-supported environments. The overall purpose of the study was to empirically develop the critical dimensions of the facilitator's role.
Inferential Theory of Learning as a Conceptual Basis for Multistrategy Learning
Authors: Ryszard S. Michalski
Venue: Machine Learning (1993)

In view of a great proliferation of machine learning methods and paradigms, there is a need for a general conceptual framework that would explain their interrelationships and provide a basis for their integration into multistrategy learning systems. This article presents initial results on the Inferential Theory of Learning that aims at developing such a framework, with the primary emphasis on explaining logical capabilities of learning systems, i.e., their competence. The theory views learning as a goal-oriented process of modifying the learner's knowledge by exploring the learner's experience. Such a process is described as a search through a knowledge space, conducted by applying knowledge transformation operators, called knowledge transmutations. Transmutations can be performed using any type of inference&mdash;deduction, induction, or analogy. Several fundamental pairs of transmutations are presented in a novel and very general way. These include generalization and specialization, explanation and prediction, abstraction and concretion, and similization and dissimilization. Generalization and specialization transmutations change the reference set of a description (the set of entities being described). Explanations and predictions derive additional knowledge about the reference set (explanatory or predictive). Abstractions and concretions change the level of detail in describing a reference set. Similizations and dissimilizations hypothesize knowledge about a reference set based on its similarity or dissimilarity with another reference set. The theory provides a basis for multistrategy task-adaptive learning (MTL), which is outlined and illustrated by an example. MTL dynamically adapts strategies to the learning task, defined by the input information, the learner's background knowledge, and the learning goal. It aims at synergistically integrating a wide range of inferential learning strategies, such as empirical and constructive inductive generalization, deductive generalization, abductive derivation, abstraction, similization, and others.
Response to "One-Bit Delay in Ring Networks" by R. Cohen
Authors: Ahmed E. Kamal, V. Carl Hamacher
Venue: IEEE Transactions on Computers (1993)

The authors respond to section III of the above-titled work, in which it is shown that their medium access control (MAC) protocol for rings cannot be implemented with minimum delay. They point out some differences in terminology and provide further clarification of their work.
Deja Vu
Authors: Amnon Katz
Venue: ACM SIGART Bulletin (1993)

The Turing Test was conceived by Alan Turing [1] as a device to encourage skeptics to seriously consider the question of a computer that might behave intelligently. I have always wondered if Turing intended the pun: a gedanken test for thought. From the perspective of computing at mid-century, it was a daring and imaginative device, but today, if you listen carefully, you might hear Turing's crow-like laugh wherever AI experts gather to defend its contemporary utility.