The Algebra of Directed Acyclic Graphs

We give an algebraic presentation of directed acyclic graph structure, introducing a symmetric monoidal equational theory whose free PROP we characterise as that of finite abstract dags with input/output interfaces. Our development provides an initial-algebra semantics for dag structure

Learning Bounded Treewidth Bayesian Networks with Thousands of Variables

We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian greatly reduces the complexity of inferences. Yet, being a global property of the graph, it considerably increases the difficulty of the learning process. We propose a novel algorithm for this task, able to scale to large domains and large treewidths. Our novel approach consistently outperforms the state of the art on data sets with up to ten thousand variables

Sobre a produçâo de significados e a tomada de decisâo de indivíduos-consumidores

Esta pesquisa qualitativa investigou os significados produzidos e as tomadas de decisão de indivíduos consumidores por meio de entrevistas semi-estruturadas e situações-problema envolvendo temas e objetos financeiro-econômicos numa sociedade de consumo líquido-moderna. Nos embasamos em pressupostos teóricos da Educação Matemática Crítica de Ole Skovsmose, do Modelo dos Campos Semânticos (MCS) de Romulo Campos Lins e teorias sociológicas e econômicas sobre práticas de consumo. Após realização do estudo piloto e da segunda etapa de investigações com individuos-consumidores, conseguimos ler plausivelmente, a produção de significados dos individuos-consumidores. Os resultados apresentados nesse artigo podem auxiliar as práticas de ensino de conteúdos financeiros na disciplina de Matemática

Searching for Elko dark matter spinors at the CERN LHC

The aim of this work is to explore the possibility to discover a fermionic field with mass dimension one, the Elko field, in the Large Hadron Collider (LHC). Due to its mass dimension, an Elko can only interact either with Standard Model (SM) spinors and gauge fields at 1-loop order or at tree level through a quartic interaction with the Higgs field. In this Higgs portal scenario, the Elko is a viable candidate to a dark matter constituent which has been shown to be compatible with relic abundance measurements from WMAP and direct dark matter--nucleon searches. We propose a search strategy for this dark matter candidate in the channel $pp \rightarrow l^+ l^- + \not\!\! E_T$ at the $\sqrt{s}=14$ TeV LHC. We show the LHC potential to discover the Elko considering a triple Higgs-Elko coupling as small as $\sim 0.5$ after 1 pb$^{-1}$ of integrated luminosity. Some phenomenological consequences of this new particle and its collider signatures are also discussed.Comment: 7 pages, 3 figure

Classical Logic with Mendler Induction

We investigate (co-)induction in Classical Logic under the propositions-as-types paradigm, considering propositional, second-order, and (co-)inductive types. Specifically, we introduce an extension of the Dual Calculus with a Mendler-style (co-)iterator that remains strongly normalizing under head reduction. We prove this using a non-constructive realizability argument.This is the author accepted manuscript. The final version is available from Springer via http://dx.doi.org/10.1007/978-3-319-27683-0_

Classical logic with Mendler induction

We investigate (co-) induction in classical logic under the propositions-as-types paradigm, considering propositional, second-order and (co-) inductive types. Specifically, we introduce an extension of the Dual Calculus with a Mendler-style (co-) iterator and show that it is strongly normalizing. We prove this using a reducibility argument

Implementation of an orchestration language as a haskell domain specific language

Even though concurrent programming has been a hot topic of discussion in Computer Science for the past 30 years, the community has yet to settle on a, or a few standard approaches to implement concurrent programs. But as more and more cores inhabit our CPUs and more and more services are made available on the web the problem of coordinating different tasks becomes increasingly relevant. The present paper addresses this problem with an implementation of the orchestration language Orc as a domain specific language in Haskell. Orc was, therefore, realized as a combinator library using the lightweight threads and the communication and synchronization primitives of the Concurrent Haskell library. With this implementation it becomes possible to create orchestrations that re-use existing Haskell code and, conversely, re-use orchestrations inside other Haskell programs. The complexity inherent to distributed computation, entails the need for the classification of efficient, re-usable, concurrent programming patterns. The paper discusses how the calculus of recursive schemes used in the derivation of functional programs, scales up to a distributed setting. It is shown, in particular, how to parallelize the entire class of binary tree hylomorphisms.FCT -Fuel Cell Technologies Program(PTDC/EIA/73252/2006