Engineering Commons^™

Static Determination Of Allocation Rates To Support Real-Time Garbage Collection, Tobias Mann

All Computer Science and Engineering Research

While it is generally accepted that garbage-collected languages offer advantages over languages in which objects must be explicitly deallocated, real-time developers are leery of the adverse effects a garbage collector might have on real-time performance. Semiautomatic approaches based on regions have been proposed, but incorrect usage could cause unbounded storage leaks or program failure. Moreover, correct usage cannot be guaranteed at compile-time. Recently, real-time garbage collectors have been developed that provide a guaranteed fraction of the CPU to the application, and the correct operation of those collectors has been proven, subject only to the specification of certain statistics related to …

Composable Timed Automata Models For Real-Time Embedded Systems Middleware, Venkita Subramonian, Christopher Gill, Cesar Sanchez, Henny Sipma

All Computer Science and Engineering Research

Middleware for distributed real-time embedded (DRE) systems has grown more and more complex in recent years, to address functional and temporal requirements of complex real-time applications. While current approaches for modeling middleware have eased the task of assembling, deploying and configuring middleware and applications, a more formal, fundamental and lower-level set of models is needed to be able to uncover subtle safety and timing errors introduced by interference between computations, particularly in the face of alternative concurrency strategies in the middleware layer. In this paper, we examine how formal models of lower-level middleware building blocks provide an appropriate level of …

What A Mesh: Dependent Data Types For Correct Mesh Manipulation Algorithms, Joel R. Brandt

All Computer Science and Engineering Research

The Edinburgh Logical Framework (LF) has been proposed as a system for expressing inductively defined sets. I will present an inductive definition of the set of manifold meshes in LF. This definition takes into account the topological characteri-zation of meshes, namely their Euler Characteristic. I will then present a set of dependent data types based on this inductive def-inition. These data types are defined in a programming language based on LF. The language’s type checking guarantees that any typeable expression represents a correct manifold mesh. Furthermore, any mesh can be represented using these data types. Hence, the encoding is sound …

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

Use Of Maxitive (Possibility) Measures In Foundations Of Physics And Description Of Randomness: Case Study, A. M. Finkelstein, Olga Kosheleva, Vladik Kreinovich, Scott A. Starks, Hung T. Nguyen

Departmental Technical Reports (CS)

According to the traditional probability theory, events with a positive but very small probability can occur (although very rarely). For example, from the purely mathematical viewpoint, it is possible that the thermal motion of all the molecules in a coffee cup goes in the same direction, so this cup will start lifting up.

In contrast, physicists believe that events with extremely small probability cannot occur. In this paper, we show that to get a consistent formalization of this belief, we need, in addition to the original probability measure, to also consider a maxitive (possibility) measure.

From Fuzzification And Intervalization To Anglification: A New 5d Geometric Formalism For Physics And Data Processing, Scott A. Starks, Vladik Kreinovich

Departmental Technical Reports (CS)

We show that in understanding foundations of modern physics, with its 10-dimensional (and higher-dimensional) space-time models, it is very helpful to use the main ideas behind fuzzification -- extension of arithmetic operations and elementary functions from exact numbers to fuzzy numbers. The resulting formalism is, from the mathematical viewpoint, somewhat more complex than the traditional fuzzy arithmetic, but it is still much simpler than the quantum field theory -- and thus, it helps to make several important ideas from foundations of modern physics much more intuitively clear.

The Interval Categorizer Tesselation-Based Model For High Perfomance Computing, Marilton S. De Aguiar, Gracaliz P. Dimuro, Antonio C. Da Rocha Costa, Rafael K.S. Silva

Departmental Technical Reports (CS)

The paper presents the results obtained by an implementation of the interval tessellation-based model for categorization of geographic regions according the analysis of the relief function declivity, called ICTM. The analysis of the relief declivity, which is embedded in the rules of the model ICTM, categorizes each tessellation cell, with respect to the whole considered region, according to the (positive, negative, null) signal of the declivity of the cell. Such information is represented in the states assumed by the cells of the model. The overall configuration of such cells allows the division of the region into sub-regions of cells belonging …

Random Interval Arithmetic Is Closer To Common Sense: An Observation, Rene Alt, Jean-Luc Lamotte, Vladik Kreinovich

Departmental Technical Reports (CS)

From the commonsense viewpoint, if on a bridge whose weight we know with an accuracy of 1 ton, we place a car whose weight we know with an accuracy of 5 kg, then the accuracy with which we know the overall weight of a bridge with a car on it should still be 1 ton. This is what an engineer or a physicist would say. Alas, this is not so in traditional interval arithmetic. In this paper, we show that, in contrast to traditional interval arithmetic, the random interval arithmetic (proposed by the first two authors) actually has this important …

How The Concept Of Information As Average Number Of "Yes"-"No" Questions (Bits) Can Be Extended To Intervals, P-Boxes, And More General Uncertainty, Vladik Kreinovich, Gang Xiang, Scott Ferson

Departmental Technical Reports (CS)

We explain how the concept of information as average number of "yes"-"no" questions (bits) can be extended to intervals, p-boxes, and more general uncertainty.

Interval Methods: An Introduction, Luke Achenie, Vladik Kreinovich, Kaj Madsen

Departmental Technical Reports (CS)

The ongoing development of ever more advanced computers provides the potential for solving increasingly difficult computational problems. However, given the complexity of modern computer architectures, the task of realizing this potential needs careful attention. A main concern of High Performance Computing is the development of software that optimizes the performance of a given computer.

An important characteristic of the computer performance in scientific computing is the accuracy of the computation results. Often, we can estimate this accuracy by using traditional statistical techniques. However, in many practical situations, we do not know the probability distributions of different measurement, estimation, and/or roundoff …

Supporting Documentation For The Sps-Prospec Case Study, Salamah I. Salamah, Ann Q. Gates

Departmental Technical Reports (CS)

In this work, we report on the results of a case study comparing the correctness of Linear Temporal Logic (LTL)formulas generated by the Property Specification Tool Prospec and the Specification Pattern System (SPS). The report includes all the components used in the case study. In addition, this report provides a description of the use of the SPIN model checker to verify correctness of LTL specifications. Particularly, the report provides screenshots of XSPIN (SPIN�s graphical interface) and how properties (i.e., LTL formulas) can be specified and verified.

How To Reconstruct The Original Shape Of A Radar Signal?, Matthew G. Averill, Gang Xiang, Vladik Kreinovich, George R. Keller, Scott A. Starks, Patrick S. Debroux, James Boehm

Departmental Technical Reports (CS)

The shape of the radar signal can provide us with the additional information about the reflecting surface. However, to decrease the noise, radars use filtering, and filtering changes the shapes of the radar signal. It is therefore necessary to reconstruct the original shape of the radar signal.

Towards An Optimal Approach To Soft Constraint Problems, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In traditional constraint satisfaction, constraints are ``hard'' in the sense that we need to satisfy them all. In many practical situations, however, constraints are "soft" in the sense that if we are unable to satisfy some of them, the corresponding solution is still practically useful. In such situations, it is desirable to satisfy as many high-priority constraints as possible. In this paper, we describe an optimal algorithm for solving the corresponding soft constraint problem.

Ceg 210-01: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN Administration.

Ceg 260-01: Digital Computing Hardware/Switching Circuits, Eric Maston

Computer Science & Engineering Syllabi

We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.

Ceg 210-01: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN administration, and hardware and software configuration.

Cs 206: Computer Software Productivity Tools, Greg Coffey

Computer Science & Engineering Syllabi

This course introduces advanced computer applications using MS Word, MS Excel, MS Access, and MS PowerPoint.

Cs 207: Advanced Office Productivity Ii, Louis A. Benavides

Computer Science & Engineering Syllabi

This course covers post-advanced microcomputer applications including Microsoft Office Word 2003, Microsoft Office Excel 2003, Microsoft Office Access 2003, and Microsoft Office PowerPoint 2003. Topics include: creating an online form; working with macros and Visual Basic for Applications (VBA); working with a master document, an index and a table of contents; linking an Excel worksheet and charting its data in Word; formula auditing, data validation, and complex problem solving in Excel; importing data into Excel; working with PivotCharts, PivotTables, and trendlines in Excel; creating a PivotTable List; advanced Access report and form techniques, and creating multi-page forms; administering a database …

Ceg 255-01: Introduction To The Design Of Information Technology Systems, Eric Maston

Computer Science & Engineering Syllabi

Information systems consist of modern elements such as database systems, networks, multi-platform 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.

Cs 141: Computer Programming - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer 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 lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.

Cs 241: 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 466/666: Introduction To Formal Languages, Thomas Sudkamp

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.

Cs 480/680: Comparative Programming Languages, Michael L. Raymer

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 241-02: 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 240-02: 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 340: Programming Language Workshop In Java, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to learn the Java language and solve a set of programming problems assigned to you using it. (You may develop your code using any IDE you like, but you must ensure that it eventually runs using JDK 5). There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.

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 of interest to engineering, science, and applied mathematics students are an integral part of the course. Special topics presented as schedule permits. 4 credit hours. Prerequisites: CS 142 or EGR 153 or CEG 220 or CS 241, MTH 231, MTH 253 or 255.

Bio/Cs 271: Introduction To Bioinformatics, Dan E. Krane, Travis E. Doom

Computer Science & Engineering Syllabi

BIO/CS 271 Introduction to Bioinformatics: Introduction to DNA as an information storage system, data searches and pairwise alignments, substitution patterns, protein folding, and proteomics. Prerequisite: CS 240 or equivalent, BIO 112

Cs 884: Advanced Topics In Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

The primary focus of this course is the design and specification of the Object-Oriented language Java.