Other Computer Engineering Commons^™

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.

Polygonal Spatial Clustering, Deepti Joshi

School of Computing: Dissertations, Theses, and Student Research

Clustering, the process of grouping together similar objects, is a fundamental task in data mining to help perform knowledge discovery in large datasets.  With the growing number of sensor networks, geospatial satellites, global positioning devices, and human networks tremendous amounts of spatio-temporal data that measure the state of the planet Earth are being collected every day.  This large amount of spatio-temporal data has increased the need for efficient spatial data mining techniques.  Furthermore, most of the anthropogenic objects in space are represented using polygons, for example – counties, census tracts, and watersheds.  Therefore, it is important to develop data mining …

Overcoming Pose Limitations Of A Skin-Cued Histograms Of Oriented Gradients Dismount Detector Through Contextual Use Of Skin Islands And Multiple Support Vector Machines, Jonathon R. Climer

Theses and Dissertations

This thesis provides a novel visualization method to analyze the impact that articulations in dismount pose and camera aspect angle have on histograms of oriented gradients (HOG) features and eventual detections. Insights from these relationships are used to identify limitations in a state of the art skin cued HOG dismount detector's ability to detect poses not in a standard upright stances. Improvements to detector performance are made by further leveraging available skin information, reducing false detections by an additional order of magnitude. In addition, a method is outlined for training supplemental support vector machines (SVMs) from computer generated data, for …

An Architecture For Improving Timeliness And Relevance Of Cyber Incident Notifications, James L. Miller

Theses and Dissertations

This research proposes a communications architecture to deliver timely and relevant cyber incident notifications to dependent mission stakeholders. This architecture, modeled in Unified Modeling Language (UML), eschews the traditional method of pushing notifications via message as dictated in Air Force Instruction 33-138. It instead shifts to a pull or publish and subscribe method of making notifications. Shifting this paradigm improves the notification process by empowering mission owners to identify those resources on which they depend for mission accomplishment, provides a direct conduit between providing and dependent mission owners for notifications when an incident occurs, and provides a shared representation for …

Data Mining Based Learning Algorithms For Semi-Supervised Object Identification And Tracking, Michael P. Dessauer

Doctoral Dissertations

Sensor exploitation (SE) is the crucial step in surveillance applications such as airport security and search and rescue operations. It allows localization and identification of movement in urban settings and can significantly boost knowledge gathering, interpretation and action. Data mining techniques offer the promise of precise and accurate knowledge acquisition techniques in high-dimensional data domains (and diminishing the “curse of dimensionality” prevalent in such datasets), coupled by algorithmic design in feature extraction, discriminative ranking, feature fusion and supervised learning (classification). Consequently, data mining techniques and algorithms can be used to refine and process captured data and to detect, recognize, classify, …

A New Approach To Algebraic Coding Theory Through The Applications Of Soft Sets, Florentin Smarandache, Mumtaz Ali

Branch Mathematics and Statistics Faculty and Staff Publications

Algebraic codes play a signifcant role in the minimisation of data corruption which caused by defects such as inference, noise channel, crosstalk, and packet loss. In this paper, we introduce soft codes (soft linear codes) through the application of soft sets which is an approximated collection of codes. We also discuss several types of soft codes such as type-1 soft codes, complete soft codes etc. Further, we construct the soft generator matrix and soft parity check matrix for the soft linear codes. Moreover, we develop two techniques for the decoding of soft codes.

Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Florentin Smarandache, Jean Dezert, Xinde Li, Xinhan Huang

Branch Mathematics and Statistics Faculty and Staff Publications

This paper presents a new method for reducing the number of sources of evidence to combine in order to reduce the complexity of the fusion processing. Such a complexity reduction is often required in many applications where the real-time constraint and limited computing resources are of prime importance. The basic idea consists in selecting, among all sources available, only a subset of sources of evidence to combine. The selection is based on an evidence supporting measure of similarity (ESMS) criterion which is an efficient generic tool for outlier sources identification and rejection. The ESMS between two sources of evidence can …

Evidence Supporting Measure Of Similarity For Reducing The Complexity In Information Fusion, Xinde Li, Jean Dezert, Florentin Smarandache, Xinhan Huang

Branch Mathematics and Statistics Faculty and Staff Publications

This paper proposes a new solution for reducing the number of sources of evidence to be combined in order to diminish the complexity of the fusion process required in some applications where the real-time constraint and strong computing resource limitation are of prime importance. The basic idea consists in selecting, among the whole set of sources of evidence, only the biggest subset of sources which are not too contradicting based on a criterion of Evidence Supporting Measure of Similarity (ESMS) in order to process solely the coherent information received. The ESMS criterion serves actually as a generic tool for outlier …

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.

Wii-Mote Head Tracking: A Three Dimensional Virtual Reality Display, David Fairman

Computer Engineering

The goal of this project is to create a customizable three dimensional virtual reality display on a system available to any non-technical user. This System will use the infrared camera component of a standard Nintendo Wii-mote to track a user's head motions in all six major directions. The virtual reality will be a customizable image projected onto a screen or simply shown on a computer or TV monitor. In order to appear 3-dimensional, the image will continually change according to the position of the user's head. As the user moves their head to the left and right, portions of the …

Non Bayesian Conditioning And Deconditioning, Jean Dezert, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

In this paper, we present a Non-Bayesian conditioning rule for belief revision. This rule is truly Non-Bayesian in the sense that it doesn’t satisfy the common adopted principle that when a prior belief is Bayesian, after conditioning by X, Bel(X|X) must be equal to one. Our new conditioning rule for belief revision is based on the proportional conflict redistribution rule of combination developed in DSmT (Dezert-Smarandache Theory) which abandons Bayes’ conditioning principle. Such Non-Bayesian conditioning allows to take into account judiciously the level of conflict between the prior belief available and the conditional evidence. We also introduce the deconditioning problem …

On Coalgebras Over Algebras, Adriana Balan, Alexander Kurz

Engineering Faculty Articles and Research

We extend Barr’s well-known characterization of the final coalgebra of a Set-endofunctor as the completion of its initial algebra to the Eilenberg-Moore category of algebras for a Set-monad M for functors arising as liftings. As an application we introduce the notion of commuting pair of endofunctors with respect to the monad M and show that under reasonable assumptions, the final coalgebra of one of the endofunctors involved can be obtained as the free algebra generated by the initial algebra of the other endofunctor.

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 …

Algebraic Theories Over Nominal Sets, Alexander Kurz, Daniela Petrişan, Jiří Velebil

Engineering Faculty Articles and Research

We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.

Authentication Of Biometric Features Using Texture Coding For Id Cards, Jonathan Blackledge, Eugene Coyle

Conference papers

The use of image based information exchange has grown rapidly over the years in terms of both e-to-e image storage and transmission and in terms of maintaining paper documents in electronic form. Further, with the dramatic improvements in the quality of COTS (Commercial-Off-The-Shelf) printing and scanning devices, the ability to counterfeit electronic and printed documents has become a widespread problem. Consequently, there has been an increasing demand to develop digital watermarking techniques which can be applied to both electronic and printed images (and documents) that can be authenticated, prevent unauthorized copying of their content and, in the case of printed …

Super Special Codes Using Super Matrices, Florentin Smarandache, W.B. Vasantha Kandasamy, K. Ilanthenral

Branch Mathematics and Statistics Faculty and Staff Publications

The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes. This book has four chapters. In chapter one basic properties of codes and super matrices are given. A new type of super special vector space is constructed in chapter two of this book. Three new classes of super special codes namely, super special row code, super special column code and super special codes are introduced in chapter three. Applications of these …

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.

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 …

Equational Coalgebraic Logic, Alexander Kurz, Raul Leal

Engineering Faculty Articles and Research

Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviours of the system. A fundamental question in this area is how to obtain, for an arbitrary functor T, a logic for T-coalgebras. We compare two existing proposals, Moss’s coalgebraic logic and the logic of all predicate liftings, by providing one-step translations between them, extending the results in [21] by making systematic use of Stone duality. Our main contribution then is a novel coalgebraic logic, which can be seen as an equational axiomatization of Moss’s logic. The three logics are …

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 …

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 …

Back-Up Server For Computer Science Department, Victoria Gaylord

Mahurin Honors College Capstone Experience/Thesis Projects

Because Western Kentucky University does not maintain a back-up system for its departments, the Computer Science Department has implemented its own. Using Bacula software on a Unix server, files from faculty desktop computers and servers are backed up to a tape drive on a daily basis. The server is protected from outside threats with a carefully configured firewall script. This paper explains how both the firewall and the back-up software were implemented and how successful that implementation has been.

Using Concept Maps To More Efficiently Create Intelligence Information Models, Christopher E. Coryell

Theses and Dissertations

Information models are a critical tool that enables intelligence customers to quickly and accurately comprehend U.S. intelligence agency products. The Knowledge Pre-positioning System (KPS) is the standard repository for information models at the National Air and Space Intelligence Center (NASIC). The current approach used by NASIC to build a KPS information model is laborious and costly. Intelligence analysts design an information model using a manual, butcher-paper-based process. The output of their work is then entered into KPS by either a single NASIC KPS "database modeler" or a contractor (at a cost of roughly $100K to the organization). This thesis proposes …

Some Peer-To-Peer, Democratically And Voluntarily Produced Thoughts About 'The Wealth Of Networks: How Social Production Transforms Markets And Freedom,' By Yochai Benkler, Ann Bartow

Law Faculty Scholarship

In this review essay, Bartow concludes that The Wealth of Networks: How Social Production Transforms Markets and Freedom by Yochai Benkler is a book well worth reading, but that Benkler still has a bit more work to do before his Grand Unifying Theory of Life, The Internet, and Everything is satisfactorily complete. It isn't enough to concede that the Internet won't benefit everyone. He needs to more thoroughly consider the ways in which the lives of poor people actually worsen when previously accessible information, goods and services are rendered less convenient or completely unattainable by their migration online. Additionally, the …

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 …

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."

Software Development Project Risk Management: A Literature Review, Kevin Macg. Adams, C. Ariel Pinto

Engineering Management & Systems Engineering Faculty Publications

The rapid and unprecedented growth in software has brought with it some of the most spectacular and costly project failures in modern history. How risk management is presented in the scholarly journals may give insight into the risk management methods and techniques in use on software development projects. This paper provides a glimpse into the risk management methods, methodologies and techniques available to those who are responsible for software development projects by conducting a non-experimental content analysis. The findings reveal that risk management has not received sufficient attention and does not appear to be widely accepted within the software engineering …