Digital Commons Network^™

Semantic And Schematic Similarities Between Database Objects: A Context-Based Approach, Vipul Kashyap, Amit P. Sheth

Kno.e.sis Publications

In a multidatabase system, schematic conflicts between two objects are usually of interest only when the objects have some semantic similarity. We use the concept of semantic proximity, which is essentially an abstraction/mapping between the domains of the two objects associated with the context of comparison. An explicit though partial context representation is proposed and the specificity relationship between contexts is defined. The contexts are organized as a meet semi-lattice and associated operations like the greatest lower bound are defined. The context of comparison and the type of abstractions used to relate the two objects form the basis of a …

Control Uniqueness In Reconstructability Analysis, Martin Zwick

Complex Systems Faculty Publications and Presentations

When the reconstructability analysis of a directed system yields a structure in which a generated variable appears in more than one subsystem, information from all of the subsystems can be used in modeling the relationship between generating and generated variables. The conceptualization and procedure proposed here is discussed in relation to Klir's concept of control uniqueness.

Analogy-Making: A Connectionist Exploration, Doug Blank

Computer Science Faculty Research and Scholarship

No abstract provided.

Information Systems In Non-Profit Organizations: Enhancing Performance Through Online Help, Robert H. Lane

CCAC Theses and Dissertations

The purpose of this dissertation is to focus attention on the problems which non-profit organizations face in dealing with employee dissatisfaction and turnover among clerical staff whose principal responsibility is data entry. To address the problem, a presentation on the background, a discussion of the managerial and information systems implications, and an end-user needs assessment culminated in the development of an online help system for an IDM AS/400-based membership management package.

The system enables the data entry staff to easily locate the answers to most of their commonly asked questions without leaving their workstation, thus reducing the need for as …

Efficient Algorithms For Array Redistribution, Rajeev Thakur, Alok Choudhary, J. Ramanujam

Electrical Engineering and Computer Science - All Scholarship

Dynamic redistribution of arrays is required very often in programs on distributed memory parallel computers. This paper presents efficient algorithms for redistribution between different cyclic(k) distributions, as defined in High Performance Fortran. We first propose special optimized algorithms for a cyclic(x) to cyclic(y) redistribution when x is a multiple of y, or y is a multiple of x. We then propose two algorithms, called the GCD method and the LCM method, for the general cyclic(x) to cyclic(y) redistribution when there is no particular relation between x and y. We have implemented these algorithms on the Intel Touchstone Delta, and find …

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

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.

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 …

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 …

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 …

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.

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 …

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.

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.

Data Compression Based On The Cubic B-Spline Wavelet With Uniform Two-Scale Relation, S. K. Yang, C. H. Cooke

Mathematics & Statistics Faculty Publications

The aim of this paper is to investigate the potential artificial compression which can be achieved using an interval multiresolution analysis based on a semiorthogonal cubic B-spline wavelet. The Chui-Quak [1] spline multiresolution analysis for the finite interval has been modified [2] so as to be characterized by natural spline projection and uniform two-scale relation. Strengths and weaknesses of the semiorthogonal wavelet as regards artificial compression and data smoothing by the method of thresholding wavelet coefficients are indicated.

Measurement Of The Λb Polarization In Z Decays, Buskulic, D.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

The Λb polarization in hadronic Z decays is measured in semileptonic decays from the average energies of the charged lepton and the neutrino. In a data sample of approximately 3 million hadronic Z decays collected by the ALEPH detector at LEP between 1991 and 1994, 462 ± 31 Λb candidates are selected using (Λπ+)-lepton correlations. From this event sample, the Λb polarization is measured to be PΛb = −0.23−0.20+0.24(stat.)−0.07+0.08(syst.).

Determination Of Sin2Θw Eff Using Jet Charge Measurements In Hadronic Z Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

The electroweak mixing angle is determined with high precision from measurements of the mean difference between forward and backward hemisphere charges in hadronic decays of the Z. A data sample of 2.5 million hadronic Z decays recorded over the period 1990 to 1994 in the ALEPH detector at LEP is used. The mean charge separation between event hemispheres containing the original quark and antiquark is measured forbb¯bb¯ andcc¯cc¯ events in subsamples selected by their long lifetimes or using fastD*’s. The corresponding average charge separation for light quarks is measured in an inclusive sample from the anticorrelation between charges of opposite …

Improved Measurement Of The B0 And B+ Meson Lifetimes, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

Updated measurements of the B0 and B+ meson lifetimes are presented. From a data sample of 1.72 million hadronic Z0 decays recorded during the period 1991 to 1993, a sample of approximately 1000 semileptonic B meson decays containing a D0, D+ or D*+ has been isolated. From the distribution of decay times in the different samples the lifetimes of the B0 and B+ mesons are determined to be 1.53±0.12±0.08 ps and 1.52±0.14±0.09 ps, respectively, where the first error is statistical and the second systematic. The ratio of the B+ to B0 lifetimes is measured to be 0.99±0.14+0.05−0.04, confirming expectations that …

Tau Leptonic Branching Ratios, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

A sample of 62249 τ-pair events is selected from data taken with the ALEPH detector in 1991, 1992 and 1993. The measurement of the branching fractions for τ decays into electrons and muons is presented with emphasis on the study of systematic effects from selection, particle identification and decay classification. The results obtained are: B e = 17.79±0.12(stat)±0.06(syst)(%) and Bμ = 17.31±0.11(stat)±0.05(syst)(%). Combined with the most recent ALEPH determination of the τ lifetime, these results provide a relative measurement of the leptonic couplings in the weak charged current for transverse W bosons: ${cal G}_{ώ}/{cal G}_{e}=1.0002pm 0.0051$ and ${cal G}_{∢u}/{cal G}_{u}=0.9943pm …

Tau Hadronic Branching Ratios, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

From 64492 selected τ-pair events, produced at the Z0 resonance, the measurement of the tau decays into hadrons from a global analysis using 1991, 1992 and 1993 ALEPH data is presented. Special emphasis is given to the reconstruction of photons and π0s, and the removal of fake photons. A detailed study of the systematics entering the π0 reconstruction is also given. A complete and consistent set of tau hadronic branching ratios is presented for 18 exclusive modes. Most measurements are more precise than the present world average. The new level of precision reached allows a stringent test τ-μ, universality in …

Combinatorial Approaches For Hard Problems In Manpower Scheduling, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Manpower scheduling is concerned with the construction of a workers' schedule which meets demands while satisfying given constraints. We consider a manpower scheduling Problem, called the Change Shift Assignment Problem(CSAP). In previous work, we proved that CSAP is NP-hard and presented greedy methods to solve some restricted versions. In this paper, we present combinatorial algorithms to solve more general and realistic versions of CSAP which are unlikely solvable by greedy methods. First, we model CSAP as a fixed-charge network and show that a feasible schedule can be obtained by finding disjoint paths in the network, which can be derived from …

On The Complexity Of Manpower Shift Scheduling, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the shift assignment problem in manpower scheduling, and show that a restricted version of it is NP-hard by a reduction from 3SAT. We then present polynomial algorithms to solve special cases of the problem and show how they can be deployed to solve more complex versions of the shift assignment problem. Our work formally defines the computational intractibility of manpower shift scheduling and thus justifies existing works in developing manpower scheduling systems using combinatorial and heuristic techniques.

Simulation Modeling Within Workflow Technology, John A. Miller, Amit P. Sheth, Krzysztof J. Kochut, Xuzhong Wang, Arun Murugan

Kno.e.sis Publications

This paper presents an approach for integrating simulation modeling and analysis capabilities within the workflow management system (WFMS) being developed in the Large Scale Distributed Information Systems (LSDIS) Lab at the University of Georgia. Simulation modeling can be used for studying the efficiency of workflow designs as well as studying the general performance and reliability of WFMSs. We also discuss the importance of using sophisticated monitoring and animation capabilities, and the use of workflow management technology to advance simulation technology itself. Finally, we demonstrate a sample simulation where tasks and task managers are simulated.

Simulations Between Programs As Cellular Automata, Howard A. Blair, Fred Dushin, Polar Humenn

Electrical Engineering and Computer Science - Technical Reports

We present cellular automata on appropriate digraphs and show that any covered normal logic program is a cellular automaton. Seeing programs as cellular automata shifts attention from classes of Herbrand models to orbits of Herbrand interpretations. Orbits capture both the declarative, model-theoretic meaning of programs as well as their inferential behavior. Logically and intentionally different programs can produce orbits that simulate each other. Simple examples of such behavior are compellingly exhibited with space-time diagrams of the programs as cellular automata. Construing a program as a cellular automaton leads to a general method for simulating any covered program with a Horn …

Kenematic Tolerance Analysis, Leo Joskowicz, Elisha Sacks, Vijay Srinivasan

Department of Computer Science Technical Reports

No abstract provided.

Sliced Configuration Spaces For Curved Planar Bodies, Elisha Sacks, Chandrajit Bajaj

Department of Computer Science Technical Reports

No abstract provided.

Inverse Pattern Matching, Amihood Amir, Alberto Apostolico, Moshe Lewenstein

Department of Computer Science Technical Reports

No abstract provided.