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

Computer Engineering Commons™

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

Discipline
Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 19411 - 19440 of 25652

Full-Text Articles in Computer Engineering

Fitness Biasing For The Box Pushing Task, Gary Parker, Jim O'Connor Oct 2011

Fitness Biasing For The Box Pushing Task, Gary Parker, Jim O'Connor

Computer Science Faculty Publications

Anytime Learning with Fitness Biasing has been shown in previous works to be an effective tool for evolving hexapod gaits. In this paper, we present the use of Anytime Learning with Fitness Biasing to evolve the controller for a robot learning the box pushing task. The robot that was built for this task, was measured to create an accurate model. The model was used in simulation to test the effectiveness of Anytime Learning with Fitness Biasing for the box pushing task. This work is the first step in new research where an automated system to test the viability of Fitness …


Using Cyclic Genetic Algorithms To Learn Gaits For An Actual Quadruped Robot, Gary Parker, William T. Tarimo Oct 2011

Using Cyclic Genetic Algorithms To Learn Gaits For An Actual Quadruped Robot, Gary Parker, William T. Tarimo

Computer Science Faculty Publications

It is a difficult task to generate optimal walking gaits for mobile legged robots. Generating and coordinating an optimal gait involves continually repeating a series of actions in order to create a sustained movement. In this work, we present the use of a Cyclic Genetic Algorithm (CGA) to learn near optimal gaits for an actual quadruped servo-robot with three degrees of movement per leg. This robot was used to create a simulation model of the movement and states of the robot which included the robot’s unique features and capabilities. The CGA used this model to learn gaits that were optimized …


Towards Interval Techniques For Model Validation, Jaime Nava, Vladik Kreinovich Oct 2011

Propagating Range (Uncertainty) And Continuity Information Through Computations: From Real-Valued Intervals To General Sets, Vladik Kreinovich Oct 2011

Propagating Range (Uncertainty) And Continuity Information Through Computations: From Real-Valued Intervals To General Sets, Vladik Kreinovich

Departmental Technical Reports (CS)

One of the main problems of interval computations is to find an enclosure Y that contains the range f(X1, ..., Xn) of a given function f(x1, ..., xn) over given intervals X1, ..., Xn. Most of the techniques for estimating this range are based on propagating the range through computations. Specifically, we follow the computations of f(x1, ..., xn) step-by-step: we start with ranges X1, ..., Xn of the inputs, and then we sequentially compute the enclosures for the ranges of …


Active Learning For Text Classification, Rong Hu Oct 2011

Active Learning For Text Classification, Rong Hu

Doctoral

Text classification approaches are used extensively to solve real-world challenges. The success or failure of text classification systems hangs on the datasets used to train them, without a good dataset it is impossible to build a quality system. This thesis examines the applicability of active learning in text classification for the rapid and economical creation of labelled training data. Four main contributions are made in this thesis. First, we present two novel selection strategies to choose the most informative examples for manually labelling. One is an approach using an advanced aggregated confidence measurement instead of the direct output of classifiers …


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.


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.


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


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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.


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


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

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.


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

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

Computer Science & Engineering Syllabi

No abstract provided.


Cs 784: Programming Languages, Prabhaker Mateti Oct 2011

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