Maritime threat detection is a challenging problem because maritime environments can involve a complex combination of concurrent vessel activities, and only a small fraction of these may be irregular, suspicious, or threatening. Previous work on this task has been limited to analyses of single vessels using simple rule-based models that alert watchstanders when a proximity threshold is breached. We claim that Probabilistic Graphical Models (PGMs) can be used to more effectively model complex maritime situations. In this paper, we study the performance of PGMs for detecting (small boat) maritime attacks. We describe three types of PGMs that vary in their representational expressiveness and evaluate them on a threat recognition task using track data obtained from force protection naval exercises involving unmanned sea surface vehicles. We found that the best-performing PGMs can outperform the deployed rule-based approach on these tasks, though some PGMs require substantial engineering and are computationally expensive.

Bill Swartout Introduced by Alan Kay at XEROX PARC in the 1970's, the desktop metaphor, which was later adopted in the Macintosh and Windows operating systems, has become the primary way we think about interacting with computers. Over the last decade, we have been developing sophisticated virtual humans at the USC Institute for Creative Technologies.

Chairs and committees of the FLAIRS-25 conference.

Officers of the Florida AI Research Society.

The regularization path of the Lasso can be shown to be piecewise linear, making it possible to "follow" and explicitly compute the entire path. We analyze in this paper this popular strategy, and prove that its worst case complexity is exponential in the number of variables. We then oppose this pessimistic result to an (optimistic) approximate analysis: We show that an approximate path with at most O(1/sqrt(epsilon)) linear segments can always be obtained, where every point on the path is guaranteed to be optimal up to a relative epsilon-duality gap. We complete our theoretical analysis with a practical algorithm to compute these approximate paths.

The free energy functional has recently been proposed as a variational principle for bounded rational decision-making, since it instantiates a natural trade-off between utility gains and information processing costs that can be axiomatically derived. Here we apply the free energy principle to general decision trees that include both adversarial and stochastic environments. We derive generalized sequential optimality equations that not only include the Bellman optimality equations as a limit case, but also lead to well-known decision-rules such as Expectimax, Minimax and Expectiminimax. We show how these decision-rules can be derived from a single free energy principle that assigns a resource parameter to each node in the decision tree. These resource parameters express a concrete computational cost that can be measured as the amount of samples that are needed from the distribution that belongs to each node. The free energy principle therefore provides the normative basis for generalized optimality equations that account for both adversarial and stochastic environments.

This research is about the distribution of processing involved in the search for the best product-unit neural network (PUNN) models [Durbin, 1990] [Martínez-Estud illo, 2006A], using evolutionary algorithms, EAs. A cluster of computers [Buyya, 1999] will be used to carry out the distribution of this processing. Many different types of neural network architectures have been used, but the most popular one has been the single-hidden-layer feedforward network. Amongst the numerous approaches that use neural networks in classification problems, we focus our attention on ev olutionary artificial neural networks (EANNs). EANNs have been a key research area in the past decade pr oviding an improved platfo rm for optimizing network performance and architecture (number of hidden nodes and number of connections) simultaneously.

ICINCO 2012 will be held July 28-31, 2012 in Rome, Italy This page includes forthcoming AAAI sponsored conferences, conferences presented Sixth International RuleML Symposium by AAAI Affiliates, and conferences held in cooperation with AAAI. RuleML-2012 will be Magazine also maintains a calendar listing that includes nonaffiliated conferences held August 27-31, 2012 in Montpellier, at www.aaai.org/Magazine/calendar.php. Knowledge Engineering and Knowledge ICWSM-12 will be held June 4-7 at Flairs-2012 will be held May 23-25, Management. AAAI-12 will be Representation and Reasoning. Twenty-Fourth Innovative Applications Twenty-Second International Conference of Artificial Intelligence Conference. on Automated Planning and IAAI-12 will be held July Scheduling.

Posters, the AAAI/SIGART Doctoral of AAAI; submit papers to the conference Consortium, and more!

Modern SAT solvers are routinely used as core solving engines in vast numbers of different AI and industrial applications. In this short article, we will provide an overview of the SAT solver competitions. The solvers), and another one based on wall clock time, second SAT competition took place during the second which promotes solvers using all available Dimacs challenge in 1993 (Johnson and Trick resources to answer as quickly as possible (for 1996). Another SAT competition took place in answers incorrectly if it reports satisfiable but Beijing in 1996, organized by James Crawford. Each survey propagation (Braunstein and Zecchina category is defined through the type of instances 2004), a new approach to efficiently solve randomly used as benchmarks.