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

Computer Sciences Commons™

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

Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 15361 - 15390 of 17309

Full-Text Articles in Computer Sciences

Video Content Extraction: Scene Segmentation, Linking And Attention Detection, Yun Zhai Jan 2006

Video Content Extraction: Scene Segmentation, Linking And Attention Detection, Yun Zhai

Electronic Theses and Dissertations

In this fast paced digital age, a vast amount of videos are produced every day, such as movies, TV programs, personal home videos, surveillance video, etc. This places a high demand for effective video data analysis and management techniques. In this dissertation, we have developed new techniques for segmentation, linking and understanding of video scenes. Firstly, we have developed a video scene segmentation framework that segments the video content into story units. Then, a linking method is designed to find the semantic correlation between video scenes/stories. Finally, to better understand the video content, we have developed a spatiotemporal attention detection …

Go to article

Real-Time Monocular Vision-Based Tracking For Interactive Augmented Reality, Lisa Spencer Jan 2006

Real-Time Monocular Vision-Based Tracking For Interactive Augmented Reality, Lisa Spencer

Electronic Theses and Dissertations

The need for real-time video analysis is rapidly increasing in today's world. The decreasing cost of powerful processors and the proliferation of affordable cameras, combined with needs for security, methods for searching the growing collection of video data, and an appetite for high-tech entertainment, have produced an environment where video processing is utilized for a wide variety of applications. Tracking is an element in many of these applications, for purposes like detecting anomalous behavior, classifying video clips, and measuring athletic performance. In this dissertation we focus on augmented reality, but the methods and conclusions are applicable to a wide variety …

Go to article

Modeling Autonomous Agents In Military Simulations, Varol Kaptan Jan 2006

Modeling Autonomous Agents In Military Simulations, Varol Kaptan

Electronic Theses and Dissertations

Simulation is an important tool for prediction and assessment of the behavior of complex systems and situations. The importance of simulation has increased tremendously during the last few decades, mainly because the rapid pace of development in the field of electronics has turned the computer from a costly and obscure piece of equipment to a cheap ubiquitous tool which is now an integral part of our daily lives. While such technological improvements make it easier to analyze well-understood deterministic systems, increase in speed and storage capacity alone are not enough when simulating situations where human beings and their behavior are …

Go to article

Formalizing Ontology Alignment And Its Operations With Category Theory, Antoine Zimmermann, Markus Krotzsch, Jerome Euzenat, Pascal Hitzler Jan 2006

Formalizing Ontology Alignment And Its Operations With Category Theory, Antoine Zimmermann, Markus Krotzsch, Jerome Euzenat, Pascal Hitzler

Computer Science and Engineering Faculty Publications

An ontology alignment is the expression of relations between different ontologies. In order to view alignments independently from the language expressing ontologies and from the techniques used for finding the alignments, we use a category-theoretical model in which ontologies are the objects. We introduce a categorical structure, called V-alignment, made of a pair of morphisms with a common domain having the ontologies as codomain. This structure serves to design an algebra that describes formally what are ontology merging, alignment composition, union and intersection using categorical constructions. This enables combining alignments of various provenance. Although the desirable properties of this algebra …

Go to article

Development Of A Service-Oriented Communication Platform For Heterogeneous Voice Over Ip Networks., Aisling O'Driscoll Jan 2006

Development Of A Service-Oriented Communication Platform For Heterogeneous Voice Over Ip Networks., Aisling O'Driscoll

Theses

As broadband services have become more widespread in recent years due to a variety of government initiatives and the establishment of Wireless Internet Service Providers, user requirements have evolved and the market has become more competitive. Whilst this is beneficial for consumers it means that Internet Service Providers must offer a more diverse range of services coupled with standard broadband packages to distinguish themselves from their competitors, generate new revenue and strengthen their competitive advantage. Therefore many providers are looking to Service Oriented Architectures (SOAs) to provide communication platforms, enabling services such as Voice over IP (VoIP) along with other …

Go to article

Decentralized Power Control With Implementation For Rfid Networks, Kainan Cha, Anil Ramachandran, David Pommerenke, Jagannathan Sarangapani Jan 2006

Decentralized Power Control With Implementation For Rfid Networks, Kainan Cha, Anil Ramachandran, David Pommerenke, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In radio frequency identification (RFID) systems, the detection range and read rates will suffer from interference among high power reading devices. This problem grows severely and degrades system performance in dense RFID networks. In this paper, we investigate a suite of feasible power control schemes to ensure overall coverage area of the system while maintaining a desired read rate. The power control scheme and MAC protocol dynamically adjusts the RFID reader power output in response to the interference level seen locally during tag reading for an acceptable signal-to-noise ratio (SNR). We present novel distributed adaptive power control (DAPC) and probabilistic …

Go to article

Distributed Power Control For Cellular Networks In The Presence Of Channel Uncertainties, Maciej Jan Zawodniok, Q. Shang, Jagannathan Sarangapani Jan 2006

Distributed Power Control For Cellular Networks In The Presence Of Channel Uncertainties, Maciej Jan Zawodniok, Q. Shang, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel distributed power control (DPC) scheme for cellular network in the presence of radio channel uncertainties such as path loss, shadowing, and Rayleigh fading is presented. Since these uncertainties can attenuate the received signal strength and can cause variations in the received Signal-to-Interference ratio (SIR), a new DPC scheme, which can estimate the slowly varying channel uncertainty, is proposed so that a target SIR at the receiver can be maintained. Further, the standard assumption of a constant interference during a link's power update used in other works in the literature is relaxed. A CDMA-based cellular network …

Go to article

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 …

Go to article

An Experience On Problem Based Learning In An Engineering Faculty, Cüneyt Güzeli̇ş Jan 2006

An Experience On Problem Based Learning In An Engineering Faculty, Cüneyt Güzeli̇ş

Turkish Journal of Electrical Engineering and Computer Sciences

In 2001, Engineering Faculty of Dokuz Eylül University has started to change its undergraduate education in a radical way. As being among the first examples in the world, the Departments of Electrical and Electronics, Geological and Geophysics Engineering in 2002 and Mining Engineering Department in 2003 have adopted the so-called "modular-staged problem based active learning system". The system is based on real engineering problems which values teamwork and the integration of information from different disciplines and it places the student at the center of the learning process. The faculty has learned many things and it needs to learn many other …

Go to article

An International Dialogue On Electrical Engineering Education, Thales Papazoglou Jan 2006

An International Dialogue On Electrical Engineering Education, Thales Papazoglou

Turkish Journal of Electrical Engineering and Computer Sciences

. PAPAZOGLOU Chairman -- ELCOMPEET'04 Technological Educational Institute of Crete, GREECE e-mail: [email protected]

Go to article

Online Learning Resource For Smooth Transition From High School To Engineering Education, Riadh W. Y. Habash, Christine Suurtaam, Mustapha C. E. Yagoub, Karima Kara, Ghanim Ibrahim Jan 2006

Online Learning Resource For Smooth Transition From High School To Engineering Education, Riadh W. Y. Habash, Christine Suurtaam, Mustapha C. E. Yagoub, Karima Kara, Ghanim Ibrahim

Turkish Journal of Electrical Engineering and Computer Sciences

Although high school mathematics curriculum documents in Ontario, Canada have, for the past two decades, made calls for classroom practices involving both modeling and applications, students still experience difficulties in moving into a university engineering program. This paper discusses a new initiative in online learning and the teaching of mathematical modeling and applications in engineering education at the University of Ottawa, Canada. In particular, we explore how modeling and Internet technologies can enhance progress in engineering education.

Go to article

A Comprehensive Analysis Of The Effect Of Microarray Data, Monika Ray, Johannes Freudenberg, Weixiong Zhang Jan 2006

A Comprehensive Analysis Of The Effect Of Microarray Data, Monika Ray, Johannes Freudenberg, Weixiong Zhang

All Computer Science and Engineering Research

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 two-fold: first to determine whether there is consistency in the …

Go to article

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 …

Go to article

The Remote-Clique Problem Revisited, Benjamin E. Birnbaum Jan 2006

The Remote-Clique Problem Revisited, Benjamin E. Birnbaum

All Computer Science and Engineering Research

Given a positive integer k and a complete graph with non-negative edge weights that satisfy the triangle inequality, the remote-clique problem is to find a subset of k vertices having a maximum-weight induced subgraph. A greedy algorithm for the problem has been shown to have an approximation ratio of 4, but this analysis was not shown to be tight. In this thesis, we present an algorithm called d-Greedy Augment that generalizes this greedy algorithm (they are equivalent when d = 1). We use the technique of factor-revealing linear programs to prove that d-Greedy Augment, which has a running time of …

Go to article

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 …

Go to article

Preserving Performance Of Byzantine Fault Tolerant Replica Groups In The Presence Of Malicious Clients, Sajeeva L. Pallemulle, Haraldur D. Thorvaldsson, Kenneth J. Goldman Jan 2006

Preserving Performance Of Byzantine Fault Tolerant Replica Groups In The Presence Of Malicious Clients, Sajeeva L. Pallemulle, Haraldur D. Thorvaldsson, Kenneth J. Goldman

All Computer Science and Engineering Research

The Castro and Liskov Byzantine Fault Tolerance protocol for replicated state machines (CLBFT) provides a practical means of tolerating arbitrary replica failures in replicated passive data servers. For better performance, CLBFT uses Message Authentication Codes (MAC) instead of public Key cryptography to authenticate messages and preserves replica consistency even in the presence of malicious clients. However, CLBFT is susceptible to potential attacks by malicious clients using corrupted MACs to force replica groups into expensive configuration changes repeatedly. While not affecting correctness, this vulnerability can seriously impair the performance of the replica group. We propose modifications to CLBFT that address this …

Go to article

Mixed-Integer Linear Programming Solution To Multi-Robot Task Allocation Problem, Nuzhet Atay, Burchan Bayazit Jan 2006

Mixed-Integer Linear Programming Solution To Multi-Robot Task Allocation Problem, Nuzhet Atay, Burchan Bayazit

All Computer Science and Engineering Research

Multi-robot systems require efficient and accurate planning in order to perform mission-critical tasks. This paper introduces a mixed-integer linear programming solution to coordinate multiple heterogenenous robots for detecting and controlling multiple regions of interest in an unknown environment. The objective function contains four basic requirements of a multi-robot system serving this purpose: control regions of interest, provide communication between robots, control maximum area and detect regions of interest. Our solution defines optimum locations of robots in order to maximize the objective function while efficiently satisfying some constraints such as avoiding obstacles and staying within the speed capabilities of the robots. …

Go to article

Smooth Surface Reconstruction Using Charts For Medical Data, Cindy Grimm, Tao Ju Jan 2006

Smooth Surface Reconstruction Using Charts For Medical Data, Cindy Grimm, Tao Ju

All Computer Science and Engineering Research

We present a surface reconstruction technique that constructs a smooth analytic surface from scattered data. The technique is robust to noise and both poorly and non-uniformly sampled data, making it well-suited for use in medical applications. In addition, the surface can be parameterized in multiple ways, making it possible to represent additional data, such as electromagnetic potential, in a different (but related) coordinate system to the geometric one. The parameterization technique also supports consistent parameterizations of multiple data sets.

Go to article

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

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

All Computer Science and Engineering Research

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 to analyze that example scenario, under default Linux scheduling semantics …

Go to article

Smooth Key-Framing Using The Image Plane, Leon Barrett, Cindy Grimm Jan 2006

Smooth Key-Framing Using The Image Plane, Leon Barrett, Cindy Grimm

All Computer Science and Engineering Research

This paper demonstrates the use of image-space constraints for key frame interpolation. Interpolating in image-space results in sequences with predictable and controlable image trajectories and projected size for selected objects, particularly in cases where the desired center of rotation is not fixed or when the key frames contain perspective distortion changes. Additionally, we provide the user with direct image-space control over {\em how} the key frames are interpolated by allowing them to directly edit the object's projected size and trajectory. Image-space key frame interpolation requires solving the inverse camera problem over a sequence of point constraints. This is a variation …

Go to article

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.

Go to article

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.

Go to article

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 …

Go to article

Design And Analysis Of An Accelerated Seed Generation Stage For Blastp On The Mercury System - Master's Thesis, August 2006, Arpith Jacob Jan 2006

Design And Analysis Of An Accelerated Seed Generation Stage For Blastp On The Mercury System - Master's Thesis, August 2006, Arpith Jacob

All Computer Science and Engineering Research

NCBI BLASTP is a popular sequence analysis tool used to study the evolutionary relationship between two protein sequences. Protein databases continue to grow exponentially as entire genomes of organisms are sequenced, making sequence analysis a computationally demanding task. For example, a search of the E. coli. k12 proteome against the GenBank Non-Redundant database takes 36 hours on a standard workstation. In this thesis, we look to address the problem by accelerating protein searching using Field Programmable Gate Arrays. We focus our attention on the BLASTP heuristic, building on work done earlier to accelerate DNA searching on the Mercury platform. We …

Go to article

Design Of A Diversified Network Substrate, Jonathan Turner Jan 2006

Design Of A Diversified Network Substrate, Jonathan Turner

All Computer Science and Engineering Research

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 of the substrate that enables metanetworks to co-exist. The design …

Go to article

Discovering Functional Modules By Clustering Gene Co-Expression Networks, Jianhua Ruan, Weixiong Zhang Jan 2006

Discovering Functional Modules By Clustering Gene Co-Expression Networks, Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

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 apply a rank-based transformation to obtain a sparse co-expression network, …

Go to article

Fast Packet Classification Using Bloom Filters, Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, John Lockwood Jan 2006

Fast Packet Classification Using Bloom Filters, Sarang Dharmapurikar, Haoyu Song, Jonathan Turner, John Lockwood

All Computer Science and Engineering Research

While the problem of general packet classification has received a great deal of attention from researchers over the last ten years, there is still no really satisfactory solution. Ternary Content Addressable Memory (TCAM), although widely used in practice, is both expensive and consumes a lot of power. Algorithmic solutions, which rely on commodity memory chips, are relatively inexpensive and power-efficient, but have not been able to match the generality and performance of TCAMs. In this paper we propose a new approach to packet classification, which combines architectural and algorithmic techniques. Our starting point is the well-known crossproducting algorithm, which is …

Go to article

Acceleration Of Gapped Alignment In Blastp Using The Mercury System, Brandon B. Harris Jan 2006

Acceleration Of Gapped Alignment In Blastp Using The Mercury System, Brandon B. Harris

All Computer Science and Engineering Research

Protein databases have grown exponentially over the last decade. This exponential growth has made extracting valuable information from these databases increasingly time consuming. This project presents a new method of accelerating a commonly used program for performing similarity searching on protein databases, BLASTP. This project describes the design and implementation of Mercury BLASTP, a customized hardware accelerated variant of BLASTP. This project focuses on the gapped alignment stage of Mercury BLASTP and provides design details and implementation results.

Go to article

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

Go to article

Flexible Maximum Urgency First Scheduling For Distributed Real-Time Systems, Yingming Chen, Chenyang Lu Jan 2006

Flexible Maximum Urgency First Scheduling For Distributed Real-Time Systems, Yingming Chen, Chenyang Lu

All Computer Science and Engineering Research

No abstract provided.

Go to article

First Prev Next Last