Synthesis with rational environments

Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. The environment often consists of agents that have objectives of their own. Thus, it makes sense to soften the universal quantification on the behavior of the environment and take the objectives of its underlying agents into an account. Fisman et al. introduced rational synthesis: the problem of synthesis in the context of rational agents. The input to the problem consists of temporal logic formulas specifying the objectives of the system and the agents that constitute the environment, and a solution concept (e.g., Nash equilibrium). The output is a profile of strategies, for the system and the agents, such that the objective of the system is satisfied in the computation that is the outcome of the strategies, and the profile is stable according to the solution concept; that is, the agents that constitute the environment have no incentive to deviate from the strategies suggested to them. In this paper we continue to study rational synthesis. First, we suggest an alternative definition to rational synthesis, in which the agents are rational but not cooperative. We call such problem strong rational synthesis. In the strong rational synthesis setting, one cannot assume that the agents that constitute the environment take into account the strategies suggested to them. Accordingly, the output is a strategy for the system only, and the objective of the system has to be satisfied in all the compositions that are the outcome of a stable profile in which the system follows this strategy. We show that strong rational synthesis is 2ExpTime-complete, thus it is not more complex than traditional synthesis or rational synthesis. Second, we study a richer specification formalism, where the objectives of the system and the agents are not Boolean but quantitative. In this setting, the objective of the system and the agents is to maximize their outcome. The quantitative setting significantly extends the scope of rational synthesis, making the game-theoretic approach much more relevant. Finally, we enrich the setting to one that allows coalitions of agents that constitute the system or the environment.     

3DStreaming: an open-source flexible framework for real-time 3D streaming services

The progress of three-dimensional 3D technologies, together with the wide diffusion of both Internet and broadband technologies, is paving the way to emerging live streaming services which have been conceived for delivering 3D video contents in real-time fashion to end users. Nowadays, the only available tools supporting stereoscopic 3D video services cannot be freely downloaded and require the adoption of owner stereoscopic players. Motivated by the lack of an effective solution, we developed a freeware and open source 3D live streaming framework, namely 3DStreaming. It provides stereoscopic 3D live streaming services over the Internet. In particular, it realizes a complete server implementation, offering the support for any transmission protocol and encoding scheme, as well as the full compatibility with any network architecture (i.e., LAN, MAN, Internet, and so on). At the same time, it allows users to use the preferable stereoscopic player and to render the video through any technique available for the chosen player. The overall performances of the proposed tool have been presented by testing its behavior in several network configurations (i.e., by varying network topology, coding technique, 3D representation format, and average encoding rate). All the measured metrics, which include the number of RTP segments that are transmitted and received, the frame loss ratio, and the PSNR, fully demonstrate the right behavior of the implemented tool in all the considered scenarios. We believe that, thanks to its high flexibility, this tool can be exploited by researchers working on stereoscopic-3D related issues to design, test, and evaluate novel and innovative algorithms, protocols, and network architectures.     

Adaptive Census Transform: A novel hardware-oriented stereovision algorithm

This paper presents a new hardware-oriented approach for the extraction of disparity maps from stereo images. The proposed method is based on the herein named Adaptive Census Transform that exploits adaptive support weights during the image transformation; the adaptively weighted sum of SADs is then used as the dissimilarity metric. Quality tests show that the proposed method reaches significantly better accuracy than alternative hardware-oriented approaches. To demonstrate the practical hardware feasibility, a specific architecture has been designed and its implementation has been carried out using a single FPGA chip. Such a VLSI implementation allows a frame rate up to 68 fps to be reached for 640 × 480 stereo images, using just 80,000 slices and 32 RAM blocks of a Virtex6 chip.     

Energy efficient and reliable data delivery in urban sensing applications: A performance analysis

Urban sensing is an emerging application field for Wireless Sensor Networks (WSNs), where a number of static sensors is sparsely deployed in an urban area to collect environmental information. Data sensed by each sensor are, then, opportunistically transmitted to Mobile Nodes (MNs) that happen to be in contact. In the considered scenario, communications between MNs and sensors require paradigms with a minimal synchronization between devices, extremely fast and energy efficient, especially at the sensor side. To deal with the above issues, in [1] we proposed a hybrid protocol for data delivery from sensors to MNs, named Hybrid Adaptive Interleaved Data Protocol (HI). By combining Erasure Coding (EC) with an Automatic Repeat reQuest (ARQ) scheme, the proposed protocol maximizes the reliability of communications while minimizing the energy consumed by sensors. In this paper, we present an in-depth analysis of the HI performance. We provide an analytical evaluation by defining a flexible model to derive the probability of data delivery and exploiting it to investigate the performance over a wide range of parameters. Moreover, we perform an experimental study to evaluate the HI effectiveness on real sensor platforms. Specifically, we analyze the impact of resource constraints imposed by sensors on data delivery and provide a careful characterization of its actual consumption of resources.     

Improving the schedulability of soft real-time open dynamic systems: The inheritor is actually a debtor

This paper presents the Clearing Fund Protocol, a three layered protocol designed to schedule soft real-time sets of precedence related tasks with shared resources. These sets are processed in an open dynamic environment. Open because new applications may enter the system at any time and dynamic because the schedulability is tested on-line as tasks request admission. Top-down, the three layers are the Clearing Fund, the Bandwidth Inheritance and two versions of the Constant Bandwidth Server algorithms. Bandwidth Inheritance applies a priority inheritance mechanism to the Constant Bandwidth Server. However, a serious drawback is its unfairness. In fact, a task executing in a server can potentially steal the bandwidth of another server without paying any penalty. The main idea of the Clearing Fund Algorithm is to keep track of processor-time debts contracted by lower priority tasks that block higher priority ones and are executed in the higher priority servers by having inherited the higher priority. The proposed algorithm reduces the undesirable effects of those priority inversions because the blocked task can finish its execution in its own server or in the server of the blocking task, whichever has the nearest deadline. If demanded, debts are paid back in that way. Inheritors are therefore debtors. Moreover, at certain instants in time, all existing debts may be waived and the servers are reset making a clear restart of the system. The Clearing Fund Protocol showed definite better performances when evaluated by simulations against Bandwidth Inheritance, the protocol it tries to improve.     

Boosting text segmentation via progressive classification

A novel approach for reconciling tuples stored as free text into an existing attribute schema is proposed. The basic idea is to subject the available text to progressive classification, i.e., a multi-stage classification scheme where, at each intermediate stage, a classifier is learnt that analyzes the textual fragments not reconciled at the end of the previous steps. Classification is accomplished by an ad hoc exploitation of traditional association mining algorithms, and is supported by a data transformation scheme which takes advantage of domain-specific dictionaries/ontologies. A key feature is the capability of progressively enriching the available ontology with the results of the previous stages of classification, thus significantly improving the overall classification accuracy. An extensive experimental evaluation shows the effectiveness of our approach.