Open Access. Powered by Scholars. Published by Universities.®

Other Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 10 of 10

Full-Text Articles in Other Computer Engineering

Polygonal Spatial Clustering, Deepti Joshi Apr 2011

Polygonal Spatial Clustering, Deepti Joshi

Department of Computer Science and Engineering: 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 …


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

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 …


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 Mar 2011

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 …


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

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, …


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

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 Jan 2011

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 Jan 2011

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.


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

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 …


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

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, Xinde Li, Jean Dezert, Florentin Smarandache, Xinhan Huang Jan 2011

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 …