Physical Sciences and Mathematics Commons^™

Cs 409/609: Principles Of Artificial Intelligence, Michael T. Cox

Computer Science & Engineering Syllabi

"Principles of Artificial Intelligence" is a graduate/undergraduate level introductory course in Artificial Intelligence (AI), designed for students interested in or specializing in AL We will cover several basic topics ranging from knowledge representation, inference, problem solving, search, the predicate calculus and other fundamentals of AI, to selected topics concerning intelligent agents, natural language processing, planning, learning, and case-based reasoning. The intent of the course is to provide a background in artificial intelligence, an exposure to the major issues and methods in the field, and experience in writing AI programs. The course will also examine real AI systems and allow the …

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. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.

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.

The goal of this course is to blend social implications issues with common technical communication formats you'll need to be familiar with out in the "real world." To do this, the course is built around a research project on a social implications topic …

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

No abstract provided.

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 499/699: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel knowledge from large amounts of data.
This course introduces and studies the 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, and data mining applications. This course is designed for senior year undergraduate students and graduate students. 3 hours lecture, 2 hours lab.

Cs 701: Database Systems And Design I, Guozhu Dong

Computer Science & Engineering Syllabi

An introduction to database design, database system implementation issues and techniques, and advanced data models.

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 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 784: Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces concepts related to the specification and design of high-level programming languages. It discusses different programming paradigms, algebraic specification and implementation of data types, and develops interpreters for specifying operationally the various programming language features/constructs. It also introduces attribute grammar formalism and axiomatic semantics briefly. The programming assignments will be coded in Scheme.

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 2, October 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Cs 206: Data Sheet, Terri Bauer

Computer Science & Engineering Syllabi

Data Sheet for section 02.

Cs 480/680: Comparative Languages, Michael T. Cox

Computer Science & Engineering Syllabi

"Comparative Languages" is a graduate/undergraduate level introductory course in programming languages. We will cover several basic topics ranging from syntax (BNF) and semantics formalisms (attribute grammars), to data types, scope and extent, type checking, parameter passing methods, expression parsing and other fundamentals of programming languages and language development. The intent of the course is to provide a background in the concepts and constructs of languages, rather than simply providing just a survey of various computer languages. Nonetheless in this class, we will learn and program in three very different languages: Pascal (an imperative language), Java (an object-oriented language), and LISP …

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer, Dan E. Krane

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.

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 240: Introduction To Computer Science, Eric Matson

Computer Science & Engineering Syllabi

We will develop basic techniques to design, develop and implement programs using the C++ language.

Cs 208: Computer Programming For Business With Java, I, Robert Rea

Computer Science & Engineering Syllabi

CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve an intermediate-level of programming in Java. This course assumes students have never written a program before.

Ceg 255: Introduction To The Design Of Information Technology Systems, Eric Matson

Computer Science & Engineering Syllabi

Information systems consist of modern elements such as database systems, networks, multiplatform distributed computing, web infrastructure and multimedia computing. In this course we will address these areas individually and also where they intersect to gain a basic understanding of how information technology can be used to solve real problems.

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.

Ceg 333: Introduction To Unix, Bin Wang

Computer Science & Engineering Syllabi

This is a 2 credit hour course that has 10 50-minute lectures and I 0 50-minute Jab sessions. Introduction to the use of Unix and Unix tools as a problem-solving environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, and debugging.

Ceg 429/629: Internet Security, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to security issues arising primarily from computer networks. Topics include node and service authentication, address spoofing, hijacking, SYN floods, smurfing, sniffing, routing tricks, and privacy of data en route. Buffer overruns and other exploitation of software development errors. Hardening of operating systems. Intrusion detection. Firewalls. Ethics.

Ceg 498: Design Experience, John C. Gallagher

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 minim um 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 434/634: Concurrent Software Design, Thomas C. Hartrum

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 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 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 476/676-01: Computer Graphics I, Lyubomir Zagorchev

Computer Science & Engineering Syllabi

An introduction to 2-D and 3-D computer graphics and their OpenGL implementations.

Response Of The Martian Thermosphere/Ionosphere To Enhanced Fluxes Of Solar Soft X Rays, Jane L. Fox

Physics Faculty Publications

We have investigated the response of the thermosphere and ionosphere of Mars to enhanced fluxes of solar soft X rays, such as those that have been detected by the SNOE satellite (e.g., Bailey et al., 2000 ). We have constructed standard models by adopting the SC#21REFW and F79050N solar fluxes from H. E. Hinteregger (private communication) (see also Torr et al., 1979 ) for the low and high solar activity models, respectively. We then constructed enhanced soft X-ray models by multiplying the solar photon fluxes for wavelengths below 200 Å by a factor of 3 at low solar …

Semantic Web Technology In Support Of Bioinformatics For Glycan Expression, Amit P. Sheth, William S. York, Christopher Thomas, Meenakshi Nagarajan, John A. Miller, Krzysztof Kochut, Satya S. Sahoo, Xiaochuan Yi

Kno.e.sis Publications

Due to the complexity of biological systems, interpretation of data obtained by a single experimental approach can often be interpreted only if viewed from a broader context, taking into account the information obtained by many diverse techniques. The vast amount of interpreted experimental data that is now available via the internet opens the possibility of collecting the relevant pieces of information that will enable scientists to form hypotheses based on the integration of this diverse information. However, the sheer volume of data that is available makes it very difficult to select the information necessary to make a coherent model of …

Lsdis: Large Scale Distributed Information Systems Lab, Amit P. Sheth

Kno.e.sis Publications

The LSDIS (Large Scale Distributed Information Systems) lab was established in 1994 with the guidance and direction provided by Dr. Amit P. Sheth with the help of Dr. John A. Miller and Dr. Krzysztof J. Kochut. In 1998 this faculty group was further strengthened by the addition of Dr. Ismailcem B. Arpinar. LSDIS is the largest research group in Computer Science at UGA and one of the strongest in its area. During Fall 2004, it is funding 15 students (majority of them PhD), and has one research staff.

Over the years LSDIS has been actively involved in research projects in …

Default Reasoning Over Domains And Concept Hierarchies, Pascal Hitzler

Computer Science and Engineering Faculty Publications

W.C. Rounds and G.-Q. Zhang have proposed to study a form of disjunctive logic programming generalized to algebraic domains [1]. This system allows reasoning with information which is hierarchically structured and forms a (suitable) domain. We extend this framework to include reasoning with default negation, giving rise to a new nonmonotonic reasoning framework on hierarchical knowledge which encompasses answer set programming with extended disjunctive logic programs. We also show that the hierarchically structured knowledge on which programming in this paradigm can be done, arises very naturally from formal concept analysis. Together, we obtain a default reasoning paradigm for conceptual …

Logic Programs, Iterated Function Systems, And Recurrent Radial Basis Function Networks, Sebastian Bader, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Graphs of the single-step operator for first-order logic programs—displayed in the real plane—exhibit self-similar structures known from topological dynamics, i.e., they appear to be fractals, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide with attractors of suitably chosen iterated function systems, and conditions which allow the approximation of such graphs by iterated function systems or by fractal interpolation. Since iterated function systems can easily be encoded using recurrent radial basis function networks, we eventually obtain connectionist systems which …