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

Computer Engineering Commons

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

2009

Discipline
Institution
Keyword
Publication
Publication Type

Articles 421 - 450 of 545

Full-Text Articles in Computer Engineering

Supercharged Planetlab Platform Architecture, Jonathan Turner, Patrick Crowley, John Dehart, Mart Haitjema, Fred Kuhns Kuhns, Ritun Patney, Michael Wilson, Charlie Wiseman, David Zar Jan 2009

Supercharged Planetlab Platform Architecture, Jonathan Turner, Patrick Crowley, John Dehart, Mart Haitjema, Fred Kuhns Kuhns, Ritun Patney, Michael Wilson, Charlie Wiseman, David Zar

All Computer Science and Engineering Research

This report describes the Supercharged Planetlab Platform (SPP), a system designed as a prototype of an internet-scale overlay hosting platform. Overlay networks have become an important vehicle for delivering Internet applications. Overlay network nodes are typically implemented using general purpose servers or clusters. The SPP offers a more integrated architecture, combining general-purpose servers with high performance Network Processor (NP) subsystems. SPP nodes have recently been deployed as part of the Global Environment for Network Innovation (GENI) and are available for use by research users.


Submodular Utility Optimization In Sensor Networks For Capacity Constraints, You Xu, Yixin Chen, Chenyang Lu, Sangeeta Bhattacharya, Abu Saifullah Jan 2009

Submodular Utility Optimization In Sensor Networks For Capacity Constraints, You Xu, Yixin Chen, Chenyang Lu, Sangeeta Bhattacharya, Abu Saifullah

All Computer Science and Engineering Research

With the fast development of wireless sensor network (WSN) technologies, WSNs have widely shifted from a specialized platform for a single application to an integrated infrastructure supporting multiple applications. It is hence a critical problem to allocate multiple applications to multiple sensors in order to maximize user utility subject to various resource constraints. The resulting constrained optimization problem is difficult since it is discrete, nonlinear, and not in closed-form. In this report, we develop an efficient optimization algorithm with rigorous approximation bounds for submodular monotonic optimization with multiple knapsack constraints. Based on a variance reduction formulation, we prove several important …


Feedback Thermal Control For Real-Time Systems, Yong Fu, Nicholas Kottenstette, Yingming Chen, Chenyang Lu, Xenofon D. Koutsoukos, Hongan Wang Jan 2009

Feedback Thermal Control For Real-Time Systems, Yong Fu, Nicholas Kottenstette, Yingming Chen, Chenyang Lu, Xenofon D. Koutsoukos, Hongan Wang

All Computer Science and Engineering Research

Thermal control is crucial to real-time systems as excessive processor temperature can cause system failure or unacceptable performance degradation due to hardware throttling. Real-time systems face significant challenges in thermal management as they must avoid processor overheating while still delivering desired real-time performance. Furthermore, many real-time systems must handle a broad range of uncertainties in system and environmental conditions. To address these challenges, this paper presents Thermal Control under Utilization Bound (TCUB), a novel thermal control algorithm specifically designed for real-time systems. TCUB employs a feedback control loop that dynamically controls both processor temperature and CPU utilization through task rate …


The Design And Performance Of Cyber-Physical Middleware For Real-Time Hybrid Structural Testing, Huang-Ming Huang, Xiuyu Gao, Terry Tidewell, Christopher Gill Jan 2009

The Design And Performance Of Cyber-Physical Middleware For Real-Time Hybrid Structural Testing, Huang-Ming Huang, Xiuyu Gao, Terry Tidewell, Christopher Gill

All Computer Science and Engineering Research

Real-time hybrid testing of civil structures, in which computational models and physical components must be integrated with high fidelity at run-time represents a grand challenge in the emerging area of cyber-physical systems. Actuator dynamics, complex interactions among computers and physical components, and computation and communication delays all must be managed carefully to achieve accurate tests. To address these challenges, we have developed a novel middleware for integrating cyber and physical components flexibly and with suitable timing behavior within a Cyber-physical Instrument for Real-time hybrid Structural Testing (CIRST). This paper makes three main contributions to the state of the art in …


Achieving Coordination Through Dynamic Construction Of Open Workflows ** Please See Wucse-2009-14 **, Louis Thomas, Justin Luner, Grui-Catalin Roman, Christopher Gill Jan 2009

Achieving Coordination Through Dynamic Construction Of Open Workflows ** Please See Wucse-2009-14 **, Louis Thomas, Justin Luner, Grui-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

Workflows, widely used on the Internet today, typically consist of a graph-like structure that defines the orchestration rules for executing a set of tasks, each of which is matched at run-rime to a corresponding service. The graph is static, specialized directories enable the discovery of services, and the wired infrastructure supports routing of results among tasks. In this paper we introduce a radically new paradigm for workflow construction and execution called open workflow. It is motivated by the growing reliance on wireless ad hoc networks in settings such as emergency response, field hospitals, and military operations. Open workflows facilitate goal-directed …


Design And Evaluation Of A Practical, High Performance Crossbar Scheduler, Jonathan Turner Jan 2009

Design And Evaluation Of A Practical, High Performance Crossbar Scheduler, Jonathan Turner

All Computer Science and Engineering Research

The Least Occupied Output First (LOOFA) scheduler is one of several unbuffered crossbar schedulers that provides strong performance guarantees when operated with a speedup of 2 or more. Because LOOFA requires the computation of a maximal matching, it has been considered too slow for use in systems with link rates of 10 Gb/s or more. This paper studies an approximate variant of LOOFA described briefly in [16]. We introduce a general family of schedulers that allows for partial sorting and that includes the LOOFA scheduler as a special case. We show that all schedulers in this class are work-conserving and …


Enabling A Low-Delay Internet Service Via Built-In Performance Incentives, Maxim Podlesny, Sergey Gorinsky Jan 2009

Enabling A Low-Delay Internet Service Via Built-In Performance Incentives, Maxim Podlesny, Sergey Gorinsky

All Computer Science and Engineering Research

The single best-effort service of the Internet struggles to accommodate divergent needs of different distributed applications. Numerous alternative network architectures have been proposed to offer diversified network services. These innovative solutions failed to gain wide deployment primarily due to economic and legacy issues rather than technical shortcomings. Our paper presents a new simple paradigm for network service differentiation that accounts explicitly for the multiplicity of Internet service providers and users as well as their economic interests in environments with partly deployed new services. Our key idea is to base the service differentiation on performance itself, rather than price. We design …


Partial Order Based Reduction In Planning: A Unifying Theory And New Algorithms, You Xi, Yixin Chen Jan 2009

Partial Order Based Reduction In Planning: A Unifying Theory And New Algorithms, You Xi, Yixin Chen

All Computer Science and Engineering Research

Partial order based reduction (POR) has recently attracted research in planning. POR algorithms reduce search space by recognizing interchangable orders between actions and expanding only a subset of all possible orders during the search. POR has been extensively studied in model checking and proved to be an enabling technique for reducing the search space and costs. Recently, two POR algorithms, including the expansion core (EC) and stratified planning (SP) algorithms, have been proposed. Being orthogonal to the development of accurate heuristic functions, these reduction methods show great potential to improve the planning efficiency from a new perspective. However, it is …


On Unusual Pixel Shapes And Image Motion, Nathan Jacobs, Stephen Schuh, Robert Pless Jan 2009

On Unusual Pixel Shapes And Image Motion, Nathan Jacobs, Stephen Schuh, Robert Pless

All Computer Science and Engineering Research

We introduce the integral-pixel camera model, where measurements integrate over large and potentially overlapping parts of the visual field. This models a wide variety of novel camera designs, including omnidirectional cameras, compressive sensing cameras, and novel programmable-pixel imaging chips. We explore the relationship of integral-pixel measurements with image motion and find (a) that direct motion estimation using integral-pixels is possible and in some cases quite good, (b) standard compressive-sensing reconstructions are not good for estimating motion, and (c) when we design image reconstruction algorithms that explicitly reason about image motion, they outperform standard compressive-sensing video reconstruction. We show experimental results …


A Simple Algorithm For Triconnectivity Of A Multigraph, Abusayeed Saifullah, Alper Ungor Jan 2009

A Simple Algorithm For Triconnectivity Of A Multigraph, Abusayeed Saifullah, Alper Ungor

All Computer Science and Engineering Research

Vertex-connectivity and edge-connectivity represent the extent to which a graph is connected. Study of these key properties of graphs plays an important role in varieties of computer science applications. Recent years have witnessed a number of linear time 3-edge-connectivity algorithms - with increasing simplicity. In contrast, the state-of-the-art algorithm for 3-vertex-connectivity due to Hopcroft and Tarjan lacks the simplicity in the sense of ease of implementation as well as the number of passes over the graph although its time and space complexity is theoretically linear. In this paper, we propose a linear time reduction from 3-vertex-connectivity to 3-edge- connectivity of …


Defending Against Distributed Denial-Of-Service Attacks With Weight-Fair Router Throttling, Abusayeed Saifullah Jan 2009

Defending Against Distributed Denial-Of-Service Attacks With Weight-Fair Router Throttling, Abusayeed Saifullah

All Computer Science and Engineering Research

A high profile internet server is always a target of denial-of-service attacks. In this paper, we propose a novel technique for protecting an internet server from distributed denial-of-service attacks. The defense mechanism is based on a distributed algorithm that performs weight-fair throttling at the upstream routers. The throttling is weight-fair because the traffics destined for the server are controlled increased or decreased ) by the leaky-buckets at the routers based on the number of users connected, directly or through other routers, to each router. To the best of our knowledge, this is the first weight-fair technique for saving an internet …


Architectures For The Future Networks And The Next Generation Internet: A Survey, Subharthi Paul, Jianli Pan, Raj Jain Jan 2009

Architectures For The Future Networks And The Next Generation Internet: A Survey, Subharthi Paul, Jianli Pan, Raj Jain

All Computer Science and Engineering Research

Networking research funding agencies in the USA, Europe, Japan, and other countries are encouraging research on revolutionary networking architectures that may or may not be bound by the restrictions of the current TCP/IP based Internet. We present a comprehensive survey of such research projects and activities. The topics covered include various testbeds for experimentations for new architectures, new security mechanisms, content delivery mechanisms, management and control frameworks, service architectures, and routing mechanisms. Delay/Disruption tolerant networks, which allow communications even when complete end-to-end path is not available, are also discussed.


Scalable Scheduling Policy Design For Open Soft Real-Time Systems, Robert Glaubius, Terry Tidewell, Braden Sidoti, David Pilla, Justin Meden, Christopher Gill, William D. Smart Jan 2009

Scalable Scheduling Policy Design For Open Soft Real-Time Systems, Robert Glaubius, Terry Tidewell, Braden Sidoti, David Pilla, Justin Meden, Christopher Gill, William D. Smart

All Computer Science and Engineering Research

Open soft real-time systems, such as mobile robots, must respond adaptively to varying operating conditions, while balancing the need to perform multiple mission specific tasks against the requirement that those tasks complete in a timely manner. Setting and enforcing a utilization target for shared resources is a key mechanism for achieving this behavior. However, because of the uncertainty and non-preemptability of some tasks, key assumptions of classical scheduling approaches do not hold. In previous work we presented foundational methods for generating task scheduling policies to enforce proportional resource utilization for open soft real-time systems with these properties. However, these methods …


Scheduling Design With Unknown Execution Time Distributions Or Modes, Robert Glaubius, Terry Tidwell, Christopher Gill, William D. Smart Jan 2009

Scheduling Design With Unknown Execution Time Distributions Or Modes, Robert Glaubius, Terry Tidwell, Christopher Gill, William D. Smart

All Computer Science and Engineering Research

Open soft real-time systems, such as mobile robots, experience unpredictable interactions with their environments and yet must respond both adaptively and with reasonable temporal predictability. Because of the uncertainty inherent in such interactions, many of the assumptions of the real-time scheduling techniques traditionally used to ensure predictable timing of system actions do not hold in those environments. In previous work we have developed novel techniques for scheduling policy design where up-front knowledge of execution time distributions can be used to produce both compact representations of resource utilization state spaces and efficient optimal scheduling policies over those state spaces. This paper …


Enhanced Coordination In Sensor Networks Through Flexible Service Provisioning, Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu Jan 2009

Enhanced Coordination In Sensor Networks Through Flexible Service Provisioning, Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu

All Computer Science and Engineering Research

Heterogeneous wireless sensor networks represent a challenging programming environment. Servilla addresses this by offering a new middleware framework that provides service provisioning. Using Servilla, developers can construct platform-independent applications over a dynamic set of devices with diverse computational resources and sensors. A salient feature of Servilla is its support for dynamic discovery and binding to local and remote services, which enables flexible and energy-efficient in-network collaboration among heterogeneous devices. Furthermore, Servilla provides a modular middleware architecture that can be easily tailored for devices with a wide range of resources, allowing resource-constrained devices to provide services while leveraging the capabilities of …


Volumeviewer: An Interactive Tool For Fitting Surfaces To Volume Data, Ross Sowell, Lu Liu, Tao Ju, Cindy Grimm, Christopher Abraham, Garima Gokhroo, D Low Jan 2009

Volumeviewer: An Interactive Tool For Fitting Surfaces To Volume Data, Ross Sowell, Lu Liu, Tao Ju, Cindy Grimm, Christopher Abraham, Garima Gokhroo, D Low

All Computer Science and Engineering Research

Recent advances in surface reconstruction algorithms allow surfaces to be built from contours lying on non-parallel planes. Such algorithms allow users to construct surfaces of similar quality more efficiently by using a small set of oblique contours, rather than many parallel contours. However, current medical imaging systems do not provide tools for sketching contours on oblique planes. In this paper, we take the first steps towards bridging the gap between the new surface reconstruction technologies and putting those methods to use in practice. We develop a novel interface for modeling surfaces from volume data by allowing the user to sketch …


Robust Sensor Networks In Homes Via Reactive Channel Hopping, Mo Sha, Greg Hackmann, Chenyang Lu Jan 2009

Robust Sensor Networks In Homes Via Reactive Channel Hopping, Mo Sha, Greg Hackmann, Chenyang Lu

All Computer Science and Engineering Research

Home area networks (HANs) consisting of wireless sensors have emerged as the enabling technology for important applications such as smart energy and assisted living. A key challenge faced in deploying robust wireless sensor networks (WSNs) for home automation applications is the need to provide long-term, reliable operation in the face of the varied sources of interference found in typical residential settings. To better understand the channel dynamics in these environments, we performed an in-depth empirical study of the performance of HANs in ten real-life apartments. Our empirical study leads to several key insights into designing robust HANs for residential environments. …


Open Workflows: Context-Dependent Construction And Execution In Mobile Wireless Settings, Louis Thomas, Justin Wilson, Grui-Catalin Roman, Christopher Gill Jan 2009

Open Workflows: Context-Dependent Construction And Execution In Mobile Wireless Settings, Louis Thomas, Justin Wilson, Grui-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

Existing workflow middleware executes tasks orchestrated by rules defined in a carefully handcrafted static graph. Workflow management systems have proved effective for service-oriented business automation in stable, wired infrastructures. We introduce a radically new paradigm for workflow construction and execution called open workflow to support goal-directed coordination among physically mobile people and devices that form a transient community over an ad hoc wireless network. The quintessential feature of the open workflow paradigm is dynamic construction and execution of custom, context-specific workflows in response to unpredictable and evolving circumstances by exploiting the knowledge and services available within a given spatiotemporal context. …


Escudo: A Fine-Grained Protection Model For Web Browsers, Karthick Jayaraman, Wenliang Du, Balamurugan Rajagopalan, Steve J. Chapin Jan 2009

Escudo: A Fine-Grained Protection Model For Web Browsers, Karthick Jayaraman, Wenliang Du, Balamurugan Rajagopalan, Steve J. Chapin

Electrical Engineering and Computer Science - All Scholarship

Web applications are no longer simple hyperlinked documents. They have progressively evolved to become highly complex---web pages combine content from several sources (with varying levels of trustworthiness), and incorporate significant portions of client-side code. However, the prevailing web protection model, the same-origin policy, has not adequately evolved to manage the security consequences of this additional complexity. As a result, web applications have become attractive targets of exploitation. We argue that this disconnection between the protection needs of modern web applications and the protection models used by web browsers that manage those applications amounts to a failure of access control. In …


A Cryptanalysis Methodology For The Reverse Engineering Of Encrypted Information In Images, Allan Anthony Rwabutaza Jan 2009

A Cryptanalysis Methodology For The Reverse Engineering Of Encrypted Information In Images, Allan Anthony Rwabutaza

Browse all Theses and Dissertations

Security is an important issue related to the storage and communication of data and information. In data and information security, cryptography and steganography are two of the most common security techniques. On one hand, there is cryptography, which is the secret communication between two parties by message scrambling on the sender's side and message unscrambling on the receiver's side so that only the intended receiver gets the secret message. On the other hand, there is steganography, which is the hiding of information in a medium in such a way that no one other than the sender or the intended receiver …


New Model Of Productive Online Discussion And Its Implications For Research And Instruction, Fei Gao, Charles Xiaoxue Wang, Yanling Sun Jan 2009

New Model Of Productive Online Discussion And Its Implications For Research And Instruction, Fei Gao, Charles Xiaoxue Wang, Yanling Sun

Visual Communications and Technology Education Faculty Publications

We develop a new model of productive online discussion based on a brief review of research literature on online discussion. As compared to previous discussion models, the new model provides a more systematic and comprehensive framework to understand how learning occurs through online discussion. Based on the new model, we propose several directions for research on improving the quality of online discussion and learning.


Contextualizing Observational Data For Modeling Human Performance, Viet Trinh Jan 2009

Contextualizing Observational Data For Modeling Human Performance, Viet Trinh

Electronic Theses and Dissertations

This research focuses on the ability to contextualize observed human behaviors in efforts to automate the process of tactical human performance modeling through learning from observations. This effort to contextualize human behavior is aimed at minimizing the role and involvement of the knowledge engineers required in building intelligent Context-based Reasoning (CxBR) agents. More specifically, the goal is to automatically discover the context in which a human actor is situated when performing a mission to facilitate the learning of such CxBR models. This research is derived from the contextualization problem left behind in Fernlund's research on using the Genetic Context Learner …


An Architecture For High-Performance Privacy-Preserving And Distributed Data Mining, James Secretan Jan 2009

An Architecture For High-Performance Privacy-Preserving And Distributed Data Mining, James Secretan

Electronic Theses and Dissertations

This dissertation discusses the development of an architecture and associated techniques to support Privacy Preserving and Distributed Data Mining. The field of Distributed Data Mining (DDM) attempts to solve the challenges inherent in coordinating data mining tasks with databases that are geographically distributed, through the application of parallel algorithms and grid computing concepts. The closely related field of Privacy Preserving Data Mining (PPDM) adds the dimension of privacy to the problem, trying to find ways that organizations can collaborate to mine their databases collectively, while at the same time preserving the privacy of their records. Developing data mining algorithms for …


Variable Resolution & Dimensional Mapping For 3d Model Optimization, Joseph Venezia Jan 2009

Variable Resolution & Dimensional Mapping For 3d Model Optimization, Joseph Venezia

Electronic Theses and Dissertations

Three-dimensional computer models, especially geospatial architectural data sets, can be visualized in the same way humans experience the world, providing a realistic, interactive experience. Scene familiarization, architectural analysis, scientific visualization, and many other applications would benefit from finely detailed, high resolution, 3D models. Automated methods to construct these 3D models traditionally has produced data sets that are often low fidelity or inaccurate; otherwise, they are initially highly detailed, but are very labor and time intensive to construct. Such data sets are often not practical for common real-time usage and are not easily updated. This thesis proposes Variable Resolution & Dimensional …


Quantifying Network Reliability Through Finding An Upper Bound For Graph Integrity Using Graph Coloring, Ian Burchett Jan 2009

Quantifying Network Reliability Through Finding An Upper Bound For Graph Integrity Using Graph Coloring, Ian Burchett

Mahurin Honors College Capstone Experience/Thesis Projects

Integrity of a graph is defined as 𝐺 = 𝑚𝑖𝑛𝑆⊆𝑉(𝐺){ 𝑆 + 𝑚 𝐺 − 𝑆 } , where G is a graph with vertex set V and m(G-S) denotes the order of the largest component of G - S. This provides an upper estimate of the integrity of the given graph. Using graph coloring, the color sequence of the graph can be generated, with the leading term being the largest component of the graph, the maximal independent set. The determination of the set is too time intensive to be feasible for moderate to large graphs, since there is no …


Improving Knowledge Sharing In An Open Informal Network: Knowledge Management In Open Coffee, Adrian Mihai Jan 2009

Improving Knowledge Sharing In An Open Informal Network: Knowledge Management In Open Coffee, Adrian Mihai

Dissertations

The 21st century opened a new era in communications bringing in faster, more efficient and more advanced information and communication technologies than ever. New ideas and innovations, as well as interactions and collaborations determine the landscape of knowledge and consequently add new requirements to the know-how. The creators of knowledge and design add new communication architecture bodies through the use of technology.

Meanwhile knowledge management inspires 21st century enterprises to adopt new learning patterns throughout organisations and adopt new ideas. However, internal sharing mechanisms leverage a trusted environment where people can engage freely and securely in sharing knowledge and feel …


Telecommunications Liberalisation In Africa: Proposed Regulatory Model For The Sadc Region, Z. N. Jobodwana Jan 2009

Telecommunications Liberalisation In Africa: Proposed Regulatory Model For The Sadc Region, Z. N. Jobodwana

Journal of Digital Forensics, Security and Law

The liberalisation of the telecommunication industry in Africa, and the further development of the region’s physical infrastructure was accompanied by the further development of Africa’s information, communication and technology infrastructure. Competition within the industry stimulated heavy economic investment in other sectors of the economy. The outcome of liberalisation also included the establishment of community-based structures that continue to enable communities to manage their own development and gain access to information and communication technologies (ICTs) in an unprecedented manner. The telecommunication infrastructure further stimulated the fast development of other related services, for example, ecommerce and mobile commerce (m-commerce), e-government, internet banking, …


Agents And Service-Oriented Computing For Autonomic Computing: A Research Agenda, Frances M.T. Brazier, Jeffrey O. Kephart, H. Van Dyke Parunak, Michael N. Huhns Jan 2009

Agents And Service-Oriented Computing For Autonomic Computing: A Research Agenda, Frances M.T. Brazier, Jeffrey O. Kephart, H. Van Dyke Parunak, Michael N. Huhns

Faculty Publications

Autonomic computing is the solution proposed to cope with the complexity of today's computing environments. Self-management, an important element of autonomic computing, is also characteristic of single and multiagent systems, as well as systems based on service-oriented architectures. Combining these technologies can be profitable for all - in particular, for the development of autonomic computing systems.


Applications Of Swarm, Evolutionary And Quantum Algorithms In System Identification And Digital Filter Design, Bipul Luitel Jan 2009

Applications Of Swarm, Evolutionary And Quantum Algorithms In System Identification And Digital Filter Design, Bipul Luitel

Masters Theses

"The thesis focuses on the application of computational intelligence (CI) techniques for two problems - system identification and digital filter design. In system identification, different case studies have been carried out with equal or reduced number of orders as the original system and also in identifying a blackbox model. Lowpass, Highpass, Bandpass and Bandstop FIR and Lowpass IIR filters have been designed using three algorithms using two different fitness functions. Particle Swarm Optimization (PSO), Differential Evolution based PSO (DEPSO) and PSO with Quantum Infusion (PSO-QI) algorithms have been applied in this work"--Abstract, page iii.


Functional Testing Of Faults In Asynchronous Crossbar Architecture, Sriram Venkateswaran Jan 2009

Functional Testing Of Faults In Asynchronous Crossbar Architecture, Sriram Venkateswaran

Masters Theses

"The challenge of extending Moore's Law past the physical limits of the present semiconductor technology calls for novel innovations. Several novel nanotechnologies are being proposed as an alternative to their CMOS counterparts, with nanowire crossbar being one of the most promising paradigms. Quite recently, a new promising clock-free architecture, called the Asynchronous Crossbar Architecture has been proposed to enhance the manufacturability and to improve the robustness of digital circuits by removing various timing related failure modes. Even though the proposed clock-free architecture offers several merits, it is not free from the high defect rates induced due to nondeterministic nanoscale assembly. …