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

Computer Engineering Commons™

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

Computer Sciences

PDF

2010

Institution
Keyword
Publication
Publication Type

Articles 31 - 60 of 370

Full-Text Articles in Computer Engineering

Cs 499/699: Cloud Computing, Keke Chen Oct 2010

Cs 499/699: Cloud Computing, Keke Chen

Computer Science & Engineering Syllabi

This is an introductory course to cloud computing. In this course, we will explore a few aspects of cloud computing virtualization, security & privacy, Amazon Web Services, and interactive web-based applications. Students are expected in the class discussion is strongly encouraged. Guest speakers might be invited for some particular topics. (3 Hours)

Go to article

Cs 705: Introduction To Data Mining, Guozhu Dong Oct 2010

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel and useful knowledge from large amounts of data. This course introduces and studies the fundamental concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, mining of spatial/text/sequence/graph/time-series etc data, privacy, data mining applications, and other topics of interest. 3 hours lecture, 2 hours lab.

Go to article

Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan Oct 2010

Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.

Go to article

Cs 784: Programming Languages, Prabhaker Mateti Oct 2010

Cs 784: Programming Languages, Prabhaker Mateti

Computer Science & Engineering Syllabi

Programming paradigms and concepts for high level programming languages. Techniques for formal specification. 4.000 Credit hours. Prerequisites: CS 480/680.

Go to article

Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer Oct 2010

Cs 740: Algorithms, Complexity And The Theory Of Computability, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 466/666: Introduction To Formal Languages, Guozhu Dong Oct 2010

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

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 syntax of languages can be defined using grammars and the patterns accepted by 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, by Thomas Sudkamp.

Go to article

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang Oct 2010

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

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 302-01: Introduction To Oracle Sql Databases, Karen Meyer Oct 2010

Cs 302-01: Introduction To Oracle Sql Databases, Karen Meyer

Computer Science & Engineering Syllabi

Relational client server database design and access techniques. Includes building database tables, writing SQL and PL/SQL statements and programs and developing user interfaces using forms.

Go to article

Cs 214: Visual Basic Programming, Vanessa Starkey Oct 2010

Cs 214: Visual Basic Programming, Vanessa Starkey

Computer Science & Engineering Syllabi

This course will cover the fundamentals of object-oriented computer
programming including design, structure, debugging, and testing. Visual Basic 2008 will be used for
developing programs.

Go to article

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer Oct 2010

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer

Computer Science & Engineering Syllabi

Theory-oriented approach to the application of contemporary algorithms to bioinformatics. Graph theory, complexity theory, dynamic programming and optimization techniques are introduced in the context of application toward solving specific computational problems in molecular genetics. 4 credit hours.

Go to article

Cs 206: Computer Software Productivity Tools, John P. Herzog Oct 2010

Cs 206: Computer Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including advanced topics in 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 advanced 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

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

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 770-01: Computer Engineering Mathematics, Bin Wang Oct 2010

Ceg 770-01: Computer Engineering Mathematics, Bin Wang

Computer Science & Engineering Syllabi

Computer engineering and science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.

Go to article

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

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 modern technologies such as SQL database programming, networks, and distributed computing with CORBA, electronic and hypertext (HTML) documents, and multimedia.

Go to article

Ceg 453/653-01: Embedded Systems, Jack Jean Oct 2010

Ceg 453/653-01: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 702-01: Advanced Computer Networks, Yong Pei Oct 2010

Ceg 702-01: Advanced Computer Networks, Yong Pei

Computer Science & Engineering Syllabi

This course provides an in-depth examination of the fundamental concepts and principles in communications and computer networks. Topics include: queuing analysis, ATM, frame relay, performance analysis of routings, and flow and congestion controls.

Go to article

Ceg 233-01: Linux And Windows, Prabhaker Mateti Oct 2010

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. Prerequisites: CS 240 or CS 220 or equivalent.

Go to article

Ceg 260-01: Digital Computer Hardware/Switching Circuits, Meilin Liu Oct 2010

Ceg 260-01: Digital Computer Hardware/Switching Circuits, Meilin Liu

Computer Science & Engineering Syllabi

We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.

Go to article

Ceg 220-01: Introduction To C Programming For Engineers, Jay Dejongh Oct 2010

Ceg 220-01: Introduction To C Programming For Engineers, Jay Dejongh

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). The course includes a scheduled laboratory section for which you must register.

Go to article

Ceg 210-01: Pc Networking I, Chris P. Fickert Oct 2010

Ceg 210-01: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

Introduction to networking technologies including infrastructure and architectures, standards, protocols and directory services, administration, security and management. Integrated lecture and lab.

Go to article

Ceg 221-01: Introduction To C Programming For Engineers, Jay Dejongh Oct 2010

Ceg 221-01: Introduction To C Programming For Engineers, Jay Dejongh

Computer Science & Engineering Syllabi

This course introduces advanced constructs, algorithms, and data structures in the C programming language. Emphasis is on problem solving and techniques useful to engineers. Topics include functions, arrays, pointers, and structures as well as sorting algorithms, linked lists, binary files, complex numbers, and numerical methods applications. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).

Go to article

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

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 C/C++ or Fortran is very important. A basic knowledge of matrix algebra is …

Go to article

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

Ceg 402/602-01: 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 e-education.
•Gain hands-on experience with programming techniques for network
protocols.
•Obtain background for original research in computer networks.

Go to article

Ceg 420/620-01: Computer Architecture, Jack Jean Oct 2010

Ceg 420/620-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 360/560-01: Digital System Design, Travis E. Doom Oct 2010

Ceg 360/560-01: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CE0260.

Go to article

Ceg 436/636-01: Mobile Computing, Yong Pei Oct 2010

Ceg 436/636-01: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 724-01: Computer Vision I, Arthur A. Goshtasby Oct 2010

Ceg 724-01: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic algorithms for low-level and mid-level vision. The algorithms deal with edge detection and image segmentation, feature detection and matching, image registration, and image stitching. Also covered in the course are computer vision applications to computer graphics, such as computational photography and image-based rendering.

Go to article

Ceg 360/560-01: Digital System Design, Travis E. Doom Oct 2010

Ceg 360/560-01: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG260.

Go to article

Wireless Sensing Without Sensors: An Experimental Study Of Motion/Intrusion Detection Using Rf Irregularity, Wei Qi Lee, Winston K. G. Seah, Hwee-Pink Tan, Zexi Yao Oct 2010

Wireless Sensing Without Sensors: An Experimental Study Of Motion/Intrusion Detection Using Rf Irregularity, Wei Qi Lee, Winston K. G. Seah, Hwee-Pink Tan, Zexi Yao

Research Collection School Of Computing and Information Systems

Motion and intrusion detection are often cited as wireless sensor network (WSN) applications with typical configurations comprising clusters of wireless nodes equipped with motion sensors to detect human motion. Currently, WSN performance is subjected to several constraints, namely radio irregularity and finite on-board computation/energy resources. Radio irregularity in radio frequency (RF) propagation rises to a higher level in the presence of human activity due to the absorption effect of the human body. In this paper, we investigate the feasibility of monitoring RF transmission for the purpose of intrusion detection through experimentation. With empirical data obtained from the Crossbow TelosB platform …

Go to article

Reputation-Based Internet Protocol Security: A Multilayer Security Framework For Mobil Ad Hoc Networks, Timothy H. Lacey Sep 2010

Reputation-Based Internet Protocol Security: A Multilayer Security Framework For Mobil Ad Hoc Networks, Timothy H. Lacey

Theses and Dissertations

This research effort examines the theory, application, and results for a Reputation-based Internet Protocol Security (RIPSec) framework that provides security for an ad-hoc network operating in a hostile environment. In RIPSec, protection from external threats is provided in the form of encrypted communication links and encryption-wrapped nodes while internal threats are mitigated by behavior grading that assigns reputations to nodes based on their demonstrated participation in the routing process. Network availability is provided by behavior grading and round-robin multipath routing. If a node behaves faithfully, it earns a positive reputation over time. If a node misbehaves (for any number of …

Go to article

First Prev Next Last