Approximation algorithms for the arc orienteering problem

In this article we present approximation algorithms for the Arc Orienteering Problem (AOP). We propose a polylogarithmic approximation algorithm in directed graphs, while in undirected graphs we give a (6+?+o(1))$(6+?+o(1))$ and a (4+?)$(4+?)$-approximation algorithm for arbitrary instances and instances of unit profit, respectively. Also, an inapproximability result for the AOP is obtained as well as approximation algorithms for the Mixed Orienteering Problem.     

JAID: An algorithm for data fusion and jamming avoidance on distributed sensor networks

Mobile Agent (MA) technology has been recently proposed in Wireless Sensor Networks (WSNs) literature to answer the scalability problem of client/server model in data fusion applications. In this paper, we describe the critical role MAs can play in the field of security and robustness of a WSN in addition to data fusion. The design objective of our Jamming Avoidance Itinerary Design (JAID) algorithm is twofold: (a) to calculate near-optimal routes for MAs that incrementally fuse the data as they visit the nodes; (b) in the face of jamming attacks against the WSN, to modify the itineraries of the MAs to bypass the jammed area(s) while not disrupting the efficient data dissemination from working sensors. If the number of jammed nodes is small, JAID only modifies the pre-jamming scheduled itineraries to increase the algorithm’s promptness. Otherwise, JAID re-constructs the agent itineraries excluding the jammed area(s). Another important feature of JAID is the suppression of data taken from sensors when the associated successive readings do not vary significantly. Data suppression also occurs when sensors’ readings are identical to those of their neighboring sensors. Simulation results confirm that JAID enables retrieval of information from the working sensors of partially jammed WSNs and verifies its performance gain over alternative approaches in data fusion tasks.     

Semantic technologies for open interaction systems

Open interaction systems play a crucial role in agreement technologies because they are software devised for enabling autonomous agents (software or human) to interact, negotiate, collaborate, and coordinate their activities in order to establish agreements and manage their execution. Following the approach proposed by the recent literature on agent environments those open distributed systems can be efficiently and effectively modeled as a set of correlated physical and institutional spaces of interaction where objects and agents are situated. In our view in distributed open systems, spaces are fundamental for modeling the fact that events, actions, and social concepts (like norms and institutional objects) should be perceivable only by the agents situated in the spaces where they happen or where they are situated. Institutional spaces are also crucial for their active functional role of keeping track of the state of the interaction, and for monitoring and enforcing norms. Given that in an open distributed and dynamic system it is fundamental to be able to create and destroy spaces of interaction at run-time, in this paper we propose to create them using Artificial Institutions (AIs) specified at design time. This dynamic creation is a complex task that deserves to be studied in all details. For doing that, in this paper, we will first define the various components of AIs and spaces using Semantic Web Technologies, then we will describe the mechanisms for using AIs specification for realizing spaces of interaction. We will exemplify this process by formalizing the components of the auction Artificial Institution and of the spaces created for running concrete auctions.     

A low-complexity global approximation-free control scheme with prescribed performance for unknown pure feedback systems

A universal, approximation-free state feedback control scheme is designed for unknown pure feedback systems, capable of guaranteeing, for any initial system condition, output tracking with prescribed performance and bounded closed loop signals. By prescribed performance, it is meant that the output error converges to a predefined arbitrarily small residual set, with convergence rate no less than a certain prespecified value, having maximum overshoot less than a preassigned level. The proposed state feedback controller isolates the aforementioned output performance characteristics from control gains selection and exhibits strong robustness against model uncertainties, while completely avoiding the explosion of complexity issue raised by backstepping-like approaches that are typically employed to the control of pure feedback systems. In this respect, a low complexity design is achieved. Moreover, the controllability assumptions reported in the relevant literature are further relaxed, thus enlarging the class of pure feedback systems that can be considered. Finally, simulation studies clarify and verify the approach.     

Automatic derivation of BPEL4WS from IDEF0 process models

Integration definition for function modelling (IDEF0) is one of the most popular notations for modelling business processes. It employs a rather simple and intuitive modelling construct, consisting of boxes representing functions and arrows connecting them signifying flow of information and materials. Web services on the other hand are an emerging technology for implementing distributed systems. Web service orchestration languages, such as Business Process Execution Language for Web Services (BPEL4WS), are the emerging approach for describing processes as networks of coordinated web services. Business processes as captured in IDEF0 models, however, may contain both web services as well as other types of activities which need to be coordinated. By automatically analysing the Extensible Markup Language (XML) definition of an IDEF0 model, we can identify how web services interact with other activities and at runtime generate code to support the orchestration of web services with the overall business process. The approach proposed is independent of the orchestration language and ensures an implementation independent model for specifying web service orchestrations. This approach also enables the top-down analysis of a business process to its constituent web services and avoids any misalignment problems during design time between the two.     

Automation infrastructure and operation control strategy in a stand-alone power system based on renewable energy sources

The design of the automation system and the implemented operation control strategy in a stand-alone power system in Greece are fully analyzed in the present study. A photovoltaic array and three wind generators serve as the system main power sources and meet a predefined load demand. A lead-acid accumulator is used to compensate the inherent power fluctuations (excess or shortage) and to regulate the overall system operation, based on a developed power management strategy. Hydrogen is produced by using system excess power in a proton exchange membrane (PEM) electrolyzer and is further stored in pressurized cylinders for subsequent use in a PEM fuel cell in cases of power shortage. A diesel generator complements the integrated system and is employed only in emergency cases, such as subsystems failure. The performance of the automatic control system is evaluated through the real-time operation of the power system where data from the various subsystems are recorded and analyzed using a supervised data acquisition unit. Various network protocols were used to integrate the system devices into one central control system managing in this way to compensate for the differences between chemical and electrical subunits. One of the main advantages is the ability of process monitoring from distance where users can perform changes to system principal variables. Furthermore, the performance of the implemented power management strategy is evaluated through simulated scenarios by including a case study analysis on system abilities to meet higher than expected electrical load demands.     

Pixel History Linear Models for Real‐Time Temporal Filtering

We propose a new real‐time temporal filtering and antialiasing (AA) method for rasterization graphics pipelines. Our method is based on Pixel History Linear Models (PHLM), a new concept for modeling the history of pixel shading values over time using linear models. Based on PHLM, our method can predict per‐pixel variations of the shading function between consecutive frames. This combines temporal reprojection with per‐pixel shading predictions in order to provide temporally coherent shading, even in the presence of very noisy input images. Our method can address both spatial and temporal aliasing problems under a unique filtering framework that minimizes filtering error through a recursive least squares algorithm. We demonstrate our method working with a commercial deferred shading engine for rasterization and with our own OpenGL deferred shading renderer. We have implemented our method in GPU and it has shown significant reduction of temporal flicker in very challenging scenarios including foliage rendering, complex non‐linear camera motions, dynamic lighting, reflections, shadows and fine geometric details. Our approach, based on PHLM, avoids the creation of visible ghosting artifacts and it reduces the filtering overblur characteristic of temporal deflickering methods. At the same time, the results are comparable to state‐of‐the‐art real‐time filters in terms of temporal coherence.     

Mobile agents-based data aggregation in WSNs: benchmarking itinerary planning approaches

Data aggregation represents one of the most challenging and well-studied subjects in the Wireless Sensor Networks (WSN) literature. The energy constraints of sensor nodes call for energy-efficient data aggregation methods so as to prolong network lifetime. Among other approaches, Mobile Agents (MAs) have been proposed to improve the performance of data aggregation in WSNs. In such approaches, the itineraries followed by travelling agents largely determine the overall performance of the data aggregation tasks. Along this line, several heuristics have been proposed to perform efficient itinerary planning for MAs. However, a direct comparison of the proposed algorithms is not straightforward, as they are typically performed on the ground of different parameter instances and assumptions about the underlying network and nodes capabilities. This article provides a critical review and qualitative evaluation of the most prominent itinerary planning algorithms. More importantly, having implemented and simulated a set of eleven (11) itinerary planning algorithms, we compare their performance upon a common parameter space, making realistic network-level assumptions.     

Co-procurement: making the most of collaborative procurement

While the procurement decision is generally made by individual buyers, this study investigates how a group of buyers can make a shared decision. We call this collaborative approach, co-procurement. A mathematical model is formulated for the decision of procurement from multiple suppliers. The model is solved for individual buyers. The outcome shows the optimal number of items a buyer should buy from different suppliers such that the total cost is minimised for that buyer. Next, it is investigated how a group of buyers could make this decision together. The proposed model takes into account transaction costs of collaboration, to determine the optimal size of the collaboration and the involved parties. The idea is new in the old direction of procurement and it introduces the concept of transaction costs in this area and analyses its impact on the optimal collaboration size and mix. A case study from Dutch Food Valley is provided to investigate the benefits of co-procurement and validate the developed structure. The results indicate that co-procurement can bring considerable cost-savings through consolidation of orders and more efficient transportation schedules. A sensitivity analysis is conducted to determine the impact of changes in the transaction cost in favour of the co-procurement.