SOA-enabled compliance management: instrumenting, assessing, and analyzing service-based business processes

Facilitating compliance management, that is, assisting a company’s management in conforming to laws, regulations, standards, contracts, and policies, is a hot but non-trivial task. The service-oriented architecture (SOA) has evolved traditional, manual business practices into modern, service-based IT practices that ease part of the problem: the systematic definition and execution of business processes. This, in turn, facilitates the online monitoring of system behaviors and the enforcement of allowed behaviors—all ingredients that can be used to assist compliance management on the fly during process execution. In this paper, instead of focusing on monitoring and runtime enforcement of rules or constraints, we strive for an alternative approach to compliance management in SOAs that aims at assessing and improving compliance. We propose two ingredients: (i) a model and tool to design compliant service-based processes and to instrument them in order to generate evidence of how they are executed and (ii) a reporting and analysis suite to create awareness of a company’s compliance state and to enable understanding why and where compliance violations have occurred. Together, these ingredients result in an approach that is close to how the real stakeholders—compliance experts and auditors—actually assess the state of compliance in practice and that is less intrusive than enforcing compliance.     

COACH: COllaborative certificate stAtus CHecking mechanism for VANETs

Vehicular Ad Hoc Networks (VANETs) require mechanisms to authenticate messages, identify valid vehicles, and remove misbehaving vehicles. A public key infrastructure (PKI) can be used to provide these functionalities using digital certificates. However, if a vehicle is no longer trusted, its certificates have to be revoked and this status information has to be made available to other vehicles as soon as possible. In this paper, we propose a collaborative certificate status checking mechanism called COACH to efficiently distribute certificate revocation information in VANETs. In COACH, we embed a hash tree in each standard Certificate Revocation List (CRL). This dual structure is called extended-CRL. A node possessing an extended-CRL can respond to certificate status requests without having to send the complete CRL. Instead, the node can send a short response (less than 1 kB) that fits in a single UDP message. Obviously, the substructures included in the short responses are authenticated. This means that any node possessing an extended-CRL can produce short responses that can be authenticated (including Road Side Units or intermediate vehicles). We also propose an extension to the COACH mechanism called EvCOACH that is more efficient than COACH in scenarios with relatively low revocation rates per CRL validity period. To build EvCOACH, we embed an additional hash chain in the extended-CRL. Finally, by conducting a detailed performance evaluation, COACH and EvCOACH are proved to be reliable, efficient, and scalable.     

On the hardness of solving edge matching puzzles as SAT or CSP problems

Edge matching puzzles have been amongst us for a long time now and traditionally they have been considered, both, a children’s game and an interesting mathematical divertimento. Their main characteristics have already been studied, and their worst-case complexity has been properly classified as a NP-complete problem. It is in recent times, specially after being used as the problem behind a money-prized contest, with a prize of 2US$ million for the first solver, that edge matching puzzles have attracted mainstream attention from wider audiences, including, of course, computer science people working on solving hard problems. We consider these competitions as an interesting opportunity to showcase SAT/CSP solving techniques when confronted to a real world problem to a broad audience, a part of the intrinsic, i.e. monetary, interest of such a contest. This article studies the NP-complete problem known as edge matching puzzle using SAT and CSP approaches for solving it. We will focus on providing, first and foremost, a theoretical framework, including a generalized definition of the problem. We will design and show algorithms for easy and fast problem instances generation, generators with easily tunable hardness. Afterwards we will provide with SAT and CSP models for the problems and we will study problem complexity, both typical case and worst-case complexity. We will also provide some specially crafted heuristics that result in a boost in solving time and study which is the effect of such heuristics.     

Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories

We introduce WSimply, a new framework for modelling and solving Weighted Constraint Satisfaction Problems (WCSP) using Satisfiability Modulo Theories (SMT) technology. In contrast to other well-known approaches designed for extensional representation of goods or no-goods, and with few declarative facilities, our approach aims to follow an intensional and declarative syntax style. In addition, our language has built-in support for some meta-constraints, such as priority and homogeneity, which allows the user to easily specify rich requirements on the desired solutions, such as preferences and fairness. We propose two alternative strategies for solving these WCSP instances using SMT. The first is the reformulation into Weighted SMT (WSMT) and the application of satisfiability test based algorithms from recent contributions in the Weighted Maximum Satisfiability field. The second one is the reformulation into an operation research-like style which involves an optimisation variable or objective function and the application of optimisation SMT solvers. We present experimental results of two well-known problems: the Nurse Rostering Problem (NRP) and a variant of the Balanced Academic Curriculum Problem (BACP), and provide some insights into the impact of the addition of meta-constraints on the quality of the solutions and the solving time.     

Elimination and accumulation of polycyclic aromatic hydrocarbons in urban stormwater wet detention ponds

The concentrations of polycyclic aromatic hydrocarbons (PAHS) in water and sediments of seven wet detention ponds receiving urban stormwater were investigated. The ponds comprised traditional wet detention ponds with a permanent wet volume and a storage volume as well as ponds that were expanded with sand filters and other means to improve the removal of micropollutants. The concentrations of sigmaPAH in the sediments varied between 6 +/- 5 and 2,222 +/- 603 ng g(-1) dry weight (mean +/- standard deviation), and were highest in the ponds with lower pond volume per catchment area and did not clearly reflect different activities in the catchments. In general, the concentrations of PAHS in the sediments decreased from inlet to outlet, especially in the systems with good conditions for sedimentation such as systems with flow perpendicular sand dikes and extensive submerged vegetation. High molecular weight PAHs were predominant in the sediments indicating the pyrogenic origin of the PAHS. There was no correlation between PAH species concentrations in water or sediments and their hydrophobicity (log K(ow)). PAH concentrations in water fluctuated in response to intensity and frequency of rain events, whereas concentrations in the sediments integrated the pollutant load over time. Pond systems expanded with sand filters and other technologies to enhance removal of micropollutants consistently had concentrations of PAHS in the effluents below the detection level.     

Estimating the Economic Value of Landscape Losses Due to Flooding by Hydropower Plants in the Chilean Patagonia

This paper presents a contingent valuation study concerning landscape impacts generated by the construction of one dam (Baker 1) of the HIDROAYSEN hydropower project located in the Chilean Patagonia. A survey was used to collect information about citizens’ opinions towards the hydropower project in four major cities in Chile. Specifically, a One-and-One-Half-Bound (OOHB) willingness to pay eliciting format was applied to capture citizens’ WTP. The economic loss, associated to the landscape impacts for people living in urban areas of the country, is found to be approximately US$ 205 million, which is nearly 28% of the total investment. Our results also show that the cities’ distance from the dam affects citizens’ willingness to pay.     

QuickBird and Hyperion data analysis of an invasive plant species in the Galapagos Islands of Ecuador: Implications for control and land use management

In the Galapagos Islands of Ecuador, one of the greatest threats to the terrestrial ecosystem is the increasing number and areal extent of invasive species. Increased human presence on the islands has hastened the introduction of plant and animal species that threaten the native and endemic flora and fauna. Considerable research on invasive species in the Galapagos Islands has been conducted by the Charles Darwin Foundation. We complement that work through a spatially- and spectrally-explicit satellite assessment of an important invasive plant species (Psidium guajava — guava) on Isabela Island that integrates diverse remote sensing systems, data types, spatial and spectral resolutions, and analytical and image processing approaches. QuickBird and Hyperion satellite data are processed to characterize the areal extent and spatial structure of guava through the following approaches: (1) QuickBird data are classified through a traditional pixel-based approach (i.e., an unsupervised classification approach using the ISODATA algorithm), as well as an Object-Based Image Analysis (OBIA) approach; (2) multiple approaches for spectral “unmixing” of the Hyperion hyper-spectral data are assessed to construct spectral end-members from QuickBird data using linear and non-linear mixture modeling approaches; and (3) landscape pattern metrics are calculated and compared for the pixel-based, object-based, and spectral unmixing approaches. The spectral–spatial characteristics of guava are interpreted relative to management strategies for the control of guava and the restoration of natural ecosystems in the Galapagos National Park.     

Motion Planning for Haptic Guidance

Haptic devices allow a user to feel either reaction forces from virtual interactions or reaction forces reflected from a remote site during a bilateral teleoperation task. Also, guiding forces can be exerted to train the user in the performance of a virtual task or to assist him/her to safely teleoperate a robot. The generation of guiding forces relies on the existence of a motion plan that provides the direction to be followed to reach the goal from any free configuration of the configuration space (-space). This paper proposes a method to obtain such a plan that interleaves a sampling-based exploration of -space with an efficient computation of harmonic functions. A deterministic sampling sequence (with a bias based on harmonic function values) is used to obtain a hierarchical cell decomposition model of -space. A harmonic function is iteratively computed over the partially known model using a novel approach. The harmonic function is the navigation function used as motion plan. The approach has been implemented in a planner (called the Kautham planner) that, given an initial and a goal configuration, provides: (a) a channel of cells connecting the cell that contains the initial configuration with the cell that contains the goal configuration; (b) two harmonic functions over the whole -space, one that guides motions towards the channel and another that guides motions within the channel towards the goal; and (c) a path computed over a roadmap built with the free samples of the channel. The harmonic functions and the solution path are then used to generate the guiding forces for the haptic device. The planning approach is illustrated with examples on 2D and 3D workspaces. This work was partially supported by the CICYT projects DPI2005-00112 and DPI2007-63665.