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

Theory and Algorithms Commons™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 1981 - 2010 of 2159

Full-Text Articles in Theory and Algorithms

A Performance Analysis Of Distributed Algorithms In Javaspaces, Corba Services And Web Services, Suresh Sunku Jan 2003

A Performance Analysis Of Distributed Algorithms In Javaspaces, Corba Services And Web Services, Suresh Sunku

UNF Graduate Theses and Dissertations

Implementation of distributed parallel algorithms on networked computers has always been very difficult until the introduction of service-oriented architectures (SOA) like JavaSpaces service, CORBA services and Web Services. Algorithms of the type Master/Worker pattern are implemented with relative ease using the SOAs. This project analyzes the performance of such algorithms on three contemporary SOAs namely JavaSpaces service, CORBA services and Web Services. These architectures make the implementations of distributed algorithms reasonably fault tolerant and highly and dynamically scalable. Also, the systems built on these architectures are generally loosely coupled and operate asynchronously.

In this project we measure and analyze the …


Qr Factorization With Morton-Ordered Quadtree Matrices For Memory Re-Use And Parallelism, Jeremy D. Frens, David S. Wise Jan 2003

Qr Factorization With Morton-Ordered Quadtree Matrices For Memory Re-Use And Parallelism, Jeremy D. Frens, David S. Wise

University Faculty Publications and Creative Works

Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this blocking results in code that honors the memory hierarchy without the need for transforming the code. Furthermore, the divide-and-conquer algorithm breaks problems down into independent computations. These independent computations can be dispatched in parallel for straight-forward parallel processing. Proof-of-concept is given by an algorithm for QR factorization based on Givens rotations for quadtree matrices in Morton-order storage. The algorithms deliver positive results, competing with and even beating the LAPACK equivalent.


Active Processor Scheduling Using Evolution Algorithms, David J. Caswell Dec 2002

Active Processor Scheduling Using Evolution Algorithms, David J. Caswell

Theses and Dissertations

The allocation of processes to processors has long been of interest to engineers. The processor allocation problem considered here assigns multiple applications onto a computing system. With this algorithm researchers could more efficiently examine real-time sensor data like that used by United States Air Force digital signal processing efforts or real-time aerosol hazard detection as examined by the Department of Homeland Security. Different choices for the design of a load balancing algorithm are examined in both the problem and algorithm domains. Evolutionary algorithms are used to find near-optimal solutions. These algorithms incorporate multiobjective coevolutionary and parallel principles to create an …


Mining Of Correlated Rules In Genome Sequences, L. Lin, L. Wong, Tze-Yun Leong, P. S. Lai Nov 2002

Mining Of Correlated Rules In Genome Sequences, L. Lin, L. Wong, Tze-Yun Leong, P. S. Lai

Research Collection School Of Computing and Information Systems

With the huge amount of data collected by scientists in the molecular genetics community in recent years, there exists a need to develop some novel algorithms based on existing data mining techniques to discover useful information from genome databases. We propose an algorithm that integrates the statistical method, association rule mining, and classification rule mining in the discovery of allelic combinations of genes that are peculiar to certain phenotypes of diseased patients.


Yet Another Algorithm For Pitch Tracking (Yaapt), Kavita Kasi Oct 2002

Yet Another Algorithm For Pitch Tracking (Yaapt), Kavita Kasi

Electrical & Computer Engineering Theses & Dissertations

This thesis presents a pitch detection algorithm that is extremely robust for both high quality and telephone speech. The kernel method for this algorithm is the Normalized Cross Correlation (NCCF) reported by David Talkin [16]. Major innovations include: processing of the original acoustic signal and a nonlinearly processed version of the signal to partially restore very weak F0 components; intelligent peak picking to select multiple F0 candidates and assign merit factors; and, incorporation of highly robust pitch contours obtained from smoothed versions of low frequency portions of spectrograms. Dynamic programming is used to find the ''best" pitch track among all …


Study Of Transport Properties Of Inas Using Monte Carlo Simulation, Satyanadh Gundimada Oct 2002

Study Of Transport Properties Of Inas Using Monte Carlo Simulation, Satyanadh Gundimada

Electrical & Computer Engineering Theses & Dissertations

The present research is aimed at ascertaining the usefulness of InAs semiconductor material for single photon avalanche photo detectors operating in the Geiger mode at 2 μm wavelengths. InAs is considered as the material suitable for the purpose because of its less bandgap and lower effective mass of the electrons when compared to other semiconductor materials presently in use. Hence, theoretically transient transport properties of bulk InAs are superior and the velocity overshoot phenomena stronger. InAs is a relatively less explored material when compared to other materials like GaAs. The choice of the material is justified with thorough exploration of …


On The Area Of Hypercube Layouts, Ronald I. Greenberg, Lee Guan Sep 2002

On The Area Of Hypercube Layouts, Ronald I. Greenberg, Lee Guan

Computer Science: Faculty Publications and Other Works

This paper precisely analyzes the wire density and required area in standard styles for the hypercube. It shows that the most natural, regular layout of a hypercube of N^2 nodes in the plane, in a NxN grid arrangement, uses floor(2N/3)+1 horizontal wiring tracks for each row of nodes. (In the process, we see that the number of tracks per row can be reduced by 1 with a less regular design, as can also be seen from an independent argument of Bezrukov et al.) This paper also gives a simple formula for the wire density at any cut position and a …


Warcraft Iii - Maps & Benchmark Problems, Nathan R. Sturtevant, Blizzard Corp. Jul 2002

Warcraft Iii - Maps & Benchmark Problems, Nathan R. Sturtevant, Blizzard Corp.

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted from Warcraft III from Blizzard Corp. for use and distribution as benchmark problems.

Contains 36 maps and benchmark problem sets, scaled to 512x512 and converted to a simple grid-based format.


Translation And Rotation Invariant Multiscale Image Registration, Jennifer L. Manfra Mar 2002

Translation And Rotation Invariant Multiscale Image Registration, Jennifer L. Manfra

Theses and Dissertations

The most recent research involved registering images in the presence of translations and rotations using one iteration of the redundant discrete wavelet transform. We extend this work by creating a new multiscale transform to register two images with translation or rotation differences, independent of scale differences between the images. Our two-dimensional multiscale transform uses an innovative combination of lowpass filtering and the continuous wavelet transform to mimic the two-dimensional redundant discrete wavelet transform. This allows us to obtain multiple subbands at various scales while maintaining the desirable properties of the redundant discrete wavelet transform. Whereas the discrete wavelet transform produces …


A Case Tool For Code Inspection, Siti Hajar Alias Jan 2002

A Case Tool For Code Inspection, Siti Hajar Alias

Student Works (2000-2009)

Generally, quality and productivity play important roles in every software development life cycle. However, when discussing about quality and productivity, another function that synonym to distinguish these features is software inspection. Software inspection is generally accepted as a useful technique for finding errors in both documents and codes. There are several phases in software inspection and one of it is defect detection phase. This dissertation is to review the role of defect detection phases involved in the software inspection process. Thus, for this project, it focuses on the development of a prototype CASE tool for code inspection called CodeIns. CodeIns …


An Analysis Of A Private-Key Cryptosystem, Wei-Wey Tan Jan 2002

An Analysis Of A Private-Key Cryptosystem, Wei-Wey Tan

Student Works (2000-2009)

In this dissertation, we have presented a new block cipher. The proposed block cipher is a Substitution-Permutation network cryptosystem with a block length of 128 bits and key length of 256 bits. With the increased key length and block size, the proposed block cipher has greater security over DES. A modular design approach was applied. The cipher has three major building blocks and their interaction has been carefully chosen to achieve better security and performance. Algorithmic S­-Boxes are used to provide confusion and nonlinearity in the cipher. The proposed cipher uses a highly diffusive diffusion layer, which is a combination …


Night Out Itinerary Creator, Jennifer Hood Dec 2001

Night Out Itinerary Creator, Jennifer Hood

Honors Capstone Projects and Theses

No abstract provided.


Modeling And Simulation Of Steady State And Transient Behaviors For Emergent Socs, Joann M. Paul, Arne Suppe, Donald E. Thomas Oct 2001

Modeling And Simulation Of Steady State And Transient Behaviors For Emergent Socs, Joann M. Paul, Arne Suppe, Donald E. Thomas

Research Collection School Of Computing and Information Systems

We introduce a formal basis for viewing computer systems as mixed steady state and non-steady state (transient) behaviors to motivate novel design strategies resulting from simultaneous consideration of function, scheduling and architecture. We relate three design styles: Hierarchical decomposition, static mapping and directed platform that have traditionally been separate. By considering them together, we reason that once a steady state system is mapped to an architecture, the unused processing and communication power may be viewed as a platform for a transient system, ultimately resulting in more effective design approaches that ease the static mapping problem while still allowing for effective …


Nonparametric Techniques To Extract Fuzzy Rules For Breast Cancer Diagnosis Problem, Manish Sarkar, Tze-Yun Leong Sep 2001

Nonparametric Techniques To Extract Fuzzy Rules For Breast Cancer Diagnosis Problem, Manish Sarkar, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

This paper addresses breast cancer diagnosis problem as a pattern classification problem. Specifically, the problem is studied using Wisconsin-Madison breast cancer data set. Fuzzy rules are generated from the input-output relationship so that the diagnosis becomes easier and transparent for both patients and physicians. For each class, at least one training pattern is chosen as the prototype, provided (a) the maximum membership of the training pattern is in the given class, and (b) among all the training patterns, the neighborhood of this training pattern has the least fuzzy-rough uncertainty in the given class. Using the fuzzy-rough uncertainty, a cluster is …


Real-Time Travel Time Estimation Using Macroscopic Traffic Flow Models, Pushkin Kachroo, Kaan Ozbay, Antoine G. Hobeika Aug 2001

Real-Time Travel Time Estimation Using Macroscopic Traffic Flow Models, Pushkin Kachroo, Kaan Ozbay, Antoine G. Hobeika

Electrical & Computer Engineering Faculty Research

This paper presents the estimation of travel time on highways based on macroscopic modelling. The focus is on real-time values as compared to average or static values. The macroscopic models are used for distributed and time/space lumped settings and corresponding travel time estimation functions and algorithms are developed. The implications of these algorithms for the implementation of various incident management and traffic control strategies are also discussed.


Minimum Mean Square Error Spectral Peak Envelope Estimation For Automatic Vowel Classification, Jaishree Venugopal Jul 2001

Minimum Mean Square Error Spectral Peak Envelope Estimation For Automatic Vowel Classification, Jaishree Venugopal

Electrical & Computer Engineering Theses & Dissertations

Spectral feature computations continue to be a very difficult problem for accurate machine recognition of speech. In this work, which focuses on vowels, a new spectral peak envelope method for vowel classification is developed, based on a missing frequency components model of speech recognition. According to the missing frequency components model, vowel recognition depends only on the spectral (harmonic) peaks. Smoothing and interpolation of the spectra, performed in the standard cepstral analysis method commonly used in automatic speech recognition, actually loses valuable information and results in reduced recognition accuracy. The new method for feature extraction presented in this thesis is …


Approximation Techniques For Average Completion Time Scheduling, Chandra Chekuri, Rajeev Motwani, Balas Natarajan, Clifford Stein Jun 2001

Approximation Techniques For Average Completion Time Scheduling, Chandra Chekuri, Rajeev Motwani, Balas Natarajan, Clifford Stein

Dartmouth Scholarship

We consider the problem of nonpreemptive scheduling to minimize average ( weighted) completion time, allowing for release dates, parallel machines, and precedence constraints. Recent work has led to constant-factor approximations for this problem based on solving a preemptive or linear programming relaxation and then using the solution to get an ordering on the jobs. We introduce several new techniques which generalize this basic paradigm. We use these ideas to obtain

improved approximation algorithms for one-machine scheduling to minimize average completion time with release dates. In the process, we obtain an optimal randomized on-line algorithm for the same problem that beats …


Genetic Algorithms For Communications Network Design - An Empirical Study Of The Factors That Influence Performance, Hsinghua Chou, G. Premkumar, Chao-Hsien Chu Jun 2001

Genetic Algorithms For Communications Network Design - An Empirical Study Of The Factors That Influence Performance, Hsinghua Chou, G. Premkumar, Chao-Hsien Chu

Research Collection School Of Computing and Information Systems

We explore the use of GAs for solving a network optimization problem, the degree-constrained minimum spanning tree problem. We also examine the impact of encoding, crossover, and mutation on the performance of the GA. A specialized repair heuristic is used to improve performance. An experimental design with 48 cells and ten data points in each cell is used to examine the impact of two encoding methods, three crossover methods, two mutation methods, and four networks of varying node sizes. Two performance measures, solution quality and computation time, are used to evaluate the performance. The results obtained indicate that encoding has …


Traveling Salesman Problem For Surveillance Mission Using Particle Swarm Optimization, Barry R. Secrest Mar 2001

Traveling Salesman Problem For Surveillance Mission Using Particle Swarm Optimization, Barry R. Secrest

Theses and Dissertations

The surveillance mission requires aircraft to fly from a starting point through defended terrain to targets and return to a safe destination (usually the starting point). The process of selecting such a flight path is known as the Mission Route Planning (MRP) Problem and is a three-dimensional, multi-criteria (fuel expenditure, time required, risk taken, priority targeting, goals met, etc.) path search. Planning aircraft routes involves an elaborate search through numerous possibilities, which can severely task the resources of the system being used to compute the routes. Operational systems can take up to a day to arrive at a solution due …


An Objective Evaluation Of Four Sar Image Segmentation Algorithms, Jason B. Gregga Mar 2001

An Objective Evaluation Of Four Sar Image Segmentation Algorithms, Jason B. Gregga

Theses and Dissertations

Because of the large number of SAR images the Air Force generates and the dwindling number of available human analysts, automated methods must be developed. A key step towards automated SAR image analysis is image segmentation. There are many segmentation algorithms, but they have not been tested on a common set of images, and there are no standard test methods. This thesis evaluates four SAR image segmentation algorithms by running them on a common set of data and objectively comparing them to each other and to human segmentors. This objective comparison uses a multi-metric a approach with a set of …


Isolated Ramp Metering Feedback Control Utilizing Mixed Sensitivity For Desired Mainline Density And The Ramp Queues, Pushkin Kachroo, Kaan Ozbay, Donald E. Grove Jan 2001

Isolated Ramp Metering Feedback Control Utilizing Mixed Sensitivity For Desired Mainline Density And The Ramp Queues, Pushkin Kachroo, Kaan Ozbay, Donald E. Grove

Electrical & Computer Engineering Faculty Research

This paper presents a feedback control design for isolated ramp metering control. This feedback control design, unlike the existing isolated feedback ramp controllers, also takes into account the ramp queue length. Using a nonlinear H∞ control design methodology, we formulate the problem in the desired setting to be able to utilize the results of the methodology.


The Partial Evaluation Approach To Information Personalization, Naren Ramakrishnan, Saverio Perugini Jan 2001

The Partial Evaluation Approach To Information Personalization, Naren Ramakrishnan, Saverio Perugini

Computer Science Faculty Publications

Information personalization refers to the automatic adjustment of information content, structure, and presentation tailored to an individual user. By reducing information overload and customizing information access, personalization systems have emerged as an important segment of the Internet economy. This paper presents a systematic modeling methodology— PIPE (‘Personalization is Partial Evaluation’) — for personalization. Personalization systems are designed and implemented in PIPE by modeling an information-seeking interaction in a programmatic representation. The representation supports the description of information-seeking activities as partial information and their subsequent realization by partial evaluation, a technique for specializing programs. We describe the modeling methodology at a …


Searching For A Quantum Algorithm To Solve The Traveling Salesman Problem, Buckley Hopper Jan 2001

Searching For A Quantum Algorithm To Solve The Traveling Salesman Problem, Buckley Hopper

Honors Capstone Projects and Theses

No abstract provided.


A Model To Evaluate The Effect Of Organizational Adaptation, Holly A. H. Handley, Alexander H. Levis Jan 2001

A Model To Evaluate The Effect Of Organizational Adaptation, Holly A. H. Handley, Alexander H. Levis

Engineering Management & Systems Engineering Faculty Publications

When an organization’s output declines due to either internal changes or changes in its external environment, it needs to adapt. In order to evaluate the effectiveness of different adaptation strategies on organizational per- formance, an organizational model composed of individual models of a five stage interacting decision maker was designed using an object oriented design approach and implemented as a Colored Petri net. The concept of entropy is used to calculate the total activity value, a surrogate for decision maker workload, based on the functional partition and the adaptation strategy being implemented. The individual decision maker’s total activity is monitored, …


Video Compression Using Wavelets And Hierarchical Motion Estimation, Andrew Peter Byrne Jan 2001

Video Compression Using Wavelets And Hierarchical Motion Estimation, Andrew Peter Byrne

Theses : Honours

This thesis investigates the benefits and the significant compression that can be obtained from data that has been decomposed using a wavelet transform. A video compression algorithm was developed that employs the wavelet transform and a hierarchical motion estimation algorithm which itself utilises benefits of the wavelet transform. Using MATLAB, a popular software tool for matrix based computation and analysis, several functions were developed which together formed the video compression algorithm. A variety of tests were conducted on a sample video sequence to ascertain the strengths and weaknesses of the techniques employed. The results, although not the same as the …


Entropy Generation Method To Quantify Thermal Comfort, S. C. Boregowda, S. N. Tiwari, S. K. Chaturvedi Jan 2001

Entropy Generation Method To Quantify Thermal Comfort, S. C. Boregowda, S. N. Tiwari, S. K. Chaturvedi

Mechanical & Aerospace Engineering Faculty Publications

The present paper presents a thermodynamic approach to assess the quality of human-thermal environment interaction and quantify thermal comfort. The approach involves development of entropy generation term by applying second law of thermodynamics to the combined human-environment system. The entropy generation term combines both human thermal physiological responses and thermal environmental variables to provide an objective measure of thermal comfort. The original concepts and definitions form the basis for establishing the mathematical relationship between thermal comfort and entropy generation term. As a result of logic and deterministic approach, an Objective Thermal Comfort Index (OTCI) is defined and established as a …


Baldur's Gate Ii - Maps & Benchmark Problems, Nathan R. Sturtevant, Bioware Corp Sep 2000

Baldur's Gate Ii - Maps & Benchmark Problems, Nathan R. Sturtevant, Bioware Corp

Moving AI Lab: 2D Maps and Benchmark Problems

Maps extracted by Yngvi Björnsson from Baldur's Gate II with explicit permission from BioWare Corp. for use and distribution as benchmark problems.

Contains 75 maps and benchmark problem sets scaled to 512 x 512 and 120 original scale maps.


Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin Sep 2000

Motion-Based Video Representation For Scene Change Detection, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a new ly developed scheme for automatical ly partitioning videos into scenes. A scene is general ly referred to as a group of shots taken place in the same site. In this paper, we first propose a motion annotation algorithm based on the analysis of spatiotemporal image volumes. The algorithm characterizes the motions within shots by extracting and analyzing the motion trajectories encoded in the temporal slices of image volumes. A motion-based keyframe computing and selection strategy is thus proposed to compactly represent the content of shots. With these techniques, we further present a scene change detection algorithm …


Motion Characterization By Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin Jun 2000

Motion Characterization By Temporal Slices Analysis, Chong-Wah Ngo, Ting-Chuen Pong, Hong-Jiang Zhang, Roland T. Chin

Research Collection School Of Computing and Information Systems

This paper describes an approach to characterize camera and object motions based on the analysis of spatio temporal image volumes. In the spatio-temporal slices of image volumes, motion is depicted as oriented patterns. We propose a tensor histogram computation algorithm to represent these oriented patterns. The motion trajectories in a histogram are tracked to describe both the camera and object motions. In addition, we exploit the similarity of the temporal slices in a volume to reliably partition a volume into motion tractable units.


Anytime Algorithms For Maximal Constraint Satisfaction Problems, Noha Kaptan May 2000

Anytime Algorithms For Maximal Constraint Satisfaction Problems, Noha Kaptan

Archived Theses and Dissertations

No abstract provided.