Manuscript received November 28, 1978; revised February 28, 1980. This work was supported in part by the National Science Foundation under Grant ENG 76-23334, in part by the Stanford Research Institute under International Contract D/&C-15-C-0187, and in part by the Joint Scientific Enaineerina Program under Contracts NO001475-C-0601 and F44620-76-C&01. This paper was presented at the 1979 IEEE ...

Commonsense is a challenge not only for representation and reasoning but also for large scale knowledge engineering required to capture the breadth of our ‘everyday’ world. One approach to knowledge engineering is to ‘outsource’ the effort to the public through games that generate structured commonsense knowledge from user play. To date, such games have focused on symbolic and textual knowledge...

The A-MIN method consists of a best-first backtracking algorithm applicable to a large class of information-gathering problems, such as most natural language analyzers, many speech understanding systems, and some forms of planning and automated knowledge acquisition. This paper focuses on the general A-MIN search-control method and characterizes the problem spaces to which it may apply. Essenti...

This article explores new methods for gathering and analyzing spatially rich demographic data using mobile phones. It describes a pilot study (the Human Mobility Project) in which volunteers around the world were successfully recruited to share GPS and cellular tower information on their trajectories and respond to dynamic, location-based surveys using an open-source Android application. The pi...

Teachers usually implement their pedagogical ideas in Virtual Learning Environments (VLEs) in a continuous refinement approach also known as “bricolage”. Recently, different proposals have enabled the ubiquitous access to VLEs, thus extending the bricolage mode of operation to other learning spaces. However, such proposals tend to present several limitations for teachers to orchestrate learning...

considering the increasing interest in fuzzy theory and possible applications,the concept of fuzzy metric space concept has been introduced by severalauthors from different perspectives. this paper interprets the theory in termsof metrics evaluated on fuzzy numbers and defines a strong hausdorff topology.we study interrelationships between this theory and other fuzzy theories suchas intuitionis...

In empirical studies we observed that caching can have very little impact in reducing the search effort in Branch and Bound search over context-minimal OR spaces. For example, in one of the problem domains used in our experiments we reduce only by 1% the number of nodes expanded when using caching in context-minimal OR spaces. By contrast, we reduce by 74% the number of nodes expanded when usin...