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

Engineering Commons

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

Computer Sciences

2008

Institution
Keyword
Publication
Publication Type
File Type

Articles 31 - 60 of 394

Full-Text Articles in Engineering

Ceg 420/620: Computer Architecture, Jack Jean Oct 2008

Ceg 420/620: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan Oct 2008

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in Python. You are expected to learn the language and solve a set of programming problems assigned to you from Dietel et al using Python available from http://www.python.org. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.


Cs 400/600: Data Structures And Software Design, Keke Chen Oct 2008

Cs 400/600: Data Structures And Software Design, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the implementation of classical data structures and control structures, an introduction to the fundamentals of algorithm design and analysis, and the basic problem solving techniques.


Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2008

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.


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

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


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

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.


Cs 766: Evolutionary Computation, Mateen M. Rizki Oct 2008

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.


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

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.


Cs 141: Computer Programming - I, Michael Ondrasek Oct 2008

Cs 141: Computer Programming - I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.


Cs 205: Computer Literacy And Office Automation, Ann Tirpack Oct 2008

Cs 205: Computer Literacy And Office Automation, Ann Tirpack

Computer Science & Engineering Syllabi

No abstract provided.


Cs 214: Visual Basic Programming, Vanessa Starkey Oct 2008

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.


Cs 241: Introduction To Computer Science Ii, Ronald F. Taylor Oct 2008

Cs 241: Introduction To Computer Science Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

A continuation of CS 240. Emphasis is on solving more complex problems using object oriented programming. Prerequisite: CS 240. 4 credit hours.


Cs 240: Introduction To Computer Science I, Mateen M. Rizki Oct 2008

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.


Cs 242: Computer Programming Iii, Tom S. Wailes Oct 2008

Cs 242: Computer Programming Iii, Tom S. Wailes

Computer Science & Engineering Syllabi

No abstract provided.


Cs 875: Semantic Web, Amit P. Sheth Oct 2008

Cs 875: Semantic Web, Amit P. Sheth

Computer Science & Engineering Syllabi

World Wide Web (Web 1.0, or "the Web," as we now know it) centers on documents and semistructured data in html, rss, and xml. The next generation Web, also called Web 2.0 and Web 3.0, has already started to emerge. Web 2.0 is about user-generated content, user participation such as through tagging, and social networking. Web 3.0, also called Semantic Web, is about labeling content such that machines can process it more intelligently and humans can exploit it more effectively. These labels or metadata add semantics (meaning) to data, and their formal representation enables powerful reasoning that leads not only …


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

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, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.


Novel Dynamic Representation And Control Of Power Networks Embedded With Facts Devices, Shahab Mehraeen, Jagannathan Sarangapani, Mariesa Crow Oct 2008

Novel Dynamic Representation And Control Of Power Networks Embedded With Facts Devices, Shahab Mehraeen, Jagannathan Sarangapani, Mariesa Crow

Electrical and Computer Engineering Faculty Research & Creative Works

FACTS devices have been shown to be powerful in damping power system oscillations caused by faults; however, in the multi machine control using FACTS, the control problem involves solving differential-algebraic equations of a power network which renders the available control schemes ineffective due to heuristic design and lack of know how to incorporate FACTS into the network. A method to generate nonlinear dynamic representation of a power system consisting of differential equations alone with universal power flow controller (UPFC) is introduced since differential equations are typically preferred for controller development. Subsequently, backstepping methodology is utilized to reduce the generator oscillations …


A Model Based Fault Detection Scheme For Nonlinear Multivariable Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani Oct 2008

A Model Based Fault Detection Scheme For Nonlinear Multivariable Discrete-Time Systems, Balaje T. Thumati, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel robust scheme is developed for detecting faults in nonlinear discrete time multi-input and multi-output systems in contrast with the available schemes that are developed in continuous-time. Both state and output faults are addressed by considering separate time profiles. The faults, which could be incipient or abrupt, are modeled using input and output signals of the system. By using nonlinear estimation techniques, the discrete-time system is monitored online. Once a fault is detected, its dynamics are characterized using an online approximator. A stable parameter update law is developed for the online approximator scheme in discrete-time. The …


Joint Adaptive Distributed Rate And Power Control For Wireless Networks, James W. Fonda, Jagannathan Sarangapani, Steve Eugene Watkins Oct 2008

Joint Adaptive Distributed Rate And Power Control For Wireless Networks, James W. Fonda, Jagannathan Sarangapani, Steve Eugene Watkins

Electrical and Computer Engineering Faculty Research & Creative Works

A novel adaptive distributed rate and power control (ADRPC) protocol is introduced for wireless networks. The proposed controller contrasts from others by providing nonlinear compensation to the problem of transmission power and bit-rate adaptation. The protocol provides control of both signal-to-interference ratio (SIR) and quality-of-service (QoS) support to bit-rate adaptation. Bit-rate adaptation is performed by local estimation of congestion levels, rendering little packet overhead, using Lyapunov based adaptive control methods. Performance of the proposed control scheme is shown through analytical proof and simulation examples.


Ceg/Ee 260: Digital Computer Hardware Switching Circuits, John C. Gallagher Oct 2008

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, John C. Gallagher

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching
functions, logic design of combinational and sequential circuits using TTL,
combinational logic design with MSI and LSI, busing, storage elements, and
instrumentation.


Ceg 777: Computer Aided Geometric Design, Arthur A. Goshtasby Oct 2008

Ceg 777: Computer Aided Geometric Design, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers the fundamentals of geometric modeling, including design of curves and surfaces, composite curves and surfaces, and subdivision techniques for creating free-form shapes.


Ceg 770: Computer Engineering Mathematics, Yong Pei Oct 2008

Ceg 770: Computer Engineering Mathematics, Yong Pei

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.


Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum Oct 2008

Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course covers advanced topics in software engineering. Aspects of problem specification, design, verification, and evaluation are discussed. We will focus on design methods, including software patterns and software architecture, plus some advanced topics involving formal methods of software specification or evaluation using software metrics. Students will participate in team projects to apply the methods discussed.


Ceg 399: Introduction To Software Testing, John A. Reisner Oct 2008

Ceg 399: Introduction To Software Testing, John A. Reisner

Computer Science & Engineering Syllabi

This course covers software testing strategies, along with established best practices, so students learn how to test their software in a complete and systematic (vice ad-hoc) manner. Particular attention is paid to planning, writing, and executing software testing documentation, i.e., software test plan, to include documented results. Various projects are assigned, designed to illustrate various challenges associated with software testing, and to reinforce the strategies and techniques used to overcome these challenges


Ceg 221: Advanced C Programming For Engineers, Robert Helt Oct 2008

Ceg 221: Advanced C Programming For Engineers, Robert Helt

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, array, pointers, structures as well as sorting algorithms, linked lists, complex numbers, stacks, queues, hash tables, and binary trees.


Cs 712: Advanced Topics In Artificial Intelligence: Inference Graphical Models, Shaojun Wang Oct 2008

Cs 712: Advanced Topics In Artificial Intelligence: Inference Graphical Models, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.


Cs 415: Social Implications Of Computing, Leo Finkelstein Oct 2008

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.


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

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

Computer Science & Engineering Syllabi

No abstract provided.


Cs 790: Information Security, Meilin Liu Oct 2008

Cs 790: Information Security, Meilin Liu

Computer Science & Engineering Syllabi

This course gives a comprehensive study of security vulnerabilities in information systems and the basic techniques for developing secure applications and practicing safe computing. Topics include: Conventional encryption; Hashing functions and data integrity; Public-key encryption (RSA, Elliptic-Curve); Digital signature; Block cipher; Watermarking for multimedia; Security standards and applications; Building secure software and systems; Management and analysis of security; Legal and ethical issues in computer security.


Cs 209: Computer Programming For Business Ii, David M. Hutchison Oct 2008

Cs 209: Computer Programming For Business Ii, David M. Hutchison

Computer Science & Engineering Syllabi

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