Physical Sciences and Mathematics Commons^™

Hardware Algorithm Implementation For Mission Specific Processing, Jason W. Shirley

Theses and Dissertations

There is a need to expedite the process of designing military hardware to stay ahead of the adversary. The core of this project was to build reusable, synthesizeable libraries to make this a possibility. In order to build these libraries, Matlab® commands and functions, such as Conv2, Round, Floor, Pinv, etc., had to be converted into reusable VHDL modules. These modules make up reusable libraries for the Mission Specific Process (MSP) which will support AFRL/RY. The MSP allows the VLSI design process to be completed in a mere matter of days or months using an FPGA or ASIC design, as …

Geometric Primitives In Digital Images: Analyses And Applications Using Digital Geometry., Partha Bhowmick Dr.

Doctoral Theses

No abstract provided.

Traffic Analysis Of Udp-Based Flows In Ourmon, Jim Binkley, Divya Parekh

Computer Science Faculty Publications and Presentations

We present a custom UDP flow tuple with an IP address key and a set of simple related statistical attributes. Attributes are used to calculate a per host metric called the UDP work weight which roughly measures the amount of network noise caused by a host. The work weight is used to produce a near real-time sorted top N report for UDP host tuples. We also present a derived attribute based on an algorithm called the UDP guesstimator. The UDP guesstimator roughly classifies port report hosts into various traffic categories including security threats (DOS/scanning) or P2P hosts based on high …

Searching For The Majority: Algorithms Of Voluntary Control, Jin Fan, Kevin G. Guise, Xun Liu, Hongbin Wang

Faculty, Staff and Student Publications

Voluntary control of information processing is crucial to allocate resources and prioritize the processes that are most important under a given situation; the algorithms underlying such control, however, are often not clear. We investigated possible algorithms of control for the performance of the majority function, in which participants searched for and identified one of two alternative categories (left or right pointing arrows) as composing the majority in each stimulus set. We manipulated the amount (set size of 1, 3, and 5) and content (ratio of left and right pointing arrows within a set) of the inputs to test competing hypotheses …

Chemical Analysis Of Polymer Blends Via Synchrotron X-Ray Tomography, Heath Alan Barnett

LSU Doctoral Dissertations

Material properties of industrial polymer blends are of great importance. X-ray tomography has been used to obtain spatial chemical information about various polymer blends. The spatial images are acquired with synchrotron X-ray tomography because of its rapidity, good spatial resolution, large field-of-view, and elemental sensitivity. The spatial absorption data acquired from X-ray tomography experiments is converted to spatial chemical information via a linear least squares fit of multi-spectral X-ray absorption data. A fiberglass-reinforced polymer blend with a new-generation flame retardant is studied with multi-energy synchrotron X-ray tomography to assess the blend homogeneity. Relative to other composite materials, this sample is …

Vegetation Identification Based On Satellite Imagery, Vamsi K.R. Mantena, Ramu Pedada, Srinivas Jakkula, Yuzhong Shen, Jiang Li, Hamid R. Arabnia (Ed.)

Electrical & Computer Engineering Faculty Publications

Automatic vegetation identification plays an important role in many applications including remote sensing and high performance flight simulations. This paper presents a method to automatically identify vegetation based upon satellite imagery. First, we utilize the ISODATA algorithm to cluster pixels in the images where the number of clusters is determined by the algorithm. We then apply morphological operations to the clustered images to smooth the boundaries between clusters and to fill holes inside clusters. After that, we compute six features for each cluster. These six features then go through a feature selection algorithm and three of them are determined to …

Efficient Corona Training Protocols For Sensor Networks, Alan A. Bertossi, Stephan Olariu, Cristina M. Pinotti

Computer Science Faculty Publications

Phenomenal advances in nano-technology and packaging have made it possible to develop miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. It is expected that these small devices, referred to as sensors, will be mass-produced and deployed, making their production cost negligible. Due to their small form factor and modest non-renewable energy budget, individual sensors are not expected to be GPS-enabled. Moreover, in most applications, exact geographic location is not necessary, and all that the individual sensors need is a coarse-grain location awareness. The task of acquiring such a coarse-grain location awareness is referred to as training. …

Hardness For Explicit State Software Model Checking Benchmarks, Eric G. Mercer, Neha Rungta

Faculty Publications

Directed model checking algorithms focus computation resources in the error-prone areas of concurrent systems. The algorithms depend on some empirical analysis to report their performance gains. Recent work characterizes the hardness of models used in the analysis as an estimated number of paths in the model that contain an error. This hardness metric is computed using a stateless random walk. We show that this is not a good hardness metric because models labeled hard with a stateless random walk metric have easily discoverable errors with a stateful randomized search. We present an analysis which shows that a hardness metric based …

Construction Of (Hierarchical) Identity-Based Encryption Protocols Using Bilinear Pairing., Sanjit Chatterjee Dr.

Doctoral Theses

Science, it is argued [65], advances through paradigm shifts. Concepts emerge that open-up new vistas of research, fundamentally changing the way we are used to looking at things. Between these paradigm shifts remain the periods of consolidation. Periods when human mind explores the newly found territory, shedding light on hitherto unknown dimensions. If radical changes are the hallmarks of paradigm shifts, the period within witnesses small but continuous developments, occasionally marked by its own milestones. It is in these periods that human faculty tries to grasp the full significance of the new concepts, consolidates its gains and thereby pushes the …

Some Necessary Conditions Of Boolean Functions To Resist Algebraic Attacks., Deepak Dalai Dr.

Doctoral Theses

No abstract provided.

Linear-Time Algorithms For Edge-Based Problems, Alan Jamieson

All Dissertations

There is a dearth of algorithms that deal with edge-based problems in trees, specifically algorithms for edge sets that satisfy a particular parameter. The goal of this thesis is to create a methodology for designing algorithms for these edge-based problems. We will present a variant of the Wimer method [Wimer et al. 1985] [Wimer 1987] that can handle edge properties. We call this variant the Wimer edge variant. The thesis is divided into three sections, the first being a chapter devoted to defining and discussing the Wimer edge variant in depth, showing how to develop an algorithm using this variant, …

A Multi-Scale Tikhonov Regularization Scheme For Implicit Surface Modeling, Jianke Zhu, Steven C. H. Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

Kernel machines have recently been considered as a promising solution for implicit surface modelling. A key challenge of machine learning solutions is how to fit implicit shape models from large-scale sets of point cloud samples efficiently. In this paper, we propose a fast solution for approximating implicit surfaces based on a multi-scale Tikhonov regularization scheme. The optimization of our scheme is formulated into a sparse linear equation system, which can be efficiently solved by factorization methods. Different from traditional approaches, our scheme does not employ auxiliary off-surface points, which not only saves the computational cost but also avoids the problem …

A Study On Time/Memory Trade-Off Cryptanalysis., Sourav Mukhopadhyay Dr.

Doctoral Theses

At the beginning of 2003, I was searching for a suitable area to do my PhD. My respected guide Prof. Palash Sarkar assigned me to do a survey work on block cipher cryptanalysis. I found myself very interested in this area. I am very lucky that I joined into a golden group – Cryptology Research Group of India formed by our beloved teacher Prof. Bimal Roy and had the opportunity to work with Prof. Palash Sarkar, Dr. Subhomoy Maitra, Prof. Rana Barua and many others. I have been inspired by many persons during my PhD work.I would like to begin …

A Day In The Life Of Pubmed: Analysis Of A Typical Day's Query Log, Jorge R Herskovic, Len Y Tanaka, William Hersh, Elmer V Bernstam

Faculty, Staff and Student Publications

OBJECTIVE: To characterize PubMed usage over a typical day and compare it to previous studies of user behavior on Web search engines. DESIGN: We performed a lexical and semantic analysis of 2,689,166 queries issued on PubMed over 24 consecutive hours on a typical day. MEASUREMENTS: We measured the number of queries, number of distinct users, queries per user, terms per query, common terms, Boolean operator use, common phrases, result set size, MeSH categories, used semantic measurements to group queries into sessions, and studied the addition and removal of terms from consecutive queries to gauge search strategies. RESULTS: The size of …

Concatenative Text-To-Speech Synthesis: A Study On Standard Colloquial Bengali., Soumen Chowdhury Dr.

Doctoral Theses

The primary communication process between human beings is Speech. Speech synthesis is the automatic and artificial generation of the speech signal by a machine. A TTS (Text-To-Speech) synthesis system is one which can generate speech signal from a string of text in a given language. The development in the speech synthesis systems in various languages has been going on for several decades. With the unprecedented expansion of IT (Information Technology) invading the life of the common man it is highly desirable that at least the information dissemination be made via the speech mode which is the most natural mode of …

Some Geometrical Aspects Of The Cone Linear Complementarity Problem., Madhur Malik Dr.

Doctoral Theses

Cone Linear Complementarity ProblemLet V be a finite dimensional real inner product space and K be a closed convex cone in V. Given a linear transformation L : V → V and a vector q ∈ V the cone linear complementarity problem or linear complementarity problem over K, denoted as LCP(K, L, q), is to find a vector x ∈ K such thatL(x) + q ∈ K+ and hx, L(x) + qi = 0,where h., .i denotes an inner product on V and K is the dual cone of K defined as:K∗ := {y ∈ V : hx, yi ≥ …

Lectures In Computational Fluid Dynamics Of Incompressible Flow: Mathematics, Algorithms And Implementations, James M. Mcdonough

Mechanical Engineering Textbook Gallery

From Prologue:

The present lecture notes are written to emphasize the mathematics of the Navier–Stokes (N.–S.) equations of incompressible flow and the algorithms that have been developed over the past 30 years for solving them.

Using Pareto Fronts To Evaluate Polyp Detection Algorithms For Ct Colonography, Adam Huang, Jiang Li, Ronald M. Summers, Nicholas Petrick, Amy K. Hara

Electrical & Computer Engineering Faculty Publications

We evaluate and improve an existing curvature-based region growing algorithm for colonic polyp detection for our CT colonography (CTC) computer-aided detection (CAD) system by using Pareto fronts. The performance of a polyp detection algorithm involves two conflicting objectives, minimizing both false negative (FN) and false positive (FP) detection rates. This problem does not produce a single optimal solution but a set of solutions known as a Pareto front. Any solution in a Pareto front can only outperform other solutions in one of the two competing objectives. Using evolutionary algorithms to find the Pareto fronts for multi-objective optimization problems has been …

Exploration Of Computational Methods For Classification Of Movement Intention During Human Voluntary Movement From Single Trial Eeg, Ou Bai, Peter Lin, Sherry Vorbach, Jiang Li, Steve Furlani, Mark Hallett

Electrical & Computer Engineering Faculty Publications

Objective: To explore effective combinations of computational methods for the prediction of movement intention preceding the production of self-paced right and left hand movements from single trial scalp electroencephalogram (EEG).

Methods: Twelve naïve subjects performed self-paced movements consisting of three key strokes with either hand. EEG was recorded from 128 channels. The exploration was performed offline on single trial EEG data. We proposed that a successful computational procedure for classification would consist of spatial filtering, temporal filtering, feature selection, and pattern classification. A systematic investigation was performed with combinations of spatial filtering using principal component analysis (PCA), independent component analysis …

Properties Of Some Matrix Classes In Linear Complementarity Theory., Arup Kumar Das Dr.

Doctoral Theses

The linear complementarity problem is a fundamental problem that arises in optimization, game theory, economics, and engineering. It can be stated as follows:Given a square matrix A of order n with real entries and an n dimensional vector q, find n dimensional vectors w and z satisfying w − Az = q, w ≥ 0, z ≥ 0 (1.1.1) w t z = 0. (1.1.2)This problem is denoted as LCP(q, A). The name comes from the condition (1.1.2), the complementarity condition which requires that at least one variable in the pair (wj , zj ) should be equal to 0 …

Improving Database Quality Through Eliminating Duplicate Records, Mingzhen Wei, Andrew H. Sung, Martha E. Cather

Geosciences and Geological and Petroleum Engineering Faculty Research & Creative Works

Redundant or duplicate data are the most troublesome problem in database management and applications. Approximate field matching is the key solution to resolve the problem by identifying semantically equivalent string values in syntactically different representations. This paper considers token-based solutions and proposes a general field matching framework to generalize the field matching problem in different domains. By introducing a concept of String Matching Points (SMP) in string comparison, string matching accuracy and efficiency are improved, compared with other commonly-applied field matching algorithms. The paper discusses the development of field matching algorithms from the developed general framework. The framework and corresponding …

A New Application Of The Channel Packet Method For Low Energy 1-D Elastic Scattering, Clint M. Zeringue

Theses and Dissertations

An algorithm is presented which uses the channel packet method (CPM) to simulate low-energy, wave-packet propagation and compute S-matrix elements. A four-by-four matrix containing the momentum, expansion coefficients of the reactants and products is introduced to account for initial and final states having both positive and negative momentum. The approach does not consider scattering from one side or the other, rather it considers both incoming and outgoing wave packets from the left and right simultaneously. Therefore, during one simulation all four S-matrix elements, and elements, S_+k,-K, S_{-k, +k}, S_{+k, +k} and S_-k,-k are computed. …

Extraction Of Coherent Relevant Passages Using Hidden Markov Models, Jing Jiang, Chengxiang Zhai

Research Collection School Of Computing and Information Systems

In information retrieval, retrieving relevant passages, as opposed to whole documents, not only directly benefits the end user by filtering out the irrelevant information within a long relevant document, but also improves retrieval accuracy in general. A critical problem in passage retrieval is to extract coherent relevant passages accurately from a document, which we refer to as passage extraction. While much work has been done on passage retrieval, the passage extraction problem has not been seriously studied. Most existing work tends to rely on presegmenting documents into fixed-length passages which are unlikely optimal because the length of a relevant passage …

Apparatus And Method For Using Adaptive Algorithms To Exploit Sparsity In Target Weight Vectors In An Adaptive Channel Equalizer, Richard K. Martin, Robert C. Williamson, William A. Sethares

AFIT Patents

An apparatus and method is disclosed for using adaptive algorithms to exploit sparsity in target weight vectors in an adaptive channel equalizer. An adaptive algorithm comprises a selected value of a prior and a selected value of a cost function. The present invention comprises algorithms adapted for calculating adaptive equalizer coefficients for sparse transmission channels. The present invention provides sparse algorithms in the form of a Sparse Least Mean Squares (LMS) algorithm and a Sparse Constant Modulus Algorithm (CMA) and a Sparse Decision Directed (DD) algorithm.

Design Of Iteration On Hash Functions And Its Cryptanalysis., Mridul Nandi Dr.

Doctoral Theses

No abstract provided.

Bounded Search For De Novo Identification Of Degenerate Cis-Regulatory Elements, Jonathan M. Carlson, Arijit Chakravarty, Radhika S. Khetani, Robert H. Gross

Dartmouth Scholarship

The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential cis-regulatory elements. However, in practice many cis-regulatory elements are highly degenerate, precluding the use of an exhaustive word-counting strategy for their identification. While numerous methods exist for inferring base distributions using a position weight matrix, recent studies suggest that the independence assumptions inherent in the model, as well as the inability to reach a global optimum, limit this approach.

Identification Of Gene Expression Patterns Using Planned Linear Contrasts, Hao Li, Constance L. Wood, Yushu Liu, Thomas V. Getchell, Marilyn L. Getchell, Arnold J. Stromberg

Statistics Faculty Publications

BACKGROUND: In gene networks, the timing of significant changes in the expression level of each gene may be the most critical information in time course expression profiles. With the same timing of the initial change, genes which share similar patterns of expression for any number of sampling intervals from the beginning should be considered co-expressed at certain level(s) in the gene networks. In addition, multiple testing problems are complicated in experiments with multi-level treatments when thousands of genes are involved.

RESULTS: To address these issues, we first performed an ANOVA F test to identify significantly regulated genes. The Benjamini and …

Engineering A Suburban Ad-Hoc Network, Mike Tyson, Ronald D. Pose, Carlo Kopp, Mohammad Rokonuzzaman, Muhammad Mahmudul Islam

Australian Information Warfare and Security Conference

Networks are growing in popularity, as wireless communication hardware, both fixed and mobile, becomes more common and affordable. The Monash Suburban Ad-Hoc Network (SAHN) project has devised a system that provides a highly secure and survivable ad-hoc network, capable of delivering broadband speeds to co-operating users within a fixed environment, such as a residential neighbourhood, or a campus. The SAHN can be used by residents within a community to exchange information, to share access to the Internet, providing last-mile access, or for local telephony and video conferencing. SAHN nodes are designed to be self-configuring and selfmanaging, relying on no experienced …

Type Ii Quantum Computing Algorithm For Computational Fluid Dynamics, James A. Scoville

Theses and Dissertations

An algorithm is presented to simulate fluid dynamics on a three qubit type II quantum computer: a lattice of small quantum computers that communicate classical information. The algorithm presented is called a three qubit factorized quantum lattice gas algorithm. It is modeled after classical lattice gas algorithms which move virtual particles along an imaginary lattice and change the particles’ momentums using collision rules when they meet at a lattice node. Instead of moving particles, the quantum algorithm presented here moves probabilities, which interact via a unitary collision operator. Probabilities are determined using ensemble measurement and are moved with classical communications …

Multiframe Shift Estimation, Stephen A. Bruckart

Theses and Dissertations

The purpose of this research was to develop a fundamental framework for a new approach to multiframe translational shift estimation in image processing. This thesis sought to create a new multiframe shift estimator, to theoretically prove and experimentally test key properties of it, and to quantify its performance according to several metrics. The new estimator was modeled successfully and was proven to be an unbiased estimator under certain common image noise conditions. Furthermore its performance was shown to be superior to the cross correlation shift estimator, a robust estimator widely used in similar image processing cases, according to several criteria. …