Computer Engineering Commons^™

Spectral Response Surfaces And The Ringing Response Of Offshore Structures, I Ketut Suastika

Makara Journal of Technology

A method, called spectral response surface method, is proposed for the study of the ringing phenomenon of offshore structures. Newman’s results for diffraction force on a column were reformulated in terms of the frequency components of the ocean surface and their Hilbert transforms. Using a first-order reliability method together with a dynamic model for the structural response, it is straightforward to calculate the ocean surface history most likely to generate an extreme ringing response and the ringing response history.

An Aspect-Based Approach To Checking Design Constraints At Run-Time, Yoonsik Cheon, Carmen Avila, Steve Roach, Cuauhtemoc Munoz, Neith Estrada, Valeria Fierro, Jessica Romo

Departmental Technical Reports (CS)

Design decisions and constraints of a software system can be specified precisely using a formal notation such as the Object Constraint Language (OCL). However, they are not executable, and assuring the conformance of an implementation to its design is hard. The inability of expressing design constraints in an implementation and checking them at runtime invites, among others, the problem of design drift and corrosion. We propose runtime checks as a solution to mitigate this problem. The key idea of our approach is to translate design constraints written in a formal notation such as OCL into aspects that, when applied to …

On Chromatic Numbers Of Space-Times: Open Problems, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

No abstract provided.

A Paradox Of Altruism: How Caring About Future Generations Can Result In Poverty For Everyone (Game-Theoretic Analysis), Tanja Magoc, Vladik Kreinovich

Departmental Technical Reports (CS)

Political and social activists are rightfully concerned about future generations: whenever a country borrows money, or an environmental situation worsens, this means, in effect, that we impose an additional burdens on future generations. There is clearly a conflict between the present generation's actions and interests and the welfare of the future generations. There exists a mathematical toolbox that provides solutions to many well-defined conflict situations: namely, the toolbox of game theory. It therefore seems reasonable to apply game theory techniques to the conflict between the generations. In this paper, we show that we need to be very cautious about this …

Viability Of Travel-Time Sensitivity Testing For Estimating Uncertainty Of Tomographic Velocity Models: A Case Study, Matthew G. Averill, Kate C. Miller, Vladik Kreinovich, Aaron A. Velasco

Departmental Technical Reports (CS)

Seismic tomography is now a common approach to estimating velocity structure of the Earth, regardless of whether the data sources are earthquake recordings or controlled sources such as explosions, airguns or Vibroseis. Seismic tomography is convenient to implement because it requires little to no a priori knowledge of Earth structure and is much less time consuming than forward modeling schemes. Despite its convenience, the method still lacks satisfactory quantitative assessments of model reliability. Here we explore the viability of applying travel-time sensitivity testing that uses a modified Cauchy distribution as its statistical foundation to assessing the uncertainty in velocity models …

A New Simplified Derivation Of Nash Bargaining Solution, Tanja Magoc, Vladik Kreinovich

Departmental Technical Reports (CS)

In the 1950s, the Nobel Prize winner John F. Nash has shown that under certain conditions, the best solution to the bargaining problem is when the product of the (increase in) utilities is the largest. Nash's derivation assumed that we are looking for strategies that assign a single situation to each bargaining situation. In this paper, we propose a simplified derivation of Nash bargaining solution that does not requires this assumption.

Evaluating Shape Correspondence For Statistical Shape Analysis: A Benchmark Study, Brent C. Munsell, Pahal Dalal, Song Wang

Faculty Publications

This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-correspondence evaluation methods, the proposed benchmark first generates a large set of synthetic shape instances by randomly sampling a given statistical shape model that defines a ground-truth shape space. We then run a test shape-correspondence algorithm on these synthetic shape instances to identify a set of corresponded landmarks. According to the identified corresponded landmarks, we construct a new statistical shape model, which defines a new shape space. We finally compare this new shape space against the ground-truth …

Irrelevance, Polymorphism, And Erasure In Type Theory, Richard Nathan Mishra-Linger

Dissertations and Theses

Dependent type theory is a proven technology for verified functional programming in which programs and their correctness proofs may be developed using the same rules in a single formal system. In practice, large portions of programs developed in this way have no computational relevance to the ultimate result of the program and should therefore be removed prior to program execution. In previous work on identifying and removing irrelevant portions of programs, computational irrelevance is usually treated as an intrinsic property of program expressions. We find that such an approach forces programmers to maintain two copies of commonly used datatypes: a …

Implementing Arabic-To-English Machine Translation Using The Role And Reference Grammar Linguistic Model, Yasser Salem, Arnold Hensman, Brian Nolan

Conference Papers

This paper presents work-in-progress investigating the development of a rule-based lexical framework for Arabic language processing using the Role and Reference Grammar (RRG) linguistic model. A system, called UniArab is introduced in this research to support the framework. The paper outlines the conceptual structure of UniArab System, which utilizes the framework and translates the Arabic language into another natural language. Also, this paper explores how the characteristics of the Arabic language will effect the development of a Machine Translation (MT) tool from Arabic to English. Several distinguishing features of Arabic pertinent to MT will be explored in detail with reference …

Minimum Mean-Squared Error Estimation Of Mel-Frequency Cepstral Coefficients Using A Novel Distortion Model, Kevin M. Indrebo, Richard J. Povinelli, Michael T. Johnson

Electrical and Computer Engineering Faculty Research and Publications

In this paper, a new method for statistical estimation of Mel-frequency cepstral coefficients (MFCCs) in noisy speech signals is proposed. Previous research has shown that model-based feature domain enhancement of speech signals for use in robust speech recognition can improve recognition accuracy significantly. These methods, which typically work in the log spectral or cepstral domain, must face the high complexity of distortion models caused by the nonlinear interaction of speech and noise in these domains. In this paper, an additive cepstral distortion model (ACDM) is developed, and used with a minimum mean-squared error (MMSE) estimator for recovery of MFCC features …

Asymmetric Information Measures: How To Extract Knowledge From An Expert So That The Expert's Effort Is Minimal, Hung T. Nguyen, Vladik Kreinovich, Elizabeth N. Kamoroff

Departmental Technical Reports (CS)

Knowledge acquisition is when we ask experts questions, and put the answers into the computer system. Since this is a very time-consuming task, it is desirable to minimize the effort of an expert.

As a crude estimate for this effort, we can take a number of binary (yes-no) questions that we ask. The procedure that minimizes this number is binary search.

This approach does not take into account that people often feel more comfortable answering "yes" than answering "no". So, to make our estimates more realistic, we will take into consideration that for a negative answer the effort is bigger. …

Optimisation Of Multicast Routing In Wireless Mesh Networks, Brian Keegan, Karol Kowalik, Mark Davis

Conference papers

In recent years Wireless Mesh Networks have been deployed and grown in popularity in many metropolitan areas. The deployment of such networks has allowed clients to gain access to publicly available broadband networks. The implementation of wireless mesh networks requires that backhaul services (traditionally carried by wired networks) be maintained via wireless mesh points. Because of their structure, wireless mesh networks provide an excellent means for targeting a large group of end users or simply to relay data. This may be achieved by means of broadcasting or more specifically multicasting. The lack of standards and support for multicasting over wireless …

Current Financial Crisis And Inadequate Uncertainty Processing: A Comment, Tanja Magoc, Vladik Kreinovich

Departmental Technical Reports (CS)

No abstract provided.

Energy-Constrained Distortion Reduction Optimization For Wavelet-Based Coded Image Transmission In Wireless Sensor Networks, Wei Wang, Dongming Peng, Honggang Wang, Hamid Sharif, Hsiao-Hwa Chen

Department of Electrical and Computer Engineering: Faculty Publications (to 2015)

Image transmissions in Wireless Multimedia Sensor Networks (WMSNs) are often energy constrained. They also have requirement on distortion minimization, which may be achieved through Unequal Error Protection (UEP) based communication approaches. In related literature with regard to wireless multimedia transmissions, significantly different importance levels between image-pixel-position information and image-pixel-value information have not been fully exploited by existing UEP schemes. In this paper, we propose an innovative image-pixel-position information based resource allocation scheme to optimize image transmission quality with strict energy budget constraint for image applications in WMSNs, and it works by exploring these uniquely different importance levels among image data …

Complexity Of Some Geometric Problems, Marcus Schaefer

Technical Reports

We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential first-order theory of the reals. Comparing this to similar results on the rectilinear crossing number and intersection graphs of line segments, we argue that there is a need to recognize this level of complexity as its own class.

Ceg 460/660: Introduction To Software Computer Engineering, Jeffrey Mcdonald

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 sot1ware, 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.

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

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.

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel and useful knowledge from large amounts of data. This course introduces and studies the fundamental concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.

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

Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operation of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument pasing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used.

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

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, by Thomas Sudkamp.

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

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

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 241: Introduction To Computer Science Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

A continuation of CS 240. Emphasis is on solving more complex problems using object oriented programming. Prerequisite: CS 240. 4 credit hours.

Cs 400/600: Data Structures And Software Design, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the implementation of classical data structures and control structures, an introduction to the fundamentals of algorithm design and analysis, and the basic problem solving techniques.

Ceg/Ee 260: Digital Computer Hardware Switching Circuits, John C. Gallagher

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.

Cs 205-08: Introduction To Computers And Office Productivity Software, Kim Gros

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.