research-article

Free access

Dominance relations in computing systems

Author:

Daniel G. HaysAuthors Info & Claims

AFIPS '77: Proceedings of the June 13-16, 1977, national computer conference

Pages 475 - 480

https://doi.org/10.1145/1499402.1499486

Published: 13 June 1977 Publication History

PDF eReader

Abstract

This paper discusses various kinds of dominance relations that may hold among parts of computing systems, and between computers and people. That computers enter into "social relations" seems clear. Four models prevalent in thinking about computers are discussed: the Master-Slave, the Egalitarian Workgroup, the Division of Labor, and the Clamoring Children models. To help explicate the claim that "dominance" in a computing system may vary both in type and over time, steps towards a formal treatment of interacting devices are suggested, involving possible sequences of influenced behavior. Several varieties of dominance are then outlined, such as competition for resources, or attentional dominance for interrupts. Finally the matter of computer intentions is noted.

References

[1]

Kimbleton, S. R., and G. M. Schneider, "Computer Communications Networks: Approaches, Objectives, and Performance Considerations", Computing Surveys, 7, 3, September 1975, pp. 129--173.

Digital Library

Google Scholar

[2]

Blau, P. M. and W. R. Scott, Formal Organizations: A Comparative Approach, Chandler, San Francisco, 1962.

Google Scholar

[3]

Bernstein, I. E., "Primate Status Hierarchies", in L. A. Rosenblum (Ed.). Primate Behavior: Developments in Field and Laboratory Research, Vol. I. Academic Press, New York, 1970.

Google Scholar

[4]

Jacobs, T. O., Leadership and Exchange in Formal Organizations, HumRRO, Alexandria, Va., 1971.

Google Scholar

[5]

Matson, Wallace, Sentience, U. Calif. Press, Berkeley, 1975.

Google Scholar

[6]

Raphael, Bertram, The Thinking Computer, Freeman, San Francisco, 1976.

Google Scholar

[7]

Likert, Rensis, New Patterns of Management, McGraw-Hill, New York, 1961.

Google Scholar

[8]

Christie, Richard, and Maria Jahoda, (Eds.), Studies in the Scope and Method of "The Authoritarian Personality", Free Press, New York, 1954.

Google Scholar

[9]

Rotter, Julian B., "Generalized Expectancies for Internal Versus External Control of Reinforcement", Psychological Monographs, Whole No. 609, 80, 1966.

Google Scholar

Dominance relations in computing systems
1. Human-centered computing

Recommendations

Moral Dominance Relations for Program Comprehension

Dominance trees have been used as a means for reengineering legacy systems into potential reuse candidates. The dominance relation suggests the reuse candidates which are identified by strongly directly dominated subtrees. We review the approach and ...
Leximax relations in decision making through the dominance plausible rule
ECSQARU'11: Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty

In qualitative decision theory, a very natural way of defining preference relations ≥ over the policies (acts) is by using the so called Dominance Plausible Rule. To do that, we need a relation > over the consequences and a relation ⊇ over the events. ...
Rough relations, neighborhood relations, and granular computing
RSKT'11: Proceedings of the 6th international conference on Rough sets and knowledge technology

Based on formal relationships in Pansystems, this paper discusses the notion of indistinguishability relations among some order pairs in a binary relation and introduces rough relations. A rough relation is a generalization of a rough set from a new ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

AFIPS '77: Proceedings of the June 13-16, 1977, national computer conference

June 1977

1039 pages

ISBN:9781450379144

DOI:10.1145/1499402

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 1977

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
90
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)12

Reflects downloads up to 22 Feb 2025

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

Moral Dominance Relations for Program Comprehension

Leximax relations in decision making through the dominance plausible rule

Rough relations, neighborhood relations, and granular computing