Other Computer Sciences Commons^™

Multi-Type Display Calculus For Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić

Engineering Faculty Articles and Research

In the present paper, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The displayapproach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoretic treatment, and paves the way towards a general methodology for the design of proof systems for the generality of dynamic logics, and certainly beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag-Moss-Solecki’s dynamic epistemic logic, and enjoys Belnap-style cut …

Qubit Measurement Error From Coupling With A Detuned Neighbor In Circuit Qed, Mostafa Khezri, Justin Dressel, Alexander N. Korotkov

Mathematics, Physics, and Computer Science Faculty Articles and Research

In modern circuit QED architectures, superconducting transmon qubits are measured via the state-dependent phase and amplitude shift of a microwave field leaking from a coupled resonator. Determining this shift requires integrating the field quadratures for a nonzero duration, which can permit unwanted concurrent evolution. Here we investigate such dynamical degradation of the measurement fidelity caused by a detuned neighboring qubit. We find that in realistic parameter regimes, where the qubit ensemble-dephasing rate is slower than the qubit-qubit detuning, the joint qubit-qubit eigenstates are better discriminated by measurement than the bare states. Furthermore, we show that when the resonator leaks much …

Information Diffusion, Facebook Clusters, And The Simplicial Model Of Social Aggregation: A Computational Simulation Of Simplicial Diffusers For Community Health Interventions, Kerk Kee, Lisa Sparks, Daniele C. Struppa, Mirco A. Manucci, Alberto Damiano

Communication Faculty Articles and Research

By integrating the simplicial model of social aggregation with existing research on opinion leadership and diffusion networks, this article introduces the constructs of simplicial diffusers (mathematically defined as nodes embedded in simplexes; a simplex is a socially bonded cluster) and simplicial diffusing sets (mathematically defined as minimal covers of a simplicial complex; a simplicial complex is a social aggregation in which socially bonded clusters are embedded) to propose a strategic approach for information diffusion of cancer screenings as a health intervention on Facebook for community cancer prevention and control. This approach is novel in its incorporation of interpersonally bonded clusters, …

An Application Of The Autism Management Platform To Tracking Student Progress In The Special Education Environment, Ryan Thomas Burns

Computational and Data Sciences Theses

In the age of online courses and digital textbooks, several areas of academia, such as special education, are far behind in the technological revolution. Some teachers use long unstructured digital documents, while others maintain large physical files for students containing every piece of information or coursework they have ever received. Could these extremely unstructured approaches to data collection and aggregation be streamlined with a software platform built specifically for this purpose? Could this platform also be built to accommodate multiple integrations and practical new features? Most importantly, in terms of usability, would this software be enjoyable to use? The Autism …

Positive Fragments Of Coalgebraic Logics, Adriana Balan, Alexander Kurz, Jirí Velebil

Engineering Faculty Articles and Research

Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond. In this paper, we provide a coalgebraic analysis of this theorem, which not only gives a conceptual proof based on duality theory, but also generalizes Dunn's result from Kripke frames to coalgebras for weak-pullback preserving functors. To facilitate this analysis we prove a number of category theoretic results on …

Presenting Distributive Laws, Marcello M. Bonsangue, Helle H. Hansen, Alexander Kurz, Jurriaan Rot

Engineering Faculty Articles and Research

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural operational semantics and, more recently, also for enhancements of the bisimulation proof method. If T is a free monad, then such distributive laws correspond to simple natural transformations. However, when T is not free it can be rather difficult to prove the defining axioms of a distributive law. In this paper we describe how to obtain a distributive law for a monad with an equational presentation …

Extensions Of Functors From Set To V-Cat, Adriana Balan, Alexander Kurz, Jirí Velebil

Engineering Faculty Articles and Research

We show that for a commutative quantale V every functor Set --> V-cat has an enriched left- Kan extension. As a consequence, coalgebras over Set are subsumed by coalgebras over V-cat. Moreover, one can build functors on V-cat by equipping Set-functors with a metric.

Coalgebraic Semantics Of Reflexive Economics (Dagstuhl Seminar 15042), Samson Abramsky, Alexander Kurz, Pierre Lescanne, Viktor Winschel

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 15042 “Coalgebraic Semantics of Reflexive Economics”.

Preface To "Intertwingled: The Work And Influence Of Ted Nelson", Douglas R. Dechow, Daniele C. Struppa

Mathematics, Physics, and Computer Science Faculty Books and Book Chapters

This is the preface to "Intertwingled: The Work and Influence of Ted Nelson", which examines and honors the work and influence of the computer visionary and re-imagines its meaning for the future. Emerging from a conference held in 2014 at Chapman University, it includes contributions from world-renowned computer scientists and media figures.

The full text of this book is available on an open access basis at Springer.

The blog for the Intertwingled Conference can be read here.

Choice Of Human–Computer Interaction Mode In Stroke Rehabilitation, Hossein Mousavi Hondori, Maryam Khademi, Lucy Dodakian, Alison Mackenzie, Cristina V. Lopes, Steven C. Cramer

Physical Therapy Faculty Articles and Research

Background and Objective. Advances in technology are providing new forms of human–computer interaction. The current study examined one form of human–computer interaction, augmented reality (AR), whereby subjects train in the real-world workspace with virtual objects projected by the computer. Motor performances were compared with those obtained while subjects used a traditional human–computer interaction, that is, a personal computer (PC) with a mouse. Methods. Patients used goal-directed arm movements to play AR and PC versions of the Fruit Ninja video game. The 2 versions required the same arm movements to control the game but had different cognitive demands. With …

Approximation Of Nested Fixpoints, Alexander Kurz

Engineering Faculty Articles and Research

The question addressed in this paper is how to correctly approximate infinite data given by systems of simultaneous corecursive definitions. We devise a categorical framework for reasoning about regular datatypes, that is, datatypes closed under products, coproducts and fixpoints. We argue that the right methodology is on one hand coalgebraic (to deal with possible nontermination and infinite data) and on the other hand 2-categorical (to deal with parameters in a disciplined manner). We prove a coalgebraic version of Bekic lemma that allows us to reduce simultaneous fixpoints to a single fix point. Thus a possibly infinite object of interest is …

Detection And Tracking Of T Cells In Time-Lapse Imaging, Cody Arbuckle, Milton L. Greenberg, Erik J. Linstead

Mathematics, Physics, and Computer Science Faculty Articles and Research

The effective classification and tracking of cells obtained from modern staining techniques has significant limitations due to the necessity of having to train and utilize a human expert in the field who must manually identify each cell in each slide. Often times these slides are filled with noise cells that are not of particular interest to the researcher. The use of computational methods has the ability to effectively and efficiently enhance image quality, as well as identify and track target cell types over large data sets. Here we present a computational approach to the in vitro tracking of T cells …

Improving The Efficacy Of Web-Based Educational Outreach In Ecology, Gregory R. Goldsmith, Andrew D. Fulton, Colin D. Witherill, Javier F. Espeleta

Biology, Chemistry, and Environmental Sciences Faculty Articles and Research

Scientists are increasingly engaging the web to provide formal and informal science education opportunities. Despite the prolific growth of web-based resources, systematic evaluation and assessment of their efficacy remains limited. We used clickstream analytics, a widely available method for tracking website visitors and their behavior, to evaluate 60,000 visits over three years to an educational website focused on ecology. Visits originating from search engine queries were a small proportion of the traffic, suggesting the need to actively promote websites to drive visitation. However, the number of visits referred to the website per social media post varied depending on the social …

High Performance Computing Markov Models Using Hadoop Mapreduce, Matthew Shaffer

e-Research: A Journal of Undergraduate Work

In this paper, I will explain how I used the probability modeling tool, Markov Models, in combination with Hadoop MapReduce parallel programming platform in order to quickly and efficiently analyses documents and create a probability model of them. I will explain what Markov Models are, give a brief overview of what MapReduce is, explain why Markov models can be used for document analysis, explain my code of the modeling program, and examine the performance of various MapReduce platforms and techniques in analyzing documents.

A Proof-Theoretic Semantic Analysis Of Dynamic Epistemic Logic, Sabine Frittella, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano, Vlasta Sikimić

Engineering Faculty Articles and Research

The present paper provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best known members of a family of logical systems which have been successfully applied to diverse scientific disciplines, but the proof theoretic treatment of which presents many difficulties. After an illustration of the proof-theoretic semantic principles most relevant to the treatment of logical connectives, we turn to illustrating the main features of display calculi, a proof-theoretic paradigm which has been successfully employed to give a proof-theoretic semantic account of modal and substructural …

Epistemic Updates On Algebras, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

We develop the mathematical theory of epistemic updates with the tools of duality theory. We focus on the Logic of Epistemic Actions and Knowledge (EAK), introduced by Baltag-Moss-Solecki, without the common knowledge operator. We dually characterize the product update construction of EAK as a certain construction transforming the complex algebras associated with the given model into the complex algebra associated with the updated model. This dual characterization naturally generalizes to much wider classes of algebras, which include, but are not limited to, arbitrary BAOs and arbitrary modal expansions of Heyting algebras (HAOs). As an application of this dual characterization, we …

Nominal Regular Expressions For Languages Over Infinite Alphabets, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto

Engineering Faculty Articles and Research

We propose regular expressions to abstractly model and study properties of resource-aware computations. Inspired by nominal techniques – as those popular in process calculi – we extend classical regular expressions with names (to model computational resources) and suitable operators (for allocation, deallocation, scoping of, and freshness conditions on resources). We discuss classes of such nominal regular expressions, show how such expressions have natural interpretations in terms of languages over infinite alphabets, and give Kleene theorems to characterise their formal languages in terms of nominal automata.

Dynamic Sequent Calculus For The Logic Of Epistemic Actions And Knowledge, Giuseppe Greco, Alexander Kurz, Alessandra Palmigiano

Engineering Faculty Articles and Research

"Dynamic Logics (DLs) form a large family of nonclassical logics, and perhaps the one enjoying the widest range of applications. Indeed, they are designed to formalize change caused by actions of diverse nature: updates on the memory state of a computer, displacements of moving robots in an environment, measurements in models of quantum physics, belief revisions, knowledge updates, etc. In each of these areas, DL-formulas express properties of the model encoding the present state of affairs, as well as the pre- and post-conditions of a given action. Actions are semantically represented as transformations of one model into another, encoding the …

Relation Lifting, With An Application To The Many-Valued Cover Modality, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jirí Velebil

Engineering Faculty Articles and Research

We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the “powerset monad” on categories, one is the preservation by T of “exactness” of certain squares. Both characterisations are generalisations of the “classical” results known for set functors: the first characterisation generalises the existence of a distributive law over the genuine powerset monad, the second generalises preservation of weak pullbacks.

The results presented in this paper …

Nominal Coalgebraic Data Types With Applications To Lambda Calculus, Alexander Kurz, Daniela Petrişan, Paula Severi, Fer-Jan De Vries

Engineering Faculty Articles and Research

We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.

Nominal Computation Theory (Dagstuhl Seminar 13422), Mikołaj Bojanczyk, Bartek Klin, Alexander Kurz, Andrew M. Pitts

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 13422 “Nominal Computation Theory”. The underlying theme of the seminar was nominal sets (also known as sets with atoms or Fraenkel-Mostowski sets) and they role and applications in three distinct research areas: automata over infinite alphabets, program semantics using nominal sets and nominal calculi of concurrent processes.

Strongly Complete Logics For Coalgebras, Alexander Kurz, Jiří Rosický

Engineering Faculty Articles and Research

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary set-functor is given and proven to be strongly complete under additional assumptions. We proceed in three parts.

Part I argues that sifted colimit preserving functors are those functors that preserve universal algebraic structure. Our main theorem here states that a functor preserves sifted colimits if and only if it has a finitary presentation by operations and equations. Moreover, the presentation of the …

Completeness For The Coalgebraic Cover Modality, Clemens Kupke, Alexander Kurz, Yde Venema

Engineering Faculty Articles and Research

We study the finitary version of the coalgebraic logic introduced by L. Moss. The syntax of this logic, which is introduced uniformly with respect to a coalgebraic type functor, required to preserve weak pullbacks, extends that of classical propositional logic with a so-called coalgebraic cover modality depending on the type functor. Its semantics is defined in terms of a categorically defined relation lifting operation.

As the main contributions of our paper we introduce a derivation system, and prove that it provides a sound and complete axiomatization for the collection of coalgebraically valid inequalities. Our soundness and completeness proof is algebraic, …

Coalgebraic Logics (Dagstuhl Seminar 12411), Ernst-Erich Doberkat, Alexander Kurz

Engineering Faculty Articles and Research

This report documents the program and the outcomes of Dagstuhl Seminar 12411 “Coalgebraic Logics”. The seminar deals with recent developments in the area of coalgebraic logic, a branch of logics which combines modal logics with coalgebraic semantics. Modal logic finds its uses when reasoning about behavioural and temporal properties of computation and communication, coalgebras have evolved into a general theory of systems. Consequently, it is natural to combine both areas for a mathematical description of system specification. Coalgebraic logics are closely related to the broader categories semantics/formal methods and verification/logic.

Relation Liftings On Preorders And Posets, Marta Bílková, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss’s coalgebraic over posets.

Towards Nominal Formal Languages, Alexander Kurz, Tomoyuki Suzuki, Emilio Tuosto

Engineering Faculty Articles and Research

We introduce formal languages over infinite alphabets where words may contain binders.We define the notions of nominal language, nominal monoid, and nominal regular expressions. Moreover, we extend history-dependent automata (HD-automata) by adding stack, and study the recognisability of nominal languages.

Generic Trace Logics, Christian Kissig, Alexander Kurz

Engineering Faculty Articles and Research

We combine previous work on coalgebraic logic with the coalgebraic traces semantics of Hasuo, Jacobs, and Sokolova.

On Universal Algebra Over Nominal Sets, Alexander Kurz, Daniela Petrişan

Engineering Faculty Articles and Research

We investigate universal algebra over the category Nom of nominal sets. Using the fact that Nom is a full re ective subcategory of a monadic category, we obtain an HSP-like theorem for algebras over nominal sets. We isolate a `uniform' fragment of our equational logic, which corresponds to the nominal logics present in the literature. We give semantically invariant translations of theories for nominal algebra and NEL into `uniform' theories and systematically prove HSP theorems for models of these theories.

Families Of Symmetries As Efficient Models Of Resource Binding, Vincenzo Ciancia, Alexander Kurz, Ugo Montanari

Engineering Faculty Articles and Research

Calculi that feature resource-allocating constructs (e.g. the pi-calculus or the fusion calculus) require special kinds of models. The best-known ones are presheaves and nominal sets. But named sets have the advantage of being finite in a wide range of cases where the other two are infinite. The three models are equivalent. Finiteness of named sets is strictly related to the notion of finite support in nominal sets and the corresponding presheaves. We show that named sets are generalisd by the categorical model of families, that is, free coproduct completions, indexed by symmetries, and explain how locality of interfaces gives good …

Bitopological Duality For Distributive Lattices And Heyting Algebras, Guram Bezhanishvili, Nick Bezhanishvili, David Gabelaia, Alexander Kurz

Engineering Faculty Articles and Research

We introduce pairwise Stone spaces as a natural bitopological generalization of Stone spaces—the duals of Boolean algebras—and show that they are exactly the bitopological duals of bounded distributive lattices. The category PStone of pairwise Stone spaces is isomorphic to the category Spec of spectral spaces and to the category Pries of Priestley spaces. In fact, the isomorphism of Spec and Pries is most naturally seen through PStone by first establishing that Pries is isomorphic to PStone, and then showing that PStone is isomorphic to Spec. We provide the bitopological and spectral descriptions of many algebraic concepts important for the study …