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

Engineering Commons™

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

Computer Sciences

Series

2008

Institution
Keyword
Publication

Articles 181 - 210 of 238

Full-Text Articles in Engineering

Ceg 233-01: Linux And Windows, Prabhaker Mateti Jan 2008

Ceg 233-01: Linux And Windows, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs.

Go to article

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt Jan 2008

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).

Go to article

Ceg 355-01: Introduction To The Design Of Information Technology Systems, Thomas C. Hartrum Jan 2008

Ceg 355-01: Introduction To The Design Of Information Technology Systems, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Introduction to the design of information systems comprising modem technologies such as SQL database programming, networks, and distributed computing with CORBA, electronic and hypertext (HTML) documents, and multimedia.

Go to article

Ceg 320/520-01: Computer Organization, Michael L. Raymer Jan 2008

Ceg 320/520-01: Computer Organization, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 402/602-01: Introduction To Computer Communication, Bin Wang Jan 2008

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

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 434/634-01: Concurrent Software Design, Paul Bender Jan 2008

Ceg 434/634-01: Concurrent Software Design, Paul Bender

Computer Science & Engineering Syllabi

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

Go to article

Ceg 435/635-01: Distributed Computing And Systems, Yong Pei Jan 2008

Ceg 435/635-01: Distributed Computing And Systems, Yong Pei

Computer Science & Engineering Syllabi

Study of process coordination, client-server computing, distributed objects, transactions, concurrency control, recovery of transactions, network and distributed file systems, distributed operating systems, and fault-tolerant computing.

Go to article

Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum Jan 2008

Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Go to article

Ceg 468/668-01: Managing The Software Development Process, John A. Reisner Jan 2008

Ceg 468/668-01: Managing The Software Development Process, John A. Reisner

Computer Science & Engineering Syllabi

This course will cover some of the challenges and issues associated with managing software projects. Emphasis will occur on two fronts: (I) the software project manager's view (that is, what considerations and obstacles confront project managers during software development), and (2) the organizational view (that is, how organizations can foster a climate where software project management is performed effectively throughout an organization).

Go to article

Ceg 750-01: Microprocessor, Jack Jean Jan 2008

Ceg 750-01: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 477/677-01: Computer Graphics Ii, Thomas Wischgoll Jan 2008

Ceg 477/677-01: Computer Graphics Ii, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 498-01: Design Experience, Thomas C. Hartrum Jan 2008

Ceg 498-01: Design Experience, Thomas C. Hartrum

Computer Science & Engineering Syllabi

CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journal and on the quality of their collective efforts as reflected in group generated products.

Go to article

Ceg 790-01: Introduction To Scientific Visualization, Thomas Wischgoll Jan 2008

Ceg 790-01: Introduction To Scientific Visualization, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 820-01: Computer Architecture Ii, Soon M. Chung Jan 2008

Ceg 820-01: Computer Architecture Ii, Soon M. Chung

Computer Science & Engineering Syllabi

Continuation of CEG720 with more details on multiprocessor systems, parallel processing, and performance analysis.

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 416-01: Matrix Computations, Ronald F. Taylor Jan 2008

Ceg 416-01: Matrix Computations, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is a survey of numerical methods in linear algebra for application to problems in engineering and the sciences. Emphasis is on using modern software tools on high performance computing systems. This course covers the mathematics of linear equations, eigenvalue problems, singular value decomposition, and least squares. Material covered will be relevant to applications areas such as structural analysis, heat transfer, neural networks, mechanical vibrations, and image processing in biomedical engineering. A familiarity with MATLAB is useful, and the ability to program in languages such as CIC++ or Fortran is very important. A basic knowledge of matrix algebra is …

Go to article

Ceg 233-01: Linux And Windows, Prabhaker Mateti Jan 2008

Ceg 233-01: Linux And Windows, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs.

Go to article

Scheduling Design And Verification For Open Soft Real-Time Systems, Robert Glaubius, Terry Tidwell, William D. Smart, Christopher Gill Jan 2008

Scheduling Design And Verification For Open Soft Real-Time Systems, Robert Glaubius, Terry Tidwell, William D. Smart, Christopher Gill

All Computer Science and Engineering Research

Open soft real-time systems, such as mobile robots, experience unpredictable interactions with their environments and yet must respond both adaptively and with reasonable temporal predictability. New scheduling approaches are needed to address the demands of such systems, in which many of the assumptions made by traditional real-time scheduling theory do not hold. In previous work we established foundations for a scheduling policy design and verification approach for open soft real-time systems, that can use different decision models, e.g., a Markov Decision Process (MDP), to capture the nuances of their scheduling semantics. However, several important refinements to the preliminary techniques developed …

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

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

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

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

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

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

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

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

Columbia University/Vireo-Cityu/Irit Trecvid2008 High-Level Feature Extraction And Interactive Video Search, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky Jan 2008

Columbia University/Vireo-Cityu/Irit Trecvid2008 High-Level Feature Extraction And Interactive Video Search, Shih-Fu Chang, Junfeng He, Yu-Gang Jiang, Elie El Khoury, Chong-Wah Ngo, Akira Yanagawa, Eric Zavesky

Research Collection School Of Computing and Information Systems

In this report, we present overview and comparative analysis of our HLF detection system, which achieves the top performance among all type-A submissions in 2008. We also describe preliminary evaluation of our video search system, CuZero, in the interactive search task.

Go to article

Covert Encryption And Document Authentication Using Texture Coding, Jonathan Blackledge, Mary Hallot Jan 2008

Covert Encryption And Document Authentication Using Texture Coding, Jonathan Blackledge, Mary Hallot

Articles

With the improvements in the quality of Commercial-Off-The-Shelf (COTS) printing and scanning devices, the ability to counterfeit documents has become a widespread problem. Consequently, there has been an increasing demand to develop digital watermarking techniques which can be applied to both electronic and printed images (and documents) that can be authenticated, prevent unauthorized copying and withstand abuse and degradation. In this paper , a new approach to digital watermarking is presented and a range of possible applications are considered. The process is defined by using concepts and techniques borrowed from Cryptography. It is based on computing a 'scramble image' by …

Go to article

Generalized Hamilton-Jacobi-Bellman Formulation-Based Neural Network Control Of Affine Nonlinear Discrete-Time Systems, Zheng Chen, Jagannathan Sarangapani Jan 2008

Generalized Hamilton-Jacobi-Bellman Formulation-Based Neural Network Control Of Affine Nonlinear Discrete-Time Systems, Zheng Chen, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, we consider the use of nonlinear networks towards obtaining nearly optimal solutions to the control of nonlinear discrete-time (DT) systems. The method is based on least squares successive approximation solution of the generalized Hamilton-Jacobi-Bellman (GHJB) equation which appears in optimization problems. Successive approximation using the GHJB has not been applied for nonlinear DT systems. The proposed recursive method solves the GHJB equation in DT on a well-defined region of attraction. The definition of GHJB, pre-Hamiltonian function, HJB equation, and method of updating the control function for the affine nonlinear DT systems under small perturbation assumption are proposed. …

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