Physical Sciences and Mathematics Commons^™

Tree-D-Seek: A Framework For Retrieving Three-Dimensional Scenes, Saurav Mazumdar

Electrical & Computer Engineering Theses & Dissertations

In this dissertation, a strategy and framework for retrieving 3D scenes is proposed. The strategy is to retrieve 3D scenes based on a unified approach for indexing content from disparate information sources and information levels. The TREE-D-SEEK framework implements the proposed strategy for retrieving 3D scenes and is capable of indexing content from a variety of corpora at distinct information levels. A semantic annotation model for indexing 3D scenes in the TREE-D-SEEK framework is also proposed. The semantic annotation model is based on an ontology for rapid prototyping of 3D virtual worlds.

With ongoing improvements in computer hardware and 3D …

A Method For Introducing Artificial Perception (Ap) To Improve Human Behavior Representation (Hbr) Using Agents In Synthetic Environments, Randall Bartholomew Garrett

Computational Modeling & Simulation Engineering Theses & Dissertations

While psychology has shown that perception is very important for the human decision process, agent perception has not been covered in sufficient detail within the agent directed simulation field. To contribute to such a solution, an open challenge lies in capturing the knowledge of human sciences, such as psychology, and making this knowledge usable for engineers. This dissertation addresses perception by describing an experimental method where agent perception simulates human perception. In particular, it presents engineering methods based on accepted psychological approaches resulting in a proof of concept. To prove the feasibility, an Artificial Perception (AP) meta-model is presented using …

On The Role Of Assertions For Conceptual Modeling As Enablers Of Composable Simulation Solutions, Robert Dennis King

Computational Modeling & Simulation Engineering Theses & Dissertations

This research provides a much needed systematic review of the roles that assertions play in model composability and simulation interoperability. In doing so, this research contributes a partial solution to one of the problems of model composability and simulation interoperability—namely, why do simulation systems fail to achieve the maximum level of interoperability possible? It demonstrates the importance of the assertions that are made during model development and simulation implementation, particularly as they reflect the unique viewpoint of each developer or user. It hypothesizes that it is possible to detect composability conflicts by means of a four-step process developed by the …

Algorithms For Vertex-Weighted Matching In Graphs, Mahantesh Halappanavar

Computer Science Theses & Dissertations

A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex. Matching is a fundamental combinatorial problem that has applications in many contexts: high-performance computing, bioinformatics, network switch design, web technologies, etc. Examples in the first context include sparse linear systems of equations, where matchings are used to place large matrix elements on or close to the diagonal, to compute the block triangular decomposition of sparse matrices, to construct sparse bases for the null space or column space of under-determined matrices, and to coarsen graphs in multi-level …

Supporting Protocols For Structuring And Intelligent Information Dissemination In Vehicular Ad Hoc Networks, Filip Cuckov

Electrical & Computer Engineering Theses & Dissertations

The goal of this dissertation is the presentation of supporting protocols for structuring and intelligent data dissemination in vehicular ad hoc networks (VANETs). The protocols are intended to first introduce a structure in VANETs, and thus promote the spatial reuse of network resources. Segmenting a flat VANET in multiple cluster structures allows for more efficient use of the available bandwidth, which can effectively increase the capacity of the network. The cluster structures can also improve the scalability of the underlying communication protocols. The structuring and maintenance of the network introduces additional overhead. The aim is to provide a mechanism for …

A Subspace Projection Methodology For Nonlinear Manifold Based Face Recognition, Praveen Sankaran

Electrical & Computer Engineering Theses & Dissertations

A novel feature extraction method that utilizes nonlinear mapping from the original data space to the feature space is presented in this dissertation. Feature extraction methods aim to find compact representations of data that are easy to classify. Measurements with similar values are grouped to same category, while those with differing values are deemed to be of separate categories. For most practical systems, the meaningful features of a pattern class lie in a low dimensional nonlinear constraint region (manifold) within the high dimensional data space. A learning algorithm to model this nonlinear region and to project patterns to this feature …

High-Performance Broadcast And Multicast Protocols For Multi-Radio Multi-Channel Wireless Mesh Networks, Jun Wang

Electrical & Computer Engineering Theses & Dissertations

Recently, wireless mesh networks (WMNs) have attracted much attention. A vast amount of unicast, multicast and broadcast protocols has been developed for WMNs or mobile ad hoc networks (MANETs). First of all, broadcast and multicast in wireless networks are fundamentally different from the way in which wired networks function due to the well-known wireless broadcast/multicast advantage. Moreover, most broadcast and multicast protocols in wireless networks assume a single-radio single-channel and single-rate network model, or a generalized physical model, which does not take into account the impact of interference. This dissertation focuses on high-performance broadcast and multicast protocols designed for multi-radio …