nSPARQL: A navigational language for RDF

Navigational features have been largely recognized as fundamental for graph database query languages. This fact has motivated several authors to propose RDF query languages with navigational capabilities. In this paper, we propose the query language nSPARQL that uses nested regular expressions to navigate RDF data. We study some of the fundamental properties of nSPARQL and nested regular expressions concerning expressiveness and complexity of evaluation. Regarding expressiveness, we show that nSPARQL is expressive enough to answer queries considering the semantics of the RDFS vocabulary by directly traversing the input graph. We also show that nesting is necessary in nSPARQL to obtain this last result, and we study the expressiveness of the combination of nested regular expressions and SPARQL operators. Regarding complexity of evaluation, we prove that given an RDF graph G and a nested regular expression E, this problem can be solved in time O(|G||E|).     

Randomized constraint solvers: a comparative study

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compared the effectiveness of a symbolic solver (CVC3), a random solver, two heuristic search solvers, and seven hybrid solvers (i.e. mix of random, symbolic, and heuristic solvers). We evaluated the solvers on a benchmark generated with a concolic execution of 9 subjects. The performance of each solver was measured by its precision, which is the fraction of constraints that the solver can find solution out of the total number of constraints that some solver can find solution. As expected, symbolic solving subsumes the other approaches for the 4 subjects that only generate decidable constraints. For the remaining 5 subjects, which contain undecidable constraints, the hybrid solvers achieved the highest precision (fraction of constraints that a solver can find a solution out of the total number of satisfiable constraints). We also observed that the solvers were complementary, which suggests that one should alternate their use in iterations of a concolic execution driver.     

An Evaluation of an OS-Based Coherence Scheme for Tiled CMPs

The interconnect mechanisms (shared bus or crossbar) used in current chip-multiprocessors (CMPs) are expected to become a bottleneck that prevents these architectures from scaling to a larger number of cores. Tiled CMPs offer better scalability by integrating relatively simple cores with a lightweight point-to-point interconnect. However, such interconnects make snooping impractical and, thus, require alternative solutions to cache coherence. In this article, we investigate a novel, cost-effective mechanism to support shared-memory parallel applications that forgoes hardware maintained cache coherence. This mechanism is based on the key ideas that mapping of lines to physical caches is done at the page level with OS support and that hardware supports remote cache accesses. We extend our previous work by investigating in detail the impact of system design parameters and extending the system to support multi-level cache hierarchies. Results show that the choice of implementation of multi-level cache hierarchies can have a significant impact on performance.     

Components meet aspects: Assessing design stability of a software product line

Context

It is important for Product Line Architectures (PLA) to remain stable accommodating evolutionary changes of stakeholder’s requirements. Otherwise, architectural modifications may have to be propagated to products of a product line, thereby increasing maintenance costs. A key challenge is that several features are likely to exert a crosscutting impact on the PLA decomposition, thereby making it more difficult to preserve its stability in the presence of changes. Some researchers claim that the use of aspects can ameliorate instabilities caused by changes in crosscutting features. Hence, it is important to understand which aspect-oriented (AO) and non-aspect-oriented techniques better cope with PLA stability through evolution.

Objective

This paper evaluates the positive and negative change impact of component and aspect based design on PLAs. The objective of the evaluation is to assess how aspects and components promote PLA stability in the presence of various types of evolutionary change. To support a broader analysis, we also evaluate the PLA stability of a hybrid approach (i.e. combined use of aspects and components) against the isolated use of component-based, OO, and AO approaches.

Method

An quantitative and qualitative analysis of PLA stability which involved four different implementations of a PLA: (i) an OO implementation, (ii) an AO implementation, (iii) a component-based implementation, and (iv) a hybrid implementation where both components and aspects are employed. Each implementation has eight releases and they are functionally equivalent. We used conventional metrics suites for change impact and modularity to measure the architecture stability evaluation of the 4 implementations.

Results

The combination of aspects and components promotes superior PLA resilience than the other PLAs in most of the circumstances.

Conclusion

It is concluded that the combination of aspects and components supports the design of high cohesive and loosely coupled PLAs. It also contributes to improve modularity by untangling feature implementation.     

Intelligent assistance for teachers in collaborative e-learning environments

Collaborative learning environments provide a set of tools for students acting in groups to interact and accomplish an assigned task. In this kind of systems, students are free to express and communicate with each other, which usually lead to collaboration and communication problems that may require the intervention of a teacher. In this article, we introduce an intelligent agent approach to assist teachers through monitoring participations made by students within a collaborative distance learning environment, detecting conflictive situations in which a teacher’s intervention may be necessary. High precision rates achieved on conflict detection scenarios suggest great potential for the application of the proposed rule-based approach for providing personalized assistance to teachers during the development of group works.     

Singularity robust algorithm in serial manipulators

Singularity is a fundamental problem with robotic manipulators. Various methods of singularity handling have been published in the past. In this paper, a singularity robust method is presented and its implementation issues discussed. It focuses on the discontinuity problem inherent in the singularity robust techniques with removal of degenerate components. Sources of the discontinuity are discussed and the null motion is proposed as the means of providing a continuous control of the end-effector over the boundary of the singular region. The presentation of this paper covers a complete treatment of singularities, starting from identifications of the singular configurations and the associated singular directions, the handling algorithm and the discontinuity issues. The algorithm was implemented on PUMA 560. The experimental results are presented and discussed.     

Near optimal interval observers bundle for uncertain bioreactors

In this paper we design an interval observer for the estimation of unmeasured variables of uncertain bioreactors. The observer is based on a bounded error observer, as proposed in [Lemesle, V., & Gouzé, J.-L. (2005). Hybrid bounded error observers for uncertain bioreactor models. Bioprocess and Biosystems Engineering, 27, 311-318], that makes use of a loose approximation of the bacterial kinetics. We first show how to generate guaranteed upper and lower bounds on the state, provided that known intervals for the initial condition and the uncertainties are available. These so-called framers depend on a tuning gain. They can be run in parallel and the envelope provides the best estimate. An optimality criterion is introduced leading to the definition of an optimal observer. We show that this criterion provides directly a gain set containing the best framers. The method is applied to the estimation of the total biomass of an industrial wastewater treatment plant, demonstrating its efficiency.     

Interactive smart battery storage for a PV and wind hybrid energy management control based on conservative power theory

This paper presents interactive smart battery-based storage (BBS) for wind generator (WG) and photovoltaic (PV) systems. The BBS is composed of an asymmetric cascaded H-bridge multilevel inverter (ACMI) with staircase modulation. The structure is parallel to the WG and PV systems, allowing the ACMI to have a reduction in power losses compared to the usual solution for storage connected at the DC-link of the converter for WG or PV systems. Moreover, the BBS is embedded with a decision algorithm running real-time energy costs, plus a battery state-of-charge manager and power quality capabilities, making the described system in this paper very interactive, smart and multifunctional. The paper describes how BBS interacts with the WG and PV and how its performance is improved. Experimental results are presented showing the efficacy of this BBS for renewable energy applications.     

Multi-camera calibration based on an invariant pattern

In this paper we present a method for the calibration of multiple cameras based on the extraction and use of the physical characteristics of a one-dimensional invariant pattern which is defined by four collinear markers. The advantages of this kind of pattern stand out in two key steps of the calibration process. In the initial step of camera calibration methods, related to sample points capture, the proposed method takes advantage of using a new technique for the capture and recognition of a robust sample of projective invariant patterns, which allows to capture simultaneously more than one invariant pattern in the tracking area and recognize each pattern individually as well as each marker that composes them. This process is executed in real time while capturing our sample of calibration points in the cameras of our system. This new feature allows to capture a more numerous and robust set of sample points than other patterns used for multi-camera calibration methods. In the last step of the calibration process, related to camera parameters' optimization, we explore the collinearity feature of the invariant pattern and add this feature in the camera parameters optimization model. This approach obtains better results in the computation of camera parameters. We present the results obtained with the calibration of two multi-camera systems using the proposed method and compare them with other methods from the literature.     

Template-based quadrilateral mesh generation from imaging data

This paper describes a novel template-based meshing approach for generating good quality quadrilateral meshes from 2D digital images. This approach builds upon an existing image-based mesh generation technique called Imeshp, which enables us to create a segmented triangle mesh from an image without the need for an image segmentation step. Our approach generates a quadrilateral mesh using an indirect scheme, which converts the segmented triangle mesh created by the initial steps of the Imesh technique into a quadrilateral one. The triangle-to-quadrilateral conversion makes use of template meshes of triangles. To ensure good element quality, the conversion step is followed by a smoothing step, which is based on a new optimization-based procedure. We show several examples of meshes generated by our approach, and present a thorough experimental evaluation of the quality of the meshes given as examples.