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

Engineering Commons™

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

Computer Engineering

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 22831 - 22860 of 25652

Full-Text Articles in Engineering

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 …

Go to article

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 …

Go to article

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 …

Go to article

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

Go to article

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 …

Go to article

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 …

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

Ceg 490/690-01: Technology-Based Ventures, Forouzan Golshani, S. Narayanan Jan 2006

Ceg 490/690-01: Technology-Based Ventures, Forouzan Golshani, S. Narayanan

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 205-04,05,06: Computer Literacy And Office Automation, Terri Bauer Jan 2006

Cs 205-04,05,06: Computer Literacy And Office Automation, Terri Bauer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Mimo Communications In Ad Hoc Networks, Biao Chen, Michael J. Gans Jan 2006

Mimo Communications In Ad Hoc Networks, Biao Chen, Michael J. Gans

Electrical Engineering and Computer Science - All Scholarship

We study in this paper the network spectral efficiency in terms of bits/s/Hz of a MIMO (multiple-input multiple output) ad hoc network with K simultaneous communicating transmitter-receiver pairs. Assume that each transmitter is equipped with t antennas and each receiver implements single user detection. We show that in the absence of channel state information (CSI) at the transmitters, the asymptotic network spectral efficiency is limited by r nats/s/Hz as K -> ∞ and is independent of t and the transmit power. With CSI corresponding to the desired receiver available at the transmitter, we demonstrate that the asymptotic spectral efficiency is …

Go to article

Investigating The Male-Driven Evolution Hypothesis Using Human AluRepeat Elements, Sridhar Ramachandran Jan 2006

Investigating The Male-Driven Evolution Hypothesis Using Human AluRepeat Elements, Sridhar Ramachandran

Browse all Theses and Dissertations

Thousands of copies of short interspersed repeats (SINEs) are scattered essentially ran-domly through the human genome. Although copies of each repeat subfamily are identical at the time of their insertion, they become subject to individual substitutions after insertion. As the relative time of insertion is known for many of these repeats, such "junk DNA" can be used to provide a sizeable number of time-series data points for studying substitution effects in a variety of genomic contexts. This dissertation specifically discusses the usefulness of the Alufamily of SINE repeats towards addressing open problems in genomics, population genetics, and biology in …

Go to article

Cs 340-01: Programming Language Workshop In Java, Ronald F. Taylor Jan 2006

Cs 340-01: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.

Go to article

Cs 480/680-01: Comparative Programming Languages, Michael L. Raymer Jan 2006

Cs 480/680-01: Comparative Programming Languages, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Thomas Sudkamp Jan 2006

Cs 740-01: Algorithms, Complexity And The Theory Of Computability, Thomas Sudkamp

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura Jan 2006

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura

Computer Science & Engineering Syllabi

Low-cost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.

Go to article

Cs 142-01: Computer Programming Ii, Eric Maston Jan 2006

Cs 142-01: Computer Programming Ii, Eric Maston

Computer Science & Engineering Syllabi

This course provides a continuation to the general introduction of computer programming begun in CS 141. Examples from and applications to a broad range of problems are given. The concepts covered will be applied to the Java programming language. (Students must register for both lecture and one laboratory section.)

Go to article

Cs 240-01: Introduction To Computer Science I, L. Jane Lin Jan 2006

Cs 240-01: Introduction To Computer Science I, L. Jane Lin

Computer Science & Engineering Syllabi

This course is the first in the three course sequence "Introduction to Computer Science" offered by the Computer Science department at WSU. This course presents a general introduction to C++ programming language. It introduces the fundamental capabilities of C++ language as a problem solving tool. Topics include data representation, debugging and program verification.

Go to article

Cs 242-01: Introduction To Computer Science Iii, Eric Maston Jan 2006

Cs 242-01: Introduction To Computer Science Iii, Eric Maston

Computer Science & Engineering Syllabi

This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues, and tables.

Go to article

Cs 302-01: Client Server Databases, Karen Meyer Jan 2006

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 241-01: Computer Science Ii, Mateen M. Rizki Jan 2006

Cs 241-01: Computer Science Ii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 701-01: Database Systems And Design, Kenneth Melendez Jan 2006

Cs 701-01: Database Systems And Design, Kenneth Melendez

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki Jan 2006

Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). In addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.

Go to article

Cs 317-01: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor Jan 2006

Cs 317-01: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of courses of errors in numerical methods. Special topics and applications presented as schedule permits. 4 credit hours. Prerequisites: CS 316, MTH 233, 253, or 355. Programming course prerequisites: EGR 153 or CEG 220 or CS 241.

Go to article

Cs 884-01: Advanced Topics In Programming Languages, Krishnaprasad Thirunarayan Jan 2006

Cs 884-01: Advanced Topics In Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

The primary focus of this course is the design and specification of the Object-Oriented language Java.

Go to article

Cs 208-01: Computer Programming For Business I, Dennis Kellermeier Jan 2006

Cs 208-01: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming. This course assumes students have never written a program before.

Go to article

Cs 400/600-01: Data Structures And Software Design, Michael L. Raymer Jan 2006

Cs 400/600-01: Data Structures And Software Design, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 411/611: Microprocessor-Based System Design, Jack Jean Jan 2006

Ceg 411/611: Microprocessor-Based System Design, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 241-01: Introduction To Computer Science Ii, Praveen Kakumanu Jan 2006

Cs 241-01: Introduction To Computer Science Ii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course.

Go to article

Ceg 333: Introduction To Unix, Todd Rovito Jan 2006

Ceg 333: Introduction To Unix, Todd Rovito

Computer Science & Engineering Syllabi

Introduction to the use of UNIX and UNIX tools as a problem-solving environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, and debugging. Prerequisite: CS 241.

Go to article

Ceg 433/633-01: Operating Systems, Prabhaker Mateti Jan 2006

Ceg 433/633-01: 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 C/C++ language and include the design of portions of an operating system. 4 credit hours.

Go to article

First Prev Next Last