Computer Sciences Commons^™

A Scene Similarity Metric For Matching Configurations Of Image Objects, James Carswell

Articles

This paper proposes a novel solution to querying image databases by matching raster features to imagery completely in the raster/spatial domain using the shape of single features together with their spatial relations as the matching primitives. The core feature-based matching module combines a revised least-squares matching algorithm, to accomplish the matching process on binary images, with a unique implementation of a feature library that organizes and links query objects with their images in the database, thus enabling fast and efficient real-time retrieval of relevant imagery. The purpose is to extend this previous work of ours, which matches on the shape …

Complete Randomized Cutting Plane Algorithms For Propositional Satisfiability, Stephen Lee Hansen

CCAC Theses and Dissertations

The propositional satisfiability problem (SAT) is a fundamental problem in computer science and combinatorial optimization. A considerable number of prior researchers have investigated SAT, and much is already known concerning limitations of known algorithms for SAT. In particular, some necessary conditions are known, such that any algorithm not meeting those conditions cannot be efficient. This paper reports a research to develop and test a new algorithm that meets the currently known necessary conditions.

In chapter three, we give a new characterization of the convex integer hull of SAT, and two new algorithms for finding strong cutting planes. We also show …

State Government Cost Recovery For Electronic Information Dissemination: A Comparative Study, Donald R. Wismer

CCAC Theses and Dissertations

Prior to this study, no paradigm common among state governments regarding public policy principles on cost recovery for the dissemination of public information had been described. The study revealed that U.S. federal government policy has served as a model from which a majority of the states have proceeded. This study has compared the states with the federal government and with themselves to determine the policy boundaries. Themes from in the literature were presented and summarized, and measurable elements were isolated. Data from statutory, regulatory, and case law, and from explicit policy statements, were gathered and compared within graphical formats. A …

The Feasibility Of Developing A Computer Based Expert System To Mitigate Nuclear Power Plant Accidents, Jesse E. Smith

CCAC Theses and Dissertations

This study investigated the feasibility of developing a rule-based expert system to support nuclear plant operators in the mitigation of accidents. Human error in the use of Emergency Operating Procedures (EOPs) was the problem to be addressed. The goal was to determine if the Nuclear Plant Information System (NPIS) at one specific power plant would support development of an EOP operator aid to reduce the number of human errors.

A review of the literature confirmed that human error is a recurring problem. This is particularly evident during high stress situations, such as accidents. A rule-based operator aid can reduce human …

A Model For Transforming Legacy Systems In A Client/Server Environment Based On The Unified Modeling Language(Uml), Leon Stevens

CCAC Theses and Dissertations

In this dissertation the researcher developed the methodology for the migration of computer programs from a legacy architecture to client/server architecture. System migrations have failed frequently, and even so-called successful migrations may have serious usability problems. Additional difficulties include missing documentation of the existing program(s), the persons who developed the existing system are not available for consultation, and, frequently, there are important operational and economic issues that must be considered. The client/server environment is quite different from the source environment; the operating system and implementation languages have changed, and system requirements may have been greatly expanded, frequently including the Internet. …

Implementing A Virtual Reality Paradigm In Human Anatomy/Physiology College Curricula, Helen St. Aubin

CCAC Theses and Dissertations

Modes of instruction in the college course called Human Anatomy/Physiology are changing. Due to ethical concerns and the ever-increasing source of new physiological data, there is a need for enhancements to assist the instructor and student. The computer science of virtual reality (VR) provides a method to electronically educate, train, prototype, and test and evaluate new enhancements to the college curricula. This study detailed the modeling and simulation of a skeletal human hand with degrees of freedom of movement, which provided the students with a physiological representation of some of the movements of the hand. The primary objectives of the …

Lime: A Middleware For Physical And Logical Mobility, Gian Pietro Picco, Amy L. Murphy, Gruia-Catalin Roman

All Computer Science and Engineering Research

LIME is a middleware supporting the development of applications that exhibit physical mobility of hosts, logical mobility of agents, or both. LIME adopts a coordination perspective inspired by work on the Linda model. The context for computation, represented in Linda by a globally accessible, persistent tuple space, is represented in LIME by transient sharing of the tuple spaces carried by each individual mobile unit. Linda tuple spaces are also extended with a notion of location and with the ability to react to a given state. The hypothesis underlying our work is that the resulting model provides a minimalist set of …

A Rate-Based End-To-End Multicast Congestion Control Protocol, Sherlia Shi, Marcel Waldvogel

All Computer Science and Engineering Research

Current reliable multicast protocols do not have scalable congestion control mechanisms and this deficiency leads to concerns that multicast deployment may endanger stability of the network. In this paper, we present a sender-based approach for multicast congestion control targeted towards reliable bulk data transfer. We assume that there are a few bottleneck links in a large scale multicast group at any time period and these bottlenecks persist long enough to be identified and adapted to. Our work focus on dynamically identifying the worst congested path in the multicast tree and obtaining TCP-friendly throughput on this selected path. We device novel …

On Maintaining Group Membership Data In Ad Hoc Networks, Gruia-Catalin Roman, Qingfeng Huang, Ali Hazemi

All Computer Science and Engineering Research

The design of ad hoc mobile applications often requires the availability of a consistent view of the application state among the participating hosts. Essential to constructing a consistent view is the ability to know what hosts are within proximity of each other, i.e., form a group in support of the particular application. In this paper we propose an algorithm that allows hosts within communication range to maintain a consistent view of the group membership despite movement and frequent disconnections. The novel features of this algorithm are its reliance on location information and a conservative notion of logical connectivity that creates …

Data Archiving With The Srb*, Jinghua Zhou

All Computer Science and Engineering Research

We use the SRB (Storage Request Broker) middleware to design and implement a storage archival system which will be used to archive Neuroscience data. As part of the design process, we developed and used an experimenter's workbench to measure SRB performance. These experiments improved our understanding of both the functionality and the performance of the SRB. This technical report describes the scripts in the experimenter's workbench, the archiving scripts, and performance measurements.

The Design And Performance Of Meta-Programming Mechanisms For Object Request Broker Middleware, Nanbor Wang, Kirthika Parameswaran, Douglass Schmidt

All Computer Science and Engineering Research

Distributed object computing (DOC) middleware shields developers from many tedious and error-prone aspects of programming distribued applications. Without proper support from the middleware, however, it can be hard to evolve distributed applications after they are deployed. Therefore, DOC middleware should support meta-programming mechanisms, such as smart proxies and interceptors, that improve the adaptability of distributed applications by allowing their behavior to be modified without drastically changing existing software. This paper presents three contributions to the study of metaprogramming mechanisms for DOC middleware. First, it illustrates, compares, and contrasts several meta-programming mechanisms from an application developer's perspective. Second, it outlines the …

Synthesizer, A Pattern Language For Designing Digital Modular Synthesis Software, Thomas V. Judkins, Christopher D. Gill

All Computer Science and Engineering Research

Synthesizer is a pattern language for designing digital synthesizers using modular synthesis in software to generate sound. Software developed according to this pattern language emulates the abilities of an analog synthesizer. Modular synthesis is one of the oldest sound synthesis techniques. It was used in the earliest analog synthesizers, like the Moog [1] and ARP [2]. These machines introduced the oscillator-filter-amplifier paradigm, where sound generated by an oscillator is passed through a series of filters and amplifers before being sent to a speaker. These first machines had physical modules through which electrical signals were passed. These modules can be emulated …

Programming Active Networks Using Active Pipes, Ralph Keller, Jeyashankher Ramamirtham, Tilman Wolf, Bernhard Plattner

All Computer Science and Engineering Research

Active networks allow customized processing of data traffic within the network which can be used by applications to improve the quality of their sessions. To simplify development of active applications in a heterogeneous environment, we propose active network pipes as a programming abstraction to specify transmission and processing requirements. We describe a routing algorithm that maps application session requirements onto network resources and determines an optimal route through the network transiting all required processing sites. Additionally, we propose a network software architecture to implement the functionality required to support active pipes.

Student Rights And Responsibilities, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Master Of Science Degree Programs, 2000-2001, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Design Tradeoffs For Embedded Network Processors, Tilman Wolf, Mark Franklin, Edward W. Spitznagel

All Computer Science and Engineering Research

Demands for flexible processing has moved general-purpose processing into the data path of networks. With the development of System-On-a-Chip technology, it is possible to put several processors with memory and I/O components on a single ASIC. We present a model of such a system with a simple performance metric and show how the number of processors and cache sizes can be optimized for a given workload. Based on a telecommunications benchmark we show the results of such an optimization and discuss how specialied hardware and appropriate scheduling can further improve system performance.

Profile-Based Routing: A New Framework For Mpls Traffic Engineering, Subhash Suri, Marcel Waldvogel, Priyank Ramesh Warkhede

All Computer Science and Engineering Research

We present a new algorithm and framework for dynamic routing of bandwidth guaranteed flows. The problem is motivated by the need to dynamically set up bandwidth guaranteed paths in carrier and ISP networks. Traditional routing algorithms such as minimum hop routing or widest path routing do not take advantage of any knowledge about the traffic distribution or ingress-egress pairs, and therefore can often lead to severe network underutilization. Our work is inspired by the recently proposed "minimum interference routing" algorithm (MIRA) of Kodialam and Lakshman, but it improves on their approach in several ways. Our main idea is to use …

Almi: An Application Level Multicast Infrastructure, Dimitrios Pendarakis, Sherlia Shi, Dinesh Verma, Marcel Waldvogel

All Computer Science and Engineering Research

The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems such as reliability, flow and congestion control, security and access control. Motivated by these problems, we have designed and implemented ALMI, an application level group communication middleware, which does not rely on network infrastructure support and thus, allows accelerated deployment and simplified configuration at the cost of a relatively small increase in traffic load. ALMI is tailored toward support of multicast groups of relatively small …

Parallel Fpga Programming Over Backplane Chassis, John Lockwood, Tom Mclaughlin, Tom Chaney, Yuhua Chen, Fred Rosenberger, Alex Chandra, Jon Turner

All Computer Science and Engineering Research

For systems with a large number of FPGAs, where a design is instantiated across multiple FPGAs in a chassis, an efficient mechanism of programming the FPGA devices is needed. The mechanism described herein allows multiple FPGAs to be programmed across a backplane. Only a single configuration PROM is required to store the configuration for the multiple instances of the design. When the system boots, all FPGAs are programmed in parallel. This design is applicable to any system which contains a multiple board system which has instances of identical FPGA implementations distributed across the boards. Signal integrity of signals is considered.

Codeweave: Exploring Fine-Grained Mobility Of Code, Cecilia Mascolo, Gian Pietro Picco, Gruia-Catalin Roman

All Computer Science and Engineering Research

This paper explores the range of constructs and issues facing the designer of mobile code systems which allow for the unit of mobility to be finer-grained than that of execution. Mobile UNITY, a notation and proof logic for mobile computing, provides for this research a clean abstract setting, i.e., unconstrained by compilation and performance considerations traditionally associated with programming language design. Within the context of Mobile UNITY, we take the extreme view that every line of code and every variable declaration is potentially mobile, i.e., it may be duplicated and/or moved from one program contxt to another on the same …

Configuring Sessions In Programmable Networks, Sumi Choi, Jonathan Turner, Tilman Wolf

All Computer Science and Engineering Research

The provision of advanced computational services within networks is rapidly becoming both feasible and economical. We present a general approach to the problem of configuring application sessions that require intermediate processing by showing how the session configuration problem can be transformed to a conventional shortest path problem. We show, through a series of examples, that the method can be applied to a wide variety of different situations.

Multimedia Kuronthogai, Sellappan Mohan

Student Works (2000-2009)

Project Multimedia Kuronthogai is a Final Year Project (Thesis) offered by the Faculty of Computer Science & Information Technology. This project was divided into Thesis I and Thesis II and supervised by my project supervisor Assoc. Prof. Dr. N.Selvanathan. The moderator for this project is Cik Hannyzzura Affal. Kuronthogai is a one of the Tamil anthologies. It contains 401 poems. The theme of these poems is love and the verse are of the five lands (tinais) in appropriate time. Most of the Tamil literatures are in the form of a book. Only few of them are in Multimedia environment. It …

Multi-Phase Discrete Particle Swarm Optimization, Buthainah Sabeeh No'man Al-Kazemi, Chilukuri K. Mohan

Electrical Engineering and Computer Science - All Scholarship

This paper describes a successful adaptation of the Particle Swarm Optimization algorithm to discrete optimization problems. In the proposed algorithm, particles cycle through multiple phases with differing goals. We also exploit hill climbing. On benchmark problems, this algorithm outperforms a genetic algorithm and a previous discrete PSO formulation.

Imprecise Answers In Distributed Environments: Estimation Of Information Loss For Multi-Ontology Based Query Processing, Eduardo Mena, Vipul Kashyap, Arantza Illarramendi, Amit P. Sheth

Kno.e.sis Publications

The World Wide Web is fast becoming a ubiquitous computing environment. Prevalent keyword-based search techniques are scalable, but are incapable of accessing information based on concepts. We investigate the use of concepts from multiple, real-world pre-existing, domain ontologies to describe the underlying data content and support information access at a higher level of abstraction. It is not practical to have a single domain ontology to describe the vast amounts of data on the Web. In fact, we expect multiple ontologies to be used as different world views and present an approach to "browse" ontologies as a paradigm for information access. …

Optimization Techniques For Data Intensive Decision Flows, Richard Hull, Francois Llirbat, Bharat Kumar, Gang Zhou, Guozhu Dong, Jianwen Su

Kno.e.sis Publications

For an enterprise to take advantage of the opportunities afforded by electronic commerce it must be able to make decisions about business transactions in near-real-time. In the coming era of segment-of-one marketing, these decisions will be quite intricate, so that customer treatments can be highly personalized, reflecting customer preferences, the customer's history with the enterprise, and targeted business objectives. This paper describes a paradigm called “decision flows” for specifying a form of incremental decision-making that can combine diverse business factors in near-real-time.

This paper introduces and empirically analyzes a variety of optimization strategies for decision flows that are “data-intensive”, i.e. …

View-Centric Reasoning About Parallel And Distributed Computation, Marc L. Smith

Retrospective Theses and Dissertations

The development of distributed applications has not progressed as rapidly as its enabling technologies. In part, this is due to the difficulty of reasoning about such complex systems. In contrast to sequential systems, parallel systems give rise to parallel events, and the resulting uncertainty of the observed order of these events. Loosely coupled distributed systems complicate this even further by introducing the element of multiple imperfect observers of these parallel events. The goal of this dissertation is to advance parallel and distributed systems development by producing a parameterized model that can be instantiated to reflect the computation and coordination properties …

Computational Finance Models, Michael Gene Hilgers

Business and Information Technology Faculty Research & Creative Works

The author discusses his involvement in developing computational finance software. These computational finance models attempt to model the randomness of a stock's price. At a fixed future time, a stock's price is modeled as a random variable with a normal distribution centered about the current price adjusted with a simple growth multiplier. The standard deviation of this normal distribution depends on the length of time into the future one peers and the volatility of the market. As the market becomes more volatile and we look further ahead, the less likely the stock will have a price near the adjusted current …

Fages' Theorem And Answer Set Programming, Yuliya Lierler, Esta Erdem, Vladimir Lifschitz

Computer Science Faculty Proceedings & Presentations

We generalize a theorem by François Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negotiation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as SMODELS and DLV is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelä is discussed as an example.

Census 2000 Demographic And Housing Profile Reports, Mark Salling, Ellen Cyran, Sharon Bliss

All Maxine Goodman Levin School of Urban Affairs Publications

No abstract provided.

A Novel Application Development Environment For Large-Scale Scientific Computations, Alok Choudhary, Mahmut Kandemir, Wei-Keng Liao, G Memik, S More, X Shen, A Singh, George K. Thiruvathukal

Computer Science: Faculty Publications and Other Works

A paper describing a novel application development environment for working with large-scale scientific data sets.