Combining Asynchronous and Synchronous Collaborative. Institut fur Informatik, Technische Universitat Munchen, Postfach , D{8000 Munchen 2,
|
|
- Sophie Wright
- 5 years ago
- Views:
Transcription
1 Combining Asynchronous and Synchronous Collaborative Systems Gunnar Teege and Uwe M. Borgho Institut fur Informatik, Technische Universitat Munchen, Postfach , D{8000 Munchen 2, Germany. fteege,borghoginformatik.tumuenchen.de Abstract There are a variety of dierent CSCW applications for group collaboration. Among others, systems for asynchronous coordination as well as synchronous multiuser ors are current research topics. Each system has its advantages. Thus, combining the advantages of such systems should be even more advantageous. We have developed a new objectoriented, asynchronous activity support system, called TACTS, and a new synchronous multiuser or, called IRIS. We explain how both systems can be combined using the underlying state models, and show the advantages of the combination. 1. INTRODUCTION Transparent access to shared information is the main goal of distributed le systems, distributed operating systems, and distributed database systems. In collaborative systems, however, full transparency and a strict isolation of users are contraproductive. Therefore, CSCW systems try to weaken the concept of transparency and to introduce the concept of collaborationaware group interaction. There a variety of CSCWapplications. Among systems for group decision support, desktop conferencing, and electronic meeting rooms, there are systems for coordination as well as multiuser ors. The latter systems, the asynchronous coordination approaches as well as the synchronous collaborative ing approaches are often implemented as standalone applications. Smooth transitions should be supported between using technology and conventional methods of writing, between individual work and group work, between planning, outlining, writing, and annotating the document, and between synchronous and asynchronous work by group members [1]. The combination and integration of such applications providing smooth transitions should be advantageous. A characteristic dierence between synchronous and asynchronous collaborative systems is the use of shared data. A pure asynchronous system is looselycoupled and does not involve shared data. We will concentrate on this dierence and show how to systematically integrate a system with private data and a system with shared data. The main idea will be to use data states to model the former, and work group states to model the latter system, and to combine these models into a common one. We describe the concrete application to two systems supporting collaborative work on documents, both developed in our department. The rst one is the new objectoriented, asynchronous activity coordination system TACTS, the second is the new synchronous multiuser or IRIS. Sects. 2 and 3 briey describe the design concepts of TACTS and IRIS, respectively. In Sect. 4, we explain how both approaches can be smoothly combined and how this combination will benet from the interrelation. Finally, Sect. 5 concludes by discussing the lessons learned.
2 2. TACTS In this section we describe the rst collaborative system used for the combination. It is the asynchronous activity support system TACTS that primarily supports the structuring, execution and history of activities of a single user. The system supports activities in a way similar to the Coordinator [4], and supports oce procedure plans as does the Domino System []. However, the combination with IRIS only concerns the class of activities which represent work on a document. Among others, TACTS supports ing, transformation, printing and the sending of documents by electronic mail. A full description of the objectoriented structure of TACTS and of all types of supported objects is out of the scope of this overview. Interested readers are referred to [8]. For every document all activities concerning the document (together with the document content, if stored electronically) are represented by a TACTS object. This kind of object uses a general TACTS mechanism to maintain an explicit state. The possible states and transitions together form a nite state automaton. The state automaton is the main user interface for document objects. The user may select and activate any transition which is dened for the current state of the object. All document objects in TACTS use a common automaton with four states, namely \", \", \xed", and \in " as shown in Fig. 1. The states may be interpreted as to describe the state of the document content. We call these states document content states. The document content comprises the data which is private for TACTS and must become shared in the combination of TACTS and IRIS. Thus the automaton describes the relevant behavior in respect to the data and will be used for the combination. The semantical description of the document content states is as follows. In brackets the rst export doc export doc appearance of the appropriate transition is indicated. In state \ " the document content does import doc not or an ing document has been init doc x doc deleted (erase doc). In state \" the document content s due to initialization xed erase doc (init doc) or due to import from an external source, e.g., (import doc). Export start doc stop doc activities leave this document content state unchanged (export doc). Exporting means processing the content in some way, e.g., printing it or sending it with to another user. All collaboration with respect in to documents in TACTS is done by importing and exporting (parts of) the document TACTS' Automaton for Document Objects. Fig. 1: contents. (The collaboration partners are modeled by explicit \agent" objects.) In state \in " the ing document is under manipulation, i.e., the user has started an ing session (start doc). When the ing session is left, the document returns to state \" (stop doc). In state \xed" the ing document has been nally xed, i.e., the current version has been frozen and cannot be ed any more (x doc). Export activities leave this document content state unchanged. Aside from the state, a document object maintains other specications such as time which uses a general time mechanism provided by TACTS. Every document object records the time of every export to a specic goal, the last time interval in which the document was not in state \", and all time intervals the document was in state \" or \xed". The latter intervals dene the document versions.
3 3. IRIS In this section we briey describe the synchronous collaborative system IRIS used for the combination. It is a newly developed multiuser or for multimedia documents. Like CES [5] and MultimETH [7], IRIS allows for structural changes without harm to the content information. Both content and structural information of a document are fully replicated. In order to achieve pessimistic concurrency control and to avoid inconsistencies, even when dierent users are working on the same parts of a document at the same time, IRIS uses a distributed replication control scheme based on dynamic voting [2]. More details are given elsewhere [3]. The group ing the document is formed implicitly by the act of opening a le to. Working with IRIS can be seen as using the following automaton with four states, namely \", \", \", and \" as shown in Fig. 2. We call these states work group states. The semantical description of the work group states is as follows: In state \ " the group of users sub user stop user working with IRIS does not. In state \" the group of users working with IRIS s due to a rst addition add user of an IRIS user () or due to the sub user stopping of the ing by some user of the group (stop user). Further additions or some removals of users from the user group (sub user) leave this work Fig. 2: IRIS' Automaton for Synchronous Collaborative Work. group state unchanged, provided there is at least one user remaining in the user group. In state \" the last user has been removed from the user group (). Finally in state \", one of the user has started ing the document (). Further starts (add user) or quits (sub user) of users ing the document leave this work group state unchanged as long as at least one user continues to the document. 4. COMBINING BOTH SYSTEMS As we have seen, TACTS as well as IRIS are nice standalone systems with specic advantages. Thus, we try to combine the advantages of both systems into an integrated CSCWsystem. The goal of the attempt is to have true synchronized access to a document while retaining all additional TACTS operations on documents (aside from ing). The main solution is to use IRIS for storing, accessing and ing of the document contents and structure and to make the necessary parts of IRIS accessible from TACTS for the implementation of other operations. This involves adapting the dierent models for, e.g., structuring and versioning used in both systems. As our main step we show how the state automata for the document content and the work group, respectively, can be combined. Afterwards we discuss one of the advantages of the resulting combination, namely the enhanced way of navigating through the version tree. Combining the State Automata: As a rst step we augment the automaton used explicitly by TACTS. We choose a systematic approach to do so by combining it with the automaton modeling the use of IRIS. While TACTS is mainly concerned with the state of the document content, the main concern of IRIS is the state of the group working on the document. By combining these approaches we can integrate both views. We construct an intermediate automaton as follows. Combined states are all pairs \X/Y" with X being a work group state in the IRIS
4 automaton and Y being a document content state in the TACTS automaton. This results in 1 combined states. Every transition from X 1 to X 2 in the IRIS automaton now is dened for all \X 1 // / /Y" with arbitrary Y and leads to \X 2 // /Y". This results in four copies of every IRIS transition in the intermediate automaton. The TACTS transitions are handled analogously, i.e., IRIS transitions are printed in the horizontal columns whereas TACTS transitions are printed in the vertical rows. For better readability, moreover, we write all IRIS work group states and their corresponding transitions in italic. /// stop user // / / erase doc erase doc erase stop user... doc erase doc import/init doc import/init doc import/init doc import/init doc / start/stop doc start/stop doc start/stop doc start/stop doc in in in in.... stop user... R xed xed. xed xed... stop user x doc x doc x doc x doc / / / / Fig. 3. Intermediate Document Automaton for Synchronous Activities. Semantically, the intermediate automaton, as depicted by Fig. 3, describes all resulting states which can be described by a combination of the work group states and the document content states. For reasons of simplicity, we do not include transitions where the source and target states are identical. In the given intermediate document automaton for synchronous activities, however, not all combinations are useful. Thus we modify the intermediate automaton based upon semantic considerations. There are three states in which the work group is undened, whereas the document content is dened, namely \/" \/in ", and \/xed". Semantically, only the work group can manipulate the content; thus these states are meaningless. We remove them together with all corresponding transitions. When the work group is nally, the document content can no longer be changed. We model this by removing the states \/in " and \/". The former state can only be reached from the latter state via a transition start doc. The latter state can be reached in two ways: From state \/" via transitions init doc or import doc, respectively, and from state \/" via transition.
5 When the work group is, init doc and import doc are semantically impossible and can be removed. The transition in state \/" can be handled by following it automatically with the transition x doc, thus ending in state \/xed". Semantically this is correct: Whenever the last member leaves the work group, the document content is automatically xed and can no longer be changed. In Fig. 3 this is expressed by the thick arrow from state \/" to state \/xed". The corresponding transition can be labelled with sublast user x doc where \" respresents the concatenation of two transitions. Explicit xing no longer makes sense, since it can only be issued by a single group member. This does not guarantee that other members may not wish to change the document content. Thus, we delete the transitions x doc in the states \/" and \/". This makes the states \/xed" and \/xed" unreachable, so they are removed as well. Semantically, the document content is ed whenever at least one group member is ing it. We handle this by integrating the two states \/" and \/in " into the state \/in ". Thus, all transitions starting or ending in one of the two states now start or end in \/in ", respectively, and the other two states are removed. The transitions start doc and are combined into a single transition because they imply each other. The same holds true for stop doc and stop user. This is indicated by the special symbol \k". sub user The result of the discussed modications is illustrated in Fig. 4. The export doc export doc... IRIS transitions are marked with dotted lines. The semantical interpretation of the combined states is ob import doc.. tained by simply combining the semantics of the individual states given init doc in Sects. 2. and 3., respectively. The erase doc automaton shows the smooth integration of all TACTS operations with start doc k stop doc k sub user x doc xed all IRIS operations. It is still possible to export and import the con stop user. tent asynchronously, as in TACTS, and to it synchronously, as in in IRIS. The main change in the implementation of the TACTS operations.. export doc add user is the use of IRIS for storing the document content. Note however that sub user Fig. 4: the state combination has introduced Automaton for TACTS/IRIS documents. an export doc transition at state \/in ". For its implementation the version of the contents to be exported must be specied. A possible solution would be to export the last valid version previous to the current ing session. Combining the Version Mechanisms: As a second step we show how the dierent version mechanisms can be combined and of what benet this is to IRIS. To keep versions in IRIS manageable to the user, every version is given attributes, such as the time of its ence or the name of the user responsible for the new version. The interface that gives access to older versions of the document allows associative access to versions via its attributes (such as selecting the last version created by the user himself) as well as stepping through the version tree. In TACTS, the history of a document is a nonbranching linear list of versions encapsulated in a single object. Therefore, TACTS must create a new object whenever the IRIS version tree branches.
6 TACTS itself provides additional attributes, e.g., protocoling the export activities. A user can select a document version by simply classifying it as, for instance, the last version he printed. The combination of TACTS and IRIS allows for the selection of a version in the following way: Depict the last, the second last, etc., version that was printed, mailed, etc., by a third person. These are advantages IRIS has not to \pay" for. They are byproducts of its combination with TACTS. 5. CONCLUSION IRIS is implemented in ANSIC and runs on our HPworkstation cluster operating HPUX V8.07. The ISIS toolkit V3.0 is used to provide the multicast feature. The graphical interface has been written using the InterViews 3.01 software package. TACTS is implemented on top of the proprietary EmacsLispObjectOrientedSystem ELIOOS which has been specially developed for TACTS. It has full access to all ing, mailing and other communication mechanisms available in GNU Emacs. It uses the or's own multiwindow interface together with the mouse support available under the X Window System to communicate with the user. As we have shown, it is possible to combine conceptually dierent systems in a systematic way, i.e., in the given example, the asynchronous activity support system TACTS using private data and the synchronous distributed multiuser or IRIS using shared data. In our approach we modeled the main behavior of the individual systems with the help of state automata and combined these into a model for the behavior of the combined system. After considering the specic state semantics we reduced the model accordingly. The result fully integrated the operations of both systems. A similar approach should be possible whenever the system behavior can be modeled by a state automaton. The lessons learned are that the additional overhead for combining both systems is relatively small, due to the systematic approach. It is by far outweighed by the advantage of having the features of both systems integrated into a single system, e.g., the additional ways of selecting dierent versions of a document. We are grateful to Anke Makio and Michael Koch for implementing the rst version of IRIS, and to Hans Schmid for implementing the time mechanism of TACTS.. REFERENCES 1. Baecker, R.M.: New Paradigms for Computing in the Nineties. Proc. of Graphics Interface, Los Altos, CA: Morgan Kaufmann Publ. Inc., pp. 224{ Borgho, U.M.: Fehlertoleranz in verteilten Dateisystemen: Eine Ubersicht uber den heutigen Entwicklungsstand bei den Votierungsverfahren. InformatikSpektrum 14:1, 15{27 (Feb. 1991) 3. Borgho, U.M., Teege, G.: Application of Collaborative Editing to SoftwareEngineering Projects. ACM SIGSOFT Software Engineering Notes 18:3, A{5{4 (Jul. 1993) 4. Flores, F., Graves, M., Harteld, B., Winograd, T.: Computer Systems and the Design of Organizational Interaction. ACM Transactions on Oce Information Systems :2, 153{172 (Apr. 1988) 5. Greif, I., Seliger, R., Weihl, W.: Atomic Data Abstractions in a Distributed Collaborative Editing System (Extended Abstract). Proc. 13th ACM SIGACT/SIGPLAN Annual Symp. on Principles of Programming Languages, St. Petersburg Beach, FL, Jan New York: ACM, pp. 10{172. Kreifelts, T., Hinrichs, E., Klein, K.H., Seuert, P., Woetzel, G.: Experiences with the DOMINO oce procedure system. In: Bannon, L., Robinson, M., Schmidt, K. (eds.): Proc. 2nd Europ. Conf. on Computer Supported Cooperative Work, Amsterdam, The Netherlands, Sep Dordrecht, Boston, London: Kluwer Academic Publ., pp. 117{ Lubich, H., Plattner, B.: A Proposed Model and Functionality Denition for a Collaborative Editing and Conferencing System. In: Gibbs, S., VerrijnStuart, A.A. (eds.): Proc. IFIP Conf. WG 8.4 Conf. on Multi User Interfaces and Applications, Heraklion, Greece, Sep Amsterdam, New York: NorthHolland, pp. 215{ Teege, G.: The Activity Support System TACTS. Inst. fur Informatik, Techn. Univ. Munchen, Munich, Germany, Technical Report TUM{I 930, Apr. 1993
Integrating Access and Collaboration for Multimedia Applications
Integrating Access and Collaboration for Multimedia Applications Gunnar Teege and Michael Koch Institut für Informatik, Technische Univ. München 80290 München, Germany E-mail: [teege/kochm]@informatik.tu-muenchen.de
More informationSAMOS: an Active Object{Oriented Database System. Stella Gatziu, Klaus R. Dittrich. Database Technology Research Group
SAMOS: an Active Object{Oriented Database System Stella Gatziu, Klaus R. Dittrich Database Technology Research Group Institut fur Informatik, Universitat Zurich fgatziu, dittrichg@ifi.unizh.ch to appear
More informationNatural Semantics [14] within the Centaur system [6], and the Typol formalism [8] which provides us with executable specications. The outcome of such
A Formal Executable Semantics for Java Isabelle Attali, Denis Caromel, Marjorie Russo INRIA Sophia Antipolis, CNRS - I3S - Univ. Nice Sophia Antipolis, BP 93, 06902 Sophia Antipolis Cedex - France tel:
More informationUsing Electronic Document Repositories (EDR) for Collaboration A first definition of EDR and technical implementation
Using Electronic Document Repositories (EDR) for Collaboration A first definition of EDR and technical implementation Hilda Tellioglu Vienna University of Technology, Department for CSCW Argentinierstrasse
More informationMobile NFS. Fixed NFS. MFS Proxy. Client. Client. Standard NFS Server. Fixed NFS MFS: Proxy. Mobile. Client NFS. Wired Network.
On Building a File System for Mobile Environments Using Generic Services F. Andre M.T. Segarra IRISA Research Institute IRISA Research Institute Campus de Beaulieu Campus de Beaulieu 35042 Rennes Cedex,
More informationThe Compositional C++ Language. Denition. Abstract. This document gives a concise denition of the syntax and semantics
The Compositional C++ Language Denition Peter Carlin Mani Chandy Carl Kesselman March 12, 1993 Revision 0.95 3/12/93, Comments welcome. Abstract This document gives a concise denition of the syntax and
More informationConcurrent Programming Lecture 3
Concurrent Programming Lecture 3 3rd September 2003 Atomic Actions Fine grain atomic action We assume that all machine instructions are executed atomically: observers (including instructions in other threads)
More informationbasic need. According to the requirements summary a model for a group editing environment is
Design Issues and Model for a Distributed Multi-User Editor Michael Koch Institut fur Informatik, Technische Universitat Munchen, Germany E-mail: kochm@informatik.tu-muenchen.de Abstract. The collaborative
More informationAbstract formula. Net formula
{ PEP { More than a Petri Net Tool ABSTRACT Bernd Grahlmann and Eike Best The PEP system (Programming Environment based on Petri Nets) supports the most important tasks of a good net tool, including HL
More informationThis example uses the or-operator ' '. Strings which are enclosed in angle brackets (like <N>, <sg>, and <pl> in the example) are multi-character symb
A Programming Language For Finite State Transducers Helmut Schmid Institute for Natural Language Processing (IMS) University of Stuttgart Germany schmid@ims.uni-stuttgart.de Abstract. This paper presents
More informationSORT INFERENCE \coregular" signatures, they derive an algorithm for computing a most general typing for expressions e which is only slightly more comp
Haskell Overloading is DEXPTIME{complete Helmut Seidl Fachbereich Informatik Universitat des Saarlandes Postfach 151150 D{66041 Saarbrucken Germany seidl@cs.uni-sb.de Febr., 1994 Keywords: Haskell type
More informationManaging test suites for services
Managing test suites for services Kathrin Kaschner Universität Rostock, Institut für Informatik, 18051 Rostock, Germany kathrin.kaschner@uni-rostock.de Abstract. When developing an existing service further,
More informationperform. If more storage is required, more can be added without having to modify the processor (provided that the extra memory is still addressable).
How to Make Zuse's Z3 a Universal Computer Raul Rojas January 14, 1998 Abstract The computing machine Z3, built by Konrad Zuse between 1938 and 1941, could only execute xed sequences of oating-point arithmetical
More informationUser Interface Modelling Based on the Graph Transformations of Conceptual Data Model
User Interface Modelling Based on the Graph Transformations of Conceptual Data Model Martin Molhanec Department of e-technology, Faculty of Electrical Engineering Czech Technical University in Prague Technická
More informationSupport for Meetings using the EuroCoOp Task Manager
in: Scrivener. S. A. (ed.) Computer-Supported Cooperative Work (Unicom Applied Information Technology Ser.), Aldershot: Avebury Technical, Ashgate Publ. Ltd, 1994, S. 149-170 Support for Meetings using
More informationREIHE INFORMATIK 9/2001 RTP/I Payload Type Definition for Telepointers Jürgen Vogel Universität Mannheim Praktische Informatik IV L15, 16 D-68131
REIHE INFORMATIK 9/2001 RTP/I Payload Type Definition for Telepointers Jürgen Vogel Universität Mannheim Praktische Informatik IV L15, 16 D-68131 Mannheim RTP/I Payload Type Definition for Telepointers
More informationOn Object Orientation as a Paradigm for General Purpose. Distributed Operating Systems
On Object Orientation as a Paradigm for General Purpose Distributed Operating Systems Vinny Cahill, Sean Baker, Brendan Tangney, Chris Horn and Neville Harris Distributed Systems Group, Dept. of Computer
More informationUNIVERSITÄT PADERBORN. ComponentTools
UNIVERSITÄT PADERBORN ComponentTools Component Library Concept Project Group ComponentTools pg-components@uni-paderborn.de Alexander Gepting, Joel Greenyer, Andreas Maas, Sebastian Munkelt, Csaba Pales,
More informationCollaboration Support in Open Hypermedia Environments
Collaboration Support in Open Hypermedia Environments Jörg M. Haake & Weigang Wang GMD - German National Research Center for Information Technology Integrated Publication and Information Systems Institute
More informationThe VORTEL Approach to Application Integration. M. Zimmermann, M. Bever J. M. Haake. applications { also called legacy applications { as
The VORTEL Approach to Integration in Distributed Systems R. Gunthor, G. Krause, A. Bapat, M. Zimmermann, M. Bever J. M. Haake IBM ENC Heidelberg GMD { IPSI Vangerowstr. 18, 69020 Heidelberg, Germany Dolivostr.
More informationExploration of Unknown or Partially Known. Prof. Dr. -Ing. G. Farber. the current step. It can be derived from a third camera
Exploration of Unknown or Partially Known Environments? Darius Burschka, Christof Eberst Institute of Process Control Computers Prof. Dr. -Ing. G. Farber Technische Universitat Munchen 80280 Munich, Germany
More informationTowards a Reference Framework. Gianpaolo Cugola and Carlo Ghezzi. [cugola, P.za Leonardo da Vinci 32.
Inconsistencies in Software Development: Towards a Reference Framework Gianpaolo Cugola and Carlo Ghezzi [cugola, ghezzi]@elet.polimi.it Dipartimento di Elettronica e Informazione Politecnico di Milano
More informationDistributed Concurrency Control in. fc.sun, Abstract
Distributed Concurrency Control in Real-time Cooperative Editing Systems C. Sun + Y. Yang z Y. Zhang y D. Chen + + School of Computing & Information Technology Grith University, Brisbane, Qld 4111, Australia
More informationFor our sample application we have realized a wrapper WWWSEARCH which is able to retrieve HTML-pages from a web server and extract pieces of informati
Meta Web Search with KOMET Jacques Calmet and Peter Kullmann Institut fur Algorithmen und Kognitive Systeme (IAKS) Fakultat fur Informatik, Universitat Karlsruhe Am Fasanengarten 5, D-76131 Karlsruhe,
More informationTwo Problems - Two Solutions: One System - ECLiPSe. Mark Wallace and Andre Veron. April 1993
Two Problems - Two Solutions: One System - ECLiPSe Mark Wallace and Andre Veron April 1993 1 Introduction The constraint logic programming system ECL i PS e [4] is the successor to the CHIP system [1].
More informationIntegrated. Database Services for. Multimedia Presentations. Susanne Boll, Wolfgang Klas, and Michael Lohr GMD-IPSI
Integrated Database Services for Multimedia Presentations Susanne Boll, Wolfgang Klas, and Michael Lohr GMD-IPSI Integrated Publication and Information Systems Institute Dolivostr. 15 D-64293 Darmstadt,
More informationA Hierarchical Approach to Workload. M. Calzarossa 1, G. Haring 2, G. Kotsis 2,A.Merlo 1,D.Tessera 1
A Hierarchical Approach to Workload Characterization for Parallel Systems? M. Calzarossa 1, G. Haring 2, G. Kotsis 2,A.Merlo 1,D.Tessera 1 1 Dipartimento di Informatica e Sistemistica, Universita dipavia,
More informationA Framework for A Graph- and Queuing System-Based Pedestrian Simulation
A Framework for A Graph- and Queuing System-Based Pedestrian Simulation Srihari Narasimhan IPVS Universität Stuttgart Stuttgart, Germany Hans-Joachim Bungartz Institut für Informatik Technische Universität
More informationContext-based Navigational Support in Hypermedia
Context-based Navigational Support in Hypermedia Sebastian Stober and Andreas Nürnberger Institut für Wissens- und Sprachverarbeitung, Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg,
More informationTechnische Universitat Munchen. Institut fur Informatik. D Munchen.
Developing Applications for Multicomputer Systems on Workstation Clusters Georg Stellner, Arndt Bode, Stefan Lamberts and Thomas Ludwig? Technische Universitat Munchen Institut fur Informatik Lehrstuhl
More informationArchitecture for Synchronous Groupware Application Development
Accepted in HCI 95 July 1995 Tokoy Japan Architecture for Synchronous Groupware Application Development Roland Balter, Slim Ben Atallah, Rushed Kanawati Unité Mixte Bull Imag/Systèmes 2, rue de Vignate,
More informationSolve the Data Flow Problem
Gaining Condence in Distributed Systems Gleb Naumovich, Lori A. Clarke, and Leon J. Osterweil University of Massachusetts, Amherst Computer Science Department University of Massachusetts Amherst, Massachusetts
More informationEnhancing Integrated Layer Processing using Common Case. Anticipation and Data Dependence Analysis. Extended Abstract
Enhancing Integrated Layer Processing using Common Case Anticipation and Data Dependence Analysis Extended Abstract Philippe Oechslin Computer Networking Lab Swiss Federal Institute of Technology DI-LTI
More information[BGH+97c] R. Breu, R. Grosu, C. Hofmann, F. Huber, I. Krüger, B. Rumpe, M. Schmidt, W. Schwerin. Exemplary and Complete Object Interaction
Exemplary and Complete Object Interaction Descriptions Ruth Breu, Radu Grosu, Christoph Hofmann, Franz Huber, Ingolf Kruger, Bernhard Rumpe, Monika Schmidt, Wolfgang Schwerin email: fbreur,grosu,hofmannc,huberf,kruegeri,rumpe,schmidtm,schwering
More informationApplication Programmer. Vienna Fortran Out-of-Core Program
Mass Storage Support for a Parallelizing Compilation System b a Peter Brezany a, Thomas A. Mueck b, Erich Schikuta c Institute for Software Technology and Parallel Systems, University of Vienna, Liechtensteinstrasse
More informationIndex Generation and Advanced Search Functions for. Muitimedia Presentation Material. Yahiko Kambayashi 3 Kaoru Katayama 3 Yasuhiro Kamiya 3
Index Generation and Advanced Search Functions for Muitimedia Presentation Material Yahiko Kambayashi 3 Kaoru Katayama 3 Yasuhiro Kamiya 3 Osami Kagawa 33 3 Department of Information Science, Kyoto University
More informationTWM Icon Manager Desktop graph. xterm emacs TWM Icon Manager. Desktop. Tree Browser. xterm. graph ABC. Hyperlink. Tree Browser. xterm.
Tcl and Tk Use in the Artifact Based Collaboration System John Menges Mark Parris 1 February 1, 1996 Abstract At the University of North Carolina Department of Computer Science we are developing the Artifact
More informationTHE IMPLEMENTATION OF A DISTRIBUTED FILE SYSTEM SUPPORTING THE PARALLEL WORLD MODEL. Jun Sun, Yasushi Shinjo and Kozo Itano
THE IMPLEMENTATION OF A DISTRIBUTED FILE SYSTEM SUPPORTING THE PARALLEL WORLD MODEL Jun Sun, Yasushi Shinjo and Kozo Itano Institute of Information Sciences and Electronics University of Tsukuba Tsukuba,
More informationVisual Intranet Interfaces and Architecture of Unified Information Space in the Concept of Virtual University at ZSU
Visual Intranet Interfaces and Architecture of Unified Information Space in the Concept of Virtual University at ZSU Vadim A. Ermolayev Zaporozhye State University, 66, Zhukovskogo st., 330600, Zaporozhye,
More informationCity Research Online. Permanent City Research Online URL:
Kloukinas, C., Saridakis, T. & Issarny, V. (1999). Fault Tolerant Access to Dynamically Located Services for CORBA Applications. Paper presented at the Computer Applications in Industry and Engineering
More informationFork Sequential Consistency is Blocking
Fork Sequential Consistency is Blocking Christian Cachin Idit Keidar Alexander Shraer May 14, 2008 Abstract We consider an untrusted server storing shared data on behalf of clients. We show that no storage
More informationConsolidation of Interacting BPEL Process Models with Fault Handlers
Consolidation of Interacting BPEL Process Models with Fault Handlers Sebastian Wagner, Oliver Kopp, and Frank Leymann Institute of Architecture of Application Systems, University of Stuttgart, Germany
More informationCooperative Planning of Independent Agents. through Prototype Evaluation. E.-E. Doberkat W. Hasselbring C. Pahl. University ofdortmund
Investigating Strategies for Cooperative Planning of Independent Agents through Prototype Evaluation E.-E. Doberkat W. Hasselbring C. Pahl University ofdortmund Dept. of Computer Science, Informatik 10
More informationAST: Support for Algorithm Selection with a CBR Approach
AST: Support for Algorithm Selection with a CBR Approach Guido Lindner 1 and Rudi Studer 2 1 DaimlerChrysler AG, Research &Technology FT3/KL, PO: DaimlerChrysler AG, T-402, D-70456 Stuttgart, Germany guido.lindner@daimlerchrysler.com
More informationApplication Programm 1
A Concept of Datamigration in a Distributed, Object-Oriented Knowledge Base Oliver Schmid Research Institute for Robotic and Real-Time Systems, Department of Computer Science, Technical University of Munich,
More informationOutline. Computer Science 331. Information Hiding. What This Lecture is About. Data Structures, Abstract Data Types, and Their Implementations
Outline Computer Science 331 Data Structures, Abstract Data Types, and Their Implementations Mike Jacobson 1 Overview 2 ADTs as Interfaces Department of Computer Science University of Calgary Lecture #8
More informationFlight Systems are Cyber-Physical Systems
Flight Systems are Cyber-Physical Systems Dr. Christopher Landauer Software Systems Analysis Department The Aerospace Corporation Computer Science Division / Software Engineering Subdivision 08 November
More informationsecond_language research_teaching sla vivian_cook language_department idl
Using Implicit Relevance Feedback in a Web Search Assistant Maria Fasli and Udo Kruschwitz Department of Computer Science, University of Essex, Wivenhoe Park, Colchester, CO4 3SQ, United Kingdom fmfasli
More information2 Data Reduction Techniques The granularity of reducible information is one of the main criteria for classifying the reduction techniques. While the t
Data Reduction - an Adaptation Technique for Mobile Environments A. Heuer, A. Lubinski Computer Science Dept., University of Rostock, Germany Keywords. Reduction. Mobile Database Systems, Data Abstract.
More informationFork Sequential Consistency is Blocking
Fork Sequential Consistency is Blocking Christian Cachin Idit Keidar Alexander Shraer Novembe4, 008 Abstract We consider an untrusted server storing shared data on behalf of clients. We show that no storage
More informationForward declaration of enumerations
Doc. no.: N2499=08-0009 Date: 2008-01-09 Project: Programming Language C++ Reply to: Alberto Ganesh Barbati Forward declaration of enumerations 1 Introduction In C++03 every declaration
More informationA Comparison of Modelling Frameworks. Norwegian Institute of Technology, Trondheim, Norway. The close relationship between the elds is indicated by a
A Comparison of Modelling Frameworks for Software Processes and Information Systems Reidar Conradi, Geir Magne Hydalsvik, Guttorm Sindre, Norwegian Institute of Technology, Trondheim, Norway. Abstract.
More informationDesign Process Ontology Approach Proposal
Design Process Ontology Approach Proposal Grzegorz J. Nalepa 1 and Weronika T. Furma«ska 1 Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland gjn@agh.edu.pl,
More informationDistributed Composite Objects: A New Object Model for Cooperative Applications
Distributed Composite Objects: A New Object Model for Cooperative Applications Guray Yilmaz 1, Nadia Erdogan 2 1 Turkish Air Force Academy, Computer Eng. Dept., Yeşilyurt, 34149 İstanbul, Turkey g.yilmaz@hho.edu.tr
More informationA Framework for the Design of Mixed-Signal Systems with Polymorphic Signals
A Framework for the Design of Mixed-Signal Systems with Polymorphic Signals Rüdiger Schroll *1) Wilhelm Heupke *1) Klaus Waldschmidt *1) Christoph Grimm *2) *1) Technische Informatik *2) Institut für Mikroelektronische
More informationA SYSTEMATIC APPROACH FOR COMPONENT-BASED SOFTWARE DEVELOPMENT
A SYSTEMATIC APPROACH FOR COMPONENT-BASED SOFTWARE DEVELOPMENT Cléver Ricardo Guareis de Farias, Marten van Sinderen and Luís Ferreira Pires Centre for Telematics and Information Technology (CTIT) PO Box
More informationSynchronization Expressions: Characterization Results and. Implementation. Kai Salomaa y Sheng Yu y. Abstract
Synchronization Expressions: Characterization Results and Implementation Kai Salomaa y Sheng Yu y Abstract Synchronization expressions are dened as restricted regular expressions that specify synchronization
More informationA graphical user interface for service adaptation
A graphical user interface for service adaptation Christian Gierds 1 and Niels Lohmann 2 1 Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, 10099 Berlin, Germany gierds@informatik.hu-berlin.de
More informationAutomatic Code Generation for Non-Functional Aspects in the CORBALC Component Model
Automatic Code Generation for Non-Functional Aspects in the CORBALC Component Model Diego Sevilla 1, José M. García 1, Antonio Gómez 2 1 Department of Computer Engineering 2 Department of Information and
More informationRouting and Ad-hoc Retrieval with the. Nikolaus Walczuch, Norbert Fuhr, Michael Pollmann, Birgit Sievers. University of Dortmund, Germany.
Routing and Ad-hoc Retrieval with the TREC-3 Collection in a Distributed Loosely Federated Environment Nikolaus Walczuch, Norbert Fuhr, Michael Pollmann, Birgit Sievers University of Dortmund, Germany
More informationLIF Marseille, CNRS & University Aix{Marseille address: URL:
1D EFFECTIVELY CLOSED SUBSHIFTS AND 2D TILINGS BRUNO DURAND 1, ANDREI ROMASHCHENKO 2, AND ALEXANDER SHEN 2 1 LIF Marseille, CNRS & University Aix{Marseille E-mail address: Bruno.Durand@lif.univ-mrs.fr
More informationDocumentation Open Graph Markup Language (OGML)
Documentation Open Graph Markup Language (OGML) Version: July 10, 2012 Fakultät für Informatik Algorithm Engineering (Ls11) Technische Universität Dortmund 2 Contents 1 Introduction 5 2 Design and Design
More informationA taxonomy of race. D. P. Helmbold, C. E. McDowell. September 28, University of California, Santa Cruz. Santa Cruz, CA
A taxonomy of race conditions. D. P. Helmbold, C. E. McDowell UCSC-CRL-94-34 September 28, 1994 Board of Studies in Computer and Information Sciences University of California, Santa Cruz Santa Cruz, CA
More informationImportant Lessons. Today's Lecture. Two Views of Distributed Systems
Important Lessons Replication good for performance/ reliability Key challenge keeping replicas up-to-date Wide range of consistency models Will see more next lecture Range of correctness properties L-10
More informationDistributed Collaboration - Assignment 3: Replicated N-User IM
Distributed Collaboration - Assignment 3: Replicated N-User IM Date Assigned: Sep 24, 2009 1-user IM Completion Date: Oct 1, 2009 N-user IM Completion Date: Thu Oct 15, 2009 Deleted: 8 Objectives: Implement
More informationHidefumi Wakamatsu, Yuusuke Tanaka, Akira Tsumaya, Keiichi Shirase, and Eiji Arai
Representation and Planning of Deformable Linear Object Manipulation Including Knotting Hidefumi Wakamatsu, Yuusuke Tanaka, Akira Tsumaya, Keiichi Shirase, and Eiji Arai Dept. of Manufacturing Science,
More informationA Framework-Solution for the. based on Graphical Integration-Schema. W. John, D. Portner
A Framework-Solution for the EMC-Analysis-Domain based on Graphical Integration-Schema W. John, D. Portner Cadlab - Analoge Systemtechnik, Bahnhofstrasse 32, D-4790 Paderborn, Germany 1 Introduction Especially
More informationwhen a process of the form if be then p else q is executed and also when an output action is performed. 1. Unnecessary substitution: Let p = c!25 c?x:
URL: http://www.elsevier.nl/locate/entcs/volume27.html 7 pages Towards Veried Lazy Implementation of Concurrent Value-Passing Languages (Abstract) Anna Ingolfsdottir (annai@cs.auc.dk) BRICS, Dept. of Computer
More informationTEMPORAL AND SPATIAL SEMANTIC MODELS FOR MULTIMEDIA PRESENTATIONS ABSTRACT
TEMPORAL AND SPATIAL SEMANTIC MODELS FOR MULTIMEDIA PRESENTATIONS Shu-Ching Chen and R. L. Kashyap School of Electrical and Computer Engineering Purdue University, West Lafayette, IN 47907-285, U.S.A.
More informationT U M I N S T I T U T F Ü R I N F O R M A T I K. Towards a Formalization of the Unified Modeling Language
T U M I N S T I T U T F Ü R I N F O R M A T I K Towards a Formalization of the Unified Modeling Language Ruth Breu, Ursula Hinkel, Christoph Hofmann, Cornel Klein, Barbara Paech, Bernhard Rumpe, Veronika
More informationIn both systems the knowledge of certain server addresses is required for browsing. In WWW Hyperlinks as the only structuring tool (Robert Cailliau: \
The Hyper-G Information System Klaus Schmaranz (Institute for Information Processing and Computer Supported New Media (IICM), Graz University of Technology, Austria kschmar@iicm.tu-graz.ac.at) June 2,
More informationCL/TB. An Allegro Common Lisp. J. Kempe, T. Lenz, B. Freitag, H. Schutz, G. Specht
CL/TB An Allegro Common Lisp Programming Interface for TransBase J. Kempe, T. Lenz, B. Freitag, H. Schutz, G. Specht TECHNISCHE UNIVERSIT AT M UNCHEN Institut fur Informatik Orleansstrasse 34 D-8000 Munchen
More informationUniversity of Groningen. Agilo Guicking, Axel; Tandler, Peter; Avgeriou, Paraskevas. Published in: EPRINTS-BOOK-TITLE
University of Groningen Agilo Guicking, Axel; Tandler, Peter; Avgeriou, Paraskevas Published in: EPRINTS-BOOK-TITLE IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF)
More informationIssues on Decentralized Consistency Checking of Multi-lateral Collaborations
Issues on Decentralized Consistency Checking of Multi-lateral Collaborations Andreas Wombacher University of Twente Enschede The Netherlands a.wombacher@utwente.nl Abstract Decentralized consistency checking
More informationRefine boundary at resolution r. r+1 r. Update context information CI(r) based on CI(r-1) Classify at resolution r, based on CI(r), update CI(r)
Context Based Multiscale Classication of Images Jia Li Robert M. Gray EE Department EE Department Stanford Univ., CA 94305 Stanford Univ., CA 94305 jiali@isl.stanford.edu rmgray@stanford.edu Abstract This
More informationIntegrated Version and Transaction Group Model for Shared Engineering Databases
Data & Knowledge Engineering Integrated Version and Transaction Group Model for Shared Engineering Databases D. Roller *, O. Eck, S. Dalakakis Institute für Informatik, Universität Stuttgart, Breitwiesenstr.
More informationUtilizing Static Analysis for Programmable Logic Controllers
Sébastien Bornot Ralf Huuck Ben Lukoschus Lehrstuhl für Softwaretechnologie Universität Kiel Preußerstraße 1 9, D-24105 Kiel, Germany seb rhu bls @informatik.uni-kiel.de Yassine Lakhnech Verimag Centre
More informationB2 if cs < cs_max then cs := cs + 1 cs := 1 ra
Register Transfer Level VHDL Models without Clocks Matthias Mutz (MMutz@sican{bs.de) SICAN Braunschweig GmbH, Digital IC Center D{38106 Braunschweig, GERMANY Abstract Several hardware compilers on the
More informationRequirements Stage Design(Architecture)
Design and Evaluation of Distributed Component-Oriented Software Systems Michael Goedicke Torsten Meyer Specication of Softwaresystems, Dept. of Mathematics and Computer Science, University of Essen, Germany
More information5.2 Reo2MC: description and implementation
Chapter 5 Tool implementation 5.1 Introduction The growing complexity and importance of coordination models in software applications necessarily lead to a higher relevance of performance issues for coordinators
More informationAuthoring and Maintaining of Educational Applications on the Web
Authoring and Maintaining of Educational Applications on the Web Denis Helic Institute for Information Processing and Computer Supported New Media ( IICM ), Graz University of Technology Graz, Austria
More information15-122: Principles of Imperative Computation
15-122: Principles of Imperative Computation Lab 0 Navigating your account in Linux Tom Cortina, Rob Simmons Unlike typical graphical interfaces for operating systems, here you are entering commands directly
More informationAutolink. A Tool for the Automatic and Semi-Automatic Test Generation
Autolink A Tool for the Automatic and Semi-Automatic Test Generation Michael Schmitt, Beat Koch, Jens Grabowski and Dieter Hogrefe University of Lubeck, Institute for Telematics, Ratzeburger Allee 160,
More informationDIFF AND MERGE FOR NET-DISTRIBUTED APPLICATIONS IN CIVIL ENGINEERING
DIFF AND MERGE FOR NET-DISTRIBUTED APPLICATIONS IN CIVIL ENGINEERING Torsten Richter 1, and Karl Beucke 2 ABSTRACT During the planning process in civil engineering collaborative work can be mainly characterized
More informationAn Editor for the Rapid Prototyping of. Cadlab, Fuerstenalle 11, Paderborn, Germany
s3 s1 s2 s3 s23 s5 An Editor for the Rapid Prototyping of EXPRESS-G Models R. Zhao, W. Mueller, H.-J. Kaufmann, Th. Kern, F. Buijs Cadlab, Fuerstenalle 11, 33102 Paderborn, Germany 1 Introduction The new
More informationAccess Control for Shared Resources
Access Control for Shared Resources Erik Wilde and Nick Nabholz Computer Engineering and Networks Laboratory (TIK) Swiss Federal Institute of Technology (ETH Zürich) Abstract Access control for shared
More information2 J. Karvo et al. / Blocking of dynamic multicast connections Figure 1. Point to point (top) vs. point to multipoint, or multicast connections (bottom
Telecommunication Systems 0 (1998)?? 1 Blocking of dynamic multicast connections Jouni Karvo a;, Jorma Virtamo b, Samuli Aalto b and Olli Martikainen a a Helsinki University of Technology, Laboratory of
More informationUser Interface Reverse Engineering
User Interface Reverse Engineering Laurent Bouillon & Jean Vanderdonckt Université catholique de Louvain (UCL) School of Management (IAG) Unit of Information Systems (ISYS) Belgian Laboratory of Computer-Human
More information(Preliminary Version 2 ) Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science. Texas A&M University. College Station, TX
Towards an Adaptive Distributed Shared Memory (Preliminary Version ) Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, TX 77843-3 E-mail: fjhkim,vaidyag@cs.tamu.edu
More informationTowards the Performance Visualization of Web-Service Based Applications
Towards the Performance Visualization of Web-Service Based Applications Marian Bubak 1,2, Wlodzimierz Funika 1,MarcinKoch 1, Dominik Dziok 1, Allen D. Malony 3,MarcinSmetek 1, and Roland Wismüller 4 1
More informationTOWARDS A 3D SPATIAL QUERY LANGUAGE FOR BUILDING INFORMATION MODELS
TOWARDS A D SPATIAL QUERY LANGUAGE FOR BUILDING INFORMATION MODELS André Borrmann 1, Christoph van Treeck 1, and Ernst Rank 1 ABSTRACT The paper introduces the concept of a spatial query language for building
More informationStarting from late in the 20 th century, there has been an enormous growth of the computer and communication industries. As a
Σελίδα 1 από 8 IEEE DS ONLINE EXCLUSIVE CONTENT Collaborative Computing Computer Supported Collaborative Work: The case of a newspaper Andreas Veglis and & Andreas Pomportsis - Aristotle University of
More informationExtending real-time collaborative editing systems with asynchronous communication
Extending real-time collaborative editing systems with asynchronous communication Claudia-Lavinia Ignat and Moira C. Norrie Institute for Information Systems, ETH Zurich {ignat,norrie}@inf.ethz.ch Abstract
More informationProc. XVIII Conf. Latinoamericana de Informatica, PANEL'92, pages , August Timed automata have been proposed in [1, 8] to model nite-s
Proc. XVIII Conf. Latinoamericana de Informatica, PANEL'92, pages 1243 1250, August 1992 1 Compiling Timed Algebras into Timed Automata Sergio Yovine VERIMAG Centre Equation, 2 Ave de Vignate, 38610 Gieres,
More informationSiegfried Loer and Ahmed Serhrouchni. Abstract. SPIN is a tool to simulate and validate Protocols. PROMELA, its
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 00, 19xx Creating Implementations from PROMELA Models Siegfried Loer and Ahmed Serhrouchni Abstract. SPIN is a tool to simulate
More informationTagFS Tag Semantics for Hierarchical File Systems
TagFS Tag Semantics for Hierarchical File Systems Stephan Bloehdorn, Olaf Görlitz, Simon Schenk, Max Völkel Institute AIFB, University of Karlsruhe, Germany {bloehdorn}@aifb.uni-karlsruhe.de ISWeb, University
More informationHeuristic Evaluation of Groupware. How to do Heuristic Evaluation of Groupware. Benefits
Kimberly Tee ketee@ucalgary.ca CPSC 681 Topic Heuristic Evaluation of Groupware Heuristic evaluation [9] is a discount evaluation method for finding usability problems in a singleuser interface design.
More informationGenerating Diagram Editors Providing Free-Hand Editing as well as Syntax-Directed Editing
Generating Diagram Editors Providing Free-Hand Editing as well as Syntax-Directed Editing Oliver Köth and Mark Minas Lehrstuhl für Programmiersprachen Universität Erlangen-Nürnberg Martensstr. 3, 91058
More informationreasonable to store in a software implementation, it is likely to be a signicant burden in a low-cost hardware implementation. We describe in this pap
Storage-Ecient Finite Field Basis Conversion Burton S. Kaliski Jr. 1 and Yiqun Lisa Yin 2 RSA Laboratories 1 20 Crosby Drive, Bedford, MA 01730. burt@rsa.com 2 2955 Campus Drive, San Mateo, CA 94402. yiqun@rsa.com
More informationTelecommunication and Informatics University of North Carolina, Technical University of Gdansk Charlotte, NC 28223, USA
A Decoder-based Evolutionary Algorithm for Constrained Parameter Optimization Problems S lawomir Kozie l 1 and Zbigniew Michalewicz 2 1 Department of Electronics, 2 Department of Computer Science, Telecommunication
More information