Engineering Commons^™

Testing Hypotheses On Simulated Data: Why Traditional Hypotheses-Testing Statistics Are Not Always Adequate For Simulated Data, And How To Modify Them, Richard Aló, Vladik Kreinovich, Scott A. Starks

Departmental Technical Reports (CS)

To check whether a new algorithm is better, researchers use traditional statistical techniques for hypotheses testing. In particular, when the results are inconclusive, they run more and more simulations (n2>n1, n3>n2, ..., nm) until the results become conclusive. In this paper, we point out that these results may be misleading. Indeed, in the traditional approach, we select a statistic and then choose a threshold for which the probability of this statistic "accidentally" exceeding this threshold is smaller than, say, 1%. It is very easy to run additional simulations with ever-larger n. The probability of error is still 1% …

Expert System-Type Approach To Voice Disorders: Scheduling Botulinum Toxin Treatment For Adductor Spasmodic Dysphonia, Anthony P. Salvatore, Amitava Biswas, Vladik Kreinovich, Bertha Manriquez, Michael P. Cannito, Robert J. Sinard

Departmental Technical Reports (CS)

One of the most debilitating disorders is adductor spasmodic dysphonia (ADSD), a voice disorder caused by involuntary movements of the muscles of the larynx (voice box). For treating ADSD, botulinum toxin (BT) injections turned out to be very useful. However, the effects of BT are highly variable, so at present, there is no objective criterion of when such a BT treatment is necessary. It is therefore desirable to develop such a criterion.

In this paper, we show that traditional statistical techniques are unable to generate such a criterion, while a natural expert system approach seems to be capable of generating …

Estimating Information Amount Under Interval Uncertainty: Algorithmic Solvability And Computational Complexity, Gang Xiang, Olga Kosheleva, George J. Klir

Departmental Technical Reports (CS)

In most real-life situations, we have uncertainty: we do not know the exact state of the world, there are several (n) different states which are consistent with our knowledge. In such situations, it is desirable to gauge how much information we need to gain to determine the actual state of the world. A natural measure of this amount of information is the average number of "yes"-"no" questions that we need to ask to find the exact state. When we know the probabilities p1,...,pn of different states, then, as Shannon has shown, this number of questions can be determined as S=-p1 …

A Formal Specification In Jml Of The Java Security Package, Poonam Agarwal, Carlos E. Rubio-Medrano, Yoonsik Cheon, Patricia J. Teller

Departmental Technical Reports (CS)

The Java security package allows a programmer to add security features to Java applications. Although the package provides a complex application programming interface (API), its informal description, e.g., Javadoc comments, is often ambiguous or imprecise. Nonetheless, the security of an application can be compromised if the package is used without a concrete understanding of the precise behavior of the API classes and interfaces, which can be attained via formal specification. In this paper, we present our experiences in formally specifying the Java security package in JML, a formal behavior interface specification language for Java. We illustrate portions of our JML …

Fast Computation Of Centroids For Constant-Width Interval-Valued Fuzzy Sets, Jerry M. Mendel, Hongwei Wu, Vladik Kreinovich, Gang Xiang

Departmental Technical Reports (CS)

Interval-valued fuzzy sets provide a more adequate description of uncertainty than traditional fuzzy sets; it is therefore important to use interval-valued fuzzy sets in applications. One of the main applications of fuzzy sets is fuzzy control, and one of the most computationally intensive part of fuzzy control is defuzzification. Since a transition to interval-valued fuzzy sets usually increases the amount of computations, it is vitally important to design faster algorithms for the corresponding defuzzification. In this paper, we provide such an algorithm for a practically important case of constant-width interval-valued fuzzy sets

Topaz: A Firefox Protocol Extension For Gridftp Based On Data Flow Diagrams, Richard Zamudio, Daniel Catarino, Michela Taufer, Brent Stearn, Karan Bhatia

Departmental Technical Reports (CS)

As grid infrastructures mature, an increasing challenge is to provide end-user scientists with intuitive interfaces to computational services, data management capabilities, and visualization tools. The current approach used in a number of cyber-infrastructure projects is to leverage the capabilities of the Mozilla framework to provide rich end-user tools that seamlessly integrate with remote resources such as web/grid services and data repositories.

In this paper we apply rigorous software engineering tools, Data Flow Diagrams or DFDs, to guide the design, implementation, and performance analysis of Topaz, a GridFTP protocol extension to the Firefox browser. GridFTP servers, similar to FTP servers used …

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

Cs 141: Computer Programming - I, Michael Ondrasek

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 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

Cs 240: Introduction To Computer Science I, Praveen Kakumanu

Computer Science & Engineering Syllabi

This course is the first in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. This course presents a general introduction to C++ programming language. It introduces the fundamental capabilities of C++ language as a problem solving tool. Topics include data representation. debugging and program verification. Note: For all CS 24X students, concurrent registration into CS 24X lab is a must.

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

Computer Science & Engineering Syllabi

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

Cs 214: Object-Based Programming, Eric Maston

Computer Science & Engineering Syllabi

This course is a basic introduction to object oriented programming utilizing the Visual Basic programming language.

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241-01: 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 206: 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 spreadsheets, databases, and presentation software using Microsoft Excel, Access, and PowerPoint.

Cs 142: 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 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 …

Cs 470/670: System Simulation, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Cs 405/605: Introduction To Database Management Systems, Kenneth Melendez

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/Bio 271: Introduction To Bioinformatics, Dan E. Krane, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Cs 790: Evolutionary Computation In Bioinformatics, Michael L. Raymer

Computer Science & Engineering Syllabi

This course will provide a guided investigation into advanced computational techniques in bioinformatics, especially techniques involving evolutionary computation. The first few weeks will consists of guided in-class discussions reviewing the basic principles of bioinformatics and evolutionary computation. During weeks 3 -6 students will present tutorials on advanced computational topics (see the list of suggested topic areas below). During weeks 7 -10, the students will present papers from the literature in which topics covered in the tutorials have been applied to specific problems in bioinformatics. The class will discuss the quality and findings of these papers.

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 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 840: Advanced Topics In The Theory Of Computation, Thomas Sudkamp

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 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modem 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 and in Scheme.

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

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 453/653-01: Design Of Computing Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.