Series, held Thursday through Saturday, November 5-7, at he Association for the Advancement of Artificial Intelligence the Westin Arlington Gateway in Arlington, Virginia. The titles of the seven symposia were as follows: (1) Biologically Inspired Cognitive Biologically Inspired Cognitive Architectures Architectures, (2) Cognitive and Metacognitive Cognitive and Metacognitive Educational Systems Educational Systems, (3) Complex Adaptive Complex Adaptive Systems and the Threshold Effect: Views from the Natural Systems and the Threshold Effect: Views and Social Sciences from the Natural and Social Sciences, (4) Manifold Manifold Learning and Its Applications Learning and Its Applications, (5) Multirepresentational Architectures for Human-Level Multirepresentational Architectures for Human-Level Intelligence Intelligence, (6) The Uses of Computational The Uses of Computational Argumentation Argumentation, and (7) Virtual Healthcare Virtual Healthcare Interaction Interaction. An informal reception was held on Thursday, November 5. A general plenary session, in which the highlights of each symposium were presented, was held on Friday, November 6. The challenge of creating a real-life computational equivalent of the human mind requires that we better understand at a computational level how natural intelligent systems develop their cognitive and learning functions. They will behave, variety of disjoined communities and schools of learn, communicate, and "think" as conscious thought that used to speak different languages and beings in general, in addition to being able to perform ignore each other.

We discuss an interaction-based approach to study the coevolution between socio-technical networks, individual behaviors, and contagion processes on these networks. We use epidemics in human population as an example of this phenomenon. The methods consist of developing synthetic yet realistic national-scale networks using a first principles approach. Unlike simple random graph techniques, these methods combine real world data sources with behavioral and social theories to synthesize detailed social contact (proximity) networks. Individual-based models of within-host disease progression and inter-host transmission are then used to model the contagion process. Finally, models of individual behaviors are composed with disease progression models to develop a realistic representation of the complex system in which individual behaviors and the social network adapt to the contagion. These methods are embodied within Simdemics – a general purpose modeling environment to support pandemic planning and response. Simdemics is designed specifically to be scalable to networks with 300 million agents – the underlying algorithms and methods in Simdemics are all high-performance computing oriented methods. New advances in network science, machine learning, high performance computing, data mining and behavioral modeling were necessary to develop Simdemics. Simdemics is combined with two other environments, Simfrastructure and Didactic, to form an integrated cyberenvironment. The integrated cyber-environment provides the end-user flexible and seamless Internet based access to Simdemics. Service-oriented architectures play a critical role in delivering the desired services to the end user. Simdemics, in conjunction with the integrated cyber-environment, has been used in over a dozen user defined case studies. These case studies were done to support specific policy questions that arose in the context of planning the response to pandemics (e.g., H1N1, H5N1) and human initiated bio-terrorism events. These studies played a crucial role in the continual development and improvement of the cyber-environment.

The Japanese fixed-property tax is imposed by municipalities on the owners of land, buildings, and depreciation assets (all hereinafter referred to as "fixed assets") on January 1 of every year by calculating the tax sum according to current asset values. This identification work is contracted out to survey companies. The identification of such en over a scale that can cover an actual area of 800 changes is entrusted to survey companies who hire by 600 meters or 500 by 600 meters (variable a large number of workers (figure 1, left). However, depending on the municipality), and every municipality reliance on human labor has led to problems has several hundred photographs that must detailed in the following paragraphs. Under these circumstances, the incentives for It takes about 10 hours to read and interpret a single the municipalities to overcome such challenges by photograph, and the average municipality automating or systematizing the photograph-reading must perform this work for several hundred photographs.

This article introduces the challenge of digital preservation in the area of engineering design and manufacturing and presents a methodology to apply knowledge representation and semantic techniques to develop Digital Engineering Archives. This work is part of an ongoing, multiuniversity, effort to create cyber infrastructure-based engineering repositories for undergraduates (CIBER-U) to support engineering design education. The technical approach is to use knowledge representation techniques to create formal models of engineering data elements, workflows and processes. With these formal engineering knowledge and processes can be captured and preserved with some guarantee of long-term interpretability. The article presents examples of how the techniques can be used to encode specific engineering information packages and workflows. These techniques are being integrated into a semantic wiki that supports the CIBER-U engineering education activities across nine universities and involving over 3500 students since 2006.

Over the past decade, we have been engaged in an extensive research effort to build virtual humans and applications that use them.  Building a virtual human might be considered the quintessential AI problem, because it brings together many of the key features, such as autonomy, natural communication, sophisticated reasoning and behavior, that distinguish AI systems.  This paper describes major virtual human systems we have built and important lessons we have learned along the way.

Data analysis and data mining are concerned with unsupervised pattern finding and structure determination in data sets. "Structure" can be understood as symmetry and a range of symmetries are expressed by hierarchy. Such symmetries directly point to invariants, that pinpoint intrinsic properties of the data and of the background empirical domain of interest. We review many aspects of hierarchy here, including ultrametric topology, generalized ultrametric, linkages with lattices and other discrete algebraic structures and with p-adic number representations. By focusing on symmetries in data we have a powerful means of structuring and analyzing massive, high dimensional data stores. We illustrate the powerfulness of hierarchical clustering in case studies in chemistry and finance, and we provide pointers to other published case studies.

The plasmodium feeds on microscopic food particles, including microbial life forms. The plasmodium placed in an environment with distributed nutrients develops a network of protoplasmic tubes spanning the nutrients' sources. Te topology of the plasmodium's protoplasmic network optimizes the plasmodium's harvesting on the scattered sources of nutrients and makes more efficient flow and transport of intracellular components [8,9,10,11]. The plasmodium is capable for approximation of shortest path [10], computation of planar proximity graphs [2] and plane tessellations [13], primitive memory [12], basic logical computing [15], and control of robot navigation[16]. The plasmodium can be considered as a general-purpose computer because the plasmodium simulates Kolmogorov-Uspenskii machine -- the storage modification machine operating on a colored set of graph nodes [1]. Preprint submitted to Elsevier Science 17 May 2014 The paper is structured as follows. In Sect. 2 we introduce the experimental gates invented in [15] and reinterpret the gates as multi-output logical gates.

We develop a novel advanced Particle Markov chain Monte Carlo algorithm that is capable of sampling from the posterior distribution of non-linear state space models for both the unobserved latent states and the unknown model parameters. We apply this novel methodology to five population growth models, including models with strong and weak Allee effects, and test if it can efficiently sample from the complex likelihood surface that is often associated with these models. Utilising real and also synthetically generated data sets we examine the extent to which observation noise and process error may frustrate efforts to choose between these models. Our novel algorithm involves an Adaptive Metropolis proposal combined with an SIR Particle MCMC algorithm (AdPMCMC). We show that the AdPMCMC algorithm samples complex, high-dimensional spaces efficiently, and is therefore superior to standard Gibbs or Metropolis Hastings algorithms that are known to converge very slowly when applied to the non-linear state space ecological models considered in this paper. Additionally, we show how the AdPMCMC algorithm can be used to recursively estimate the Bayesian Cram\'er-Rao Lower Bound of Tichavsk\'y (1998). We derive expressions for these Cram\'er-Rao Bounds and estimate them for the models considered. Our results demonstrate a number of important features of common population growth models, most notably their multi-modal posterior surfaces and dependence between the static and dynamic parameters. We conclude by sampling from the posterior distribution of each of the models, and use Bayes factors to highlight how observation noise significantly diminishes our ability to select among some of the models, particularly those that are designed to reproduce an Allee effect.

Probabilistic databases play a crucial role in the management and understanding of uncertain data. However, incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or restrict the class of relational algebra formula under which they are closed. We propose an alternative approach where the underlying relational database always represents a single world, and an external factor graph encodes a distribution over possible worlds; Markov chain Monte Carlo (MCMC) inference is then used to recover this uncertainty to a desired level of fidelity. Our approach allows the efficient evaluation of arbitrary queries over probabilistic databases with arbitrary dependencies expressed by graphical models with structure that changes during inference. MCMC sampling provides efficiency by hypothesizing {\em modifications} to possible worlds rather than generating entire worlds from scratch. Queries are then run over the portions of the world that change, avoiding the onerous cost of running full queries over each sampled world. A significant innovation of this work is the connection between MCMC sampling and materialized view maintenance techniques: we find empirically that using view maintenance techniques is several orders of magnitude faster than naively querying each sampled world. We also demonstrate our system's ability to answer relational queries with aggregation, and demonstrate additional scalability through the use of parallelization.

Modern solvers for Boolean Satisfiability (SA T) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose application is enabled by conflict analysis. Although various conflict analysis schemes have been proposed, implemented, and studied both theoretically and practically in the SA T area, the heuristic aspects involved in conflict analysis have not yet received much attention. Assuming a fixed conflict analysis scheme, we address the open question of how to identify "good" reasons for conflicts, and we investigate several heuristics for conflict analysis in ASP solving. To our knowledge, a systematic study like ours has not yet been performed in the SA T area, thus, it might be beneficial for both the field of ASP as well as the one of SA T solving.