Computer Sciences Commons^™

Em Enforcing Information Flow Properties Using Compensating Events, Thoshitha T. Gamage, Bruce M. Mcmillin

Computer Science Faculty Research & Creative Works

Deeply embedded infrastructures are pervasive systems that have significant cyber and physical components, interacting with each other in complex ways. These interactions can violate a system's security policy leading to unintended information flow. Execution Monitor (EM) enforceability is the concept of monitoring a system during runtime for any security policy violations and terminating the execution if such violations occur. EM enforceable mechanisms require that the properties being enforced be restricted to safety properties. Information flow properties are considered non-EM enforceable because they cannot be defined using safety properties. to bridge this gap, prior work has presented a monitor that predicts …

The Pyro Toolkit For Ai And Robotics, Doug Blank, Deepak Kumar, Lisa Meeden, Holly Yanco

Computer Science Faculty Research and Scholarship

This article introduces Pyro, an open-source Python robotics toolkit for exploring topics in AI and robotics. We present key abstractions that al- low Pyro controllers to run unchanged on a variety of real and simulated robots. We demonstrate Py- ro’s use in a set of curricular modules. We then de- scribe how Pyro can provide a smooth transition for the student from symbolic agents to real-world robots, which significantly reduces the cost of learning to use robots. Finally we show how Pyro has been successfully integrated into existing AI and robotics courses.

Python As A Teaching Tool, Jason Schultz

Honors Capstones

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

Text Summarization Using Concept Hierarchy, Xiaomei Huang

Doctoral Dissertations

This dissertation aims to create new sentences to summarize text documents. In addition to generating new sentences, this project also generates new concepts and extracts key sentences to summarize documents. This project is the first research work that can generate new key concepts and can create new sentences to summarize documents.

Automatic document summarization is the process of creating a condensed version of the document. The condensed version extracts the key contents from the original document. Most related research uses statistical methods that generate a summary based on word distribution in the document. In this dissertation, we create a summary …

Neural Network Control Of Mobile Robot Formations Using Rise Feedback, Jagannathan Sarangapani, Travis Alan Dierks

Electrical and Computer Engineering Faculty Research & Creative Works

In this paper, an asymptotically stable (AS) combined kinematic/torque control law is developed for leader-follower-based formation control using backstepping in order to accommodate the complete dynamics of the robots and the formation, and a neural network (NN) is introduced along with robust integral of the sign of the error feedback to approximate the dynamics of the follower as well as its leader using online weight tuning. It is shown using Lyapunov theory that the errors for the entire formation are as and that the NN weights are bounded as opposed to uniformly ultimately bounded stability which is typical with most …

Improving Automated Requirements Trace Retrieval Through Term-Based Enhancement Strategies, Xuchang Zou

College of Computing and Digital Media Dissertations

Requirements traceability is concerned with managing and documenting the life of requirements. Its primary goal is to support critical software development activities such as evaluating whether a generated software system satisfies the specified set of requirements, checking that all requirements have been implemented by the end of the lifecycle, and analyzing the impact of proposed changes on the system. Various approaches for improving requirements traceability practices have been proposed in recent years. Automated traceability methods that utilize information retrieval (IR) techniques have been recognized to effectively support the trace generation and retrieval process. IR based approaches not only significantly reduce …

Discrete Nondeterministic Modeling Of Biochemical Networks, John R. Jack

Doctoral Dissertations

The ideas expressed in this work pertain to biochemical modeling. We explore our technique, the Nondeterministic Waiting Time algorithm, for modeling molecular signaling cascades. The algorithm is presented with pseudocode along with an explanation of its implementation. The entire source code can be found in the Appendices. This algorithm builds on earlier work from the lab of Dr. Andrei Nun, the advisor for this dissertation. We discuss several important extensions including: (i) a heap with special maintenance functions for sorting reaction waiting times, (ii) a nondeterministic component for handling reaction competition, and (iii) a memory enhancement allowing slower reactions to …

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

A Method For Introducing Artificial Perception (Ap) To Improve Human Behavior Representation (Hbr) Using Agents In Synthetic Environments, Randall Bartholomew Garrett

Computational Modeling & Simulation Engineering Theses & Dissertations

While psychology has shown that perception is very important for the human decision process, agent perception has not been covered in sufficient detail within the agent directed simulation field. To contribute to such a solution, an open challenge lies in capturing the knowledge of human sciences, such as psychology, and making this knowledge usable for engineers. This dissertation addresses perception by describing an experimental method where agent perception simulates human perception. In particular, it presents engineering methods based on accepted psychological approaches resulting in a proof of concept. To prove the feasibility, an Artificial Perception (AP) meta-model is presented using …

Algorithms For Vertex-Weighted Matching In Graphs, Mahantesh Halappanavar

Computer Science Theses & Dissertations

A matching M in a graph is a subset of edges such that no two edges in M are incident on the same vertex. Matching is a fundamental combinatorial problem that has applications in many contexts: high-performance computing, bioinformatics, network switch design, web technologies, etc. Examples in the first context include sparse linear systems of equations, where matchings are used to place large matrix elements on or close to the diagonal, to compute the block triangular decomposition of sparse matrices, to construct sparse bases for the null space or column space of under-determined matrices, and to coarsen graphs in multi-level …

A Hidden Markov Model Based Approach To Detect Rogue Access Points, Gayathri Shivaraj

Electrical & Computer Engineering Theses & Dissertations

One of the most challenging security concerns for network administrators is the presence of Rogue access points. The challenge is to detect and disable a Rogue access point before it can cause hazardous damage to the network. This thesis proposes a statistically based approach to detect Rogue access points using a Hidden Markov Model, which is applied to passively measure packet-header data collected at a gateway router or any monitoring point. This approach utilizes variations in packet inter-arrival time to differentiate between authorized access points and Rouge access points. This approach used the inter-arrival time of a packet as a …

Analysis Of Electroencephalogram Signals For The Identification Of Mental Tasks, My Thy Thi Tran

Electrical & Computer Engineering Theses & Dissertations

Electroencephalogram (EEG) signals can be used for implicit communication such as to control robots or medical equipment by brain activity or to detect an individual's intentions of committing premeditated crimes. An EEG based brain-computer interface allows paralyzed patients to express their thoughts. However, biological and technical artifacts heavily interfered with EEG signals due to blinking of the eyes, muscle activities and line noise. Sometimes the noise interference due to signal artifacts becomes more prominent than the information content. This thesis investigates novel feature extraction methodologies in EEG signals to represent different thought processes and employs neural network-based pattern classification techniques …

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

Computer Science & Engineering Syllabi

No abstract provided.

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 …

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.