Like every positive integer, the number 19 possesses some fascinating properties. For example, 19 is the smallest prime that is equal to the product of its digits plus the sum of its digits; 19 = 4! − 3! + 2! − 1!; 19 times its reversal (91) is the famous Hardy-Ramanujan number 1729; the sum of 19 consecutive Fibonacci numbers starting from the 19 Fibonacci number is prime; 19 is the smallest p...

The interaction between spatial cognition and language is important to both cognitive science and artificial intelligence. For example, if an interactive humanlike agent could understand spatial terms in natural language in a human manner, simulating human behavior and cognitive processes should be possible. Research in artificial intelligence and linguistics has provided theoretical and comput...

This paper presents a short range wireless network platform based on Bluetooth technology and on a Round Robin scheduling algotithm. The main goal is to provide an application independent platform in order to support a distributed data acquisition and control system used to control a model of a greenhouse. This platform enables the advantages of wireless communications while assuring low weight...

This paper adopts a cognitive theory of analogy and applies it to the design of decision support systems. The approach, called structure mapping, captures the conceptual structure of a C2 problem in the graphical features of a visual display. The result is a visualization that supports decision making better than standard mappings of geospatial information. As an example we present a system des...

In this paper we propose an approach to handle the cooperative localization of an object by a team of robots. Our technique uses propagation of beliefs to combine information provided by a team of robots so as to support a teammate in critical situations when it can not see an object, is lost or it is equipped with low quality sensors and needs cleaner data. Since teammates are a special case o...

Link-based data may be studied formally by means of unordered trees. On a dataset formed by such link-based data, a natural notion of support-based closure can be immediately defined. Abstracting information from subsets of such data requires, first, a formal notion of intersection; second, deeper understanding of the notion of closure; and, third, efficient algorithms for computing intersectio...