Engineering Commons^™

Neural-Network-Based State Feedback Control Of A Nonlinear Discrete-Time System In Nonstrict Feedback Form, Pingan He, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a suite of adaptive neural network (NN) controllers is designed to deliver a desired tracking performance for the control of an unknown, second-order, nonlinear discrete-time system expressed in nonstrict feedback form. In the first approach, two feedforward NNs are employed in the controller with tracking error as the feedback variable whereas in the adaptive critic NN architecture, three feedforward NNs are used. In the adaptive critic architecture, two action NNs produce virtual and actual control inputs, respectively, whereas the third critic NN approximates certain strategic utility function and its output is employed for tuning action NN weights …

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

Electrical and Computer Engineering Faculty Research & Creative Works

A new fault detection and prognostics (FDP) framework is introduced for uncertain nonlinear discrete time system by using a discrete-time nonlinear estimator which consists of an online approximator. A fault is detected by monitoring the deviation of the system output with that of the estimator output. Prior to the occurrence of the fault, this online approximator learns the system uncertainty. In the event of a fault, the online approximator learns both the system uncertainty and the fault dynamics. A stable parameter update law in discrete-time is developed to tune the parameters of the online approximator. This update law is also …

Distributing Complementary Resources Across Multiple Periods With Stochastic Demand, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments, we show that under stochastic conditions the performance variation of the process decreases as the time frame length (time …

Neural Network Output Feedback Control Of A Quadrotor Uav, Jagannathan Sarangapani, Travis Alan Dierks

Electrical and Computer Engineering Faculty Research & Creative Works

A neural network (NN) based output feedback controller for a quadrotor unmanned aerial vehicle (UAV) is proposed. The NNs are utilized in the observer and for generating virtual and actual control inputs, respectively, where the NNs learn the nonlinear dynamics of the UAV online including uncertain nonlinear terms like aerodynamic friction and blade flapping. It is shown using Lyapunov theory that the position, orientation, and velocity tracking errors, the virtual control and observer estimation errors, and the NN weight estimation errors for each NN are all semi-globally uniformly ultimately bounded (SGUUB) in the presence of bounded disturbances and NN functional …

Ceg 420/620: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 210: Pc Networking I, Karen Meyer

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.

Ceg 433/633: Operating Systems, Prabhaker Mateti

Computer Science & Engineering Syllabi

Overview of operating systems internals. File-system usage and design, process usage and control, virtual memory, multi user systems, access control. Course projects use C++ language.

Ceg 460/660: Introduction To Software Computer Engineering, Jeffrey Mcdonald

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 sot1ware, 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 724: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic techniques for low-level and some mid-level vision. The techniques include: camera calibration, image filtering and edge detection, image segmentation and feature selection, and stereo depth perception.

Ceg 436/636: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

Increasingly.. people, computers and microelectronic devices are being linked together to bring to life the communications mantra: anybody, anything, anytime, anywhere. This junior/senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help engineering and computer science students establish a solid foundation in concepts, architecture, design, and performance evaluation of mobile computing principle, protocols and applications. It will also introduce students to a few hot topics in wireless networking and mobile computing research such as mobile IP, wireless TCP, 802. l l, agent techniques, etc. The course …

Ceg 220: Introduction To C Programming For Engineers I, 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).

Ceg 476/676: Computer Graphics I, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D objects
as well as manipulating and rendering the objects using OpenGL.
The outline of the course is as follows:

Introduction

• Geometric primitives
• Attributes of geometric primitives
• Antialiasing techniques
• Homogeneous coordinate system
• 2-D and 3-D viewing transformations
• Structures and hierarchical modeling
• Input devices and interactive techniques
• Visible surface detection methods

Ceg 498: 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.

Ceg 355: 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.

This course is concerned with the techniques of designing and implementing distributed business software. Emphasis is on developing graphical user interfaces (GUIs) using Java Swing classes, storing and accessing data in a relational database using SQL, and implementing a distributed system using CORBA technology. Especially in light of Java and CORBA, there is a focus on object-oriented programming. The overall objective is to make the student aware of the technology available to …

Ceg 720: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer, pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing.

Ceg 402/602: 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.

Ceg 434/634: Concurrent Software Design, Yong Pei

Computer Science & Engineering Syllabi

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

Ceg 260: 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.

Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operation of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument pasing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used.

Ceg 360/560 Ee 451/651: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 420/620: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

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

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

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

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

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

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

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

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.