Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Human action recognition (2)
- 3D navigation (1)
- 3D user interfaces (1)
- Action recognition (1)
- Algorithms (1)
-
- Alignment (1)
- Anomaly detection (1)
- Artificial intelligence (1)
- Bioinformatics (1)
- Canonical labeling (1)
- CgNEAT (1)
- Channel Scheduling (1)
- Communication Connection (1)
- Compuational Biology (1)
- Computer Science (1)
- Concept decomposition (1)
- Connectionless Approach (1)
- Constrained clustering (1)
- Content-based image retrieval (1)
- Continuous spatial queries (1)
- Cooperation Enforcement (1)
- Data clustering (1)
- Data mining (1)
- Dimension reduction (1)
- Divisible Load Scheduling (1)
- Dynamic texture synthesis (1)
- Examle decomposition (1)
- Fairness (1)
- Football (1)
- GAR (1)
Articles 1 - 19 of 19
Full-Text Articles in Physical Sciences and Mathematics
Visual Inspection Of Railroad Tracks, Pavel Babenko
Visual Inspection Of Railroad Tracks, Pavel Babenko
Electronic Theses and Dissertations
In this dissertation, we have developed computer vision methods for measurement of rail gauge, and reliable identification and localization of structural defects in railroad tracks. The rail gauge is the distance between the innermost sides of the two parallel steel rails. We have developed two methods for evaluation of rail gauge. These methods were designed for different hardware setups: the first method works with two pairs of unaligned video cameras while the second method works with depth maps generated by paired laser range scanners. We have also developed a method for detection of rail defects such as damaged or missed …
Detecting Malicious Software By Dynamicexecution, Jianyong Dai
Detecting Malicious Software By Dynamicexecution, Jianyong Dai
Electronic Theses and Dissertations
Traditional way to detect malicious software is based on signature matching. However, signature matching only detects known malicious software. In order to detect unknown malicious software, it is necessary to analyze the software for its impact on the system when the software is executed. In one approach, the software code can be statically analyzed for any malicious patterns. Another approach is to execute the program and determine the nature of the program dynamically. Since the execution of malicious code may have negative impact on the system, the code must be executed in a controlled environment. For that purpose, we have …
Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-Parallel Graphs, Rosa Enciso
Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-Parallel Graphs, Rosa Enciso
Electronic Theses and Dissertations
Alliances are used to denote agreements between members of a group with similar interests. Alliances can occur between nations, biological sequences, business cartels, and other entities. The notion of alliances in graphs was first introduced by Kristiansen, Hedetniemi, and Hedetniemi in . A defensive alliance in a graph G = (V, E) is a non empty set S ⊆ V where, for all x ∈ S, |N[x] ∩ S| ≥ |N[x] − S|. Consequently, every vertex that is a member of a defensive alliance has at least as many vertices defending it as there are vertices attacking it. Alliances can …
Design And Analysis Of Effective Routing And Channel Scheduling For Wavelength Division Multiplexing Optical Networks, Xingbo Gao
Electronic Theses and Dissertations
Optical networking, employing wavelength division multiplexing (WDM), is seen as the technology of the future for the Internet. This dissertation investigates several important problems affecting optical circuit switching (OCS) and optical burst switching (OBS) networks. Novel algorithms and new approaches to improve the performance of these networks through effective routing and channel scheduling are presented. Extensive simulations and analytical modeling have both been used to evaluate the effectiveness of the proposed algorithms in achieving lower blocking probability, better fairness as well as faster switching. The simulation tests were performed over a variety of optical network topologies including the ring and …
Concept Learning By Example Decomposition, Sameer Joshi
Concept Learning By Example Decomposition, Sameer Joshi
Electronic Theses and Dissertations
For efficient understanding and prediction in natural systems, even in artificially closed ones, we usually need to consider a number of factors that may combine in simple or complex ways. Additionally, many modern scientific disciplines face increasingly large datasets from which to extract knowledge (for example, genomics). Thus to learn all but the most trivial regularities in the natural world, we rely on different ways of simplifying the learning problem. One simplifying technique that is highly pervasive in nature is to break down a large learning problem into smaller ones; to learn the smaller, more manageable problems; and then to …
Connectionless Approach: A Localized Scheme To Mobile Ad Hoc Networks, Yao Ho
Connectionless Approach: A Localized Scheme To Mobile Ad Hoc Networks, Yao Ho
Electronic Theses and Dissertations
According to a Gartner Group (www.gartner.com) report in September 2008, the worldwide telecommunications market is on pace to reach $2 trillion in 2008. Gartner predicts that by 2012, the ratio of mobile to fixed connections will exceed 4-to-1. The North American mobile data market grew to 141.1 million connections in 2007, with a compound annual growth rate of 41.7 percent. It is believed that a large portion will be ad hoc and multi-hop connections, which will open many opportunities for Mobile Ad hoc NETwork (MANET) applications and Wireless Mesh Network (WMN) applications. A MANET is a self-organizing multi-hop wireless network …
Modeling Scenes And Human Activities In Videos, Arslan Basharat
Modeling Scenes And Human Activities In Videos, Arslan Basharat
Electronic Theses and Dissertations
In this dissertation, we address the problem of understanding human activities in videos by developing a two-pronged approach: coarse level modeling of scene activities and fine level modeling of individual activities. At the coarse level, where the resolution of the video is low, we rely on person tracks. At the fine level, richer features are available to identify different parts of the human body, therefore we rely on the body joint tracks. There are three main goals of this dissertation: (1) identify unusual activities at the coarse level, (2) recognize different activities at the fine level, and (3) predict the …
Learning Techniques For Information Retrieval And Mining In High-Dimensional Databases, Hao Cheng
Learning Techniques For Information Retrieval And Mining In High-Dimensional Databases, Hao Cheng
Electronic Theses and Dissertations
The main focus of my research is to design effective learning techniques for information retrieval and mining in high-dimensional databases. There are two main aspects in the retrieval and mining research: accuracy and efficiency. The accuracy problem is how to return results which can better match the ground truth, and the efficiency problem is how to evaluate users' requests and execute learning algorithms as fast as possible. However, these problems are non-trivial because of the complexity of the high-level semantic concepts, the heterogeneous natures of the feature space, the high dimensionality of data representations and the size of the databases. …
Efficient Techniques For Relevance Feedback Processing In Content-Based Image Retrieval, Danzhou Liu
Efficient Techniques For Relevance Feedback Processing In Content-Based Image Retrieval, Danzhou Liu
Electronic Theses and Dissertations
In content-based image retrieval (CBIR) systems, there are two general types of search: target search and category search. Unlike queries in traditional database systems, users in most cases cannot specify an ideal query to retrieve the desired results for either target search or category search in multimedia database systems, and have to rely on iterative feedback to refine their query. Efficient evaluation of such iterative queries can be a challenge, especially when the multimedia database contains a large number of entries, and the search needs many iterations, and when the underlying distance measure is computationally expensive. The overall processing costs, …
Geometric Invariance In The Analysis Of Human Motion In Video Data, Yuping Shen
Geometric Invariance In The Analysis Of Human Motion In Video Data, Yuping Shen
Electronic Theses and Dissertations
Human motion analysis is one of the major problems in computer vision research. It deals with the study of the motion of human body in video data from different aspects, ranging from the tracking of body parts and reconstruction of 3D human body configuration, to higher level of interpretation of human action and activities in image sequences. When human motion is observed through video camera, it is perspectively distorted and may appear totally different from different viewpoints. Therefore it is highly challenging to establish correct relationships between human motions across video sequences with different camera settings. In this work, we …
Scheduling And Resource Management For Complex Systems: From Large-Scale Distributed Systems To Very Large Sensor Networks, Chen Yu
Electronic Theses and Dissertations
In this dissertation, we focus on multiple levels of optimized resource management techniques. We first consider a classic resource management problem, namely the scheduling of data-intensive applications. We define the Divisible Load Scheduling (DLS) problem, outline the system model based on the assumption that data staging and all communication with the sites can be done in parallel, and introduce a set of optimal divisible load scheduling algorithms and the related fault-tolerant coordination algorithm. The DLS algorithms introduced in this dissertation exploit parallel communication, consider realistic scenarios regarding the time when heterogeneous computing systems are available, and generate optimal schedules. Performance …
Learning Semantic Features For Visual Recognition, Jingen Liu
Learning Semantic Features For Visual Recognition, Jingen Liu
Electronic Theses and Dissertations
Visual recognition (e.g., object, scene and action recognition) is an active area of research in computer vision due to its increasing number of real-world applications such as video (image) indexing and search, intelligent surveillance, human-machine interaction, robot navigation, etc. Effective modeling of the objects, scenes and actions is critical for visual recognition. Recently, bag of visual words (BoVW) representation, in which the image patches or video cuboids are quantized into visual words (i.e., mid-level features) based on their appearance similarity using clustering, has been widely and successfully explored. The advantages of this representation are: no explicit detection of objects or …
Vectorpad: A Tool For Visualizing Vector Operations, Jared Bott
Vectorpad: A Tool For Visualizing Vector Operations, Jared Bott
Electronic Theses and Dissertations
Visualization of three-dimensional vector operations can be very helpful in understanding vector mathematics. However, creating these visualizations using traditional WIMP interfaces can be a troublesome exercise. In this thesis, we present VectorPad, a pen-based application for three-dimensional vector mathematics visualization. VectorPad allows users to define vectors and perform mathematical operations upon them through the recognition of handwritten mathematics. The VectorPad user interface consists of a sketching area, where the user can write vector definitions and other mathematics, and a 3D graph for visualization. After recognition, vectors are visualized dynamically on the graph, which can be manipulated by the user. A …
New Computational Approaches For Multiple Rna Alignment And Rna Search, Daniel Deblasio
New Computational Approaches For Multiple Rna Alignment And Rna Search, Daniel Deblasio
Electronic Theses and Dissertations
In this thesis we explore the the theory and history behind RNA alignment. Normal sequence alignments as studied by computer scientists can be completed in O(n2) time in the naive case. The process involves taking two input sequences and finding the list of edits that can transform one sequence into the other. This process is applied to biology in many forms, such as the creation of multiple alignments and the search of genomic sequences. When you take into account the RNA sequence structure the problem becomes even harder. Multiple RNA structure alignment is particularly challenging because covarying mutations make sequence …
Search And Delivery Techniques In Peer-To-Peer Networks, Tai Do
Search And Delivery Techniques In Peer-To-Peer Networks, Tai Do
Electronic Theses and Dissertations
The presence of millions of interconnected personal computing devices has given rise to a new class of decentralized networking applications, which are loosely labeled as peer-to-peer (P2P) applications. These P2P applications leverage resources such as processing cycles, storage, content, and network bandwidth available to the user devices, which are also known as peers. A number of current systems - SETI@home, Napster, BitTorrent, and Pastry - are examples of these emerging P2P systems. To fully realize the potential of the peer-to-peer technology, there is a need to define and provide a set of core competencies, serving as the basic services upon …
Attacks On Difficult Instances Of Graph Isomorphism: Sequential And Parallel Algorithms, Greg Tener
Attacks On Difficult Instances Of Graph Isomorphism: Sequential And Parallel Algorithms, Greg Tener
Electronic Theses and Dissertations
The graph isomorphism problem has received a great deal of attention on both theoretical and practical fronts. However, a polynomial algorithm for the problem has yet to be found. Even so, the best of the existing algorithms perform well in practice; so well that it is challenging to find hard instances for them. The most efficient algorithms, for determining if a pair of graphs are isomorphic, are based on the individualization-refinement paradigm, pioneered by Brendan McKay in 1981 with his algorithm nauty. Nauty and various improved descendants of nauty, such as bliss and saucy, solve the graph isomorphism problem by …
Automatic Graphics And Game Content Generation Through Evolutionary Computation, Erin Hastings
Automatic Graphics And Game Content Generation Through Evolutionary Computation, Erin Hastings
Electronic Theses and Dissertations
Simulation and game content includes the levels, models, textures, items, and other objects encountered and possessed by players during the game. In most modern video games and simulation software, the set of content shipped with the product is static and unchanging, or at best, randomized within a narrow set of parameters. However, ideally, if game content could be constantly and automatically renewed, players would remain engaged longer in the evolving stream of content. This dissertation introduces three novel technologies that together realize this ambition. (1) The first, NEAT Particles, is an evolutionary method to enable users to quickly and easily …
On The Application Of Locality To Network Intrusion Detection: Working-Set Analysis Of Real And Synthetic Network Server Traffic, Robert Lee
Electronic Theses and Dissertations
Keeping computer networks safe from attack requires ever-increasing vigilance. Our work on applying locality to network intrusion detection is presented in this dissertation. Network servers that allow connections from both the internal network and the Internet are vulnerable to attack from all sides. Analysis of the behavior of incoming connections for properties of locality can be used to create a normal profile for such network servers. Intrusions can then be detected due to their abnormal behavior. Data was collected from a typical network server both under normal conditions and under specific attacks. Experiments show that connections to the server do …
Realnav: Exploring Natural User Interfaces For Locomotion In Video Games, Brian Williamson
Realnav: Exploring Natural User Interfaces For Locomotion In Video Games, Brian Williamson
Electronic Theses and Dissertations
We present an exploration into realistic locomotion interfaces in video games using spatially convenient input hardware. In particular, we use Nintendo Wii Remotes to create natural mappings between user actions and their representation in a video game. Targeting American Football video games, we used the role of the quarterback as an exemplar since the game player needs to maneuver effectively in a small area, run down the field, and perform evasive gestures such as spinning, jumping, or the "juke". In our study, we developed three locomotion techniques. The first technique used a single Wii Remote, placed anywhere on the user's …