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

Computer Engineering Commons™

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

2008

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 361 - 390 of 522

Full-Text Articles in Computer Engineering

The Characteristic Basis Function Method (Cbfm): A Numerically Efficient Strategy For Solving Large Electromagnetic Scattering Problems, Eugenio Lucente, Gianluigi Tiberi, Agostino Monorchio, Giuliano Manara, Raj Mittra Jan 2008

The Characteristic Basis Function Method (Cbfm): A Numerically Efficient Strategy For Solving Large Electromagnetic Scattering Problems, Eugenio Lucente, Gianluigi Tiberi, Agostino Monorchio, Giuliano Manara, Raj Mittra

Turkish Journal of Electrical Engineering and Computer Sciences

The objective of this paper is to describe a numerically efficient strategy for solving large electromagnetic scattering problems. This novel approach, termed as the Characteristic Basis Function Method (CBFM), is based on utilizing Characteristic Basic Functions (CBFs)-special functions defined on macro domains (blocks)-that include a relatively large number of conventional sub-domains discretized by using triangular or rectangular patches. The CBFs can be derived either analytically (from PO solutions), or by applying the conventional MoM. Use of these basis functions leads to a significant reduction in the number of unknowns, and results in a substantial size reduction of the MoM matrix. …

Go to article

Modeling Timed Component-Based Real-Time Systems, Huang-Ming Huang, Christopher Gill Jan 2008

Modeling Timed Component-Based Real-Time Systems, Huang-Ming Huang, Christopher Gill

All Computer Science and Engineering Research

Component based middleware helps to facilitate software reuse by separating application-specific concerns into modular components that are shielded from the concerns of other components and from the common concerns addressed by underlying middleware services. In real-time systems, concerns such as invocation rates, execution latencies, deadlines, and concurrency semantics cross-cut multiple component and middleware abstractions. Thus, the verification of these systems must consider features of the application components (e.g., their execution latencies and relative invocation rates) and of the supporting middleware (e.g., concurrency and scheduling) together. However, existing approaches only address a sub-set of the features that must be modeled in …

Go to article

Scheduling For Reliable Execution In Autonomic Systems, Terry Tidwell, Robert Glaubius, Christopher Gill, William D. Smart Jan 2008

Scheduling For Reliable Execution In Autonomic Systems, Terry Tidwell, Robert Glaubius, Christopher Gill, William D. Smart

All Computer Science and Engineering Research

Scheduling the execution of multiple concurrent tasks on shared resources such as CPUs and network links is essential to ensuring the reliable operation of many autonomic systems. Well known techniques such as rate-monotonic scheduling can offer rigorous timing and preemption guarantees, but only under assumptions (i.e., a fixed set of tasks with well-known execution times and invocation rates) that do not hold in many autonomic systems. New hierarchical scheduling techniques are better suited to enforce the more flexible execution constraints and enforcement mechanisms that are required for autonomic systems, but a rigorous foundation for verifying and enforcing concurrency and timing …

Go to article

Partial Program Admission By Path Enumeration, Michael Wilson, Ron Cytron, Jon Turner Jan 2008

Partial Program Admission By Path Enumeration, Michael Wilson, Ron Cytron, Jon Turner

All Computer Science and Engineering Research

Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program's WCET statically is possible, computing its true WCET is difficult without significant semantic knowledge. We present an algorithm for partial program admission, suited for non-preemptive platforms, using dynamic programming to perform explicit enumeration of program paths. Paths - possible or not - are bounded by the available execution time and admitted on a path-by-path basis without requiring semantic knowledge of the program beyond its Control …

Go to article

Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thaker Jan 2008

Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thaker

All Computer Science and Engineering Research

Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fixed minimum inter-arrival times is a poor approximation for systems in which tasks arrive in bursts, but have longer intervals between the bursts. In such cases, schedulability analysis based on the existing sporadic task model is pessimistic and seriously overestimates the task's time demand. In this paper, we propose a generalized sporadic task model that characterizes arrival times more precisely than the traditional sporadic task model, and we develop a corresponding schedulability analysis that computes tighter bounds …

Go to article

Local Neighborhoods For Shape Classification And Normal Estimation, Cindy Grimm, William Smart Jan 2008

Local Neighborhoods For Shape Classification And Normal Estimation, Cindy Grimm, William Smart

All Computer Science and Engineering Research

We introduce the concept of local neighborhoods, a generalization of the one-ring on a mesh to unlabeled 3D data points arising from sampling a 2D surface embedded in 3D. The local neighborhood supports both local shape classification and robust normal estimation. In particular, local neighborhoods out-perform traditional approaches in unevenly sampled, curved regions. We show that the local neighborhood can be used in place of a full mesh structure for applications such as smoothing, moving least-squares reconstruction, and parameterization. Longer version of paper submitted to CAGD

Go to article

Financial Monte Carlo Simulation On Architecturally Diverse Systems, Naveen Singla, Michael Hall, Berkley Shands, Roger D. Chamberlain Jan 2008

Financial Monte Carlo Simulation On Architecturally Diverse Systems, Naveen Singla, Michael Hall, Berkley Shands, Roger D. Chamberlain

All Computer Science and Engineering Research

Computational finance relies heavily on the use of Monte Carlo simulation techniques. However, Monte Carlo simulation is computationally very demanding. We demonstrate the use of architecturally diverse systems to accelerate the performance of these simulations, exploiting both graphics processing units and field-programmable gate arrays. Performance results include a speedup of 74× relative to an 8 core multiprocessor system (180× relative to a single processor core).

Go to article

A Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thakar Jan 2008

A Practical Schedulability Analysis For Generalized Sporadic Tasks In Distributed Real-Time Systems, Yuanfang Zhang, Donald K. Krecker, Christopher Gill, Chenyang Lu, Guatam H. Thakar

All Computer Science and Engineering Research

Existing off-line schedulability analysis for real-time systems can only handle periodic or sporadic tasks with known minimum inter-arrival times. Modeling sporadic tasks with fixed minimum inter-arrival times is a poor approximation for systems in which tasks arrive in bursts, but have longer intervals between the bursts. In such cases, schedulability analysis based on the existing sporadic task model is pessimistic and seriously overestimates the task's time demand. In this paper, we propose a generalized sporadic task model that characterizes arrival times more precisely than the traditional sporadic task model, and we develop a corresponding schedulability analysis that computes tighter bounds …

Go to article

Reliable Data Collection From Mobile Users For Real-Time Clinical Monitoring, Octav Chipara, Christopher Brooks, Sangeeta Bhattacharya, Chenyang Lu Jan 2008

Reliable Data Collection From Mobile Users For Real-Time Clinical Monitoring, Octav Chipara, Christopher Brooks, Sangeeta Bhattacharya, Chenyang Lu

All Computer Science and Engineering Research

Real-time patient monitoring is critical to early detection of clinical patient deterioration in general hospital wards. A key challenge in such applications is to reliably deliver sensor data from mobile patients. We present an empirical analysis on the reliability of data collection from wireless pulse oximeters attached to users. We observe that most packet loss occur from mobile users to their first-hop relays. Based on this insight we developed the Dynamic Relay Association Protocol (DRAP), a simple and effective mechanism for dynamically discovering the right relays for wireless sensors attached to mobile users. DRAP enables highly reliable data collection from …

Go to article

Real-Time Performance And Middleware On Multicore Linux Platforms, Yuanfang Zhang, Christopher Gill, Chenyang Lu Jan 2008

Real-Time Performance And Middleware On Multicore Linux Platforms, Yuanfang Zhang, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

An increasing number of distributed real-time applications are running on multicore platforms. However, existing real-time middleware (e.g., Real-Time CORBA) lacks support for scheduling soft real-time tasks on multicore platforms while guaranteeing their time constraints will be satisfied. This paper makes three contributions to the state of the art in real-time system software for multicore platforms. First, it offers what is to our knowledge the first experimental analysis of real-time performance for vanilla Linux primitives on multicore platforms. Second, it presents MC-ORB, the first real-time object request broker (ORB), designed to exploit the features of multicore platforms, with admission control and …

Go to article

Verification Of Component-Based Distributed Real-Time Systems, Huang-Ming Huang, Christopher Gill Jan 2008

Verification Of Component-Based Distributed Real-Time Systems, Huang-Ming Huang, Christopher Gill

All Computer Science and Engineering Research

Component-based software architectures enable reuse by separating application-specific concerns into modular components that are shielded from each other and from common concerns addressed by underlying services. Even so, concerns such as invocation rates, execution latencies, deadlines, and concurrency and scheduling semantics still cross-cut component boundaries in many real-time systems. Verification of these systems therefore must consider how composition of components relates to timing, resource utilization, and other properties. However, existing approaches only address a sub-set of the concerns that must be modeled in component-based distributed real-time systems, and a new more comprehensive approach is thus needed. To address that need, …

Go to article

Animal Microrna Target Prediction By Incorporating Diverse Sequence-Specific Determinants, Yun Zheng, Weixiong Zhang Jan 2008

Animal Microrna Target Prediction By Incorporating Diverse Sequence-Specific Determinants, Yun Zheng, Weixiong Zhang

All Computer Science and Engineering Research

More recent evidence has shown that access of animal microRNAs (miRNAs) to their complementary sites in target mRNAs is determined by more sequence-specific determinants than the seed regions in the 5' end of miRNAs. Although these factors have been shown to be related to the repressive power of miRNAs and used, in separate programs, to predict the efficacy of miRNA complementary sites, it remains unclear whether these factors can help to improve miRNA target prediction. We develop a new miRNA target prediction algorithm, called Hitsensor, by incorporating more sequence-specific features that determine complementarities between miRNAs and their targets, in addition …

Go to article

Multi-Application Deployment In Integrated Sensing Systems Based On Quality Of Monitoring, Sangeeta Bhattacharya, Abusayeed Saifullah, Chenyang Lu, Gruia-Catalin Roman Jan 2008

Multi-Application Deployment In Integrated Sensing Systems Based On Quality Of Monitoring, Sangeeta Bhattacharya, Abusayeed Saifullah, Chenyang Lu, Gruia-Catalin Roman

All Computer Science and Engineering Research

No abstract provided.

Go to article

Transcriptome Analysis Of Alzheimer's Disease Identifies Links To Cardiovascular Disease, Monika Ray, Jianhua Ruan, Weixiong Zhang Jan 2008

Transcriptome Analysis Of Alzheimer's Disease Identifies Links To Cardiovascular Disease, Monika Ray, Jianhua Ruan, Weixiong Zhang

All Computer Science and Engineering Research

No abstract provided.

Go to article

Reconfigurable Real-Time Middleware For Distributed Cyber-Physical Systems With Aperiodic Events, Yuanfang Zhang, Christopher Gill, Chenyang Lu Jan 2008

Reconfigurable Real-Time Middleware For Distributed Cyber-Physical Systems With Aperiodic Events, Yuanfang Zhang, Christopher Gill, Chenyang Lu

All Computer Science and Engineering Research

Different distributed cyber-physical systems must handle aperiodic and periodic events with diverse requirements. While existing real-time middleware such as Real-Time CORBA has shown promise as a platform for distributed systems with time constraints, it lacks flexible configuration mechanisms needed to manage end-to-end timing easily for a wide range of different cyber-physical systems with both aperiodic and periodic events. The primary contribution of this work is the design, implementation and performance evaluation of the first configurable component middleware services for admission control and load balancing of aperiodic and periodic event handling in distributed cyber-physical systems. Empirical results demonstrate the need for, …

Go to article

Software And Hardware Acceleration Of The Genomic Motif Finding Tool Phylonet, Justin Brown Jan 2008

Software And Hardware Acceleration Of The Genomic Motif Finding Tool Phylonet, Justin Brown

All Computer Science and Engineering Research

No abstract provided.

Go to article

Deciding Joinability Modulo Ground Equations In Operational Type Theory, Adam Petcher, Aaron Stump Jan 2008

Deciding Joinability Modulo Ground Equations In Operational Type Theory, Adam Petcher, Aaron Stump

All Computer Science and Engineering Research

Operational Type Theory (OpTT) can be used to construct and check proofs related to programs, but the development of these proofs can be somewhat tedious. An algorithm is presented that can be used to automatically generate proofs of equality in OpTT. The algorithm takes as input a set of ground equations and two terms that should be tested for joinability modulo the supplied ground equations. The algorithm will equate the terms if and only if there exists an OpTT proof that can equate the two terms using only the proof rules related to evaluation under the operational semantics, symmetry, transitivity, …

Go to article

Ceg 404/604-01: Wireless Sensor Networks, Bin Wang Jan 2008

Ceg 404/604-01: Wireless Sensor Networks, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 860-01: Object-Oriented Programming, Krishnaprasad Thirunarayan Jan 2008

Ceg 860-01: Object-Oriented Programming, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course motivates the need for object-oriented programming, and studies, in detail, object-oriented programming techniques, languages, and technology. The lectures will focus on the foundations of OOP, while the student presentations will focus on the applications and extensions of Object Technology.

Go to article

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

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

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

A Meta Analysis Of Critical Success Factors For Computer Technology Projects, Ross A. Baker Jan 2008

A Meta Analysis Of Critical Success Factors For Computer Technology Projects, Ross A. Baker

Theses

Project managers are continually in pursuit of a magic formula that will deliver a successful project. Companies arc interested in formulas for project success because billions of dollars arc wasted each year, in U.S.A. Information Technology projects alone. through poorly managed or failed projects. Failing projects arc not only bad for the individual project team members, but a failed project's impacts emanate outward to cause companies to decline or die. In addition, the targeted customers who receive inferior products, late products, or no products at all (due to project failures) are significantly impacted as well. Because failed computer technology projects …

Go to article

Cs 714-01: Machine Learning, Shaojun Wang Jan 2008

Cs 714-01: Machine Learning, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 765-01: Foundations Of Neurocomputation, John C. Gallagher Jan 2008

Cs 765-01: Foundations Of Neurocomputation, John C. Gallagher

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 205-08: Introduction To Computers And Office Productivity Software, Kim Gros Jan 2008

Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing (intermediate), spreadsheets, database and presentation graphics using a case study approach where critical thinking and problem solving skills are required. Computer concepts are integrated throughout the course to provide an understanding of the basics of computing, the latest technological advances and how they are used in industry. Ethics and issues encountered in business are discussed to challenge students on societal impact of technology.

Go to article

Cs 790-03: Services Science, Yong Pei Jan 2008

Cs 790-03: Services Science, Yong Pei

Computer Science & Engineering Syllabi

Service Science, Management, and Engineering (SSME), often referred to
as Services Science, is emerging as a distinct field of study. It
encompasses numerous areas relating to the increasing role of services
in the world economy. In this course we will focus primarily on
services computing, or the technical aspects of services science, and
secondarily on the allied economic, business, and organizational aspects

Go to article

Cs 142-01: Computer Programming - Ii, Michael Ondrasek Jan 2008

Cs 142-01: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

The concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and handling runtime errors with an emphasis on program verification and testing. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: CS 141 (Computer Programming I) and MTH 127 (College Algebra) or equivalent.

Go to article

Cs 317-01: Numerical Methods Ii, Ronald F. Taylor Jan 2008

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

Computer Science & Engineering Syllabi

Continuation of CS/MTH/3161516. 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 sources of error in numerical methods. Special topics and applications presented as schedule permits. Four credit hours.

Go to article

Cs 208-01: Computer Programming For Business I, David M. Hutchison Jan 2008

Cs 208-01: Computer Programming For Business I, David M. Hutchison

Computer Science & Engineering Syllabi

CS 208 is the first in a sequence of two programming classes required for MIS majors. This course will introduce students to the basic concepts of programming. Examples are from business applications and display graphics and emphasis is on problem solving with the computer as a tool.

Go to article

Cs 214-01: Visual Basic Programming, Michael Ondrasek Jan 2008

Cs 214-01: Visual Basic Programming, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of object computer programming. Examples from and applications to a broad range of problems are given. No prior know ledge of programming is assumed. However, students should have a familiarity with programming concepts. The concepts covered will be applied in the Visual Basic programming language. 4 credit hours.

Go to article

Cs 240-01: Introduction To Computer Science, Jay Dejongh Jan 2008

Cs 240-01: Introduction To Computer Science, Jay Dejongh

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. Prerequisite: MTH 130 or MPL 5.

Go to article

First Prev Next Last