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

Engineering Commons™

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

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 15091 - 15120 of 17316

Full-Text Articles in Engineering

Cs 781-01: Compiler Design And Construction Ii, Krishnaprasad Thirunarayan Jan 2007

Cs 781-01: Compiler Design And Construction Ii, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is a continuation ofCS780 covering the theory and practice of compiler design. Topics emphasized are semantic analysis, code generation, and optimization.


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

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.


Cs 790-01: Multimedia Coding And Communication (I), Yong Pei Jan 2007

Cs 790-01: Multimedia Coding And Communication (I), Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.


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

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

Computer Science & Engineering Syllabi

Continuation of CS/MTH/316/516. 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.


Cs 891-01: Information Retrieval, Extraction, And Management, Krishnaprasad Thirunarayan Jan 2007

Cs 891-01: Information Retrieval, Extraction, And Management, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course expects an advanced Ph.D. student to (i) review background material in the area of Information Retrieval, Extraction, and Management, and (ii) develop/deliver a presentation on a mutually acceptable topic.


Cs 409/609-01: Principles Of Artificial Intelligence, Shaojun Wang Jan 2007

Cs 409/609-01: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.


Cs 466/666-01: Introduction To Formal Languages, Thomas Sudkamp Jan 2007

Cs 466/666-01: Introduction To Formal Languages, Thomas Sudkamp

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the languages can be defined using a rule-based systems called grammars and patterns can be recognized by the computations of finite state machines. Along with presenting the fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science.


Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong Jan 2007

Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Data models including entity-relationship (ER) and relational are presented. Physical implementation (data organization and indexing) methods are discussed. Query languages including SQL, relational algebra, relational calculus, and QBE are introduced. Students will also gain experience in creating and manipulating a database.

The course is mostly concerned with the design and querying of databases. A follow up course, CS701, is concerned with the design of system functions for managing databases.


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

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

Computer Science & Engineering Syllabi

The objective of this course is to use the formal algorithmic system provided by Turing machines as a tool to analyze the complexity of decision and optimization problems and the algorithms that solve them. The topics to be covered include

•the definition of the time and space complexity of a deterministic algorithm

•the classes of deterministic polynomial and non-polynomial time languages

•the complexity of nondeterministic algorithms

•the P=NP question (relationship between solvability by deterministic and
nondeterministic polynomial time algorithms)

•the implications oaf solution to the P=NP question

•NP completeness and examples of NP complete problems

•classes of NP complete problems …


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

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 cod~.


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

Ceg 468/668: 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: (1) 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 smartly throughout an organization).


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

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

Computer Science & Engineering Syllabi

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


Ceg 725-01: Computer Vision Ii, Bin Wang Jan 2007

Ceg 725-01: Computer Vision Ii, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 499/699-01: Wireless Sensor Networks, Bin Wang Jan 2007

Ceg 499/699-01: Wireless Sensor Networks, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 460/660-01: Introduction To Software Computer Engineering, Robert J. Weber Jan 2007

Ceg 460/660-01: Introduction To Software Computer Engineering, Robert J. Weber

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.


Ceg 726-01: Pattern Recognition, Arthur A. Goshtasby Jan 2007

Ceg 726-01: Pattern Recognition, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 498-01: Team Projects I And Ii, John C. Gallagher Jan 2007

Ceg 498-01: Team Projects I And Ii, John C. Gallagher

Computer Science & Engineering Syllabi

CEG 498 (Team Projects I and II) 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 journals and on the quality of their collective efforts as reflected in group generated products.


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

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.


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

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.


Cs 206-01: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog Jan 2007

Cs 206-01: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of word processing, spreadsheets, databases, and presentation software and web design using Microsoft Word, Microsoft FrontPage, Microsoft Excel, Access, and PowerPoint covering the following topics.
Microsoft Word 2003:
Tutorial 5: Creating Styles, Outlines, Tables, and Tables of Contents

Tutorial 6: Creating Form Letters and Mailing Labels

Microsoft Excel 2003:
Tutorial 5: Working with Excel Lists

Tutorial 6: Working with Multiple Worksheets and Workbooks

Tutorial 7: Working with Excel's Editing and Web Tools

Tutorial 8: Developing an Excel Application Appendix A: Working with …


Ceg 750-01: Microprocessor, Jack Jean Jan 2007

Ceg 750-01: Microprocessor, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 461/661-01: Object-Oriented Programming And Design, Thomas C. Hartrum Jan 2007

Ceg 461/661-01: Object-Oriented Programming And Design, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Study of object-oriented design and programming. Programming topics emphasize the core concepts of encapsulation, inheritance, polymorphism, and dynamic binding. Additional topics include class organization, software maintenance, and design of reusable components. There is a project to be implemented in a modem object-oriented language such as Java or C++.


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

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.


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

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


Cs 240-01: Computer Science I, L. Jane Lin Jan 2007

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

Computer Science & Engineering Syllabi

No abstract provided.


Resource-Constraint And Scalable Data Distribution Management For High Level Architecture, Pankaj Gupta Jan 2007

Resource-Constraint And Scalable Data Distribution Management For High Level Architecture, Pankaj Gupta

Electronic Theses and Dissertations

In this dissertation, we present an efficient algorithm, called P-Pruning algorithm, for data distribution management problem in High Level Architecture. High Level Architecture (HLA) presents a framework for modeling and simulation within the Department of Defense (DoD) and forms the basis of IEEE 1516 standard. The goal of this architecture is to interoperate multiple simulations and facilitate the reuse of simulation components. Data Distribution Management (DDM) is one of the six components in HLA that is responsible for limiting and controlling the data exchanged in a simulation and reducing the processing requirements of federates. DDM is also an important problem …


Developing Strand Space Based Models And Proving The Correctness Of The Ieee 802.11i Authentication Protocol With Restricted Sec, Zeeshan Furqan Jan 2007

Developing Strand Space Based Models And Proving The Correctness Of The Ieee 802.11i Authentication Protocol With Restricted Sec, Zeeshan Furqan

Electronic Theses and Dissertations

The security objectives enforce the security policy, which defines what is to be protected in a network environment. The violation of these security objectives induces security threats. We introduce an explicit notion of security objectives for a security protocol. This notion should precede the formal verification process. In the absence of such a notion, the security protocol may be proven correct despite the fact that it is not equipped to defend against all potential threats. In order to establish the correctness of security objectives, we present a formal model that provides basis for the formal verification of security protocols. We …


Augmentation In Visual Reality (Avr), Yunjun Zhang Jan 2007

Augmentation In Visual Reality (Avr), Yunjun Zhang

Electronic Theses and Dissertations

Human eyes, as the organs for sensing light and processing visual information, enable us to see the real world. Though invaluable, they give us no way to "edit" the received visual stream or to "switch" to a different channel. The invention of motion pictures and computer technologies in the last century enables us to add an extra layer of modifications between the real world and our eyes. There are two major approaches to modifications that we consider here, offline augmentation and online augmentation. The movie industry has pushed offline augmentation to an extreme level; audiences can experience visual surprises that …


Bluetooth-Base Worm Modeling And Simulation, Haiou Xiang Jan 2007

Bluetooth-Base Worm Modeling And Simulation, Haiou Xiang

Electronic Theses and Dissertations

Bluetooth is one of the most popular technologies in the world in the new century. Meanwhile it attracts attackers to develop new worm and malicious code attacking Bluetooth wireless network. So far the growth of mobile malicious code is very fast and they have become a great potential threat to our society. In this thesis, we study Bluetooth worm in Mobile Wireless Network. Firstly we investigate the Bluetooth technology and several previously appeared Bluetooth worms, e.g. "Caribe","Comwar", and we find the infection cycle of a Bluetooth worm. Next, we develop a new simulator, Bluetooth Worm simulator (BTWS), which simulates Bluetooth …


Graph Theoretic Modeling: Case Studies In Redundant Arrays Of Independent Disks And Network Defense, Sanjeeb Nanda Jan 2007

Graph Theoretic Modeling: Case Studies In Redundant Arrays Of Independent Disks And Network Defense, Sanjeeb Nanda

Electronic Theses and Dissertations

Graph theoretic modeling has served as an invaluable tool for solving a variety of problems since its introduction in Euler's paper on the Bridges of Königsberg in 1736 . Two amongst them of contemporary interest are the modeling of Redundant Arrays of Inexpensive Disks (RAID), and the identification of network attacks. While the former is vital to the protection and uninterrupted availability of data, the latter is crucial to the integrity of systems comprising networks. Both are of practical importance due to the continuing growth of data and its demand at increasing numbers of geographically distributed locations through the use …