Current automatic handwriting recognition algorithms are already pretty good at learning to recognize handwritten digits. More than a decade ago, Multilayer Perceptrons or MLPs (Werbos, 1974; LeCun, 1985; Rumelhart et al., 1986) were among the first classifiers tested on the now famous MNIST handwritten digit recognition benchmark. Most had few layers or few artificial neurons (units) per layer (LeCun et al., 1998), but apparently back then these were the biggest feasible MLPs, trained when CPU cores were at least 20 times slower than today. A more recent MLP with a single hidden layer of 800 units achieved 0.70% error (Simard et al., 2003). The latest substantial improvement by others occurred in 2003 (Simard et al., 2003) (error rate 0.4%).

Nonmonotonic causal logic, introduced by Norman McCain and Hudson Turner, became a basis for the semantics of several expressive action languages. McCain's embedding of definite propositional causal theories into logic programming paved the way to the use of answer set solvers for answering queries about actions described in such languages. In this paper we extend this embedding to nondefinite theories and to first-order causal logic.

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown to be undecidable for this new logic, but we introduce a very general class of schemata, called bound-linear, for which this problem becomes decidable. This result is obtained by reduction to a particular class of schemata called regular, for which we provide a sound and complete terminating proof procedure. This schemata calculus allows one to capture proof patterns corresponding to a large class of problems specified in propositional logic. We also show that the satisfiability problem becomes again undecidable for slight extensions of this class, thus demonstrating that bound-linear schemata represent a good compromise between expressivity and decidability.

In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to find restricted classes of games where simple, efficient algorithms converge. It is shown that stage learning efficiently converges to Nash equilibria in large anonymous games if best-reply dynamics converge. Two features are identified that improve convergence. First, rather than making learning more difficult, more agents are actually beneficial in many settings. Second, providing agents with statistical information about the behavior of others can significantly reduce the number of observations needed.

The development of discursive knowledge presumes the communication of meaning as analytically different from the communication of information. Knowledge can then be considered as a meaning which makes a difference. Whereas the communication of information is studied in the information sciences and scientometrics, the communication of meaning has been central to Luhmann's attempts to make the theory of autopoiesis relevant for sociology. Analytical techniques such as semantic maps and the simulation of anticipatory systems enable us to operationalize the distinctions which Luhmann proposed as relevant to the elaboration of Husserl's "horizons of meaning" in empirical research: interactions among communications, the organization of meaning in instantiations, and the self-organization of interhuman communication in terms of symbolically generalized media such as truth, love, and power. Horizons of meaning, however, remain uncertain orders of expectations, and one should caution against reification from the meta-biological perspective of systems theory.

The state of the art in local search for the Traveling Salesman Problem is dominated by ejection chain methods utilising the Stem-and-Cycle reference structure. Though effective such algorithms employ very little information in their successor selection strategy, typically seeking only to minimise the cost of a move. We propose an alternative approach inspired from the AI literature and show how an admissible heuristic can be used to guide successor selection. We undertake an empirical analysis and demonstrate that this technique often produces better results than less informed strategies albeit at the cost of running in higher polynomial time.

The challenge of using communications infrastructure to stabilize other infrastructures is related to research on the collective communications systems in social animals, robots, and human-non-human interaction. In these systems, voting models can explicate patterns of observed behavior or predict collective outcomes. Developing more theoretical deductive explanatory power can increase our knowledge about the interplay of voters and communication that produces collective inferences. This paper suggests that many analyses of voting patterns have not integrated what is known about the predictive properties of voting processes into their analyses. Taking a more deductive approach enables us to think about the strengths and weaknesses of existing explanations and imagine new types of analysis that have implications for engineering communications systems to stabilize other infrastructures.

The concept of modeling multiple complex adaptive systems (CAS) as if they were voting processes proposes that an Error Resilient Data Fusion (ERDF) method can help to mitigate the effects of emergent properties in CAS system-of-systems (SoS). The property of emergence in a CAS composed of multiple, multi-modal sensors poses specific problems for fusion processes due to the difficulty in predicting and accounting for sensor performance under disparate environmental conditions. This paper compares the voting and Choquet integral fusion methods in the context of a multi-modal sensor ERDF SoS.

It is now time to begin the study of personal genome services based on the interdisciplinary theories and technologies of genomics and artificial intelligence (AI). Although recently much attention has been given to personal genome services for realizing personal medicine, little systematic research has been done on their communication and computational aspects for intelligent wellness service in AI communities. We believe that the intelligent personal genome services of the future need to include an understanding of how the knowledge of genetic risk influences people's behavior. This paper proposes the concept of MyFinder, a new framework for realizing an intimate personal genome service with AI technologies. This paper also describes the grand challenge problems of personal genome services that the AI and genomics communities should tackle jointly.

If computational social science is to find practical application in informing policy decisions and proportionately analyzing courses of action, then it will have to make progress in the area of composition of social models.  Since a single simulation cannot hold a world of information, policy makers need to switch in and out modules in federations of simulations to test policies against all possible social environments.  Voting processes as they occur in nature, both in the form of cognition in a human mind of disparate world views, and in the form of equilibria seeking coevolution of species, inform how to combine model results externally and deeply, respectively.  These algorithms, which use the same principles of soft computation found in nature, enable any models to mesh together, even if they have different ontologies, or their data conflict, regardless of the degree they overlap.  A whiteboard architecture in which models report in their own ontologies how other models may inform them and what they have to offer other models, is a framework for the arbitrary meshing of social models.