Theory and Algorithms Commons^™

Dragon Age: Origins - Maps & Benchmark Problems, Nathan R. Sturtevant, Bioware Corp

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted from Dragon Age: Origins with help and explicit permission from BioWare Corp. for use and distribution as benchmark problems.

Contains 156 maps and benchmark problem sets.

Image Registration Using Conformal Log Polar Mapping, Bala Krishna Vadapally

Electrical & Computer Engineering Theses & Dissertations

Image Registration is the process of aligning, or overlaying two images of the same scene that were taken at different times and/or from different viewing angles and/or by sensors with different modalities or resolutions. The variations in the imaging environment induce the difference between the images of the same scene. In our situation, we have two images of the same scene taken with two sensors, one in the visible and the other in the infrared (IR) domain. The cameras are placed adjacent to each other on a stable platform, and the images are captured almost simultaneously. This means that the …

Fault-Tolerance And Recovery In Wireless Sensor Networks, Kevin M. Somervill

Electrical & Computer Engineering Theses & Dissertations

The topic of Wireless Sensor Networks (WSNs) has gained considerable attention in the research community due to the variety of applications and interesting challenges in developing and deploying such networks. The typical WSN is significantly energy constrained and often deployed in harsh or even hostile environments, resulting in sensor nodes that are prone to failure. Failing nodes alter the topology of the network resulting in segmented routing paths and lost messages, ultimately reducing network efficiency. These issues spur the desire to develop energy-efficient, Fault-Tolerant (FT) algorithms that enable the network to persist in spite of the failed nodes. This work …

Networks - Ii: Optimal Fractional Frequency Reuse (Ffr) And Resource Allocation In Multiuser Ofdma System, Naveed Ul Hassan, Mohamad Assaad

International Conference on Information and Communication Technologies

In this paper we determine the optimal fractional frequency reuse (FFR) and resource allocation in OFDMA system. Since the users at the cell edge are more exposed to inter-cell interference therefore each cell is partitioned into two regions; inner region and outer region. We determine the optimal FFR factor for the outer region, bandwidth assigned to each region and subcarrier and power allocation to all the users in the cell. The problem is formulated as sum-power minimization problem subject to minimum rate constraints in both the regions. This is a mixed linear integer programming problem which is relaxed into a …

Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov

Computer Science Faculty Publications

Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work has shown that direct sampling of user lifetimes may lead to certain bias (arising from missed peers and round-off inconsistencies) and proposed a technique that estimates lifetimes based on sampled residuals. In this paper, however, we show that under non-stationary arrivals, which are often present in real systems, residual-based sampling does not correctly reconstruct user lifetimes and suffers a varying degree of bias, which in some cases makes estimation completely impossible. We overcome this problem using two contributions: a …

Batch Mode Active Learning With Applications To Text Categorization And Image Retrieval, Steven C. H. Hoi, Rong Jin, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Most machine learning tasks in data classification and information retrieval require manually labeled data examples in the training stage. The goal of active learning is to select the most informative examples for manual labeling in these learning tasks. Most of the previous studies in active learning have focused on selecting a single unlabeled example in each iteration. This could be inefficient, since the classification model has to be retrained for every acquired labeled example. It is also inappropriate for the setup of information retrieval tasks where the user's relevance feedback is often provided for the top K retrieved items. In …

Data Mining: Assessment Of Features Quality Of Class Discrimination Using Arif Index And Its Application To Physiological Datasets, Dr. Muhammad Arif, A. Fida

International Conference on Information and Communication Technologies

Quality of features determines the maximum achievable accuracy by any arbitrary classifier in pattern classification problem. In this paper, we have proposed an index that can assess the quality of features in discrimination of patterns in different classes. This index is in-sensitive to the complexity of boundary separating different classes if there is no overlap among features of different classes. Proposed index is model free and requires no clustering algorithm to discover the clustering structure present in the feature space. It is only based on the information of local neighborhood of feature vectors in the feature space. This index can …

Artificial Intelligence – I: A Two-Step Approach For Improving Efficiency Of Feedforward Multilayer Perceptrons Network, Shoukat Ullah, Zakia Hussain

International Conference on Information and Communication Technologies

An artificial neural network has got greater importance in the field of data mining. Although it may have complex structure, long training time, and uneasily understandable representation of results, neural network has high accuracy and is preferable in data mining. This research paper is aimed to improve efficiency and to provide accurate results on the basis of same behaviour data. To achieve these objectives, an algorithm is proposed that uses two data mining techniques, that is, attribute selection method and cluster analysis. The algorithm works by applying attribute selection method to eliminate irrelevant attributes, so that input dimensionality is reduced …

Statistical Investigation Of Structure In The Discrete Logarithm, Andrew Hoffman

Mathematical Sciences Technical Reports (MSTR)

The absence of an efficient algorithm to solve the Discrete Logarithm Problem is often exploited in cryptography. While exponentiation with a modulus is extremely fast with a modern computer, the inverse is decidedly not. At the present time, the best algorithms assume that the inverse mapping is completely random. Yet there is at least some structure, and to uncover additional structure that may be useful in constructing or refining algorithms, statistical methods are employed to compare modular exponential mappings to random mappings. More concretely, structure will be defined by representing the mappings as functional graphs and using parameters from graph …

Analysis Of Partial Discharge Pulse Height Distribution Parameters, Vinay N. Nimbole

Electrical & Computer Engineering Theses & Dissertations

Partial Discharges (PD) have been traditionally used to assess the state of any insulation system and its remnant life. In earlier work, Perspex (PMMA) samples with a needle plane gap have been aged with AC voltage. Their tree growth was monitored simultaneously by collecting PD at regular intervals of time and taking microphotographs in real time without interrupting the aging voltage. The obtained partial discharge pulse amplitude records were clustered together into groups of class intervals. The sequence of PD pulse height records was quantified as a time series of shape (η), and scale (σ) parameters of a Weibull distribution. …

A Simulation Study Of Convergence Speed For Distributed Codeword Adaptation Algorithms In Cdma Wireless Systems, Sahana Maharjan

Electrical & Computer Engineering Theses & Dissertations

In this thesis we present a side-by-side comparison of interference avoidance (IA) algorithms for distributed codeword adaptation in Code Division Multiple Access (CDMA) systems. In CDMA systems, the interference is determined by the values of the cross-correlation of codewords assigned to users, and various algorithms can be used for codeword optimization. The IA algorithms for codeword adaptation considered are the eigen-algorithm, the Minimum Mean Square Error (MMSE) update, and the adaptive IA algorithm, for which we investigate convergence speed using the extensive simulations of several uplink CDMA system scenarios. The results of this thesis were presented at the Fourth IEEE …

The Wisdom Of The Few: A Collaborative Filtering Approach Based On Expert Opinions From The Web, Xavier Amatriain, Neal Lathia, Josep M. Pujol, Haewoon Kwak, Nuria. Oliver

Research Collection School Of Computing and Information Systems

Nearest-neighbor collaborative filtering provides a successful means of generating recommendations for web users. However, this approach suffers from several shortcomings, including data sparsity and noise, the cold-start problem, and scalability. In this work, we present a novel method for recommending items to users based on expert opinions. Our method is a variation of traditional collaborative filtering: rather than applying a nearest neighbor algorithm to the user-rating data, predictions are computed using a set of expert neighbors from an independent dataset, whose opinions are weighted according to their similarity to the user. This method promises to address some of the weaknesses …

Residual-Based Estimation Of Peer And Link Lifetimes In P2p Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov

Computer Science Faculty Publications

Existing methods of measuring lifetimes in P2P systems usually rely on the so-called Create-BasedMethod (CBM), which divides a given observation window into two halves and samples users ldquocreatedrdquo in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we first derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …

Tight Lower Bound For The Sparse Travelling Salesman Problem, Fredrick Mtenzi

Conference papers

The Sparse Travelling Salesman Problem (Sparse TSP) which is a variant of the classical Travelling Salesman Problem (TSP) is the problem of finding the shortest route of the salesman when visiting cities in a region making sure that each city is visited at least once and returning home at the end. In the Sparse TSP, the distance between cities may not obey the triangle inequality; this makes the use of algorithms and formulations designed for the TSP to require modifications in order to produce near-optimal results. A lower bound for optmisation problems gives us the quality guarantee of the near-optimal …

A Study Of Relevance Feedback In Vector Space Model, Deepthi Katta

UNLV Theses, Dissertations, Professional Papers, and Capstones

Information Retrieval is the science of searching for information or documents based on information need from a huge set of documents. It has been an active field of research since early 19^th century and different models of retrieval came in to existence to cater the information need.

This thesis starts with understanding some of the basic information retrieval models, followed by implementation of one of the most popular statistical retrieval model known as Vector Space Model. This model ranks the documents in the collection based on the similarity measure calculated between the query and the respective document. The user …

A Survey Of Monge Properties, Swetha Sethumadhavan

UNLV Theses, Dissertations, Professional Papers, and Capstones

Monge properties play an important role in theoretical computer science. Many greedy algorithms are based on such properties, as is speedup in dynamic programming. Monge properties are simple monotonicity properties which are observed and used in various settings such as resource optimization, computational geometry, statistical sampling, computational biology and coding.

Turn Constrained Path Planning Problems, Victor M. Roman

UNLV Theses, Dissertations, Professional Papers, and Capstones

We consider the problem of constructing multiple disjoint paths connecting a source point s to a target point t in a geometric graph. We require that the paths do not have any sharp turn angles. We present a review of turn constrained path planning algorithms and also algorithms for constructing disjoint paths. We then combine these techniques and present an O(nlogn) time algorithm for constructing a pair of edge disjoint turn constrained paths connecting two nodes in a planar geometric graph. We also consider the development of a turn constrained shortest path map in the presence of …

A Hurricane Evacuation Route System Real-Time Monitoring And Distribution Of Load, Anup Khanal

Electrical & Computer Engineering Theses & Dissertations

Hurricane evacuation is one of the major steps in diminishing the devastating effects of hurricanes on lives and properties. The challenge in evacuating a large number of people in a short time is the severe congestion faced in the transportation network, leading to long delays and shortages. Standard hurricane evacuation plans focus on how to best utilize the main arteries. The research challenge is to not overload the fastest routes and to utilize all the routes efficiently. The evacuation routing system proposed in this thesis focuses on distributing the traffic load throughout the network, utilizing alternative routes not considered in …

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 …

Frequency Diversity For Improving Synthetic Aperture Radar Imaging, Jawad L. Farooq

Theses and Dissertations

In this work, a novel theoretical framework is presented for using recent advances in frequency diversity arrays (FDAs). Unlike a conventional array, the FDA simultaneously transmits a unique frequency from each element in the array. As a result, special time and space properties of the radiation pattern are exploited to improve cross-range resolution. The idealized FDA radiation pattern is compared with and validated against a full-wave electromagnetic solver, and it is shown that the conventional array is a special case of the FDA. A new signal model, based on the FDA, is used to simulate SAR imagery of ideal point …

Bit-Error-Rate-Minimizing Channel Shortening Using Post-Feq Diversity Combining And A Genetic Algorithm, Gokhan Altin

Theses and Dissertations

In advanced wireline or wireless communication systems, i.e., DSL, IEEE 802.11a/g, HIPERLAN/2, etc., a cyclic prefix which is proportional to the channel impulse response is needed to append a multicarrier modulation (MCM) frame for operating the MCM accurately. This prefix is used to combat inter symbol interference (ISI). In some cases, the channel impulse response can be longer than the cyclic prefix (CP). One of the most useful techniques to mitigate this problem is reuse of a Channel Shortening Equalizer (CSE) as a linear preprocessor before the MCM receiver in order to shorten the effective channel length. Channel shortening filter …

Range Estimation Algorithm Comparison In 3-D Flash Ladar Data, Steven P. Jordan

Theses and Dissertations

Range estimation algorithms have been applied to Laser Detection and Ranging (LADAR) data to test for accuracy and precision. Data was acquired from Matlab® simulations and an experiment using the Advanced Scientific Concepts 3-D flash LADAR camera. Simulated LADAR data was based on a Gaussian pulse shape model with Poisson noise added. Simulations were performed to test range estimation algorithm performance with respect to waveform position within the range gate. The effectiveness of each algorithm is presented in terms of its average root mean square error and standard deviation in 1000 trials. The measured data experiment examined the effectiveness of …

Blind Deconvolution Through Polarization Diversity Of Long Exposure Imagery, Steven P. James

Theses and Dissertations

The purpose of the algorithm developed in this thesis was to create a post processing method that could resolve objects at low signal levels using polarization diversity and no knowledge of the atmospheric seeing conditions. The process uses a two-channel system, one unpolarized image and one linearly polarized image, in a GEM algorithm to reconstruct the object. Previous work done by Strong showed that a two-channel system using polarization diversity on short exposure imagery could produce images up to twice the diffraction limit. In this research, long exposure images were simulated and a simple Kolmogorov model used. This allowed for …

Waypoint Generation Based On Sensor Aimpoint, Shannon M. Farrell

Theses and Dissertations

Secretary of Defense Robert M. Gates has emphasized a need for a greater number of intelligence, surveillance, and reconnaissance (ISR) assets to support combatant commanders and military operations globally. Unmanned systems, especially MAVs, used as ISR platforms provide the ability to maintain covertness during missions and help reduce the risk to human life. This research develops waypoint generation algorithms required to keep a point of interest (POI) in the field of view (FOV) of a fixed sensor on a micro air vehicle (MAV) in the presence of a constant wind.
Fixed sensors, while cheaper and less prone to mechanical failure …

The Modular Clock Algorithm For Blind Rendezvous, Nicholas C. Theis

Theses and Dissertations

This thesis examines the problem in initializing communications whereby cognitive radios need to find common spectrum with other cognitive radios, a process known as frequency rendezvous. It examines the rendezvous problem as it exists in a dynamic spectrum access cognitive network. Specifically, it addresses the problem of rendezvous in an infrastructureless environment. A new algorithm, the modular clock algorithm, is developed and analyzed as a solution for the simple rendezvous environment model, coupled with a modified version for environment models with less information. The thesis includes a taxonomy of commonly used environment models, and analysis of previous efforts to solve …

Node Isolation Model And Age-Based Neighbor Selection In Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov

Computer Science Faculty Publications

Previous analytical studies of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared with uniform selection of neighbors. In fact, the second strategy based on random walks on age-proportional graphs demonstrates that, for lifetimes with infinite variance, the system monotonically increases …

A Hybrid Scatter Search For The Discrete Time/Resource Trade-Off Problem In Project Scheduling, Mohammad Ranbar, Bert De Reyck, Fereydoon Kianfar

Research Collection Lee Kong Chian School Of Business

We develop a heuristic procedure for solving the discrete time/resource trade-off problem in the field of project scheduling. In this problem, a project contains activities interrelated by finish-start-type precedence constraints with a time lag of zero, which require one or more constrained renewable resources. Each activity has a specified work content and can be performed in different modes, i.e. with different durations and resource requirements, as long as the required work content is met. The objective is to schedule each activity in one of its modes in order to minimize the project makespan. We use a scatter search algorithm to …

Implementing Dijkstra's Pathfind Using Quantum Algorithms, Shing Yung Lo

Theses Digitization Project

This thesis explores using Grover's Search (a quantum algorithm) to implement Dijkstra's algorithm. Contains source code.

Maze Maps & Benchmark Problems, Nathan R. Sturtevant

Moving AI Lab: 2D Maps and Benchmark Problems

Contains 60 maps of size 512x512 and benchmark problem sets. These maps are algorithm-generated mazes with corridor widths of 1, 2, 4, 8, 16, or 32. There are 10 maps and problem sets for each corridor size.

Finding Irc-Like Meshes Sans Layer 7 Payloads, Akshay Dua, Jim Binkley, Suresh Singh

Computer Science Faculty Publications and Presentations

We present an algorithm for detecting IRC-like chat networks that does not rely on Layer 7 payload information. The goal is to extract only those meshes from conventional flows where long-term periodic data is being exchanged between an external server and multiple internal clients. Flow data is passed through a series of filters that reduce the memory requirements needed for final candidate mesh sorting. Final outputs consist of two sorted lists including the fanout list, sorted by the number of client hosts in the mesh, and a secondary list called the evil sort. The latter consists of meshes with any …