Computer Sciences Commons^™

Graduate School Of Computer And Information Sciences 2003, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Building Problem Solving Environments With Application Web Service Toolkits, Choonhan Youn, Marlon Pierce, Geoffrey C. Fox

Electrical Engineering and Computer Science - All Scholarship

Application portals, or Problem Solving Environments (PSEs), provide user environments that simplify access and integrate various distributed computational services for scientists working on particular classes of problems. Specific application portals are typically built on common sets of core services, so reusability of these services is a key problem in PSE development. In this paper we address the reusability problem by presenting a set of core services built using the Web services model and application metadata services that can be used to build science application front ends out of these core services.

Sensor Communication Networks Using Swarming Intelligence, Rajani Muraleedharan, Lisa Ann Osadciw

Electrical Engineering and Computer Science - All Scholarship

Energy consumption is currently a key issue in research for future sensor networks. This paper presents a novel approach to sensor network routing based on energy consumption. The unique routing algorithm uses swarm intelligence, which is computationally efficient.

An Integrated Videoconferencing System For Heterogeneous Multimedia Collaboration, Ahmet Uyar, Wenjun Wu, Hasan Bulut, Geoffrey C. Fox

Electrical Engineering and Computer Science - All Scholarship

We have developed an integrated conferencing system, Global Multimedia Collaboration System, which enables heterogeneous multimedia clients to join the same real-time sessions. Our system provides support for a variety of protocols and applications, including H.323 clients, SIP clients and Access Grid rooms. In this paper, we would like to show the features and design principles of our conferencing server which facilitates audio and video communications among participating clients in a real-time conference.

Computer Assisted Screening Of Digital Mammogram Images, John Terry Sample

LSU Doctoral Dissertations

The use of computer systems to assist clinicians in digital mammography image screening has advantages over traditional methods. Computer algorithms can enhance the appearance of the images and highlight suspicious areas. Screening provides a more thorough examination of the images. Any computer system that does screening of digital mammograms contains components to address multiple tasks such as: image segmentation, mass lesion detection and classification, and microcalcification detection and classification. This dissertation provides both effective and efficient improvements to existing algorithms, which segment mammogram images and locate mass lesions. In addition, we provide a new algorithm to evaluate and report the …

Formal Concept Analysis And Resolution On Algebraic Domains - Preliminary Report, Matthias Wendt, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondence between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes.

Learning Continuous Latent Variable Models With Bregman Divergences, Shaojun Wang, Dale Schuurmans

Kno.e.sis Publications

We present a class of unsupervised statistical learning algorithms that are formulated in terms of minimizing Bregman divergences— a family of generalized entropy measures defined by convex functions. We obtain novel training algorithms that extract hidden latent structure by minimizing a Bregman divergence on training data, subject to a set of non-linear constraints which consider hidden variables. An alternating minimization procedure with nested iterative scaling is proposed to find feasible solutions for the resulting constrained optimization problem. The convergence of this algorithm along with its information geometric properties are characterized.

Protocols For Disease Classification From Mass Spectrometry Data, Michael Wagner, Dayanand Naik, Alex Pothen

Mathematics & Statistics Faculty Publications

We report our results in classifying protein matrix-assisted laser desorption/ionizationtime of flight mass spectra obtained from serum samples into diseased and healthy groups. We discuss in detail five of the steps in preprocessing the mass spectral data for biomarker discovery, as well as our criterion for choosing a small set of peaks for classifying the samples. Cross-validation studies with four selected proteins yielded misclassification rates in the 10-15% range for all the classification methods. Three of these proteins or protein fragments are down-regulated and one up-regulated in lung cancer, the disease under consideration in this data set. When cross-validation studies …

A Limited-Global Fault Information Model For Fault Tolerant Routing In Dual-Cube, Zhen Jiang, Jie Wu

Computer Science Faculty Publications

No abstract provided.

Goal-Converging Behavior Networks And Self-Solving Planning Domains, Bernhard Nebel, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Agents operating in the real world have to deal with a constantly changing and only partially predictable environment and are nevertheless expected to choose reasonable actions quickly. One way to address this problem is to use behavior networks as proposed by Maes, which support real-time decision making. Robotic soccer appears to be one domain where behavior networks have been proven to be particularly successful. In this paper, we analyze the reason for the success by identifying conditions that make behavior networks goal converging, i.e., allow them to reach the goals regardless of which particular action selection scheme is used. In …

Computing Answer Sets Of A Logic Program Via-Enumeration Of Sat Certificates, Yuliya Lierler, Marco Maratea

Computer Science Faculty Proceedings & Presentations

Answer set programming is a new programming paradigm proposed based on the answer set semantics of Prolog. It is well known that an answer set for a logic program is also a model of the program's completion. The converse is true when the logic program is "tight". Lin and Zhao showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called "loop formulas". Nevertheless, their solver ASSAT 1 has some disadvantages: it can work only with basic rules, and it can compute only one …

Introducing The Global Diffusion Of The Internet Series, Peter Wolcott, Seymour E. Goodman

Information Systems and Quantitative Analysis Faculty Publications

Many genes can play a role in multiple biological processes or molecular functions. Identifying multifunctional genes at the genome-wide level and studying their properties can shed light upon the complexity of molecular events that underpin cellular functioning, thereby leading to a better understanding of the functional landscape of the cell. However, to date, genome-wide analysis of multifunctional genes (and the proteins they encode) has been limited. Here we introduce a computational approach that uses known functional annotations to extract genes playing a role in at least two distinct biological processes. We leverage functional genomics data sets for three organisms—H. sapiens, …

Census 2000 Demographic Profile Report Of The Older Adult Population In Cuyahoga, Lake, Geauga, Lorain And Medina Counties, Mark Salling, Sharon Bliss, Mcnamara, Brian

All Maxine Goodman Levin School of Urban Affairs Publications

No abstract provided.

Control Of Transport Dynamics In Overlay Networks, Qishi Wu

LSU Doctoral Dissertations

Transport control is an important factor in the performance of Internet protocols, particularly in the next generation network applications involving computational steering, interactive visualization, instrument control, and transfer of large data sets. The widely deployed Transport Control Protocol is inadequate for these tasks due to its performance drawbacks. The purpose of this dissertation is to conduct a rigorous analytical study on the design and performance of transport protocols, and systematically develop a new class of protocols to overcome the limitations of current methods. Various sources of randomness exist in network performance measurements due to the stochastic nature of network traffic. …

Ethical Issues In Open Source Software, Frances Grodzinsky, Keith W. Miller, Marty J. Wolf

School of Computer Science & Engineering Faculty Publications

In this essay we argue that the current social and ethical structure in the Open Source Software (OSS) Community stem from its roots in academia. The individual developers experience a level of autonomy similar to that of a faculty member. Furthermore, we assert that the Open Source Software Community's social structure demands benevolent leadership. We argue that it is difficult to pass off low quality open source software as high quality software and that the Open Source development model offers strong accountability. Finally, we argue that Open Source Software introduces ethical challenges for universities and the software development community.

Computer Assisted Eye Fungal Infection Diagnosis, Madhusudhanan Balasubramanian

LSU Master's Theses

In this thesis, an attempt has been made to assist the diagnosis of Fungal Keratitis, a fungal infection that occurs in the corneal layers of the eye, by identifying the region of infection in the corneal images using fractal-based features. Three features related to the fractal dimension of the surface of the image, when represented in a 3D using the pixel intensity measure, are used to identify these regions in the image. To reduce the computation complexity, Fisher linear discriminant (FLD) is used to reduce the 3D raw feature to 1D feature, while preserving feature values. Using the adaptive mixtures …

Partitioning Regular Polygons Into Circular Pieces I: Convex Partitions, Mirela Damian, Joseph O'Rourke

Computer Science: Faculty Publications

We explore an instance of the question of partitioning a polygon into pieces, each of which is as “circular” as possible, in the sense of having an aspect ratio close to 1. The aspect ratio of a polygon is the ratio of the diameters of the smallest circumscribing circle to the largest inscribed disk. The problem is rich even for partitioning regular polygons into convex pieces, the focus of this paper. We show that the optimal (most circular) partition for an equilateral triangle has an infinite number of pieces, with the lower bound approachable to any accuracy desired by a …

Ordering Genetic Algorithm Genomes With Reconstructability Analysis, Stephen Shervais, Martin Zwick

Complex Systems Faculty Publications and Presentations

The building block hypothesis implies that genetic algorithm effectiveness is influenced by the relative location of epistatic genes on the chromosome. We find that this influence exists, but depends on the generation in which it is measured. Early in the search process it may be more effective to have epistatic genes widely separated. Late in the search process, effectiveness is improved when they are close together. The early search effect is weak but still statistically significant; the late search effect is much stronger and plainly visible. We demonstrate both effects with a set of simple problems, and show that infonnation-theoretic …

Interpolation Techniques For Overset Grids, Paul S. Sherman, Nathan B. Edgar

Journal of the Arkansas Academy of Science

The use of finite difference schemes in computational aeroacoustics requires the use of structured grids incomputational space. Complex geometries in the physical space can be modeled using multiple overlapping grids that are transformed into computational space. In this work, finite difference schemes are used that necessitate the addition of psuedo- or ghost-points in the overlap region of the grids for closure of the difference stencil. The functional values at these ghost points must be approximated from the values at the original grid points. This paper investigates interpolation techniques for these overset grids. An n th order interpolation scheme using Lagrange …

Ray Tracing And Global Illumination, Jason Rupard

All Volumes (2001-2008)

In order to represent real-world images with a computer, a program has to relate three-dimensional images on a two-dimensional monitor screen. Several ways of doing this exist with varying degrees of realism. One of the most successful methods can be grouped in a "screen-to-world method" of viewing, which is also known as "ray-tracing."
This computer graphics technology simulates light rays within a 3D environment. Since light rays have predictable physical properties, the raytracing algorithm can attempt to calculate the exact coloring of each ray/object intersection at any given pixel. Advanced levels of ray tracing allow light rays to bounce from …

Hybrid Data Mining Technique For Application In Geo-Chemical Data Analysis, Shipra Dutta

Masters Theses

"Data mining is a very active research area, which has gained a lot of attention over the past few years for its applications in various fields ranging from stock forecasting to detecting damages in the structures like aircrafts. The use of data mining for applications in science and business has evoked a lot of interest in the researchers to explore the area further. In this research, a novel hybrid clustering architecture will be presented as a possible solution to classify the geo-chemical data obtained by conducting various direct and indirect tests on different sites. The fact that no single learning …

Computational Geometry Column 44, Joseph O'Rourke

Computer Science: Faculty Publications

The open problem of whether or not every pair of equal-area polygons has a hinged dissection is discussed.

On The Development Of The Intersection Of A Plane With A Polytope, Joseph O'Rourke

Computer Science: Faculty Publications

Define a “slice” curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops on a plane without self-intersection. The key tool used is a generalization of Cauchy's arm lemma to permit nonconvex “openings” of a planar convex chain.

Crafting A Research Paper, Ronan Fitzpatrick, Kevin O'Donnell

Conference papers

Writing research papers presents numerous different challenges, which vary from how to layout the various pages and format the text to what to include in the different sections that make up the paper. In order to clarify these issues this paper sets out guidelines and best practice approaches and demonstrates their use in the style of this paper.

Agent Chameleons: Agent Minds And Bodies, Brian Duffy, Gregory O'Hare, Alan Martin, John Bradley, Bianca Schoen-Phelan

Conference papers

Agent design has to date concerned itself with the issues pertaining to a single body embedded in a single environment, whether virtual or real. This paper discusses the notion of an agent capable of migrating between information spaces (physical worlds, virtual reality, and digital information spaces). An architecture is presented that facilitates agent migration and mutation within such environments. This will in turn support agent

evolution the ultimate in agent adaptivity

A Framework To Utilise Urban Bus Data For Advanced Data Analysis, Markus Hofmann, Brendan Tierney, Margaret M. O'Mahony

Conference papers

Most urban bus operators collect detailed data on their respective transportation networks using electronic fare collection systems. However, contrary to the opinion of other service industries that this data is a valuable resource, many bus operators have tended not to fully utilise these resources. International experience suggests using innovative technologies and methodologies such as data warehousing, Online Analytical Processing (OLAP), and data mining, to derive the maximum benefit from this data. Still bus operators tend not to keep the full range of data in a form, which is easy to access or utilise, and therefore, are not able to apply …

Qr Factorization With Morton-Ordered Quadtree Matrices For Memory Re-Use And Parallelism, Jeremy D. Frens, David S. Wise

University Faculty Publications and Creative Works

Quadtree matrices using Morton-order storage provide natural blocking on every level of a memory hierarchy. Writing the natural recursive algorithms to take advantage of this blocking results in code that honors the memory hierarchy without the need for transforming the code. Furthermore, the divide-and-conquer algorithm breaks problems down into independent computations. These independent computations can be dispatched in parallel for straight-forward parallel processing. Proof-of-concept is given by an algorithm for QR factorization based on Givens rotations for quadtree matrices in Morton-order storage. The algorithms deliver positive results, competing with and even beating the LAPACK equivalent.

A Linux-Based Graphical User Interface For The Creation And Reading Of The Frame Format: Version 2.4, Muhammed Aoun

Theses : Honours

To gain further knowledge of how the universe began, a new international co-operated project wishes not only to "see" stars exploding, but also to "hear" the explosion. It is theorised that the ability to "listen" to an explosion is possible by detecting gravitational waves. Gravitational waves are omitted when a star explodes, travelling through the cosmos at an exceptional speed. It is estimated that a gravity wave takes only 40 milliseconds to pass through the earth. Thus the aim of this international collaboration is to detect a gravitational wave. To accurately detect such waves, there needs to be several global …

The Zigzag Path Of A Pseudo-Triangulation, Oswin Aichholzer, Günter Rote, Bettina Speckmann, Ileana Streinu

Computer Science: Faculty Publications

We define the zigzag path of a pseudo-triangulation, a concept generalizing the path of a triangulation of a point set. The pseudotriangulation zigzag path allows us to use divide-and-conquer type of approaches for suitable (i.e., decomposable) problems on pseudo-triangulations. For this we provide an algorithm that enumerates all pseudotriangulation zigzag paths (of all pseudo-triangulations of a given point set with respect to a given line) in O(n2) time per path and O(n2) space, where n is the number of points. We illustrate applications of our scheme which include a novel algorithm to count the number of pseudotriangulations of a point …

Interactive Multimedia In The Teaching Of The Irish Language In Primary School : Design, Implementation And Development., Máire Lynch

Theses

This thesis focuses on interactive multimedia use specifically in the area of vocabulary acquisition in a second language. It addresses the language learning requirements of third class (nine year olds) language learners, in Primary school. The study is based on existing second language acquisition research, computer - assisted language learning and the design and development of educational multimedia and it delivers an interactive application based on them. The study is firmly rooted in the foundations of the Revised Curriculum for Irish Primary Schools most especially in the language teaching methods it recommends and its emphasis on the use of information …