ppxscal/embedding_network huggingface dataset:
Challenges of Knowledge Media Networking (Workshop Report)
Authors: Fawzi Daoud
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

A knowledge media assisted community is a conglomerate of social, technical, material, historic, and environmental factors, and technology design must be understood as one ingredient within this field of relationships. There's a need to understand how widely differing types of participants (e.g. people or agents with particular domain-or culture-specific viewpoints; specialized data-gathering instruments), represent problem- and domain-specific entities or processes (e.g., protein molecules; organizational workflows), of differing representational level (e.g., sensory; cognitive), scale and complexity, for use in unique domain-specific activities (e.g. doing bioscience or doing collaborative design) via a variety of representational media and modalities (text, software, graphical 2D/3D data, simulations, in visual, audio, haptic modalities, etc.), under a range of specific constraints (e.g. size limitations, specificity constraints).
An parallel diagnosis method for an optimal fault-tolerant network
Authors: Jae-Kwon Suh, Heok-Joung Kwon, Chung-Sei Rhee
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Recently, researchers have begun studying adaptive approaches to the diagnosable system. This paper overviews a class of optimally fault tolerant multiprocessor network architecture based on the network proposed by Pradhan and Sengupta. Because of optimal fault tolerance, the number of connections per node is precisely related to the degree of fault tolerance the network is designed to provide. Hakimi et al. assume that each unit is capable of testing every other unit using the test being conducted one at a time in such a way that the choice of the next test to be performed depends on the results of the previous tests rather than on a preselected pattern of test studied earlier. Rhee investigated the application of adaptive diagnosis approach to a D(n, t, X) system which belongs to the PMC model. In this paper, we investigate an application of the adaptive diagnosis approach to an optimally fault-tolerant multiprocessor network. The diagnosis algorithm developed here can be applied to a hypercube or a binary cube since the optimally fault-tolerant network is similar to a hypercube or a binary cube.
A Logic Programming Infrastructure for Remote Execution, Mobile Code and Agents
Authors: Paul Tarau, Verónica Dahl, Koenraad De Bosschere
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: We describe a set of programming patterns used for implementing a scalable infrastructure which supports remote execution mechanisms, mobile code and agents in a distributed logic programming framework. The particular focus of this paper is on the use of BinProlog's strong metaprogramming abilities. Some advanced logic programming constructs as intuitionistic implication, high-order call/N cooperate with encapsulated socket-level constructs for maximum configurability and efficiency. We show that strong metaprogramming is not a security threat if used through a set of filtering interactors which allow source level implementation of arbitrary security policies. Mobile code is implemented in a scalable way through a set of distributed client+server pairs interconnected through a master server acting only as an address exchange broker for peer-to-peer interactors. We have thoroughly tested our programming patterns and design principles through a realistic implementation in a widely used, freely available Prolog system (http://clement.info.umoncton.ca/BinProlog) as well as with its Java peers built on top of our unification enhanced Java based Linda implementation (http://clement.info.umoncton.ca/LindaInteractor).
Extended Flexible Processor Allocation Strategy for Mesh-Connected Systems Using Shape Manipulations
Authors: Kyung-Hee Seo, Sung-Chun Kim
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Current processor allocation techniques for mesh-connected parallel systems are restricted to rectangular submesh allocation strategies causing significant fragmentation problems. In this paper, we propose an EFPA (Extended Flexible Processor Allocation) strategy to reduce external fragmentation and job response time, simultaneously. EFPA manipulates the shape of the required submesh to a more generalized L-shaped submesh.When an incoming job requests a rectangular submesh, EFPA first tries to allocate the conventional rectangular submeshes as other strategies. If it fails, EFPA further tries to allocate more flexible and robust L-shaped submeshes instead of signaling the allocation failure.Thus, EFPA accommodates incoming job earlier than other strategies. All the shape manipulations to the L-shaped submeshes are transparent to the application programmers. Our simulations show that EFPA performs more efficiently than other strategies in terms of the external fragmentation and the job response time.
Coordinating Work on the Web with Workspaces
Authors: Robert Tolksdorf
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

Workflow management systems focus on coordinating work that is situated in the real world. A strong trend towards combining workflow and Internet technologies has recently evolved. Workspaces combines coordination technology and standard Internet technology to exhibit various benefits of explicit procedure representation, distributed and uncoupled architecture and ease of access. Its architecture is based on workflows as coordinated transformations of documents. Basic steps transform XML documents under the control of an XSL engine. Coordination operations affect the order of execution in the workflow. Finally, a meta step compiles a workflow graph represented in the XML-based Workspaces Coordination Language into a set of XSL rules for single transformation steps. Workspaces use a Linda-like data space for coordination via XML documents.
A Collaborative Infrastructure for Scalable and Robust News Delivery
Authors: Werner Vogels, Chris Re, Robbert van Renesse, Kenneth P. Birman
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper we describe the model used for the NewsWire collaborative content delivery system. The system builds on the robustness and scalability of Astrolabe to weave a peer-to-peer infrastructure for real-time delivery of news items. The goal of the system is todeliver news updates to hundreds of thousands of subscribers within tens of seconds of the moment of publishing. The system significantly reduces the compute and network load at the publishers and guarantees delivery even in the face of publisher overload or denial of service attacks.
Specifying Complex Process Control Aspects in Workflows for Exception Handling
Authors: Arthur H. M. ter Hofstede, Alistair P. Barros
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

Contemporary specification languages of workflow management systems focus on capturing process execution semantics. Constructs are offered that allow the specification of sequential execution, iteration, choice, parallelism and synchronisation. While in workflow modelling it is absolutely imperative that exceptions are dealt with properly, virtually no support for the specification of exception handling is offered at the conceptual level. Typically, exceptions and recovery strategies need to be defined using the programming primitives of the specific workflow management systems used. In this paper we propose a number of conceptual modelling primitives that can be used for the specification of exception handling in workflows. These primitives are illustrated using some real-life examples. A formal semantics is assigned to precisely define their meaning and demonstrating how they can be incorporated in a typical process modelling language.
Visualizing External Inter-Component Interfaces
Authors: Robert R. Roxas, Nikolay N. Mirenkov
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Despite the advances in software technology, there are still problems that need to be solved. They are related to understanding components, modifying them and their interfaces, etc., as well as to the practical use of Component-Based Development (CBD) for large-scale applications.Our approach is based on developing multiple view components of multimedia types. These multiple views can be divided into a few groups to represent different features of a component: (1) computational schemes of a corresponding component algorithm, (2) variables and formulas used in the algorithm, and (3) input/output (I/O) operations of the component. Such approach simplifies the understanding and manipulation of components.This paper discusses examples of visualizing I/O specifications which include the definition of data source and the corresponding target, scanning schemes applied to structures, conditions imposed upon different operations, etc. In other words, a visual language to define external inter-component interfaces is presented.
XML in a Multi-Tier Java/CORBA Architectur
Authors: Mehran Moshfeghi, Bart de Greef
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

We demonstrate three different methods of using XML in a multi-tier Java/CORBA system: (1) Personalized display of XML content with stylesheets.(2) A dynamic XML table-of-contents for an on-line help system.(3) Utilizing XML to represent and enforce valid request patterns for user simulations.These first two examples deal with the display of well-formed XML content, but do not touch on XML validity. The third example shows how XML representations of usage sessions can be validated against a DTD that specifies allowed usage patterns.
Inventing the Organizations of the New Economy
Authors: Thomas W. Malone
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Many people believe that we are now in a period of business changes as significant as those in the industrial revolution. This presentation suggested some provocative ideas about what some of these changes will be. For example, the talk described the possibilities of an "e-lance economy" where electronically connected free-lancers, joining together in temporary teams, will perform many of the tasks now performed by large companies.
Design, Implementation and Performance of a Mutex-Token based Fault-Tolerant Tuple Space Machine
Authors: Thomas Setz
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

LiPS ( Library for Parallel Systems} is a system for distributed computing using idle-cycles in networks of workstations. In its version 2.3, it is currently used at the Universitaet des Saarlandes in Saarbruecken, Germany to perform computationally intensive applications in the field of cryptography and computer algebra on a net of approximately 250 workstations. It should be enhanced to work on more than 1000 machines all over the world within the next years. The LiPS system provides its user with the tuple space based generative communication paradigm of parallel computing as known from the coordination language Linda.The core of the LiPS system is the Fault-Tolerant Tuple Space Machine replicating the tuple space. The implementation is set up on a mutex token based membership protocol for handling crashing and joining tuple space servers, and a closely related total order protocol which establishes a linear order among all tuples. The linear order on tuples is used to speed up replication of reading tuple space accesses and decreases the memory requirements for message logs. As it is possible to add or remove tuple space servers at runtime, efficiency/reliability can be adjusted to the application needs. 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
Minimizing communication in bitonic sorting software
Authors: Jae-dong Lee, Kyung-Hee Kwon, Young-Beom Park
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Two parallel sorting algorithms, GENERAL-BS and MINIMIZING-BS, which are implemented on shared-memory parallel computers, are presented in this paper. A parity strategy which gives an idea for the efficient usage of the local memory associated with each processor is introduced. The number of network accesses(or communications) of the algorithm MINIMIZING-BS is reduced by approximately one half compared with the algorithm GENERAL-BS. On the basis of decreasing the communication, the algorithm MINIMIZING-BS results in a significant improvement of performance.
Whoops!: A Clustered Web Cache for DSM Systems using Memory Mapped Networks
Authors: Emmanuel Cecchet
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper, we present Whoops!, a clustered web cache prototype based on SciFS, a Distributed Shared Memory (DSM) that benefits from the high performances and the remote addressing capabilities of memory mapped networks like Scalable Coherent Interface (SCI). Whoops! uses the DSM for all web cache management and cache storage. Using a memory mapped network and a DSM programming model allow us to investigate new algorithm to distribute and handle requests.We present a new implementation of TCP handoff that directly maps remote TCP/IP stacks through the network. This technique reduces processor overhead and forwards TCP acknowledgements in few microseconds.We have also designed Parallel Pull-Based LRU (PPBL), an efficient request distribution algorithm for use with DSM systems. Unlike other distribution algorithms the decision is distributed over all nodes thus providing better scalability. PPBL supports multi-frontend environments letting the DSM handle data distribution.Finally, Whoops! implements on the fly compression when fetching document from the Web and on the fly decompression when sending documents to clients. We show how this technique can reduce paging activity in the DSM and improve overall cache performance.
A Physically Grounded Approach to Coordinate Movements in a Team
Authors: Letizia Leonardi, Marco Mamei, Franco Zambonelli
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

This paper focuses on the problem of coordinating the movements of a cooperative team in an environment, and proposes an approach that takes inspiration from the laws of physics. The idea is to have the movements of team members driven by abstract force fields, generated by team members themselves (i.e., by carried-on devices) and propagated via some embedded infrastructure (or by team members in an ad-hoc way). A globally coordinated and self-organized behavior in team members' movements emerges due to the interrelated effects of team members following the shape of the fields and of dynamic fields re-shaping. A case study in the area of warehouse management is introduced to exemplify the proposed approach.
Efficient execution of parallel programs using partial strict triggering of program graph nodes
Authors: Milan Ojstersek, Viljem Zumer, Ljubo Pipan
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

Almost all coarse grained program graph nodes don't need all of their input operands at the beginning of their execution. Thereafter they can be scheduled a bit earlier. This type of program graph nodes triggering is called partial strict triggering. The missing operands will be requested later during the execution. Coarse grained program graph nodes send their output operand to all successors, as soon as they produce them. Successors of coarse grained program graph nodes will be scheduled earlier too, because they will receive their input operands sooner. An evaluation of improved CPM, VL and DSH scheduling algorithms is done in this paper. We have improved them with partial strict triggering of coarse grained program graph nodes.
An Efficient and Flexible Access Control Framework for Java Programs in Mobile Terminals
Authors: Hiroyuki Tomimori, Yukikazu Nakamoto
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The current Java Application Environment for mobile terminals provides a very restricted security mechanism which is known as "the sandbox model." Although 3rd Generation Partnership Project defines access control and permission framework of a Java program in the terminal as the security domain, the specification has problems such that implementation in theterminal becomes difficult because it requires content authentication for determining the domain. In order to solve the problems and increase flexibility of mobile software services, we propose an efficient and flexible access control framework for the Java program in the mobile terminal. This framework relates a security domain to a server and utilizes the server authentication in SSL in order to determine the domain which the program belong to. As a result, downloading the program and determining the domain becomes efficient. This framework is able to apply other information appliances.
Intrusion Detection: Systems and Models
Authors: Joseph S. Sherif, Tommy G. Dearmond
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

Organizations more often than not lack comprehensive security policies and are not adequately prepared to protect their systems against intrusions. This paper puts forward areview of state of the art and state of the applicability of intrusion detection systems, and models. The paper also presents a classification of literature pertaining to intrusion detection.
A Hierarchical Proxy Architecture for Internet-Scale Event Services
Authors: Haobo Yu, Deborah Estrin, Ramesh Govindan
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

The rapid growth of the Web has made it possible to build collaborative applications on an unprecedented scale. However, the request-reply interaction model of HTTP limits the range of applications that can be built. In this paper, we consider a complementary communication model- asynchronous event notification from servers to clients. Our focus in the paper is the design of an Internet-scale mechanism for event dissemination. Such a mechanism must scale to large numbers of participants and event types, as well as provide failure detection and handling. In this paper, we explore the design space of event dissemination architectures, and present a design of a hierarchical proxy architecture for event dissemination. Compared with previous approaches, our design reduces proxy states and provides failure detection and recovery mechanisms.
An equivalence algorithm to point out errors for basic LOTOS in a distributed system environment and its prototype
Authors: Byung-Ho Park, S. Kimura, Eun-Seok Lee, Norio Shiratori
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

LOTOS formal description technique (FDT) is applied to the formal description of distributed systems and the specification of OSI protocol layers. LOTOS is difficult to understand and to learn because it is based on a mathematical model. In this paper, for supporting the knowledge acquisition of learners studying basic LOTOS, we suggest a new algorithm that can verify an equivalence relation, find an error location, and correct an error when the error occurs at another process. Finally, we give an example of a prototype program for an educational support system for basic LOTOS.
Smart Clothes, Smart Rooms
Authors: Alex Pentland
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

We have been building a new generation of systems that combine wearable electronics with environmental infrastructure: smart clothes and smart rooms. The combination can provide simultaneous personal and public information spaces, allowing very fine-grain interaction between humans and digital assistants. One element of our efforts is that they attempt to be proactive: they learn individual's patterns of behavior, and then attempt to use that knowledge to guide action and interaction. 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
SCENTOR: Scenario-Based Testing of E-Business Applications
Authors: Jeremiah Wittevrongel, Frank Maurer
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

E-business software is often developed on a tight schedule, and testing needs to keep pace. Advice from proponents of approaches like Extreme Programming is that by testing continuously, it is actually possible to compress development cycles. In this paper we discuss a testing approach that supports developers with their task of creating automated functional test drivers for e-business applications. The main goal for the approach is to reduce the time and effort required to automate scenario tests for e-business applications. After motivating the approach, we give an abstract view of a tool designed and implemented to support the approach. Next, we give an example of its use, and finally proceed to a discussion of the architecture of the tool itself.
Publish/Subscribe vs. Shared Dataspace Coordination Infrastructures: Is It Just a Matter of Taste?
Authors: Nadia Busi, Gianluigi Zavattaro
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Two main architectural styles emerged in the panorama of inter-agent coordination infrastructures: the publish/ subscribe model, according to which agents communicate via the raising and catch of events, and the shared-dataspace-Linda-like-approach, in which communication is achieved by introducing and consuming objects from a common repository. In this paper we perform a rigorous comparison of the two approaches with a particular emphasis on their interchangeability; we obtain the following results: (i) the shared dataspace model can be reduced to the publish/subscribe architecture, while (ii) the vice versa holds only if a global coordination operation, such as copy-collect or inp, is provided among the shared dataspace operations.