Physical Sciences and Mathematics Commons^™

Customization Of A Generic Search Engine By Adding User Categories, Ajay Mohandas Madkaiker

Computer Science and Engineering Theses

The current search engines available on the Net are generic in nature. They do not consider user preferences and treat all users information needs in the same way. As a result they frequently return a large number of links, that do not meet the user's information need. This requires more searching to find what the user is looking for. For example if a user is interested in a particular game, e.g. cricket, and enters the query world cup, a generic search engine would return links of all the sports that hold a world cup. The user has to browse through …

Estream: An Integration Of Event And Stream Processing, Vihang Garg

Computer Science and Engineering Theses

Event and stream data processing models have been researched extensively and are utilized in diverse application domains. Advanced applications require both event and stream processing, which is currently not supported. Although there are number of similarities and differences between them, a synergistic integration of their strengths will be better than the sum of their parts. In this thesis, we present EStream, an integrated event and stream processing system for monitoring changes on stream computations and for expressing and processing complex events on continuous queries (CQs). We introduce attribute-based constraints for reducing uninteresting events that are generated from CQs. We discuss …

Testing Java Monitors By State Space Exploration, Monica Maria Hernandez

Computer Science and Engineering Theses

Java monitors are classes that are intended to be accessed by multiple threads at the same time. Detecting synchronization faults in Java Monitors is considerably more challenging than testing regular classes, due to the inherent non-determinism of concurrent programs. This thesis proposes a state based exploration approach to testing Java monitors. This approach consists of exploring the state space of a Java monitor in a depth-first manner, dynamically building test sequences, which are comprised by the states explored along each path. Moreover, threads are introduced on the fly during the exploration of each path, based on several rules for simulating …

Hdb-Subdue, A Relational Database Approach To Graph Mining And Hierarchical Reduction, Srihari Padmanabhan

Computer Science and Engineering Theses

Data mining aims at discovering interesting and previously unknown patterns from data sets. Transactional mining (association rules, decision trees etc.) can be effectively used to find non-trivial patterns in categorical and unstructured data. For applications that have an inherent structure (e.g., chemical compounds, proteins) graph mining is appropriate, because mapping the structured data into other representations would lead to loss of structure. The need for mining structured data has increased in the past few years. Graph mining uses graph theory principles to perform mining. Database mining of graphs aims at mining structured graph data stored in relational database tables using …

Graph-Based Learning Using A Naive Bayesian Classifier, Robert Hawes

Computer Science and Engineering Theses

Graph-based data representation is becoming increasingly more commonplace, as graphs can represent some kinds of data more efficiently than relational tables. As such, interesting patterns in the form of subgraphs can be discovered by mining these graph-based datasets. Because the learned patterns can be used to predict future occurrences, it is necessary to learn graphical concepts that can optimally classify the data in the presence of uncertainty. This work explores the construction and learning of optimal naïve Bayesian graph classifiers to distinguish between positive and negative graphs given a set of graphs as examples. Whereas most previous work in graph-based …

Approaches For Validating Frequent Episodes Based On Periodicity In Time-Series Data, Dhawal Y. Bhatia

Computer Science and Engineering Theses

There is ongoing research on sequence mining of time-series data. We study Hybrid Apriori, an interval-based approach to episode discovery that deals with different periodicities in time-series data. Our study identifies the anomaly in the Hybrid Apriori by confirming the false positives in the frequent episodes discovered. The anomaly is due to the folding phase of the algorithm, which combines periods in order to compress data. We propose a main memory based solution to distinguish the false positives from the true frequent episodes. Our algorithm to validate the frequent episodes has several alternatives such as the naïve approach, the partitioned …

Csegrid Portal: A Secure Web-Based Solution For Providing Ubiquitious Access To Grid Services (Design, Development And Implementation Of A Prototype), Srikant D. Rao

Computer Science and Engineering Theses

Grid computing is emerging as a revolutionary concept for performing high performance computations on the grid. The grid infrastructure comprises of a large set of distributed computing resources that are shared across geographical and organizational boundaries. There is a need within the scientific community for friendly interfaces that can be used to obtain ubiquitous access to the grid resources. In this work, we address these needs by designing and implementing a web-based grid portal system (CSEGrid) that provides the user with transparent access to grid services like job submission, job status and resource monitoring, data transfer between grid resources, etc. …

Solving The Rubik's Cube With Parallel Processing, Aslesha Pramod Nargolkar

Computer Science and Engineering Theses

This thesis investigates parallel processing techniques for solving the 3 x 3 x 3 Rubik's Cube. We explore various state-space search based algorithmic approaches to optimally solve the Cube. The parallel processing approach is based on IDA* using a pattern database as the underlying heuristic because of its well established effectiveness. The parallel algorithm is an extension of the Michael Reid algorithm which is sequential. The parallel algorithm exhibits good speedup and scalability. Nearly 150 random as well as symmetrical cube configurations were tested for the experiments on sequential and parallel implementations. The proposed parallel algorithm using master-slave type of …

Evolving Modular Programs By Extracting Reusable Functions Using Significance Testing, Anthony Loeppert

Computer Science and Engineering Theses

Genetic programming is an automatic programming method that uses biologically inspired methods to evolve programs. Genetic programming, and evolutionary methods in general, are useful for problem domains in which a method for \emph{constructing} solutions is either not known or infeasible, but a method for \emph{rating} solutions exists. In order to address more complex problem domains, techniques exist to extract functions (modules) automatically during a GP search. This work describes a method to identify useful automatically extracted functions from a GP search to assist subsequent GP searches within the same problem domain, using significance testing. Functions classified as beneficial augment the …

Interactive Animated Concept Map Generation - Using Dynamic Animations, Suneel Vana

Computer Science and Engineering Theses

We present a visualization tool, which is useful for the illustration of educational concepts using interactive animated concept maps. This system serves as a presentation tool which provides a collection of multimedia elements (images, animations, audios clips and video clips), a collection of animated presentation templates and an interface by using which users can retrieve the multimedia elements from the multimedia database and generate the dynamic animations by placing the selected elements into the placeholders of the templates. The system generates the animated presentation by replacing embedded multimedia objects and their properties as desired by its users. A multimedia information …

Search For Lepton-Flavor Violation At Hera, S. Chekanov, M. Derrick, S. Magill, S. Miglioranzi, B. Musgrave, J. Repond, R. Yoshida, Margarita C. K. Mattingly, N. Pavel, A. G. Yagües Molina, P. Antonioli, G. Bari, M. Basile, L. Bellagamba, D. Boscherini, A. Bruni, G. Bruni, G. Cara Romeo, L. Cifarelli, F. Cindolo, A. Contin, M. Corradi, S. De Pasquale, P. Giusti, G. Iacobucci, A. Margotti, A. Montanari, R. Nania, F. Palmonari, A. Pesci, A. Polini

Faculty Publications

A search for lepton-flavor-violating interactions ep → μX and ep → τX has been performed with the ZEUS detector using the entire HERA I data sample, corresponding to an integrated luminosity of 130 pb-1. The data were taken at center-of-mass energies, √s, of 300 and 318 GeV. No evidence of lepton-flavor violation was found, and constraints were derived on leptoquarks (LQs) that could mediate such interactions. For LQ masses below √s, limits were set on λeq1 √β ℓq, where λeq1 is the coupling of the LQ to an electron and a first-generation quark q1, and βℓq is the branching ratio …

Deciphering Eustatic And Tectonic Influences During Parasequence Development In The Mesoprotozoic Helena/Wallace Formation, Belt Supergroup, Montana And Idaho, Stephen Alan Welch

Masters Theses

The stratigraphic architecture of sedimentary basins results from a combination of changes in relative sea-level and tectonism, and resulting changes in sediment supply. The Helena/Wallace formations, Mesoproterozoic Belt Supergroup, Montana and Idaho, consists of >500 meters of stacked meter-scale cycles (parasequences) that record in situ carbonate deposition as well as siliciclastic deposition from both the Laurentian craton and an unknown (tectonically active?) western source. In this study, statistical methods and 2-D forward modeling are combined with geochemical provenance analysis to examine parasequence stacking patterns and decipher the relative eustatic and tectonic controls on sequence development.

Helena/Wallace parasequences are typically composed …

Multivalued Logic, Neutrosophy And Schrodinger Equation, Florentin Smarandache, Victor Christianto

Branch Mathematics and Statistics Faculty and Staff Publications

This book was intended to discuss some paradoxes in Quantum Mechanics from the viewpoint of Multi-Valued-logic pioneered by Lukasiewicz, and a recent concept Neutrosophic Logic. Essentially, this new concept offers new insights on the idea of ‘identity’, which too often it has been accepted as given. Neutrosophy itself was developed in attempt to generalize Fuzzy-Logic introduced by L. Zadeh. While some aspects of theoretical foundations of logic are discussed, this book is not intended solely for pure mathematicians, but instead for physicists in the hope that some of ideas presented herein will be found useful. The book is motivated by …

Development Of A Web-Based Gis For Groundwater Exploration In Arid Lands, Nakul Manocha

Masters Theses

A three-fold exercise was conducted to assess the groundwater potentiality in the Eastern Desert (ED) of Egypt. First, a database was generated to host all relevant data sets in a GIS environment for a better understanding of the spatial relationships between these data sets. Co-registered digital mosaics were generated from relevant data sets including remote sensing (e.g., Landsat TM, SIR-C, SRTM, TRMM), geochemical (solute concentrations, O and H stable isotope composition), geological (geologic maps), and hydrological (lithology, depth to water table) data sets. Second, a web-based GIS interface (ArcIMS) was developed to provide a vehicle for data analysis, visualization, and …

The Relationship Between Meteorological Patterns And Rural Ground Ozone Concentration, Dasen Kendrick

Masters Theses & Specialist Projects

Throughout the United States, many areas exceed the level of safe ground ozone (O3) concentration. Non-natural emissions made as result of daily human activities and natural emissions react photochemically to produce ground O3 concentration. Variation in ground O3 concentration is controlled by local and regional emissions, synoptic and mesoscale meteorology, and boundary layer chemistry and dynamics. When the right meteorological variables are present, rural areas can have unhealthy air conditions with high levels of ground O3 concentration similar to that of metropolitan areas. Particular ground O3 concentration episodes were analyzed to summarize what meteorological variables constitute a healthy or hazardous …

Cloning, Overexpression, Purification And Characterization On N-Terminal Metal Binding Domains 5 And 6 Of Wilsons Disease Protein, David Achila

Masters Theses

Wilsons disease is an autosomal recessive disorder of copper metabolism which results from mutations in the gene encoding for Wilson disease protein (WDP). The cytosolic N-terminus of WDP comprises six metal binding domains each containing a conserved metal binding motif, GMXCXXC. The contribution of these metal binding domains to copper homeostasis is poorly understood. We have cloned, expressed and purified residues 485 to 633 corresponding to N-terminal metal-binding domains 5 and 6 of WDP (WD5-6). Two of the 3 disease causing mutations in the N-terminal metal binding domains of WDP occur one in each of these domains and the two …

Correlogram Method For Comparing Bio-Sequences, Gandhali P. Samant

Theses and Dissertations

Sequence comparison is one of the most primitive operations used in bio-informatics. It is used as a basis for many other complex manipulations in the field of Computational Molecular Biology. Many methods and algorithms were developed to compare and align sequences effectively. Most of these methods use linear comparison and some standard scoring schemes to calculate the similarity between sequences. We described an alternative approach to compare sequences based on the correlogram method. This method has already been used in the past for comparing images. By using the correlogram method, a sequence is projected on a 3-D space and the …

A Block Oriented Fingerprinting Scheme In Relational Database, Siyuan Liu, Shuhong Wang, Robert H. Deng, Weizhong Shao

Research Collection School Of Computing and Information Systems

The need for protecting rights over relational data is of ever increasing concern. There have recently been some pioneering works in this area. In this paper, we propose an effective fingerprinting scheme based on the idea of block method in the area of multimedia fingerprinting. The scheme ensures that certain bit positions of the data contain specific values. The bit positions are determined by the keys known only to the owner of the data and different buyers of the database have different bit positions and different specific values for those bit positions. The detection of the fingerprint can be completed …

Cryptanalysis Of A Forward Secure Blind Signature Scheme With Provable Security, Shuhong Wang, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

A forward secure blind signature scheme was proposed by Duc, Cheon and Kim, in ICICS 2003. The security of the scheme was proved to be equivalent to the strong RSA assumption in the random oracle model. In this paper we present an attack to the scheme by forging valid signatures with public keys only. The attack is so efficient that forging a valid signature needs less computation than legally generating a signature, even considering only the user side. Our result implies that the security proof of the scheme must be invalid. Furthermore we point out the fault of the proof …

An Efficient And Robust Computational Framework For Studying Lifetime And Information Capacity In Sensor Networks, Enrique J. Duarte-Melo, Mingyan Liu, Archan Misra

Research Collection School Of Computing and Information Systems

In this paper we investigate the expected lifetime and information capacity, defined as the maximum amount of data (bits) transferred before the first sensor node death due to energy depletion, of a data-gathering wireless sensor network. We develop a fluid-flow based computational framework that extends the existing approach, which requires precise knowledge of the layout/deployment of the network, i.e., exact sensor positions. Our method, on the other hand, views a specific network deployment as a particular instance (sample path) from an underlying distribution of sensor node layouts and sensor data rates. To compute the expected information capacity under this distribution-based …

Paleoenvironmental Reconstruction Of The Late Cretaceous Eastern Gulf Coastal Plain In Georgia And Alabama, Tracy L. Hall

Theses and Dissertations

The present study reconstructs the regional paleoenvironment (particularly paleoclimate) of the Late Cretaceous Eastern Gulf Coastal Plain of Georgia and Alabama using paleobotanical, paleoecological and geochemical methods in order to evaluate the Late Cretaceous climate of the Southeastern United States, and to add to the body of paleoclimate data for that time. Paleobotanical analysis indicates a terrestrial mean annual temperature (MAT) of about 27°C during the Late Cretaceous, which is considerably warmer than modern terrestrial MAT. Stable oxygen isotope data from molluscan carbonate indicate mean sea surface temperature (SST) of 26.8 °C for the Santonian, 23.5°C for the early Campanian, …

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …

Authenticating Query Results In Data Publishing, Di Ma, Robert H. Deng, Hwee Hwa Pang, Jianying Zhou

Research Collection School Of Computing and Information Systems

We propose a communication-efficient authentication scheme to authenticate query results disseminated by untrusted data publishing servers. In our scheme, signatures of multiple tuples in the result set are aggregated into one and thus the communication overhead incurred by the signature keeps constant. Next attr-MHTs (tuple based Merkle Hash Tree) are built to further reduce the communication overhead incurred by auxiliary authentication information (AAI). Besides the property of communication-efficiency, our scheme also supports dynamic SET operations (UNION, INTERSECTION) and dynamic JOIN with immunity to reordering attack.

Sequential Aggregate Signatures Working Over Independent Homomorphic Trapdoor One-Way Permutation Domains, Huafei Zhu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

The contribution of this paper has two folds. In the first fold, we propose a generic construction of sequential aggregate signatures from families of certificated trapdoor one-way permutations. We show that our construction is provably secure in the random oracle model assuming that the underlying homomorphic permutations are trapdoor one-way. Compared to Lysyanskaya et al’s generic construction that is constructed from a trapdoor one-way permutation family working over the same domain [16], our scheme works over independent trapdoor one-way permutation domains. The flexible choice of the underlying permutation domains benefits our scheme to its applications in the real world where …

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 …

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 …

Accuracy Of The Newtom 3g™ In Measuring The Angle Of The Articular Eminence, Rehana Khan

Loma Linda University Electronic Theses, Dissertations & Projects

The purpose of this study was to determine the accuracy of the Newtom 3G™ in determining the angulation of the articular eminence. The benefits of conducting this study were to provide additional uses for the standard records that are taken for the purposes of orthodontic treatment, as well as evaluate the Newtom 3G™ for accuracy in measuring the anatomy of the glenoid fossa. This study required 20 participants that volunteered to allow their records to be used. Records evaluated were the Newtom 3G™, impressions, and wax check bite registrations. The wax record was taken using the 'forced bite' technique to …

Structural And Stratigraphic Investigations Of The Bays Mountain Synclinorium, Parrottsville And A Portion Of Cedar Creek 7.5-Minute Quadrangles, East Tennessee, Neil E. Whitmer

Masters Theses

The southern Valley and Ridge foreland fold-thrust belt is comprised of a wedge of Lower Cambrian through Pennsylvanian sedimentary rocks that were folded and faulted during the late stages of the Alleghanian orogeny. Within one of the eastern thrust sheets lies the Bays Mountain synclinorium. Rocks as young as Middle Ordovician are preserved in the core of the synclinorium and record the evolution of a Taconian (Blountian) Sevier tectonic basin.

The Parrottsville and Cedar Creek 7.5-minute quadrangles are located on the southeastern flank of the Bays Mountain synclinorium of East Tennessee and contain rocks belonging to the Conasauga, Knox, and …

The Development Of Computational Tools For Halo Analysis And Study Of Halo Growth In The Spallation Neutron Source Linear Accelerator, Dirk A. Bartkoski

Masters Theses

The Spallation Neutron Source (SNS), being built at the Oak Ridge National Laboratory, utilizes a high intensity particle accelerator for neutron production. One of the challenges in SNS, as with all high intensity accelerators, is to minimize the amount of beam lost. High beam losses can cause costly damage and lead to residual activation of accelerator components, which complicates routine maintenance.

One of the key components in beam loss at SNS is the development and propagation of beam halo. Halo particles are those driven to large amplitudes by space charge forces between the beam particles or by mismatch between the …

Universal Geometric Camera Calibration With Statistical Model Selection, Chistopher Paul Broaddus

Masters Theses

We propose a new universal camera calibration approach that uses statistical information criteria for automatic camera model selection. It requires the camera to observe a planar pattern from different positions, and then closed-form estimates for the intrinsic and extrinsic parameters are computed followed by nonlinear optimization. In lieu of modeling radial distortion, the lens projection of the camera is modeled, and in addition we include decentering distortion. This approach is particularly advantageous for wide angle (fisheye) camera calibration because it often reduces the complexity of the model compared to modeling radial distortion. We then apply statistical information criteria to automatically …