Digital Commons Network^™

Visualization Of Scalar Topology For Structural Enhancement, Chandrajit L. Bajaj, Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.

A Survey Of Mobile Transaction Models, Abdelsalam Helal, Santosh Balakrishnan, Margaret Dunham, Ramez Elmasri

Department of Computer Science Technical Reports

No abstract provided.

Average Profile Of Generalized Digital Search Trees And The Generalized Lempel-Ziv Algorithm, Guy Louchard, Wojciech Szpankowski, Jing Tang

Department of Computer Science Technical Reports

No abstract provided.

Scalable Scientific Software Libraries And Problem Solving Environments, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

On Neurobiological, Neuro-Fuzzy And Statistical Pattern Recognition Techniques, Anupam Joshi, Narendran Ramakrishnan, Elias N. Houstis, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Analysis Of A Splitting Process Arising In Probabilistic Counting And Other Related Algorithms, Peter Kirschenofer, Helmut Prodinger, Wojciech Szpankowski

Department of Computer Science Technical Reports

No abstract provided.

A Graph-Constructive Approach To Solving Systems Of Geomeric Constraints, Ioannis Fudos, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

A User Interface For The Visualization And Manipulation Of Arrays, Jennifer Leopold, A. Ambler

Computer Science Faculty Research & Creative Works

The success of spreadsheets has shown that a visual representation of a 2D array greatly facilitates solving certain problems. However, spreadsheets are not general-purpose programming environments and are not suited to many problems that might naturally be solved using multi-dimensional arrays. Furthermore, spreadsheets employ a textual notation for cell references in formulas. This notation, which adds to the programmer''s burden by distinguishing between relative and absolute addressing, can be difficult to understand and is error-prone even for the most experienced users. In this paper, we present a user interface for multi-dimensional arrays within Formulate, a form-based visual programming language. This …

A Systematic Tradeoff Methodology For Acquiring And Validating Imprecise Requirements, J. Yen, Xiaoqing Frank Liu, W. A. Tiao

Computer Science Faculty Research & Creative Works

Requirement analysis is one of the most important phases in a software development process. Existing requirement methodologies are limited in specifying requirements that are usually vague and imprecise, and in supporting tradeoff analysis between the conflicting requirements. In this paper, the elasticity of imprecise requirements is captured using fuzzy logic to facilitate tradeoffs between conflicting requirements. Based on the marginal rate of substitution in decision science, we have developed a systematic approach to elicit the structures and the parameters of imprecise requirements, to validate the scheme for aggregating requirements, and to assess relative priorities of conflicting requirements.

Parallel Newton-Krylov-Schwarz Solvers For The Full Potential Flow Equation, Jie Zhang

Computer Science Theses & Dissertations

Newton-Krylov-Schwarz methods are increasingly applied in Computational Fluid Dynamics (CFD). We develop a parallel analysis code based on this method for the full potential flow model. The full potential model consists of a single nonlinear second-order partial differential equation of mixed type (elliptic/hyperbolic), which we solve as a steady boundary-value problem.

We use a nine-point finite-difference stencil to discretize the equation. A Newtonlike linearization and correction method is used to solve the resulting set of nonlinear algebraic equations. To solve the inner linear equations, we employ a Krylov space method. Preconditioners are used to improve the convergence rate. In order …

Customer Feedback Information System For Quality Improvement, Ke Wang

Masters Theses

This research addressed the basic needs for an effective customer feedback information system and the database technology to develop the system. It discussed the system concept and configuration of a typical customer feedback information system, database management technology, programming flow charts, program functions and capabilities. A proposed customer feedback information system consists of customer data inputs, database management system and outputs to various departments in an organization. With a user-friendly interface, database management system serves as an information management tool. It can process the feedback from customers and use the information in decision making. Thus, customer feedback can be promptly …

Researching The Growing Technology Of Virtual Reality, David Weinandt

Honors Theses, 1963-2015

Virtual reality is a fast growing technology within the computer science field. The current technologies using virtual reality are invading our everyday lives such as the medical applications of ultrasound and catscans. This technology is changing how we view data, as well as how common user applications are being constructed. The primary focus of the thesis is on the computer code necessary to compute the tracking of users. How the environment is generated, how users and objects are viewed by the computer, and how tracking codestructured on a basic level are some of the questions I cover in my thesis. …

An Examination Of Virtual Reality Modeling Language And Its Implications For The Future Of The World Wide Web, Mitch L. Hamelau

Honors Theses, 1963-2015

This project examines the current and future capabilities of Virtual Reality Modeling Language (VRML). VRML is first looked at in terms of its own current capabilities and limitations and then in terms of the impact that it will have on the World Wide Web. Some examples of future changes to the World Wide Web that may come about due to VRML are examined. Then a specific application is used as an example of the advantages VRML provides for developers who use the World Wide Web.

Volunteer Water Quality Monitoring Programs: An Assessment Of Public Participation As A Means Of Fostering Environmental Stewardship, Christopher Damon

Marine Affairs Theses and Major Papers

Volunteer water quality monitoring organizations from across the country were surveyed (n=516) to determine the relationship between public involvement and the generation of stewardship within the community. Program coordinators were asked first to rate the level of stewardship values within the community, and then respond to questions covering four broad areas of public involvement: pre-existing conditions, public education, volunteer behavior, and communal involvement. For each question, organizations were aggregated by response, and a frequency analysis was performed to discover the most common responses in each of the four public involvement categories. the mean of perceived stewardship values was graphed as …

Application Of Autoregressive Moving Average Linear Prediction Filters To The Characterization Of Solar Wind-Magnetosphere Coupling, Carter N. Borst

Theses and Dissertations

Linear prediction filtering techniques have been used in studying the coupling processes between the solar wind and magnetosphere. The magnetosphere is a complex, dynamic system with at least two independent coupling methods for energy input, driven and unloading. Linear models were built and tested on the Bargatze data set, consisting of over 70 days of geomagnetic indices and solar wind data ordered in 34 intervals of increasing geomagnetic activity. Linear filtering techniques employing single-and multiple-input, autoregressive models predicted values of the magnetic index AL from solar wind data. The impulse response curves of the AL-coupling function groups showed amplitude peaks …

Adaptive Information Filtering As A Means To Overcome Information Overload, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

Information Filtering is concerned with filtering data streams in such a way as to leave only pertinent data (information) to be perused. When the data streams are produced in a changing environment (as most if not all are) the filtering has to adapt too in order to remain effective. Adaptive Information Filtering (AIF) is concerned with filtering in changing environments. The changes may occur both on the transmission side (the nature of the streams can change), and on the reception side (the interest of a user can change). The thesis research described in this paper combines trigram analysis, clustering, and …

Design Information Recovery From Legacy System Cobol Source Code: Research On A Reverse Engineering Methodology, Robert Lee Miller

CCAC Theses and Dissertations

Much of the software in the world today was developed from the mid-1960s to the mid- 1970s.This legacy software deteriorates as it is modified to satisfy new organizational requirements. Currently, legacy system maintenance requires more time than new system development. Eventually, legacy systems must be replaced. Identifying their functionality is a critical part of the replacement effort. Recovering functions from source code is difficult because the domain knowledge used to develop the system is not routinely retained. The source code is frequently the only reliable source of functional information.

This dissertation describes functional process information recovery from COBOL source code …

An Assessment Of Asynchronous Transfer Mode (Atm) Training For Educators, Dan A. Niswander

CCAC Theses and Dissertations

The purpose of this dissertation was to develop and evaluate a hypertext-based training tutorial/guide on asynchronous transfer mode (ATM) technology for use by school district educators and technology planners. A review of literature indicated training needs on new broadband technologies were not being adequately met from the point of view of an educational environment. An interactive hypertext solution was proposed, designed, and developed based on the needs of adult learners. An analysis of these needs indicated adults prefer flexibility in navigating between training topics as well as in the pace of material presentation, that is, whether to proceed at a …

Improved Data Migration And Processing For Projecting The Financial Aid Budget, Jeffery L. Olson '96

Honors Projects

Last fall, I again resumed work on the budget projection model that encompassed five spreadsheets. Four of these sheets generated a set of statistical averages for each class. Each one consisted of 101 columns containing data for the four-to five-hundred students(rows) in each class. In addition, a fifth sheet used these averages to generate a highly accurate prediction for expenditures in the upcoming year. However, there were two main areas of improvement that became readily apparent: importing data and the sheets themselves.

Optimization Of The Discriminatory Power Of A Trigram Based Document Clustering Algorithm Using Evolutionary Computation, Daniel R. Tauritz

Computer Science Faculty Research & Creative Works

No abstract provided.

A Family Of Parallel Runge-Kutta Pairs, P. Bogacki

Mathematics & Statistics Faculty Publications

Increasing availability of parallel computers has recently spurred a substantial amount of research concerned with designing explicit Runge-Kutta methods to be implemented on such computers. Here, we discuss a family of methods that require fewer processors than methods presently available do, still achieving a similar speed-up. In particular, (5,6) and (6,7) pairs are derived, that require a minimum number of function evaluations on two and three processors, respectively.

Simulator For The Performance Analysis Of Cpm Schemes In An Indoor Wireless Environment, Ronald Chua

Theses : Honours

A software simulator for characterising Continuous Phase Modulation (CPM) schemes in an indoor multipath environment has been developed using SIMULINK and MATLAB. The simulator is capable of simulating a wide range of CPM schemes to determine bandwidth efficiency and robustness to additive white Gaussian noise (AWGN) and Rician fading. Initial trials of the simulator indicate that the simulator is functioning correctly. Eventually, the simulator will be used to determine the most suitable modulation scheme for the development of an actual indoor wireless system.

Time- And Cost-Optimal Parallel Algorithms For The Dominance And Visibility Graphs, D. Bhagavathi, H. Gurla, S. Olariu, J. L. Schwing, J. Zhang

Computer Science Faculty Publications

The compaction step of integrated circuit design motivates associating several kinds of graphs with a collection of non-overlapping rectangles in the plane. These graphs are intended to capture various visibility relations amongst the rectangles in the collection. The contribution of this paper is to propose time- and cost-optimal algorithms to construct two such graphs, namely, the dominance graph (DG, for short) and the visibility graph (VG, for short). Specifically, we show that with a collection of n non-overlapping rectangles as input, both these structures can be constructed in θ (log n) time using n processors in the CREW model.

The Design And Implementation Of A Toolkit For The Creation Of Virtual Environments, Jesse Kinross-Smith

Theses : Honours

Virtual Reality is a field that is steadily increasing in popularity and interest. New developments in both hardware and software have empowered developers with new devices allowing faster and better quality interaction with virtual environments. However, the emphasis of research in virtual environments has been more concerned with development of new display and input devices, as opposed to the investigation of different methods of interaction that a three-dimensional environment offers. This project designs and implements a three-dimensional, interactive, virtual environment development system upon an existing three-dimensional rendering engine. The aim of the project is to allow users to generate virtual …

Embedded Particle Computation In Evolved Cellular Automata, Wim Hordijk, James P. Crutchfield, Melanie Mitchell

Computer Science Faculty Publications and Presentations

In our work we are studying how genetic algorithms (GAs) can evolve cellular automata (CAs) to perform computations that require global coordination. The evolving cellular automata" framework is an idealized means for studying how evolution (natural or computational) can create systems that perform emergent computation, in which the actions of simple components with local information and communication give rise to coordinated global information processing [3].

In previous work [4, 5], we analyzed the process by which a genetic algorithm designed CAs to perform particular tasks. In this paper we focus on how these CAs implement the emergent computational strategies for …

Automatic Pcb Inspection Algorithms: A Survey, Madhav Moganti, Fikret Ercal, Cihan H. Dagli, Shou Tsunekawa

Computer Science Faculty Research & Creative Works

The importance of the inspection process has been magnified by the requirements of the modern manufacturing environment. In electronics mass-production manufacturing facilities, an attempt is often made to achieve 100% quality assurance of all parts, subassemblies, and finished goods. A variety of approaches for automated visual inspection of printed circuits have been reported over the past two decades. In this survey, algorithms and techniques for the automated inspection of printed circuit boards are examined. A classification tree for these algorithms is presented and the algorithms are grouped according to this classification. This survey concentrates mainly on image analysis and fault …

Three-Dimensional Segmentation And Visualization Of Magnetic Resonance Imaging Data, William L. Bell Jr.

UNF Graduate Theses and Dissertations

In this thesis, I shall study and compare various methods for manipulating two- and three-dimensional image data produced with a nuclear magnetic resonance scanner. In particular, I will examine ways of focusing upon specific structures internal to the object under study (segmentation); and will explore means of rendering realistic images of these structures on a computer screen using depth-cueing, shading, and ray-casting techniques.
The 3DHEAD volumetric dataset used for this project was created with the Siemens Magnetom and was provided courtesy of Siemens Medical Systems, Inc., Iselin, NJ. This dataset consists of 109 slices of a human head, with each …

Randomized Approximation Of The Constraint Satisfaction Problem, Hoong Chuin Lau, Osamu Watanabe

Research Collection School Of Computing and Information Systems

We consider the Weighted Constraint Satisfaction Problem (W-CSP) which is a fundamental problem in Artificial Intelligence and a generalization of important combinatorial problems such as MAX CUT and MAX SAT. In this paper, we prove non-approximability properties of W-CSP and give improved approximations of W-CSP via randomized rounding of linear programming and semidefinite programming relaxations. Our algorithms are simple to implement and experiments show that they are run-time efficient.

A Policy-Independent Secure X Server, Kirk Joseph Bittler

Dissertations and Theses

This thesis demonstrates that a secure X system can be designed and implemented to be independent of a particular security policy. The advantages and costs of a separation of security policy and enforcement are examined by developing a large scale application, the DX windowing system, on a DTOS platform. DTOS is a high assurance operating system that isolates policy decisions in a Security Server. A security conscious process, such as DX, eliminates policy considerations from the code. The process instead consults the Security Server and enforces the decisions that server derives from the policy. The DX architecture is described and …

Putting Type Annotations To Work, Martin Odersky, Konstantin Laufer

Computer Science: Faculty Publications and Other Works

We study an extension of the Hindley/Milner system with explicit type scheme annotations and type declarations. The system can express polymorphic function arguments, user-defined data types with abstract components, and structure types with polymorphic fields. More generally, all programs of the polymorphic lambda calculus can be encoded by a translation between typing derivations. We show that type reconstruction in this system can be reduced to the decidable problem of first-order unification under a mixed prefix.