Computer Engineering Commons^™

Clustering And Its Application In Requirements Engineering, Chuan Duan

Technical Reports

Large scale software systems challenge almost every activity in the software development life-cycle, including tasks related to eliciting, analyzing, and specifying requirements. Fortunately many of these complexities can be addressed through clustering the requirements in order to create abstractions that are meaningful to human stakeholders. For example, the requirements elicitation process can be supported through dynamically clustering incoming stakeholders’ requests into themes. Cross-cutting concerns, which have a significant impact on the architectural design, can be identified through the use of fuzzy clustering techniques and metrics designed to detect when a theme cross-cuts the dominant decomposition of the system. Finally, traceability …

Sloth-Nfs And The Possibility Of Using Fuzzy Control To Optimize Cache Management, Ryan C. Spring, Eric Freudenthal

Departmental Technical Reports (CS)

Modern software systems are complex and increasingly vulnerable to malicious attack. In order to apply bug fixes and protect against security weaknesses, workstation administrators must continuously patch operating system and application program installations. To simplify this process, administrators generally configure systems into clusters with common installations of operating systems and application programs in a manner that patches and other routine maintenance can be applied en masse. Two widely used approaches offer complementary advantages: Installations and updates are particularly convenient when all data including operating system and programs is served by traditional centralized network-connected file servers (networked file systems) because administrators …

Asymmetric Paternalism: Description Of The Phenomenon, Explanation Based On Decisions Under Uncertainty, And Possible Applications To Education, Olga Kosheleva, Francois Modave

Departmental Technical Reports (CS)

In general, human being are rational decision makers, but in many situations, they exhibit unexplained "inertia", reluctance to switch to a better decision. In this paper, we show that this seemingly irrational behavior can be explained if we take uncertainty into account; we also explain how this phenomenon can be utilized in education.

Modeling And Characterization Of Adaptive Lanthanum-Modified Lead Zirconate Titanate (Plzt) Microlenses, Yasser A. Abdelaziez, Partha P. Banerjee

Electrical and Computer Engineering Faculty Publications

We report the modeling and characterization of adaptive voltage controlled electro-optic microlenses. First, we utilize finite element analysis (FEA) to simulate the induced electro-optic effect in lanthanum-modified lead zirconate titanate (PLZT). FEA simulation provides microlens parameters such as phase and focal length. A simple z-scan method is developed to fully characterize the adaptive voltage controlled linear lens. Experimental z-scan results are shown to match the theoretical predictions from FEA.

Impact Of Checkpoint Latency On The Optimal Checkpoint Interval And Execution Time, Sarala Arunagiri, Seetharami Seelam, Ron A. Oldfield, Maria Ruiz, Patricia J. Teller, Rolf Riesen

Departmental Technical Reports (CS)

The massive scale of current and next-generation massively parallel processing (MPP) systems presents significant challenges related to fault tolerance. In particular, the standard approach to fault tolerance, application-directed checkpointing, puts an incredible strain on the storage system and the interconnection network. This results in overheads on the appliation that severely impact performance and scalability. The checkpoint overhead can be reduced by decreasing the checkpoint latency, which is the time to write a checkpoint file, or by increasing the checkpoint interval, which is the compute time between writing checkpoint files. However, increasing the checkpoint interval may increase execution time in the …

Program Synthesis From Workflow-Driven Ontologies, Leonardo Salayandia, Steve Roach, Ann Q. Gates

Departmental Technical Reports (CS)

An approach that results in the development of Workflow-Driven Ontologies (WDO) (called the WDO approach) allows domain scientists to capture process knowledge in the form of concepts as well as relations between concepts. Program synthesis techniques can be employed to generate algorithmic solutions by transforming the process knowledge expressed in the WDO as concepts and relations to variables and functions and computing unknown variables from known ones based on the process knowledge documented by the domain scientist. Furthermore, the algorithmic solutions that are generated by program synthesis potentially can support the composition of services, which result in the creation of …

Opportunistic Checkpoint Intervals To Improve System Performance, Sarala Arunagiri, John T. Daly, Patricia J. Teller, Seetharami Seelam, Ron A. Oldfield, Maria Ruiz Varela, Rolf Riesen

Departmental Technical Reports (CS)

The massive scale of current and next-generation massively parallel processing (MPP) systems presents significant challenges related to fault tolerance. For applications that perform periodic checkpoints, the choice of the checkpoint interval, the period between checkpoints, can have a significant impact on the execution time of the application. Finding the optimal checkpoint interval that minimizes the wall clock execution time, has been a subject of research over the last decade. In an environment where there are concurrent applications competing for access to the network and storage resources, in addition to application execution times, contention at these shared resources need to be …

Selfish Wavelength Assignment In Multifiber Optical Networks, Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Katerina Potika

Faculty Publications, Computer Science

No abstract provided.

Resource Sharing Via Planed Relay For Hwn, Chong Shen, Susan Rea, Dirk Pesch

NIMBUS Articles

We present an improved version of adaptive distributed cross-layer routing algorithm (ADCR) for hybrid wireless network with dedicated relay stations () in this paper. A mobile terminal (MT) may borrow radio resources that are available thousands mile away via secure multihop RNs, where RNs are placed at pre-engineered locations in the network. In rural places such as mountain areas, an MT may also communicate with the core network, when intermediate MTs act as relay node with mobility. To address cross-layer network layers routing issues, the cascaded ADCR establishes routing paths across MTs, RNs, and cellular base stations (BSs) and provides …

Fast Algorithms For Uncertainty Propagation, And Their Applications To Structural Integrity, Andrzej Pownuk, Jakub Cerveny, Jerald Brady

Departmental Technical Reports (CS)

In many practical situations, we need to know how uncertainty propagates through data processing algorithms, i.e., how the uncertainty in the inputs affects the results of data processing. This problem is important for all types of uncertainty: probabilistic, interval, and fuzzy. From the computational viewpoint, however, this problem is much more complex for interval and fuzzy uncertainty. Therefore, for these types of uncertainty, it is desirable to design faster algorithms.

In this paper, we describe faster algorithms for two practically important situations:

linearization situations, when the approximation errors are small and therefore, the data processing algorithms can be replaced by …

Strong Hanani-Tutte On The Projective Plane, Michael J. Pelsmajer, Marcus Schaefer, Despina Stasi

Technical Reports

If a graph can be drawn in the projective plane so that every two non-adjacent edges cross an even number of times, then the graph can be embedded in the projective plane.

A Weighted Modular Principal Component Analysis Approach For Face Authentication, Chandrika Tummala

Electrical & Computer Engineering Theses & Dissertations

A weighted modular approach for face authentication based on the priorities of different facial regions that change with varying poses, expressions and occlusions is presented in this thesis. This helps in verifying the identity of an individual who claims to be a subject in the database and is unaware of the presence of the face authentication system. A sequence of face images is selected from a video in a particular predefined interval and is used for verification. The face images are divided into different horizontal modules based on the regions representing facial features. A principal component analysis on these modules …

Cs 141-01: Computer Programming - I, Jay Dejongh

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 400/600: Data Structures And Algorithms, Eric Maston

Computer Science & Engineering Syllabi

This is the initial course in the understanding of data structures. This course focuses on data structures with abstract data types, such as trees, stacks, queues and graphs. The course will use projects to create a deeper understanding of data structure and their use.

Cs 712: Advanced Topics In Artificial Intelligence: Inference Graphical Models, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

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 772: Advanced Natural Language Processing Concepts, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 207: Advanced Office Productivity Ii, Amanda Hood

Computer Science & Engineering Syllabi

This course covers post-advanced microcomputer applications including Microsoft Office Word 2007, Excel 2007, Access 2007, and PowerPoint 2007. Topics include: creating an online form, working with macros and Visual Basic for Applications (VBA), working with a master document, and 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 a multi-page form, administering a database system, creating a self-running presentation …

Cs 208-01: Computer Programming For Business I, David M. Hutchison

Computer Science & Engineering Syllabi

CS 208 Is the first in a sequence of two programming classes required for MIS majors. This course will introduce students to the basic concepts of programming. Examples are from business applications and display graphics and emphasis is on problem solving with the computer as a tool.

Cs 240-02: Computer Programming I, Jay Dejongh

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. Prerequisite: MTH 130 or MPL 5.

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

Computer Science & Engineering Syllabi

CS 4661666 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 790-01: Multimedia Coding And Communication (Ii), Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in Python. You are expected to learn the language and solve a set of programming problems assigned to you from Dietel et al using Python available from http://www.python.org. 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 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.

Cs 240-01: Computer Programming I, Jay Dejongh

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. Prerequisite: MTH 130 or MPL 5.

Cs 350/550: Computational Tools And Techniques For Data Analysis, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to the representation, visualization, and modeling of large data sets. Data analysis using standard high level software tools. Topics include data filtering, clustering, classification, and data mining. A familiarity with Excel is assumed plus some exposure to programming in languages such as CIC++ or Java. Knowledge of basic statistics is useful but not required. Material covered will be relevant to applications areas in science and engineering. Four credit hours.

Cs 242: Introduction To Computer Science Iii, Haiyun Bian

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241: Computer Programming Ii, Travis E. Doom

Computer Science & Engineering Syllabi

A continuation of CS240. The emphasis is on data abstraction and software engineering. Prerequisite: CS240.