Engineering Commons^™

Dynamic Programming Approximations For Partially Observable Stochastic Games, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes with a price, namely a high computational cost. Solving POSGs optimally quickly becomes intractable after a few decision cycles. Our main contribution is to provide bounded approximation techniques, which enable us to scale POSG algorithms by several orders of magnitude. We study both the POSG model and its cooperative counterpart, DEC-POMDP. Experiments on a number of problems confirm the scalability of our approach while still providing useful policies.

Adding Escience Assets To The Data Web, Herbert H. Van De Sompel, Carl Lagoze, Michael L. Nelson, Simeon Warner, Robert Sanderson, Pete Johnston

Computer Science Faculty Publications

Aggregations of Web resources are increasingly important in scholarship as it adopts new methods that are data-centric, collaborative, and networked-based. The same notion of aggregations of resources is common to the mashed-up, socially networked information environment of Web 2.0. We present a mechanism to identify and describe aggregations of Web resources that has resulted from the Open Archives Initiative - Object Reuse and Exchange (OAI-ORE) project. The OAI-ORE specifications are based on the principles of the Architecture of the World Wide Web, the Semantic Web, and the Linked Data effort. Therefore, their incorporation into the cyberinfrastructure that supports eScholarship will …

A Video Manager, Nicholas Omann

Honors Capstones

Capstone submitted as a graduate requirement for the BSU Honors Program.

A Multi-Interface Multi-Channel Routing (Mmcr) Protocol For Wireless Ad Hoc Networks, Reghu Anguswamy, Maciej Jan Zawodniok, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

Multiple non-interfering channels are available in 802.11 and 802.15.4 based wireless networks. Capacity of such channels can be combined to achieve a better performance thus providing a higher quality of service (QoS) than for a single channel network. However, existing routing protocols often are not suited to fully take advantage of these channels. The proposed multi-interface multi-channel routing (MMCR) protocol considers various QoS parameters such as throughput, end-to-end delay, and energy utilization as a single unified cost metric and identifies the route that optimizes the cost metric and balances the traffic among the channels on a per flow basis. Multipoint …

Dynamic Channel Allocation In Wireless Networks Using Adaptive Learning Automata, Behdis Eslamnour, Maciej Jan Zawodniok, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

The bandwidth utilization of a single channel-based wireless networks decreases due to congestion and interference from other sources and therefore transmission on multiple channels are needed. In this paper, we propose a distributed dynamic channel allocation scheme for wireless networks using adaptive learning automata whose nodes are equipped with single radio interfaces so that a more suitable channel can be selected. The proposed scheme, adaptive pursuit reward-inaction, runs periodically on the nodes, and adaptively finds the suitable channel allocation in order to attain a desired performance. A novel performance index, which takes into account the throughput and the energy consumption, …

Ceg 320/520-01: Computer Organization, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Cs 209-01: Computer Programming For Business Ii, David M. Hutchison

Computer Science & Engineering Syllabi

cs 209 is the second in a sequence of two programming classes required for MIS majors. This course will continue teaching students to the basic concepts of programming. Examples are from business applications and emphasis is on problem solving with the computer as a tool.

Cs 776: Functional Programming, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will discuss important concepts of functional programming such as recursive definitions, higher-order functions, type inference, polymorphism, abstract data types, modules etc. The programming exercises will illustrate the utility of list-processing, pattern matching, abstraction of data/control, strong typing, and parameterized modules (functors). We also study the mathematical reasoning involved in the design of functional programs and techniques for proving properties about functions so defined.

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.

Cs 205: Computer Literacy And Office Automation, Ann Tirpack

Computer Science & Engineering Syllabi

No abstract provided.

Cs 801: Advanced Database Systems, Soon M. Chung

Computer Science & Engineering Syllabi

Introduction of current trends and research issues in database systems.

Cs 240: Computer Programming I, Vanessa Starkey

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced.
Emphasis is on structured programming and stepwise refinement. Prerequisite: MTH 130 or MPL 5.

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 142: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

The concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and handling runtime errors with an emphasis on program verification and testing. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: CS 141 (Computer Programming I) and MTH 127 (College Algebra) or equivalent.

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 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 SharePoint, Microsoft Excel, Access, and PowerPoint covering the following topics.

Microsoft Excel 2007:

Chapter 4: Creating Loan Information

Chapter 5: Working With Lists, Working With Logical Functions

Chapter 6: Working With Multiple Worksheets And Workbooks, Database Functions, And Filtering, And Integrating Excel with Other Window Programs

Microsoft Access 2007:

Chapter 4: Enhancing a Table's Design, and Creating Advanced Queries, Creating Custom Reports

Chapter 5: Creating Custom Forms …

Cs 241-02: Computer Programming - Ii, Michael Ondrasek

Computer Science & Engineering Syllabi

A continuation of CS240. The emphasis is on solving more complex problems using object oriented programming. Prerequisite: CS240. Students must register for both lecture and one laboratory section. 4 credit hours.

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.

Ceg 211-01: Pc Networking Ii, Karen Meyer

Computer Science & Engineering Syllabi

The goal of this course is to prepare students for the real-world challenges of a networking professional. It is designed for students interested in network and server administration. The text includes extensive hands-on projects, exercises, and review questions in each chapter, which reinforce network administration skills as they are learned. Case projects at the end of each chapter allow students to take on the role of a network administrator, making decisions and troubleshooting real-life problems. Specific topic coverage includes: network administration and management, administering active directory, managing group policy, administering file resources, administering web resources in windows server 2003, administering …

Cs 400-01: Data Structures And Algorithms, Sarah Gothard

Computer Science & Engineering Syllabi

No abstract provided.

Cs/Mth 316/516: Numerical Methods For Digital Computers - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods of interpolation, data smoothing, functional approximation, numerical differentiation and integration. Solution techniques for linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to engineering, science, and applied mathematics are an integral part of the course. Special topics presented as schedule permits. 4 credit hours.

Cs 208: Computer Programming For Business I, Dennis Kellermeier

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 a high degree of facility in intermediate level programming. This course assumes students have never written a program before.

Cs 790: Optimizing Compilers For Modern Architectures, Meilin Liu

Computer Science & Engineering Syllabi

This course studies compiler optimization for modern architectures. Between parsing the input program and generating the target machine code, optimizing compilers perform a wide range of program transformations on a program to improve its performance. In this course we focus on data dependence analysis, program transformations and loop transformations, loop scheduling, and a combination of these optimizing techniques.

Cs 271/Bio 371: Introduction To Bioinformatics, Michael L. Raymer, Dan E. Krane

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 499/699-01: Scientific Visualization And Virtual Environments, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will be familiar with techniques ed for visualizing various types of data sets, such as medical, vector or general data sets.

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 modern 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 …

Ceg 433/633-01: 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. 4 Credit Hours. Three hours lecture, two hours lab. Prerequisites: CEG 320 and CS 400

Ceg 210-01: 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 220-01: Introduction To C Programming For Engineers, 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). The course includes a scheduled laboratory section for which you must register.

Ceg 233-01: Linux And Windows, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI 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. SSUTSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs.