The Playground Mediator: Visual Tool for Configuring and Debugging Distributed Applications

The Mediator is a visual configuration tool for use with The Programmers\u27 Playground distributed programming environment. With the Mediator, one can interactively launch distributed application modules, configured communication among the modules, observe communication patterns, interactively control module communication, kill running modules, and receive imported applications from a separate World Wide Web interface. This manual describes how to use the Mediator both as a stand-alone configuration tool and as a visual interface to the Playground Application Management System

Mediation of semantic web services in IRS-III

Business applications composed of heterogeneous distributed components or Web services need mediation to resolve data and process mismatches at runtime. This paper describes mediation in IRS-III, a framework and platform for developing WSMO-based Semantic Web Services. We present our approach to mediation within Semantic Web Services and highlight the role of WSMO mediator types when solving mismatches at the semantic level between a service requester and a service provider. We describe the components of our mediation framework and how it can handle data, goal and process mediation during the activities of selection, composition and invocation of Semantic Web Services

Examining the Relationships among Trust in Administrator, Distributed Leadership and School Academic Optimism

The purpose of this study was to examine the relationships among trust in administrator, distributed leadership and a school academic optimism based on teachers' perceptions and to examine the mediator role of distributed leadership in the relationship between the levels of trust in administrator and the school academic optimism .The participants were a total of 540 teachers employed in elementary, middle and high schools located in the Kadikoy district of Istanbul. The data were gathered through the "Trust in Administrator Scale", the "Distributed Leadership Scale" and the "School academic optimism Scale". Arithmetic mean, the Pearson Product-Moment Correlation Coefficient, and regression analysis were used for data analysis. The results showed that trust in administrators predicted the distributed leadership and the school academic optimism, while distributed leadership also predicted the school academic optimism. Additionally, distributed leadership was found to have a partial mediator role in the relationship between trust in administrator and school academic optimism

Distributed Signaling Games

A recurring theme in recent computer science literature is that proper design of signaling schemes is a crucial aspect of effective mechanisms aiming to optimize social welfare or revenue. One of the research endeavors of this line of work is understanding the algorithmic and computational complexity of designing efficient signaling schemes. In reality, however, information is typically not held by a central authority, but is distributed among multiple sources (third-party "mediators"), a fact that dramatically changes the strategic and combinatorial nature of the signaling problem, making it a game between information providers, as opposed to a traditional mechanism design problem. In this paper we introduce {\em distributed signaling games}, while using display advertising as a canonical example for introducing this foundational framework. A distributed signaling game may be a pure coordination game (i.e., a distributed optimization task), or a non-cooperative game. In the context of pure coordination games, we show a wide gap between the computational complexity of the centralized and distributed signaling problems. On the other hand, we show that if the information structure of each mediator is assumed to be "local", then there is an efficient algorithm that finds a near-optimal ($5$-approximation) distributed signaling scheme. In the context of non-cooperative games, the outcome generated by the mediators' signals may have different value to each (due to the auctioneer's desire to align the incentives of the mediators with his own by relative compensations). We design a mechanism for this problem via a novel application of Shapley's value, and show that it possesses some interesting properties, in particular, it always admits a pure Nash equilibrium, and it never decreases the revenue of the auctioneer

A contextual semantic mediator for a distributed cooperative maintenance platform.

International audiencePlatforms expand maintenance systems from centralized systems into e-maintenance platforms integrating various cooperative distributed systems and maintenance applications. This phenomenon allowed an evolution in services offered to maintenance actors by integrating more intelligent applications, providing decision support and facilitating the access to needed data. To manage this evolution, e-maintenance platforms must respond to a great challenge which is ensuring an interoperable communication between its integrated systems. By combining different techniques used in previous works, we propose in this work a semantic mediator system ensuring a high level of interoperability between systems in the maintenance platform

Self-Organized Routing For Wireless Micro-Sensor Networks

In this paper we develop an energy-aware self-organized routing algorithm for the networking of simple battery-powered wireless micro-sensors (as found, for example, in security or environmental monitoring applications). In these networks, the battery life of individual sensors is typically limited by the power required to transmit their data to a receiver or sink. Thus effective network routing algorithms allow us to reduce this power and extend both the lifetime and the coverage of the sensor network as a whole. However, implementing such routing algorithms with a centralized controller is undesirable due to the physical distribution of the sensors, their limited localization ability and the dynamic nature of such networks (given that sensors may fail, move or be added at any time and the communication links between sensors are subject to noise and interference). Against this background, we present a distributed mechanism that enables individual sensors to follow locally selfish strategies, which, in turn, result in the self-organization of a routing network with desirable global properties. We show that our mechanism performs close to the optimal solution (as computed by a centralized optimizer), it deals adaptively with changing sensor numbers and topology, and it extends the useful life of the network by a factor of three over the traditional approach

Creating a Distributed Programming System Using the DSS: A Case Study of OzDSS

This technical report describes the integration of the Distribution Subsystem (DSS) to the programming system Mozart. The result, OzDSS, is described in detail. Essential when coupling a programming system to the DSS is how the internal model of threads and language entities are mapped to the abstract entities of the DSS. The model of threads and language entities of Mozart is described at a detailed level to explain the design choices made when developing the code that couples the DSS to Mozart. To show the challenges associated with different thread implementations, the C++DSS system is introduced. C++DSS is a C++ library which uses the DSS to implement different types of distributed language entities in the form of C++ classes. Mozart emulates threads, thus there is no risk of multiple threads accessing the DSS simultaneously. C++DSS, on the other hand, makes use of POSIX threads, thus simultaneous access to the DSS from multiple POSIX threads can happen. The fundamental differences in how threads are treated in a system that emulates threads (Mozart) to a system that make use of native-threads~(C++DSS) is discussed. The paper is concluded by a performance comparison between the OzDSS system and other distributed programming systems. We see that the OzDSS system outperforms ``industry grade'' Java-RMI and Java-CORBA implementations