Computer Sciences Commons^™

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 784: Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

To provide a solid foundation for studying advanced topics in Programming Language Specification and Design.

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 242: Computer Programming Iii, Tom S. Wailes

Computer Science & Engineering Syllabi

No abstract provided.

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 875: Semantic Web, Amit P. Sheth

Computer Science & Engineering Syllabi

World Wide Web (Web 1.0, or "the Web," as we now know it) centers on documents and semistructured data in html, rss, and xml. The next generation Web, also called Web 2.0 and Web 3.0, has already started to emerge. Web 2.0 is about user-generated content, user participation such as through tagging, and social networking. Web 3.0, also called Semantic Web, is about labeling content such that machines can process it more intelligently and humans can exploit it more effectively. These labels or metadata add semantics (meaning) to data, and their formal representation enables powerful reasoning that leads not only …

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, David M. Hutchison

Computer Science & Engineering Syllabi

CS 209 is the second in a sequence of two programming classes required for
MIS majors. This course will continue teaching students to the basic concepts
of programming. Examples are from business applications and emphasis is on
problem solving with the computer as a tool.

Ceg 498: Design Experience, Thomas C. Hartrum

Computer Science & Engineering Syllabi

CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journal and on the quality of their collective efforts as reflected in group generated products.

Ceg 436/636: 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. l l, agent techniques, etc. The course …

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

Computer Science & Engineering Syllabi

No abstract provided.

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

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 476/676: Computer Graphics I, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D objects
as well as manipulating and rendering the objects using OpenGL.
The outline of the course is as follows:

Introduction

• Geometric primitives
• Attributes of geometric primitives
• Antialiasing techniques
• Homogeneous coordinate system
• 2-D and 3-D viewing transformations
• Structures and hierarchical modeling
• Input devices and interactive techniques
• Visible surface detection methods

Ceg 434/634: Concurrent Software Design, Yong Pei

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.

Cs 205: Computer Literacy And Office Automation, Ann Tirpack

Computer Science & Engineering Syllabi

No abstract provided.

Window Queries Over Data Streams, Jin Li

Dissertations and Theses

Evaluating queries over data streams has become an appealing way to support various stream-processing applications. Window queries are commonly used in many stream applications. In a window query, certain query operators, especially blocking operators and stateful operators, appear in their windowed versions. Previous research work in evaluating window queries typically requires ordered streams and this order requirement limits the implementations of window operators and also carries performance penalties. This thesis presents efficient and flexible algorithms for evaluating window queries. We first present a new data model for streams, progressing streams, that separates stream progress from physical-arrival order. Then, we …

Determining The Number Of Bp Neural Network Hidden Layer Units, Huayu Shen, Zhaoxia Wang, Chengyao Gao, Juan Qin, Fubin Yao, Wei Xu

Research Collection School Of Computing and Information Systems

This paper proposed an improved method to contrapose the problem which is difficult to determine the number of BP neural network hidden layer units. it is proved that the method is efficeient in reducing the frequency of the test through experients, and improves the efficiency of determining the best number of hidden units, which is more valuable in the applications.

Fusing Semantics, Observability, Reliability And Diversity Of Concept Detectors For Video Search, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Effective utilization of semantic concept detectors for large-scale video search has recently become a topic of intensive studies. One of main challenges is the selection and fusion of appropriate detectors, which considers not only semantics but also the reliability of detectors, observability and diversity of detectors in target video domains. In this paper, we present a novel fusion technique which considers different aspects of detectors for query answering. In addition to utilizing detectors for bridging the semantic gap of user queries and multimedia data, we also address the issue of "observability gap" among detectors which could not be directly inferred …

Ontology-Based Visual Word Matching For Near-Duplicate Retrieval, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper proposes a novel approach to exploit the ontological relationship of visual words by linguistic reasoning. A visual word ontology is constructed to facilitate the rigorous evaluation of linguistic similarity across visual words. The linguistic similarity measurement enables cross-bin matching of visual words, compromising the effectiveness and speed of conventional keypoint matching and bag-of-word approaches. A constraint EMD is proposed and experimented to efficiently match visual words. Empirical findings indicate that the proposed approach offers satisfactory performance to near-duplicate retrieval, while still enjoying the merit of speed efficiency compared with other techniques.

Modeling Video Hyperlinks With Hypergraph For Web Video Reranking, Hung-Khoon Tan, Chong-Wah Ngo, Xiao Wu

Research Collection School Of Computing and Information Systems

In this paper, we investigate a novel approach of exploiting visual-duplicates for web video reranking using hypergraph. Current graph-based reranking approaches consider mainly the pair-wise linking of keyframes and ignore reliability issues that are inherent in such representation. We exploit higher order relation to overcome the issues of missing links in visual-duplicate keyframes and in addition identify the latent relationships among keyframes. Based on hypergraph, we consider two groups of video threads: visual near-duplicate threads and story threads, to hyperlink web videos and describe the higher order information existing in video content. To facilitate reranking using random walk algorithm, the …

Spreadsheet Data Resampling For Monte-Carlo Simulation, Thin Yin Leong, Wee Leong Lee

Research Collection School Of Computing and Information Systems

The pervasiveness of spreadsheets software resulted in its increased application as a simulation tool for business analysis. Random values generation supporting such evaluations using spreadsheets are simple and yet powerful. However, the typical approach to Monte-Carlo simulations, which is what simulations with stochasticity are called, requires significant amount of time to be spent on data collection, data collation, and distribution function fitting. In fact, the latter can be overwhelming for undergraduate students to learn and do properly in a short time. Resampling eliminates both the need to fit distributions to the sample data, and to perform the ensuing tests of …

Biomarker Identification For Prostate Cancer Using An Efficient Feature Selection Algorithm, Vamsi Krishnam Raju Mantena

Electrical & Computer Engineering Theses & Dissertations

In recent years, there has been an increased interest in using protein mass spectrometry to identify biomarkers that discriminate diseased from healthy individuals. A biomarker is a characteristic that is objectively measured and evaluated as an indicator of normal biological processes, pathological processes, or pharmacological responses to a therapeutic intervention. Identifying biomarkers will be an important step towards disease characterization and patient management. One challenge of biomarker identification is how to handle the high dimensional mass spectral data. In this thesis, we applied an efficient feature selection algorithm to mass spectrometry data obtained from prostate tissue samples to identify prostate …

An Agent-Based Combat Simulation Framework In Support Of Effect-Based And Net-Centric Evaluation, Robert Joseph Bowen

Computational Modeling & Simulation Engineering Theses & Dissertations

The use of information technologies (IT) and information networks has proliferated in industry as a method to achieve competitive advantage. The U.S. Military and its allies, in recent years, have employed IT to improve the way they conduct operations, speed decision making, and increase the span of control of commanders. This has resulted in a fundamental shift in the way military commanders employ combat units today. These (Information Age) forces no longer have to be able to see each other or even communicate directly in order to synchronize maneuvers. Dispersion is now favored over mass, relying on the IT network …

Modeling Geographic Population Dispersion Utilizing Geospatial Information System Environment Agents In An Agent Based Model, Karl D. Liebert

Computational Modeling & Simulation Engineering Theses & Dissertations

New capabilities in agent based model (ABM) environments are opening the door to the creation of ABM that may incorporate high-quality, real world environment data in the form of Geospatial Information System (GIS) files . In the past, GJS environments were only possible through extensive software development efforts focused on specific model applications.

This thesis explores the value and issues of using GIS data to provide an ABM environment. It examines the ability of ABM development environments (DE) to support GIS environment data. The selected ABM DE is then used to model population behavior in an environment defined by authoritative …

The Development Of Genetic Algorithm For The Prediction Of Ship Motion From Wave Radar Data, Sumanth Tirumala Vangipuram

Electrical & Computer Engineering Theses & Dissertations

Genetic Algorithms represent a model of natural process based on the Darwinian principle of evolution. Genetic algorithms are used to solve optimization problems by generating a set of possible solutions and determining which of these solutions most closely match the desired result. The Genetic Algorithm (GA) initially generates a random set of possible solutions, or populations, determines which members of the population are most desirable, and calculates better solutions by implementing genetic operations such as reproduction, cloning, and mutation. Problems where the evaluation of a solution is computationally simple enable the GA to search a vast search space. One of …

Engineering Management Framework In Support Of Modeling & Simulation Application For Domain Specific Procurement, Thomas Guy Litwin

Engineering Management & Systems Engineering Theses & Dissertations

A strategic process is desirable for project-based organizations in order for them to be efficient and effective when developing Modeling & Simulation (M&S) systems. This thesis proposes an overarching process that combines traditional M&S and Engineering Management methodologies in a new framework to support M&S organizations during the procurement process.

This thesis proposes both a Strategic Project Management Process (SPMP) and a systems engineering process for M&S federation development projects. The systems engineering process utilizes the artifacts of Model Driven Architecture (MDA) to support building M&S federations driven by operational requirements. Detailed research of this systems engineering process revealed a …

Using Timed-Release Cryptography To Mitigate Preservation Risk Of Embargo Periods, Rabia Haq

Computer Science Theses & Dissertations

This research defines Time-Locked Embargo, a framework designed to mitigate the Preservation Risk Interval: the preservation risk associated with embargoed scholarly material. Due to temporary access restrictions, embargoed data cannot be distributed freely and thus preserved via data refreshing during the embargo time interval. A solution to mitigate the risk of data loss has been developed by suggesting a data dissemination framework that allows data refreshing of encrypted instances of embargoed content in an open, unrestricted scholarly community. This framework has been developed by exploiting implementations of existing technologies to"time-lock" data using Timed-Release Cryptology (TRC) so that it can be …

Optimal Energy-Delay Routing Protocol With Trust Levels For Wireless Ad Hoc Networks, Eyad Taqieddin, Ann K. Miller, Jagannathan Sarangapani

Electrical and Computer Engineering Faculty Research & Creative Works

This paper presents the Trust Level Routing (TLR) pro- tocol, an extension of the optimized energy-delay rout- ing (OEDR) protocol, focusing on the integrity, reliability and survivability of the wireless network. TLR is similar to OEDR in that they both are link state routing proto- cols that run in a proactive mode and adopt the concept of multi-point relay (MPR) nodes. However, TLR aims at incorporating trust levels into routing by frequently changing the MPR nodes as well as authenticating the source node and contents of control packets. TLR calcu- lates the link costs based on a composite metric (delay …

Generating Robust Schedules Subject To Resource And Duration Uncertainties, Na Fu, Hoong Chuin Lau, Fei Xiao

Research Collection School Of Computing and Information Systems

We consider the Resource-Constrained Project Scheduling Problem with minimal and maximal time lags under resource and duration uncertainties. To manage resource uncertainties, we build upon the work of Lambrechts et al 2007 and develop a method to analyze the effect of resource breakdowns on activity durations. We then extend the robust local search framework of Lau et al 2007 with additional considerations on the impact of unexpected resource breakdowns to the project makespan, so that partial order schedules (POS) can absorb both resource and duration uncertainties. Experiments show that our proposed model is capable of addressing the uncertainty of resources, …

A Heuristic Method For Job-Shop Scheduling With An Infinite Wait Buffer: From One-Machine To Multi-Machine Problems, Z. J. Zhao, J. Kim, M. Luo, Hoong Chuin Lau, S. S. Ge

Research Collection School Of Computing and Information Systems

Through empirical comparison of classical job shop problems (JSP) with multi-machine consideration, we find that the objective to minimize the sum of weighted tardiness has a better wait property compared with the objective to minimize the makespan. Further, we test the proposed Iterative Minimization Micro-model (IMM) heuristic method with the mixed integer programming (MIP) solution by CPLEX. For multi-machine problems, the IMM heuristic method is faster and achieves a better solution. Finally, for a large problem instance with 409 jobs and 30 types of machines, IMM-heuristic method is compared with ProModel and we find that the heuristic method is slightly …