Physical Sciences and Mathematics Commons^™

Lightweight Federation Of Non-Cooperating Digital Libraries, Rong Shi

Computer Science Theses & Dissertations

This dissertation studies the challenges and issues faced in federating heterogeneous digital libraries (DLs). The objective of this research is to demonstrate the feasibility of interoperability among non-cooperating DLs by presenting a lightweight, data driven approach, or Data Centered Interoperability (DCI). We build a Lightweight Federated Digital Library (LFDL) system to provide federated search service for existing digital libraries with no prior coordination.

We describe the motivation, architecture, design and implementation of the LFDL. We develop, deploy, and evaluate key services of the federation. The major difference to existing DL interoperability approaches is one where we do not insist on …

Programmable Process Flow Networks, Filip D. Cuckov

Electrical & Computer Engineering Theses & Dissertations

A model that introduces programmability to processes occurring in a cargo terminal simulation through the use of a process language is presented in this thesis. The model provides a means for a straight-forward definition, and redefinition of changing processes, their incorporation in the simulation architecture and efficient execution. The model was built to investigate a solution for transforming the cargo terminal simulation CPortS into a process-oriented simulation without hard-coded processes. The approach taken separates the system into an architecture and a set of processes which utilize and interact with the architecture's resources and infrastructure. The processes that take place within …

Creating Software [Sic] Environments On An M-Node Beowulf Cluster To Execute Discrete-Event Simulations, Jermaine Fitz-Gerald Headley

Electrical & Computer Engineering Theses & Dissertations

This thesis describes the development of a software tool that facilitates the creation of software environments that make a simulation tool execute k replications of an application program on several nodes of an M-node Beowulf cluster. It is assumed that each cluster-node consists of p processors. The p processors that are contained in the master cluster-node are termed master processors, and the p processors that are contained in a slave cluster-node are termed slave processors. The slave processors are used to execute the replications, while the master processors are dedicated to schedule the replications and process other housekeeping chores. For …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 6, March 2005, 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.

Accelerating Missile Threat Engagement Simulations Using Personal Computer Graphics Cards, Sean E. Jeffers

Theses and Dissertations

The 453rd Electronic Warfare Squadron supports on-going military operations by providing battlefield commanders with aircraft ingress and egress routes that minimize the risk of shoulder or ground-fired missile attacks on our aircraft. To determine these routes, the 453rd simulates engagements between ground-to-air missiles and allied aircraft to determine the probability of a successful attack. The simulations are computationally expensive, often requiring two-hours for a single 10-second missile engagement. Hundreds of simulations are needed to perform a complete risk assessment which includes evaluating the effectiveness of countermeasures such as flares, chaff, jammers, and missile warning systems. Thus, the need for faster …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 5, February 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Smartacking: Improving Tcp Performance From The Receiving End, Daniel K. Blandford, Sally A. Goldman, Sergey Gorinsky, Yan Zhou, Daniel R. Dooly

All Computer Science and Engineering Research

We present smartacking, a technique that improves performance of Transmission Control Protocol (TCP) via adaptive generation of acknowledgments (ACKs) at the receiver. When the bottleneck link is underutilized, the receiver transmits an ACK for each delivered data segment and thereby allows the connection to acquire the available capacity promptly. When the bottleneck link is at its capacity, the smartacking receiver sends ACKs with a lower frequency reducing the control traffic overhead and slowing down the congestion window growth to utilize the network capacity more effectively. To promote quick deployment of the technique, our primary implementation of smartacking modifies only the …

Design Concepts And Process Analysis For Transmuter Fuel Manufacturing: Quarterly Progress Report #1, Jamil M. Renno, Georg F. Mauer

Fuels Campaign (TRP)

A Hot Cell robotic assembly: Pick and place dynamic simulation, including feedback control with Matlab, was developed for dispersion fuel manufacture.

The deployment of remote manufacturing of transmuter fuel is a necessity for the transmutation applications. In the reporting period, a virtual hot cell for the manufacturing of dispersion fuel was designed using MSC.visualNastran^©, ProEngineer^© and MATLAB^©. Atypical events were successfully simulated. Relevant physical quantities arising during such events were monitored as well.

Robust Control Techniques For State Tracking In The Presence Of Variable Time Delays, Jarrett Goodell, Marc Compere, Miguel Simon, Wilford Smith, Ronnie Wright, Mark Brudnak

Publications

In this paper, a distributed driver-in-the-Ioop and hardware-in-the-Ioop simulator is described with a driver on a motion simulator at the U.S. Army TARDEC Ground Vehicle Simulation Laboratory (GVSL). Realistic power system response is achieved by linking the driver in the GVSL with a full-sized hybrid electric power system located 2,450 miles away at the TARDEC Power and Energy Systems Integration Laboratory (P&E SIL), which is developed and maintained by Science Applications International Corporation (SAIC). The goal is to close the loop between the GVSL and P&E SIL over the Internet to provide a realistic driving experience in addition to realistic …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 21, Number 4, January 2005, 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.

10 Inventions On Improving Keyboard Efficiency: A Triz Based Analysis, Umakant Mishra

Umakant Mishra

A keyboard is the most important input device for a computer. With the development of technology a basic keyboard does not want to remain confined within the basic functionalities of a keyboard, rather it wants to go beyond. There are several inventions which attempt to improve the efficiency of a conventional keyboard. This article illustrates 10 inventions from US Patent database all of which have proposed very interesting methods for improving the efficiency of a computer keyboard. Some interesting inventions include, adding toolbar buttons on the keyboard, power saving method, keyboard-cooling mechanism, robust keyboard for public use, keyboard enhancement for …

Signal Flow Analysis, Partha P. Banerjee

Electrical and Computer Engineering Faculty Publications

Signal flow graphs are a viable alternative to block diagrammatic representation of a system. What makes signal flow graphs attractive is that certain features from graph theory can be applied to the simplification and the synthesis of complex systems.

Ceg 320/520-01: Computer Organization And Assembly Language Programming, Michael L. Raymer

Computer Science & Engineering Syllabi

[4 credit hours] Terminology and understanding of functional organizations and sequential operation of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument passing, arithmetic operations, traps and input/output. Macros, modularization, linkers and debuggers are used. Prerequisite: CEG 260, CS 242.

Cs 208-01: 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 levelprogramming. This course assumes students have never written a program before.

Cs 141-01: Computer Programming I, Robert Rea

Computer Science & Engineering Syllabi

CS 141 is dedicated to teaching the fundamentals of computer programming The concepts covered in this class will be applied using the Java programming language.

Cs 142-01: Computer Programming - Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

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 205-01: Computer Literacy And Office Automation, John P. Herzog

Computer Science & Engineering Syllabi

Basic computer terminology, word processing, spreadsheets, databases, and graphics.

Cs 205-08: Computer Literacy And Office Automation, Kim Gros

Computer Science & Engineering Syllabi

No abstract provided.

Cs 209-02: Computer Programming For Business With Java, Ii, Robert Rea

Computer Science & Engineering Syllabi

CS 209 is the second 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 in Java.

Cs 241-01: Computer Science Ii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Cs 240-01: Introduction To Computer Science, Eric Maston

Computer Science & Engineering Syllabi

We will develop basic techniques to design, develop and implement programs using the C++ language. This course focuses on basic elements of programming and assumes no knowledge of programming in C++.

Cs 241-02: Computer Science Ii, L. Jane Lin

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course. For all CS 241 students, concurrent registration into CS 241 lab is a must.

Cs 241-03: Introduction To Computer Science Ii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course. Note: For all CS 241 students, concurrent registration into CS 241 lab is a must.

Cs 242-02: Introduction To Computer Science Iii, Eric Maston

Computer Science & Engineering Syllabi

This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues and tables.

Cs 405/605-01: Introduction To Database Management Systems, Guozhu Dong

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of data base managements 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 400/600: Data Structures And Software Design, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

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 740-01: Algorithms, Complexity And The Theory Of Computability, Thomas Sudkamp

Computer Science & Engineering Syllabi

No abstract provided.

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g. Scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will be coded in Java 5.0 and in Scheme.

Cs 765-01: Foundations Of Neurocomputation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course is designed to help you develop a solid understanding of neural network algorithms and architectures. At the end of this course you should be able to read and critically evaluate most neural network papers published in major journals, (e.g. IEEE Transaction on Neural Networks, Neural Networks, and Neural Computation). IN addition, you should be able to implement a broad range of network architectures and learning algorithms for a variety of applications.