Follow


Reports from 2006

PDF

Three Dimensional Panoramic Fast Flourescence Imaging of Cardiac Arryhtymias in the Rabbit Heart Fujian Qu, Vladimir P. Nikolski, Cindy Grimm, and Igor R. Efimov
Technical Report

Abstract:

Cardiac high spatio-temporal optical mapping provides a unique opportunity to investigate the dynamics of propagating waves of excitation during ventricular arrhythmia and defibrillation. However, studies using single camera imaging systems are hampered by the inability to monitor electrical activity from the entire surface of the heart. We have developed a three dimensional panoramic imaging system which allows high-resolution and high-dynamic-range optical mapping from the entire surface of the heart. Rabbit hearts (n=4) were Langendorff perfused and imaged by the system during sinus rhythm, epicardial pacing, and arrhythmias. The reconstructed 3D ...Read More

PDF

Use of gene expression profiling and machine learning to understand and predict primary graft dysfunction Monika Ray, Sekhar Dharmarajan, Johannes Freudenberg, Weixiong Zhang, and Alexander G. Patterson
Technical Report

Abstract:

PDF

A comprehensive analysis of the effect of microarray data Monika Ray, Johannes Freudenberg, and Weixiong Zhang
Technical Report

Abstract:

Background: Microarray data preprocessing, such as differentially expressed (DE) genes selection, is performed prior to higher level statistical analysis in order to account for technical variability. Preprocessing for the Affymetrix GeneChip includes background correction, normalisation and summarisation. Numerous preprocessing methods have been proposed with little consensus as to which is the most suitable. Furthermore, due to poor concordance among results from cross-platform analyses, protocols are being developed to enable cross-platform reproducibility. However, the effect of data analysis on a single platform is still unknown. The objective of our study is ...Read More

PDF

Tuple Space Coordination Across Space & Time Gruia-Catalin Roman, Radu Handorean, and Chenyang Lu
Technical Report

Abstract:

CAST is a coordination model designed to support interactions among agents executing on hosts that make up a mobile ad hoc network (MANET). From an application programmer’s point of view, CAST makes it possible for operations to be executed at arbitrary locations in space, at prescribed times which may be in the future, and on remote hosts even when no end-to-end connected route exists between the initiator and target(s) of the operation. To accomplish this, CAST assumes that each host moves in space in accordance with a motion profile which ...Read More

PDF

Discovering Functional Modules by Clustering Gene Co-expression Networks Jianhua Ruan and Weixiong Zhang
Technical Report

Abstract:

Identification of groups of functionally related genes from high throughput gene expression data is an important step towards elucidating gene functions at a global scale. Most existing approaches treat gene expression data as points in a metric space, and apply conventional clustering algorithms to identify sets of genes that are close to each other in the metric space. However, they usually ignore the topology of the underlying biological networks. In this paper, we propose a network-based clustering method that is biologically more realistic. Given a gene expression data set, we ...Read More

PDF

Discovering weak community structures in large biological networks Jianhua Ruan and Weixiong Zhang
Technical Report

Abstract:

Identifying intrinsic structures in large networks is a fundamental problem in many fields, such as biology, engineering and social sciences. Motivated by biology applications, in this paper we are concerned with identifying community structures, which are densely connected sub-graphs, in large biological networks. We address several critical issues for finding community structures. First, biological networks directly constructed from experimental data often contain spurious edges and may also miss genuine connections. As a result, community structures in biological networks are often weak. We introduce simple operations to capture local neighborhood structures ...Read More

PDF

Supporting Collaborative Behavior in MANETs using Workflows Rohan Sen, Gregory Hackmann, Mart Haitjema, Gruia-Catalin Roman, and Gill
Technical Report

Abstract:

Groupware activities provide a powerful representation for many collaborative tasks. Today, the technologies that support typical groupware applications often assume a stable wired network infrastructure. The potential for collaboration in scenarios that lack this fixed infrastructure remains largely untapped. Such scenarios include activities on construction sites, wilderness exploration, disaster recovery, and rapid intervention teams. Communication in these scenarios can be supported using wireless ad hoc networks, an emerging technology whose full potential is yet to be understood and realized. In this paper, we consider the fundamental technical issues that need ...Read More

PDF

CiAN: A Language and Middleware for Collaboration in Ad hoc Networks Rohan Sen, Gruia-Catalin Roman, and Andrew Frank
Technical Report

Abstract:

Designing software that supports collaboration among multiple users in mobile ad hoc networks is challenging due to the dynamic network topology and inherent unpredictability of the environment. However, as we increasingly migrate to using mobile computing platforms, there is a pertinent need for software that can support a wide range of collaborative activities anywhere and at any time without relying on any external infrastructure. In this paper, we adopt the workflow model to represent the structure of an activity that involves multiple tasks being performed in a structured, collaborative fashion ...Read More

PDF

Manifold Learning for Natural Image Sets, Doctoral Dissertation August 2006 Richard Souvenir
Technical Report

Abstract:

The field of manifold learning provides powerful tools for parameterizing high-dimensional data points with a small number of parameters when this data lies on or near some manifold. Images can be thought of as points in some high-dimensional image space where each coordinate represents the intensity value of a single pixel. These manifold learning techniques have been successfully applied to simple image sets, such as handwriting data and a statue in a tightly controlled environment. However, they fail in the case of natural image sets, even those that only vary ...Read More

PDF

Timed Automata Models for Principled Composition of Middleware Venkita Subramonian
Technical Report

Abstract:

Middleware for Distributed Real-time and Embedded (DRE) systems has grown more and more complex in recent years due to the varying functional and temporal requirements of complex real-time applications. To enable DRE middleware to be configured and customized to meet the demands of different applications, a body of ongoing research has focused on applying model-driven development techniques to developing QoS-enabled middleware. While current approaches for modeling middleware focus on easing the task of as-assembling, deploying and configuring middleware and middleware-based applications, a more formal basis for correct middleware composition and ...Read More

PDF

Reusable Models for Timing and Liveness Analysis of Middleware for Distributed Real-Time and Embedded Systems Venkita Subramonian, Christopher Gill, Cesar Sanchez, and Henny Sipma
Technical Report

Abstract:

Distributed real-time and embedded (DRE) systems have stringent constraints on timeliness and other properties whose assurance is crucial to correct system behavior. Formal tools and techniques play a key role in verifying and validating system properties. However, many DRE systems are built using middleware frameworks that have grown increasingly complex to address the diverse requirements of a wide range of applications. How to apply formal tools and techniques effectively to these systems, given the range of middleware configuration options available, is therefore an important research problem. This paper makes three ...Read More

PDF

A view-based deformation tool-kit, Master's Thesis, August 2006 Nisha Sudarsanam
Technical Report

Abstract:

Camera manipulation is a hard problem since a graphics camera is defined by specifying 11 independent parameters. Manipulating such a high-dimensional space to accomplish specific tasks is difficult and requires a certain amount of expertise. We present an intuitive interface that allows novice users to perform camera operations in terms of the change they want see in the image. In addition to developing a natural means for camera interaction, our system also includes a novel interface for viewing and organizing previously saved views. When exploring complex 3D data-sets a single ...Read More

PDF

The Meta-Theory of Q_0 in the Calculus of Inductive Constructions, Master's Thesis, May 2006 Li-Yang Tan
Technical Report

Abstract:

The notion of a proof is central to all of mathematics. In the language of formal logic, a proof is a finite sequence of inferences from a set of axioms, and any statement one yields from such a finitistic procedure is called a theorem. For better or for worse, this is far from the form a traditional mathematical proof takes. Mathematicians write proofs that omit routine logical steps, and details deemed tangential to the central result are often elided. These proofs are fuzzy and human-centric, and a great amount of ...Read More

PDF

The Design, Modeling, and Implementation of Group Scheduling for Isolation of Computations from Adversarial Interference Terry Tidwell, Noah Watkins, Venkita Subramonian, Douglas Niehaus, Armando Gill, and Migliaccio
Technical Report

Abstract:

To isolate computations from denial of service (DoS) attacks and other forms of adversarial interference, it is necessary to constrain the effects of interactions among computations. This paper makes four contributions to research on isolation of computations from adversarial interference: (1) it describes the design and implementation of a kernel level scheduling policy to control the effects of adversarial attacks on computations’ execution; (2) it presents formal models of the system components that are involved in a representative DoS attack scenario; (3) it shows how model checking can be used ...Read More

PDF

A Proposed Architecture for the GENI Backbone Platform Jonathan Turner
Technical Report

Abstract:

The GENI Project (Global Environment for Network Innovation) is a major NSF-sponsored initiative that seeks to create a national research facility to enable experimental deployment of innovative new network architectures on a sufficient scale to enable realistic evaluation. One key component of the GENI system will be the GENI Backbone Platform (GBP) that provides the resources needed to allow multiple experimental networks to co-exist within the shared GENI infrastructure. This report reviews the objectives for the GBP, reviews the key issues that affect its design and develops a detailed reference ...Read More

PDF

Design of a Diversified Network Substrate Jonathan Turner
Technical Report

Abstract:

A diversified network substrate enables multiple end-to-end metanetworks to co-exist within a shared physical infrastructure. Metanetworks are implemented by metarouters, hosted by substrate routers, and metarouters are connected by metalinks. The substrate allocates resources (both link bandwidth and processing resources) to metarouters based on advance reservations received from metanetwork planning systems. It also enables dynamic creation of access metalinks, connecting end systems to metarouters, and supports mobility of end systems under the control of their metanetworks. This report defines a model for a diversified internet and presents a detailed design ...Read More

PDF

Design of Routers for Diversified Networks Jonathan Turner
Technical Report

Abstract:

PDF

Auto-Pipe and the X Language: A Toolset and Language for the Simulation, Analysis, and Synthesis of Heterogeneous Pipelined Architectures, Master's Thesis, August 2006 Eric J. Tyson
Technical Report

Abstract:

Pipelining an algorithmis a popularmethod of increasing the performance of many computation-intensive applications. Often, one wants to form pipelines composed mostly of commonly used simple building blocks such as DSP components, simple math operations, encryption, or pattern matching stages. Additionally, one may desire to map these processing tasks to different computational resources based on their relative performance attributes (e.g., DSP operations on an FPGA). Auto-Pipe is composed of the X Language, a flexible interface language that aids the description of complex dataflow topologies (including pipelines); X-Com, a compiler for the ...Read More

PDF

Adaptive Quality of Service Control in Distributed Real-Time Embedded Systems Xiaorui Wang
Technical Report

Abstract:

An increasing number of distributed real-time embedded systems face the critical challenge of providing Quality of Service (QoS) guarantees in open and unpredictable environments. For example, such systems often need to enforce CPU utilization bounds on multiple processors in order to avoid overload and meet end-to-end dead-lines, even when task execution times deviate significantly from their estimated values or change dynamically at run-time. This dissertation presents an adaptive QoS control framework which includes a set of control design methodologies to provide robust QoS assurance for systems at different scales. To ...Read More

PDF

Knuth-Bendix Completion with Modern Termination Checking, Master's Thesis, August 2006 Ian Wehrman
Technical Report

Abstract:

Knuth-Bendix completion is a technique for equational automated theorem proving based on term rewriting. This classic procedure is parametrized by an equational theory and a (well-founded) reduction order used at runtime to ensure termination of intermediate rewriting systems. Any reduction order can be used in principle, but modern completion tools typically implement only a few classes of such orders (e.g., recursive path orders and polynomial orders). Consequently, the theories for which completion can possibly succeed are limited to those compatible with an instance of an implemented class of orders. Finding ...Read More

PDF

Extending Byzantine Fault Tolerance to Replicated Clients Ian Wehrman, Sajeeva L. Pallemulle, and Kenneth J. Goldman
Technical Report

Abstract:

Byzantine agreement protocols for replicated deterministic state machines guarantee that externally requested operations continue to execute correctly even if a bounded number of replicas fail in arbitrary ways. The state machines are passive, with clients responsible for any active ongoing application behavior. However, the clients are unreplicated and outside the fault-tolerance boundary. Consequently, agreement protocols for replicated state machines do not guarantee continued correct execution of long-running client applications. Building on the Castro and Liskov Byzantine Fault Tolerance protocol for unreplicated clients (CLBFT), we present a practical algorithm for Byzantine ...Read More

PDF

Using Expressing Sequence Tags to Improve Gene Structure Annotation Chaochun Wei and Michael R. Brent
Technical Report

Abstract:

Finding all gene structures is a crucial step in obtaining valuable information from genomic sequences. It is still a challenging problem, especially for vertebrate genomes, such as the human genome. Expressed Sequence Tags (ESTs) provide a tremendous resource for determining intron-exon structures. However, they are short and error prone, which prevents existing methods from exploiting EST information efficiently. This dissertation addresses three aspects of using ESTs for gene structure annotation. The first aspect is using ESTs to improve de novo gene prediction. Probability models are introduced for EST alignments to ...Read More

PDF

Virtualizing Network Processors Ben Wun, Jonathan Turner, and Patrick Crowley
Technical Report

Abstract:

This paper considers the problem of virtualizing the resources of a network processor (NP) in order to allow multiple third-parties to execute their own virtual router software on a single physical router at the same time. Our broad interest is in designing such a router capable of supporting virtual networking. We discuss the issues and challenges involved in this virtualization, and then describe specific techniques for virtualizing both the control and data-plane processors on NPs. For Intel IXP NPs in particular, we present a dynamic, macro-based technique for virtualization that ...Read More

Reports from 2005

PDF

Spatiotemporal Query Strategies for Navigation in Dynamic Sensor Network Environments Gacihan Alankus, Nuzhet Atay, Chenyang Lu, and O. Burchan Bayazit
Technical Report

Abstract:

Autonomous mobile agent navigation is crucial to many mis-sion-critical applications (e.g., search and rescue missions in a disaster area). In this paper, we present how sensor net-works may assist probabilistic roadmap methods (PRMs), a class of efficient navigation algorithms particularly suit-able for dynamic environments. A key challenge of apply-ing PRM algorithms in dynamic environment is that they re-quire the spatiotemporal sensing of the environment to solve a given navigation problem. To facilitate navigation, we propose a set of query strategies that allow a mobile agent to periodically collect real-time information ...Read More

PDF

A Motion Planning Processor on Reconfigurable Hardware Nuzhet Atay and Burchan Bayazit
Technical Report

Abstract:

Motion planning algorithms enable us to find feasible paths for moving objects. These algorithms utilize feasibility checks to differentiate valid paths from invalid ones. Unfortunately, the computationally expensive nature of such checks reduces the effectiveness of motion planning algorithms. However, by using hardware acceleration to speed up the feasibility checks, we can greatly enhance the performance of the motion planning algorithms. Of course, such acceleration is not limited to feasibility checks; other components of motion planning algorithms can also be accelerated using specially designed hardware. A Field Programmable Gate Array ...Read More

PDF

A Collision Detection Chip on Reconfigurable Hardware Nuzhet Atay, John W. Lockwood, and Burchan Bayazit
Technical Report

Abstract:

Collision detection algorithms check the intersection between two given surfaces or volumes. They are computationally-intensive and the capabilities of conventional processors limit their performance. Hardware acceleration of these algorithms can greatly benefit the systems that need collision detection to be performed in real-time. A Field Programmable Gate Array (FPGA) is a great platform to achieve such acceleration. An FPGA is a collection of digital gates which can be reprogrammed at run time, i.e., it can be used as a CPU that reconfigures itself for a given task. In this paper, ...Read More

PDF

Architectures for Rule Processing Intrusion Detection and Prevention Systems Michael E. Attig
Technical Report

Abstract:

High-performance intrusion detection and prevention systems are needed by network administrators in order to protect Internet systems from attack. Researchers have been working to implement components of intrusion detection and prevention systems for the highly popular Snort system in reconfigurable hardware. While considerable progress has been made in the areas of string matching and header processing, complete systems have not yet been demonstrated that effectively combine all of the functionality necessary to perform intrusion detection and prevention for real network systems. In this thesis, three architectures to perform rule processing, ...Read More

PDF

Roadmap Query for Sensor Network Assisted Navigation in Dynamic Environments Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, and Gruia-Catalin Roman
Technical Report

Abstract:

Autonomous mobile entity navigation through dynamic and unknown environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the environment necessitates the mobile entity to constantly maintain a high degree of awareness of the changing environment. This criteria makes it difficult to achieve good navigation performance by using just on-board sensors and existing navigation methods and motivates the use of wireless sensor networks (WSNs) to aid navigation. In this paper, we present a novel approach that integrates a roadmap based ...Read More

PDF

Achieving Flexibility in Direct-Manipulation Programming Environments by Relaxing the Edit-Time Grammar Benjamin E. Birnbaum and Kenneth J. Goldman
Technical Report

Abstract:

Structured program editors can lower the entry barrier for beginning computer science students by preventing syntax errors. However, when editors force programs to be executable after every edit, a rigid development process results. We explore the use of a separate edit-time grammar that is more permissive than the runtime grammar. This helps achieve a balance between structured editing and flexibility, particularly in live development environments. JPie is a graphical programming environment that applies this separation to the live development of Java applications. We present the design goals for JPie’s edit-time ...Read More

PDF

Smartacking: Improving TCP Performance from the Receiving End Daniel K. Blandford, Sally A. Goldman, Sergey Gorinsky, Yan Zhou, and Daniel R. Dooly
Technical Report

Abstract:

We present smartacking, a technique that improves performance of Transmission Control Protocol (TCP) via adaptive generation of acknowledgments (ACKs) at the receiver. When the bottleneck link is underutilized, the receiver transmits an ACK for each delivered data segment and thereby allows the connection to acquire the available capacity promptly. When the bottleneck link is at its capacity, the smartacking receiver sends ACKs with a lower frequency reducing the control traffic overhead and slowing down the congestion window growth to utilize the network capacity more effectively. To promote quick deployment of ...Read More

PDF

What A Mesh: Dependent Data Types for Correct Mesh Manipulation Algorithms Joel R. Brandt
Technical Report

Abstract:

The Edinburgh Logical Framework (LF) has been proposed as a system for expressing inductively defined sets. I will present an inductive definition of the set of manifold meshes in LF. This definition takes into account the topological characteri-zation of meshes, namely their Euler Characteristic. I will then present a set of dependent data types based on this inductive def-inition. These data types are defined in a programming language based on LF. The language’s type checking guarantees that any typeable expression represents a correct manifold mesh. Furthermore, any mesh can be ...Read More

PDF

Functional Optimization Models for Active Queue Management Yixin Chen
Technical Report

Abstract:

Active Queue Management (AQM) is an important problem in networking. In this paper, we propose a general functional optimiza-tion model for designing AQM schemes. Unlike the previous static func-tion optimization models based on the artificial notion of utility function, the proposed dynamic functional optimization formulation allows us to directly characterize the desirable system behavior of AQM and design AQM schemes to optimally control the dynamic behavior of the system. Such a formulation also allows adaptive control which enables the AQM scheme to continuously adapt to dynamic changes of networking con-ditions. ...Read More

PDF

Real-time Power Aware Routing in Wireless Sensor Networks Octav Chipara, Zhimin He, Guoliang Xing, Qin Chen, Xiaorui Wang, Chenyang Lu, John Stankovic, and Tarek Abdelzaher
Technical Report

Abstract:

Many mission-critical wireless sensor network applications must resolve the inherent conflict between the tight resource constraints on each sensor node, particularly in terms of energy, with the need to achieve desired quality of service such as end-to-end real-time performance. To address this challenge we propose the Real-time Power-Aware Routing (RPAR) protocol. RPAR achieves required communication delays at minimum energy cost by dynamically adapting the transmission power and routing decisions based on packet deadlines. RPAR integrates a geographic forwarding policy cognizant of deadlines, power, and link quality with new algorithms for ...Read More

PDF

A Traveling Salesman's Approach to Clustering Gene Expression Data Sharlee Climer and Weixiong Zhang
Technical Report

Abstract:

Given a matrix of values, rearrangement clustering involves rearranging the rows of the matrix and identifying cluster boundaries within the linear ordering of the rows. The TSP+k algorithm for rear-rangement clustering was presented in [3] and its implementation is described in this note. Using this code, we solve a 2,467-gene expression data clustering problem and identify “good” clusters that con-tain close to eight times the number of genes that were clustered by Eisen et al. (1998). Furthermore, we identify 106 functional groups that were overlooked in that paper. We make ...Read More

PDF

Cut-and-Solve: A Linear Search Strategy for Combinatorial Optimization Problems Sharlee Climer and Weixiong Zhang
Technical Report

Abstract:

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions. In this paper, we introduce a linear search strategy which we refer to as cut-and-solve and prove optimality and completeness for this method. This search is different from traditional tree searching as there is no branching. At each node in the search path, a relaxed problem and a sparse problem are solved and a constraint is added to the relaxed problem. The sparse problems provide incumbent solutions. When the constraining of the relaxed problem becomes tight enough, its solution value ...Read More

PDF

Exploiting Bounds in Operations Research and Artificial Intelligence Sharlee Climer and Weixiong Zhang
Technical Report

Abstract:

Combinatorial optimization problems are ubiquitous in scientific research, engineering, and even our daily lives. A major research focus in developing combinatorial search algorithms has been on the attainment of efficient methods for deriving tight lower and upper bounds. These bounds restrict the search space of combinatorial optimization problems and facilitate the computa-tion of what might otherwise be intractable problems. In this paper, we survey the history of the use of bounds in both AI and OR. While research has been extensive in both domains, until very recently it has been ...Read More

PDF

Rearrangement Clustering: Pitfalls, Remedies, and Applications Sharlee Climer and Weixiong Zhang
Technical Report

Abstract:

Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangementclustering is the problem of rearranging the rows of the matrix such that the sum of the similarities between adjacent rows is maximized. Referred to by various names and reinvented several times, this clustering technique has been extensively used in many fields over the last three decades. In this paper, we point out two critical pitfalls that have been previously overlooked. The first pitfall is deleterious when rearrangement clustering ...Read More

PDF

Synthesis of Control Elements from Petri Net Models J. R. Cox and D. Zar
Technical Report

Abstract:

Methods are presented for synthesizing delay-insensitive circuits whose behavior is specified by Petri net models of macromodular control elements. These control elements implement five natural functions used in asynchronous system design. Particular attention is paid to modules requiring mutual exclusion where metastability must be carefully controlled.

PDF

The Open Network Laboratory (a resource for high performance networking research) John DeHart, Fred Kuhns, Jyoti Parwatikar, Jonathan Turner, and Ken Wong
Technical Report

Abstract:

The Open Network Laboratory (ONL) is a remotely accessible network testbed designed to enable network researchers to conduct experiments using high performance routers and applications. ONL™s Remote Laboratory Interface (RLI) allows users to easily configure a network topology, initialize and modify the routers™ routing tables, packet classification tables and queuing parameters. It also enables users to add software plugins to the embedded processors available at each of the routers™ ports, enabling the introduction of new functionality. The routers provide a large number of built-in counters to track various aspects of ...Read More

PDF

Non-Photorealistic Rendering of Algorithmically Generated Trees Nathan C. Dudley and Cindy Grimm
Technical Report

Abstract:

This work presents a novel rendering technique inspired by artistic approaches. Instead of trying to recreate the appearance of a traditional medium, such as charcoal or watercolor, this approach is a mixture of both photo-realism and abstraction. Artists use a process of abstraction to provide structural information about subjects that do not have clearly defined shapes, such as groups of leaves in a tree. For example, an artist will first use a color wash to approximate a group of leaves, then add detail on top of parts of this wash ...Read More

PDF

Auto-Pipe: A Pipeline Design and Evaluation System Mark A. Franklin, John Maschmeyer, Eric Tyson, James Buckley, and Patrick Crowley
Technical Report

Abstract:

Auto-Pipe is a tool that aids in the design, evaluation, and implementation of pipelined applications that are distributed across a set of heterogeneous devices including multiple processors and FPGAs. It has been developed to meet the needs arising in the domains of communications, computation on large datasets, and real time streaming data applications. In this paper, the Auto-Pipe design flow is introduced and two sample applications, developed for compatibility with the Auto-Pipe system, are presented. The sample applications are the Triple-DES encryption standard and a subset of the signal-processing pipeline ...Read More

PDF

Dusty Caches to Save Memory Traffic Scott J. Friedman
Technical Report

Abstract:

Reference counting is a garbage-collection technique that maintains a per-object count of the number of pointers to that object. When the count reaches zero, the object must be dead and can be collected. Although it is not an exact method, it is well suited for real-time systems and is widely implemented, sometimes in conjunction with other methods to increase the overall precision. A disadvantage of reference counting is the extra storage trac that is introduced. In this paper, we describe a new cache write-back policy that can substantially decrease the ...Read More

PDF

Manifold Representations for Continuous-State Reinforcement Learning Robert Glaubius and William D. Smart
Technical Report

Abstract:

Reinforcement learning (RL) has shown itself to be an effective paradigm for solving optimal control problems with a finite number of states. Generalizing RL techniques to problems with a continuous state space has proven a difficult task. We present an approach to modeling the RL value function using a manifold representation. By explicitly modeling the topology of the value function domain, traditional problems with discontinuities and resolution can be addressed without resorting to complex function approximators. We describe how manifold techniques can be applied to value-function approximation, and present methods ...Read More

PDF

Harmonic Imaging Using a Mechanical Sector, B-MODE Danna Gurari
Technical Report

Abstract:

An ultrasound imaging system includes transmitting ultrasound waves into a human body, collecting the reflections, manipulating the reflections, and then displaying them on computer screen as a grayscale image. The standard approach for ultrasound imaging is to use the fundamental frequency from the reflected signal to form images. However, it has been shown that images generated using the harmonic content have improved resolution as well as reduced noise, resulting in clearer images. Although harmonic imaging has been shown to return improved images, this has never been shown with a B-mode, ...Read More

PDF

NCBI BLASTN Stage 1 in Reconfigurable Hardware Kwame Gyang
Technical Report

Abstract:

Recent advances in DNA sequencing have resulted in several terabytes of DNA sequences. These sequences themselves are not informative. Biologists usually perform comparative analysis of DNA queries against these large terabyte databases for the purpose of developing hypotheses pertaining to function and relation. This is typically done using software on a general multiprocessor. However, these data sets far exceed the capabilities of the modern processor and performing sequence similarity analysis is increasingly becoming less efficient. There is an urgent need for more efficient ways of querying large DNA sequences for ...Read More

PDF

Agimone: Midddleware Support for Seamless Integration of Sensor and IP Networks Gregory Hackmann, Chien-Liang Fok, Gruia-Catalin Roman, and Chenyang Lu
Technical Report

Abstract:

The scope of wireless sensor network (WSN) applications has traditionally been restricted by physical sensor coverage and limited computational power. Meanwhile, IP networks like the Internet offer tremendous connectivity and computing resources. This paper presents Agimone, a middleware layer that integrates sensor and IP networks as a uniform platform for flexible application deployment. This layer allows applications to be deployed on the WSN in the form of mobile agents which can autonomously discover and migrate to other WSNs, using a common IP backbone as a bridge. It facilitates data sharing ...Read More

PDF

Context Aware Service Oriented Computing in Mobile Ad Hoc Networks Radu Handorean, Gruia-Catalin Roman, and Christopher Gill
Technical Report

Abstract:

These days we witness a major shift towards small, mobile devices, capable of wireless communication. Their communication capabilities enable them to form mobile ad hoc networks and share resources and capabilities. Service Oriented Computing (SOC) is a new emerging paradigm for distributed computing that has evolved from object-oriented and component-oriented computing to enable applications distributed within and across organizational boundaries. Services are autonomous computational elements that can be described, published, discovered, and orchestrated for the purpose of developing applications. The application of the SOC model to mobile devices provides a ...Read More

PDF

SPAWN: Service Provision in Ad-hoc Wireless Networks Radu Handorean, Gruia-Catalin Roman, Rohan Sen, Gregory Hackmann, and Christopher Gill
Technical Report

Abstract:

The increasing ubiquity of wireless mobile computing platforms has opened up the potential for unprecedented levels of communication, coordination and collaboration among mobile computing devices, most of which will occur in an ad hoc, on-demand manner. This paper describes SPAWN, a middleware supporting service provision in ad-hoc wireless networks. The aim of SPAWN is to provide the software resources on mobile devices that facilitate electronic collaboration. This is achieved by applying the principles of service oriented computing (SOC), an emerging paradigm that has seen success in wired settings. SPAWN is ...Read More

PDF

Efficient and Effective Schemes for Streaming Media Delivery Cheng Huang
Technical Report

Abstract:

The rapid expansion of the Internet and the increasingly wide deployment of wireless networks provide opportunities to deliver streaming media content to users at anywhere, anytime. To ensure good user experience, it is important to battle adversary effects, such as delay, loss and jitter. In this thesis, we first study efficient loss recovery schemes, which require pure XOR operations. In particular, we propose a novel scheme capable of recovering up to 3 packet losses, and it has the lowest complexity among all known schemes. We also propose an efficient algorithm ...Read More

PDF

Design and Performance of a Fault-Tolerant Real-Time CORBA Event Service Huang-Ming Huang and Christopher Gill
Technical Report

Abstract:

Developing distributed real-time and embedded (DRE)systems in which multiple quality-of-service (QoS) dimen-sions must be managed is an important and challenging R&D problem. This paper makes three contributions to re-search on multi-dimensional QoS for DRE systems. First, itdescribes the design and implementation of a fault-tolerantreal-time CORBA event service for The ACE ORB (TAO).Second, it describes our enhancements and extensions tofeatures in TAO, to integrate real-time and fault toleranceproperties. Third, it presents an empirical evaluation ofour approach. Our results show that with some refinements,real-time and fault-tolerance features can be integrated ef-fectively and ...Read More