A Grammatical Inference Approach to Language-Based Anomaly Detection in XML

False-positives are a problem in anomaly-based intrusion detection systems. To counter this issue, we discuss anomaly detection for the eXtensible Markup Language (XML) in a language-theoretic view. We argue that many XML-based attacks target the syntactic level, i.e. the tree structure or element content, and syntax validation of XML documents reduces the attack surface. XML offers so-called schemas for validation, but in real world, schemas are often unavailable, ignored or too general. In this work-in-progress paper we describe a grammatical inference approach to learn an automaton from example XML documents for detecting documents with anomalous syntax. We discuss properties and expressiveness of XML to understand limits of learnability. Our contributions are an XML Schema compatible lexical datatype system to abstract content in XML and an algorithm to learn visibly pushdown automata (VPA) directly from a set of examples. The proposed algorithm does not require the tree representation of XML, so it can process large documents or streams. The resulting deterministic VPA then allows stream validation of documents to recognize deviations in the underlying tree structure or datatypes.Comment: Paper accepted at First Int. Workshop on Emerging Cyberthreats and Countermeasures ECTCM 201

Merging DNA metabarcoding and ecological network analysis to understand and build resilient terrestrial ecosystems

Summary 1. Significant advances in both mathematical and molecular approaches in ecology offer unprecedented opportunities to describe and understand ecosystem functioning. Ecological networks describe interactions between species, the underlying structure of communities and the function and stability of ecosystems. They provide the ability to assess the robustness of complex ecological communities to species loss, as well as a novel way of guiding restoration. However, empirically quantifying the interactions between entire communities remains a significant challenge. 2. Concomitantly, advances in DNA sequencing technologies are resolving previously intractable questions in functional and taxonomic biodiversity and provide enormous potential to determine hitherto difficult to observe species interactions. Combining DNA metabarcoding approaches with ecological network analysis presents important new opportunities for understanding large-scale ecological and evolutionary processes, as well as providing powerful tools for building ecosystems that are resilient to environmental change. 3. We propose a novel ‘nested tagging’ metabarcoding approach for the rapid construction of large, phylogenetically structured species-interaction networks. Taking tree–insect–parasitoid ecological networks as an illustration, we show how measures of network robustness, constructed using DNA metabarcoding, can be used to determine the consequences of tree species loss within forests, and forest habitat loss within wider landscapes. By determining which species and habitats are important to network integrity, we propose new directions for forest management. 4. Merging metabarcoding with ecological network analysis provides a revolutionary opportunity to construct some of the largest, phylogenetically structured species-interaction networks to date, providing new ways to: (i) monitor biodiversity and ecosystem functioning; (ii) assess the robustness of interacting communities to species loss; and (iii) build ecosystems that are more resilient to environmental change

Blending Learning and Inference in Structured Prediction

In this paper we derive an efficient algorithm to learn the parameters of structured predictors in general graphical models. This algorithm blends the learning and inference tasks, which results in a significant speedup over traditional approaches, such as conditional random fields and structured support vector machines. For this purpose we utilize the structures of the predictors to describe a low dimensional structured prediction task which encourages local consistencies within the different structures while learning the parameters of the model. Convexity of the learning task provides the means to enforce the consistencies between the different parts. The inference-learning blending algorithm that we propose is guaranteed to converge to the optimum of the low dimensional primal and dual programs. Unlike many of the existing approaches, the inference-learning blending allows us to learn efficiently high-order graphical models, over regions of any size, and very large number of parameters. We demonstrate the effectiveness of our approach, while presenting state-of-the-art results in stereo estimation, semantic segmentation, shape reconstruction, and indoor scene understanding