Querying websites using compact skeletons

Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML documents. Much research has been devoted to this problem, resulting in several research prototypes and commercial implementations. Such systems rely on wrappers that provide relational or other structured interfaces to websites. Traditionally, wrappers have been constructed by hand on a per-website basis, constraining the scalability of the system. We introduce a website structure inference mechanism called compact skeletons that is a step in the direction of automated wrapper generation. Compact skeletons provide a transformation from websites or other hierarchical data, such as XML documents, to relational tables. We study several classes of compact skeletons and provide polynomial-time algorithms and heuristics for automated construction of compact skeletons from websites. Experimental results show that our heuristics work well in practice. We also argue that compact skeletons are a natural extension of commercially deployed techniques for wrapper construction.     

Typing correspondence assertions for communication protocols

Woo and Lam propose correspondence assertions for specifying authenticity properties of security protocols. Prior work on checking correspondence assertions depends on model-checking and is limited to finite-state systems. We propose a dependent type and effect system for checking correspondence assertions. Since it is based on type-checking, our method is not limited to finite-state systems. This paper presents our system in the simple and general setting of the π-calculus. We show how to type-check correctness properties of example communication protocols based on secure channels. In a related paper, we extend our system to the more complex and specific setting of checking cryptographic protocols based on encrypted messages sent over insecure channels.     

Coping with Uncertainty in Map Learning

In many applications in mobile robotics, it is important for a robot to explore its environment in order to construct a representation of space useful for guiding movement. We refer to such a representation as a map, and the process of constructing a map from a set of measurements as map learning. In this paper, we develop a framework for describing map-learning problems in which the measurements taken by the robot are subject to known errors. We investigate approaches to learning maps under such conditions based on Valiant's probably approximately correct learning model. We focus on the problem of coping with accumulated error in combining local measurements to make global inferences. In one approach, the effects of accumulated error are eliminated by the use of local sensing methods that never mislead but occasionally fail to produce an answer. In another approach, the effects of accumulated error are reduced to acceptable levels by repeated exploration of the area to be learned. We also suggest some insights into why certain existing techniques for map learning perform as well as they do. The learning problems explored in this paper are quite different from most of the classification and boolean-function learning problems appearing in the literature. The methods described, while specific to map learning, suggest directions to take in tackling other learning problems.     

A heuristic technique for multi‐agent planning

The subject of multi‐agent planning has been of continuing concern in Distributed Artificial Intelligence (DAI). In this paper, we suggest an approach to multi‐agent planning that contains heuristic elements. Our method makes use of subgoals, and derived sub‐plans, to construct a global plan. Agents solve their individual sub‐plans, which are then merged into a global plan. The suggested approach reduces overall planning time and derives a plan that approximates the optimal global plan that would have been derived by a central planner, given those original subgoals. We explore three different scenarios. The first involves a group of agents with a common goal. The second considers how agents can interleave planning and execution when planning towards a common, though dynamic, goal. The third examines the case where agents, each with their own goal, can plan together to reach a state in consensus for the group. Finally, we consider how these approaches can be adapted to handle rational, manipulative agents. This revised version was published online in June 2006 with corrections to the Cover Date.     

Motivation of Engineering Students to Participate in Teaching Evaluations

This study employs expectancy theory to evaluate some key factors that motivate students to participate in the teaching evaluation process. The results show that engineering students generally consider the improvement of teaching to be the most important outcome of teaching evaluations, followed by the improvement of course content and format. Making the results of evaluations available for students' decisions on course and instructor selection ranked third, while the least important use was influencing a professor's tenure, promotion, and salary raise. Students' motivation to participate in teaching evaluations is also impacted significantly by their expectation that they will be able to provide meaningful feedback.     

Conditioned Activity and Instrumental Reinforcement Following Long-Term Oral Consumption of Cocaine by Rats.

Food-reinforced conditioned activity and instrumental responding were measured in rats after 50 weeks of continuous access to a cocaine-saccharin solution in their home cages. The elevation of conditioned activity produced by acute access to the cocaine-saccharin solution in the home cage during testing was abolished by long-term preexposure to the cocaine solution, an effect that was reversed by systemic administration of cocaine immediately prior to testing. By contrast, chronic cocaine preexposure enhanced instrumental responding for both cocaine-sucrose and pure sucrose solutions. These results support the idea that long-term cocaine exposure enhances subsequent reinforcement. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Qualitative Diagnosis of Condition Systems

A condition system is a collection of Petri nets that interact with each other and the external environment through condition signals. Some of these condition signals may be unobservable. In this paper, a system fault is defined in terms of observed behavior versus expected behavior, where the expected behavior is defined through condition system models. A diagnosis of this fault localizes the subsystem that is the source of the discrepancy between output and expected observations. We show that the structure of the interacting subsystems define a diagnostic causal model that captures the causal structure of subsystem dependencies. The diagnostic causal model can then be used to determine a set of subsystems that might be the source of a fault.     

A note on productivity gains in flexible robotic cells

Flexible robotic cells combine the capabilities of robotic flow shops with those of flexible manufacturing systems. In an m-machine flexible cell, each part visits each machine in the same order. However, the m operations can be performed in any order, and each machine can be configured to perform any operation. We derive the maximum percentage increase in throughput that can be achieved by changing the assignment of operations to machines and then keeping that assignment constant throughout a lot's processing. We find that no increase can be gained in two-machine cells, and that the gain in three- and four-machine cells each is at most 14 %.     

A Hadamard transform electron ionization time-of-flight mass spectrometer

We describe the first Hadamard transform time-of-flight mass spectrometer (HT-TOFMS) that incorporates an electron (impact) ionization source. This implementation was realized in an existent TOF instrument using commercially available components and simple modifications to the ion source. In the present apparatus, a Hadamard mask is expressed by modulating the ion generation process within the ion source; thus, the present approach differs from previous designs that use external electrostatic devices to modulate a continuous ion stream. The present implementation may be operated in conventional TOF mode at 12.5 kHz and in HT-TOF mode at 20-40 MHz. In Hadamard mode the design can operate using any circulant simplex code, allowing the operator much flexibility for optimizing resolution and mass range and for eliminating nonstochastic fluctuations, e.g., encoding errors and signal hum. We demonstrate typical performance of the HT-TOFMS in standard and reflectron geometries using sequences of three constructions and of varied length, generating HT-TOF mass spectra of molecules that match conventional reference spectra. The auxiliary material includes an electrical schematic for the floating high-speed encoding amplifier, which is also of use in other high-speed electrostatic optics applications, and a list of 537 validated vectors comprising the first row of each circulant simplex sequence (S(n)=3-8219) derived using maximal shift register (n=2(m)-1), quadratic residue (n=4m-3), and twin prime constructions [n=p(p+2)].     

Development of a lane departure monitoring and control system

The lane departure avoidance systems have been considered promising to assist human drivers in AVCS (Advanced Vehicle Control System). In this paper, a lane departure monitoring and control system is developed and evaluated in the hardware-in-the-loop simulations. This system consists of lane sensing, lane departure monitoring and active steering control subsystems. The road image is obtained based on a vision sensor and the lane parameters are estimated using image processing and Kalman Filter technique. The active steering controller for avoiding the lane departure is designed based on the lane departure metric. The proposed lane departure avoidance system is realized in a steering HILS (hardware-in-the-loop simulation) tool and its performance is evaluated with a driver in the loop.