Computer Sciences Commons^™

The Proteomics Approach To Evolutionary Computation: An Analysis Of Pr, Ivan Garibay

Electronic Theses and Dissertations

As the complexity of our society and computational resources increases, so does the complexity of the problems that we approach using evolutionary search techniques. There are recent approaches to deal with the problem of scaling evolutionary methods to cope with highly complex difficult problems. Many of these approaches are biologically inspired and share an underlying principle: a problem representation based on basic representational building blocks that interact and self-organize into complex functions or designs. The observation from the central dogma of molecular biology that proteins are the basic building blocks of life and the recent advances in proteomics on analysis …

High Performance Data Mining Techniques For Intrusion Detection, Muazzam Ahmed Siddiqui

Electronic Theses and Dissertations

The rapid growth of computers transformed the way in which information and data was stored. With this new paradigm of data access, comes the threat of this information being exposed to unauthorized and unintended users. Many systems have been developed which scrutinize the data for a deviation from the normal behavior of a user or system, or search for a known signature within the data. These systems are termed as Intrusion Detection Systems (IDS). These systems employ different techniques varying from statistical methods to machine learning algorithms. Intrusion detection systems use audit data generated by operating systems, application softwares or …

Dynamic Shared State Maintenance In Distributed Virtual Environments, Felix George Hamza-Lup

Electronic Theses and Dissertations

Advances in computer networks and rendering systems facilitate the creation of distributed collaborative environments in which the distribution of information at remote locations allows efficient communication. Particularly challenging are distributed interactive Virtual Environments (VE) that allow knowledge sharing through 3D information. In a distributed interactive VE the dynamic shared state represents the changing information that multiple machines must maintain about the shared virtual components. One of the challenges in such environments is maintaining a consistent view of the dynamic shared state in the presence of inevitable network latency and jitter. A consistent view of the shared scene will significantly increase …

Depth From Defocused Motion, Zarina Myles

Electronic Theses and Dissertations

Motion in depth and/or zooming causes defocus blur. This work presents a solution to the problem of using defocus blur and optical flow information to compute depth at points that defocus when they move. We first formulate a novel algorithm which recovers defocus blur and affine parameters simultaneously. Next we formulate a novel relationship (the blur-depth relationship) between defocus blur, relative object depth and three parameters based on camera motion and intrinsic camera parameters. We can handle the situation where a single image has points which have defocused, got sharper or are focally unperturbed. Moreover, our formulation is valid regardless …

Directory-Based Cache Coherence In Smtp Machines Without Memory Overhead Using Sparse Directories, Anton Kiriwas

HIM 1990-2015

As computing power has increased over the past few decades, science and engineering have found more and more uses for this new found computing power. With the advent of multiprocessor machines, we are achieving MIPS and FLOPS ratings previously unthought-of. Distributed shared-memory machines (DSM) are quickly becoming a powerful tool for computing, and the ability to build them from commodity off-the-shelf parts would be a great benefit to computing in general. In the paper entitled, "SMTp: An Architecture for Next-generation Scalable Multi-threading", Heinrich, et al. presents an architecture for a scalable DSM built from slightly modified machines capable of simultaneous …

Pattern-Based Model Transformation: A Metamodel-Based Approach To Model Evolution, Sheena Judson Miller

LSU Doctoral Dissertations

Software systems continue to grow in complexity at a rapid pace, creating systems that are complex to build and evolve. The problems that accompany changes in requirements, system upgrades, and error correction produce a desire for software evolution methods that increase the efficiency and effectiveness of adapting complex software to changes. As software systems evolve, design models must be modified to accommodate the required changes. Techniques that control the changes to models in a systematic manner are a key to model evolution. A process that improves the ability to effectively modify a design, thereby enhancing design qualities, supports the need …

Ethical Reflections On Cyberstalking, Frances Grodzinsky, Herman T. Tavani

School of Computer Science & Engineering Faculty Publications

This essay examines some ethical aspects of stalking behavior in cyberspace. We have argued elsewhere that recent online stalking incidents raise a wide range of ethical concerns, including issues affecting gender (Grodzinsky and Tavani, 2001), personal privacy (Tavani and Grodzinsky, 2002), and physical vs. virtual harm (Grodzinsky and Tavani, 2002). The primary axis of discussion in this essay has to do with implications that cyberstalking has for our notion of moral responsibility, both at the collective (or group) and individual levels. For example, do collectivities and organizations such as Internet service providers (ISPs) have any moral obligations to cyberstalking victims, …

Building Successful On-Line Learning Communities Across International Boundaries: A Case Study, Pat Jefferies, Frances Grodzinsky, Joe Griffin

School of Computer Science & Engineering Faculty Publications

The development of on-line learning communities across international boundaries is now a viable proposition using available asynchronous technologies. As has been reported in previous papers (Grodzinsky, Griffin & Jefferies, 2002; Griffin, Grodzinsky & Jefferies, 2002) such use has proved to be extremely valuable for supporting the teaching of computing and ethics. For example, not only does asynchronous computer conferencing offer new opportunities for students to gain valuable first-hand experience in using such technology to communicate with peers in other countries but it also facilitates them gaining a more direct appreciation of the cultural, legal and ethical differences that abound. However, …

Using Design Of Experiments, Sensitivity Analysis, And Hybrid Simulation To Evaluate Changes To A Software Development Process: A Case Study, Wayne Wakeland, Robert H. Martin, David Raffo

Complex Systems Faculty Publications and Presentations

Hybrid simulation models combine the high-level project issues of System Dynamics models along with the detailed process representation of discrete event simulation models. Hybrid models not only capture the best of both of these simulation paradigms, but they also are able to address new issues that are important in managing complex real-world development projects that neither the System Dynamics nor Discrete Event simulation paradigms are able to address alone.

In order to reap the full benefits from a simulation model, a structured approach for analyzing model results is necessary. The recommended approach is a combination of the Design of Experiments …

Directed Extended Dependency Analysis For Data Mining, Thaddeus T. Shannon, Martin Zwick

Complex Systems Faculty Publications and Presentations

Extended dependency analysis (EDA) is a heuristic search technique for finding significant relationships between nominal variables in large data sets. The directed version of EDA searches for maximally predictive sets of independent variables with respect to a target dependent variable. The original implementation of EDA was an extension of reconstructability analysis. Our new implementation adds a variety of statistical significance tests at each decision point that allow the user to tailor the algorithm to a particular objective. It also utilizes data structures appropriate for the sparse data sets customary in contemporary data mining problems. Two examples that illustrate different approaches …

A Comparison Of Modified Reconstructability Analysis And Ashenhurst‐Curtis Decomposition Of Boolean Functions, Anas Al-Rabadi, Marek Perkowski, Martin Zwick

Complex Systems Faculty Publications and Presentations

Modified reconstructability analysis (MRA), a novel decomposition technique within the framework of set‐theoretic (crisp possibilistic) reconstructability analysis, is applied to three‐variable NPN‐classified Boolean functions. MRA is superior to conventional reconstructability analysis, i.e. it decomposes more NPN functions. MRA is compared to Ashenhurst‐Curtis (AC) decomposition using two different complexity measures: log‐functionality, a measure suitable for machine learning, and the count of the total number of two‐input gates, a measure suitable for circuit design. MRA is superior to AC using the first of these measures, and is comparable to, but different from AC, using the second.

State-Based Reconstructability Analysis, Martin Zwick, Michael S. Johnson

Complex Systems Faculty Publications and Presentations

Reconstructability analysis (RA) is a method for detecting and analyzing the structure of multivariate categorical data. While Jones and his colleagues extended the original variable‐based formulation of RA to encompass models defined in terms of system states, their focus was the analysis and approximation of real‐valued functions. In this paper, we separate two ideas that Jones had merged together: the “g to k” transformation and state‐based modeling. We relate the idea of state‐based modeling to established variable‐based RA concepts and methods, including structure lattices, search strategies, metrics of model quality, and the statistical evaluation of model fit for analyses based …

Software Architecture: Styles And Representational Schemes, Somo Subro Banerjee

LSU Master's Theses

Software architecture is being widely used today to describe a very high-level design methodology of large software systems. Software architecture represents the overall structure of a system in an abstract, structured manner. A good architectural representation scheme holds the key to the effectiveness of a software architecture description and usage. In this work we look at architectural styles and architectural representation schemes. We propound the idea that the layered architectural model is a suitable candidate for a generalized architectural style and that it can cater to many different problem domains, other than the message-passing systems it has traditionally been used …

Parallel Molecular Dynamics Simulations Of Antimicrobial Peptides, Svetlana V. Oard

LSU Master's Theses

Molecular dynamics (MD) simulations of the wheat antimicrobial peptide â-purothionin were carried out in explicit water (~14,000 atoms) using an all-atom model. The structural properties of the peptide as a function of MD simulation, temperature, and presence of the mono- and divalent metal ions were investigated. The accuracy and scalability tests of the code Peach 3.8 for our system were performed on the Intel Xeon-based Linux cluster SuperHelix at Louisiana State University (LSU). The code showed the reliable accuracy and the parallel efficiency of 0.61 for ~14,000 particles on 16 processors. The microcanonical (MC) MD simulation of â-purothionin in water …

A 2-Chain Can Interlock With A K-Chain, Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong

Computer Science: Faculty Publications

One of the open problems posed in [3] is: what is the minimal number k such that an open, flexible k-chain can interlock with a flexible 2-chain? In this paper, we establish the assumption behind this problem, that there is indeed some k that achieves interlocking. We prove that a flexible 2-chain can interlock with a flexible, open 16-chain.

Better Foreground Segmentation Through Graph Cuts, Nicholas Howe, Alexandra Deschamps

Computer Science: Faculty Publications

For many tracking and surveillance applications, background subtraction provides an effective means of segmenting objects moving in front of a static background. Researchers have traditionally used combinations of morphological operations to remove the noise inherent in the background-subtracted result. Such techniques can effectively isolate foreground objects, but tend to lose fidelity around the borders of the segmentation, especially for noisy input. This paper explores the use of a minimum graph cut algorithm to segment the foreground, resulting in qualitatively and quantitiatively cleaner segmentations. Experiments on both artificial and real data show that the graphbased method reduces the error around segmented …

Comprehensive Evaluation Of Animated Instructional Software For Mechanics Of Materials, Timothy A. Philpot, Richard H. Hall

Civil, Architectural and Environmental Engineering Faculty Research & Creative Works

During the past three years, the Basic Engineering Department at the University of Missouri--Rolla has been developing a second-generation suite of instructional software called MecMovies for the mechanics of materials course. In the Fall 2003 semester, MecMovies was integrated into assignments throughout the entire semester for one of the six UMR mechanics of materials sections. This paper presents a comparison of student performance in the experimental section with student performance in five control sections along with discussion of student qualitative ratings and comments.

Imagining The Performance Zone: Overcoming Ambiguity In Consumer Based Electronic Performance Support Systems, Jason Simons

Theses : Honours

The locus of performance support implementation was once the domain of large corporations where its principles offered an attractive alternative to traditional methods of training within the scope of contemporary business practices. Due to economies of scale the large corporations were able to build effective performance support through the precise identification of the PERFORMANCE ZONE. This zone is created through the defining of the three attributes of performance, 1) the nature of the worker, 2) the nature of the task, and 3) the type and amount of support needed. lncreasingly the principles of performance-centred design have been adopted within diverse …

[Introduction To] Data Structures With Java, John R. Hubbard, Anita Huray

Bookshelf

For a freshman/sophomore-level course in Data Structures in Computer Science. This text teaches the use of direct source code implementations and the use of the Java libraries; it helps students prepare for later work on larger Java software solutions by adhering to software engineering principles and techniques such as the UML and the Java Collections Framework (JCF). Using the spiral approach to cover such topics as linked structures, recursion, and algorithm analysis, this text also provides revealing illustrations, summaries, review questions, and specialized reference sections.

[Introduction To] Schaum's Outline Of Programming With Java, John R. Hubbard

Bookshelf

Tough Test Questions? Missed Lectures? Not Enough Time?

Fortunately for you, there's Schaum's Outlines. More than 40 million students have trusted Schaum's to help them succeed in the classroom and on exams. Schaum's is the key to faster learning and higher grades in every subject. Each Outline presents all the essential course information in an easy-to-follow, topic-by-topic format. You also get hundreds of examples, solved problems, and practice exercises to test your skills.

This Schaum's Outline gives you

• Practice problems with full explanations that reinforce knowledge
• Coverage of the most up-to-date developments in your course field
• In-depth review of practices …

An Overview Of Reconstructability Analysis, Martin Zwick

Complex Systems Faculty Publications and Presentations

This paper is an overview of reconstructability analysis (RA), a discrete multivariate modeling methodology developed in the systems literature; an earlier version of this tutorial is Zwick (2001). RA was derived from Ashby (1964), and was developed by Broekstra, Cavallo, Cellier Conant, Jones, Klir, Krippendorff, and others (Klir, 1986, 1996). RA resembles and partially overlaps log‐line (LL) statistical methods used in the social sciences (Bishop et al., 1978; Knoke and Burke, 1980). RA also resembles and overlaps methods used in logic design and machine learning (LDL) in electrical and computer engineering (e.g. Perkowski et al., 1997). Applications of RA, like …

Reversible Modified Reconstructability Analysis Of Boolean Circuits And Its Quantum Computation, Anas Al-Rabadi, Martin Zwick

Complex Systems Faculty Publications and Presentations

Modified Reconstructability Analysis (MRA) can be realized reversibly by utilizing Boolean reversible (3,3) logic gates that are universal in two arguments. The quantum computation of the reversible MRA circuits is also introduced. The reversible MRA transformations are given a quantum form by using the normal matrix representation of such gates. The MRA-based quantum decomposition may play an important role in the synthesis of logic structures using future technologies that consume less power and occupy less space.

Modified Reconstructability Analysis For Many-Valued Functions And Relations, Anas Al-Rabadi, Martin Zwick

Complex Systems Faculty Publications and Presentations

A novel many-valued decomposition within the framework of lossless Reconstructability Analysis is presented. In previous work, Modified Recontructability Analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional Reconstructability Analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many-valued logic functions, and logic structures that correspond to such decomposition are developed. It is shown that many-valued MRA can decompose many-valued functions when CRA fails to do …

Reconstructability Analysis Detection Of Optimal Gene Order In Genetic Algorithms, Martin Zwick, Stephen Shervais

Complex Systems Faculty Publications and Presentations

The building block hypothesis implies that genetic algorithm efficiency will be improved if sets of genes that improve fitness through epistatic interaction are near to one another on the chromosome. We demonstrate this effect with a simple problem, and show that information-theoretic reconstructability analysis can be used to decide on optimal gene ordering.

Reconstructability Analysis: Theory And Applications [Editorial Introduction], Martin Zwick, Guangfu Shu, Yi Lin

Complex Systems Faculty Publications and Presentations

Reconstructability analysis (RA) dates back to the pioneering work of Ashby in the mid-1960s. In the 1970s and 1980s, RA was the subject of very active research in the systems community. It receded for a time as a focus of activity, but the special issue of the International Journal of General Systems in 1996 on the General Systems Problem Solver and the special IJGS issue in 2000 on Reconstructability Analysis in China marked the renewal of interest in this area. The current volume is part of this resurgence of activity. It collects together papers from the group at Portland State …

A Software Architecture For Reconstructability Analysis, Kenneth Willett, Martin Zwick

Complex Systems Faculty Publications and Presentations

Software packages for reconstructability analysis (RA), as well as for related log linear modeling, generally provide a fixed set of functions. Such packages are suitable for end‐users applying RA in various domains, but do not provide a platform for research into the RA methods themselves. A new software system, Occam3, is being developed which is intended to address three goals which often conflict with one another to provide: a general and flexible infrastructure for experimentation with RA methods and algorithms; an easily‐configured system allowing methods to be combined in novel ways, without requiring deep software expertise; and a system which …

Bidirectional Lao* Algorithm (A Faster Approach To Solve Goal-Directed Mdps), Venkata Deepti Kiran Bhuma

University of Kentucky Master's Theses

Uncertainty is a feature of many AI applications. While there are polynomial-time algorithms for planning in stochastic systems, planning is still slow, in part because most algorithms plan for all eventualities. Algorithms such as LAO* are able to find good or optimal policies more quickly when the starting state of the system is known.

In this thesis we present an extension to LAO*, called BLAO*. BLAO* is an extension of the LAO* algorithm to a bidirectional search. We show that BLAO* finds optimal or ^_E-optimal solutions for goal-directed MDPs without necessarily evaluating the entire state space. BLAO* …

Computational Geometry Column 45, Joseph O'Rourke

Computer Science: Faculty Publications

The algorithm of Edelsbrunner for surface reconstruction by "wrapping" a set of points in R³ is described.

An Analysis Of Case-Base Editing In A Spam Filtering Systems, Sarah Jane Delany, Padraig Cunningham

Conference papers

Because of the changing nature of spam, a spam filtering system that uses machine learning will need to be dynamic. This suggests that a case-based (memory-based) approach may work well. Case-Based Reasoning (CBR) is a lazy approach to machine learning where induction is delayed to run time. This means that the case base can be updated continuously and new training data is immediately available to the induction process. In this paper we present a detailed description of such a system called ECUE and evaluate design decisions concerning the case representation. We compare its performance with an alternative system that uses …

Virtual Personal Assistants In A Pervasive Computing World, John F. Bradley, Brian R. Duffy, Gregory O'Hare, Alan Martin, Bianca Schoen-Phelan

Conference papers

Computing paradigms are constantly evolving-from mainframe to desktop, and on to ubiquitous computing. With a wide variety of devices, each with varying constraints, it would be quite difficult to develop services that would operate in a uniform manner across all platforms. With this in mind we offer an agent based solution. Agent attributes of autonomy, adaptability and mobility make them highly suitable for use in pervasive computing environments. Agent Chameleons illustrates a framework for Virtual Personal Assistants (VPA) for the information age. This paper briefly outlines some of the technologies and concepts that underpin the functionality of a VPA.