Computer Engineering Commons^™

Efficient Support For Application-Specific Video Adaptation, Jie Huang

Dissertations and Theses

As video applications become more diverse, video must be adapted in different ways to meet the requirements of different applications when there are insufficient resources. In this dissertation, we address two sorts of requirements that cannot be addressed by existing video adaptation technologies: (i) accommodating large variations in resolution and (ii) collecting video effectively in a multi-hop sensor network. In addition, we also address requirements for implementing video adaptation in a sensor network.

Accommodating large variation in resolution is required by the existence of display devices with widely disparate screen sizes. Existing resolution adaptation technologies usually aim at adapting video …

How To Efficiently Process Uncertainty Within A Cyberinfrastructure Without Sacrificing Privacy And Confidentiality, Luc Longpre, Vladik Kreinovich

Departmental Technical Reports (CS)

In this paper, we propose a simple solution to the problem of estimating uncertainty of the results of applying a black-box algorithm -- without sacrificing privacy and confidentiality of the algorithm.

Entropy Conserving Probability Transforms And The Entailment Principle, Ronald R. Yager, Vladik Kreinovich

Departmental Technical Reports (CS)

Our main result here is the development of a general procedure for transforming some initial probability distribution into a new probability distribution in a way that the resulting distribution has entropy at least as great as the original distribution. A significant aspect of our approach is that it makes use of the Zadeh's entailment principle which is itself a general procedure for going from an initial possibility distribution to a new possibility distribution so that the resulting possibility has an uncertainty at least as great of the original.

Two Etudes On Combining Probabilistic And Interval Uncertainty: Processing Correlations And Measuring Loss Of Privacy, Martine Ceberio, Gang Xiang, Luc Longpre, Vladik Kreinovich, Hung T. Nguyen, Daniel Berleant

Departmental Technical Reports (CS)

In many practical situations, there is a need to combine interval and probabilistic uncertainty. The need for such a combination leads to two types of problems: (1) how to process the given combined uncertainty, and (2) how to gauge the amount of uncertainty and -- a related question -- how to best decrease this uncertainty. In our research, we concentrate on these two types of problems. In this paper, we present two examples that illustrate how the corresponding problems can be solved.

Textual Case-Based Reasoning For Spam Filtering: A Comparison Of Feature-Based And Feature-Free Approaches, Sarah Jane Delany, Derek Bridge

Articles

Spam filtering is a text classification task to which Case-Based Reasoning (CBR) has been successfully applied. We describe the ECUE system, which classifies emails using a feature-based form of textual CBR. Then, we describe an alternative way to compute the distances between cases in a feature-free fashion, using a distance measure based on text compression. This distance measure has the advantages of having no set-up costs and being resilient to concept drift. We report an empirical comparison, which shows the feature-free approach to be more accurate than the feature-based system. These results are fairly robust over different compression algorithms in …

Ceg 499/699: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

Increasingly, people, computers and microelectronic devices are being linked together to bring to life the communications mantra: anybody, anything, anytime, anywhere. This junior/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 engineering and computer science students establish a solid foundation in concepts, architecture, design, and performance evaluation of mobile computing principle, protocols and applications. It will also introduce students to a few hot topics in wireless networking and mobile computing research such as mobile IP, wireless TCP, 802.11, agent techniques, etc. The course material also …

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 205: Introduction To Computers And Office Productivity Software, John P. Herzog

Computer Science & Engineering Syllabi

Focus on learning MS Office software applications including word processing
(intermediate), spreadsheets, database and presentation graphics using a case study
approach where critical thinking and problem solving skills are required. Computer
concepts are integrated throughout the course to provide an understanding of the basics of
computing, the latest technological advances and how they are used in industry. Ethics
and issues encountered in business are discussed to challenge students on societal impact
of technology.

Cs 240: Introduction To Computer Science I, L. Jane Lin

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement.

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

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management 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.

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://java.sun.com or' other software as approved by the instructor. 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.

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.

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 I, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

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
word processing, spreadsheets, databases, and presentation software and web design using
Microsoft Word, Microsoft FrontPage, Microsoft Excel, Access, and PowerPoint.

Cs 340: Programming Language Workshop In C#, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in C#. You are expected to learn the language and solve a set of programming problems assigned to you using MS Visual Studio .NET. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

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 790: Special Topics On Image Processing: Algorithms, Languages, And Architectures, Nikolaos Bourbakis

Computer Science & Engineering Syllabi

Introduction; Image Processing Operators and Morphology; Image Transformations; Image Processing Languages; Image Coding and Compression;
Image Encryption and Hiding; Digital TV and Video

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/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer

Computer Science & Engineering Syllabi

Theory-oriented approach to the application of contemporary algorithms to bioinformatics. Graph theory, complexity theory, dynamic programming and optimization techniques are introduced in the context of application toward solving specific computational problems in molecular genetics. 4 credit hours.

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

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 can be recognized by the computations of 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 400/600: Data Structures And Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

In this course, students will learn basic data structures and how to design and analyze and implement software. Course covers introduction to the fundamentals of complexity and analysis and study of common problems and solutions using various data structures. After taking this course, students are expected to be able to design reasonable software for problems and estimate (evaluate) the performance of them even without writing the software.

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.

Cs 241: 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.

Ceg 360/560 Ee 451/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.

Ceg 790: Emerging Networks, Bin Wang

Computer Science & Engineering Syllabi

This is a graduate level course on emerging networking technologies. The course involves a reading/lecture/presentation/discussion component, paper review component, and a project component. It will provide an in-depth study on a number of focused areas: dense wavelength division multiplexing (DWDM) optical networks, optical burst switching networks, peer-to-peer networks, and wireless mobile networks (including Ad-hoc wireless networks, sensor networks). Various technical and research issues involved will be studied. These areas of emerging networking technologies will play central roles in future communication networks.

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, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.

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 and exponential functions. 4 credit hours.