Committee is listed in the sidebar.

Ohio State University) focused on the use of case-based reasoning for both planning and world modeling. Nicola Muscettola (NASA Ames) focused on reactive behaviors. Laboratory) described an approach Within this general theme, to planning with multiagent the aim was to bring together researchers execution. The presentation ecent developments in multiagent shown promising results in the robotics, intelligent autonomous of Thomas Wagner (University of modeling of autonomous, collaborative vehicles). The common denominator Brement), Christoph Schlieder (University behavior between agents in different that these groups share is the pragmatic of Bamberg), and Ubbo Visser environments.

Later in the school, the focus turned to ontologies, which is where the true power of the semantic web lies. EUROLAN lecturers treated its potential in terms of what the topic of ontology development it might--and might not--bring to us in the future. This year's and how great its impact will really start somewhere, somehow, even if school was organized by the Faculty be. Although it is not yet clear what emerges is a variety of ontological of Computer Science at the A. I. Cuza whether the current vision of the semantic stores from which to choose. University of Iasi, the Research Institute web will indeed reach its expectations, The EUROLAN summer school also for Artificial Intelligence at the there are more and more included a workshop on ontologies Romanian Academy in Bucharest, opinions that it represents a major and information extraction, a student and the Department of Computer technological step that will permanently workshop on applied natural Science at Vassar College.

We introduce a family of classifiers based on a physical analogy to an electrostatic system of charged conductors. The family, called Coulomb classifiers, includes the two best-known support-vector machines (SVMs), the ν-SVM and the C-SVM. In the electrostatics analogy,a training example corresponds to a charged conductor at a given location in space, the classification function corresponds to the electrostatic potential function, and the training objective function corresponds to the Coulomb energy. The electrostatic framework provides not only a novel interpretation of existing algorithms andtheir interrelationships, but it suggests a variety of new methods for SVMs including kernels that bridge the gap between polynomial and radial-basis functions, objective functions that do not require positive-definite kernels, regularization techniques that allow for the construction of an optimal classifier in Minkowski space. Based on the framework, we propose novel SVMs and perform simulationstudies to show that they are comparable or superior tostandard SVMs. The experiments include classification tasks on data which are represented in terms of their pairwise proximities, wherea Coulomb Classifier outperformed standard SVMs.

We introduce a family of classifiers based on a physical analogy to an electrostatic system of charged conductors. The family, called Coulomb classifiers, includes the two best-known support-vector machines (SVMs), the ν-SVM and the C-SVM. In the electrostatics analogy, a training example corresponds to a charged conductor at a given location in space, the classification function corresponds to the electrostatic potential function, and the training objective function corresponds to the Coulomb energy. The electrostatic framework provides not only a novel interpretation of existing algorithms and their interrelationships, but it suggests a variety of new methods for SVMs including kernels that bridge the gap between polynomial and radial-basis functions, objective functions that do not require positive-definite kernels, regularization techniques that allow for the construction of an optimal classifier in Minkowski space. Based on the framework, we propose novel SVMs and perform simulation studies to show that they are comparable or superior to standard SVMs. The experiments include classification tasks on data which are represented in terms of their pairwise proximities, where a Coulomb Classifier outperformed standard SVMs.

W e consider the problem of multi-step ahead prediction in time series analysis using the nonparametric Gaussian process model.

We are constructing caching policies that have 13-20% lower miss rates than the best of twelve baseline policies over a large variety of request streams. This represents an improvement of 49-63% over Least Recently Used, the most commonly implemented policy. We achieve this not by designing a specific new policy but by using online Machine Learning algorithms to dynamically shift between the standard policies based on their observed miss rates. A thorough experimental evaluation of our techniques is given, as well as a discussion of what makes caching an interesting online learning problem.

We consider the problem of multi-step ahead prediction in time series analysis using the nonparametric Gaussian process model.

WEBODE is a scalable workbench for ontological engineering that eases the design, development, and management of ontologies and includes middleware services to aid in the integration of ontologies into real-world applications. WEBODE presents a framework to integrate new ontology-based tools and services, where developers only worry about the new logic they want to provide on top of the knowledge stored in their ontologies.

I'm delighted to bring our readers the news of an exciting resource for AAAI members. AAAI has now completed a major initiative, begun five years ago, to develop a digital library of AAAI publications. The collection now comprises approximately 13,000 papers, including the full set of papers from the AAAI proceedings, papers from other major conferences, AAAI workshop and symposium technical reports, selected AAAI Press books, and the full contents of AI Magazine. This already-extensive collection is a growing resource, with new publications and access methods to be added over time. I encourage readers to visit it at the members' library section of the AAAI web site, www.aaai.org.