Labor monitoring is crucial in modern health care, as it can be used to detect (and help avoid) significant problems with the fetus. In this article we focus on detecting hypoxia (or oxygen deprivation), a very serious condition that can arise from different pathologies and can lead to life-long disability and death. We present a novel approach to hypoxia detection based on recordings of the uterine pressure and fetal heart rate, which are obtained using standard labor monitoring devices. The key idea is to learn models of the fetal response to signals from its environment. Then, we use the parameters of these models as attributes in a binary classification problem. A running count of pathological classifications over several time periods is taken to provide the current label for the fetus. We use a unique database of real clinical recordings, both from normal and pathological cases. Our approach classifies correctly more than half the pathological cases, 1.5 hours before delivery. These are cases that were missed by clinicians; early detection of this type would have allowed the physician to perform a Caesarean section, possibly avoiding the negative outcome.

Fourteenth International Conference held in cooperation with AAAI. ICEIS 2012 will be held June 28 at www.aaai.org/Magazine/calendar.php. RuleML-2012 will be Artificial Intelligence. IAAI-13 will be held July 14-18, 2013, France. in Bellevue, Washington, USA AIIDE-12 will be 2012 will be held June 10-14, 2012 in on Digital Storytelling.

Then we add some world knowledge, in the form of commonsense statements, to help in the text understanding. The result combines this knowledge to form a multidimensional space where concepts, people, groups, and projects are all represented as vectors. From that space we retrieve information relevant to lab visitors--dynamically creating their presence in the vector space by creating a vector from the projects they have chosen as favorites. We then use the vector space to determine the relevance of objects in the space to each other--determining which projects are similar, which projects would be good fits for a lab visitor, and which projects fit which lab themes. Additionally, we have designed a user interface that makes this system easy and social to interact with. The following subections discuss our approach to interface design, our methods for extracting semantic information from the text base, and for assessing similarity of user interests with that knowledge.

In many real-life domains, such as trading environments, selfinterested entities need to operate subject to limited time and information. Additionally, the web has mediated an ever broader range of transactions, urging participants to concurrently trade across multiple markets. All these have generated the need for technologies that empower prompt investigation of large volumes of data and rapid evaluation of numerous alternative strategies in the face of constantly changing market conditions (Bichler, Gupta, and Ketter 2010). AI and machine-learning techniques, including neural networks and genetic algorithms, are continuously gaining ground in the support of such trading scenarios. User modeling, price forecasting, market equilibrium prediction, and strategy optimization are typical cases where AI typically provides reliable solutions. Yet, the adoption and deployment of AI practices in real trading environments remains limited, since the proprietary nature of markets precludes open benchmarking, which is critical for further scientific progress.

As a result, it is good to read these articles from a practical perspective. Papers that document deployed systems clarify the motivating application constraints, the match (and mismatch) between problems and technology, the innovations required to surmount barriers to deployment, and the impact of technology on application through practical measures of cost and benefit. Other articles describe applications that are almost feasible, drawn from papers in the IAAI emergent applications track. These papers provide a window into the search for viable applications at an earlier stage in the process of mating task with technology. All of the articles supply insight into the core question of what is feasible and why, which is a useful lens for us, as readers, to employ in viewing our own work. This special issue of AI Magazine contains expanded versions of five papers that describe deployed applications and two papers that discuss emergent applications from IAAI-11 (the article by Warrick and colleagues is from IAAI-10).

In this paper we promote introducing software verification and control flow graph similarity measurement in automated evaluation of students' programs. We present a new grading framework that merges results obtained by combination of these two approaches with results obtained by automated testing, leading to improved quality and precision of automated grading. These two approaches are also useful in providing a comprehensible feedback that can help students to improve the quality of their programs We also present our corresponding tools that are publicly available and open source. The tools are based on LLVM low-level intermediate code representation, so they could be applied to a number of programming languages. Experimental evaluation of the proposed grading framework is performed on a corpus of university students' programs written in programming language C. Results of the experiments show that automatically generated grades are highly correlated with manually determined grades suggesting that the presented tools can find real-world applications in studying and grading.

We present a joint message passing approach that combines belief propagation and the mean field approximation. Our analysis is based on the region-based free energy approximation method proposed by Yedidia et al. We show that the message passing fixed-point equations obtained with this combination correspond to stationary points of a constrained region-based free energy approximation. Moreover, we present a convergent implementation of these message passing fixedpoint equations provided that the underlying factor graph fulfills certain technical conditions. In addition, we show how to include hard constraints in the part of the factor graph corresponding to belief propagation. Finally, we demonstrate an application of our method to iterative channel estimation and decoding in an orthogonal frequency division multiplexing (OFDM) system.

In parsing, spurious ambiguity refers to ambiguity in a grammar that occurs because several derivations exist for an identical syntactic analysis. When the grammar is enriched with probabilities, the existence of spurious ambiguity implies that the statistical model is defined over derivations, a more fine-grained version of the actual syntactic structures of interest. The probability of a syntactic structure then becomes the marginalized probability over all derivations that map to that syntactic structure. Spurious ambiguity can exist in various grammatical models such as combinatory categorial grammars [Steedman, 2001], tree adjoining grammars [Joshi et al., 1975], data-oriented parsing [Bod, 1992] and transition-based dependency parsing [Nivre, 2005].

Can one parallelize complex exploration exploitation tradeoffs? As an example, consider the problem of optimal high-throughput experimental design, where we wish to sequentially design batches of experiments in order to simultaneously learn a surrogate function mapping stimulus to response and identify the maximum of the function. We formalize the task as a multi-armed bandit problem, where the unknown payoff function is sampled from a Gaussian process (GP), and instead of a single arm, in each round we pull a batch of several arms in parallel. We develop GP-BUCB, a principled algorithm for choosing batches, based on the GP-UCB algorithm for sequential GP optimization. We prove a surprising result; as compared to the sequential approach, the cumulative regret of the parallel algorithm only increases by a constant factor independent of the batch size B. Our results provide rigorous theoretical support for exploiting parallelism in Bayesian global optimization. We demonstrate the effectiveness of our approach on two real-world applications.

In this paper we relate the partition function to the max-statistics of random variables. In particular, we provide a novel framework for approximating and bounding the partition function using MAP inference on randomly perturbed models. As a result, we can use efficient MAP solvers such as graph-cuts to evaluate the corresponding partition function. We show that our method excels in the typical "high signal - high coupling" regime that results in ragged energy landscapes difficult for alternative approaches.