ppxscal/embedding_network huggingface dataset:
An Infrastructure for Collaborative Teleteaching
Authors: Katrin Franze, Olaf Neumann, Alexander Schill, Sandra Stocker
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Teleteaching is a typical application of collaborative environments. As a basis for implementing teleteaching scenarios, sophisticated distributed software platforms and advanced networking facilities are required. This paper presents such an infrastructure and discusses recent results with its experimental use. In addition to key technological issues such as multimedia information management and distribution, important other aspects of collaborative work are discussed in this context; examples are user interaction, content provision, and acceptance of given solutions. Evaluating the experiences with this collaborative environment, an extended, Java-based environment for advanced teleteaching scenarios has been designed. The paper discusses its architecture and components and gives an outlook to future implementation and evaluation tasks.
Trust-Aware Cooperation
Authors: Zoran Despotovic, Karl Aberer, Manfred Hauswirth
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In mobile teamwork environments two basic problems exist: how to discover someone based on a profile (skills, reputations) and how to assess that person's "credibility" (trust). A lot of work has been done on the issues of collecting and spreading reputations and subsequent computation of trust. The application of such data for decision making, however, is still missing. In this paper we present a solution for scheduling exchanges among participants of an online community which take into account their trustworthiness.
Augmenting Work-Greedy Assignment Schemes With Task Duplication
Authors: S. Manoharan
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper analyses the effect of task duplication on the assignment of task dependency graphs onto concurrent processor systems. It presents a scheme to augment work-greedy assignment schemes with task duplication. Such augmentation results in a time-complexity increase which is well below that of comparable assignment schemes with task duplication. The paper shows empirical results comparing the augmented assignment schemes. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A dynamic reconfiguration manager for graph-oriented distributed programs
Authors: Jiannong Cao, E. Chan, C. H. Lee, K. W. Yu
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Dynamic reconfiguration allows the system configuration to be changed while the system is in execution. It is definitely a desirable property for any large distributed system where dynamic modification and extension to the system and its applications are required. We have developed a software platform based on a graph-oriented model, which provides support for programming reconfigurable distributed applications. In this paper, we describe a dynamic reconfiguration manager for the graph-oriented distributed programming environment. The services and requirements of dynamic reconfiguration are identified, the architecture design of a dynamic reconfiguration manager is presented, and a central server-based prototypical implementation of the manager on a local area network of workstations is described.
A Visual Editor for Multimedia Application Development
Authors: Angela Guercio, Timothy Arndt, S. K. Chang
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Multimedia applications are becoming increasingly important in areas such as education (digital libraries, training, presentation, distance learning), healthcare (telemedicine, health information management, medical image systems), entertainment (video-on-demand, music databases, interactive TV), information dissemination (news-on-demand, advertising, TV broadcasting), and manufacturing (distributed manufacturing, distributed collaborative authoring)[1]. In this paper we introduce a visual software engineering tool which is part of a suite of tools called MICE used for the rapid prototyping of distributed multimedia applications.
Information Flow in a Purpose-Oriented Access Control Model
Authors: Masashi Yasuda, Takayuki Tachikawa, Makoto Takizawa
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In distributed applications, a group of multiple objects are cooperating to achieve some objectives. An object is modeled as a pair of data structure and operations. Each object is manipulated through an operation supported by the object and then the operation may further invoke operations of other objects, i.e. nested operations. The purpose-oriented access rules indicate what operation in each object can invoke operations of other objects. The information flow among the objects occur if the requests and responses of the operations carry some data. Only the purpose-oriented access rules which imply the legal information flow are allowed. In this paper, we discuss how to test the access rules if the information flow occurring in the nested invocation of the operations is legal.
A new interconnection network for parallel computer with low diameter
Authors: Nak-Keun Joo, Hyeong-Seok Lim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper, we propose and analyze the new interconnection network for parallel computer, called graycube. The graycube has the same number of nodes and edges as hypercube, but it's diameter is about one half of the equivalent hypercube. It has simple recursive structure, routing and broadcasting algorithms. Since hypercube can be embedded into graycube with dialation 2, algorithms developed based on hypercube are easily simulated in graycube. The basic properties, routing and broadcasting algorithms, and hypercube embedding are presented.
Information Services for the Web: Building and Maintaining Domain Models
Authors: Scott Kerr, Avigdor Gal, John Mylopoulos
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

The World Wide Web is serving as a leading vehicle for information dissemination by offering information services, such as product information, group interactions, or sales transactions. Three major factors affect the performance and reliability of information services for the Web: the distribution of information which has resulted from the globalization of information systems, the heterogeneity of information sources, and the sources instability caused by their autonomous evolution. This paper focuses on integrating existing information sources, available via the Web, in the delivery of information services. The primary objective of the paper is to provide mechanisms for structuring and maintaining a domain model for Web applications. These mechanisms are based on conceptual modeling techniques, where concepts are being defined and refined within a metadata repository through the use of instantiation, generalization and attribution. Also, active databases techniques are exploited to provide robust mechanisms for maintaining a consistent domain model in a rapidly evolving environment, such as the Web. Keywords: World Wide Web, Conceptual Modelling, Heterogeneous Information Systems.
Enhanced Training Environment for Minimally Invasive Surgery
Authors: Wolfgang Müller-Wittig, Gerrit Voss, Ulrich Bockholt, José Luis Los Arcos
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Rapid development of medical field, expanding knowledge base and new technologies require continuing medical education to achieve life long learning and to keep the surgeons up to date. Consequently, specific training is necessary to guarantee qualification of the surgeons. To overcome the current drawbacks of traditional training systems (on-the-job training, plastic models etc.) for laparoscopy/hysteroscopy an intelligent adaptable training environment has been realized using Virtual Reality (VR), Multimedia (MM) technology, and Intelligent Tutoring Systems (ITS).
Mobility Management of IP-Based Multi-tier Network Supporting Mobile Multimedia Communication Services
Authors: Ying-Hong Wang, Chih-Hsiao Tsai, Hui-Min Huang
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Wireless communication that provides voice only is not sufficient to support the necessity of user. It is an important feature of next generation wireless communication to offer this capability through mobile Internet. Mobile IP allows mobile hosts to change their location and reduce the losing probability of data packets in wireless communication networks. However, mobile IP still have some defects in handoff and route aspects. Therefore, cellular IP protocol is proposed for routing of IP diagrams to mobile stations and fast handoff control in a limited geographical area. It can cooperate with mobile IP to provide wide area mobility support. In this paper, a handoff method is proposed to improve Quality of Service and resource switchingmanagement to reduce data packet loss for mobile multimedia communication in cellular IP and mobile IP network.
Clinical Trial Automation: New, Revolutionary Therapies and Fewer Side-Effects using Mobile Internet Technologies
Authors: Ioana Singureanu
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

The objective of this paper is to show how mobile Internet technology such as WAP can be applied to automation of clinical trial research. Automation is expected to reduce human error and inaccurate information during clinical trials. This is important both for humanitarian and economic reasons: speeding up approval of new life-saving drugs, increasing the safety of clinical trials and correctly estimating side effects as well as increasing the ROI (return on investment) for sponsors of clinical trials by decreasing the cost of trials and shortening the time-to-market for new products.
Deriving a Role-Based Access Control Model from the OBBAC Model
Authors: Jean-Marie Kabasele-Tenday, Jean-Jacques Quisquater, Marc Lobelle
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

The Object-Based Access Control model(OBBAC), a conceptual access control model, has been proposed to deal with the high-level specification of a security policy in an Object-Oriented environment[7]. This model is based on the notion of security labels which, however, are associated to operations rather than to objects as in the classic label-based access control models. It was used to specify the security policy of a Distance Learning System [2]. The key issue that has arisen from the OBBAC model is the handling of security labels during the application development. The goal of the present paper is to prove that there exists a mapping from an OBBAC model to a Role-Based Access Control model (RBAC) which can be used to specify the system security policy.
Validation, Evaluation and Virtual Enterprise Research
Authors: Julian Newman
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Evaluation in the study of collaborative computing systems is a tender plant. Part of the problem lies in the multiplicity of paradigms and research cultures brought to bear upon CSCW, and part lies in the relative weakness of evaluators, compared with others, in the overall struggle for project resources. The paper illustrates these problems from three personal case studies, and argues for theoretically mediated evaluation as a goal towards which all CSCW evaluators should strive. Mediated evaluation will enhance the standing of evaluators by increasing their effectiveness as well as their knowledge.
Considerations and Requirements for Tools Supporting Mobile Teams
Authors: Mario Pichler, Thomas Hofer, Gerhard Leonhartsberger
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Product development processes increasingly happen in cooperations, where cooperation partners are dislocated in time and space. This leads to the fact that teamworkers have to be more and more mobile and brings us to the presumption that the support of spontaneous information exchange and mobile ad hoc interaction among team members will gain in importance. Some of the questions that have to be answered when building tools for supporting mobile teamwork as well as the requirements for such tools will be discussed in this paper.
Intrinsic References in Distributed Systems
Authors: Kave Eshghi
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The notion of intrinsic references, i.e. references based on the hash digest of the referent, is introduced and contrasted with that of physical references, where the referent is defined relative to the state of a physical system. A retrieval mechanism using intrinsic references, the Elephant Store, is presented. The use of intrinsic references in hierarchical data structures is discussed, and the advantages regarding version management, consistency and distributed storage are argued.
A Similarity-Based Soft Clustering Algorithm for Documents
Authors: K. Lin, Ravikuma Kondadadi
Venue: Proceedings of the 7th International Conference on Database Systems for Advanced Applications (2001)

Abstract: Document clustering is an important tool for applications such as Web search engines. Clustering documents enables the user to have a good overall view of the information contained in the documents that he has. However, existing algorithms suffer from various aspects; hard clustering algorithms (where each document belongs to exactly one cluster) cannot detect the multiple themes of a document, while soft clustering algorithms (where each document can belong to multiple clusters) are usually inefficient. We propose SISC (SImilarity-based Soft Clustering), an efficient soft clustering algorithm based on a given similarity measure. SISC requires only a similarity measure for clustering and uses randomization to help make the clustering efficient. Comparison with existing hard clustering algorithms like K-means and its variants shows that SISC is both effective and efficient.
Secure and Efficient Schemes to Entrust the Use of Private Keys
Authors: Kil-ho Shin
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

This paper presents a practical method which enables an owner of a private key to entrust the use of the key to an entrustee without exposing the actual key. The following are features of the method: it covers a wide variety of existing public-key cryptographic algorithms; it provides the owner of the private key with a means of preventing the entrustee from abusing the entrusted key beyond the limits which the key owner arbitrarily specifies; it only adds a very small, usually negligible, amount of overhead to calculations required in the base public-key cryptographic algorithm.An outline of our method is as follows. An owner of a private key issues to an entrustee a data called a ticket through the cooperation of a trusted third party. With the ticket, the entrustee can execute calculations, which yield the same results as those using the actual private key do. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Parallel discrete event processing of sequential computations
Authors: Nasser Kalantery
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Previous proposals for the application of discrete event methods to parallelization of sequential software have been based on the optimistic execution strategy. We present a new method which avoids optimistic execution. This is motivated by the observation that the control structure of a sequential program constitutes a temporal coordinate system which is exogenous to the program execution. The method employs a logical time mechanism and provides adaptive synchronisation for the distributed execution. Hence data dependent and/or conditional parallelism is released without the risk of coherency violation. The paper begins with a brief introduction to the parallel discrete event simulation paradigm. The efficient coarse grain mapping of conventional programs onto this paradigm is then discussed.
A Mobile Agent Clone Detection System with Itinerary Privacy
Authors: T. C. Lam, Victor K. Wei
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

We propose a system for the detection of unauthorized cloning of mobile agents by malicious hosts. The system can detect clones after the fact, identify the culprit, and then seek penalties. The agent migration protocol is offline (non-centralized). The itinerary of an agent isprivacy-protected. Our scheme is based on Wong's transferable extension [Won01] of Ferguson's single-term offline untraceable e-cash [Fer93]. The main technique is to map the clone detection problem to the double-spending problem in transferable e-cash, and then adopt and adapt existing solutions from the latter field.
Coordinating Java Agents with Multiple Coordination Language on the Berlinda Platform
Authors: Robert Tolksdorf
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: A coordination language for agent defines the kind of elements, operations to construct and deconstruct elements, and the actual coordination operations that manipulate a coordination medium. The family of Linda-like coordination languages has demonstrated this view most purely with operations that are based on the manipulation of a shared multiset of elements. With Berlinda a model is designed and implemented on which coordination languages a la Linda and beyond can be implemented. As examples a simple versions of Linda and a subset of KQML have been implemented. We use Berlinda to study the problem of interworking amongst multiple coordination environments. For Web access to agents we integrate the coordination environments into the Jigsaw Web-server.
Distributed Shared Memory on IBM SP2
Authors: S. Ramesh, R. Lakshmi, R. Govindarajan
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Distributed Shared Memory (DSM) approach provides the illusion of a global shared address space by implementing a layer of shared memory abstraction on a physically distributed memory system. In this paper, we present DSM-SP2, a software distributed shared memory system built on IBM SP2, a distributed memory machine. DSM-SP2 is implemented completely in software as a set of user-level library routines on top of the AIX operating system without requiring any modifications to the operating system or any additional compiler support. The salient features of DSM-SP2 are: (i) it implements lazy release consistency model with hybrid coherence protocol to reduce the communication overheads; (ii) it allows multiple concurrent writers to minimize the effects of false-sharing; (iii) to reduce the DSM overheads and the idling time of processes, the DSM-SP2 implementation allows multiple processes per node; and (iv) it implements a new synchronization primitive called conditional lock acquire/release for effective simple producer-consumer type of synchronization. Detailed performance measurements for three benchmark programs namely, Water, Jacobi and Tomcatv are reported.
Virtual Reality Transfer Protocol (VRTP) Design Rationale
Authors: Donald P. Brutzman, Michael Zyda, Kent Watsen, Michael R. Macedonia
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: The capabilities of the Virtual Reality Modeling Language (VRML) permit building large-scale virtual environments (LSVEs) using the Internet and the World Wide Web. However, the underlying network support provided by the hypertext transfer protocol (http) is insufficient for LSVEs. Additional capabilities for lightweight peer-to-peer communications and network monitoring need to be combined with the client-server capabilities of http. To accomplish this task, we present a detailed design rationale for the virtual reality transfer protocol (VRTP). VRTP is designed to support VRML in the same manner as http was designed to support HTML. Since VRTP must be highly optimized on individual desktops and across the Internet, a Cyberspace Backbone (CBone) is also needed for VRTP development and testing. VRTP appears to be a necessary next step in the deployment of all-encompassing interactive internetworked 3D worlds.
Characteristics of Group Development of Diagrams
Authors: Jeffrey D. Campbell
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

One contributing factor to the lack of wide spread usage of software for collaborative development of diagrams is the high degree of variability in the requirements for such software. The requirements are categorized here in terms of diagram characteristics and diagram creation strategies. Various measures are proposed to characterize a potential collaborative diagramming need and to compare it to potential software systems. The categories and measures are also appropriate for evaluating the match between existing software and specific requirements. They can serve to guide future collaborative diagram software development.
Transaction-Based Causally Ordered Protocol for Distributed Replicated Objects
Authors: Tomoya Enokido, Takayuki Tachikawa, Makoto Takizawa
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In group communications, larger computation and communication overhead are consumed to causally order all the messages transmitted in the network. Transactions in clients manipulate objects in servers by sending read and write requests to the servers. In this paper, we define significant messages by using the relation among the transactions. We newly propose an object vector to causally order only the significant messages. The scheme of the object vector is invariant in the change of the group membership. We also show a TBCO (transaction-based causally ordered) protocol which adopts the object vector, by which the number of messages to be causally ordered are reduced.