Hackman delivered a talk entitled "Humans, Robots, and Teams" that leveraged work in The conference's outstanding paper award went to "Humanoid Robots as a Passive-Social Medium: A Field Experiment at a Train Station" by Kotaro The best student paper award went to Guy Hoffman and Cynthia Breazeal for their paper, titled "Effects of Anticipatory HRI-2007 was the second step "Speed Adaptation for a Robot Walking Spurred by included teamwork, social robotics, momentum has been built for HRI-advances in robotics technologies and adaptation, observation and metrics, 2008, which will be held in Amsterdam, communications, many researchers attention, user experience, and The Netherlands, March 12-15, are studying how to use these field testing. The 21st International FLAIRS Conference (FLAIRS-21) will be held May 15 - 17, 2008 at the Grand Bay Miami Hotel in the village of Coconut Grove, Miami, Florida, USA. The conference hotel is on the waterfront of Biscayne Bay close to downtown Miami and South Beach. FLAIRS-21 will feature technical papers, special tracks, and General Chair invited speakers on artificial intelligence. Architectures: Agents and distributed AI, Intelligent user interfaces, Natural lane@ict.usc.edu

Symposia will be limited to between forty and sixty participants. Each participant will be expected to attend a single symposium. In addition to invited participants, a limited number of other interested parties will be allowed to register in each symposium on a first-come, first-served basis. Working notes will be prepared and distributed to participants in each symposium, but will not otherwise be available unless published as an AAAI Technical Report or edited collection. The final deadline for registration is October 12, 2007. For registration information, please contact AAAI at fss07@aaai.org or visit AAAI's web site (www.aaai.org/Symposia/Fall/fss07.

We present and analyse three online algorithms for learning in discrete Hidden Markov Models (HMMs) and compare them with the Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalisation error we draw learning curves in simplified situations. The performance for learning drifting concepts of one of the presented algorithms is analysed and compared with the Baldi-Chauvin algorithm in the same situations. A brief discussion about learning and symmetry breaking based on our results is also presented.

This dissertation presents several new methods of supervised and unsupervised learning of word sense disambiguation models. The supervised methods focus on performing model searches through a space of probabilistic models, and the unsupervised methods rely on the use of Gibbs Sampling and the Expectation Maximization (EM) algorithm. In both the supervised and unsupervised case, the Naive Bayesian model is found to perform well. An explanation for this success is presented in terms of learning rates and bias-variance decompositions.

Conformal prediction uses past experience to determine precise levels of confidence in new predictions. Given an error probability $\epsilon$, together with a method that makes a prediction $\hat{y}$ of a label $y$, it produces a set of labels, typically containing $\hat{y}$, that also contains $y$ with probability $1-\epsilon$. Conformal prediction can be applied to any method for producing $\hat{y}$: a nearest-neighbor method, a support-vector machine, ridge regression, etc. Conformal prediction is designed for an on-line setting in which labels are predicted successively, each one being revealed before the next is predicted. The most novel and valuable feature of conformal prediction is that if the successive examples are sampled independently from the same distribution, then the successive predictions will be right $1-\epsilon$ of the time, even though they are based on an accumulating dataset rather than on independent datasets. In addition to the model under which successive examples are sampled independently, other on-line compression models can also use conformal prediction. The widely used Gaussian linear model is one of these. This tutorial presents a self-contained account of the theory of conformal prediction and works through several numerical examples. A more comprehensive treatment of the topic is provided in "Algorithmic Learning in a Random World", by Vladimir Vovk, Alex Gammerman, and Glenn Shafer (Springer, 2005).

'We should be worried, for aaai.org/aitopics/ We are Please note that: (1) an excerpt may not my understanding, I visited USC's'We need to tell the the fact that an item has been selected does University of Massachusetts in Amherst, Robot Wars -- An Attempt to Build an with many of the programs in the omy -- that prompted interest in the technology, Ethical Robotic Soldier. 'We are Technology, in Atlanta, is developing a set those tested uses the sort of artificial intelligence studying the application of the RAHS concepts of rules of engagement for battlefield technology that encourages highlevel and tools to the social, and economic robots to ensure that their use of lethal interactivity.... Call me an industry and financial domains,' Nathan wrote force follows the rules of ethics. In other cheerleader, but what I see at [William in an email interview." Kim conscience.... His approach is to create suggests that computers are already helping Yoon-mi. April 28, 2007 what he calls a'multidimensional mathematical students learn and will become increasingly (www.koreaherald.co.kr). "To literally live decision space of possible behavior important year by year." with robots, that are highly likely to become actions'.... Arkin has started to survey policy Search Engine Spawned from Antiterrorism more intelligent and physically closer makers, the public, researchers and military Efforts Finds Place in Business. "Artificial-intelligence-based that will prevent robots from doing harm Computer Science Takes Steps to Bring search technology to people, and block humans from taking Women to the Fold.

The Dialogue on Dialogues workshop was organized as a satellite event at the Interspeech 2006 conference in Pittsburgh, Pennsylvania, and it was held on September 17, 2006, immediately before the main conference. It was planned and coordinated by Michael McTear (University of Ulster, UK), Kristiina Jokinen (University of Helsinki, Finland), and James A. Larson (Portland State University, USA). The one-day workshop involved more than 40 participants from Europe, the United States, Australia, and Japan.

Mixed-initiative assistants are agents that interact seamlessly with humans to extend their problem-solving capabilities or provide new capabilities. Developing such agents requires the synergistic integration of many areas of AI, including knowledge representation, problem solving and planning, knowledge acquisition and learning, multiagent systems, discourse theory, and human-computer interaction. This paper introduces seven aspects of mixed-initiative reasoning (task, control, awareness, communication, personalization, architecture, and evaluation) and discusses them in the context of several state-of-the-art mixed-initiative assistants. The goal is to provide a framework for understanding and comparing existing mixed-initiative assistants and for developing general design principles and methods.

DiamondHelp is a generic collaborative task guidance system motivated by the current usability crisis in high-tech home products. It combines an application-independent conversational interface (adapted from online chat programs) with an application-specific direct-manipulation interface. DiamondHelp is implemented in Java and uses Collagen for representing and using task models.

The Fifteenth Annual AAAI Robot Competition and Exhibition was held at the Twenty-First National Conference on Artificial Intelligence in Boston, Massachusetts, in July 2006. This article describes the events that were held at the conference, including the Scavenger Hunt, Human Robot Interaction, and Robot Exhibition.