ppxscal/embedding_network huggingface dataset:
A Client Group-Server DBMS Architecture and Inter-Client Communication
Authors: K. Park, H. Kang
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Previous research on the client-server DBMS has focused on the client data caching schemes in the LAN-based client-server architectures. In this paper, we investigated the issue of client data caching in the WAN environment. In the WAN environment, it is common that many clients are clustered in some local area, connected to each other over a LAN, and often request the same data to the same remote server. To take advantage of such a characteristic, we considered a Client group-Server DBMS Architecture, in which the client s connected over a LAN in each local area form a client group and communicate with the server via a broker, a special client that belongs to the group and maintains cache consistency in its group on behalf of the server. We proposed the data caching scheme called ICCC(Inter-Client Communication Caching) that fits the client group-server DBMS architecture. In ICCC, cached data can be shared among clients within the group through inter-client communication under the intervention of their broker. We conducted simulation experiments to evaluate the performance of ICCC. The results showed that ICCC considerably outperformed the standard callback locking scheme employed in the WAN environment.
Towards the Observation of Spatial Events in Distributed Location-Aware Systems
Authors: Martin Bauer, Kurt Rothermel
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper, the event concept is applied to support the interaction between mobile users and distributed location-aware systems. Taking a number of examples, the components of an event specification language are derived that can be used beyond the domain of location-aware systems.
Design and Implementation of PROSYT: A Distributed Process Support System
Authors: Gianpaolo Cugola, Carlo Ghezzi
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

The paper describes the design and implementation of a process support system (PROSYT), which is intended to provide guidance in performing business processes and cooperation among people over a local or geographically distributed network. In particular, it can be used as a Process-centered Software Engineering Environment (PSEE) to support distributed software development.Our main purpose is to describe how complex applications of this kind can be developed systematically. In particular, how the requirements of high flexibility, reconfigurability, scalability, and efficiency demanded by these applications can be met through appropriate design choices.
Specifying and Detecting Composite Events in Content-Based Publish/Subscribe Systems
Authors: Simon Courtenage
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Content-based publish/subscribe systems mediate between publishers of information and subscribers who sign up to receive information, by routing messages across the network from their source of publication to the point of subscription using the message content. The routing information is derived from the subscriptions. One particular problem faced by content-based publish/subscribe systems is how to turn the speci£cation of complex subscriptions into routing information that can be distributed across the network.In this paper, we describe a new declarative language for specifying composite events based on the typed ë -calculus. Composite events are represented in this language by cur-riedfunctional expressions, i.e., functions that can be called with less arguments than parameters and which return as a result an updated version of the function with the remaining parameters. Events which are components of the composite event are passed as arguments to such expressions, and the resulting evaluation produces a functional expression which represents the current state of the composite event. A property of this language, derived from a property of the ë -calculus, is that results can be converted back to the expressions from which they were produced. We exploit this property to show how an expression representing a compositeevent can be converted into an expression from which routing information can be derived.
EWS-A Case Study on Access Control in Workflow Systems
Authors: Åsa Hagström, Viiveke Fåk, Mark Vandenwauver
Venue: Proceedings of the 9th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2000)

EWS is a workflow engine under development with specific requirements for the access control. We study a subset of these requirements, concerning work assignment, lockups and delegation issues. Three other systems - Changengine, FloWare and the Two-Schema Architecture - have been studied with respect to these problems, and we use the insights gained from these studies to give our own solutions to the problems. Changes that are made in the design of the system include new access modes, a structure for which access modes to use for which objects, a process document folder, and a delegation relation.
Performance Analysis and Experiments of Sorts on a Parallel Computer with Parallel Computation Models
Authors: Dongseung Kim, Ilhong Yoon
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper investigates the execution behaviors of parallel sorting algorithms on an experimental multiprocessor (KuPP) and compares with predicted performance under LogP and BSP (Bulk Synchronous Parallel) models. Since the communication overhead is considered a primary candidate for improvement, a few schemes are devised and experimented on KuPP to reduce the time spent in communication, thus to enhance the overall performance. The authors believe the ideas can be adopted in other high-performance parallel computers.
I/O and memory-efficient matrix multiplication with user-controllable parallel I/O
Authors: Jang Sun Lee, Sung-Yong Park, P. Bruce Berra, Sanjay Ranka
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

The UPIO (user-controllable parallel I/O) proposed by the authors in 1996 allows users to determine a file's structure by considering the access patterns of particular applications and the distribution of data for parallel access, and them do I/O collectively. This enables users to produce high-performance external computation codes by planning I/O, computations, communication, and the reuse of data effectively in the codes. They show how well UPIO produces high performance external computation codes by designing I/O and memory-efficient external matrix multiplication algorithms and exploring the effects of UPIO with the codes.
On the effectiveness of sectored caches in reducing false sharing misses
Authors: Kuang-Chih Liu, Chung-Ta King
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

In this paper we study the effectiveness of sectored caches in reducing false sharing misses on bus-based multiprocessors. In a sectored cache, each cache line is divided into several subblocks. A subblock is a basic coherence unit. When false sharing occurs, the involved cache line needs not be invalidated or transferred, as long as the corresponding subblocks are kept coherent. To facilitate the study, we extend the conventional MESI protocol to sectored caches and define a performance metric called the degree of false sharing reduction to quantify the false sharing reduction on such caches. We simulated the execution of typical benchmarks, FFT, LU, Radix, SORBYR and SORBYC, on sectored caches. Evaluation results show that our scheme can effectively reduce about 30% to 80% false sharing misses and avoid useless coherence operations.
A Multi-Agent Process Centered Environment Integrated with the WWW
Authors: Paolo Ciancarini, A. Fantini, Davide Rossi
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

We present Shadow, an environment for supporting the cooperative work of teams of software engineers engaged in geographically distributed software processes. Such an environment is designed and implemented over WWW middleware, and can be controlled by standard WWW browsers. Applications of this kind are complex and exciting examples of workflow systems. They need a suitable language to model the process and a suitable coordination architecture to build up the system. The Shade language, a coordination language based on the multiple tuple spaces coordination model, has been used as both process modeling language and as system design language.
Change Management with Roles
Authors: Sven-Eric Lautemann
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

Various proposals have been made to extend object-oriented languages and database systems with {\em roles} because they allow to weaken strict typing concepts and therefore can provide mechanisms for an object to change its type during its lifetime. But this so-called {\em object migration} is not the only advantage offered by a suitable role model.This paper studies the possibilities to use roles for a general change management system that also includes support for {\em schema evolution}. OPAQUE, as the selected role model, can be extended with schema update mechanisms in a surprisingly clean and straightforward way including the concepts of versions and views as well.
Execution Dependencies in Transaction Closures
Authors: Kerstin Schwarz, Can Türker, Gunter Saake
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Activities of advanced applications can be modeled by interrelated transactions. These relations can be described by different kinds of transaction dependencies. The notion of transaction closure is a generalization of nested transactions providing means to describe complex activities such as transactional workflows. In this paper, our main focus lies on execution dependencies for describing certain control flows among related transactions of transaction closures. In particular, we consider the transitivity property for all kinds of transaction execution dependencies and discuss their relationship to other kinds of dependencies such as transaction termination dependencies. We point out that some of these dependency combinations are incompatible. As a result we present rules for reasoning about the transitivity of execution dependencies. Thus, we are able to conclude how arbitrary transactions of a transaction closure are transitively interrelated.
Permutation Mapping for MIN Using High Level Net Models
Authors: Nabendu Chaki, Swapan Bhattacharya
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper proposes to structerise the analysis of the performance of MINs. A new type of High level net, named Modified Petri net (MP-net) which has subsequently been refined to S-net, has been defined in the process. Essentially, a variation of Coloured and Stochastic nets, this S-net has been shown to be a very effective tool for dynamic modelling of MINs. The results reported so far in the context of performance estimation of MINs, are mainly based on direct combinatorial analysis of the concerned networks with very little consideration towards the modelling aspects. The outcome of the present research work may be utilized for modelling of a wide range of MINs consisting of 2x2 cross-bar switches. Multistage redundant and non-redundant path networks have been considered and modelled with S-net as case study. It has also been established that using S-net, a MIN of NxN size can be modelled with 3N/2 number of places as against O(NlogN) number of switching elements for the equivalent MIN. Using the S-net model, connectivity status of constituent cross-bar switches of a MIN, has been represented in a matrix, proposed to be termed as Control matrix. An algorithm has been developed to study and modify entries of the Control matrix to analyze performance of MIN using S-net model.
Performance and Cost Analyses of Mobile Internet Multicast Protocols
Authors: Kuang-Hwei Chi, Chien-Chao Tseng, Wen-Kuang Chou
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper proposes performance analysis of two general approaches to IP multicasting in mobile environments. In the first approach, copies of each multicast datagram were forwarded to Mobility Agents in all wireless LANs on a campus. The other approach designated the Mobility Agent as a proxy (fixed host) for its local mobile hosts to participate in a communication group, thus allowing current multicast protocols on the wired backbone to be easily applied. We develop an analytical model for quantifying their performance metrics. Performance is measured in terms of the latency required for group members, fixed and mobile hosts, to receive a datagram addressed to them, network bandwidth required to accomplish a single multicast. Numerical results show that each approach can outperform the other in certain circumstances.
Separating the Navigational Aspect
Authors: Antonia M. Reina Quintero, Jesus Torres Valderrama
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

The first step given to separate concepts in web environments has been to take apart presentation from data. This split has been gotten due to the appearance of the ExtensibleMark-up Language (XML) and the application of style sheets. The new ideas from the advanced separation of concerns community and the new abstractions like aspects make us think this original division isn't rich enough. There are important concepts of Internet applications that should be defined separately. If we look at new web design methodologies,we can realize that one of these aspects is navigation. Following the way started by XML, we propose the use of the XML Linking Language (XLink) as a first stage to obtain the separation of the navigational aspect.
Managing Interaction Concerns in Web-Service Systems
Authors: Mary Stearns, Giacomo Piccinelli
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

Web services dramatically increase the reach of e-business. A homogeneous model that spans internal as well as external resources enables uniform solutions to complex business problems. Yet, the complexity of web-service-based systems increases exponentially with theirscope. Separation of crosscutting concerns and active management of aspects are fundamental in web-service-based solutions.In this paper, we first introduce web services and the concept of business interaction concerns. We then propose a process-oriented approach to the modelling of aspects deriving from crosscutting business concerns. We focus on the dynamic nature of web-service-basedsolutions, and the need for adaptive management of aspects. In particular, we propose a technique for the dynamic distribution of aspects across multiple web-service components. The technique is based on explicit definition of process roles.The proposed approach has been used to build experimental solutions involving dynamic reconfiguration of web-service system. We present an application example in the context of supply-chain integration that was prototyped using the DySCo platform (Dynamic e-ServiceComposer).
Interoperation of Independent, Heterogeneous and Distributed Databases. Methodology and CASE Support: the InterDB Approach
Authors: Ph. Thiran, Jean-Luc Hainaut, S. Bodart, A. Deflorenne, Jan-Marc Hick
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Accessing and managing data from several existing independent databases pose complex problems that can be classified into platform, DMS, location and semantic levels. This paper describes a general architecture, a methodology and a CASE environment intended to address the problem of providing users and programmers with an abstract interface to independent heterogeneous and distributed databases. The architecture comprises a hierarchy of mediators that dynamically transform actual data into a virtual homogeneous database. Each layer provides a certain kind of independence. The InterDB approach provides a complete methodology to define this architecture, including schema recovery through reverse engineering, database integration and mapping building. The methodology is supported by the DB-Main CASE tool that helps to generate the mediators and their repository.
Scene Context Dependent Key Frame Selection In Streaming
Authors: Anthony G. Nguyen, Jenq-Neng Hwang
Venue: Proceedings of the 22nd International Conference on Distributed Computing Systems (2002)

In this paper, we will describe the development of our Scene Context Dependent Key Frame Selection method to reduce the amount of recording video data. We propose the use of motion analysis (MA) to adapt to scene content in our Key Frame Selection Process. Based on the information generated by the motion analysis stage, frames in the video sequence which contain significant motion information will be selected to retain for recording. We also show that our proposed method performs better than traditional time-lapse recording method.
Enabling Personal Perspectives on Heterogeneous Information Spaces
Authors: Martin S. Lacher, Georg Groh
Venue: Proceedings of the 10th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2001)

Todays Internet holds a large number of information spaces, within which information is categorized according to some schema. Each categorization schema also represents a perspective on a knowledge domain. For access to different information spaces, a user has to adopt different perspectives. These differences in perspectives often prevent an ongoing exchange of information between information spaces. In this paper, we present a system (CAIMAN), which allows a user to maintain the same personal perspective on different information spaces. In addition to that, CAIMAN offers a set of services which facilitate the exchange of information between information spaces. These services support the user in browsing, retrieving information from and submitting information to different information spaces. To allow a user to maintain a personal perspective on different information spaces, we perform a mapping of the user's categorization schema to the categorization schemas of other information spaces.
Communication Visibility in Shared Virtual Worlds
Authors: Michael V. Capps, Seth J. Teller
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Though the service of shared virtual worlds is an active area of research, little effort has been made to optimize such systems for urban world spaces. Tracking the motion, action, and communication of thousands of users in a city requires a application of visibility for spatial and logical subdivision of updates. We propose herein the City-Level Optimizations for Virtual Environments (CLOVES) substrate for the MIT City Scan (automated urban geometry acquisition) project. CLOVES includes a generalized spatial subdivision optimized for visibility; a Graduated Visibility Set (GVS) generator; associated interest management techniques; and model service to distributed heterogeneous clients.
Reducing the Blocking in Two-Phase Commit Protocol Employing Backup Sites
Authors: P. Krishna Reddy, Masaru Kitsuregawa
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

In distributed data base systems (DDBSs), a transaction blocks during two-phase commit (2PC) processing if the coordinator site fails and at the same time some participant site has declared itself ready to commit the transaction. The blocking phenomena reduces availability of the system since the blocked transactions keep all the resources until they receive the final command from the coordinator after its recovery. To remove the blocking problem in 2PC protocol, three phase commit (3PC) protocol was proposed.Although 3PC protocol eliminates the blocking problem, it involves an extra round of message transmission, which further degrades the performance of DDBSs. In this paper, we propose a backup commit (BC) protocol by including backup phase to 2PC protocol. In this, one backup site is attached to each coordinator site. After receiving responses from all participants in the first phase, the coordinator communicates its decision only to its backup site in the backup phase. Afterwards, it sends final decision to participants. When blocking occurs due to the failure of the coordinator site, the participant sites consult coordinator's backup site and follow termination protocols. In this way, BC protocol achieves non-blocking property in most of the coordinator site failures. However, in the worst case, the blocking can occur in BC protocol when both the coordinator and its backup site fail simultaneously. If such a rare case occurs, the participants wait until the recovery of either the coordinator site or the backup site. BC protocol suits best for DDBS environments in which sites fail frequently and messages take longer delivery time. Through simulation experiments it has been shown that BC protocol exhibits superior throughput and response time performance over 3PC protocol and performs closely with 2PC protocol.
'1 + 1 > 2': Merging Distance and Density Based Clustering
Authors: Manoranjan Dash, Huan Liu, X. Xu
Venue: Proceedings of the 7th International Conference on Database Systems for Advanced Applications (2001)

Abstract: Clustering is an important data exploration task. Its use in data mining is growing very fast. Traditional clustering algorithms which no longer cater to the data mining requirements are modified increasingly. Clustering algorithms are numerous which can be divided in several categories. Two prominent categories are distance-based and density-based (e.g. K-means and DBSCAN, respectively). While K-means is fast, easy to implement, and converges to local optima almost surely, but it is also easily affected by noise. On the other hand, while density-based clustering can find arbitrary shape clusters and handle noise well, but it is also slow in comparison due to neighborhood search for each data point, and faces difficulty in setting density threshold properly. In this paper, we propose BRIDGE that efficiently merges the two by exploiting the advantages of one to counter the limitations of the other and vice versa. BRIDGE enables DBSCAN to handle very large data efficiently and improves the quality of K-means clusters by removing the noisy points. It also helps the user in setting the density threshold parameter properly. We further show that other clustering algorithms can be merged using similar strategy. An example given in the paper merges BIRCH clustering with DBSCAN.
How to Integrate Mobile Agents into Web Servers
Authors: Stefan Fünfrocken
Venue: Proceedings of the 6th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1997)

Abstract: Mobile agents are a new paradigm for communication and cooperation in distributed computing. To combine the new paradigm with the promising World Wide Web platform, we integrated mobile agents into Web Servers. In this way, mobile agents may travel from Web server to Web server to access their local data. The paper describes how we integrated mobile agents support into a Web server. We present the state of implementation, and we give an outlook on our future work.