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

Engineering Commons

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

Computer Engineering

PDF

Series

2005

Institution
Keyword
Publication

Articles 1 - 30 of 338

Full-Text Articles in Engineering

Coalition Battle Management Language (C-Bml) Study Group Final Report, Major Kevin Galvin, Mike Hieb, Andreas Tolk, Charles Turnitsa, Curtis Blais, James Montgomery Dec 2005

Coalition Battle Management Language (C-Bml) Study Group Final Report, Major Kevin Galvin, Mike Hieb, Andreas Tolk, Charles Turnitsa, Curtis Blais, James Montgomery

Computational Modeling & Simulation Engineering Faculty Publications

Interoperability across Modeling and Simulation (M&S) and Command and Control (C2) systems continues to be a significant problem for today's warfighters. M&S is well-established in military training, but it can be a valuable asset for planning and mission rehearsal if M&S and C2 systems were able to exchange information, plans, and orders more effectively. To better support the warfighter with M&S based capabilities, an open standards-based framework is needed that establishes operational and technical coherence between C2 and M&S systems.


Monte-Carlo-Type Techniques For Processing Interval Uncertainty, And Their Potential Engineering Applications, Vladik Kreinovich, J. Beck, Carlos M. Ferregut, A. Sanchez, George R. Keller, Matthew G. Averill, Scott A. Starks Dec 2005

Monte-Carlo-Type Techniques For Processing Interval Uncertainty, And Their Potential Engineering Applications, Vladik Kreinovich, J. Beck, Carlos M. Ferregut, A. Sanchez, George R. Keller, Matthew G. Averill, Scott A. Starks

Departmental Technical Reports (CS)

In engineering applications, we need to make decisions under uncertainty. Traditionally, in engineering, statistical methods are used, methods assuming that we know the probability distribution of different uncertain parameters. Usually, we can safely linearize the dependence of the desired quantities y (e.g., stress at different structural points) on the uncertain parameters xi - thus enabling sensitivity analysis. Often, the number n of uncertain parameters is huge, so sensitivity analysis leads to a lot of computation time. To speed up the processing, we propose to use special Monte-Carlo-type simulations.


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 …


An Ultra Wide Band Simulator Using Matlab/Simulink, Peter Vial, Beata J. Wysocki, Tadeusz A. Wysocki Dec 2005

An Ultra Wide Band Simulator Using Matlab/Simulink, Peter Vial, Beata J. Wysocki, Tadeusz A. Wysocki

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

Ultra Wide Band (UWB) is a promising technology for sensor networks, broadband wireless data access and location finding applications. This study outlines the development and validation of a single transmitter and receiver system across the multipath channel proposed by Saleh-Valenzuela. We have designed and tested a UWB simulator using MATLAB’s Simulink in combination with the Real Time Workshop(RTW) Tool box for Simulink using the Fixed Step Discrete Solvers of RTW which is required to produce executable simulations on multiple computers (both Linux and Microsoft based devices). This paper outlines the basic design and modules chosen for the simulation and compares …


Using Asterisms To Decode Multi-User Mimo Systems, Phillip Conder, Tadeusz A. Wysocki Dec 2005

Using Asterisms To Decode Multi-User Mimo Systems, Phillip Conder, Tadeusz A. Wysocki

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

The area of Multiple Input Multiple Output (MIMO) communications systems has received enormous attention recently as they can provide a roughly linear increase in data rate by using multiple transmit and receive antennas. MIMO combined with an Turbo coding has been shown as a promising way to achieve near capacity for wireless channels. This paper proposes applying an Asterism based decoder to produce an additional multi user access scheme on top of the primary access method for Ad Hoc networks. After reviewing Sphere and Asterism decoding for MIMO systems with a larger number of transmit than receive antennas, this paper …


Background Radio Frequency Interference Measurements For Wireless Devices In The Electricity Supply Industry, Duane Robinson, Tadeusz A. Wysocki, V. Smith, K. Popovski Dec 2005

Background Radio Frequency Interference Measurements For Wireless Devices In The Electricity Supply Industry, Duane Robinson, Tadeusz A. Wysocki, V. Smith, K. Popovski

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

Incorporation of radio controller units into heavy equipment used in the electricity industry provides numerous advantages including: improved electrical isolation between plant and operator, ability to incorporate an additional remote operator, and reductions in vehicle wiring and hydraulic hoses for equipment control. However, secure operation of vehicles and plant incorporating radio control rely on establishing suitable levels of immunity to possible radio frequency interference. Interference levels in close proximity to high voltage power lines are of special concern to the electricity industry. This paper reports on a preliminary investigation into quantifying the levels of background radio interference at such locations …


Real-Time 3d Image Visualization System For Digital Video On A Single Chip, Nader I. Rafla Dec 2005

Real-Time 3d Image Visualization System For Digital Video On A Single Chip, Nader I. Rafla

Electrical and Computer Engineering Faculty Publications and Presentations

Implementation of a real-time image visualization system on a reconfigurable chip (FPGA) is proposed. The system utilizes an innovative stereoscopic image capture, processing and visualization technique. Implementation is done as a two stage process. In the first stage, the stereo pair is captured using two image sensors. The captured images are then synchronized and sent to the second stage for fusion. A controller module is developed, designed, and placed on the FPGA for this purpose. The second stage is used for reconstruction and visualization of the 3D image. An innovative technique employing dual-processor architecture on the same single FPGA is …


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

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

All Computer Science and Engineering Research

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


Roadmap Query For Sensor Network Assisted Navigation In Dynamic Environments, Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, Gruia-Catalin Roman Nov 2005

Roadmap Query For Sensor Network Assisted Navigation In Dynamic Environments, Sangeeta Bhattacharya, Nuzhet Atay, Gazihan Alankus, Chenyang Lu, O. Burchan Bayazit, Gruia-Catalin Roman

All Computer Science and Engineering Research

Autonomous mobile entity navigation through dynamic and unknown environments is an essential part of many mission critical applications like search and rescue and fire fighting. The dynamism of the environment necessitates the mobile entity to constantly maintain a high degree of awareness of the changing environment. This criteria makes it difficult to achieve good navigation performance by using just on-board sensors and existing navigation methods and motivates the use of wireless sensor networks (WSNs) to aid navigation. In this paper, we present a novel approach that integrates a roadmap based navigation algorithm with a novel network query protocol called Roadmap …


Group Scheduling In Selinux To Mitigate Cpu-Focused Denial Of Service Attacks, Armando Migliaccio, Terry Tidwell, Christopher Gill, Tejasvi Aswathanarayana, Douglas Niehaus Nov 2005

Group Scheduling In Selinux To Mitigate Cpu-Focused Denial Of Service Attacks, Armando Migliaccio, Terry Tidwell, Christopher Gill, Tejasvi Aswathanarayana, Douglas Niehaus

All Computer Science and Engineering Research

Popular security techniques such as public-private key encryption, firewalls, and role-based access control offer significant protec-tion of system data, but offer only limited protection of the computations using that data from significant interference due to accident or adversarial attack. However, in an increasing number of modern systems, ensuring the reliable execution of system activities is every bit as important as ensuring data security. This paper makes three contributions to the state of the art in protection of the execution of system activities from accidental or adversarial interference. First, we consider the motivating problem of CPU-focused denial of service attacks, and …


Combining Interval, Probabilistic, And Fuzzy Uncertainty: Foundations, Algorithms, Challenges -- An Overview, Vladik Kreinovich, David J. Berleant, Scott Ferson, Weldon A. Lodwick Nov 2005

Combining Interval, Probabilistic, And Fuzzy Uncertainty: Foundations, Algorithms, Challenges -- An Overview, Vladik Kreinovich, David J. Berleant, Scott Ferson, Weldon A. Lodwick

Departmental Technical Reports (CS)

Since the 1960s, many algorithms have been designed to deal with interval uncertainty. In the last decade, there has been a lot of progress in extending these algorithms to the case when we have a combination of interval and probabilistic uncertainty. We provide an overview of related algorithms, results, and remaining open problems.


Specifying And Checking Method Call Sequences Of Java Programs, Yoonsik Cheon, Ashaveena Perumandla Nov 2005

Specifying And Checking Method Call Sequences Of Java Programs, Yoonsik Cheon, Ashaveena Perumandla

Departmental Technical Reports (CS)

In a pre and postconditions-style specification, it is difficult to specify the allowed sequences of method calls, referred to as protocols. The protocols are essential properties of reusable object-oriented classes and application frameworks, and the approaches based on the pre and postconditions, such as design by contracts (DBC) and formal behavioral interface specification languages (BISL), are being accepted as a practical and effective tool for describing precise interfaces of (reusable) program modules. We propose a simple extension to the Java Modeling Language (JML), a BISL for Java, to specify protocol properties in an intuitive and concise manner. The key idea …


Optimal Choice Of Granularity In Commonsense Estimation: Why Half-Orders Of Magnitude, Jerry R. Hobbs, Vladik Kreinovich Nov 2005

Optimal Choice Of Granularity In Commonsense Estimation: Why Half-Orders Of Magnitude, Jerry R. Hobbs, Vladik Kreinovich

Departmental Technical Reports (CS)

It has been observed that when people make crude estimates, they feel comfortable choosing between alternatives which differ by a half-order of magnitude (e.g., were there 100, 300, or 1,000 people in the crowd), and less comfortable making a choice on a more detailed scale, with finer granules, or on a coarser scale (like 100 or 1,000). In this paper, we describe two models of choosing granularity in commonsense estimates, and we show that for both models, in the optimal granularity, the next estimate is 3-4 times larger than the previous one. Thus, these two optimization results explain the commonsense …


Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless Nov 2005

Minimum Power Configuration For Wireless Communication In Sensor Networks, Guoliang Xing, Chenyang Lu, Ying Zhang, Qingfeng Huang, Robert Pless

All Computer Science and Engineering Research

This paper proposes the Minimum Power Configuration (MPC) approach to power management in wireless sensor networks. In contrast to earlier research that treats different radio states (transmission/reception/idle) in isolation, MPC integrates them in a joint optimization problem that depends on both the set of active nodes and the transmission power. We propose four approximation algorithms with provable performance bounds and two practical routing protocols. Simulations based on realistic radio models show that the MPC approach can conserve more energy than existing minimum power routing and topology control protocols. Furthermore, it can flexibly adapt to network workload and radio platforms.


Large–Scale Field–Programmable Analog Arrays For Analog Signal Processing, Tyson S. Hall, Christopher M. Twigg, Jordan D. Gray, Paul Hasler, David V. Anderson Nov 2005

Large–Scale Field–Programmable Analog Arrays For Analog Signal Processing, Tyson S. Hall, Christopher M. Twigg, Jordan D. Gray, Paul Hasler, David V. Anderson

Faculty Works

Field-programmable analog arrays (FPAAs) providea method for rapidly prototyping analog systems. Currently available commercial and academic FPAAs are typically based on operational amplifiers (or other similar analog primitives) with only a few computational elements per chip. While their specific architectures vary, their small sizes and often restrictive interconnect designs leave current FPAAs limited in functionality and flexibility. For FPAAs to enter the realm of large-scale reconfigurable devices such as modern field-programmable gate arrays (FPGAs),new technologies must be explored to provide area-efficient accurately programmable analog circuitry that can be easily integrated into a larger digital/mixed-signal system. Recent advances in the area …


End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker Nov 2005

End-To-End Scheduling Strategies For Aperiodic Tasks In Middleware, Yuanfang Zhang, Chenyang Lu, Christopher Gill, Patrick Lardieri, Gautum Thaker

All Computer Science and Engineering Research

Many mission-critical distributed real-time applicationsmust handle aperiodic tasks with hard end-to-end dead-lines. Existing middleware such as RT-CORBA lacksschedulability analysis and run-time scheduling mecha-nisms that can provide real-time guarantees to aperiodictasks. This paper makes the following contributions to thestate of the art for end-to-end aperiodic scheduling in mid-dleware. First, we compare two approaches to aperiodicscheduling, the deferrable server and the aperiodic utiliza-tion bound, using representative workloads. Numerical re-sults show that the deferrable server analysis is less pes-simistic than the aperiodic utilization bounds when appliedoffline. Second, we propose a practical approach to tuningdeferrable servers for end-to-end tasks. Third, we describedeferrable server mechanisms …


Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill Nov 2005

Context Aware Service Oriented Computing In Mobile Ad Hoc Networks, Radu Handorean, Gruia-Catalin Roman, Christopher Gill

All Computer Science and Engineering Research

These days we witness a major shift towards small, mobile devices, capable of wireless communication. Their communication capabilities enable them to form mobile ad hoc networks and share resources and capabilities. Service Oriented Computing (SOC) is a new emerging paradigm for distributed computing that has evolved from object-oriented and component-oriented computing to enable applications distributed within and across organizational boundaries. Services are autonomous computational elements that can be described, published, discovered, and orchestrated for the purpose of developing applications. The application of the SOC model to mobile devices provides a loosely coupled model for distributed processing in a resource-poor and …


Population Variance Under Interval Uncertainty: A New Algorithm, Evgeny Dantsin, Vladik Kreinovich, Alexander Wolper, Gang Xiang Nov 2005

Population Variance Under Interval Uncertainty: A New Algorithm, Evgeny Dantsin, Vladik Kreinovich, Alexander Wolper, Gang Xiang

Departmental Technical Reports (CS)

In statistical analysis of measurement results, it is often beneficial to compute the range [V] of the population variance V when we only know the intervals [Xi-Di,Xi+Di] of possible values of xi. In general, this problem is NP-hard; a polynomial-time algorithm is known for the case when the measurements are sufficiently accurate, i.e., when |Xi-Xj| >= (D_i+D_j)/n for all i =/= j. In this paper, we show that we can efficiently compute [V} under a weaker (and more general) condition |Xi-Xj| >= |D_i-D_j|/n.


H-Infinity Estimation For Fuzzy Membership Function Optimization, Daniel J. Simon Nov 2005

H-Infinity Estimation For Fuzzy Membership Function Optimization, Daniel J. Simon

Electrical and Computer Engineering Faculty Publications

Given a fuzzy logic system, how can we determine the membership functions that will result in the best performance? If we constrain the membership functions to a specific shape (e.g., triangles or trapezoids) then each membership function can be parameterized by a few variables and the membership optimization problem can be reduced to a parameter optimization problem. The parameter optimization problem can then be formulated as a nonlinear filtering problem. In this paper we solve the nonlinear filtering problem using H state estimation theory. However, the membership functions that result from this approach are not (in general) sum normal. …


Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman Oct 2005

Mobiquery: A Spatiotemporal Query Service For Mobile Users In Sensor Networks, Guoliang Xing, Sangeeta Bhattacharya, Chenyang Lu, Octav Chipara, Chien-Liang Fok, Gruia-Catalin Roman

All Computer Science and Engineering Research

This paper presents MobiQuery, a spatiotemporal query service that allows mobile users to periodically collect sensor data from the physical environment through wireless sensor networks. A salient feature of \MQ is that it can meet stringent spatiotemporal performance constraints, including query latency, data freshness, and changing areas of interest due to user mobility. We present three just-in-time prefetching protocols that enable MobiQuery to achieve desired spatiotemporal performance despite low node duty cycles, while significantly reducing communication overhead. We validate our approach through both theoretical analysis and extensive simulations under realistic settings including varying user movement patterns and location errors.


Analysis Of Gaits For A Rotating Tripedal Robot, Damian M. Lyons, Kiran Pamnany Oct 2005

Analysis Of Gaits For A Rotating Tripedal Robot, Damian M. Lyons, Kiran Pamnany

Faculty Publications

A goal of robotics has been to develop mechanisms that have the efficiency and speed of wheeled robots with the terrain flexibility of legged robots. In previous work, we have proposed a unique three-legged mechanism, the rotopod, designed to integrate these two useful approaches to locomotion. In this paper, we present an analysis of the variety of gaits that can be exhibited by the rotopod. We present examples of many of these gaits and discuss their potential use. A trajectory generation algorithm is presented that can be used to generate point to point trajectories using one of three different styles …


Ceg 210: Pc Networking I, Karen Meyer Oct 2005

Ceg 210: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN Administration.


Ceg 434/634: Concurrent Software Design, Natsuhiko Futamura Oct 2005

Ceg 434/634: Concurrent Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency , and their solutions are examined through the course projects and through readings on operating system design.


Ceg 433/633: Operating Systems, Prabhaker Mateti Oct 2005

Ceg 433/633: Operating Systems, Prabhaker Mateti

Computer Science & Engineering Syllabi

The management of resources in multi-user computer systems. Emphasis is on problems of file-system design, process scheduling, memory allocation, protection, and tools needed for solutions. Course projects use the CIC++ language and include the design of portions of an operating system. 4 credit hours.


Ceg 499/699: Mobile Computing, Yong Pei Oct 2005

Ceg 499/699: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

This senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help CEG students establish a solid foundation in wireless networking architecture, protocols, fundamental concepts and principles, network congestion control and flow control design. It will also introduce students to a few hot topics in wireless networking and mobile computing research.

The course will start with a review over fundamental design challenges, architectural principles and philosophy for the Internet and heterogeneous networks. The focus will then move on to an in-depth examination of wireless networking protocols, and …


Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom Oct 2005

Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operatio of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument pasing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used. Three hours lecture, two hours lab. Prerequisite: CS 242, CEO 260.


Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner Oct 2005

Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner

Computer Science & Engineering Syllabi

This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a group project.


Ceg 724: Computer Vision I, Arthur A. Goshtasby Oct 2005

Ceg 724: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course cover basic techniques for low-level and some mid-level vision processing. The techniques include: image filtering, intensity thresholding, edge detection, 2-D shape analysis, line and circle detection, corner detection, pattern matching.


Ceg 402/602: Introduction To Computer Communication, Bin Wang Oct 2005

Ceg 402/602: Introduction To Computer Communication, Bin Wang

Computer Science & Engineering Syllabi

This course provides an introduction to basic concepts of communication networks, different types of networks, protocols over different layers, and network applications through lectures, labs, homework, and reading on relevant materials. You will

  • Understand networking principles, protocols, and technologies.
  • Understand some design and performance issues involved in providing a network service.
  • Acquire background for supporting e-commerce, e-government, and education.
  • Gain hands-on experience with programming techniques for network protocols.
  • Obtain background for original research in computer networks.


Ceg 210: Pc Networking I, Chris P. Fickert Oct 2005

Ceg 210: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

The objective of the course is to provide an introduction to PC networking hardware, concepts, and technologies with a focus on hardware configuration and LAN administration using in-class, hands-on exercises with Novell NetWare.