Playing Mastermind with Constant-Size Memory

We analyze the classic board game of Mastermind with n holes and a constant number of colors. The classic result of Chvátal (Combinatorica 3:325–329, 1983) states that the codebreaker can find the secret code with Θ(n/logn) questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In addition to an intrinsic interest in this question, our result also disproves a conjecture of Droste, Jansen, and Wegener (Theory Comput. Syst. 39:525–544, 2006) on the memory-restricted black-box complexity of the OneMax function class.     

Recommendation of RILEM Technical Committee 250-CSM: Test method for Textile Reinforced Mortar to substrate bond characterization

Textile Reinforced Mortar (TRM), also known as Fabric Reinforced Mortar or Fabric Reinforced Cementitious Matrix, composites are an emerging technology for the external repair and strengthening of existing structures. For most applications, the effectiveness of the TRM reinforcement relies on its bond performance. This recommendation identifies the best practice to characterize the bond behaviour of TRM. A shear bond test method is proposed to determine the peak axial stress (associated with the maximum load that can be transferred from the structural member to the externally bonded TRM reinforcement), the stress–slip relationship and the failure mode that controls the TRM-to-substrate load transfer capacity. Guidelines on specimen manufacturing, experimental setup, test execution, and determination of test results are provided.     

An agent-based signal processing in-node environment for real-time human activity monitoring based on wireless body sensor networks

Nowadays wireless body sensor networks (WBSNs) have great potential to enable a broad variety of assisted living applications such as human biophysical/biochemical control and activity monitoring for health care, e-fitness, emergency detection, emotional recognition for social networking, security, and highly interactive games. It is therefore important to define design methodologies and programming frameworks which enable rapid prototyping of WBSN applications. Several effective application development frameworks have been already proposed for WBSNs designed for TinyOS-based sensor platforms, e.g. CodeBlue, SPINE, and Titan. In this paper we present an application of MAPS, an agent framework for wireless sensor networks based on the Java-programmable Sun SPOT sensor platform, for the development of a real-time WBSN-based system for human activity monitoring. The agent-oriented programming abstractions provided by MAPS allow effective and rapid prototyping of the sensor-side software. In particular, the architecture of the developed system is a typical star-based WBSN composed of a coordinator node and two sensor nodes located respectively on the waist and the thigh of the monitored assisted living. The coordinator relies on a JADE-based enhancement of the SPINE coordinator and allows configuring sensors, receiving their data, and recognizing pre-defined human activities. On the other hand, each sensor node runs a MAPS-based agent that performs sensing of the 3-axial accelerometer sensor, computation of significant features on the acquired data, feature aggregation and transmission to the coordinator. The experimentation phase of the prototype, which allows evaluating the obtainable monitoring performances and activity recognition accuracy, is described. Moreover, a comparison of the monitoring system based on MAPS, AFME and SPINE in terms of programming effectiveness and system performances is discussed.     

Reasoning about reasoning in a meta-level architecture

In this paper we discuss reasoning about reasoning in a multiple agent scenario. We consider agents that are perfect reasoners, loyal, and that can take advantage of both the knowledge and ignorance of other agents. The knowledge representation formalism we use is (full) first order predicate calculus, where different agents are represented by different theories, and reasoning about reasoning is realized via a meta-level representation of knowledge and reasoning. The framework we provide is pretty general: we illustrate it by showing a machine checked solution to the three wisemen puzzle. The agents' knowledge is organized into units: the agent's own knowledge about the world and its knowledge about other agents are units containing object-level knowledge; a unit containing meta-level knowledge embodies the reasoning about reasoning and realizes the link among units. In the paper we illustrate the meta-level architecture we propose for problem solving in a multi-agent scenario; we discuss our approach in relation to the modal one and we compare it with other meta-level architectures based on logic. Finally, we look at a class of applications that can be effectively modeled by exploiting the meta-level approach to reasoning about knowledge and reasoning.     

Fast algorithms for bit-serial routing on a hypercube

In this paper we describe anO(logN)-bit-step randomized algorithm for bit-serial message routing on a hypercube. The result is asymptotically optimal, and improves upon the best previously known algorithms by a logarithmic factor. The result also solves the problem of on-line circuit switching in anO(1)-dilated hypercube (i.e., the problem of establishing edge-disjoint paths between the nodes of the dilated hypercube for any one-to-one mapping).Our algorithm is adaptive and we show that this is necessary to achieve the logarithmic speedup. We generalize the Borodin-Hopcroft lower bound on oblivious routing by proving that any randomized oblivious algorithm on a polylogarithmic degree network requires at least (log² N/log logN) bit steps with high probability for almost all permutations.This research was supported by the Defense Advanced Research Projects Agency under Contracts N00014-87-K-825 and N00014-89-J-1988, the Air Force under Contract AFOSR-89-0271, and the Army under Contract DAAL-03-86-K-0171. This work was completed while the third and fourth authors were at the Laboratory for Computer Science, Massachusetts Institute of Technology.     

Prediction of parking space availability in real time

Intelligent parking reservation (IPR) systems allow customers to select a parking facility according to their preferences, rapidly park their vehicle without searching for a free stall, and pay their reservation in advance avoiding queues. Some IPR systems interact with in-vehicle navigation systems and provide users with information in real time such as capacity, parking fee, and current parking utilization. However, few of these systems provide information on the forecast utilization at specific hours - a process that requires the study of the competition between parking alternatives for the market share. This paper proposes a methodology for predicting real-time parking space availability in IPR architectures. This methodology consists of three subroutines to allocate simulated parking requests, estimate future departures, and forecast parking availability. Parking requests are allocated iteratively using an aggregated approach as a function of simulated drivers’ preferences, and parking availability. This approach is based on a calibrated discrete choice model for selecting parking alternatives. A numerical comparison between a one-by-one simulation-based forecast and the proposed aggregated approach indicates that no significant discrepancies exists, validating and suggesting the use of the less time consuming proposed aggregated methodology. Results obtained from contrasting predictions with real data yielded small average error availabilities. The forecast improves as the system registers arrivals and departures. Thus, the forecast is adequate for potential distribution in real-time using different media such as Internet, navigation systems, cell phones or GIS.     

FRP confinement of masonry: analytical modeling

International and National Building Codes provide requirements for design and construction of new masonry structures, but design provisions for the repair, retrofitting, and rehabilitation of masonry structures are not always available and included in the same documents. Due to the extremely large variability in masonry performances, equations of general validity cannot often be provided, namely relationships suitable for every masonry type. Despite the great research effort in the experimental field, considerable theoretical work is still needed to fully outline a definitive analytical model to predict the behavior of FRP confined masonry. Most of the available models, empirical in nature, have been calibrated against their own sets of experimental data, or they are simply derived from concrete. Even if large amount of results obtained for concrete led to consolidated design guidelines, they cannot be simply extended to masonry. In this study, a mechanically based confinement model is proposed based on mechanical parameters able to differentiate similar masonry types and to highlight that they present different confinement performance. Crucial aspects of masonry confinement will be also discussed, namely: lateral dilation; confinement effectiveness; lateral pressure also in non-circular shapes; effective strain of FRP.