Physical Sciences and Mathematics Commons^™

Improving The Performance Of Nested Loop Algorithm Using Separators, Nachiappan N. Nachiappan

Theses and Dissertations - UTB/UTPA

This thesis studies the properties of distance-based outliers and a better detection method for large multi-dimensional datasets. Outlier detection is an important task to find out the objects that deviate in a high ratio from the rest of the objects. The proposed algorithm breaks the data set into divisions and sets the area of access for each division, thus reducing the unnecessary access for a major set of elements. This algorithm reduces the run time of the existing algorithm by using separators. Datasets of varying sizes have been tested to analyze the empirical values of these procedures. Effective data structures …

An Improvement And A Generalization Of Zippel's Sparse Multivariate Polynomial Interpolation Algorithm, Michael D. Brazier

Theses and Dissertations - UTB/UTPA

The algorithm most often used for the problem of interpolating sparse multivariate polynomials from their values is Zippel's probabilistic algorithm (1988). The algorithm evaluates the function to be interpolated at a significant number of points, and for many problems of interest processing evaluations dominates the running time. This thesis presents an improvement of Zippel's algorithm, which decreases the number of evaluations needed for an interpolation by using transposed Vandermonde systems for the univariate interpolation step of Zippel's algorithm. The technique also allows a more general form of the algorithm: it becomes possible to interpolate more than one variable within a …

On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov

Computer Science Faculty Publications

In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, …

Course Development For A College Java Programming Class, Nathan Dodge

Regis University Student Publications (comprehensive collection)

This project documents the development of college-level curriculum for an Object Oriented Programming with Java course. The curriculum includes a set of lessons that students work through interactively. The lessons teach the fundamentals of object orientation. A goal of the project is to have students work with the same problem example throughout the entire set of lessons. Most texts on object orientation use several abstract examples which are used in a chapter or two of the text and are often not fully implemented. Each lesson of the project's curriculum presents an iteration of an evolving shape drawing application. Each lesson …

Naboh System: Gathering Intelligence From Traffic Patterns, Angelica M. Delgado

Theses and Dissertations - UTB/UTPA

Network traffic anomalies are important indicators of problematic traffic over a network. Network activity has patterns associated with it depending on the applications running on the local hosts connected to the network. There are traffic parameters into which network traffic of a local host can be divided: bandwidth usage, number of remote hosts that a local host is connecting to and vice versa, and number of ports used by the local host. This thesis develops a system for detecting and profiling network anomalies by analyzing traffic parameters using intelligent computational techniques. The developed system gathers intelligence by examining only the …

Entropy-Based 2d Image Dissimilarity Measure, Meng-Hung Wu

Theses and Dissertations - UTB/UTPA

Traditional histogram or statistics based 2D image similarity/dissimilarity metrics fail to handle conjugate pair of black and white images, due to the lack of spatial information in the measurement. Recently proposed Compression-based Dissimilarity Measure (CDM) [1] based on the concept of Kolmogorov complexity has provided a different paradise for similarity measurement. However, without a clear definition how to “concatenate” two 2D images, CDM has difficulties to directly apply with 2D images. In this thesis, an entropy -based 2D image dissimilarity measure is proposed within the same Kolmogorov complexity paradise. The spatial relationship between images is embedded in our metric, and …

Compensation For Automatic White Balance Correction With Histogram Equalization, David D. Kirtley

Theses and Dissertations - UTB/UTPA

Histogram equalization rather than hard scaling can be used as an effective technique to counter automatic white balance correction in video processing to facilitate motion detection in video sequences. Benefits of this method are less user interaction needed by not needing to preview the image to select a scaling area and reduction of the non-focused changes in the video caused by using a scaling area. Reduced interaction lends itself to data mining of video.

Empirical Performance Analysis Of Two Algorithms For Mining Intentional Knowledge Of Distance-Based Outliers, Enbamoorthy Prasanthi

Theses and Dissertations - UTB/UTPA

This thesis studies the empirical analysis of two algorithms, Uplattice and Jumplattice for mining intentional knowledge of distance-based outliers [19]. These algorithms detect strongest and weak outliers among them. Finding outliers is an important task required in major applications such as credit-card fraud detection, and the NHL statistical studies. Datasets of varying sizes have been tested to analyze the empirical values of these two algorithms. Effective data structures have been used to gain efficiency in memory-performance. The two algorithms provide intentional knowledge of the detected outliers which determines as to why an identified outlier is exceptional. This knowledge helps the …

Some Nonparametric And Semiparametric Methods For Discriminant Analysis., Anil Kumar Ghosh Dr.

Doctoral Theses

Discriminant analysis (see e.g., Devijver and Kittler, 1982; Duda, Hart and Stork, 2000; Hastle, Tibahirani and Friedman, 2001) deals with the separation of different groups of obaervationa and allocation of a new oboervation to one of the previously delined grouga. In a J-class discriminant analysis problem, we usually hae a training sample of the form {(xk, ck) : k = 1,2,...,N}, where xk = (Ik1,Ik2,...J) is a d-dimensional measarement vector, and ca € {1,2,...,J} is its class label. On the basis of thia training sample, one aims to form a decision rule d(x) : Rd + (1,2,...,J} for clasifying the …

Developing A B -Tagging Algorithm Using Soft Muons At Level-3 For The Dø Detector At Fermilab, Mayukh Das

Doctoral Dissertations

The current data-taking phase of the DØ detector at Fermilab, called Run II, is designed to aid the search for the Higgs Boson. The neutral Higgs is postulated to have a mass of 117 GeV. One of the channels promising the presence of this hypothetical particle is through the decay of b-quark into a muon. The process of identifying a b-quark in a jet using muon as a reference is b-tagging with a muon tag.

At the current data taking and analysis rate, it will take long to reach the process of identifying valid events. The triggering mechanism of the …

Cryptographic And Combinatorial Properties Of Boolean Functions And S-Boxes., Kishan Chand Gupta Dr.

Doctoral Theses

In this thesis we study combinatorial aspects of Boolean functions and S-boxes with impor- tant cryptographic properties and construct new functions possesing such properties. These have possible applications in the design of private key (symmetric key) cryptosystems.Symmetric key cryptosystems are broadly divided into two classes.1. Stream Ciphers,2. Block Ciphers.Some recent proposals of stream ciphers are SNOW [37], SCREAM [52], TURING (98], MUGI (117), HBB (102], RABBIT (9), HELIX (38] and some proposals of block ciphers are DES, AES, RC6 [97), MARS (12], SERPENT (6], TWOFISH (104].In stream cipher cryptography a pseudorandom sequence of bits of length cqual to the message …

Morphological Tower: A Tool For Multi-Scale Image Processing., Susanta Mukhopadhyay Dr.

Doctoral Theses

An image is a recorded replication of natural scene or objects using suitable sensor and recording media. The visual quality of the recorded image may be enhanced using various types of low-level processing namely noise smoothing, contrast enhancement. The images of the same scene recorded by several sensors reveal more inforination but in their own respective ways. This advantage of multi-sensor imaging system is real- ized through the fusion of the multimodal images. One more important higher-level processing is segmentation where the image is decomposed into a set of meaningful regions ( e.g. objects and background). An image, in general, …

On Some Generalized Transforms For Signal Decomposition And Reconstruction., Yumnam Singh Dr.

Doctoral Theses

In this thesis, we propose two new subband transforms entitled ISITRA and YKSK transforms and their possible applications in image compression and encryption. Both these transforms are developed based on a common model of multiplication known as Bino’s model of multiplication. ISITRA is a convolution based transforms i.e., that both forward and inverse transform of ISITRA is based on convolution as in DWT or 2-channel filter bank. However, it is much more general than the existing DWT or 2-channel filter bank scheme in the sense that it we can get different kinds of filters in addition to the filters specified …

Sign Classification Using Local And Meta-Features, Marwan A. Mattar,, Allen R. Hanson,, Erik G. Learned-Miller

Erik G Learned-Miller

Our world is populated with visual information that a sighted person makes use of daily. Unfortunately, the visually impaired are deprived from such information, which limits their mobility in unconstrained environments. To help alleviate this we are developing a wearable system [1, 19] that is capable of detecting and recognizing signs in natural scenes. The system is composed of two main components, sign detection and recognition. The sign detector, uses a conditional maximum entropy model to find regions in an image that correspond to a sign. The sign recognizer matches the hypothesized sign regions with sign images in a database. …