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

Engineering Commons™

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

Computer Engineering

2006

Faculty Publications

Articles 1 - 9 of 9

Full-Text Articles in Engineering

Sequence Of Linear Programming For Transmission Of Fine-Scalable Coded Content In Bandwidth-Limited Environments, Xiao Su, Tao Wang Jun 2006

Sequence Of Linear Programming For Transmission Of Fine-Scalable Coded Content In Bandwidth-Limited Environments, Xiao Su, Tao Wang

Faculty Publications

In this paper, we propose an optimal peer assignment algorithm on peer-to-peer networks. This algorithm is designed to maximize the quality of transmitting fine-scalable coded content by exploiting the embedding property of scalable coding. To be more realistic, we assume that the requesting peer has a delay constraint to display the content within a certain delay bound, and it also has limited incoming bandwidth. We first use a simple example to illustrate the peer assignment problem, and then formulate this problem as a linear programming problem, followed by a nonlinear programming problem. To efficiently solve the second nonlinear problem, we …

Go to article

Combining Multiple Scoring Systems For Video Target Tracking Based On Rank-Score Function Variation, D. Frank Hsu, Damian M. Lyons, Jizhou Ai May 2006

Combining Multiple Scoring Systems For Video Target Tracking Based On Rank-Score Function Variation, D. Frank Hsu, Damian M. Lyons, Jizhou Ai

Faculty Publications

Tracking of video targets is the process of estimating the current and predicting the future state of a target from a sequence of video sensor measurements. Multitarget video tracking is complicated by the fact that targets can occlude one another and affect video feature measurements in a highly non-linear and difficult to model fashion., Tracking multiple targets that undergo repeated mutual occlusions is a challenging problem with several issues to be addressed. In this paper we propose a multisensory fusion approach to the problem of multitarget video tracking with occlusion. Each sensory cue is treated as a scoring system on …

Go to article

Combinatorial Fusion Criteria For Real-Time Tracking, D. Frank Hsu, Damian M. Lyons, Jizhou Ai Apr 2006

Combinatorial Fusion Criteria For Real-Time Tracking, D. Frank Hsu, Damian M. Lyons, Jizhou Ai

Faculty Publications

We address the problem of automated video tracking of targets when targets undergo multiple mutual occlusions. Our approach is based on the idea that as targets are occluded, selection of feature subsets and combinations of those features are effective in identifying the target and improving tracking performance. We use Combinatorial Fusion Analysis to develop a metric to select which subset of features will produce the most accurate tracking. In particular we show that the combination of a pair of features A and B will improve the accuracy only if (a) A and B have relative high performance, and (b) A …

Go to article

Feature Selection For Real-Time Tracking, D. Frank Hsu, Damian M. Lyons, Jizhou Ai Apr 2006

Feature Selection For Real-Time Tracking, D. Frank Hsu, Damian M. Lyons, Jizhou Ai

Faculty Publications

We address the problem of selecting features to improve automated video tracking of targets that undergo multiple mutual occlusions. As targets are occluded, different feature subsets and combinations of those features are effective in identifying the target and improving tracking performance. We use Combinatorial Fusion Analysis to develop a metric to dynamically select which subset of features will produce the most accurate tracking. In particular we show that the combination of a pair of features A and B will improve the accuracy only if (a) A and B have relative high performance, and (b) A and B are diverse. We …

Go to article

Jamming Sensor Networks: Attack And Defense Strategies, Wenyuan Xu, Wade Trappe, Yanyong Zhang Apr 2006

Jamming Sensor Networks: Attack And Defense Strategies, Wenyuan Xu, Wade Trappe, Yanyong Zhang

Faculty Publications

Wireless sensor networks are built upon a shared medium that makes it easy for adversaries to conduct radio interference, or jamming, attacks that effectively cause a denial of service of either transmission or reception functionalities. These attacks can easily be accomplished by an adversary by either bypassing MAC-layer protocols or emitting a radio signal targeted at jamming a particular channel. In this article we survey different jamming attacks that may be employed against a sensor network. In order to cope with the problem of jamming, we discuss a two-phase strategy involving the diagnosis of the attack, followed by a suitable …

Go to article

A Reconfigurable Distributed Computing Fabric Exploiting Multilevel Parallelism, Charles L. Cathey, Jason D. Bakos, Duncan A. Buell Apr 2006

A Reconfigurable Distributed Computing Fabric Exploiting Multilevel Parallelism, Charles L. Cathey, Jason D. Bakos, Duncan A. Buell

Faculty Publications

This paper presents a novel reconfigurable data flow processing architecture that promises high performance by explicitly targeting both fine- and course-grained parallelism. This architecture is based on multiple FPGAs organized in a scalable direct network that is substantially more interconnect-efficient than currently used crossbar technology. In addition, we discuss several ancillary issues and propose solutions required to support this architecture and achieve maximal performance for general-purpose applications; these include supporting IP, mapping techniques, and routing policies that enable greater flexibility for architectural evolution and code portability.

Go to article

Convergence Of Ipsec In Presence Of Resets, Chin-Tser Huang, Mohamed G. Gouda, E.N. Elnozahy Mar 2006

Convergence Of Ipsec In Presence Of Resets, Chin-Tser Huang, Mohamed G. Gouda, E.N. Elnozahy

Faculty Publications

IPsec is the current security standard for the Internet Protocol IP. According to this standard, a selected computer pair (p, q) in the Internet can be designated a “security association”. This designation guarantees that all sent IP messages whose original source is computer p and whose ultimate destination is computer q cannot be replayed in the future (by an adversary between p and q) and still be received by computer q as fresh messages from p. This guarantee is provided by adding increasing sequence numbers to all IP messages sent from p to q. Thus, p needs to always remember …

Go to article

Adaptive Evolution Of Chloroplast Genome Structure Inferred Using A Parametric Bootstrap Approach, Liying Cui, Jim Leebens-Mack, Li-San Wang, Jijun Tang, Linda Rymarquis, David B. Stern, Claude W. Depamphilis Feb 2006

Adaptive Evolution Of Chloroplast Genome Structure Inferred Using A Parametric Bootstrap Approach, Liying Cui, Jim Leebens-Mack, Li-San Wang, Jijun Tang, Linda Rymarquis, David B. Stern, Claude W. Depamphilis

Faculty Publications

Background
Genome rearrangements influence gene order and configuration of gene clusters in all genomes. Most land plant chloroplast DNAs (cpDNAs) share a highly conserved gene content and with notable exceptions, a largely co-linear gene order. Conserved gene orders may reflect a slow intrinsic rate of neutral chromosomal rearrangements, or selective constraint. It is unknown to what extent observed changes in gene order are random or adaptive. We investigate the influence of natural selection on gene order in association with increased rate of chromosomal rearrangement. We use a novel parametric bootstrap approach to test if directional selection is responsible for the …

Go to article

Concurrent Multiple- Issue Negotiation For Internet-Based Services, Jiangbo Dang, Michael N. Huhns Jan 2006

Concurrent Multiple- Issue Negotiation For Internet-Based Services, Jiangbo Dang, Michael N. Huhns

Faculty Publications

Negotiation is a technique for reaching a mutually beneficial agreement among autonomous entities. In an Internet-based services context, multiple entities are negotiating simultaneously. The concurrent negotiation protocol extends existing negotiation protocols, letting both service requestors and service providers manage several negotiation processes in parallel. Colored Petri nets, which have greater expressive power than finite state machines and offer support for concurrency, represent the negotiation protocol and facilitate the analysis of desirable properties.

Go to article