Physical Sciences and Mathematics Commons^™

Differential Elastic Image Registration, Senthil Periaswamy, Hany Farid

Computer Science Technical Reports

We have applied techniques from differential motion estimation to the problem of automatic elastic registration of medical images. This method models the mapping between images as a locally affine but globally smooth warp. The mapping also explicitly accounts for variations in image intensities. This approach is simple and highly effective across a broad range of medical images. We show the efficacy of this approach on several synthetic and clinical images.

Intelligent Grouping Of Tcp Flows For Coordinated Congestion Management, Hoi Chang, Rajeev Gopalakrishna, Venkatesh Prabhakar

Department of Computer Science Technical Reports

No abstract provided.

Dynamics Of The "Pgmcc" Multicast Congestion Control Protocol, Chin-Ying Wang, Sonia Fahmy

Department of Computer Science Technical Reports

No abstract provided.

Tcp Congestion Control: Overview And Survey Of Ongoing Research, Sonia Fahmy, Tapan Prem Karwa

Department of Computer Science Technical Reports

No abstract provided.

The Impact Of Test Suite Granularity On The Costeffectiveness Of Regression Testing, Gregg Rothermel, Sebastian Elbaum, Alexey Malishevsky, Praveen Kallakuri, Brian Davia

CSE Technical Reports

Regression testing is an expensive testing process used to validate software following modifications. The cost-effectiveness of regression testing techniques varies with characteristics of test suites. One such characteristic, test suite granularity, involves the way in which test inputs are grouped into test cases within a test suite. Various cost-benefits tradeoffs have been attributed to choices of test suite granularity, but almost no research has formally examined these tradeoffs. To address this lack, we conducted several controlled experiments, examining the effects of test suite granularity on the costs and benefits of several controlled experiments, examining the effects of test suite granularity …

Online Bayesian Tree-Structured Transformation Of Hmms With Optimal Model Selection For Speaker Adaptation, Shaojun Wang, Yunxin Zhao

Kno.e.sis Publications

This paper presents a new recursive Bayesian learning approach for transformation parameter estimation in speaker adaptation. Our goal is to incrementally transform or adapt a set of hidden Markov model (HMM) parameters for a new speaker and gain large performance improvement from a small amount of adaptation data. By constructing a clustering tree of HMM Gaussian mixture components, the linear regression (LR) or affine transformation parameters for HMM Gaussian mixture components are dynamically searched. An online Bayesian learning technique is proposed for recursive maximum a posteriori (MAP) estimation of LR and affine transformation parameters. This technique has the advantages of …

Vide: A Visual Data Extraction Environment For The Web, Yi Li, Wee-Keong Ng, Ee Peng Lim

Research Collection School Of Computing and Information Systems

With the rapid growth of information on the Web, a means to combat information overload is critical. In this paper, we present ViDE (Visual Data Extraction), an interactive web data extraction environment that supports efficient hierarchical data wrapping of multiple web pages. ViDE has two unique features that differentiate it from other extraction mechanisms. First, data extraction rules can be easily specified in a graphical user interface that is seamlessly integrated with a web browser. Second, ViDE introduces the concept of grouping which unites the extraction rules for a set of documents with the navigational patterns that exist among them. …

Progressive Transmission Of Spatial Data Over The Www: Challenges, James Carswell

Conference papers

Progressive transmission of raster images over the WWW has been successfully applied to provide users with coarser versions of the data before downloading a complete image. In the vector domain, progressive transmission remains a challenging topic. Increasing the level of detail of a vector dataset is a complex process that does not simply imply adding pixels to it. In this paper we present a survey of existing models for progressive transmission of spatial data and discuss open problems and challenges related to the progressive transmission of geographic maps in vector format. Finally, we propose a model based on a client-server …

A Transaction Model To Improve Data Availability In Mobile Computing, Sanjay Kumar Madria, Bharat Bhargava

Computer Science Faculty Research & Creative Works

We incorporate a prewrite operation before a write operation in a mobile transaction to improve data availability. A prewrite operation does not update the state of a data object but only makes visible the future value that the data object will have after the final commit of the transaction. Once a transaction reads all the values and declares all the prewrites, it can pre-commit at mobile host (MH) (computer connected to unreliable mobile communication network). The remaining transaction's execution (writes on database) is shifted to the mobile service station (MSS) (computer connected to the reliable fixed network). Writes on database …

Detecting Steganographic Messages In Digital Images, Hany Farid

Computer Science Technical Reports

Techniques and applications for information hiding have become increasingly more sophisticated and widespread. With high-resolution digital images as carriers, detecting the presence of hidden messages has also become considerably more difficult. It is sometimes possible, nevertheless, to detect (but not necessarily decipher) the presence of embedded messages. The basic approach taken here works by finding predictable higher-order statistics of ``natural'' images within a multi-scale decomposition, and then showing that embedded messages alter these statistics.

Improving Cluster Utilization Through Set Based Allocation Policies, Quinn O. Snell, Julio C. Facelli, Brian D. Haymore, David B. Jackson

Faculty Publications

While clusters have already proven themselves in the world of high performance computing, some clusters are beginning to exhibit resource inefficiencies due to increasing hardware diversity. Much of the success of clusters lies in the use of commodity components built to meet various hardware standards. These standards have allowed a great level of hardware backwards compatibility that is now resulting in a condition referred to as hardware 'drift' or heterogeneity. The hardware heterogeneity introduces problems when diverse compute nodes are allocated to a parallel job, as most parallel jobs are not self-balancing. This paper presents a new method that allows …

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 …

Exploiting Image Indexing Techniques In Dct Domain, Chong-Wah Ngo, Ting-Chuen Pong, Ronald T. Chin

Research Collection School Of Computing and Information Systems

This paper is concerned with the indexing and retrieval of images based on features extracted directly from the JPEG discrete cosine transform (DCT) domain. We examine possible ways of manipulating DCT coefficients by standard image analysis approaches to describe image shape, texture, and color. Through the Mandala transformation, our approach groups a subset of DCT coefficients to form ten blocks. Each block represents a particular frequency content of the original image. Two blocks are used to model rough object shape; nine blocks to describe subband properties; and one block to compute color distribution. As a result, the amount of data …

Computationally Efficient Search For Large Primes, Wieslawa E. Amber

Theses

To satisfy the speed of communication and to meet the demand for the continuously larger prime numbers, the primality testing and prime numbers generating algorithms require continuous advancement. To find the most efficient algorithm, a need for a survey of methods arises. Concurrently, an urge for the analysis of algorithms' performances emanates. The critical criteria in the analysis of the prime numbers generation are the number of probes, number of generated primes, and an average time required in producing one prime. Hence, the purpose of this thesis is to indicate the best performing algorithm. The survey the methods, establishment of …

Oral History Interview With Glenn Henry, Philip L. Frana

Philip L Frana

Glenn Henry begins by briefly outlining his education and early work career prior to joining IBM. The majority of the interview focuses on Henry's work as a software systems engineer and manager at IBM in the 1970s. Henry was centrally involved in the software development and hardware definitions for IBM's early Midrange Series computers. He had managerial roles at IBM San Jose and IBM Boca Raton before leading a large team at the home of IBM Midrange Series hardware and software development, IBM Rochester. He details the ...

Hyper-Polynomial Hierarchies And The Polynomial Jump, Stephen Fenner, Steven Homer, Randall J. Pruim, Marcus Schaefer

University Faculty Publications and Creative Works

Assuming that the polynomial hierarchy (PH) does not collapse, we show the existence of ascending sequences of ptime Turing degrees of length ω1/CK in PSPACE such that successors are polynomial jumps of their predecessors. Moreover these ptime degrees are all uniformly hard for PH. This is analogous to the hyperarithmetic hierarchy, which is defined similarly but with the (computable) Turing degrees. The lack of uniform least upper bounds for ascending sequences of ptime degrees causes the limit levels of our hyper-polynomial hierarchy to be inherently non-canonical. This problem is investigated in depth, and various possible structures for hyper-polynomial hierarchies are …

Electronic Commerce Application Development: A Comparison Of User And It Professional Perspectives, Douglas Havelka, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Proceedings & Presentations

Based on the theory of reasoned action and previous research identifying differences in beliefs between IS specialists and IS users, this paper outlines a proposed study to investigate differences/similarities in beliefs of users and developers in the context of electronic commerce application development projects. The authors are currently in the process of collecting data to address research question posed in this proposal.

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.

Autoconfiguration, Registration And Mobility Management For Pervasive Computing, Archan Misra, Subir Das, Anthony Mcauley, Sajal K. Das

Research Collection School Of Computing and Information Systems

In the vision of pervasive computing, users will exchange information and control their environments from anywhere using various wireline/wireless networks and computing devices. We believe that current protocols, such as DHCP, PPP, and Mobile IP, must be enhanced to support pervasive network access. In particular, this article identifies three fundamental functions: autoconfiguration, registration, and mobility management, that need such enhancements. Realizing that the IP autoconfiguration capabilities must be extended to configure routers and large dynamic networks, we first describe our autoconfiguration solution based on the dynamic configuration and distribution protocol (DCDP). Second, we discuss why providing user-specific services over a …

Generating Market Basket Data With Temporal Information, Yingjiu Li, Peng Ning, X. Sean Wang, Sushil Jajodia

Research Collection School Of Computing and Information Systems

This paper presents a synthetic data generator that outputs timestamped transactional data with embedded temporal patterns controlled by a set of input parameters. In particular, calendar schema, which is determined by a hierarchy of input time granularities, is used as a framework of possible temporal patterns. An example of calendar schema is (year, month, day), which provides a framework for calendar-based temporal patterns of the form -38352 , where each is either an integer or the symbol . For example, is such a pattern, which corresponds to the time intervals consisting of all the 16th days of all months in …

Using Software Engineering Metrics In Ap Modularization., Kwaku Owusu-Tieku

Electronic Theses and Dissertations

Significant amount of work has been done in software engineering in terms of reuse. With the use of object-orientation and design patterns that support the development of reusable modules, it appears that the development and reuse of software modules in creating new systems is becoming more and more common. The software engineering world, however has taken reuse more seriously than database; more research and improvement in reuse has been made in software engineering than in database. This paper investigates how software engineering metrics can be applied in the development of reusable database modules. This research provides a model for predicting …

Massive Data Processing On The Acxiom Cluster Testbed, Amy Apon, Pawel Wolinski, Dennis Reed, Greg Amerson, Prathima Gorjala

Presentations

No abstract provided.

A Method For Fast Revocation Of Public Key Certificates And Security Capabilities, D. Boneh, Xuhua Ding, Gene Tsudik, Chi Ming Wong

Research Collection School Of Computing and Information Systems

We present a new approach to fast certificate revocation centered around the concept of an on-line semi-trusted mediator (SEM). The use of a SEM in conjunction with a simple threshold variant of the RSA cryptosystem (mediated RSA) offers a number of practical advantages over current revocation techniques. Our approach simplifies validation of digital signatures and enables certificate revocation within legacy systems. It also provides immediate revocation of all security capabilities. This paper discusses both the architecture and implementation of our approach as well as performance and compatibility with the existing infrastructure. Our results show that threshold cryptography is practical for …

A Multi-Agent Framework For Supporting Intelligent Fourth-Party Logistics, Hoong Chuin Lau, G. Lo

Research Collection School Of Computing and Information Systems

A distributed intelligent agent-based framework that supports fourth-party logistics optimization under a web-based e-Commerce environment has been proposed in this paper. In the framework, customer job requests come through an e-Procurement service. These requests are consolidated and pushed to the e-Market Place service periodically. The e-Market Place then serves as a broker that allows intelligent agents to bid to serve these requests optimally in real-time by solving multiple instances of underlying logistics optimization problem. The resulting system was implemented based on the Java 2 Enterprise Edition (J2EE) platform using distributed system technology for communication between objects.

Visual Iconic Object-Oriented Programming To Advance Computer Science Education And Novice Programming, Nancy Silva Martinez

Theses and Dissertations - UTB/UTPA

Learning how to program a computer is difficult for most people. Computer programming is a cognitively challenging, time consuming, labor intensive, and frustrating endeavor. Years of formal study and training are required to learn a programming language's world of algorithms and data structures. Instructions are coded in advance before the computer demonstrates the desired behavior. Seeing all the programming steps and instruction code is complicated. There exists a tremendous gap between the representations the human brain uses when thinking about a problem and the representations used in programming a computer. Often people are much better at dealing with specific, concrete …

A Theoretical Study Of The Interactive Communication Process In Video Game Playing: A Symbolic Interactionist Approach, Nevsal Tiryakioglu

Masters Theses & Specialist Projects

Video games have become the most popular leisure activity among children and adolescents. The increasing popularity of video games has urged researchers to determine the effects of video game playing on youngsters. Given the fact that most popular video games are violent in nature, much of the research has primarily focused on the correlation between playing video games with violent content and aggressive behavior in children. Most researchers have relied on previous media violence research, assuming similarities between television viewing and video game playing. However, video games are interactive media allowing the player to participate in the game scenario, which …

Livelock Avoidance For Meta-Schedulers, Mark J. Clement, John Jardine, Quinn O. Snell

Faculty Publications

Meta-scheduling, a process which allows a user to schedule a job across multiple sites, has a potential for livelock. Current systems avoid livelock by locking down resources at multiple sites and allowing a metascheduler to control the resources during the lock down period or by limiting job size to that which will fit on one site. The former approach leads to poor utilization; the later poses limitations on job size. This research uses BYU's Meta-scheduler (YMS) which allows jobs to be scheduled across multiple sites without the need for locking down the nodes. YMS avoids livelock through exponential back-off This …

Video Partitioning By Temporal Slice Coherency, Chong-Wah Ngo, Ting-Chuen Pong, Roland T. Chin

Research Collection School Of Computing and Information Systems

We present a novel approach for video partitioning by detecting three essential types of camera breaks, namely cuts, wipes, and dissolves. The approach is based on the analysis of temporal slices which are extracted from the video by slicing through the sequence of video frames and collecting temporal signatures. Each of these slices contains both spatial and temporal information from which coherent regions are indicative of uninterrupted video partitions separated by camera breaks. Properties could further be extracted from the slice for both the detection and classification of camera breaks. For example, cut and wipes are detected by color-texture properties, …

Adaptive Simulated Annealing: An Alternative Approach For The Error Minimization Of Neural Networks, Yuxing Sun

Masters Theses

This work introduces an alternative algorithm, simulated annealing, to minimize the prediction error from neural networks that traditionally use back-propagation methods. The simulated annealing algorithm stochastically samples the parameter space formed by weights of the neural network until a minimal error is found.

Three problems were investigated in this work: the radiator problem, the spiral problem, and the time series prediction problem. Each of them was examined using the same neural network architecture, i.e., a 2-layer network, and trained by both back-propagation and simulated annealing.

The simulated annealing algorithm consumes longer computation time in searching for the global minimum than …

Analysis Of A New Vehicle Scheduling And Location Problem, Ebru K. Bish, Thin Yin Leong, Chun-Lun Li, Jonathan W. C. Ng, David Simchi-Levi

Research Collection School Of Computing and Information Systems

We consider a container terminal discharging containers from a ship and locating them in the terminal yard. Each container has a number of potential locations in the yard where it can be stored. Containers are moved from the ship to the yard using a fleet of vehicles, each of which can carry one container at a time. The problem is to assign each container to a yard location and dispatch vehicles to the containers so as to minimize the time it takes to download all the containers from the ship. We show that the problem is NP-hard and develop a …