For the development of large and sophisticated distributed organizational information systems, one of the most prevalent, yet difficult problems is secure concurrent access to shared objects while preserving collective system consistency. In modeling and implementing such systems in object-oriented concurrent languages, linguistic supports are needed to enable the programmer to have a transparent view of shared objects. For this purpose, we generalized the standard notion of nested transactions to accommodate asynchronous message passing protocols, and introduced the notion of object-wise atomicity level. This paper discusses our proposed linguistic constructs for such transaction facilities.
{"title":"Linguistic supports for development of distributed organizational information systems in object-oriented concurrent computation frameworks","authors":"Ken Wakita, A. Yonezawa","doi":"10.1145/122831.122851","DOIUrl":"https://doi.org/10.1145/122831.122851","url":null,"abstract":"For the development of large and sophisticated distributed organizational information systems, one of the most prevalent, yet difficult problems is secure concurrent access to shared objects while preserving collective system consistency. In modeling and implementing such systems in object-oriented concurrent languages, linguistic supports are needed to enable the programmer to have a transparent view of shared objects. For this purpose, we generalized the standard notion of nested transactions to accommodate asynchronous message passing protocols, and introduced the notion of object-wise atomicity level. This paper discusses our proposed linguistic constructs for such transaction facilities.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"14 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":"131567157","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}
GMAL is an actor language based on a reflective representationof LIICactor model. This modelization provides interesting features for a tool of Distributed Artificial Intelligence such as modularity, flexibility, i~erent parallelism and easy integration of intelligent functions such as introspection. We give first, a brief presentation of the pure actor model of Agha and show how GMAL is designed as a closure of this model. We preSent then, the interest of such a modelization for a tool for DAI and finish by presenting an example on the use of GMAL for knowledge’s representation, exploitation and generation.
{"title":"GMAL: a reflective language for distributed AI","authors":"S. Hassas","doi":"10.1145/122831.122843","DOIUrl":"https://doi.org/10.1145/122831.122843","url":null,"abstract":"GMAL is an actor language based on a reflective representationof LIICactor model. This modelization provides interesting features for a tool of Distributed Artificial Intelligence such as modularity, flexibility, i~erent parallelism and easy integration of intelligent functions such as introspection. We give first, a brief presentation of the pure actor model of Agha and show how GMAL is designed as a closure of this model. We preSent then, the interest of such a modelization for a tool for DAI and finish by presenting an example on the use of GMAL for knowledge’s representation, exploitation and generation.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"5 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":"129685170","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}
This paper presents a distributed approach and system to support complex distributed application services (briefly: complex services). A basic application service is described by a typed operational interface and is implemented by multiple distributed server instances. Complex services consist of sequential and parallel executions of basic services. They are implemented by a specific execution model. This model allows for specification of complex service execution sequences, for management of data objects to be operated upon, and for flexible binding of requested services to associated servers. This flexibility is mainly achieved by the dynamic routing of objects representing a complex service execution. Specific support for this model is provided by a new high-level language to specify a service/server environment and to describe execution sequences, by an associated runtime environment, and by a supplemental monitor approach to supervise distributed service executions. The paper describes these facilities using examples from the office automation area.
{"title":"Language and distributed system support for complex organizational services","authors":"A. Schill, A. Malhotra","doi":"10.1145/122831.122832","DOIUrl":"https://doi.org/10.1145/122831.122832","url":null,"abstract":"This paper presents a distributed approach and system to support complex distributed application services (briefly: complex services). A basic application service is described by a typed operational interface and is implemented by multiple distributed server instances. Complex services consist of sequential and parallel executions of basic services. They are implemented by a specific execution model. This model allows for specification of complex service execution sequences, for management of data objects to be operated upon, and for flexible binding of requested services to associated servers. This flexibility is mainly achieved by the dynamic routing of objects representing a complex service execution. Specific support for this model is provided by a new high-level language to specify a service/server environment and to describe execution sequences, by an associated runtime environment, and by a supplemental monitor approach to supervise distributed service executions. The paper describes these facilities using examples from the office automation area.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"28 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":"117029046","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}
Replicating applications in a shared window environment can significantly improve the performance of the resulting system. Compared to a completely centralized approach, a replicated architecture offers superior response time and reduces network load. To date, however, these advantages have been overshadowed by the equally significant synchronization problems associated with replication. In this paper we document these problems and show that the most frequent synchronization problems can be solved without changing existing software. We further indicate how some of the limitations of the resulting system can be removed by making applications or system servers collaboration-aware. Finally, we point out where general system support is needed to address the remaining deficiencies.
{"title":"Replicated architectures for shared window systems: a critique","authors":"Chris Lauwers, T. A. Joseph, K. Lantz, A. Romanow","doi":"10.1145/91474.91551","DOIUrl":"https://doi.org/10.1145/91474.91551","url":null,"abstract":"Replicating applications in a shared window environment can significantly improve the performance of the resulting system. Compared to a completely centralized approach, a replicated architecture offers superior response time and reduces network load. To date, however, these advantages have been overshadowed by the equally significant synchronization problems associated with replication. In this paper we document these problems and show that the most frequent synchronization problems can be solved without changing existing software. We further indicate how some of the limitations of the resulting system can be removed by making applications or system servers collaboration-aware. Finally, we point out where general system support is needed to address the remaining deficiencies.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114964080","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}
An object-oriented office model is presented. It uses the object taxonomy of Booch featuring object classes based on calling patterns. Our model is motivated by that of Woo and Lochovsky, but has a number of differences, especially in the definition of the object classes and in the treatment of nested objects. An office application, setting a meeting among office workers, is defined in terms the office model.
{"title":"A logically distributed approach for structuring office systems","authors":"Panos K. Chrysanthis, D. Stemple, K. Ramamritham","doi":"10.1145/91474.91482","DOIUrl":"https://doi.org/10.1145/91474.91482","url":null,"abstract":"An object-oriented office model is presented. It uses the object taxonomy of Booch featuring object classes based on calling patterns. Our model is motivated by that of Woo and Lochovsky, but has a number of differences, especially in the definition of the object classes and in the treatment of nested objects. An office application, setting a meeting among office workers, is defined in terms the office model.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114298497","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}
To cope with a highly specialized environment, organizational workers specialize in different areas of knowledge (e.g., taxation). Communication plays a very important role in performing organizational tasks that require multiple specializations. In fact, research data shows that managers and professionals spend about 70-80% of their time in communication. To alleviate the time organizational workers spend in communication, some of their communication should be automated. In this paper, we propose a communication tool for this purpose. This tool can be used essentially in the same way that an expert system shell is used. The function of this tool is to collect data needed for performing a task in an open system. In order to do so, the two communicating parties must understand what each other wants. The speech act taxonomy developed by Searle, then modified by Reiss, is useful for this purpose. However, their taxonomy is intended for general communication. We have to select the appropriate subset of it that is suitable for automating organizational communication and have to operationalize the theory behind it into a computer-based communication tool.
{"title":"SACT: a tool for automating semi-structured organizational communication","authors":"C. Woo","doi":"10.1145/91474.91493","DOIUrl":"https://doi.org/10.1145/91474.91493","url":null,"abstract":"To cope with a highly specialized environment, organizational workers specialize in different areas of knowledge (e.g., taxation). Communication plays a very important role in performing organizational tasks that require multiple specializations. In fact, research data shows that managers and professionals spend about 70-80% of their time in communication. To alleviate the time organizational workers spend in communication, some of their communication should be automated. In this paper, we propose a communication tool for this purpose. This tool can be used essentially in the same way that an expert system shell is used.\u0000The function of this tool is to collect data needed for performing a task in an open system. In order to do so, the two communicating parties must understand what each other wants. The speech act taxonomy developed by Searle, then modified by Reiss, is useful for this purpose. However, their taxonomy is intended for general communication. We have to select the appropriate subset of it that is suitable for automating organizational communication and have to operationalize the theory behind it into a computer-based communication tool.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126467537","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}
This paper proposes a set-to-set linking model with the purpose of improving the trade-off between link organizing/updating costs and link utilization benefits. This model is based on a value-document linking structure in a multi-facet schema, that is, a schema-instance linking structure which helps to decrease the total number of links. It provides a series of traversing operations to create dynamically the related document set step-by-step in accord with certain specified values. A prototype fine arts encyclopedia demonstrates the usefulness of this linking strategy.
{"title":"A set-to-set linking strategy for hypertext systems","authors":"Y. Hara, Y. Kasahara","doi":"10.1145/91474.91500","DOIUrl":"https://doi.org/10.1145/91474.91500","url":null,"abstract":"This paper proposes a set-to-set linking model with the purpose of improving the trade-off between link organizing/updating costs and link utilization benefits. This model is based on a value-document linking structure in a multi-facet schema, that is, a schema-instance linking structure which helps to decrease the total number of links. It provides a series of traversing operations to create dynamically the related document set step-by-step in accord with certain specified values. A prototype fine arts encyclopedia demonstrates the usefulness of this linking strategy.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115468094","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}
E. Bertino, Mauro Negri, G. Pelagatti, L. Sbattella
The object-oriented paradigm is becoming very popular for database applications and several object-oriented DBMSs have been developed. A basic notion in this paradigm is the inheritance hierarchy that allows the users to define objects and the associated operations starting from already defined objects. However, in database applications the inheritance hierarchy must provide a conceptual modeling function, in addition to the re-usability function. Another important requirement is to provide support for data distribution in (possibly) heterogeneous environments. This means that object implementation may differ depending on the object location. This paper presents a model that decouples these two aspects, modeling vs implementation, by using the concept of abstract and implementation classes. An abstract class specifies properties and methods for a set of similar objects, like in other object-oriented data models. An abstract class is however independent of the object implementation and location. An implementation class defines the implementation of an abstract class. In our model an abstract class may have several implementations. This allows the user to provide different implementations for the same set of objects, without requiring the objects to change class.
{"title":"An object-oriented data model for distributed office applications","authors":"E. Bertino, Mauro Negri, G. Pelagatti, L. Sbattella","doi":"10.1145/91474.91544","DOIUrl":"https://doi.org/10.1145/91474.91544","url":null,"abstract":"The object-oriented paradigm is becoming very popular for database applications and several object-oriented DBMSs have been developed. A basic notion in this paradigm is the inheritance hierarchy that allows the users to define objects and the associated operations starting from already defined objects. However, in database applications the inheritance hierarchy must provide a conceptual modeling function, in addition to the re-usability function. Another important requirement is to provide support for data distribution in (possibly) heterogeneous environments. This means that object implementation may differ depending on the object location. This paper presents a model that decouples these two aspects, modeling vs implementation, by using the concept of abstract and implementation classes. An abstract class specifies properties and methods for a set of similar objects, like in other object-oriented data models. An abstract class is however independent of the object implementation and location. An implementation class defines the implementation of an abstract class. In our model an abstract class may have several implementations. This allows the user to provide different implementations for the same set of objects, without requiring the objects to change class.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128754169","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}
This paper investigates the use of voting policies to coordinate routing decisions in a phone network. Although the social metaphor of voting has been applied to network coordination decision tasks, this study presents the first operational example of a vote-theoretic group decision support system (GDSS) for nodes. The experimental evidence shows that a collective choice voting policy dominates a policy of individual, hierarchical voting in minimizing movement toward system saturation and promoting load balancing. This result provides a basis for using voting policies to create more complex self-correcting networks.
{"title":"Coordinating distributed actions via agent voting","authors":"Arnold B. Urken","doi":"10.1145/91474.91501","DOIUrl":"https://doi.org/10.1145/91474.91501","url":null,"abstract":"This paper investigates the use of voting policies to coordinate routing decisions in a phone network. Although the social metaphor of voting has been applied to network coordination decision tasks, this study presents the first operational example of a vote-theoretic group decision support system (GDSS) for nodes. The experimental evidence shows that a collective choice voting policy dominates a policy of individual, hierarchical voting in minimizing movement toward system saturation and promoting load balancing. This result provides a basis for using voting policies to create more complex self-correcting networks.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126413058","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}
N. Mattos, B. Mitschang, A. Dengel, Rainer Bleisinger
We propose an approach towards an integrated document processing and management system that has the intention to capture essentially freely structured documents, like those typically used in the office domain. The document analysis system ANASTASIL is capable to reveal the structure as well as the contents of complex paper documents. Moreover, it facilitates the handling of the containing information. Analyzed documents are stored in the management system KRISYS that is connected to several different subsequent services. The described system can be considered as an ideal extension of the human clerk, making his tasks in information processing easier. The symbolic representation of the analysis results allow an easy transformation in a given international standard, e.g., ODA/ODIF or SGML, and to interchange it via global network.
{"title":"An approach to integrated office document processing and management","authors":"N. Mattos, B. Mitschang, A. Dengel, Rainer Bleisinger","doi":"10.1145/91474.91497","DOIUrl":"https://doi.org/10.1145/91474.91497","url":null,"abstract":"We propose an approach towards an integrated document processing and management system that has the intention to capture essentially freely structured documents, like those typically used in the office domain. The document analysis system ANASTASIL is capable to reveal the structure as well as the contents of complex paper documents. Moreover, it facilitates the handling of the containing information. Analyzed documents are stored in the management system KRISYS that is connected to several different subsequent services. The described system can be considered as an ideal extension of the human clerk, making his tasks in information processing easier. The symbolic representation of the analysis results allow an easy transformation in a given international standard, e.g., ODA/ODIF or SGML, and to interchange it via global network.","PeriodicalId":338751,"journal":{"name":"Conference on Organizational Computing Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133145598","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
扫码关注我们
求助内容：
应助结果提醒方式：