Digital Commons Network^™

Checking If There Exists A Monotonic Function That Is Consistent With The Measurements: An Efficient Algorithm, Kavitha Tupelly, Vladik Kreinovich, Karen Villaverde

Departmental Technical Reports (CS)

In many problems in science and engineering ranging from astrophysics to geosciences to financial analysis, we know that a physical quantity y depends on the physical quantity x, i.e., y=f(x) for some function f(x), and we want to check whether this dependence is monotonic. Specifically, finitely many measurements of xi and yi=f(xi) have been made, and we want to check whether the results of these measurements are consistent with the monotonicity of f. An efficient parallelizable algorithm is known for solving this problem when the values xi are known precisely, while the values yi are known with interval uncertainty. In …

Probabilistic Approach To Trust: Ideas, Algorithms, And Simulations, Pattama Jaksurat, Eric A. Freudenthal, Martine Ceberio, Vladik Kreinovich

Departmental Technical Reports (CS)

In traditional security systems, for each task, we either trust an agent or we don't. If we trust an agent, we allow this agent full access to this particular task. This agent can usually allow his trusted sub-agents the same access, etc. If a trust management system only uses "trust" and "no trust" options, then a person should trust everyone in this potentially long chain. The problem is that trust is rarely a complete trust, there is a certain probability of distrust. So, when the chain becomes long, the probability of a security leak increases. It is desirable to keep …

Computing The Cube Of An Interval Matrix Is Np-Hard, Olga Kosheleva, Vladik Kreinovich, Guenter Mayer, Hung T. Nguyen

Departmental Technical Reports (CS)

In many practical applications, we are interested in computing the product of given matrices and/or a power of a given matrix. In some cases, the initial matrices are only known with interval uncertainty. It turns out that under this uncertainty, there is a principal difference between the product of two matrices and the product of three (or more) matrices:

on the one hand, it is more or less known that the problems of computing the exact range for the product of two matrices -- and for the square of a matrix -- are computationally feasible;

on the other hand, we …

Foundations Of Statistical Processing Of Set-Valued Data: Towards Efficient Algorithms, Hung T. Nguyen, Vladik Kreinovich, Gang Xiang

Departmental Technical Reports (CS)

Due to measurement uncertainty, often, instead of the actual values xi of the measured quantities, we only know the intervals [Xi]=[Xi-Di,Xi+Di], where Xi is the measured value and Di is the upper bound on the measurement error (provided, e.g., by the manufacturer of the measuring instrument). These intervals can be viewed as random intervals, i.e., as samples from the interval-valued random variable. In such situations, instead of the exact value of a sample statistic such as covariance C(x,y), we can only have an interval [C](x,y) of possible values of this statistic.

In this paper, we extend the foundations of traditional …

Integrated Coverage And Connectivity Configuration For Energy Conservation In Sensor Networks, Guoliang Xing, Xiaorui Wang, Yuanfang Zhang, Chenyang Lu, Robert Pless, Christopher Gill

All Computer Science and Engineering Research

An effective approach for energy conservation in wireless sensor networks is scheduling sleep intervals for extraneous nodes, while the remaining nodes stay active to provide continuous service. For the sensor network to operate successfully, the active nodes must maintain both sensing coverage and network connectivity. Fur-thermore, the network must be able to configure itself to any feasible degrees of coverage and connectivity in order to support different applications and environments with diverse requirements. This paper presents the design and analysis of novel protocols that can dynamically configure a network to achieve guaranteed degrees of coverage and connectivity. This work differs …

Automated Motion Synthesis For Virtual Choreography, Gazihan Alankus, A. Alphan Bayazit, O. Burchan Bayazit

All Computer Science and Engineering Research

In this paper, we present a technique to automati-cally synthesize dancing moves for arbitrary songs. Our current implementation is for virtual characters, but it is easy to use the same algorithms for entertainer robots, such as robotic dancers, which fits very well to this year’s conference theme. Our technique is based on analyzing a musical tune (can be a song or melody) and synthesizing a motion for the virtual character where the character’s movement synchronizes to the musical beats. In order to analyze beats of the tune, we developed a fast and novel algorithm. Our motion synthesis algorithm analyze library …

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

Ceg 361/561-01: Introduction To Software Testing, John A. Reisner

Computer Science & Engineering Syllabi

This course covers software testing strategies, along with established best practices, so students learn how to test their software in a complete and systematic (vice ad-hoc) manner. Particular attention is paid to planning, writing, and executing software testing documentation, i.e., software test plan, to include documented results. Various projects are assigned, designed to illustrate various challenges associated with software testing, and to reinforce the strategies and techniques used to overcome these challenges.

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. The Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.

Ceg 770: Computer Engineering Mathematics, Yong Pei

Computer Science & Engineering Syllabi

Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, queueing theory, mathematics of signal processing, difference equations, and related differential and matrix equations. In addition to mathematical theory, appropriate applications will be presented.

Cs 240: Introduction To Computer Science I, Dale E. Nelson

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 434/634: Concurrent Software Design, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency, and their solutions are examined through course projects and through readings on operating system design.

Ceg 449/699: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

This senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help students in the networking area establish a solid foundation in wireless networking protocols, fundamental concepts and principles. It will also introduce students to a few hot topics in wireless networking and mobile computing research.

The course will start with a review over fundamental design challenges, architectural principles and philosophy for the Internet and heterogeneous networks. The focus will then move on to an in-depth examination of wireless networking protocols, and system design techniques for mobile …

Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor

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. Some programming assignments may involve complex arithmetic and trigonometric exponential functions.

Ceg 360/560 Ee 415/651: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG 260.

Cs 405/605: Introduction To Database Management Systems, Soon M. Chung

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 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 409/609: Principles Of Artificial Intelligence, Michael T. Cox

Computer Science & Engineering Syllabi

"Principles of Artificial Intelligence" is a graduate/undergraduate level introductory course in Artificial Intelligence (AI), designed for students interested in or specializing in AL We will cover several basic topics ranging from knowledge representation, inference, problem solving, search, the predicate calculus and other fundamentals of AI, to selected topics concerning intelligent agents, natural language processing, planning, learning, and case-based reasoning. The intent of the course is to provide a background in artificial intelligence, an exposure to the major issues and methods in the field, and experience in writing AI programs. The course will also examine real AI systems and allow the …

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

No abstract provided.

Cs 205: Computer Literacy And Office Automation, Kim Gros

Computer Science & Engineering Syllabi

To understand basic computer operations and the principal components of a computer and connected peripheral devices

To understand and examine current operating systems, software utilities, device drivers and application software

To define and understand current storage technology and learn about logical file storage and management

To become proficient in using application software categories that are covered in the seven modules

To understand the basics of e-mail

To introduce networking concepts including the Internet and its components and web browser basics

To learn ways to protect your data and avoid computer disasters

Ceg 460/660: Introduction To Software Computer Engineering, Robert J. Weber

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Cs 780: Compiler Design And Construction I, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course deals with the theory and practice of compiler design. Topics emphasized are scanning and parsing. If time permits, semantic analysis will also be covered.

Cs 208: Computer Programming For Business With Java, I, Robert Rea

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

Ceg 702: Advanced Computer Communications, Daniel C. Lee

Computer Science & Engineering Syllabi

The general objective of this graduate-level course on advanced computer communication and networking technologies is to develop students' abilities to (1) conduct research in the area of computer networks and (2) innovate network technologies. This objective will be achieved through a reading/lecture/discussion component and a project component. In particular, we will read papers on various aspects of advanced computer networking, e.g., routing, admission control, congestion/flow control, queuing theory, link scheduling, internetworking, wireless technologies, quality of service, and peer-to-peer networks. We will also learn how to apply (mathematical) optimization to networking.

Cs 340: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://fuva.stm.com. 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 general discussion of the programming assignments. Do not expect support in debugging badly documented code.

Ceg 720: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer, pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing. 3 hours lecture and 2 hours lab.

Ceg 255: Introduction To The Design Of Information Technology Systems, Eric Matson

Computer Science & Engineering Syllabi

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

Ceg 210: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

The objective of the course is to provide an introduction to PC networking hardware, concepts, and technologies with a focus on hardware configuration and LAN administration using in-class, hands-on exercises with Novell NetWare.

Ceg 433/633: Operating Systems, Prabhaker Mateti

Computer Science & Engineering Syllabi

The management of resources in multi-user computer systems. Emphasis is on problems of file-system design, process scheduling, memory allocation, protection, and tools needed for solutions. Course projects use the C/C++ language and include the design of portions of an operating system.

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.