Engineering Commons^™

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

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

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

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

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

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

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

Computer Science & Engineering Syllabi

No abstract provided.

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

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

Computer Science & Engineering Syllabi

No abstract provided.

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

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

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

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

Computer Science & Engineering Syllabi

No abstract provided.

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

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

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

Computer Science & Engineering Syllabi

No abstract provided.

A User Interactive Calibration Program For An Object Tracking System Using A Triaxial Accelerometer, Richard A. Elliott

HIM 1990-2015

A major method in object tracking systems and other inertial measurement devices resolves around the use of one, two, or three axis accelerometers. A leader in the field such devices is Microstrain Incorporated. They have developed a three axis accelerometer that uses a three axis magnetic sensor array to compute the pitch, roll, and yaw of a compact inertial measurement unit. In researching such devices, it became apparent that data collected using such units is extremely sensitive both to local magnetic fields and human interactions with the devices. It is therefore of great importance to ensure the device or devices …

Collaborative Context-Based Reasoning, Gilbert Barrett

Electronic Theses and Dissertations

This dissertation explores modeling collaborative behavior, based on Joint Intentions Theory (JIT), in Context-Based Reasoning (CxBR). Context-Based Reasoning is one of several contextual reasoning paradigms. And, Joint Intentions Theory is the definitive semantic framework for collaborative behaviors. In order to formalize collaborative behaviors in CxBR based on JIT, CxBR is first described in terms of the more popular Belief, Desire, and Intention (BDI) model. Once this description is established JIT is used as a basis for the formalism for collaborative behavior in CxBR. The hypothesis of this dissertation is that this formalism allows for effective collaborative behaviors in CxBR. Additionally, …

Congestion Avoidance And Fairness In Wireless Sensor Networks, Mohammad Ahmad

Electronic Theses and Dissertations

Sensor network congestion avoidance and control primarily aims to reduce packet drops while maintaining fair bandwidth allocation to existing network flows. The design of a congestion control algorithm suited for all types of applications in sensor networks is a challenging task due to the application-specific nature of these networks. With numerous sensors transmitting data simultaneously to one or more base stations (also called sinks), sensor nodes located near the base station will most likely experience congestion and packet loss. In this thesis, we propose a novel distributed congestion avoidance algorithm which calculates the ratio of the number of downstream and …

Eino: An Intelligent Tutor For The University Of Central Florida Infinity Web Applets, James Hollister

Electronic Theses and Dissertations

This study investigated the various methods involved in creating an intelligent tutor for the University of Central Florida Infinity Web Applets (UCF Infinity Web Applets). After conducting research into various methods, two major methods emerged and they are: solving the problem for the student and helping the student when they become stymied and unable to solve the problem. A storyboard was created to show the interactions of the student and system along with a list of features that were desired to be included in the tutoring system. From the storyboard and list of features, an architecture was created to handle …

Coalition Formation And Teamwork In Embodied Agents, Majid Ali Khan

Electronic Theses and Dissertations

Embodied agents are agents acting in the physical world, such as persons, robots, unmanned air or ground vehicles and so on. These types of agents are subject to spatio-temporal constraints, which do not exist for agents acting in a virtual environment. The movement of embodied agents is limited by obstacles and maximum velocity, while their communication is limited by the transmission range of their wireless devices. This dissertation presents contributions to the techniques of coalition formation and teamwork coordination for embodied agents. We considered embodied agents in three different settings, each of them representative of a class of practical applications. …

Modeling, Design And Evaluation Of Networking Systems And Protocols Through Simulation, Daniel Jonathan Lacks

Electronic Theses and Dissertations

Computer modeling and simulation is a practical way to design and test a system without actually having to build it. Simulation has many benefits which apply to many different domains: it reduces costs creating different prototypes for mechanical engineers, increases the safety of chemical engineers exposed to dangerous chemicals, speeds up the time to model physical reactions, and trains soldiers to prepare for battle. The motivation behind this work is to build a common software framework that can be used to create new networking simulators on top of an HLA-based federation for distributed simulation. The goals are to model and …

A Method Of Content-Based Image Retrieval For The Generation Of Image Mosaics, Michael Snead

Electronic Theses and Dissertations

An image mosaic is an artistic work that uses a number of smaller images creatively combined together to form another larger image. Each building block image, or tessera, has its own distinctive and meaningful content, but when viewed from a distance the tesserae come together to form an aesthetically pleasing montage. This work presents the design and implementation of MosaiX, a computer software system that generates these image mosaics automatically. To control the image mosaic creation process, several parameters are used within the system. Each parameter affects the overall mosaic quality, as well as required processing time, in its own …

A Neat Approach To Genetic Programming, Adelein Rodriguez

Electronic Theses and Dissertations

The evolution of explicitly represented topologies such as graphs involves devising methods for mutating, comparing and combining structures in meaningful ways and identifying and maintaining the necessary topological diversity. Research has been conducted in the area of the evolution of trees in genetic programming and of neural networks and some of these problems have been addressed independently by the different research communities. In the domain of neural networks, NEAT (Neuroevolution of Augmenting Topologies) has shown to be a successful method for evolving increasingly complex networks. This system's success is based on three interrelated elements: speciation, marking of historical information in …

Diversity Techniques For Signal-Strength Based Indoor Location Determination, Anil Ramachandran

Masters Theses

"Diversity techniques have been found in the literature to be suitable for compensating channel uncertainties such as multipath fading. In this thesis, we exploit spatial and frequency diversity techniques for improving accuracy in locating stationary and mobile objects in the indoor environment"--Abstract, page iv.

Dit Frequency Based Incremental Attribute Selection For Gre., John D. Kelleher

Conference papers

The DIT system uses an incremental greedy search to generate descriptions, (similar to the incremental algorithm described in (Dale and Reiter, 1995) ) incremental algorithm). The selection of the next attribute to be tested for inclusion in the description is ordered by the absolute frequency of each attribute in the training corpus. Attributes are selected in descending order of frequency (i.e. the attribute that occurred most frequently in the training corpus is selected first).