ppxscal/embedding_network huggingface dataset:
Towards an Access Control Mechanism for Wide-Area Publish/Subscribe Systems
Authors: Zoltán Miklós
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The publish/subscribe communication model is increasingly considered for implementing middleware infrastructures for widely distributed applications. Scalability issues and routing algorithms of such systems have recently been the focus of intensive research. So far little attention has been given to security and management issues.In current publish/subscribe systems, malicious publishers can very easily insert bogus notifications which may propagated to a large number of subscribers. Moreover, there is no method to control what notifications the subscribers are authorized to receive.We describe a method to specify access control policy rules using expressions similar to subscription expressions. These policies define access rules for publish and subscribe functions and screening rules for notifications.
Techniques to provide Run-Time Support for solving Irregular Problems
Authors: Jaechun No
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper we present a runtime library design based on the two-phase collective I/O technique for irregular applications. The design is motivated by the requirements of a large number of ASCI (Accelerated Strategic Computing Initiative) applications, although the design and interface is general enough to be used from any irregular applications.We present two designs, namely, "Collective I/O" and "Pipelined Collective I/O". In the first scheme, all processors participate in the I/O at the same time, making scheduling of I/O requests simpler but creating a possibility of contention at the I/O nodes. In the second approach, processors are grouped into several groups, so that only one group performs I/O simultaneously, while the next group performs communication to rearrange data, and this entire process is pipelined. This reduces the contention at the I/O nodes but requires more complicated scheduling and a possible degradation in communication performance. We obtained up to 40 MBytes/sec. application level performance on the Caltech's Intel Paragon (with 16 IO nodes, each containing one disk) which includes on-the-fly reordering costs. We observed up to 60 MBytes/sec on the ASCI/Red machine with only three I/O nodes (with RAIDS).
XMLSpaces for Coordination in Web-Based Systems
Authors: Robert Tolksdorf, Dirk Glaubitz
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

XMLSpaces extends the Linda coordination language for Web-based applications. It supports XML documents as tuple fields and multiple matching routines implementing different relations amongst XML documents, including those given by XML query-languages. XMLSpaces is distributed with an encapsulated open distribution strategy.
Distributed Metadata Objects Using RDF
Authors: Bradley R. Bebee, Gregory A. Mack, Ibrahim Shafi
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Booz-Allen is helping to design and develop a Crisis Management System to provide collaborative analytical and presentation capabilities. To facilitate the distributed use of content information, content metadata is represented as C++ objects and operated upon using CORBA interfaces. Requiring that such applications implement CORBA interfaces to access metadata objects proved to be a barrier to integrating other applications with the system. Using the XML-based Resource Description Framework (RDF), a representation of the metadata was developed. This representation eases integration difficulties and facilitates more flexible usage of metadata by components and applications.This paper presents the development of a browser-based application used to evaluate the usability of distributed metadata objects represented in RDF. It describes the rationale behind using RDF as the metadata representation. The development of the application has proven the viability of using RDF to represent metadata.
Spy: A Method to Secure Clients for Network Services
Authors: Richard J. Lipton, S. Rajagopalan, Dimitrios N. Serpanos
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

A fundamental problem in security is to guarantee correct program behavior on an un-trusted computer regardless of a user's actions. The problem appears in Digital Rights Management, Secure Boot, e-appliances, etc. All existing approaches are either partial or undependable. Today, dependable security is necessary not only for e-commerce, but also to ensure that, under critical conditions of information warfare, remote clients behave predictablyand securely, and cannot compromise the infrastructure.We prove that the problem of correct program execution is unsolvable without adoption of a trusted hardware platform. Since it is impractical to consider as trusted a complex computer system, we identify the minimal hardwaresupport that enables a complete solution. We propose two simple hardware mechanisms, which require minimal change to the currently popular PC architecture: (i) the use of a trusted "sealed" computing device, the "spy", and (ii)a hardware interrupt, called "two minute warning", which has the highest priority and has a pre-defined time difference from any subsequent interrupt. Finally, we incrementally build upon this minimal hardware support larger and more complex applications with guaranteed security. We call this construction the inverse security pyramid.
Multimedia Customisation Using an Event Notification Protocol
Authors: Ricky Robinson, Andry Rakotonirainy
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Online personalisation is of great interest to companies. Event notification systems are becoming more and more popular as a natural candidate to provide personalised services.Although event notification protocols do not immediately spring to mind as the most sensible transport of real-time streams, our approach does utilise a content-based event notification protocol. In this paper we present an architecture able to correlate and filter real-time multimedia streams using an event notification protocol (Elvin) and the Real-Time Transport Protocol (RTP). We demonstrate, through simple examples, how a MPEG-2 stream can becustomised to the user in real-time based on his or her subscription. Such an architecture can serve as enabling technology to integrate, correlate and abstract different sources of information such as discrete and continuous events.
Enabling Cooperation among Disconnected Mobile Users
Authors: Justus Klingemann, Thomas Tesch, Jürgen Wäsch
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

Mobile computing and workgroup computing are emerging technologies which have so far been treated independently. Current approaches to support cooperative work neglect the special characteristics of mobile environments like limited bandwidth or temporary disconnection. On the other hand, approaches to support disconnected operation in mobile environments rely on the assumption that the degree of data sharing is low, which is obviously not appropriate for cooperative work. In this paper, we utilize the COACT (COoperative ACTivity) transaction model to provide support for parallel, disconnected activities. The model incorporates the notion of resolvable, simultaneous work. We show how the COACT 'merge' algorithm reduces conflicts by exploiting operational semantics and offering consistent sequences of operations. We believe that our new approach is a viable solution to the growing demand for cooperation in mobile environments.
Interworkflow System: Coordination of Each Workflow amoong Multiple Organizations
Authors: K. Hiramatsu, Ken-ichi Okada, Yutaka Matsushita, H. Hayami
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Nowadays, in many enterprises and so on, for the purpose of the efficiency improvement and the automation of the business, the "workflow management system of the business process" that a computer is highly used of is coming into wide use . At present, because workflow management system which is characteristic of each organization is introduced, though it is effective as a business support inside of a single organization, it is difficult to apply this management system to coordinate business among more than two organizations.As for this paper, it is related to Interworkflow system which supports business connection among multiple organizations which have different workflow management systems. We would like to propose Interworkflow system which consists of the following three sub-systems and has friendly user interface, and report on the fact that we have constructed an actual Interworkflow system that coordinates multiple workflow systems and confirm that it functioned effectively.Three-dimensional graphical modeling tool which users define Interworkflow. Translator and verifier which support constructing each workflow. Interworkflow administration system in distributed environment.
Constant Time Algorithms for Computing the Contour of Maximal Elements on the Reconfigurable Mesh
Authors: M. Manzur Murshed, Richard P. Brent
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

There has recently been an interest in the introduction of reconfigurable buses to existing parallel architectures. Among them Reconfigurable Mesh (RM) draws much attention because of its simplicity. This paper presents two O(1) time algorithms to compute the contour of the maximal elements of N planar points on the RM. The first algorithm employs an RM of size N x N while the second one uses a 3-D RM of size sqrt(N) x sqrt(N) x sqrt(N).
The Numeric Indexing For Music Data
Authors: Yu-lung Lo, Shiou-jiuan Chen
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The management of large collections of music data in a multimedia database has received much attention in the past few years. In the most of current works, the researchers extract the features from the music data and develop indices that will help to retrieve the relevant music quickly. Several reports have pointed out that these features of music can be transformed andrepresented in the forms of music feature strings. However, these approaches lack of scalability while increasing the music data. In this paper, we propose an approach to transform the music data into a numeric forms and develop an index structure base on R-tree for effective retrieval. The experimental results show that our approach outperforms existing string index approaches.
A Paradigm for Security Enforcement in CapBasED-AMS
Authors: Patrick C. K. Hung, Kamalakar Karlapalem
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

The CapBasED-AMS (CAPability-BASed and Event-Driven Activity Management System) deals with the management and execution of activities. A problem-solving agent (PSA) is a human, a hardware system or a software system having the ability to execute activities. An activity consists of multiple interdependent tasks that need to be coordinated, scheduled and executed by a set of PSAs. Since security is an essential and integral part of activities, the activity management system has to manage and execute the activities in a secure way. In the CapBasED-AMS, threats such as unauthorized access or modification are identified as events. The security pilferage or illegal violation of privacy through the accessing of specification-time, compile-time or run-time data from the activity management system and the PSAs is monitored, controlled and reported. We present a secure CapBasED-AMS by taking into consideration: the system infrastructure; secure match-making with additional security constraints; security policies and a secure PSA; the task coordination model for security resource control from the PSA viewpoint, the organization viewpoint, the task viewpoint and the activity viewpoint by adapting a role-based resource security model; and secure execution of tasks with the PSA role-based security model.
On Context-based Naming in Information Bases
Authors: M. Theodorakis, Panos Constantopoulos
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

In information bases following semantic and object-oriented data models logical names are used for the external identification of objects. Yet the naming schemes employed are not "natural" enough and several problems often arise: logical names can be ambiguous, excessively long, unrelated to or unable to follow the changes of the environment of named object. In natural language, similar problems are resolved by the context within which words are used. An approach to introducing a notion of context in an information base is to provide structuring mechanisms for decomposing it into possibly overlapping parts. The paper focuses on developing a context mechanism for an information base and, in particular, exploiting this mechanism for naming purposes. Rules are developed for generating meaningful names for objects by taking their context into account. This context-based naming enhances name readability, resolves name ambiguities, saves a lot of redundant name substrings, and it localizes and thus facilitates consistency checking, query processing and update operations. In modeling, it supports systematic naming of objects, and thus enhances cooperation between the designers and the end-users in the sense that the contents of the information base are more understandable by both of them.
Multi-agent based decision mechanism for distributed meeting scheduling system
Authors: Ahmed Ashir, Kwang Hyoun Joo, Tetsuo Kinoshita, Norio Shiratori
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In existing meeting scheduling systems, finding a common free time slot of all (prospective) participants is the goal. When such a free-time slot is not found, the host has to ask the busy participants to change their schedules. Changing a schedule is a complex process requiring a lot of negotiations and, there is no guarantee that the goal will be achieved. In the worst case the host has to ignore the time slot (which was probably the first choice) and try to schedule the meeting in another time slot (probably a lesser choice). The process will continue till the scheduling succeeds. We argue that it is not always necessary for all the participants to attend a meeting. There are some participants whose presence is mandatory for the meeting. The presence of other participants are non-mandatory. The meeting can proceed in the absence of some of the non-mandatory participants. This allows greater flexibility and more efficient scheduling. This paper introduces the concept of a Quorum in the meeting scheduling process and proposes a two-round negotiating protocol to find the time-slot which meets the quorum requirements. To establish the robustness of our scheduler, we simulated scheduling in our lab, and showed its flexibility in scheduling a meeting.
An Approach for Generating File Interfaces
Authors: Andreas Ebert, Uwe Hohenstein, Michael Höding
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

This paper deals with generating interfaces to files. The presented approach consists of two main parts: First, describing the file structure in an object-oriented manner, and second, manipulating the files by means of either SQL or ODMG2.0 object manipulation and querying. The principle of the approach is centered around a powerful specification language. Using this language, the structure of file contents is specified. Given such a specification, a generator automatically installs a corresponding relational database. Moreover, an adapter is generated that parses files and transfers the unstructured data from files to the structured relational database. Afterwards, the data can be handled by means of SQL. In addition, a semantic enrichment process can be used to achieve an object-oriented view of the data and an ODMG2.0 conforming access.
Distributed Supervisory System with Cooperative Multi-Agent FEP
Authors: Juichi Kosakaya, Aki Kobayashi, Katsunori Yamaoka
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

A large-scale distributed supervisory system that services a large area should ideally be capable of performing automatically optimal control based on various types of data provided by the controlled equipment. However, conventional systems have generally been configured so that pre-ordained transmission and reception processes are the input to the FEP (front end processor) unit according to various criteria of the data provided by the controlled equipment (e.g., the type and significance of the data, its priority, and its designated destination), while the host computer sends back a response to the controlled equipment based on the data transferred from the FEP according to preset optimal control algorithm. But to achieve fundamental improvements of system speed and reduce the load on the host computer, one must adopt the configuration in which the FEP can make automatic judgments regarding thecriteria of data provided by a diverse variety of controlled equipment, instead of having to devise system-wide algorithms based on predetermined criteria in the data provided by thecontrolled equipment. To configure an FEP for this sort of system, we propose a method where a plurality of programs that identify the conditions of a specific type of data are prepared separately and integrated by means of a multi-agent architecture.
Ultrafast compact CMOS dividers
Authors: Jean-Paul Theis, Harald Schlimper
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper introduces a new class of ultrafast and compact divider circuits. They are obtained by a systematic parallelization of a simple restoring division algorithm. Emphasis is put onto the stepwise parallelization methodology. Furthermore, a detailed discussion of implementational aspects is presented, including timing and layout. When, compared to SRT-schemes, these divider circuits allow a speed-up by a factor 2 to 3, while the cost is nearly identical. In particular, it is expected that double-precision IEEE Std. 756 floating-point division is performed within ca. 13 ns in 0.3 /spl mu/m, CMOS technology.
Application Integration Using Object Technology
Authors: Andrew Watson
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

The Object Management Group (OMG) has for ten years been building an architecture for application integration based on object technology. This architecture, called the Object Management Architecture, is the OMG's roadmap for developing a standard communication substrate (called CORBA) and a set of layered system services. An Interface Definition Language (OMG IDL) describes the interfaces between the components in a programming language- and implementation-independent manner.This talk describes the application integration problem, summarizes OMG's fast, open, industry-wide consensus-building standardization process, and the OMA and CORBA work that has sprung from it, and gives a brief outline of future developments at OMG, including CORBA 3.0 and OMG's use of XML.
Modeling of Train Control System and a Method of Assurance Evaluation
Authors: Masayuki Matsumoto, Tadao Tsurumaki, Dai Watanabe, Kinji Mori
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Assurance technology is a general term for technology that utilizes a system which considers the two elements of heterogeneity and adaptability. There are various needs in railway systems, so assurance properties are also being sought for train control systems. Coexistence of heterogeneous systems and adaptability for smooth system replacement are sought within daily operational changes. In this paper we model train control systems and propose an assurance evaluation method.
Improve HTTP/TCP Performance over ATM Networks: New Schemes and Performance Comparisons
Authors: Chin-Dong Wang, Ruay Shiung Chang
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper proposes a "selective packet retransmission" scheme for improving HTTP/TCP performance when transmitting through ATM networks. In selective packet retransmission, we utilize the property of human's perception tolerance for errors to determine whether to retransmit a corrupted TCP segment or not. For lossable data, such as image, when error occurs because of cell lost, it will not be retransmitted. The simulations show that, for the same buffer size and traffics load, selective packet retransmission results in higher throughput than PPD, EPD, and plain TCP over ATM.
Evaluation of a Publish/Subscribe System for Collaborative and Mobile Working
Authors: Pascal Fenkam, Engin Kirda, Schahram Dustdar, Harald Gall, Gerald Reif
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

The MObile Teamwork Infrastructure for Organizations Networking (MOTION)1 service platform that we have designed and implemented addresses an emerging requirement in the daily business of large, distributed enterprises: support for mobile teamwork. Employees are often on the move and use a wide range of computing devices such as WAP phones, PDAs, notebooks and desktop computers. The service architecture that we have developed supports mobile teamwork by providing multi-device service access, XML meta data for information sharing and locating, and the XML Query Language (XQL) for distributed searchesand publish/subscribe. We present the solution that we adopted in our prototype, analyze the shortcomings of this approach and based on our evaluation experiences, list the requirements for a publish-subscribe middleware for collaborative mobile working.
Early Separation of Filter and Refinement Steps in Spatial Query Optimization
Authors: Ho-Hyun Park, Chan-Gun Lee, Yong-Ju Lee, Chin-Wan Chung
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

The spatial query has been processed in two steps, the filter step and the refinement step, due to a large volume and high complexity of the spatial data. However, this approach has been considered only in the query execution phase after completing the query optimization phase. This paper presents query optimization strategies which take the characteristics of spatial databases into account. The first strategy is the separation of filter and refinement steps not in the query execution phase but in the query optimization phase.As the second strategy, several refinement operations can be combined in processing a complex query, and as the third strategy several filter operations can also be combined. We call the optimization technique utilizing these strategies the Early Separated Filter And Refinement (ESFAR). This paper also presents a rule-based optimization technique for ESFAR.