ppxscal/embedding_network huggingface dataset:
Performance of Multiple Links Over Single Link in STC104 Networks
Authors: Hyo Jong Lee, Byeong Yeol Song
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

There is a great demand for an efficient and reliable router in high performance parallel processing systems or data management networks. The fast routing chip, Inmos STC104 has been designed and now available in the market. The performance and characteristics of each different network topology, multistage networks, meshes, tori, and N-cubes are vital information to make decision on an appropriate network. This paper reviews the technology utilized in a fast packet switch STC104 and studies reliable routing algorithms for various network configurations. The performances of several configurations under a single link and multiple links environment are also simulated and compared.
Site-Based Mapping for Parallel Proxy Servers with Fewer TCP Connections
Authors: K. Y. Wong, K. F. Law, K. H. Yeung
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

There are many mapping schemes proposed in previous research on parallel proxy servers. The operations of these schemes are mainly URL-based, and therefore cannot fully benefit from the new persistent connection feature of HTTP/1.1. In this paper, we propose a site-based mapping scheme that forwards all requests targeting on the same web site to the same proxy server. The scheme then allows the proxy to use a single persistent connection to serve many client requests. The major advantage of the scheme is the reduction in the number of connection establishments. This reduction can save network bandwidth and reduce the user-experienced latency. Simulation results show that the proposed site-based scheme reduces 40%-70% of the connection setups and teardowns when compared to a traditional URL-based mapping scheme.
Solution of Path Problems Using Associative Parallel Processors
Authors: A. S. Nepomniaschaya
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper we study a question of representing a group of associative algorithms on an abstract model of the SIMD type with vertical data processing (the STAR--machine). This group includes the Warshall transitive closure algorithm, the Floyd shortest path algorithm and the Maggs--Plotkin minimal spanning tree algorithm. These algorithms are represented as the corresponding STAR procedures whose correctness is verified and time complexity is evaluated.
A Rule-Based Query Language for HTML
Authors: Mengchi Liu, Tok Wang Ling
Venue: Proceedings of the 7th International Conference on Database Systems for Advanced Applications (2001)

Abstract: With the recent popularity of the web, enormous amount of information is now available on line. Most web documents available over the web are in HTML format and are hierarchically structured in nature. How to query such web documents based on their internal hierarchical structure becomes more and more important. In this paper, we present a rule-based language called WebQL to support effective and flexible web queries. Unlike other web query languages, WebQL is a high level declarative query language with a logical semantics. It allows us to query web documents based on their internal hierarchical structures. It supports not only negation and recursion, but also query result restructuring in a natural way. We also describe the implementation of the system that supports the WebQL query language.
A Proposed Security Management Framework for the Global Information Community
Authors: James Coyle, James Demerest, Richard McAllister
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: A proposal is made for the definition, functions, architecture, and components of security management. The proposal addresses the need for security management from the perspectives of the security administrator, the security architect, and the product vendor. The emphasis is on the protection of information rather than the protection of systems. Fundamental concepts are offered for the security management of globally distributed systems that support multiple security policies. The relationships between security management, system management, communications network management, and security infrastructure management are explained.
Semi-Automatic Wrapper Generation for Internet Information Sources
Authors: Naveen Ashish, Craig A. Knoblock
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

To simplify the task of obtaining information from the vast number of information sources that are available on the World Wide Web (WWW), the authors are building information mediators for extracting and integrating data from multiple Web sources. In a mediator based approach, wrappers are built around individual information sources to translate between the mediator query language and the individual sources. They present an approach for semi-automatically generating wrappers for structured Internet sources. The key idea is to exploit formatting information in Web pages to hypothesize the underlying structure of a page. From this structure the system generates a wrapper that facilitates querying of a source and possibly integrating it with other sources. They demonstrate the ease with which they are able to build wrappers for a number of Web sources using their implemented wrapper generation toolkit.
Parallel Implementation of Composite Events
Authors: Michal Shmueli, Opher Etzion
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Composite events are required for many applications that require obtaining events from varioussources, correlating them, and activating appropriate actions. One of the major issues in composite event system is scalability. This paper reports on a research that follows the situation concept of the Amit system, and proposes a parallel execution model for the event composition. The paper describes the model and its difficulties, and shows its usefulness using simulation results
Access Control in Distributed Object Systems: Problems With Access Control Lists
Authors: S. V. Nagaraj
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

In this paper we look at some drawbacks of access control lists (ACL 's) that are in wide use.
Interest Based Collaboration Framework
Authors: R. K. Aditham, Rajiv Jain, Murali Srinivasan
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: This paper describes a framework for building synchronous collaborative applications. The goal of the architecture is to provide a dynamic and flexible medium for collaboration. The notion of dynamic interest specification and message passing is central to the architecture and is the basis for communication between collaborators and control of the framework and its services.
The Parallel Approximability of a Subclass of Quadratic Programming
Authors: Maria J. Serna, Fatos Xhafa
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper we deal with the parallel approximability of a special class of Quadratic Programming (QP), called Smooth Positive Quadratic Programming. This subclass of QP is obtained by imposing restrictions on the coefficients of the QP instance. The Smoothness condition restricts the magnitudes of the coefficients while the positiveness requires that all the coefficients be non-negative. Interestingly, even with these restrictions several combinatorial problems can be modeled by Smooth QP.We show NC Approximation Schemes for the instances of Smooth Positive QP. This is done by reducing the instance of QP to an instance of Positive Linear Programming, finding in NC an approximate fractional solution to the obtained program, and then rounding the fractional solution to an integer approximate solution for the original problem. Then we show how to extend the result for positive instances of bounded degree to Smooth Integer Programming problems. Finally, we formulate several important combinatorial problems as Positive Quadratic Programs (or Positive Integer Programs) in packing/covering form and show that the techniques presented can be used to obtain NC Approximation Schemes for "dense" instances of such problems.
Hydra: A Decentralised Group Key Management
Authors: Sandro Rafaeli, David Hutchison
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

Hydra is a scaleable decentralised architecture to create and distribute symmetric cryptographic keys to large multicast-based groups. The group is divided into a number of TTL-scoped regions in order to achieve flexible and efficient key management, particularly in face of group membership changes. Hydra does not employ a manager for subgroup managers, and hence, it is not vulnerable to failures of single entities.
Parallel R-Tree Search Algorithm on DSVM
Authors: Botao Wang, Hiroyuki Horinokuchi, Kunihiko Kaneko, Akifumi Makinouchi
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

Though parallel database systems have been extensively studied, as far as we know, the parallel algorithms of R-tree propsed so far are limited to one workstation with multiprocessors or multi disks, where parallel sorting algorithm or concurrent I/O is used to improve the performance.For the search of R-tree, multiple search paths from the root to leaves are traversed sequentially. This sequential traverse can be transformed into multiple parallel traverses based on multiple search paths, where the query is divided into subqueries which can be executed concurrently.In the paper, aiming at parallel I/O and CPU operations, we introduce a parallel R-tree search algorithm running on Distributed Shared Virtual Memory (DSVM), especially on Shusseuo which is an ODBMS providing global persistent object management on persistent DSVM. The related problems are discussed and the evaluations are made based on Shusseuo. Experimental results show that optimal performance can be reached in dealing with large volume of data.
Working Group Report on Information Infrastructure for Global and Virtual Enterprises
Authors: Peter Bertók, Martti Mäntyläa, Jim McGovern, George Fernandez
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Studies IT-based methods and tools to facilitate cooperation between people working at different locations in heterogeneous environments. Several important issues related to virtual enterprises are discussed, and contributions to their resolution offered. The issues covered include: geographical distance; dynamic properties; knowledge capture and sharing; conflict management; formal verification; scalability and extendibility; and security.
Integrating XML and Object-Based Programming for Distributed Collaboration
Authors: Vassil Roussev, Prasun Dewan, Naveen Koorakula, Sriram Sellappa
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

In this paper, we explore some of the new opportunities for distributed collaborative applications that emerge from the use of XML as a data specification language. We present two different approaches: the first one transparently adds asynchronous collaboration to applications whose persistent state is in XML format, while the second one helps build synchronous collaborative applications starting with an XML schema specification.Although the two approaches start with different assumptions, they both lead to the same problem-the need for a generic one-to-one conversion between objects and XML constructs. Using object properties, we define two variants of a conversion scheme for the two approaches.
Toward an Open Virtual Market Place for Mobile Agents
Authors: Larbi Esmahi, Petre Dini, Jean-Charles Bernard
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

This paper focuses on the issues involved when multiple mobile agents interact in multi-agent systems. The application is an intelligent agent market place, where buyer and seller agents cooperate and compete to process sales transactions for their owners.The market place manager acts as a facilitator by giving necessary information to agents and managing communication between agents, and also as a mediator by proposing solutions to agents or stopping them to get into infinite loops bargaining back and forth. The buyer and seller agents range from using hardcoded logic to rule-based inferencing in their negotiation strategies. However these agents must support some communication skills using KQML or FIPA-ACL. So in contrast with other approaches to multi-agent negotiation, we introduce an explicit mediator (market place manager) into the negotiation, and we propose a mediation process based on dependence theory [1] implemented by the manager.
STEAM: Event-Based Middleware for Wireless Ad Hoc Network
Authors: René Meier, Vinny Cahill
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

With the widespread deployment and use of wireless data communications in the mobile computing domain the need for middleware that interconnects the components that comprisea mobile application in distributed and potentially heterogeneous environments arises. Middleware utilizing an event-based communication model is well suited to address the requirements of the mobile computing domain, as it requires a less tightly coupled communication relationship between application components compared to the traditionalclient/server communication model. This is particularly useful with the use of wireless technology, where communication relationships amongst application components are established very dynamically during the lifetime of the components. Recent research in the area of event-based middleware for the mobile computing domain focuses on infrastructure network models for wireless data communication. In this paper, we present STEAM, an event-based middleware service that has been specifically designed for wireless local area networks utilizing the ad hoc network model. We argue that an implicit event model is best suited for the envisaged ad hoc environment and present our approach of exploiting a novel combination of three different types of event filter to address the problems related to thedynamic reconfiguration of the network topology as well as their impact on the scalability of a system and the timely delivery of events.
Summary Grids: Building Accurate Multidimensional Histograms
Authors: Pedro Furtado, Henrique Madeira
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

Data summarization is very important for many data analysis tasks. In this paper we propose a simple but efficient data summarization algorithm, which outputs a histogram for multidimensional data, and make a comparative study of its usage with different distributions and with existing algorithms. The idea is to iteratively grow and modify regions of homogeneous data. This is a different strategy from a commonly used strategy of iteratively fracturing subspaces using straight lines. This work compares both strategies and concludes that the new technique is better and helds good results. We also concluded that discriminate handling of outliers is important to provide good approximates.
The Web as a Learning Environment
Authors: Margaret Driscoll, Ronnie Thomson
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: This paper explores the economic, technical, and educational issues related to designing Symposium/sup TM/, a Web-based training delivery environment. In response to these demands, Symposium/sup TM/, a virtual classroom environment on the Web, has been created to provide live instructor-led real-time audio, and access to the vast resources of the Web. This form for Web-based training is distinguished by the tools provided to the instructor and the learners, and the educational characteristics of the learning experience.
Minimizing Protocol Processing in Multimedia Servers: Implementation and Evaluation of Network Level Framing
Authors: Pål Halvorsen, Thomas Plagemann, Vera Goebel
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Data servers for multimedia applications like News-on-Demand represent a severe bottleneck, because a potentially very high number of users concurrently retrieve data with high data rates. In the Intermediate Storage Node Concept (INSTANCE) project, we develop a new architecture for Media-on-Demand servers that maximizes the number of concurrent clients a single server can support. Traditional bottlenecks, like copy operations, multiple copies of the same data element in main memory, and checksum calculation in communication protocols are avoided by applying three orthogonal techniques: network level framing (NLF), zero-copy-one-copy memory architecture, and integrated error management. In this paper, we describe how to minimize the transport level protocol processing using NLF. In particular, we look at how NLF is implemented, and we present performance measurements indicating a large performance gain. The protocol execution is minimized to about 450 cycles per packet regardless of packet size, i.e., a reduction of about 87 % compared to 1 KB packets and more using larger packets. Consequently, the total server-side processing over-head is decreased by at least 50 %.
Composing Distributed Systems from Reusable Aspects of Behavior
Authors: Pertti Kellomäki
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Research on aspect oriented programming and specification has highlighted the need to deal with cross-cutting concerns that involve more than one implementation level component. Distributed systems are an important application area where cross-cutting concerns frequently emerge.We present a novel way of composing distributed behavior from reusable superposition steps. The steps are given in a joint action notation, which allows introducing logically related data and operations in several implementation level components simultaneously. A superposition step contains a description of the context in which it is applicable, and the additional structure to add to a specification.Aspects of collective behavior may overlap at the implementation level. To make it possible to separate aspects cleanly at the specification level, our specification method allows entities to be merged in composition to allow an implementation level entity to play multiple specification level roles.
Evaluating Collaborative Enterprises - A Workshop Report
Authors: Michelle P. Steve, Robert H. Allen
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

As part of the the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaboration conference (WETICE 2001), the Workshop on Evaluating Collaborative Enterprises continued from its debut last year exploring the issues surrounding the evaluation of collaborative enterprises. This exploration included methods and tools for evaluating collaborative software as well as application-specific evaluation experiences. This paper describes the workshop's mission, summarizes the nine workshop presentations and one demonstration, and presents the main themes emanating from this workshop. These include the need for integrated theories, the need for advances in evaluation techniques and tools, and the need to confront non-controlled variables in case studies.
A CORBA-based Approach to Design Gateways for Multidatabase Systems
Authors: Giuseppe Iazeolla, Andrea D'Ambrogio
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Transparent access to widespread enterprise information using uniform interfaces (e.g. WWW- based ones) is one of the main features of the Virtual Enterprise concept. This concept is based on a set of geographically distributed enterprise sites connected to a MDBS (Multi Data Base System), by an intranet facility, to obtain information integration, knowledge sharing and users collaboration. The MDBS is a system that provides access to data from a collection of DBSs (Data Base Systems), called component DBSs, that are heterogeneous and distributed. The integration of the component DBSs into the MDBS is performed by a complex of functions termed gateway. This paper describes the design of a gateway based on the distributed object computing (DOC) approach, and compliant to the CORBA (Common Object Request Broker Architecture) standard. The approach is shown to introduce savings in design complexity and cost. The details of the approach are described in a gateway case study for the integration of a relational DBS into a MDBS.
Quantifying Effect of Network Latency and Clock Drift on Time-Driven Key Sequencing
Authors: Geoffrey G. Xie, Cynthia E. Irvine, Timothy E. Levin
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Time-driven Key Sequencing (TKS) is a key management technique that synchronizes the session key used by a set of communicating principals based on time of day. This relatively low cost method of session key synchronization has been used in specialized distributed systems with low-end communicating devices where sessions are sparse and each session spans a short time period comprising a small number of messages.In this paper, we describe how TKS may be useful in several scenarios involving high speed computer networks. More importantly, we present a performance model of TKS and conduct a detailed analysis to determine the impact of clock drift and network latency on the required key refresh rate. We give the exact conditions for determining the range of adequate key refresh rates, and demonstrate that the derived conditions are sufficient to ensure that data are both protected and deliverable. Interestingly, these conditions may be used to obtain a key refresh rate that can tolerate a maximum amount of clock drift after other parameters inthe system are fixed.
WETICE 2002 Evaluating Collaborative Enterprises Workshop Report
Authors: Elaine M. Raybourn, Julian Newman
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

The present paper summarizes the presentations and ensuing discussions of the participants of the third Evaluating Collaborative Enterprises workshop that was part of the 11th annuall 2002 IEEE Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, held at Carnegie Mellon University, in Pittsburg, Pennsylvania. We describe the workshop's mission, introduce the five papers presented, and discuss the outcomes of Evaluating Collaborative Enterprises (ECE). Paper topics addressed the development of preliminary frameworks to guide evaluation of awareness support systems and Web accessibility, and experiences with lessons learned from specific collaborative applications that address mobile teams, multi-site distance collaboration, and group development of diagram artifacts.