Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 11 of 11

Full-Text Articles in Entire DC Network

Developing A B-Jet Tagging Algorithm For Alice: Lessons From Cdf, Paul Chester-John Carlson Dec 2009

Developing A B-Jet Tagging Algorithm For Alice: Lessons From Cdf, Paul Chester-John Carlson

Physics

This paper compares the detectors and algorithms developed and used at both A Large Ion Collider Experiment (ALICE) and the Collider Detector at Fermilab (CDF). We found that the detectors share many similarities in data collection and analysis methods and that by adapting algorithms that have been tested and used at CDF, ALICE could augment its existing algorithms. The algorithms formed from this adaptation will help ALICE isolate b-jets quickly and explore the quark-gluon plasma, ultimately expanding our understanding of the strong nuclear force and its role in the evolution of our universe.


Geometric Characterization Of Digital Objects: Algorithms And Applications To Image Analysis., Arindam Biswas Dr. Sep 2009

Geometric Characterization Of Digital Objects: Algorithms And Applications To Image Analysis., Arindam Biswas Dr.

Doctoral Theses

Several problems of characterizing a digital object, and particularly, those related to boundary description, have been studied in this thesis. New algorithms and their applications to various aspects of image analysis and retrieval have been reported. A combinatorial technique for constructing the outer and inner isothetic covers of a digital object has been developed. The resolution of the background 2D grid can be changed by varying the grid spacing, and this procedure can be used to extract shape and topological information about the object. Next, an algorithm has been designed for constructing the orthogonal (convex) hull of a digital object …


Normal Surfaces And Heegaard Splittings Of 3-Manifolds., Tejas Kalelkar Dr. Aug 2009

Normal Surfaces And Heegaard Splittings Of 3-Manifolds., Tejas Kalelkar Dr.

Doctoral Theses

This thesis deals with various questions regarding normal surfaces and Heegaard splittings of 3-manifolds.Chapter 1The first chapter is divided into two parts. In the first, we give an outline of normal surface theory and mention some of its important applications. The second part gives an overview of the theory of Heegaard splitting surfaces and a few of its applications. None of the material covered in this chapter is original and it is meant solely as an exposition of known results.Chapter 2In this chapter, we give a lower bound on the Euler characteristic of a normal surface, a topological invariant, in …


Effect Of Advanced Synthetically Enhanced Detector Resolution Algorithm On Specificity And Sensitivity Of Portable High Purity Germanium Gamma Detector Spectra, Latosha M. Bell Jun 2009

Effect Of Advanced Synthetically Enhanced Detector Resolution Algorithm On Specificity And Sensitivity Of Portable High Purity Germanium Gamma Detector Spectra, Latosha M. Bell

Theses and Dissertations

The ability to identify special nuclear material is one of the necessary prevention mechanisms for preventing proliferation of special nuclear materials. Additionally, if a nuclear event were to occur, information about the nuclear material used may be extracted from gamma spectra, provided it is obtained quickly and accurately. This can be made possible with the use of the exceptional resolution of the HPGe detector. This experiment applied the Advanced Synthetically Enhanced Detector Resolution Algorithm (ASEDRA) to a portable HPGe detector's spectra, to investigate whether improvements in specificity and sensitivity can be obtained. This method has been used to improve performance …


Studies On Construction And List Decoding Of Codes On Some Towers Of Function Fields., M. Prem Laxman Das Dr. Mar 2009

Studies On Construction And List Decoding Of Codes On Some Towers Of Function Fields., M. Prem Laxman Das Dr.

Doctoral Theses

In everyday life, there arise many situations where two parties, sender and receiver, need to communicate. The channel through which they communicate is assumed to be binary symmetric, that is, it changes 0 to 1 and vice versa with equal probability. At the receiver’s end, the sent message has to be recovered from the corrupted received word using some reasonable mechanism. This real life problem has attracted a lot of research in the past few decades. A solution to this problem is obtained by adding redundancy in a systematic manner to the message to construct a codeword. The collection of …


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

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 Mar 2009

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 …


Image And Video Compression Using Block Truncation Coding And Pattern Fitting For Fast Decoding., Bibhas Chandra Dhara Dr. Feb 2009

Image And Video Compression Using Block Truncation Coding And Pattern Fitting For Fast Decoding., Bibhas Chandra Dhara Dr.

Doctoral Theses

In the present era of multimedia, the requirement of image/video storage and transmission for video conferencing, image and video retrieval, video playback, etc. are increasing exponentially. As a result, the need for better compression technology is always in demand. The limited bandwidth of internet also asks for transmission of desired objects only. Progressive image transmission provides such facilities, where transmission is done in steps and the transmission of undesired image can be stopped at an early stage. Modern applications, in addition to high compression ratio, also demand for efficient encoding and decoding processes, so that computational constraint of many real-time …


Web Surfer Models: Preprocessing, Page Ranking, And Quantitative Evaluation., Narayan L. Bhamidipati Dr. Feb 2009

Web Surfer Models: Preprocessing, Page Ranking, And Quantitative Evaluation., Narayan L. Bhamidipati Dr.

Doctoral Theses

The World Wide Web [12] (usually referred to as the Web, WWW or W3) is an enormous collection of data available over the Internet, which is a vast network of computers. It was created in the year 1990 by Tim Berners-Lee, while he worked at CERN, Switzerland, and was made available over the Internet in 1991. The World Wide Web Consortium [136] authoritatively defines the Web as the universe of network-accessible information, the embodiment of human knowledge. The Web consists of objects, also called documents or pages in a generic sense, that are identified using a Uniform Resource Identifier (URI), …


Placement And Range Assignment In Power-Aware Radio Networks., Gautam Kumar Das Dr. Feb 2009

Placement And Range Assignment In Power-Aware Radio Networks., Gautam Kumar Das Dr.

Doctoral Theses

Due to the extraordinary growth of demand in mobile communication facility, design of efficient systems for providing specialized services has become an important issue in wireless mobility research. Broadly speaking, there are two major models for wireless networking: single-hop and multi-hop. The single-hop model [110] is based on the cellular network, and it provides one-hop wireless connectivity between the host and the static nodes known as base stations. single-hop networks rely on a fixed backbone infrastructure that interconnects all the base stations by high speed wired links. On the other hand, the multi-hop model requires neither fixed wired infrastructure nor …


Alliances In Graphs: Parameterized Algorithms And On Partitioning Series-Parallel Graphs, Rosa Enciso Jan 2009

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 …