ppxscal/embedding_network huggingface dataset:
A Framework for Connecting Home Computing Middleware
Authors: Eiji Tokunaga, Hiro Ishikawa, Makoto Kurahashi, Yasunobu Morimoto, Tatsuo Nakajima
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In the future, micro processors will be embedded in various appliances such as home appliances, digital AV appliances, and personal appliances. These appliances will be connected to various types of networks, such as Internet, and communicate with each other. The communication of appliances would integrate some services provided by these appliances and make new services.The future home computing environment requires home computing middleware on which we can control home appliances easily and develop new services without a great effort. Most of recent middleware for home computing such as Jini and HAVi has no compatibility and adaptability with each other. Therefore it is not easy for these appliances to communicate with other appliances which are controlled by any other middleware. Although there are some protocol bridges such as bridge between HAVi and Jini by Philips, Sony and Sun, these are almost only bridges of one and one. We need a framework with which we can integrate any middleware in a simpler way.In this paper, we propose a framework for connecting home computing middleware. It enables any appliance under any middleware's control to communicate any other appliances.We show also a service integration framework with Internet service and home computing middleware.
Towards an Inductive Design of Distributed Object Oriented Databases
Authors: Fernanda Araujo Baião, Marta Mattoso, Gerson Zaverucha
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Cooperative Information Systems (CIS) often consist of applications that access shared resources such as databases. Since centralized systems may have a great impact on the system performance, parallel and distribution techniques are needed for attaining scalability. Distributed databases are, then, crucial for the development of cooperative applications. However, in order to improve performance, it is very important to design information distribution properly, which is the goal of Distribution Design. Considering the various difficulties embedded in the Design of Distributed Object Oriented Databases, this work presents an algorithm to assist distribution designers in their task. The analysis algorithm indicates the most adequate fragmentation technique (vertical, horizontal or mixed) for each class in the database schema, and we propose the use of a machine learning method - Inductive Logic Programming - to uncover some implicit issues to be considered in the distribution design, thus revising the proposed analysis algorithm.
Verifying Workflow Processes against Organization Security Policies
Authors: Carlos Ribeiro, Paulo Guedes
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Workflow applications for large complex organizations often need to cross several security domains, each with different management and specific security requirements. The resultant cross-dependency between the workflow specification and the security policy of each domain can be hard to manage without specific tools.This work presents a static analyzer that automatically verifies the consistency between workflow specifications written in WPDL (Workflow Process Definition Language) and organization security policies, written in a security language specially designed to express simultaneously several security policies.
WebVector: Agents with URLs
Authors: T. Goddard, Vaidy S. Sunderam
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Emerging web applications demand considerable network resources and, especially in science and engineering, considerable computational resources. The use of agents can eliminate bottlenecks in both areas, provided that their methods of computation and communication are not overly restricted. WebVector is an agent system that combines a flexible communication model with URL-based agent identification. Within this framework, resources can be centralized to support the current web-browser security model or distributed for efficiency. Interfacing with existing software can be as simple as adding a hyperlink to a file. We concentrate on cooperative applications: uploadable active resources, flexible multicast for maintaining shared-space state, and a variety of applications from distributed computation.
Real-Time Processing of Media Streams: A Case for Event-Based Interaction
Authors: Viktor S. Wold Eide, Frank Eliassen, Olav Lysne, Ole-Christoffer Granmo
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

There are many challenges in devising solutions for on-line content processing of live networked multimedia sessions. These include the computational complexity of featureextraction and high-level concept recognition, the massive amount of data to be analyzed under real-time requirements and the intricate correspondence between low-level features and high-level concepts. Our approach to these challenges is a distributed architecture consisting of interacting components encapsulating feature extraction and concept classifier algorithms. The purpose of the framework is to simplify the development of applications for the domain of on-line multimedia content processing.In this paper we focus on the architecture of the framework and argue that it fits well to the publish/subscribe interaction paradigm, leading to an event-based interaction model. Furthermore, we analyze different aspects of the application domain in more depth, such as requirements for scalability, reconfiguration, migration, event notification selection, filtering, and ordering. The main contribution of this paper is, that we for each aspect show how a suitableevent notification service may satisfy the corresponding requirements. We also describe parts of a framework prototype. In particular we report on how the event notification service used satisfies the identified requirements.
A Collaborative Access Model for Shared Virtual Environments
Authors: Steve Pettifer, James Marsh
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

As shared virtual environments move beyond mere exemplars of computer graphics techniques, and evolve more meaningful content, issues such as 'ownership' or 'access' become important. Some artefacts in synthetic environments have 'real world' counterparts and require 'real world' access control and security. Others are entirely synthetic, and may require more esoteric access control. In either case, support for access model definition is becoming an important consideration for the future of virtual environments. In this paper we explore the different types of access required by different styles of VE, and develop a novel access model appropriate for these situations.
Interaction of All IP Mobile Internet Devices with Networked Appliances in a Residential Home
Authors: J. Latvakoski, P. Pääkkönen, D. Pakkala, A. Tikkala, J. Remes, P. Välitalo
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper deals with the interaction of all ip mobile Internet devices with networked appliances in a residential home. Two novel mechanisms are described and demonstrated: pointing as an indication of user interest, and user interface loading from the home appliance to a mobile Internet device. The user pointing action is used as a source to both collecting the context information of the user, and triggering the execution of the user interface loading procedure. The provided mechanisms are described in the form of a use scenario, and implemented using a session initiation protocol (SIP) and an open service gateway (OSGi) platform.
Creating Genetic Applications for Informal Science Learning in Multi-User Virtual Environments or Virtual Worlds
Authors: Christopher Mahe, Margaret Corbit
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

At the Cornell Theory Center (CTC), Cornell University's high-performance computing and interdisciplinary research center, we have implemented a 3D multi-user virtual science museum, SciCentr. SciCentr is a virtual world based on Active Worlds client/server technology. Virtual worlds captivate users through touch (keyboard interaction), sound, and sight. These virtual environments can be applied to formal and informal science education in areas such as genetics, as well as to language learning and social studies. In this paper, we present a case study of our experience and attempt to identify some of the advantages of using this technology, design features of our implementation, and experiences we have had in managing the social interaction among educational users. More specifically, we will discuss pilot user experiences focused on crop genetics in SciCentr's Plant Breeding Beds and on the related SciFair exhibits, both examples of collaborative experiences in our virtual worlds.
Evaluation Challenges for a Federation of Heterogeneous Information Providers: The Case of NASA's Earth Science Information Partnerships
Authors: Catherine Plaisant, Anita Komlodi, Francis Lindsay
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

NASA's Earth Science Information Partnership Federation is an experiment funded to assess the ability of a group of widely heterogeneous earth science data or service providers to self organize and provide improved and affordable access to an expanding earth science user community. As it is self-organizing, the Federation is mandated to set in place an evaluation methodology and collect metrics reflecting the outcomes and benefits of the Federation. This paper describes the challenges of organizing such a federated partnership self-evaluation and discusses the issues encountered during the metrics definition phase of the early data collection. Our experience indicates that a large number of metrics will be needed to fully represent the activities and strengths of all partners, but because of the heterogeneity of the ESIPs, the qualitative data (comments accompanying the metric data and success stories) becomes the most useful information. Other lessons learned include the absolute need for online browsing tools to accompany data collection tools. Finally, our experience confirms the effect of evaluation as an agent of change, the best example being the high level of collaboration among the ESIPs, which can be in part attributed to the initial identification of collaboration as one of the important evaluation factors of the Federation.
An Active Replication Scheme for Mobile Data Management
Authors: Shiow-yang Wu, Yu-tse Chang
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

A replication scheme determines the number and location of replicas in a distributed system. Traditional static replication schemes do not perform well in mobile environment since the assumptions of fixed hosts and relatively static access patterns no longer hold. For effective data management in mobile environment, we propose a dynamic replication scheme which employs user profiles for recording user' mobility schedules, access behavior and read/write patterns, and actively reconfigures the replicas to adjust to the changes in user locations and system status. Simulation results demonstrate that the scheme can accurately predict the data requirement to facilitate effective replication, reduce response time, and increase data availability.
A Design Framework for Collaborative Browsing
Authors: Guillermo de Jesús Hoyos-Rivera, Jean-Pierre Courtiat, Thierry Villemur
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Collaborative Browsing has experienced an increasing popularity as a topic for both, academic research and commercial software development, due to mainly to the promise that it represents as an enabling technology for distant collaboration. In this paper, we present the results of an overview analysis of different proposals found in the literature, and show their main differences from the point of view of the conceptual models they use, and the practical solutions they provide. Based on this overview, we propose a framework for the design of collaborative Browsing Systems. Finally, we focus on the framework instantiation for the conceptual model and architecture we started to develop.
Synchronous Load Balancing in Hypercube Multicomputers with Faulty Nodes
Authors: Jaewon Seo, Sunggu Lee, Jong Kim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper presents a new dynamic load balancing algorithm for hypercube multicomputers with faulty nodes. The emphasis in our method is on obtaining global load information and performing task migration using ``short paths'' in a synchronous manner so that a minimal amount of communication overhead is required.To accomplish this, we present an algorithm for constructing a new logical topology from a hypercube topology with faulty nodes. This new topology is used to obtain the global load information and to perform task migration. Simulation results are used to evaluate the performance of our dynamic load balancing method. The proposed strategy shows good performance in the case of a small number of faulty nodes when compared with previous methods.
A Delivery Scheduling System by the Distributed Cooperative Multiple Agents
Authors: Hisao Koizumi, Jun Sawamoto, Hidekazu Tsuji, Kohshi Abe
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper. we propose a practical method for solving the delivery scheduling problem and discuss its implementation. The method is based on the distributed cooperative problem solving. In the delivery scheduling method, the covered region is partitioned into multiple subregions and each subregion is assigned a subproblem solving agent which takes care of the scheduling of drivers and trucks in the subregion. Integrating those subproblem solving agents, an integration-and-evaluation agent solves the total problem. By employing the distributed cooperative problem solving framework for the delivery scheduling problem, we achieved an easy incorporation of various evaluation parameters in the process of scheduling, efficient use and management of scheduling knowledge of various levels, and reduction of computer processing by division of the problem into subproblems.
Design and Implementation of Software Simulation Platform for ATM Switching Systems
Authors: So-Jeong Youn, YoungJoon Byun, Eui Hyun Paik, Young-Sik Chung, Byung-Sun Lee
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Since the target system, where the software for an ATM switching system will be loaded, has limited resources and various functional constraints, it is difficult to develop and test ATM software on the target system. Therefore, its development and testing are accomplished usually by a general UNIX system. However, testing environment developed until now has emphasized concurrent processing simulation of CHILL language, which means that there have been a great deal of restrictions in testing software of switching systems. In order to resolve this problem, we develop software simulation platform system (SSPS), which is a testing environment to observe and analyze actions of software of ATM switching systems by simulating target environment including the operating system of switching systems at a general UNIX system. SSPS is characterized in that it supports distributed concurrent environment, provides a communication function with an operation and management system, and facilitates extension to testing environment for other systems. The test coverage over all ATM S/W blocks has increased by SSPS.
A Provably Fastest Parallel Algorithm for the Recognition of the Consecutive Ones Property with Selected Applications
Authors: Lin Chen
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Presented here is a parallel algorithm that decides if an m by n (0, 1)-matrix has the consecutive 1's property for rows, and if so, turns the matrix into one with consecutive 1's in each row by column permutation. The algorithm runs in optimal O(log(mn)) time with O(M(m)n log m / m + M(n)m^2 log n / n^2) work on CREW PRAM, where M(n) denotes the processor bound for multiplying two n by n matrices in O(log n) time and is o(n^{2.376}). We then show that this procedure can recognize doubly convex bipartite graphs in O(log n) time with O(M(n)) processors. 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
Mobile Push: Delivering Content to Mobile Users
Authors: Ivana Podnar, Manfred Hauswirth, Mehdi Jazayeri
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The increasing popularity of information services that rely on content delivery in mobile environments motivates the need for a mobile push service ¿ an efficient and flexible content dissemination service that targets mobile users. We analyze the features of a mobile push service by investigating representative usage scenarios and propose an architecturefor mobile content delivery systems. The architecture is based on the publish/subscribe (P/S) paradigm which supports many-to-many interaction of loosely-coupled entities. We define the set of services that need to collaborate with the P/S infrastructure to address the dynamics of mobile environments.
Separating Introspection and Intercession to Support Metamorphic Distributed Systems
Authors: Eric P. Kasten, Philip K. McKinley, S. M. Sadjadi, Kurt Stirewalt
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Many middleware platforms use computational reflection to support adaptive functionality. Most approaches in-tertwine the activity of observing behavior (introspection) with the activity of changing behavior (intercession). This paper explores the use of language constructs to separate these parts of reflective functionality. This separation and "packaging" of reflective primitives is intended to facilitate the design of correct and consistent adaptive middleware. A prototype language, called Adaptive Java, is described in which this functionality is realized through extensions to the Java programming language. A case study is described in which "metamorphic" socket components are created from regular socket classes and used to realize adaptive behavior on wireless network connections.
Anomaly Detection Using Visualization and Machine Learning
Authors: Fumio Mizoguchi
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

Unauthorized access from inside or outside an organization has become a social problem in the last few years, making a system that can detect such accesses desirable. We therefore monitor normal activities using inductive logic programming (ILP) which is one of machine learning and detect anomalies. To ensure effective monitoring, we think the following two points must be considered. One point is automation of detection by ILP system, which is a rule generation engine that always induces and updates effective rules. The other point is providing a visualization tool that reflects induced rules to the detection system. This tool enables an administrator to understand detection situations. For automated detection, we provide the ILP system with an automatic parameter adjustment function. For the visualization tool, we apply the visualization technology of a hyperbolic tree.
Combining Region-Based Differential and Matching Algorithms to Obtain Accurate Motion Vectors for Moving Object in a Video Sequence
Authors: Chich-Ling Huang, Yuh-Ren Choo, Pau-Choo Chung
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Motion estimation plays an important role in image processing, since temporal information has been regarded as a promising feature for both image segmentation and video coding. In this paper, a hybrid approach is proposed to integrate differential (gradient-based) optical flow approach and region-based matching approach to search for the accurate object motion vectors. Our method adopts the Horn-Schunck optical flow constraint, in conjunction with several proposed techniques to convert the dense optical flow field to region-based motion field, and thereby suppress noises. The region-based matching approach is a modified version of traditional block-matching algorithm, so that it can operate in region-based mode, and thereby enhance the visual effectiveness near the edges. Therefore, the proposed hybrid method has the tendency to obtain the estimation of "true" object motion inherited bygradient-based approach, and also the superior visual effectiveness inherited by block-matching approach.
A Framework for the Next Generation of E-Commerce by Peer-to-Peer Contact: Virtual Private Community
Authors: Tadashige Iwao, Yuji Wada, Shigeichiro Yamasaki, Masatoshi Shiouchi, Makoto Okada, Makoto Amamiya
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

This paper proposes a new framework called Virtual Private Community (VPC) for the next generation e-commerce, in which users buy and sell products by peer-to-peer contact. VPC enables e-commerce to be carried out by employing simple definitions called policy packages. VPC offers an extended e-commerce transactions that enable flexible e-commerce services by transferring policy packages together with copyright protection information on users' products. VPC provides a new method in which users can start their businesses by using the simple definitions.
Class-Based Delta-Encoding: A Scalable Scheme for Caching Dynamic Web Content
Authors: Konstantinos Psounis
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Caching static HTTP traffic in proxy-caches has reduced bandwidth consumption and download latency. However, web-caching performance is hard to increase further due to the growing number of non-cachable dynamic web-documents. Delta-encoding is a promising technique that exploits temporal correlation among different snapshots of a dynamic document, and renders dynamic traffic cachable. It achieves this by combining a cachable, previous snapshot of a document, called base-file, with small difference-file, called delta, to generate the current snapshot of the document. However, it has not yet been deployed due to the significant scalability concerns related to the storage requirements for base-files on theserver-side.In this paper we introduce class-based delta-encoding, a scalable scheme to perform delta-encoding on dynamic web-traffic. The idea is to group documents into classes, and store one document per class on the server-side. Thus, the proposed scheme exploits both temporal correlation in a dynamically evolving document, and spatial correlation among different documents. Finally, we present an architecture to deploy the scheme, that is transparent to clients, proxy-caches, and web-servers. Experimental results report thatclass-based delta-encoding combined with compression reduces the bandwidth consumption by a factor of 30, and the latency perceived by most users by a factor of 10 on average, without suffering from enormous storage requirements on the server-side.