Computer Sciences Commons^™

Ceg 499-01: Www Autonomous Robotics, John C. Gallagher, Richard Drushel

Computer Science & Engineering Syllabi

WWW Autonomous Robotics is a computer engineering practicum offered entirely via the Internet. The course adopts a low threshold, no ceiling philosophy. This means that the course is designed to be inclusive of students with limited formal training while still providing significant challenges for those with greater preparation and/or motivation. Students will be required to create control programs for a mobile autonomous robot. In each course unit, the problems posed will become increasingly more challenging. Coaching, advise, and instruction are done online via chat interfaces. Student code is tested first in a simulator that we provide and then on a …

Ceg 429/629-01: Internet Security, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to security issues arising primarily from computer networks. Topics include node and service authentication, address spoofing, hijacking, SYN floods, smurfing, sniffing, routing tricks, and privacy of data en route. Buffer overruns and other exploitation of software development errors. Hardening of operating systems. Intrusion detection. Firewalls. Ethics.

Ceg 255-01: Introduction To The Design Of Information Technology Systems, Eric Maston

Computer Science & Engineering Syllabi

Information systems consist of modern elements such as database systems, networks, multi-platform distributed computing, web infrastructure and multimedia computing. In this course we will address these areas individually and also where they intersect to gain a basic understanding of how information technology can be used to solve real problems.

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

Computer Science & Engineering Syllabi

This course is the first in the three course sequence "Introduction to Computer Science" offered by the Computer Science department at WSU. This course presents a general introduction to C++ programming language. It introduces the fundamental capabilities of C++ language as a problem solving tool. Topics include data representation, debugging and program verification.

Ceg 720-01: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer, pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing. 3 hours lecture and 2 hours lab.

Ceg 360/560-01: 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.

Hierarchical Kohonenen Net For Anomaly Detection In Network Security, Suseela T. Sarasamma, Qiuming Zhu, Julie Huff

Computer Science Faculty Publications

A novel multilevel hierarchicalKohonen Net (K-Map) for an intrusion detection system is presented. Each level of the hierarchical map is modeled as a simple winner-take-all K-Map. One significant advantage of this multilevel hierarchical K-Map is its computational efficiency. Unlike other statistical anomaly detection methods such as nearest neighbor approach, K-means clustering or probabilistic analysis that employ distance computation in the feature space to identify the outliers, our approach does not involve costly point-to-point computation in organizing the data into clusters. Another advantage is the reduced network size. We use the classification capability of the K-Map on selected dimensions of data …

Information Technology (It) Appropriateness: The Contingency Theory Of “Fit” And It Implementation In Small And Medium Enterprises, Deepak Khazanchi

Information Systems and Quantitative Analysis Faculty Publications

There is little doubt that advanced information and communication technologies (IT) arc changing the way businesses operate and conduct commerce. As the advent of a more secure Internet and new transmission standards makes it easier and cheaper for businesses to conduct inter-organizational commerce, it is incumbent upon SME managers to assess whether implementing new technologies such as Electronic Data Interchange (EDI) over the Internet, XML or web-based e-commerce is the "right thing to do" for their organizations. The key question implicit in this decision is addressed in this paper: "Under what conditions should businesses consider themselves likely candidates for (new) …

Measuring Wireless Network Usage With The Experience Sampling Method, Tristan Henderson, Denise Anthony, David Kotz

Dartmouth Scholarship

Measuring wireless local area networks has proven useful for characterizing, modeling and provisioning these networks. These measurements are typically taken passively from a vantage point on the network itself. Client devices, or users, are never actively queried. These measurements can indicate \em what is happening on the network, but it can be difficult to infer \em why a particular behavior is occurring. In this paper we use the Experience Sampling Method (ESM) to study wireless network users. We monitored 29 users remotely for one week, and signaled them to fill out a questionnaire whenever interesting wireless behavior was observed. We …

Image Compression By Vector Quantization Of Dct Coefficients Using A Self-Organizing Neural Network, Kirankumar Boyapati

Electrical & Computer Engineering Theses & Dissertations

Image compression is used to remove different types of redundancies and irrelevant information in an image so that the space required for storing the image is minimized. Conventional transform based techniques remove the redundancies between adjacent pixels and irrelevant information in the image but fail to remove the redundancies between different parts of the image. There are techniques like vector quantization, which take care of the redundant information in different parts of the image, but fail to remove the irrelevant information in the image. In this thesis a new technique for lossy digital image compression is proposed which is a …

Stagger: Periodicity Mining Of Data Streams Using Expanding Sliding Windows, Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

To Trie Or Not To Trie? Realizing Space-Partitioning Trees Inside Postgresql: Challenges, Experiences And Performance, Mohamed Y. Eltabakh, Ramy Eltarras, Walid G. Aref

Department of Computer Science Technical Reports

No abstract provided.

Translation-Based Steganography, Christian Grothoff, Krista Grothoff, Ludmila Alkhutova, Ryan Stutsman, Mikhail J. Atallah

Department of Computer Science Technical Reports

No abstract provided.

Exploiting Predicate-Window Semantics Over Data Streams, Thanaa M. Ghanem, Walid G. Aref, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

No abstract provided.

Walverine: A Walrasian Trading Agent, Shih-Fen Cheng, Evan Leung, Kevin M. Lochner, Kevin O'Malley, Daniel M. Reeves, Julian L. Schvartzman, Michael P. Wellman

Research Collection School Of Computing and Information Systems

TAC-02 was the third in a series of Trading Agent Competition events fostering research in automating trading strategies by showcasing alternate approaches in an open-invitation market game. TAC presents a challenging travel-shopping scenario where agents must satisfy client preferences for complementary and substitutable goods by interacting through a variety of market types. Michigan's entry, Walverine, bases its decisions on a competitive (Walrasian) analysis of the TAC travel economy. Using this Walrasian model, we construct a decision-theoretic formulation of the optimal bidding problem, which Walverine solves in each round of bidding for each good. Walverine's optimal bidding approach, as well as …

Survivable Lightpath Provisioning In Wdm Mesh Networks Under Shared Path Protection And Signal Quality Constraints, Xi Yang, Lu Shen, Byrav Ramamurthy

School of Computing: Faculty Publications

This paper addresses the problem of survivable lightpath provisioning in wavelength-division-multiplexing (WDM) mesh networks, taking into consideration optical-layer protection and some realistic optical signal quality constraints. The investigated networks use sparsely placed optical–electrical–optical (O/E/O) modules for regeneration and wavelength conversion. Given a fixed network topology with a number of sparsely placed O/E/O modules and a set of connection requests, a pair of link-disjoint lightpaths is established for each connection. Due to physical impairments and wavelength continuity, both the working and protection lightpaths need to be regenerated at some intermediate nodes to overcome signal quality degradation and wavelength contention. In the …

Prioritized Multiplicative Schwarz Procedures For Solving Linear Systems, Nathaniel Powell, Kevin Seppi, Quinn O. Snell, David Wingate

Faculty Publications

We describe a new algorithm designed to quickly and robustly solve general linear problems of the form Ax = b. We describe both serial and parallel versions of the algorithm, which can be considered a prioritized version of an Alternating Multiplicative Schwarz procedure. We also adopt a general view of alternating Multiplicative Schwarz procedures which motivates their use on arbitrary problems (even which may not have arisen from problems that are naturally decomposable) by demonstrating that, even in a serial context, algorithms should use many, many partitions to accelerate convergence; having such an over-partitioned system also allows easy parallelization of …

Proactive Caching For Spatial Queries In Mobile Environments, Haibo Hu, Jianliang Xu, Wing Sing Wong, Baihua Zheng, Dik Lun Lee, Wang-Chien Lee

Research Collection School Of Computing and Information Systems

Semantic caching enables mobile clients to answer spatial queries locally by storing the query descriptions together with the results. However, it supports only a limited number of query types, and sharing results among these types is difficult. To address these issues, we propose a proactive caching model which caches the result objects as well as the index that supports these objects as the results. The cached index enables the objects to be reused for all common types of queries. We also propose an adaptive scheme to cache such an index, which further optimizes the query response time for the best …

Ais Sighci Position Paper, Dennis Galletta, Ping Zhang, Fiona Fui-Hoon Nah

Research Collection School Of Computing and Information Systems

The upcoming ACM SIGCHI Development Consortium is aimed at meeting the needs of multidisciplinary professionals that must choose among a variety of professional associations and their events. The position of AIS' (Association for Information Systems) SIGHCI is that the main problem lies in the deep chasms that separate the literatures of the related disciplines, and the solution is to provide an umbrella organization that enables a more organized federation of disciplines, groups, and associations. Problems identified include differences in terminology, competition for scarce resources, differences in how publications in various outlets are valued, and confusion about where should be the …

Providing Efficient Certification Services Against Active Attacks In Ad Hoc Networks, Bo Zhu, Guilin Wang, Zhiguo Wan, Mohan S. Kankanhalli, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

Most of previous research work in key management can only resist passive attacks, such as dropping the certificate request, and are vulnerable under active attacks, such as returning a fake reply to the node requesting the certification service. In this paper, we propose two algorithms to address both security and efficiency issues of certification services in ad hoc networks. Both of the algorithms can resist active attacks. In addition, simulation results show that, compared to the previous works, our second algorithm is not only much faster in a friendly environment, but it also works well in a hostile environment in …

Keyword Spotting Using Normalization Of Posterior Probability Confidence Measures, Rachna Vijay Vargiya

Theses and Dissertations

Keyword spotting techniques deal with recognition of predefined vocabulary keywords from a voice stream. This research uses HMM based keyword spotting algorithms for this purpose. The three most important components of a keyword detection system are confidence measure, pruning technique and evaluation of results. We suggest that best match for a keyword would be an alignment in which all constituent states have high emission probabilities. Therefore score of even the worst subsequence must also be better than a threshold and a path can be represented by the score of its worst subsequence match. This confidence measure is called Real Fitting. …

Integrating User Feedback Log Into Relevance Feedback By Coupled Svm For Content-Based Image Retrieval, Steven C. H. Hoi, Michael R. Lyu, Rong Jin

Research Collection School Of Computing and Information Systems

Relevance feedback has been shown as an important tool to boost the retrieval performance in content-based image retrieval. In the past decade, various algorithms have been proposed to formulate relevance feedback in contentbased image retrieval. Traditional relevance feedback techniques mainly carry out the learning tasks by focusing lowlevel visual features of image content with little consideration on log information of user feedback. However, from a long-term learning perspective, the user feedback log is one of the most important resources to bridge the semantic gap problem in image retrieval. In this paper we propose a novel technique to integrate the log …

Predictive Neural Networks For Gene Expression Data Analysis, Ah-Hwee Tan, Hong Pan

Research Collection School Of Computing and Information Systems

Gene expression data generated by DNA microarray experiments have provided a vast resource for medical diagnosis and disease understanding. Most prior work in analyzing gene expression data, however, focuses on predictive performance but not so much on deriving human understandable knowledge. This paper presents a systematic approach for learning and extracting rule-based knowledge from gene expression data. A class of predictive self-organizing networks known as Adaptive Resonance Associative Map (ARAM) is used for modelling gene expression data, whose learned knowledge can be transformed into a set of symbolic IF-THEN rules for interpretation. For dimensionality reduction, we illustrate how the system …

Privacy And Ownership Preserving Of Outsourced Medical Data, Elisa Bertino, Beng Chin Ooi, Yanjiang Yang, Robert H. Deng

Research Collection School Of Computing and Information Systems

The demand for the secondary use of medical data is increasing steadily to allow for the provision of better quality health care. Two important issues pertaining to this sharing of data have to be addressed: one is the privacy protection for individuals referred to in the data; the other is copyright protection over the data. In this paper, we present a unified framework that seamlessly combines techniques of binning and digital watermarking to attain the dual goals of privacy and copyright protection. Our binning method is built upon an earlier approach of generalization and suppression by allowing a broader concept …

Mining Social Network From Spatio-Temporal Events, Hady Wirawan Lauw, Ee Peng Lim, Teck Tim Tan, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

Knowing patterns of relationship in a social network is very useful for law enforcement agencies to investigate collaborations among criminals, for businesses to exploit relationships to sell products, or for individuals who wish to network with others. After all, it is not just what you know, but also whom you know, that matters. However, finding out who is related to whom on a large scale is a complex problem. Asking every single individual would be impractical, given the huge number of individuals and the changing dynamics of relationships. Recent advancement in technology has allowed more data about activities of individuals …

Applying A Simulation-Based Real-Time Decision Making Method To Mass Casualty Scenarios In Hospital Emergency Departments, Fatemah Al-Douli

Electrical & Computer Engineering Theses & Dissertations

The high possibility of having a mass casualty incident compels hospitals to plan ahead in order to sufficiently provide the healthcare needed to as many casualty victims as possible. The Emergency Rooms (ER) are usually hospitals' main entrance for many casualties. Therefore, the ER in the Children's Hospital of the King's Daughters (CHKD) was selected as the system to be examined. The ER in CHKD, the only specialized pediatric ER in the region, already struggles to handle very high patient arrival rates. Consequently, it is expected that treating a large number of patients surviving within a very short period of …

Lightweight Federation Of Non-Cooperating Digital Libraries, Rong Shi

Computer Science Theses & Dissertations

This dissertation studies the challenges and issues faced in federating heterogeneous digital libraries (DLs). The objective of this research is to demonstrate the feasibility of interoperability among non-cooperating DLs by presenting a lightweight, data driven approach, or Data Centered Interoperability (DCI). We build a Lightweight Federated Digital Library (LFDL) system to provide federated search service for existing digital libraries with no prior coordination.

We describe the motivation, architecture, design and implementation of the LFDL. We develop, deploy, and evaluate key services of the federation. The major difference to existing DL interoperability approaches is one where we do not insist on …

Clustering And Hybrid Routing In Mobile Ad Hoc Networks, Lan Wang

Computer Science Theses & Dissertations

This dissertation focuses on clustering and hybrid routing in Mobile Ad Hoc Networks (MANET). Specifically, we study two different network-layer virtual infrastructures proposed for MANET: the explicit cluster infrastructure and the implicit zone infrastructure. In the first part of the dissertation, we propose a novel clustering scheme based on a number of properties of diameter-2 graphs to provide a general-purpose virtual infrastructure for MANET. Compared to virtual infrastructures with central nodes, our virtual infrastructure is more symmetric and stable, but still light-weight. In our clustering scheme, cluster initialization naturally blends into cluster maintenance, showing the unity between these two operations. …

Development Of Integrated Process Simulation System Model For Spent Fuel Treatment Facility (Sftf) Design: Quarterly Progress Report January 1-March 31, 2005, Yitung Chen, Sean Hsieh

Separations Campaign (TRP)

The Advanced Fuel Cycle Initiative (AFCI) and Transmutation Research Program-University Participation Program (TRP-UPP) supported by Department of Energy of the United States have been developing many important technologies for the transmutation of nuclear waste to address long-term disposal issues. While successfully embedding AMUSE module into a dedicated System Engineering Model (TRPSEMPro), developed by the Nevada Center for Advanced Computational Methods (NCACM) at the University of Nevada-Las Vegas collaborating with Argonne National Laboratory (ANL), ANL is interested in further simulating the Light Water Reactor (LWR) Spent Fuel Treatment Facility (SFTF) combining commercial process simulation and analysis packages and core calculation of …

Using Binary Space Subdivision To Optimize Primary Ray Processing In Ray-Tracing Algorithms, Mark Portolese '05

Honors Projects

Ray-tracing algorithms have the potential to create extremely realistic three-dimensional computer graphics. The basic idea is to trace light rays from the user through the computer screen into the hypothetical three-dimensional world. This is done to determine what objects should be displayed on the screen. Furthermore, these rays are traced back to the light sources themselves to determine shading and other photorealistic effects. However, without optimization these algorithms are slow and impractical. This paper explores the use of the classic binary space subdivision algorithm in order to speed up the process. Binary space subdivision is the use of binary trees …