Abstract
Resolution strategies based on tabling are considered to be particularly effective in Logic Programming. Unfortunately, when faced with applications that compute large and/or many answers, memory exhaustion is a potential problem. In such cases, table deletion is the most common approach to recover space. In this work, we propose a different approach, storing tables into a relational database. Subsequent calls to stored tables import answers from the database, rather than performing a complete re-computation. To validate this approach, we have extended the YapTab tabling system, providing engine support for exporting and importing tables to and from the MySQL RDBMS. Three different relational models for data storage and two recordset retrieval strategies are compared.

Abstract
The Virtual manufacturing concept is based on the use of computational resources during the design of products and manufacturing systems, reducing the ramp-up time to market and the costs for the system's design, operation and reconfiguration. Combined with emergent paradigms for manufacturing control, such as multi-agent systems and service-orientation principles, and using a formal language to describe the system behavior, e.g. Petri nets, a truly and complete virtual production environment is achieved. This paper discusses this powerful approach to the virtual design and production environment driven by formal models, allowing users to design and deploy collaborative and re-configurable automation applications in a faster and cost-effective fashion. A special attention is devoted to the process of migration from the virtual environment to the real world, aiming to reduce the transition time and increasing the efficiency of the process.

Abstract
Here we present a motion tracking algorithm and a fast river detection algorithm using a near infrared camera on-board an UAV. These algorithms have to run on a slow PC104. The motion tracking algorithm is based on the Normalized Cross-Correlation and the river detection algorithm uses Meyer's Watershed method. Simulation results with a video are presented.

Abstract
We analyze the constituents stocks of the well known Standard & Poor's 100 index (S&P100) that are traded in the NYSE and NASDAQ markets. We observe the data collapse of the histogram of the S&P100 index fluctuations to the universal non-parametric Bramwell-Holdsworth-Pinton (BHP) distribution. Since the BHP probability density function appears in several other dissimilar phenomena, our result reveals an universal feature of the stock exchange markets.

Abstract
DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency expects a level of uniformity in the association of data to index keys that is often not present in inverted indexes. Index data tends to follow non-uniform distributions, often power law distributions, creating intense local storage hotspots and network bottlenecks on specific hosts. Current techniques like caching cannot, alone, cope with this issue. We propose a distributed data structure based on a decentralized balanced tree to balance storage data and network load more uniformly across hosts. The results show that the data structure is capable of balancing resources, in particular when performing multiple keyword searches.

Abstract
Tabling is all implementation technique that overcomes some limitations of traditional Prolog systems in dealing with redundant sub-computations and recursion. The performance of tabled evaluation largely depends on the implementation of the table space. Arguably, the most successful data structure for tabling is tries. However, while tries are efficient for variant based tabled evaluation, they are limited ill their ability to recognize and represent repeated answers for different calls. In this paper, we propose a new design for the table space where tabled subgoal calls and/or answers are stored only once in a common global trie instead of being spread over several different tries. Our preliminary experiments using the YapTab tabling system show very promising reductions on memory usage.