Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Chapman University (46)
- University of New Mexico (30)
- Loyola University Chicago (6)
- University of Arkansas, Fayetteville (5)
- University of Texas at El Paso (4)
-
- Old Dominion University (3)
- University of Nebraska - Lincoln (3)
- Portland State University (2)
- Technological University Dublin (2)
- Air Force Institute of Technology (1)
- Edith Cowan University (1)
- Illinois Math and Science Academy (1)
- Macalester College (1)
- Marquette University (1)
- Pace University (1)
- University of Pennsylvania Carey Law School (1)
- University of South Carolina (1)
- Utah State University (1)
- Keyword
-
- Coalgebra (13)
- Modal logic (6)
- DSmT (5)
- Robotics (5)
- Computer science education (4)
-
- Information fusion (4)
- Neutrosophic logic (4)
- Belief functions (3)
- Coalgebraic logic (3)
- Coalgebras (3)
- Computer programming (3)
- Display calculus (3)
- Mathematics (3)
- Matrices (3)
- Algebra (2)
- Artificial intelligence (2)
- Communication (2)
- Complexity reduction (2)
- Computer Science (2)
- Cover modality (2)
- Data analysis (2)
- Data mining (2)
- Descriptive general frames (2)
- Distance (2)
- Duality (2)
- Dynamic epistemic logic (2)
- Kripke polynomial functors (2)
- Measure of similarity (2)
- Modal Logic (2)
- Modularity (2)
- Publication Year
- Publication
-
- Engineering Faculty Articles and Research (46)
- Branch Mathematics and Statistics Faculty and Staff Publications (30)
- Computer Science: Faculty Publications and Other Works (6)
- Mathematical Sciences Spring Lecture Series (5)
- Departmental Technical Reports (CS) (4)
-
- Articles (2)
- AFIT Patents (1)
- All Faculty Scholarship (1)
- CSE Conference and Workshop Papers (1)
- Cornerstone 3 Reports : Interdisciplinary Informatics (1)
- Department of Mathematics: Dissertations, Theses, and Student Research (1)
- Department of Mathematics: Faculty Publications (1)
- Electrical & Computer Engineering Faculty Publications (1)
- Electrical and Computer Engineering Faculty Research and Publications (1)
- Engineering Technology Faculty Publications (1)
- Engineering and Technology Management Faculty Publications and Presentations (1)
- Faculty Publications (1)
- Mathematics and Statistics Faculty Publications and Presentations (1)
- Mathematics, Statistics, and Computer Science Honors Projects (1)
- Publications & Research (1)
- Research on Capitol Hill (1)
- Research outputs 2014 to 2021 (1)
- VMASC Publications (1)
Articles 91 - 110 of 110
Full-Text Articles in Computer Engineering
Matlab Report, Nancy Hale
Matlab Report, Nancy Hale
Cornerstone 3 Reports : Interdisciplinary Informatics
The objective of this effort is to create a multidisciplinary approach to problem solving using technology. Through Thinkfinity, the Seidenberg School of Computer Science and Information Systems is collaborating with the science and quantitative faculty to create lessons that can be used by high school and first -year college students to work interactively with data to solve problems. MatLab is the tool of choice. It gives the user the ability to create visual models of large data sets and is used in the science and finance areas.
The key features of MatLab:
• Interactive tools for iterative exploration, design, and …
New Classes Of Codes For Cryptologists And Computer Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy
New Classes Of Codes For Cryptologists And Computer Scientists, Florentin Smarandache, W.B. Vasantha Kandasamy
Branch Mathematics and Statistics Faculty and Staff Publications
Historically a code refers to a cryptosystem that deals with linguistic units: words, phrases etc. We do not discuss such codes in this book. Here codes are message carriers or information storages or information transmitters which in time of need should not be decoded or read by an enemy or an intruder. When we use very abstract mathematics in using a specific code, it is difficult for non-mathematicians to make use of it. At the same time, one cannot compromise with the capacity of the codes. So the authors in this book have introduced several classes of codes which are …
Functorial Coalgebraic Logic: The Case Of Many-Sorted Varieties, Alexander Kurz, Daniela Petrişan
Functorial Coalgebraic Logic: The Case Of Many-Sorted Varieties, Alexander Kurz, Daniela Petrişan
Engineering Faculty Articles and Research
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This paper makes two contributions. First, a previous result characterizing those functors that have presentations is generalized from endofunctors on one-sorted varieties to functors between many-sorted varieties. This yields an equational logic for the presheaf semantics of higher-order abstract syntax. As another application, we show how the move to functors between many-sorted varieties allows to modularly combine syntax and proof systems of different logics. Second, we show how to associate …
Pi-Calculus In Logical Form, Marcello M. Bonsangue, Alexander Kurz
Pi-Calculus In Logical Form, Marcello M. Bonsangue, Alexander Kurz
Engineering Faculty Articles and Research
Abramsky’s logical formulation of domain theory is extended to encompass the domain theoretic model for picalculus processes of Stark and of Fiore, Moggi and Sangiorgi. This is done by defining a logical counterpart of categorical constructions including dynamic name allocation and name exponentiation, and showing that they are dual to standard constructs in functor categories. We show that initial algebras of functors defined in terms of these constructs give rise to a logic that is sound, complete, and characterises bisimilarity. The approach is modular, and we apply it to derive a logical formulation of pi-calculus. The resulting logic is a …
Clarifications Of Rule 2 In Teaching Geometric Dimensioning And Tolerancing, Cheng Lin, Alok Verma
Clarifications Of Rule 2 In Teaching Geometric Dimensioning And Tolerancing, Cheng Lin, Alok Verma
Engineering Technology Faculty Publications
Geometric dimensioning and tolerancing is a symbolic language used on engineering drawings and computer generated three-dimensional solid models for explicitly describing nominal geometry and its allowable variation. Application cases using the concept of Rule 2 in the Geometric Dimensioning and Tolerancing (GD&T) are presented. The rule affects all fourteen geometric characteristics. Depending on the nature and location where each feature control frame is specified, interpretation on the applicability of Rule 2 is quite inconsistent. This paper focuses on identifying the characteristics of a feature control frame to remove this inconsistency. A table is created to clarify the confusions for students …
The Formal Laplace-Borel Transform Of Fliess Operators And The Composition Product, Yaqin Li, W. Steven Gray
The Formal Laplace-Borel Transform Of Fliess Operators And The Composition Product, Yaqin Li, W. Steven Gray
Electrical & Computer Engineering Faculty Publications
The formal Laplace-Borel transform of an analytic integral operator, known as a Fliess operator, is defined and developed. Then, in conjunction with the composition product over formal power series, the formal Laplace-Borel transform is shown to provide an isomorphism between the semigroup of all Fliess operators under operator composition and the semigroup of all locally convergent formal power series under the composition product. Finally, the formal Laplace-Borel transform is applied in a systems theory setting to explicitly derive the relationship between the formal Laplace transform of the input and output functions of a Fliess operator. This gives a compact interpretation …
Coalgebras And Their Logics, Alexander Kurz
Coalgebras And Their Logics, Alexander Kurz
Engineering Faculty Articles and Research
"Transition systems pervade much of computer science. This article outlines the beginnings of a general theory of specification languages for transition systems. More specifically, transition systems are generalised to coalgebras. Specification languages together with their proof systems, in the following called (logical or modal) calculi, are presented by the associated classes of algebras (e.g., classical propositional logic by Boolean algebras). Stone duality will be used to relate the logics and their coalgebraic semantics."
Weak Factorizations, Fractions And Homotopies, Alexander Kurz, Jiří Rosický
Weak Factorizations, Fractions And Homotopies, Alexander Kurz, Jiří Rosický
Engineering Faculty Articles and Research
We show that the homotopy category can be assigned to any category equipped with a weak factorization system. A classical example of this construction is the stable category of modules. We discuss a connection with the open map approach to bisimulations proposed by Joyal, Nielsen and Winskel.
On The Regulation Of Networks As Complex Systems: A Graph Theory Approach, Daniel F. Spulber, Christopher S. Yoo
On The Regulation Of Networks As Complex Systems: A Graph Theory Approach, Daniel F. Spulber, Christopher S. Yoo
All Faculty Scholarship
The dominant approach to regulating communications networks treats each network component as if it existed in isolation. In so doing, the current approach fails to capture one of the essential characteristics of networks, which is the complex manner in which components interact with one another when combined into an integrated system. In this Essay, Professors Daniel Spulber and Christopher Yoo propose a new regulatory framework based on the discipline of mathematics known as graph theory, which better captures the extent to which networks represent complex systems. They then apply the insights provided by this framework to a number of current …
Every Polynomial-Time 1-Degree Collapses If And Only If P=Pspace, Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
Every Polynomial-Time 1-Degree Collapses If And Only If P=Pspace, Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
Faculty Publications
No abstract provided.
Preface, Thomas Hildebrandt, Alexander Kurz
Preface, Thomas Hildebrandt, Alexander Kurz
Engineering Faculty Articles and Research
No abstract provided.
Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson
Algebraic Semantics For Coalgebraic Logics, Clemens Kupke, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
With coalgebras usually being defined in terms of an endofunctor T on sets, this paper shows that modal logics for T-coalgebras can be naturally described as functors L on boolean algebras. Building on this idea, we study soundness, completeness and expressiveness of coalgebraic logics from the perspective of duality theory. That is, given a logic L for coalgebras of an endofunctor T, we construct an endofunctor L such that L-algebras provide a sound and complete (algebraic) semantics of the logic. We show that if L is dual to T, then soundness and completeness of the algebraic semantics immediately yield the …
Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano
Coalgebras And Modal Expansions Of Logics, Alexander Kurz, Alessandra Palmigiano
Engineering Faculty Articles and Research
In this paper we construct a setting in which the question of when a logic supports a classical modal expansion can be made precise. Given a fully selfextensional logic S, we find sufficient conditions under which the Vietoris endofunctor V on S-referential algebras can be defined and we propose to define the modal expansions of S as the logic that arises from the V-coalgebras. As an example, we also show how the Vietoris endofunctor on referential algebras extends the Vietoris endofunctor on Stone spaces. From another point of view, we examine when a category of ‘spaces’ (X,A), ie sets X …
Stone Coalgebras, Clemens Kupke, Alexander Kurz, Yde Venema
Stone Coalgebras, Clemens Kupke, Alexander Kurz, Yde Venema
Engineering Faculty Articles and Research
In this paper we argue that the category of Stone spaces forms an interesting base category for coalgebras, in particular, if one considers the Vietoris functor as an analogue to the power set functor. We prove that the so-called descriptive general frames, which play a fundamental role in the semantics of modal logics, can be seen as Stone coalgebras in a natural way. This yields a duality between the category of modal algebras and that of coalgebras over the Vietoris functor. Building on this idea, we introduce the notion of a Vietoris polynomial functor over the category of Stone spaces. …
Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický
Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický
Engineering Faculty Articles and Research
We show how coalgebras can be presented by operations and equations. This is a special case of Linton’s approach to algebras over a general base category X, namely where X is taken as the dual of sets. Since the resulting equations generalise coalgebraic coequations to situations without cofree coalgebras, we call them coequations. We prove a general co-Birkhoff theorem describing covarieties of coalgebras by means of coequations. We argue that the resulting coequational logic generalises modal logic.
Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson
Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logic, show that the final object in Behω(T) generalises the notion of a canonical model in modal logic, and study the topology induced on a coalgebra by the finitary part of the terminal sequence.
Preface, Alexander Kurz
Preface, Alexander Kurz
Engineering Faculty Articles and Research
No abstract provided.
Modal Rules Are Co-Implications, Alexander Kurz
Modal Rules Are Co-Implications, Alexander Kurz
Engineering Faculty Articles and Research
In [13], it was shown that modal logic for coalgebras dualises—concerning definability— equational logic for algebras. This paper establishes that, similarly, modal rules dualise implications:It is shown that a class of coalgebras is definable by modal rules iff it is closed under H (images) and Σ (disjoint unions). As a corollary the expressive power of rules of infinitary modal logic on Kripke frames is characterised.
Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson
Notes On Coalgebras, Cofibrations And Concurrency, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
We consider categories of coalgebras as (co)-fibred over a base category of parameters and analyse categorical constructions in the total category of deterministic and non-deterministic coalgebras.
(Ω, Ξ)-Logic: On The Algebraic Extension Of Coalgebraic Specifications, Rolf Hennicker, Alexander Kurz
(Ω, Ξ)-Logic: On The Algebraic Extension Of Coalgebraic Specifications, Rolf Hennicker, Alexander Kurz
Engineering Faculty Articles and Research
We present an extension of standard coalgebraic specification techniques for statebased systems which allows us to integrate constants and n-ary operations in a smooth way and, moreover, leads to a simplification of the coalgebraic structure of the models of a specification. The framework of (Ω,Ξ)-logic can be considered as the result of a translation of concepts of observational logic (cf. [9]) into the coalgebraic world. As a particular outcome we obtain the notion of an (Ω, Ξ)- structure and a sound and complete proof system for (first-order) observational properties of specifications.