Physical Sciences and Mathematics Commons^™

Collaborative Software Agents Support For The Texpros Document Management System, Jrtian Lin

Dissertations

This dissertation investigates the use of active rules that are embedded in markup documents. Active rules are used in a markup representation by integrating Collaborative Software Agents with TEXPROS (abbreviation for TEXt PROcessing System) [Liu and Ng 1996] to create a powerful distributed document management system. Such markup documents with embedded active rules are called Active Documents. For fast retrieval purposes, when we need to generate a customized Internet folder organization, we first define the Folder Organization Query Language (FO-QL) to solve data categorization problems. FO-QL defines the folder organization query process that automatically retrieves links of documents deposited into …

Hytexpros : A Hypermedia Information Retrieval System, Hong Shen

Dissertations

The Hypermedia information retrieval system makes use of the specific capabilities of hypermedia systems with information retrieval operations and provides new kind of information management tools. It combines both hypermedia and information retrieval to offer end-users the possibility of navigating, browsing and searching a large collection of documents to satisfy an information need. TEXPROS is an intelligent document processing and retrieval system that supports storing, extracting, classifying, categorizing, retrieval and browsing enterprise information. TEXPROS is a perfect application to apply hypermedia information retrieval techniques. In this dissertation, we extend TEXPROS to a hypermedia information retrieval system called HyTEXPROS with hypertext …

Integration Of Multi Lifecycle Assessment And Design For Environment Database Using Relational Moddel Concepts, Bhagyashree Suratran

Theses

Multi-lifecycle Assessment (MLCA) systematically considers and quantifies the consumption of resources and the environmental impact associated with a product or process. Design challenges posed by a multi-lifecycle strategy are significantly more complex than traditional product design. The designer must look forward in time to maximize the product's end-of-life yield of assemblies, parts and materials while looking backward to the world of existing products for feedstock sources for the current design. As MLCA and DEE share some common data items, such as, part geometry, material and manufacturing process, it is advantageous to integrate the database for MLCA and DEE. The integration …

Analysis Of Clustering Algorithms For Spike Sorting Of Multiunit Extracellular Recordings, Jayesh Rege

Theses

Various techniques have been considered in the past to identify distinct spike shapes from mulitunit extracellular recording. These techniques involve adaptive filtering techniques or template matching techniques or hierarchical clustering techniques. In this investigation, we have used Principal Component Analysis followed by various clustering techniques to identify distinct spike shapes. The amplitude filter is used to separate spikes from background neuronal activity. The correlation matrix of the spike data is used to compute principal component wave forms. Each spike is thus represented by the coefficients of principal components. Then, We have used agglomorative hierarchical clustering algorithm to perform the initial …

Automatic Categorization Of Abstracts Through Bayesian Networks, William Ramirez

Theses

This thesis presents a method for assigning abstracts of Artificial Intelligence papers to their area of the field. The technique is implemented by the use of a Bayesian network where relevant keywords extracted from the abstract being categorized, are entered as evidence and inferencing is made to determine potential subject areas. The structure of the Bayesian network represents the causal relationship between Artificial Intelligence keywords and subject areas. Keyword components of the network are selected from precategorized abstracts. The work reported here is part of a larger project to automatically assign papers to reviewers for Artificial Intelligence conferences. The process …

A Visualization System For Information Retrieval And Mining In High Dimensional Databases, Xinhuan Zheng

Theses

In this thesis, we present a search engine capable of giving good heuristic answers to the queries on a structural database. A structural database holds structural objects, e.g., protein secondary and tertiary structures, 3D molecules, phylogenetic trees, neuroanatomical networks, parse trees, CAD/CAM parts, and XML documents. Answering queries on such databases often requires solving variants of the graph isomorphism or subisomorphism problems. We also describe a graphic user interface which interacts with users to facilitate visualizing query results. We use 3D molecules (graphs) as illustrating examples, though our prototype is able to handle many other different types of structural data.

Pushpush Is Np-Hard In 2d, Erik D. Demaine, Martin L. Demaine, Joseph O'Rourke

Computer Science: Faculty Publications

We prove that a particular pushing-blocks puzzle is intractable in 2D, improving an earlier result that established intractability in 3D [OS99]. The puzzle, inspired by the game *PushPush*, consists of unit square blocks on an integer lattice. An agent may push blocks (but never pull them) in attempting to move between given start and goal positions. In the PushPush version, the agent can only push one block at a time, and moreover, each block, when pushed, slides the maximal extent of its free range. We prove this version is NP-hard in 2D by reduction from SAT.

Branch Transition Rate: A New Metric For Improved Branch Classification Analysis, Michael Haungs, Phil Sallee, Matthew Farrens

Computer Science and Software Engineering

Recent studies have shown significantly improved branch prediction through the use of branch classification. By separating static branches into groups, or classes, with similar dynamic behavior, predictors may be selected that are best suited for each class. Previous methods have classified branches according to taken rate (or bias). We propose a new metric for branch classification: branch transition rate, which is defined as the number of times a branch changes direction between taken and not taken during execution. We show that transition rate is a more appropriate indicator of branch behavior than taken rate for determining predictor performance. When both …

Higher Order Generalization And Its Application In Program Verification, Jianguo Lu, John Mylopoulos, Masateru Harao, Masami Hagiya

Computer Science Publications

Generalization is a fundamental operation of inductive inference. While first order syntactic generalization (anti–unification) is well understood, its various extensions are often needed in applications. This paper discusses syntactic higher order generalization in a higher order language λ2 [1]. Based on the application ordering, we prove that least general generalization exists for any two terms and is unique up to renaming. An algorithm to compute the least general generalization is also presented. To illustrate its usefulness, we propose a program verification system based on higher order generalization that can reuse the proofs of similar programs.

P-Buffer: Hidden-Line Rendering With A Dynamic P-Buffer, Xiaobu Yuan, Sun Hanqiu

Computer Science Publications

Despite the emergence of highly realistic computer-generated images, line-drawing images are still a common practice in showing the shapes and movements of three-dimensional objects. It is especially true when rendering time is critical in interactive applications such as the modeling and testing stage of computer aided design/manufacturing, computer animation, and virtual reality. Hence much effort has been devoted to provide sufficient information of the displayed objects with the least amount of time. While the techniques that determine visible surfaces in an image-space have the advantages on rendering speed and processable shapes, those that decide visible lines or line segments in …

Fages' Theorem And Answer Set Programming, Yuliya Lierler, Esta Erdem, Vladimir Lifschitz

Computer Science Faculty Proceedings & Presentations

We generalize a theorem by François Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negotiation as failure. The study of this relationship is important in connection with the emergence of answer set programming. Whenever the two semantics are equivalent, answer sets can be computed by a satisfiability solver, and the use of answer set solvers such as SMODELS and DLV is unnecessary. A logic programming representation of the blocks world due to Ilkka Niemelä is discussed as an example.

Neural Networks And Structured Knowledge: Rule Extraction And Applications, Franz J. Kurfess

Computer Science and Software Engineering

As the second part of a special issue on "Neural Networks and Structured Knowledge," the contributions collected here concentrate on the extraction of knowledge, particularly in the form of rules, from neural networks, and on applications relying on the representation and processing of structured knowledge by neural networks. The transformation of the low-level internal representation in a neural network into higher-level knowledge or information that can be interpreted more easily by humans and integrated with symbol-oriented mechanisms is the subject of the first group of papers. The second group of papers uses specific applications as starting point, and describes approaches …

Instructional Design Agents – An Integration Of Artificial Intelligence And Educational Technology, Erika Rogers, Carol Scheftic, Emilio Passi, Sharon Lanaghan

Computer Science and Software Engineering

The purpose of this paper is to introduce a project whose goal is to design and develop a productivity tool which helps academic instructors in their course preparation. This tool will be composed of a number of “instructional design agents”, which combine techniques in human-computer interaction, artificial intelligence and educational theory. The first of these agents is based on Bloom’s Taxonomy, and a brief overview of this work in progress is presented.

The Space Of Jumping Emerging Patterns And Its Incremental Maintenance, Jinyan Li, Kotagiri Ramamohanarao, Guozhu Dong

Kno.e.sis Publications

The concept of jumping emerging patterns (JEPs) has been proposed to describe those discriminating features which only occur in the positive training instances but do not occur in the negative class at all; JEPs have been used to construct classifiers which generally provide better accuracy than the state-of-the-art classifiers such as C4.5. The algorithms for maintaining the space of jumping emerging patterns (JEP space) are presented in this paper. We prove that JEP spaces satisfy the property of convexity. Therefore JEP spaces can be concisely represented by two bounds: consisting respectively of the most general elements and the most specific …

Virtual Topology Reconfiguration Of Wavelength-Routed Optical Wdm Networks, Byrav Ramamurthy, Ashok Ramakrishnan

CSE Conference and Workshop Papers

The bandwidth requirements of the Internet are increasing every day and there are newer and more bandwidth-thirsty applications emerging on the horizon. Wavelength division multiplexing (WDM) is the next step towards leveraging the capabilities of the optical fiber, especially for wide-area backbone networks. The ability to switch a signal at intermediate nodes in a WDM network based on their wavelengths is known as wavelength-routing. One of the greatest advantages of using wavelength-routing WDM is the ability to create a virtual topology different from the physical topology of the underlying network. This virtual topology can be reconfigured when necessary, to improve …

Prioritizing Test Cases For Regression Testing, Sebastian Elbaum, Alexey G. Malishevsky, Gregg Rothermel

CSE Technical Reports

Test case prioritization techniques schedule test cases in an order that increases their effectiveness in meeting some performance goal. One performance goal, rate of fault detection, is a measure of how quickly faults are detected within the testing process; an improved rate of fault detection can pro- vide faster feedback on the system under test, and let soft- ware engineers begin locating and correcting faults earlier than might otherwise be possible. In previous work, we re- ported the results of studies that showed that prioritization techniques can significantly improve rate of fault detection. Those studies, however, raised several additional questions: …

Disec: A Distributed Framework For Scalable Secure Many-To-Many Communication, Lakshminath R. Dondeti, Sarit Mukherjee, Ashok Samal

CSE Conference and Workshop Papers

Secure one-to-many multicasting has been a popular research area in the recent past. Secure many-to-many multicasting is becoming popular with applications such as private conferencing and distributed interactive simulation. Most of the existing secure multicasting protocols use a centralized group manager to enforce access control and for key distribution. In the presence of multiple senders it is desirable to delegate group management responsibility to all the senders. We propose a distributed group key management scheme to support secure many-to-many communication. We divide key distribution overhead evenly among the senders. Our protocol is scalable and places equal trust in all the …

Performance Measurement Of Dynamically Compiled Java Executions, Tia Newhall, B. P. Miller

Computer Science Faculty Works

No abstract provided.

Bottom-Up Design Of Artificial Neural Network For Single-Lead Electrocardiogram Beat And Rhythm Classification, Srikanth Thiagarajan

Doctoral Dissertations

Performance improvement in computerized Electrocardiogram (ECG) classification is vital to improve reliability in this life-saving technology. The non-linearly overlapping nature of the ECG classification task prevents the statistical and the syntactic procedures from reaching the maximum performance. A new approach, a neural network-based classification scheme, has been implemented in clinical ECG problems with much success. The focus, however, has been on narrow clinical problem domains and the implementations lacked engineering precision. An optimal utilization of frequency information was missing. This dissertation attempts to improve the accuracy of neural network-based single-lead (lead-II) ECG beat and rhythm classification. A bottom-up approach defined …

Design Early Considered Harmful: Graduated Exposure To Complexity And Structure Based On Levels Of Cognitive Development, Duane Buck, David J. Stucki

Mathematics Faculty Scholarship

We have recognized that the natural tendency to teach according to the structure of one’s own understanding runs contrary to established models of cognitive development. Bloom’s Taxonomy has provided a basis for establishing a more efficacious pedagogy. Emphasizing a hierarchical progression of skill sets and gradual learning through example, our approach advocates teaching software development from the inside/out rather than beginning with either console apps or monolithic designs.

Designing A Remote Navigation System, Jared P. Lazzaro

Senior Scholar Papers

This project involves the design and implementation of a global electronic tracking system intended for use by trans-oceanic vessels, using the technology of the U.S. Government's Global Positioning System (GPS) and a wireless connection to a networked computer.

Traditional navigation skills are being replaced with highly accurate electronics. GPS receivers, computers, and mobile communication are becoming common among both recreational and commercial boaters. With computers and advanced communication available throughout the maritime world, information can be shared instantaneously around the globe. This ability to monitor one's whereabouts from afar can provide an increased level of safety and efficiency.

Current navigation …

A Scene Similarity Metric For Matching Configurations Of Image Objects, James Carswell

Articles

This paper proposes a novel solution to querying image databases by matching raster features to imagery completely in the raster/spatial domain using the shape of single features together with their spatial relations as the matching primitives. The core feature-based matching module combines a revised least-squares matching algorithm, to accomplish the matching process on binary images, with a unique implementation of a feature library that organizes and links query objects with their images in the database, thus enabling fast and efficient real-time retrieval of relevant imagery. The purpose is to extend this previous work of ours, which matches on the shape …

Student Rights And Responsibilities, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Master Of Science Degree Programs, 2000-2001, Nova Southeastern University

College of Engineering and Computing Course Catalogs

No abstract provided.

Exploiting Don't Cares To Enhance Functional Tests, Mark W. Weiss, Sharad C. Seth, Shashank K. Mehta, Kent L. Einspahr

CSE Conference and Workshop Papers

In simulation based design verification, deterministic or pseudo-random tests are used to check functional correctness of a design. In this paper we present a technique generating tests by specifying the don’t care inputs in the functional specifications so as to improve their coverage of both design errors and manufacturing faults. The don’t cares are chosen to maximize sensitization of signals in the circuit. The tests generated in this way require only a fraction of pseudo-exhaustive test patterns to achieve a high multiplicity of fault coverage.

Lsmac And Lsnait: Two Approaches For Cluster-Based Scalable Web Servers, Xuehong Gana, Trevor Schroeder, Steve Goddard, Byrav Ramamurthy

CSE Conference and Workshop Papers

Server responsiveness and scalability are more important than ever in today’s client/server dominated network environments. Recently, researchers have begun to consider cluster-based computers using commodity hardware as an alternative to expensive specialized hardware for building scalable Web servers. In this paper, we present performance results comparing two cluster-based Web servers based on different server infrastructures: MAC-based dispatching (LSMAC) and IP-based dispatching (LSNAT). Both cluster-based server systems were implemented as application-space programs running on commodity hardware. We point out the advantages and disadvantages of both systems. We also identify when servers should be clustered and when clustering will not improve performance.

Reflexive Autopoietic Dissipative Special Systems Theory, Kent D. Palmer

Kent D. Palmer

A newly discovered approach to extending General Systems Theory as defined by George Klir through a set of Special Systems is described. General Systems Theory is distinguished from the theory of Meta-systems. Then, a hinge of three special systems is identified between systems and meta-systems. These special systems are defined by algebraic analogies. Anomalous physical phenomena are specified that exemplify the structures defined by the algebraic analogies. The extraordinary efficacious properties of these special systems are explained. These include ultra-efficiency and ultra-effectiveness. These three special systems are called dissipative, autopoietic, and reflexive. They are anomalous within general systems theory and …

Ann As A Tool For Medical Prognosis, Sameem Abdul Kareem

Sameem Abdul Kareem

The analysis of cancer survival is used to determine the efficiency of treatment programmes and protocols; it is also used to determine the type of treatment. At the individual level a prediction of cancer survival can help patients make informed decisions with regards to their quality of life and future finances. Currently available prediction methods apply to groups of people, and may not be adequate to predict treatment outcome for individual patients. This paper presents a conceptual model of a cancer knowledge base incorporating a computer-based predictor for survival. It proposes the use of an artificial neural network (ANN) as …

Unified Matrix Processor Design For Fct-Iv And Fst-Iv Hartley Based Transforms, Philadelphia University

Philadelphia University, Jordan

No abstract provided.

Image-Driven Simplification And Optimization Of Polygonal Models, Peter Lindstrom

Link Foundation Modeling, Simulation and Training Fellowship Reports

Model simplification is often used in computer graphics to reduce the complexity of large polygonal models. For many graphics applications, the goal of this process is to produce a coarser model that is visually similar to the original, allowing the complex original model to be replaced with little or no loss in perceived quality. Existing simplification techniques, however, rely on geometry-based heuristics as an indirect indicator of visual similarity. We propose a novel image-driven simplification method that uses rendered images of a model and an image metric as a means of measuring visual similarity. Using this approach, changes in appearance …