A central problem in the study of autonomous cooperating systems is that of how to establish mechanisms for controlling the interactions between different parts (which are called agents) of the system. For heterogeneous agents this aims at, modeling the basics for their decisions. The mechanisms we discuss in this paper are based on the assumption that, the agents can estimate the effects of being attached to a certain set of goals. In the simplest case this is expressed by a single value e.g., the cost that will arise for the accomplishment of these goals. But in general this estimation may be arbitrarily complicated. In addition, we assume that, the agents have a function available to mnk their goals according to the estimated values and they pursue the goals they rank best. Then, these values can be used to resolve various kinds of conflicts in this kind of systems. For example in the task allocation phase the case of multiple applications for the allocation of a goal can be decided by allocating the goal to the agent with the ‘(best estimation”. Another way of using these values is for establishing collaborative actions between a pair (or a set) of agents: If one agent wants to get support in the accomplishment, of a particular goal he will try to persuade another agent to modify his ranking of the goal in such a way that, they both will rank best this “common” goal. Thus, the use of ranking functions provides a general framework for considering cooperative aspects within the study of multi-agent systems. An essential question in this context is how the rankings of different agents can be compared. Therefore, we develop in this paper a formalization of the concept, of ranking functions and discuss mechanisms that establish the comparability of different, rankings. *This work was supported by the German Ministry of Research and Technology under grant ITW9104 COOCS’93 -1 I1931CA, USA o 1993 ACM O-89791 -627 -1 19310010... $1 .50
自主协作系统研究的一个核心问题是如何建立机制来控制系统中不同部分(称为agent)之间的相互作用。对于异构代理，其目标是为其决策建模基础。我们在本文中讨论的机制是基于这样的假设，即代理可以估计依附于某一组目标的影响。在最简单的情况下，这可以用一个值来表示，例如，为实现这些目标而产生的成本。但一般来说，这种估计可能是任意复杂的。此外，我们假设agent有一个函数可以根据估计值来标记它们的目标，并且它们追求它们排名最好的目标。然后，这些值可以用来解决这类系统中的各种冲突。例如，在任务分配阶段，可以通过将目标分配给具有“最佳估计”的代理来决定多个应用程序分配目标的情况。使用这些值的另一种方法是在一对(或一组)智能体之间建立协作行为:如果一个智能体想要在完成特定目标时获得支持，他将试图说服另一个智能体修改他对目标的排名，这样他们都将在这个“共同”目标中排名最高。因此，排序函数的使用为考虑多智能体系统研究中的合作方面提供了一个通用框架。在这种情况下，一个重要的问题是如何比较不同代理的排名。因此，我们在本文中发展了排名函数概念的形式化，并讨论了建立不同排名的可比性的机制。*本工作由德国研究技术部资助，ITW9104 COOCS ' 93 -1 I1931CA, USA o 1993 ACM o -89791 -627 -1 19310010…1美元50
{"title":"Comparing rankings of heterogeneous agents","authors":"N. Kuhn","doi":"10.1145/168555.168556","DOIUrl":"https://doi.org/10.1145/168555.168556","url":null,"abstract":"A central problem in the study of autonomous cooperating systems is that of how to establish mechanisms for controlling the interactions between different parts (which are called agents) of the system. For heterogeneous agents this aims at, modeling the basics for their decisions. The mechanisms we discuss in this paper are based on the assumption that, the agents can estimate the effects of being attached to a certain set of goals. In the simplest case this is expressed by a single value e.g., the cost that will arise for the accomplishment of these goals. But in general this estimation may be arbitrarily complicated. In addition, we assume that, the agents have a function available to mnk their goals according to the estimated values and they pursue the goals they rank best. Then, these values can be used to resolve various kinds of conflicts in this kind of systems. For example in the task allocation phase the case of multiple applications for the allocation of a goal can be decided by allocating the goal to the agent with the ‘(best estimation”. Another way of using these values is for establishing collaborative actions between a pair (or a set) of agents: If one agent wants to get support in the accomplishment, of a particular goal he will try to persuade another agent to modify his ranking of the goal in such a way that, they both will rank best this “common” goal. Thus, the use of ranking functions provides a general framework for considering cooperative aspects within the study of multi-agent systems. An essential question in this context is how the rankings of different agents can be compared. Therefore, we develop in this paper a formalization of the concept, of ranking functions and discuss mechanisms that establish the comparability of different, rankings. *This work was supported by the German Ministry of Research and Technology under grant ITW9104 COOCS’93 -1 I1931CA, USA o 1993 ACM O-89791 -627 -1 19310010... $1 .50","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123692755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Development of documents in multiple media involves activities in three different fields, the technical, the discoursive and the procedural. The major development problems of artifact complexity, cognitive processes, design basis and working context are located where these fields overlap. Pending the emergence of a unified approach to design, any method must allow for development at the three levels of discourse structure, media disposition and composition, and presentation. Related work concerned with generalised discourse structures, structured documents, production methods for existing multiple media artifacts, and hypertext design offer some partial forms of assistance at different levels. Desirable characteristics of a multimedia design method will include three phases of production, a variety of possible actions with media elements, an underlying discoursive structure, and explicit comparates for review.
{"title":"Development of multiple media documents","authors":"Stephen J. Morris, Anthony Finkelstein","doi":"10.1145/168555.168563","DOIUrl":"https://doi.org/10.1145/168555.168563","url":null,"abstract":"Development of documents in multiple media involves activities in three different \u0000fields, the technical, the discoursive and the procedural. The major development problems of \u0000artifact complexity, cognitive processes, design basis and working context are located where these \u0000fields overlap. Pending the emergence of a unified approach to design, any method must allow for \u0000development at the three levels of discourse structure, media disposition and composition, and \u0000presentation. Related work concerned with generalised discourse structures, structured \u0000documents, production methods for existing multiple media artifacts, and hypertext design offer \u0000some partial forms of assistance at different levels. Desirable characteristics of a multimedia \u0000design method will include three phases of production, a variety of possible actions with media \u0000elements, an underlying discoursive structure, and explicit comparates for review.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122949334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Organizational development refers to the continual change which large, distributed organizations undergo. Described are some methods for organizational development. These methods include message elimination, regrouping, reclustering, regression, and reuse. Development occurs within a modeling system called Ubik. It is a concurrent object based system which supports a high level representation of an organization, The structure of an organization is modeled with collections of linked together objects. The action of an organization is carried out via message passing. Active messages are used to buitd a specialized object called a Tapeworm, which monitors and constrains organizational structure and action, The Tapeworms are used to identify the mismatch between the model and the external organization. They are also used to support the development methods.
{"title":"Methods for organizational development","authors":"P. Jong","doi":"10.1145/168555.168583","DOIUrl":"https://doi.org/10.1145/168555.168583","url":null,"abstract":"Organizational development refers to the continual change which large, distributed organizations undergo. Described are some methods for organizational development. These methods include message elimination, regrouping, reclustering, regression, and reuse. Development occurs within a modeling system called Ubik. It is a concurrent object based system which supports a high level representation of an organization, The structure of an organization is modeled with collections of linked together objects. The action of an organization is carried out via message passing. Active messages are used to buitd a specialized object called a Tapeworm, which monitors and constrains organizational structure and action, The Tapeworms are used to identify the mismatch between the model and the external organization. They are also used to support the development methods.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"470 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127144788","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The CB Lite project presents a case study in the design to integrate flexible ,and active support for cooperative work activities into ,an existing environment. The system’s underlying philosophy ,and architecture ,are based on the ConversationBuilder work pioneered at the University of Illinois. Our goals for this project were to understand the fundamental ,architectud issues of this technology in order to integrate it with the operating environment of the PC platform. Specifically. we sought to define a formal model of the system’s ,architecture, to define a high ievel kanguage for specifying cooperative process models ,and to build a prototype embodying the model to interpret the language.
{"title":"Design and implementation of CB Lite","authors":"Dan D. Kogan","doi":"10.1145/168555.168568","DOIUrl":"https://doi.org/10.1145/168555.168568","url":null,"abstract":"The CB Lite project presents a case study in the design to integrate flexible ,and active support for cooperative work activities into ,an existing environment. The system’s underlying philosophy ,and architecture ,are based on the ConversationBuilder work pioneered at the University of Illinois. Our goals for this project were to understand the fundamental ,architectud issues of this technology in order to integrate it with the operating environment of the PC platform. Specifically. we sought to define a formal model of the system’s ,architecture, to define a high ievel kanguage for specifying cooperative process models ,and to build a prototype embodying the model to interpret the language.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131039840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The bulk of the research done on collaborative ,work has been on improving the effectiveness of meetings. Little work has been done on providing support for knowledgeintensive, physically dispersed, asynchronous group tasks. These tasks have the essential characteristics of requiring collaboration among a team of participants, consisting of complex issue structures, requiring a significant amount of shared information, and necessitating negotiation in order to reach consensus. OMNI is a domain independent, general model of collaborative issue management designed to support such tasks. This collaboration model has four key elements which must be supported group processes, dynamics of group interactions, communications, and group memory. The central feature of the model is an issue management system capable of supporting complex, domain independent issue structures. OMNI has been implemented in the initial domain of venture capital investment decision-making.
{"title":"OMNI: a model for focused collaborative work through issue management","authors":"B. M. Lange, James B. Treleaven, A. Gershman","doi":"10.1145/168555.168576","DOIUrl":"https://doi.org/10.1145/168555.168576","url":null,"abstract":"The bulk of the research done on collaborative ,work has been on improving the effectiveness of meetings. Little work has been done on providing support for knowledgeintensive, physically dispersed, asynchronous group tasks. These tasks have the essential characteristics of requiring collaboration among a team of participants, consisting of complex issue structures, requiring a significant amount of shared information, and necessitating negotiation in order to reach consensus. OMNI is a domain independent, general model of collaborative issue management designed to support such tasks. This collaboration model has four key elements which must be supported group processes, dynamics of group interactions, communications, and group memory. The central feature of the model is an issue management system capable of supporting complex, domain independent issue structures. OMNI has been implemented in the initial domain of venture capital investment decision-making.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113987605","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
S. Laufmann, Richard L. Blumenthal, Laura Thompson, B. Bowen
Many large, widely distributed organizations struggle with the enormous task of providing the right information to the right people at the right time. Organizations facing this task often develop groups of analysts who specialize in supplying information transport and access capabilities to end-users. However, this approach has several drawbacks. Our aim is to address these problems at their source — not by replacing analysts in the information access problem, but by automating the roles assumed by analysts. Toward this end, this paper describes a strategy that combines four techniques to solve such problems: (1) an architecture for coarse-grained agents (CGAS}, (2) a communication protocol that enables CGAS to interact, (3,) an intermediate query language (IQL), designed around user-level concepts, and (4) a query translation mechanism that transforms IQL requests into database-specific queries. A prototype implementation, known as oMIE, is described.
{"title":"Direct end-user access to remote information","authors":"S. Laufmann, Richard L. Blumenthal, Laura Thompson, B. Bowen","doi":"10.1145/122831.122833","DOIUrl":"https://doi.org/10.1145/122831.122833","url":null,"abstract":"Many large, widely distributed organizations struggle with the enormous task of providing the right information to the right people at the right time. Organizations facing this task often develop groups of analysts who specialize in supplying information transport and access capabilities to end-users. However, this approach has several drawbacks. Our aim is to address these problems at their source — not by replacing analysts in the information access problem, but by automating the roles assumed by analysts. Toward this end, this paper describes a strategy that combines four techniques to solve such problems: (1) an architecture for coarse-grained agents (CGAS}, (2) a communication protocol that enables CGAS to interact, (3,) an intermediate query language (IQL), designed around user-level concepts, and (4) a query translation mechanism that transforms IQL requests into database-specific queries. A prototype implementation, known as oMIE, is described.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114755170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
MACE is a distributed program running on the X Window System and Unix 4.3bsd2 sockets that permits fine-grained (character-level) concurrent editing of text files. It runs both as a stand-alone program and as an application in the University of Florida’s distributed conferencing system (DCS). MACE uses write locks for concurrency control, allowing a locked section of text to be bounded by any pair of characters in the file. Multiple users may read or edit a file concurrently, with all users receiving updates whenever a lock is removed. The level of sharing is controlled by mutual consent, so that users may collaborate e to the degree desired, including the option to view updates in real time. MACE is a first step towards a fine-grained, lock-based approach to concurrent text editing. Permission to copy without fee all or part of this material is that copying is by permission of the Association for Computing granted provided that the copies are not made or distributed for Machinery. To copy otherwise, or to republish, requires a fee direct commercial advantage, the ACM copyright notice and the and/or specific permission. title of the publication and its date appear, and notice is given @ 1991 ACM 0-89791 -456-2 /91/0010 /0240 . ..$1 .50 ] This work is partially supported by the University of Florida PurdueUniversity Software Engineering Research Center. 2Unix is a trademark of AT&T Bell Labs, 3nemo@chameleon .cis. ufl.edu
{"title":"MACE: a fine grained concurrent editor","authors":"R. Newman, H. Pelimuhandiram","doi":"10.1145/122831.122855","DOIUrl":"https://doi.org/10.1145/122831.122855","url":null,"abstract":"MACE is a distributed program running on the X Window System and Unix 4.3bsd2 sockets that permits fine-grained (character-level) concurrent editing of text files. It runs both as a stand-alone program and as an application in the University of Florida’s distributed conferencing system (DCS). MACE uses write locks for concurrency control, allowing a locked section of text to be bounded by any pair of characters in the file. Multiple users may read or edit a file concurrently, with all users receiving updates whenever a lock is removed. The level of sharing is controlled by mutual consent, so that users may collaborate e to the degree desired, including the option to view updates in real time. MACE is a first step towards a fine-grained, lock-based approach to concurrent text editing. Permission to copy without fee all or part of this material is that copying is by permission of the Association for Computing granted provided that the copies are not made or distributed for Machinery. To copy otherwise, or to republish, requires a fee direct commercial advantage, the ACM copyright notice and the and/or specific permission. title of the publication and its date appear, and notice is given @ 1991 ACM 0-89791 -456-2 /91/0010 /0240 . ..$1 .50 ] This work is partially supported by the University of Florida PurdueUniversity Software Engineering Research Center. 2Unix is a trademark of AT&T Bell Labs, 3nemo@chameleon .cis. ufl.edu","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124354283","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The query language represents an important component of any Data Base Management System (DBMS). Therefore, advanced object-oriented DBMSS (O ODBMSS) provide query capabilities for content-based access to objects, in addition to IIaV&atiOIIa] access based on object references. Very often, these two types of access are used complementarily. Object-oriented query languages have several differences with respect to relational query languages. These differences require that new optimization techniques be developed and/or that techniques defined for relational DBMSS be reexamined and extended to effectively support object-oriented queries. One such difference is that methods can be invoked in queries. The result of a method execution is an object (either primitive or non-primitive). Therefore, predicates can be applied to it. In this paper, we describe an indexing technique that supports an efficient evaluation of predicates on methods. This technique is based on the precomputation of method result. The precomputed results are stored in an index, called the method-index, that associates with a result v the list of object identifiers for which the method execution returns v. Therefore, the evaluation of a predicate on the result of a method simply requires an index search. Since changes to an object’s status may invalidate a method’s result, a mechanism is presented for keeping track of changes that may influence the result of a method invocation. This mechanism is used to invalidate the precomputed result of a method. The method is recomputed again upon the next invocation.
{"title":"Method precomputation in object-oriented databases","authors":"E. Bertino","doi":"10.1145/122831.122852","DOIUrl":"https://doi.org/10.1145/122831.122852","url":null,"abstract":"The query language represents an important component of any Data Base Management System (DBMS). Therefore, advanced object-oriented DBMSS (O ODBMSS) provide query capabilities for content-based access to objects, in addition to IIaV&atiOIIa] access based on object references. Very often, these two types of access are used complementarily. Object-oriented query languages have several differences with respect to relational query languages. These differences require that new optimization techniques be developed and/or that techniques defined for relational DBMSS be reexamined and extended to effectively support object-oriented queries. One such difference is that methods can be invoked in queries. The result of a method execution is an object (either primitive or non-primitive). Therefore, predicates can be applied to it. In this paper, we describe an indexing technique that supports an efficient evaluation of predicates on methods. This technique is based on the precomputation of method result. The precomputed results are stored in an index, called the method-index, that associates with a result v the list of object identifiers for which the method execution returns v. Therefore, the evaluation of a predicate on the result of a method simply requires an index search. Since changes to an object’s status may invalidate a method’s result, a mechanism is presented for keeping track of changes that may influence the result of a method invocation. This mechanism is used to invalidate the precomputed result of a method. The method is recomputed again upon the next invocation.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131204104","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Group-writing, in which a document is jointly produced by a team of writers, occurs widely in science and in industry. There are now a number of products and research tools designed to support group-writing teams. Most, however, require use of non-mainstream word-processing systems, and assume that full information is available through a network to mediate conflicts. Tlds paper reports research on group-writing tools that deviate as little as possible from conventional word processors and assume only intermittent network connection for document exchange and conflict resolution. GroupWn.ter can be used by some people in a collaborative team as a conventional word processor, by others as a versioning and text/sound annotation system, and by others as a full hypertext system all while working with the same corpus of documents. It offers fill typographic and page layout facilities and imports typographic text from, andl exports to, the mainstream commercial word pmeessors.
{"title":"A minimalist approach to the development of a word processor supporting group writing activities","authors":"Nicholas Malcolm, B. Gaines","doi":"10.1145/122831.122846","DOIUrl":"https://doi.org/10.1145/122831.122846","url":null,"abstract":"Group-writing, in which a document is jointly produced by a team of writers, occurs widely in science and in industry. There are now a number of products and research tools designed to support group-writing teams. Most, however, require use of non-mainstream word-processing systems, and assume that full information is available through a network to mediate conflicts. Tlds paper reports research on group-writing tools that deviate as little as possible from conventional word processors and assume only intermittent network connection for document exchange and conflict resolution. GroupWn.ter can be used by some people in a collaborative team as a conventional word processor, by others as a versioning and text/sound annotation system, and by others as a full hypertext system all while working with the same corpus of documents. It offers fill typographic and page layout facilities and imports typographic text from, andl exports to, the mainstream commercial word pmeessors.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128902017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：