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 13141 - 13170 of 17332

Full-Text Articles in Engineering

Model-Free H∞ Stochastic Optimal Design For Unknown Linear Networked Control System Zero-Sum Games Via Q-Learning, Hao Xu, Sarangapani Jagannathan Nov 2011

Model-Free H∞ Stochastic Optimal Design For Unknown Linear Networked Control System Zero-Sum Games Via Q-Learning, Hao Xu, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, stochastic optimal strategy for unknown linear networked control system (NCS) quadratic zero-sum games related to H∞ optimal control in the presence of random delays and packet losses is solved in forward-in-time manner. This approach does not require the knowledge of the system matrices since it uses Q-learning. the proposed stochastic optimal control approach, referred as adaptive dynamic programming (ADP), involves solving the action dependent Q-function Q (z, u, d) of the zero-sum game instead of solving the state dependent value function J (z) which satisfies a corresponding Game Theoretic Riccati equation (GRE). an adaptive estimator (AE) is …

Go to article

Nn/Rise-Based Asymptotic Tracking Control Of Uncertain Nonlinear Systems, Qinmin Yang, Sarangapani Jagannathan, Youxian Sun Nov 2011

Nn/Rise-Based Asymptotic Tracking Control Of Uncertain Nonlinear Systems, Qinmin Yang, Sarangapani Jagannathan, Youxian Sun

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents a novel control methodology for the tracking control of a high-order continuous time nonlinear systems with unknown dynamics and external disturbance. the control signal consists of the robust integral of the sign of the error (RISE) feedback signal multiplied with an adaptive gain plus neural network (NN) output. the two-layer NN learns the system dynamics in an online manner while residual reconstruction errors and the external bounded system disturbances are overcome by the RISE signal. Semi-global asymptotic tracking performance is theoretically guaranteed by using the Lyapunov standard method, while the NN weights and all other signals are …

Go to article

An Online Model-Based Fault Diagnosis Scheme For Hvac Systems, Balaje T. Thumati, Miles A. Feinstein, James W. Fonda, Alfred Turnbull, Fay J. Weaver, Mark E. Calkins, S. Jagannathan Nov 2011

An Online Model-Based Fault Diagnosis Scheme For Hvac Systems, Balaje T. Thumati, Miles A. Feinstein, James W. Fonda, Alfred Turnbull, Fay J. Weaver, Mark E. Calkins, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a model-based fault detection and isolation (FDI) scheme with online fault learning capabilities is proposed for HVAC systems. an observer comprising of an online approximator in discrete-time (OLAD) and a robust term is used for detection. a fault is detected if the generated detection residual, which is defined as the error between the observer outputs and HVAC system states, exceeds an apriori chosen threshold. the OLAD term in the FD observer learns the fault dynamics online while the robust term guarantees asymptotic estimation of the system states. Subsequent to detection, a fault isolation observer, which comprises of …

Go to article

Artificial Immune System-Based Diagnostics And Prognostics Scheme And Its Experimental Verification, Gary R. Halligan, Balaje T. Thumati, S. Jagannathan Nov 2011

Artificial Immune System-Based Diagnostics And Prognostics Scheme And Its Experimental Verification, Gary R. Halligan, Balaje T. Thumati, S. Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, a novel fault diagnostics and prediction (FDP) scheme is introduced by using artificial immune system (AIS) as an online approximator for a class of nonlinear discrete-time systems. Traditionally, AIS is considered as an offline tool for fault detection (FD). However, in this paper, AIS is utilized as an online approximator in discrete time (OLAD) along with a robust adaptive term in the proposed fault diagnostics observer. using the fact that the system outputs are alone measurable, an output residual is determined by comparing the observer and system outputs and a fault is detected if this output residual …

Go to article

Investigating The Role Of The Internet In Women And Minority Stem Participation: A Case Study Of Two Florida Engineering Programs, Arland Nguema Ndong Nov 2011

Investigating The Role Of The Internet In Women And Minority Stem Participation: A Case Study Of Two Florida Engineering Programs, Arland Nguema Ndong

USF Tampa Graduate Theses and Dissertations

Despite our awareness of the fascination modern humans have with the Internet, little is known about how and why colleges and universities create and maintain Websites. At the most general level, in this case study, I hypothesize that university Websites serve as communication and marketing tools in attracting students. At the most specific level, I postulate that civil engineering programs with Web pages depicting images of women and minorities would be more successful in recruiting and retaining women and students of color than civil engineering programs with Web pages displaying fewer or no images of women and minorities. The primary …

Go to article

Measuring Stability Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar Nov 2011

Measuring Stability Of Threshold-Based Feature Selection Techniques, Huanjing Wang, Taghi Khoshgoftaar

Computer Science Faculty Publications

Feature selection has been applied in many domains, such as text mining and software engineering. Ideally a feature selection technique should produce consistent out- puts regardless of minor variations in the input data. Re- searchers have recently begun to examine the stability (robustness) of feature selection techniques. The stability of a feature selection method is defined as the degree of agreement between its outputs to randomly-selected subsets of the same input data. This study evaluated the stability of 11 threshold-based feature ranking techniques (rankers) when applied to 16 real-world software measurement datasets of different sizes. Experimental results demonstrate that AUC …

Go to article

Decentralized Optimal Control Of A Class Of Interconnected Nonlinear Discrete-Time Systems By Using Online Hamilton-Jacobi-Bellman Formulation, Shahab Mehraeen, Sarangapani Jagannathan Nov 2011

Decentralized Optimal Control Of A Class Of Interconnected Nonlinear Discrete-Time Systems By Using Online Hamilton-Jacobi-Bellman Formulation, Shahab Mehraeen, Sarangapani Jagannathan

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, the direct neural dynamic programming technique is utilized to solve the Hamilton-Jacobi-Bellman equation forward-in-time for the decentralized near optimal regulation of a class of nonlinear interconnected discrete-time systems with unknown internal subsystem and interconnection dynamics, while the input gain matrix is considered known. Even though the unknown interconnection terms are considered weak and functions of the entire state vector, the decentralized control is attempted under the assumption that only the local state vector is measurable. the decentralized nearly optimal controller design for each subsystem consists of two neural networks (NNs), an action NN that is aimed to …

Go to article

A Pomdp Model For Guiding Taxi Cruising In A Congested Urban City, Lucas Agussurja, Hoong Chuin Lau Nov 2011

A Pomdp Model For Guiding Taxi Cruising In A Congested Urban City, Lucas Agussurja, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider a partially observable Markov decision process (POMDP) model for improving a taxi agent cruising decision in a congested urban city. Using real-world data provided by a large taxi company in Singapore as a guide, we derive the state transition function of the POMDP. Specifically, we model the cruising behavior of the drivers as continuous-time Markov chains. We then apply dynamic programming algorithm for finding the optimal policy of the driver agent. Using a simulation, we show that this policy is significantly better than a greedy policy in congested road network.

Go to article

Ceg 361/561-01: Introduction To Software Testing, John A. Reisner Oct 2011

Ceg 361/561-01: Introduction To Software Testing, John A. Reisner

Computer Science & Engineering Syllabi

This course covers software testing strategies, along with established best practices, so students team how to test their software in a complete and systematic (vice ad-hoc) manner. Particular attention is paid to planning, writing, and executing software tests, along with associated documentation, (i.e., a software test plan), which includes 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.

Go to article

Ceg 702-01: Advanced Communication Networks, Bin Wang Oct 2011

Ceg 702-01: Advanced Communication Networks, Bin Wang

Computer Science & Engineering Syllabi

This is a graduate level course on advanced computer communication and networking technologies. The course involves both a reading/lecture/discussion component and a project component. We will read papers on various aspects of advanced computer networking: LAN/WAN technologies, congestion/flow control, self-similar traffic analysis, queuing theory, link scheduling, routing, internetworking, multicast, wireless technologies, quality of services, and peer-to-peer networks. Various technical and research issues involved will be studied in depth.

Go to article

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

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 algorithm; deal with edge detection and image segmentation, feature detection and matching, and image alignment. Also covered in the course are structure from motion, dense motion estimation, and stereo depth percepti011

Go to article

Ceg 2350: Os Concepts And Usage, Prabhaker Mateti Oct 2011

Ceg 2350: Os Concepts And Usage, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUT 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 And Switching Circuits, John C. Gallagher Oct 2011

Ceg 260-01: Digital Computer Hardware And Switching Circuits, John C. Gallagher

Computer Science & Engineering Syllabi

This course covers the design and analysis of basic digital circuits for computation. Topics will Include number systems, basic Boolean algebra, combinational circuit design and analysis, basic Medium Scale Integration (MSI) components, basic memory devices, basic sequential circuits, and binary arithmetic. At the end of this course you should be able to design, optimize, and Implement combinational logic for a variety of applications. You should also be familiar with basic MSI components and sequential circuit concepts In preparation for more advanced study of computer architecture, sequential circuit analysis, design, and optimization.

Go to article

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

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

Cs 208: Computer Programming For Business I, David M. Hutchison Oct 2011

Cs 208: Computer Programming For Business I, David M. Hutchison

Computer Science & Engineering Syllabi

CS 208 Is the first In a sequence of two programming classes required for MIS majors. This course will Introduce students to the basic concepts of programming. Examples are from business applications and display graphics and emphasis Is on problem solving with the computer as a tool.

Go to article

Cs/Mth 316/516: Survey Of Numerical Methods For Computational Science, Michael Linger Oct 2011

Cs/Mth 316/516: Survey Of Numerical Methods For Computational Science, Michael Linger

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences and engineering. Included will be methods for interpolation, data smoothing, integration, differentiation, and solution of systems of linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to science, engineering and applied mathematics are an integral part of the course. Special topics presented as schedule permits. Four hours lecture.

Go to article

Cs 400/600: Data Structures And Software Design, Meilin Liu Oct 2011

Cs 400/600: Data Structures And Software Design, Meilin Liu

Computer Science & Engineering Syllabi

This is a fundamental course for students majoring in Computer Science. Students will learn: basic algorithm analysis techniques; asymptotic complexity; big-0 and big-Omega notations; efficient algorithms for discrete structures including lists, trees, stacks, and graphs; fundamental computing algorithms including sorting, searching, and hashing techniques.

Go to article

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

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 Budd's text 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.

Go to article

Cs/Mth 410/610-01: Theoretical Foundations Of Computing, Sarah Gothard Oct 2011

Cs/Mth 410/610-01: Theoretical Foundations Of Computing, Sarah Gothard

Computer Science & Engineering Syllabi

Turing machines; partial-recursive functions; equivalence of computing paradigms; Church-Turing thesis; undecidability; intractability. Four hours lecture.

Go to article

Cs 214: Visual Basic Programming, Eric Saunders Oct 2011

Cs 214: Visual Basic Programming, Eric Saunders

Computer Science & Engineering Syllabi

This course will cover the fundamentals of object-oriented computer programming; with an emphasis on design, structure, debugging, and testing. Visual Basic 2010 will be used for developing programs.

Go to article

Cs 400/600: Date Structures And Algorithms, Keke Chen Oct 2011

Cs 400/600: Date Structures And Algorithms, Keke Chen

Computer Science & Engineering Syllabi

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

Go to article

Cs 141: Computer Programming I, Vanessa Starkey Oct 2011

Cs 141: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Introduction to use of computers as a problem-solving tool. Examples from and applications to a broad range of problems. Methodology for algorithm design and for structured modular implementation is stressed. Three hours lecture, two hours lab.

Go to article

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

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 242: Computer Programming Iii, Mateen M. Rizki Oct 2011

Cs 242: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

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

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.

Go to article

Cs 241: Computer Programming Ii, Jay Dejongh Oct 2011

Cs 241: Computer Programming Ii, Jay Dejongh

Computer Science & Engineering Syllabi

A continuation of CS 240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.

Go to article

Cs 240: Distance Learning Computer Programming - I, Michael Ondrasek Oct 2011

Cs 240: Distance Learning Computer Programming - I, Michael Ondrasek

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on problem solving and object oriented programming. This course provides a general introduction to the fundamentals of computer science and 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 a lecture and laboratory section. 4 credit hours.

Go to article

Cs 405/605: Introduction To Database Management Systems, Soon M. Chung Oct 2011

Cs 405/605: Introduction To Database Management Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Entity Relationship, relational, object-oriented models for databases are presented. Physical implementation methods are discussed.

Go to article

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

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 in strings/sentences: the syntax of languages can be defined using grammars and the patterns can be 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 mechanisms and pattern recognition devices. The text will be the third edition of Languages and Machines: An Introduction to the Theory o/Computer Science, by Thomas Sudkamp.

Go to article

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

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: distributed data crunching with MapReduce, cloud and datacenter filesystems, virtualization, cloud security&privacy, Amazon Web Services, and interactive web-based applications. Students are expected to finish several mini projects, read some papers, and take the final exam. Participation in the class discussion is strongly encouraged. Guest speakers might be invited for some particular topics. (3Hours Lecture + 1 Hour lab).

Go to article

First Prev Next Last