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

Computer Sciences Commons™

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

Washington University in St. Louis

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 391 - 420 of 830

Full-Text Articles in Computer Sciences

Feature Detection Using Curvature Maps And The Min-Cut/Max-Flow Graph Cut Algorithm, Timothy Gatzke, Cindy Grimm Jan 2006

Feature Detection Using Curvature Maps And The Min-Cut/Max-Flow Graph Cut Algorithm, Timothy Gatzke, Cindy Grimm

All Computer Science and Engineering Research

Automatic detection of features in three-dimensional objects is a critical part of shape matching tasks such as object registration and recognition. Previous approaches to local surface matching have either focused on man-made objects, where features are generally well-defined, or required some type of user interaction to select features. Manual selection of corresponding features and subjective determination of the difference between objects are time consuming processes requiring a high level of expertise. Curvature is a useful property of a surface, but curvature calculation on a discrete mesh is often noisy and not always accurate. However, the em Curvature Map, which represents …

Go to article

Distributed Utilization Control For Real-Time Clusters With Load Balancing, Yong Fu, Hongan Wang, Chenyang Lu, Ramu S. Chandra Jan 2006

Distributed Utilization Control For Real-Time Clusters With Load Balancing, Yong Fu, Hongan Wang, Chenyang Lu, Ramu S. Chandra

All Computer Science and Engineering Research

Recent years have seen rapid growth of online services that rely on large-scale server clusters to handle high volume of requests. Such clusters must adaptively control the CPU utilizations of many processors in order to maintain desired soft real-time performance and prevent system overload in face of unpredictable workloads. This paper presents DUC-LB, a novel distributed utilization control algorithm for cluster-based soft real-time applications. Compared to earlier works on utilization control, a distinguishing feature of DUC-LB is its capability to handle system dynamics caused by load balancing, which is a common and essential component of most clusters today. Simulation results …

Go to article

Mobiwork: Mobile Workflow For Manets, Gregory Hackmann, Rohan Sen, Mart Haitjema, Gruia-Catalin Roman, Gill Jan 2006

Mobiwork: Mobile Workflow For Manets, Gregory Hackmann, Rohan Sen, Mart Haitjema, Gruia-Catalin Roman, Gill

All Computer Science and Engineering Research

The workflow model is well suited for scenarios where many entities work collaboratively towards a common goal, and is used widely today to model complex business processes. However, the fundamental workflow model is very powerful and can be applied to a wider variety of application domains. This paper represents an initial investigation into the possibility of using workflows to model collaboration in an ad hoc mobile environment. Moving to a mobile setting introduces many challenges as the mobility of the participants in a workflow imposes constraints on allocation of workflow tasks, coordination among participants, and marshaling of results. We present …

Go to article

Efficient Mapping Of Virtual Networks Onto A Shared Substrate, Jing Lu, Jonathan Turner Jan 2006

Efficient Mapping Of Virtual Networks Onto A Shared Substrate, Jing Lu, Jonathan Turner

All Computer Science and Engineering Research

Virtualization has been proposed as a vehicle for overcoming the growing problem of internet ossification [1]. This paper studies the problem of mapping diverse virtual networks onto a common physical substrate. In particular, we develop a method for mapping a virtual network onto a substrate network in a cost-efficient way, while allocating sufficient capacity to virtual network links to ensure that the virtual network can handle any traffic pattern allowed by a general set of traffic constraints. Our approach attempts to find the best topology in a family of backbone-star topologies, in which a subset of nodes constitute the backbone, …

Go to article

Adaptive Embedded Roadmaps For Sensor Networks, Gazihan Alankus, Nuzhet Atay, Chenyang Lu, Burchan Bayazit Jan 2006

Adaptive Embedded Roadmaps For Sensor Networks, Gazihan Alankus, Nuzhet Atay, Chenyang Lu, Burchan Bayazit

All Computer Science and Engineering Research

In this paper, we propose a new approach to wireless sensor network assisted navigation while avoiding moving dangers. Our approach relies on an embedded roadmap in the sensor network that always contains safe paths. The roadmap is adaptive, i.e., it adapts its topology to changing dangers. The mobile robots in the environment uses the roadmap to reach their destinations. We evaluated the performance of embedded roadmap both in simulations using realistic conditions and with real hardware. Our results show that the proposed navigation algorithm is better suited for sensor networks than traditional navigation field based algorithms. Our observations suggest that …

Go to article

Control Of Decoherence In Open Quantum Systems, Narayan Ganesan Jan 2006

Control Of Decoherence In Open Quantum Systems, Narayan Ganesan

All Computer Science and Engineering Research

No abstract provided.

Go to article

Knuth-Bendix Completion With Modern Termination Checking, Master's Thesis, August 2006, Ian Wehrman Jan 2006

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

All Computer Science and Engineering Research

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 and specifying a compatible order, even among a small number …

Go to article

Sliver: A Bpel Workflow Process Execution Engine For Mobile Devices, Gregory Hackmann, Mart Haitjema, Christopher Gill, Catalin-Gruia Roman Jan 2006

Sliver: A Bpel Workflow Process Execution Engine For Mobile Devices, Gregory Hackmann, Mart Haitjema, Christopher Gill, Catalin-Gruia Roman

All Computer Science and Engineering Research

The Business Process Execution Language (BPEL) has become the dominant means for expressing traditional business processes as workflows. The widespread deployment of mobile devices like PDAs and mobile phones has created a vast computational and communication resource for these workflows to exploit. However, BPEL so far has been deployed only on relatively heavyweight server platforms such as Apache Tomcat, leaving the potential created by these lower-end devices untapped. This paper presents Sliver, a BPEL workflow process execution engine that supports a wide variety of devices ranging from mobile phones to desktop PCs. We discuss the design decisions that allow Sliver …

Go to article

Reusable Models For Timing And Liveness Analysis Of Middleware For Distributed Real-Time And Embedded Systems, Venkita Subramonian, Christopher Gill, Cesar Sanchez, Henny Sipma Jan 2006

Reusable Models For Timing And Liveness Analysis Of Middleware For Distributed Real-Time And Embedded Systems, Venkita Subramonian, Christopher Gill, Cesar Sanchez, Henny Sipma

All Computer Science and Engineering Research

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 contributions to research on formal verification and validation of middleware-based …

Go to article

Multimodal Congestion Control For Low Stable-State Queuing, Maxim Podlesny, Sergey Gorinsky Jan 2006

Multimodal Congestion Control For Low Stable-State Queuing, Maxim Podlesny, Sergey Gorinsky

All Computer Science and Engineering Research

To discover an efficient fair sending rate for a flow, Transmission Control Protocol (TCP) saturates the bottleneck link and its buffer until the router discards a packet. Such TCP-caused queuing is detrimental for interactive and other delay-sensitive applications. In this paper, we present Multimodal Control Protocol (MCP) which strives to maintain low queues and avoid congestion losses at network links. The multimodal MCP engages routers and hosts in limited explicit communication. A distinguishing property of MCP is stable transmission after converging to efficient fair states. To ensure convergence to fairness, MCP incorporates an innovative mechanism that enables a flow to …

Go to article

Dynamic Resource Management In A Static Network Operating System, Kevin Klues, Vlado Handziski, David Culler, David Gay, Phillip Levis Levis, Chenyang Lu, Adam Wolisz Jan 2006

Dynamic Resource Management In A Static Network Operating System, Kevin Klues, Vlado Handziski, David Culler, David Gay, Phillip Levis Levis, Chenyang Lu, Adam Wolisz

All Computer Science and Engineering Research

We present novel approaches to managing three key resources in an event-driven sensornet OS: memory, energy, and peripherals. We describe the factors that necessitate using these new approaches rather than existing ones. A combination of static allocation and compile-time virtualization isolates resources from one another, while dynamic management provides the flexibility and sharing needed to minimize worst-case overheads. We evaluate the effectiveness and efficiency of these management policies in comparison to those of TinyOS 1.x, SOS, MOS, and Contiki. We show that by making memory, energy, and peripherals first-class abstractions, an OS can quickly, efficiently, and accurately adjust itself to …

Go to article

Link Layer Support For Unified Radio Power Management In Wireless Sensor Networks, Kevin Klues, Guoliang Xing, Chenyang Lu Jan 2006

Link Layer Support For Unified Radio Power Management In Wireless Sensor Networks, Kevin Klues, Guoliang Xing, Chenyang Lu

All Computer Science and Engineering Research

Radio power management is of paramount concern in wireless sensor networks that must achieve long lifetimes on scarce amounts of energy. While a multitude of power management protocols have been proposed in the past, the lack of system support for flexibly integrating them with a diverse set of applications and network platforms has made them difficult to use. Instead of proposing yet another power management protocol, this paper focuses on providing link layer support towards realizing a Unified Power Management Architecture (UPMA) for flexible radio power management in wireless sensor networks. In contrast to the monolithic approaches adopted by existing …

Go to article

Cian: A Language And Middleware For Collaboration In Ad Hoc Networks, Rohan Sen, Gruia-Catalin Roman, Andrew Frank Jan 2006

Cian: A Language And Middleware For Collaboration In Ad Hoc Networks, Rohan Sen, Gruia-Catalin Roman, Andrew Frank

All Computer Science and Engineering Research

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 by multiple users. Using the workflow model as a base, …

Go to article

Virtualization For A Network Processor Runtime System, Brandon Heller, Jonathan Turner, John Dehart, Patrick Crowley Jan 2006

Virtualization For A Network Processor Runtime System, Brandon Heller, Jonathan Turner, John Dehart, Patrick Crowley

All Computer Science and Engineering Research

The continuing ossification of the Internet is slowing the pace of network innovation. Network diversification presents one solution to this problem, by virtualizing the network at multiple layers. Diversified networks consist of a shared physical substrate, virtual routers (metarouters), and virtual links (metalinks). Virtualizing routers enables smooth and incremental upgrades to new network services. Our current priority for a diversified router prototype is to enable reserved slices of the network for researchers to perform repeatable, high-speed network experiments. General-purpose processors have well established techniques for virtualization, but do not scale efficiently to multi-gigabit speeds. To achieve these speeds, we employ …

Go to article

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 Jan 2006

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

All Computer Science and Engineering Research

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 X Language; X-Sim, a tool for modeling pipelined architectures based …

Go to article

Real-Time Memory Management: Life And Times, Andrew Borg, Andy Wellings, Christopher Gill, Ron K. Cytron Jan 2006

Real-Time Memory Management: Life And Times, Andrew Borg, Andy Wellings, Christopher Gill, Ron K. Cytron

All Computer Science and Engineering Research

As high integrity real-time systems become increasingly large and complex, forcing a static model of memory usage becomes untenable. The challenge is to provide a dynamic memory model that guarantees tight and bounded time and space requirements without overburdening the developer with memory concerns. This paper provides an analysis of memory management approaches in order to characterise the tradeoffs across three semantic domains: space, time and a characterisation of memory usage information such as the lifetime of objects. A unified approach to distinguishing the merits of each memory model highlights the relationship across these three domains, thereby identifying the class …

Go to article

Supporting Collaborative Behavior In Manets Using Workflows, Rohan Sen, Gregory Hackmann, Mart Haitjema, Gruia-Catalin Roman, Gill Jan 2006

Supporting Collaborative Behavior In Manets Using Workflows, Rohan Sen, Gregory Hackmann, Mart Haitjema, Gruia-Catalin Roman, Gill

All Computer Science and Engineering Research

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 to be addressed in order to introduce groupware concepts into …

Go to article

Three Dimensional Panoramic Fast Flourescence Imaging Of Cardiac Arryhtymias In The Rabbit Heart, Fujian Qu, Vladimir P. Nikolski, Cindy Grimm, Igor R. Efimov Jan 2006

Three Dimensional Panoramic Fast Flourescence Imaging Of Cardiac Arryhtymias In The Rabbit Heart, Fujian Qu, Vladimir P. Nikolski, Cindy Grimm, Igor R. Efimov

All Computer Science and Engineering Research

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 electrical activity provides us with a powerful tool to investigate …

Go to article

Discovering Weak Community Structures In Large Biological Networks , Jianhua Ruan, Weixiong Zhang Jan 2006

Discovering Weak Community Structures In Large Biological Networks , Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

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 for identifying weak communities. Second, we consider the issue of …

Go to article

Automatic Application-Specific Customization Of Softcore Processor Microarchitecture, Masters Thesis, May 2006, Shobana Padmanabhan Jan 2006

Automatic Application-Specific Customization Of Softcore Processor Microarchitecture, Masters Thesis, May 2006, Shobana Padmanabhan

All Computer Science and Engineering Research

Applications for constrained embedded systems are subject to strict runtime and resource utilization bounds. With soft core processors, application developers can customize the processor for their application, constrained by available hardware resources but aimed at high application performance. The more reconfigurable the processor is, the more options the application developers will have for customization and hence increased potential for improving application performance. However, such customization entails developing in-depth familiarity with all the parameters, in order to configure them effectively. This is typically infeasible, given the tight time-to-market pressure on the developers. Alternatively, developers could explore all possible configurations, but being …

Go to article

Manifold Learning For Natural Image Sets, Doctoral Dissertation August 2006, Richard Souvenir Jan 2006

Manifold Learning For Natural Image Sets, Doctoral Dissertation August 2006, Richard Souvenir

All Computer Science and Engineering Research

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 due to a single degree of freedom, such as a …

Go to article

Design Issues Of Reserved Delivery Subnetworks, Doctoral Dissertation, May 2006, Ruibiao Qiu Jan 2006

Design Issues Of Reserved Delivery Subnetworks, Doctoral Dissertation, May 2006, Ruibiao Qiu

All Computer Science and Engineering Research

The lack of per-flow bandwidth reservation in today's Internet limits the quality of service that an information service provider can provide. This dissertation introduces the reserved delivery subnetwork (RDS), a mechanism that provides consistent quality of service by implementing aggregate bandwidth reservation. A number of design and deployment issues of RDSs are studied. First, the configuration problem of a single-server RDS is formulated as a minimum concave cost network flow problem, which properly reflects the economy of bandwidth aggregation, but is also an NP-hard problem. To make the RDS configuration problem tractable, an efficient approximation heuristic, largest demands first (LDF), …

Go to article

A Theory Of Load Adjustments And Its Implications For Congestion Control, Sergey Gorinsky, Manfred Georg, Maxim Podlesny, Christoph Jechlitschek Jan 2006

A Theory Of Load Adjustments And Its Implications For Congestion Control, Sergey Gorinsky, Manfred Georg, Maxim Podlesny, Christoph Jechlitschek

All Computer Science and Engineering Research

Multiplicative Increase (MI), Additive Increase (AI), and Multiplicative Decrease (MD) are linear adjustments used extensively in networking. However, their properties are not fully understood. We analyze responsiveness (time for the total load to reach the target load), smoothness (maximal size of the total load oscillations after reaching the target load), fairing speed (speed of convergence to equal individual loads) and scalabilities of MAIMD algorithms, which generalize AIMD algorithms via optional inclusion of MI. We prove that an MAIMD can provide faster asymptotic fairing than a less smooth AIMD. Furthermore, we discover that loads under a specific MAIMD converge from any …

Go to article

Perceptually Meaningful Image Editing: Depth, Reynold J. Bailey, Cindy Grimm Jan 2006

Perceptually Meaningful Image Editing: Depth, Reynold J. Bailey, Cindy Grimm

All Computer Science and Engineering Research

We introduce the concept of perceptually meaningful image editing and present two techniques for manipulating the apparent depth of objects in an image. The user loads an image, selects an object and specifies whether the object should appear closer or further away. The system automatically determines target values for the object and/or background that achieve the desired depth change. These depth editing operations, based on techniques used by traditional artists, manipulate either the luminance or color temperature of different regions of the image. By performing blending in the gradient domain and reconstruction with a Poisson solver, the appearance of false …

Go to article

Towards A Unified Radio Power Management Architecture For Wireless Sensor Networks, Kevin Klues, Guoliang Xing, Chenyang Lu Jan 2006

Towards A Unified Radio Power Management Architecture For Wireless Sensor Networks, Kevin Klues, Guoliang Xing, Chenyang Lu

All Computer Science and Engineering Research

In many wireless sensor networks, energy is an extremely limited resource. While many different power management strategies have been proposed to help reduce the amount of energy wasted, application developers still face two fundamental challenges when developing systems with stringent power constraints. First, existing power management strategies are usually tightly coupled with network protocols and other system functionality. This monolithic approach has led to standalone solutions that cannot easily be reused or extended to other applications or platforms. Second, different power management strategies make different and sometimes even conflicting assumptions about the rest of the system with which they need …

Go to article

Design And Evaluation Of A Blast Ungapped Extension Accelerator, Master's Thesis, Joseph M. Lancaster Jan 2006

Design And Evaluation Of A Blast Ungapped Extension Accelerator, Master's Thesis, Joseph M. Lancaster

All Computer Science and Engineering Research

The amount of biosequence data being produced each year is growing exponentially. Extracting useful information from this massive amount of data is becoming an increasingly difficult task. This thesis focuses on accelerating the most widely-used software tool for analyzing genomic data, BLAST. This thesis presents Mercury BLAST, a novel method for accelerating searches through massive DNA databases. Mercury BLAST takes a streaming approach to the BLAST computation by offloading the performance-critical sections onto reconfigurable hardware. This hardware is then used in combination with the processor of the host system to deliver BLAST results in a fraction of the time of …

Go to article

A View-Based Deformation Tool-Kit, Master's Thesis, August 2006, Nisha Sudarsanam Jan 2006

A View-Based Deformation Tool-Kit, Master's Thesis, August 2006, Nisha Sudarsanam

All Computer Science and Engineering Research

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 view is not sufficient. Instead, a composite view built from …

Go to article

Dynamic Conflict-Free Query Scheduling For Wireless Sensor Networks, Octav Chipara, Chenyang Lu, John Stankovic Jan 2006

Dynamic Conflict-Free Query Scheduling For Wireless Sensor Networks, Octav Chipara, Chenyang Lu, John Stankovic

All Computer Science and Engineering Research

With the emergence of high data rate sensor network applications, there is an increasing demand for high-performance query services in such networks. To meet this challenge, we present Dynamic Conflict-free Query Scheduling (DCQS), a novel scheduling technique for queries in wireless sensor networks. In contrast to earlier TDMA protocols designed for general-purpose networks and workloads, DCQS is specifically designed for query services supporting in-network data aggregation. DCQS has several important features. First, it optimizes the query performance and energy efficiency by exploiting the temporal properties and precedence constraints introduced by data aggregation. Second, it can efficiently adapt to dynamic workloads …

Go to article

Activepdf-Toolk, Washington University In St. Louis Computer Science Engineering Department Jan 2006

Activepdf-Toolk, Washington University In St. Louis Computer Science Engineering Department

All Computer Science and Engineering Research

This document provides information for deploying activePDF Toolkit Professional in a development environment. This document is organized into four sections: Getting Started, Tutorials, Technical Reference and the Toolkit Appendices. The Getting Started section covers setup and installation, includes a product overview and information related to operating Toolkit Professional. Tutorials includes examples of many Toolkit features, including PDF generation and form filling. All of the tutorials can be used with activePDF Toolkit. Technical Reference provides detailed information on Toolkit’s objects, subobjects, methods and properties.

Go to article

Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman Dec 2005

Architecture And Execution Model For A Survivable Workflow Transaction Infrastructure, Haraldur D. Thorvaldsson, Kenneth J. Goldman

All Computer Science and Engineering Research

We present a novel architecture and execution model for an infrastructure supporting fault-tolerant, long-running distributed applications spanning multiple administrative domains. Components for both transaction processing and persistent state are replicated across multiple servers, en-suring that applications continue to function correctly de-spite arbitrary (Byzantine) failure of a bounded number of servers. We give a formal model of application execution, based on atomic execution steps, linearizability and a sep-aration between data objects and transactions that act on them. The architecture is designed for robust interoperability across domains, in an open and shared Internet computing infrastructure. A notable feature supporting cross-domain applications is …

Go to article

First Prev Next Last