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

Engineering Commons™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 15541 - 15570 of 17312

Full-Text Articles in Engineering

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 …


A Thesis On Sketch-Based Techniques For Mesh Deformation And Editing, Raquel Bujans Jan 2006

A Thesis On Sketch-Based Techniques For Mesh Deformation And Editing, Raquel Bujans

All Computer Science and Engineering Research

The goal of this research is to develop new and more intuitive ways for editing a mesh from a static camera angle. I present two ways to edit a mesh via a simple sketching system. The first method is a gray-scale editor which allows the user to specify a fall off function for the region being deformed. The second method is a profile editor in which the user can re-sketch a mesh’s profile. Lastly, the types of edits possible will be discussed and our results will be presented.


Unified Power Management In Wireless Sensor Networks, Doctoral Dissertation, August 2006, Guoliang Xing Jan 2006

Unified Power Management In Wireless Sensor Networks, Doctoral Dissertation, August 2006, Guoliang Xing

All Computer Science and Engineering Research

Radio power management is of paramount concern in wireless sensor networks (WSNs) that must achieve long lifetimes on scarce amount of energy. Previous work has treated communication and sensing separately, which is insufficient for a common class of sensor networks that must satisfy both sensing and communication requirements. Furthermore, previous approaches focused on reducing energy consumption in individual radio states resulting in suboptimal solutions. Finally, existing power management protocols often assume simplistic models that cannot accurately reflect the sensing and communication properties of real-world WSNs. We develop a unified power management approach to address these issues. We first analyze the …


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

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

All Computer Science and Engineering Research

A challenge for many wireless sensor networks is to remain operational for long periods of time on a very limited power supply. While many power management protocols have been proposed, a solution does not yet exist that allows them to be seamlessly integrated into the existing systems. In this paper we study the architectural support required to resolve this issue. We propose a framework that separates sleep scheduling from the basic MAC layer functionality and provide a set of unified interfaces between them. This framework enables different sleep scheduling policies to be easily implemented on top of multiple MAC layers. …


Use Of Gene Expression Profiling And Machine Learning To Understand And Predict Primary Graft Dysfunction, Monika Ray, Sekhar Dharmarajan, Johannes Freudenberg, Weixiong Zhang, Alexander G. Patterson Jan 2006

Use Of Gene Expression Profiling And Machine Learning To Understand And Predict Primary Graft Dysfunction, Monika Ray, Sekhar Dharmarajan, Johannes Freudenberg, Weixiong Zhang, Alexander G. Patterson

All Computer Science and Engineering Research

No abstract provided.


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 …


Extending Byzantine Fault Tolerance To Replicated Clients, Ian Wehrman, Sajeeva L. Pallemulle, Kenneth J. Goldman Jan 2006

Extending Byzantine Fault Tolerance To Replicated Clients, Ian Wehrman, Sajeeva L. Pallemulle, Kenneth J. Goldman

All Computer Science and Engineering Research

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 fault-tolerant execution of long-running distributed applications in which replicated deterministic …


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 …


A Dyadic Composition To Foster Virtual Team Effectiveness: An Experimental Study, Gamze Karayaz Jan 2006

A Dyadic Composition To Foster Virtual Team Effectiveness: An Experimental Study, Gamze Karayaz

Engineering Management & Systems Engineering Theses & Dissertations

The importance of effectiveness for virtual teamwork continues to gain momentum as technology and globalization of work accelerate. The implementation of virtual teams provides one approach to enhance competitiveness, overcoming the disadvantages of space and time differences through collaborative technologies. The influence of structure to virtual team performance has not been clearly established in the literature. The purpose of this research study was to investigate the effectiveness of a dyad structured approach for virtual teams using a quasi-experimental research design.

This research investigated four questions related to the influence of structure on virtual team effectiveness related to task performance, communication …


Limit Crossing For Decision Problems, Sharlee Climer, Weixiong Zhang Jan 2006

Limit Crossing For Decision Problems, Sharlee Climer, Weixiong Zhang

All Computer Science and Engineering Research

Limit crossing is a methodology in which modified versions of a problem are solved and compared, yielding useful information about the original problem. Pruning rules that are used to exclude portions of search trees are excellent examples of the limit-crossing technique. In our previous work, we examined limit crossing for optimization problems. In this paper, we extend this methodology to decision problems. We demonstrate the use of limit crossing in our design of a tool for identifying K-SAT backbones. This tool is guaranteed to identify all of the backbone variables by solving at most n+1 formulae, where n is the …


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 …


Virtualizing Network Processors, Ben Wun, Jonathan Turner, Patrick Crowley Jan 2006

Virtualizing Network Processors, Ben Wun, Jonathan Turner, Patrick Crowley

All Computer Science and Engineering Research

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 allows multiple virtual routers to run on multiple data plane …


A Proposed Architecture For The Geni Backbone Platform, Jonathan Turner Jan 2006

A Proposed Architecture For The Geni Backbone Platform, Jonathan Turner

All Computer Science and Engineering Research

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 architecture in order to provide a concrete example for how …


Agilla: A Mobile Agent Middleware For Sensor Networks, Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu Jan 2006

Agilla: A Mobile Agent Middleware For Sensor Networks, Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu

All Computer Science and Engineering Research

Agilla is a mobile agent middleware for sensor networks. Mobile agents are special processes that can migrate across sensors. They increase network flexibility by enabling active in-network reprogramming. Neighbor lists and tuple spaces are used for agent coordination. Agilla was originally implemented on Mica2 motes, but has been ported to other platforms. Its Mica2 implementation consumes 41.6KB of code and 3.59KB of data memory. Agents can move five hops in less than 1.1s with over 92% success. Agilla was used to develop multiple applications related to fire detection and tracking, cargo container monitoring, and robot navigation.


Acceleration Of Profile-Hmm Search For Protein Sequences In Reconfigurable Hardware - Master's Thesis, May 2006 , Rahul Pratap Maddimsetty Jan 2006

Acceleration Of Profile-Hmm Search For Protein Sequences In Reconfigurable Hardware - Master's Thesis, May 2006 , Rahul Pratap Maddimsetty

All Computer Science and Engineering Research

Profile Hidden Markov models are highly expressive representations of functional units, or motifs, conserved across protein sequences. Profile-HMM search is a powerful computational technique that is used to annotate new sequences by identifying occurrences of known motifs in them. With the exponential growth of protein databases, there is an increasing demand for acceleration of such techniques. We describe an accelerator for the Viterbi algorithm using a two-stage pipelined design in which the first stage is implemented in parallel reconfigurable hardware for greater speedup. To this end, we identify algorithmic modifications that expose a high level of parallelism and characterize their …


Fair Efficiency, Or Low Average Delay Without Starvation, Christoph Jechlitschek, Sergey Gorinksky Jan 2006

Fair Efficiency, Or Low Average Delay Without Starvation, Christoph Jechlitschek, Sergey Gorinksky

All Computer Science and Engineering Research

Elastic applications are primarily interested in minimal delay achievable for their messages under current network load. In this paper, we investigate how to transmit such messages over a bottleneck link efficiently and fairly.


The Meta-Theory Of Q_0 In The Calculus Of Inductive Constructions, Master's Thesis, May 2006, Li-Yang Tan Jan 2006

The Meta-Theory Of Q_0 In The Calculus Of Inductive Constructions, Master's Thesis, May 2006, Li-Yang Tan

All Computer Science and Engineering Research

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 context is assumed on the part of the reader. While …


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.


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 …


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 …


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 …


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 …


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, …


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 …


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 …


Design Of Routers For Diversified Networks, Jonathan Turner Jan 2006

Design Of Routers For Diversified Networks, Jonathan Turner

All Computer Science and Engineering Research

No abstract provided.


An Internet Based Intelligent Argumentation System For Collaborative Engineering Design, Xiaoqing Frank Liu, Samir Raorane, Man Zheng, Ming-Chuan Leu Jan 2006

An Internet Based Intelligent Argumentation System For Collaborative Engineering Design, Xiaoqing Frank Liu, Samir Raorane, Man Zheng, Ming-Chuan Leu

Computer Science Faculty Research & Creative Works

Modern product design is a very complicated process which involves groups of designers, manufacturers, suppliers, and customer representatives. Conflicts are unavoidable in collaboration among multiple stakeholders, who have different objectives, requirements, and priorities. Unfortunately, current web-based collaborative engineering design systems do not support collaborative conflict resolution. In this paper, we will develop an intelligent computational argumentation model to enable management of a large scale argumentation network, and resolution of conflicts based on argumentation from many participants. A web-based intelligent argumentation tool is developed as a part of a web-based collaborative engineering design system based on the above model to resolve …


The Influence Of Quantization Process On The Performance Of Global Entropic Thresholding Algorithms Using Electrical Capacitance Tomography Data, A. J. Mwambela Dec 2005

The Influence Of Quantization Process On The Performance Of Global Entropic Thresholding Algorithms Using Electrical Capacitance Tomography Data, A. J. Mwambela

Tanzania Journal of Science

In measuring component fraction in multiphase flows using tomographic techniques, it is desirable to use a high speed tomography system capable of generating 100 tomograms per second. The electrical capacitance tomography system in this regard is considered to be the best among the available tomographic techniques. However, due to its inherent limitations the system generates distorted reconstructed tomograms necessitating the use of extra signal processing techniques such as thresholding to minimize these distortions. Whilst thresholding technique has been effective in minimizing distortions, the additional computation associated with the process limits the speed of tomogram generation desired from the system. Further, …


Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah Dec 2005

Loss Aware Rate Allocations In H.263 Coded Video Transmissions, Xiao Su, Benjamin Wah

Faculty Publications

For packet video, information loss and bandwidth limitation are two factors that affect video playback quality. Traditional rate allocation approaches have focused on optimizing video quality under bandwidth constraint alone. However, in the best-effort Internet, packets carrying video data are susceptible to losses, which need to be reconstructed at the receiver side. In this paper, we propose loss aware rate allocations in both group-of-block (GOB) level and macroblock level, given that certain packets are lost during transmissions and reconstructed using simple interpolation methods at the receiver side. Experimental results show that our proposed algorithms can produce videos of higher quality …


A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan Dec 2005

A Generic Object-Oriented Tabu Search Framework, Hoong Chuin Lau, Xiaomin Jia, Wee Chong Wan

Research Collection School Of Computing and Information Systems

Presently, most tabu search designers devise their applications without considering the potential of design and code reuse, which consequently prolong the development of subsequent applications. In this paper, we propose a software solution known as Tabu Search Framework (TSF), which is a generic C++ software framework for tabu search implementation. The framework excels in code recycling through the use of a well- designed set of generic abstract classes that clearly define their collaborative roles in the algorithm. Additionally, the framework incorporates a centralized process and control mechanism that enhances the search with intelligence. This results in a generic framework that …