Engineering Commons^™

For Complex Intervals, Exact Range Computation Is Np-Hard Even For Single Use Expressions (Even For The Product), Martine Ceberio, Vladik Kreinovich, Guenter Mayer

Departmental Technical Reports (CS)

One of the main problems of interval computations is to compute the range Y of the given function f(x1,...,xn) under interval uncertainty. Interval computations started with the invention of straightforward interval computations, when we simply replace each elementary arithmetic operation in the code for f with the corresponding operation from interval arithmetic. In general, this technique only leads to an enclosure for the desired range, but in the important case of single use expressions (SUE), in which each variable occurs only once, we get the exact range. Thus, for SUE expressions, there exists a feasible (polynomial-time) algorithm for computing the …

Order And Disorder, Entropy In Math, Science, Nature And The Arts, Sol Neeman Ph.D., Arie Maharshak

Engineering Studies Faculty Publications and Creative Works

Often, science and engineering students have difficult time in viewing certain concepts in their holistic form. An example for such a concept is the concept of Entropy. Although it originated from the field of thermodynamics, the relation between order and disorder is a profound one and manifests itself in various fields, sometimes unrelated, such as math and science, nature and the arts. In the discipline of physics, the amount of disorder in a system has been quantified by the concept of Entropy. In the area of information theory it provides a quantitative measure of the amount of compression that may …

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

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.

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 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 466/666: Formal Languages And Automata, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces the theory of formal languages and automata. The primary focus is on the two methods of defining languages: using generators (e.g., grammars/regular expressions) and using recognizers (e.g., finite state machines). Along with presenting the fundamentals, this course will develop and examine relationships among the various specification methods for the regular languages and the context-free languages, in detail. Overall, we plan to cover the first seven chapters of the text book.

Cs 241: Computer Science Ii, Eric Maston

Computer Science & Engineering Syllabi

This course is the second in the Introduction to Computer Science (24X) series. It focuses on object oriented concepts and an introduction to data structures.

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 765: 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.

Ceg 460/660-01: Introduction To Software Computer Engineering, John A. Reisner

Computer Science & Engineering Syllabi

This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a partnered project.

Ceg 720-01: Computer Architecture, Jack Jean

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 and in Scheme.

Ceg 220-01: Introduction To C Programming For Engineers, Robert Helt

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. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).

Ceg 260-01: Digital Computer Hardware, Travis E. Doom

Computer Science & Engineering Syllabi

Digital Computer Hardware. Topics include switching algebra and switching functions, logic design of combinational and sequential circuits using TTL, combinational logic design with MSI and LSI, busing, storage elements, and instrumentation. 3 hours lecture, 2 hours lab. Prerequisite: CS 241.

Ceg 333-01: Introduction To Unix, Eric Maston

Computer Science & Engineering Syllabi

Introduction to the use of UNIX and UNIX tools as a computing environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, debugging and other tools such as document development.

Cs 240: Computer Science - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. For CS/CEG majors with familiarity of a high-level programming language. Prerequisite: MTH 130 (Precalculus) or MPL 5. 4 credit hours.

Gaussian Mixture Models And Neural Networks For Automatic Speaker Identification, Usha Gayatri Chalkapally

Electrical & Computer Engineering Theses & Dissertations

Automatic Speaker Recognition is the process of automatically recognizing who is speaking on the basis of individual information contained in speech signals. This technique of Automatic Speaker Recognition makes it possible to use the speaker's voice to verify their identity and control access to services such as voice dialing, banking by telephone, telephone shopping, database access services, information services, voice mail, security control for confidential information areas, and remote access to computers.

In this thesis, the techniques of Gaussian Mixture Models and Neural Networks for Automatic Speaker Identification are presented. Algorithms for Speaker Identification using Gaussian Mixture Models were developed, …

An Operational Model For Mobile Sensor Cloud Management, Indrajeet Kalyankar

Electrical & Computer Engineering Theses & Dissertations

Mobile sensors provide a safe, cost effective method for gathering information in hazardous environments. When the hazardous environment is either unexplored, such as the surface of Mars, or unanticipated, such as the result of chemical contamination, it is desirable for a system to gather information with a minimal amount of outside control (localization, decision control, etc.) and prepositioned sensors. If one takes a look at the number of the sensors deployed on a scale, at the lower end is the sole, multipurpose sensor unit. The upper end deals with hordes of inexpensive, expendable sensors. In the middle, a cluster of …

Advancements In Frameworks For Educational Games Through Sound Software Engineering Principles., Christy M. Bogard

Electronic Theses and Dissertations

Educational games have steadily entered classrooms as a means of challenging advanced students and tutoring those lacking comprehension. However, without adequate educational benefits, instructors are struggling to continually justify the marginal value added of using these programs. It is the intent of this thesis to demonstrate that sound software engineering principles can improve the framework of educational games. First, the core framework requirements of computer-based educational games are outlined. Current educational games are then evaluated based on their ability to meet these requirements. From this analysis, necessary architectural changes are recommended to best facilitate future game advancements. Finally, to demonstrate …

Sub-Banded Reconstructed Phase Spaces For Speech Recognition, Kevin M Indrebo, Richard J. Povinelli, Michael T. Johnson

Electrical and Computer Engineering Faculty Research and Publications

A novel method combining filter banks and reconstructed phase spaces is proposed for the modeling and classification of speech. Reconstructed phase spaces, which are based on dynamical systems theory, have advantages over spectral-based analysis methods in that they can capture nonlinear or higher-order statistics. Recent work has shown that the natural measure of a reconstructed phase space can be used for modeling and classification of phonemes. In this work, sub-banding of speech, which has been examined for recognition of noise-corrupted speech, is studied in combination with phase space reconstruction. This sub-banding, which is motivated by empirical psychoacoustical studies, is shown …

Soft-Started Induction Motor Modeling And Heating Issues For Different Starting Profiles Using A Flux Linkage Abc Frame Of Reference, M. G. Solveson, Behrooz Mirafzal, Nabeel Demerdash

Electrical and Computer Engineering Faculty Research and Publications

In order to mitigate the adverse effects of starting torque transients and high inrush currents in induction motors, a popular method is to use electronically controlled soft-starting voltages utilizing series-connected silicon-controlled rectifiers (SCRs). Investigation of semioptimum soft-starting voltage profiles was implemented using a flux linkage ABC frame of reference model of a soft-started three-phase induction motor. A state-space model of the soft-starter thyristor switching sequence for the motor and load was developed and implemented in a time-domain simulation to examine winding heating and shaft stress issues for different starting profiles. Simulation results of line starts and soft starts were compared …

High Performance Queueing And Scheduling In Support Of Multicasting In Input-Queued Switches, Weiying Zhu

Electrical & Computer Engineering Theses & Dissertations

Due to its mild requirement on the bandwidth of switching fabric and internal memory, the input-queued architecture is a practical solution for today's very high-speed switches. One of the notoriously difficult problems in the design of input-queued switches with very high link rates is the high performance queueing and scheduling of multicast traffic. This dissertation focuses on proposing novel solutions for this problem. The design challenge stems from the nature of multicast traffic, i.e., a multicast packet typically has multiple destinations. On the one hand, this nature makes queueing and scheduling of multicast traffic much more difficult than that of …

Measuring Privacy Loss In Statistical Databases, Vinod Chirayath, Luc Longpre, Vladik Kreinovich

Departmental Technical Reports (CS)

Protection of privacy in databases has become of increasing importance. While a number of techniques have been proposed to query databases while preserving privacy of individual records in the database, very little is done to define a measure on how much privacy is lost after statistical releases. We suggest a definition based on information theory. Intuitively, the privacy loss is proportional to how much the descriptional complexity of a record decreases relative to the statistical release. There are some problems with this basic definition and we suggest ways to address these problems.

Unimodality, Independence Lead To Np-Hardness Of Interval Probability Problems, Daniel J. Berleant, Olga Kosheleva, Vladik Kreinovich, Hung T. Nguyen

Departmental Technical Reports (CS)

In many real-life situations, we only have partial information about probabilities. This information is usually described by bounds on moments, on probabilities of certain events, etc. -- i.e., by characteristics c(p) which are linear in terms of the unknown probabilities pj. If we know interval bounds on some such characteristics ai <= ci(p) <= Ai, and we are interested in a characteristic c(p), then we can find the bounds on c(p) by solving a linear programming problem.

In some situations, we also have additional conditions on the probability distribution -- e.g., we may know that the two variables x1 and x2 are independent, or that the distribution of x1 and x2 is unimodal. We show that adding each of these conditions makes the corresponding interval probability …

How To Measure Loss Of Privacy, Luc Longpre, Vladik Kreinovich

Departmental Technical Reports (CS)

To compare different schemes for preserving privacy, it is important to be able to gauge loss of privacy. Since loss of privacy means that we gain new information about a person, it seems natural to measure the loss of privacy by the amount of information that we gained. However, this seemingly natural definition is not perfect: when we originally know that a person's salary is between $10,000 and $20,000 and later learn that the salary is between $10,000 and $15,000, we gained exactly as much information (one bit) as when we learn that the salary is an even number -- …

Statistical Data Processing Under Interval Uncertainty: Algorithms And Computational Complexity, Vladik Kreinovich

Departmental Technical Reports (CS)

No abstract provided.

Sequence Of Linear Programming For Transmission Of Fine-Scalable Coded Content In Bandwidth-Limited Environments, Xiao Su, Tao Wang

Faculty Publications

In this paper, we propose an optimal peer assignment algorithm on peer-to-peer networks. This algorithm is designed to maximize the quality of transmitting fine-scalable coded content by exploiting the embedding property of scalable coding. To be more realistic, we assume that the requesting peer has a delay constraint to display the content within a certain delay bound, and it also has limited incoming bandwidth. We first use a simple example to illustrate the peer assignment problem, and then formulate this problem as a linear programming problem, followed by a nonlinear programming problem. To efficiently solve the second nonlinear problem, we …

An Experimental Analysis Of The Call Capacity Of Ieee 802.11b Wireless Local Area Networks For Voip Telephony, Brian Keegan, Mark Davis

Conference papers

In this paper we present the results from an experimental study of the call capacity of an IEEE 802.11b network when using VoIP telephony. Experiments include increasing the number of VoIP users in a wireless test-bed and increasing the level of background traffic until network saturation occurs. The experiments allow us to perform an analysis of the access point (AP) buffer dynamics. Results show that the network is capable of supporting up to 16 VoIP stations (STAs). Due to the operation of the IEEE 802.11 medium access control (MAC) mechanism, the AP acts as a bottleneck for all traffic destined …

Web Services - Based Autonomic Computing Framework (Wsac), Sherif Atef Gurguis

Archived Theses and Dissertations

No abstract provided.

Automatic Labeling Of Back Channels, Udit Sajjanhar, Nigel Ward

Departmental Technical Reports (CS)

In dialog, the proper production of back-channels is an important way for listeners to cooperate with speakers. Developing quantitative models of this process is important both for improving spoken dialog systems and for teaching second language learners. An essential step for the development of such models is labeling all back-channels in corpora of human-human dialogs. Currently this is done by hand. This report describes a method for automatically identifying back-channels in conversation corpora, using only the patterns of speech and silence by the speaker and the listener in the local context. Tested on Arabic, Spanish, and English, this method identifies …