Digital Commons Network^™

An Integrated Framework For Learning And Reasoning, Christophe G. Giraud-Carrier, Tony R. Martinez

Faculty Publications

Learning and reasoning are both aspects of what is considered to be intelligence. Their studies within AI have been separated historically, learning being the topic of machine learning and neural networks, and reasoning falling under classical (or symbolic) AI. However, learning and reasoning are in many ways interdependent. This paper discusses the nature of some of these interdependencies and proposes a general framework called FLARE, that combines inductive learning using prior knowledge together with reasoning in a propositional setting. Several examples that test the framework are presented, including classical induction, many important reasoning protocols and two simple expert systems.

Multiclass Query Scheduling In Real-Time Database Systems, Hwee Hwa Pang, Michael J. Carey, Miron Livny

Research Collection School Of Computing and Information Systems

In recent years, a demand for real-time systems that can manipulate large amounts of shared data has led to the emergence of real-time database systems (RTDBS) as a research area. This paper focuses on the problem of scheduling queries in RTDBSs. We introduce and evaluate a new algorithm called Priority Adaptation Query Resource Scheduling (PAQRS) for handling both single class and multiclass query workloads. The performance objective of the algorithm is to minimize the number of missed deadlines, while at the same time ensuring that any deadline misses are scattered across the different classes according to an administratively-defined miss distribution. …

Surface Intersection Loop Destruction, Thomas W. Sederberg, Alan K. Zundel

Faculty Publications

The intersection curve between two surface patches consists of one or more connected components or branches. Each component can be classified as either an open branch, with endpoints on at least one patch boundary, or as a closed loop.

Weakest Pre-Condition And Data Flow Testing, Griffin David Mcclellan

Dissertations and Theses

Current data flow testing criteria cannot be applied to test array elements for two reasons: 1. The criteria are defined in terms of graph theory which is insufficiently expressive to investigate array elements. 2. Identifying input data which test a specified array element is an unsolvable problem. We solve the first problem by redefining the criteria without graph theory. We address the second problem with the invention of the wp_du method, which is based on Dijkstra's weakest pre-condition formalism. This method accomplishes the following: Given a program, a def-use pair and a variable (which can be an array element), the …

A Statistical Approach To Mpeg Video Stream Characterization, Kubilay Cardakli

Electrical Engineering and Computer Science - Technical Reports

As video consumes a significant percentage of the available network bandwidth, understanding video bandwidth requirements will translate into better network control schemes. In this study, several commercially available video streams are statistically analyzed and several modeling approaches are developed. The segmentation techniques are found to be rewarding. However, the improvements due to complexity of the polynomial models are insignificant.

Matching And Indexing Techniques In Rules, Madhav Moganti

Computer Science Technical Reports

Rules are widely used in present-day intelligent systems for modeling intelligent behavior, building expert systems, database rule systems, and advanced document retrieval systems. Most rule-based system programs are extremely computation-intensive and run quite slowly. This problem may get still worse when a rulebase does not fit into primary memory completely. This article reviews currently existing rule matching and indexing techniques. This report is organized into two parts. Part I presents the well known rule matching algorithms, Rete and TREAT, along with their performance evaluations. Part II presents rule indexing techniques for large scale rulebases. Here two sources of indexing are …

Test Of The Flavour Independence Of Αs, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Using about 950 000 hadronic events collected during 1991 and 1992 with the ALEPH detector, the ratios r b = bs=udsc s and r uds = uds s =cbs have been measured in order to test the avour independence of the strong coupling constant s . The analysis is based on event{shape variables using the full hadronic sample, two b-quark samples enriched by lepton tagging and lifetime tagging, and a light-quark sample enriched by lifetime antitagging. The combined results are r b = 1:002 0:023 and r uds = 0:971 0:023.

Parallel Fast Multipole Algorithm Using Mpi, Daniel Okunbor, Eric Jui-Lin Lu

Computer Science Technical Reports

The simulation of many-body, many-particle system has a wide range of applications in area such as biophysics, chemistry, astrophysics, etc. It is known that the force calculation contributes ninety percent of the simulation time. This is mainly due to the fact that the total number of interactions in the force is 0( N 2 ), where N is the number of particles in the system. The fast multipole algorithm, proposed by Greengard and Rokhlin, reduces the time complexity of the force calculation to O(N). We implement the fast multipole algorithm, using MPI, based on optimal communication scheme which minimizes the …

Integration Methods For N-Body Problems, D. I. Okunbor

Computer Science Technical Reports

Particle simulation studies the time evolution of the dynamical state of a system of interacting particles by the computation of trajectories of particles based on the numerical integration of the Newton equations of motion. This approach is widely used in biomolecular modeling to study, for example, proteins; and in astrophysics to study gravitational N-body system. The dimension of this system of equations of motion is in the order of tens of thousands. To solve this system involves an enormous amount of computer time. Several techniques have been advanced to reduce the computational complexity of this problem. Some of which are: …

The Rotations Of Maxillary Molars, Mandibular Molars, And Maxillary First Premolars In Acceptable Occlusions, G. Kristian Hansen

Loma Linda University Electronic Theses, Dissertations & Projects

The rotation of the maxillary molars is considered important in the orthodontic treatment of malocclusions. In this study a computer analysis program was developed to examine the rotations of maxillary molars, mandibular molars, and maxillary first premolars in casts of permanent dentitions with acceptable occlusions. Ninety three sets of untreated "acceptable occlusion" models from the collection of the Foundation for Orthodontic Research (FOR) were scanned on a flat bed scanner at 600 dots per inch (dpi). The images were analyzed using custom software on a computer. Measurements were made by relating maxillary first permanent molars to the midline, the archform, …

The Forward-Backward Asymmetry For Charm Quarks At The Z Pole, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

From 1.4 million hadronic Z decays collected by the ALEPH detector at LEP, an enriched sample of Z → cc̄ events is extracted by requiring the presence of a high momentum D∗±. The charm quark forward-backward charge asymmetry at the Z pole is measured to be AFB0.c = (8.0 ± 2.4) % corresponding to an effective electroweak mixing angle of sin2θWeff = 0.2302 ± 0.0054.

Hodographs And Normals Of Rational Curves And Surfaces, Thomas W. Sederberg, Takafumi Saito, Guo-Jin Wang

Faculty Publications

Derivatives and normals of rational Bézier curves and surface patches are discussed. A non-uniformly scaled hodograph of a degree m x n tensor-product rational surface, which provides correct derivative direction but not magnitude, can be written as a degree (2m - 2) x 2n or 2m x (2n - 2) vector function in polynomial Bézier form. Likewise, the scaled normal direction is degree (3m - 2) x(3n - 2). Efficient methods are developed for bounding these directions and the derivative magnitude.

Document Preprocessing And Fuzzy Unsupervised Character Classification, Shy-Shyan Chen

Dissertations

This dissertation presents document preprocessing and fuzzy unsupervised character classification for automatically reading daily-received office documents that have complex layout structures, such as multiple columns and mixed-mode contents of texts, graphics and half-tone pictures. First, the block segmentation algorithm is performed based on a simple two-step run-length smoothing to decompose a document into single-mode blocks. Next, the block classification is performed based on the clustering rules to classify each block into one of the types such as text, horizontal or vertical lines, graphics, and pictures. The mean white-to-black transition is shown as an invariance for textual blocks, and is useful …

Ph.D. Thesis Proprosal: Transportable Agents, Robert S. Gray

Computer Science Technical Reports

One of the paradigms that has been suggested for allowing efficient access to remote resources is transportable agents. A transportable agent is a named program that can migrate from machine to machine in a heterogeneous network. The program chooses when and where to migrate. It can suspend its execution at an arbitrary point, transport to another machine and resume execution on the new machine. Transportable agents have several advantages over the traditional client/server model. Transportable agents consume less network bandwidth and do not require a connection between communicating machines -- this is attractive in all networks and particularly attractive in …

Transitions In Masculinity And Hemingway's Developed "Code", Daniel Polk

Honors Theses

The "Hemingway Code" is much more than two words that fit nicely together for a scholar's usage; the words signify a much deeper championing of masculinity, almost a haunting presence. For Ernest Hemingway living life every day, every moment with its fullest masculine fervor, became an obsession, a never-ending quest to be at one with the attitude of never complaining, never crying out, panicking, thinking too much, or regretting. To live a manly life in a series of tactical victories, performed with steadfast ritualistic mannerisms, is to embody masculinity, and therefore the "Hemingway Code."

The Parser Converter Loader: An Implementation Of The Computational Chemistry Output Language (Ccol), Donald Randall Abel

Dissertations and Theses

A necessity of managing scientific data is the ability to maintain experimental legacy information without continually modifying the applications that create and use that information. By facilitating the management of scientific data we hope to give scientists the ability to effectively use additional modeling applications and experimental data. We have demonstrated that an extensible interpreter, using a series of stored directives, allows the loading of data from computational chemistry applications into a generic database. Extending the interpreter to support a new application involves supplying a list of directives for each piece of information to be loaded. This research confirms that …

A Domain-Specific Parallel Programming System Ii. Automatic Data Partitioning, Elaine Wenderholm

Electrical Engineering and Computer Science - Technical Reports

εm is a high-level programming system which puts parallelism within the reach of scientists who are not sophisticated programmers. εm both restricts and simplifies the programming interface, and thereby eases both the conceptual task of the programmer and the analytical task of the compiler. The εm compiler performs automatic data structure definition, scheduling and data partitioning. This document presents the automatic data partitioning algorithm used in εm.

Software Testing Paradigms, A. Subramaniam, G. Zobrist

Computer Science Technical Reports

The development of software follows a series of steps adopted from the Classical Life Cycle approach. Amongst all the steps, Software testing demands a lot of attention considering the amount of effort applied in it. There are various techniques by which a software can be tested. A review of techniques available are discussed. A methodology that can be applied to software testing has also been suggested. This document can be used by a programmer to select the technique for software testing and also assists in providing a narrowed view to the vast number of techniques available for software testing.

Discovery Of Integrity Relationships In Relational Databases, D. Harrier, D. C. St. Clair

Computer Science Technical Reports

The use of database management system integrity constraints has been a powerful tool in raising the quality of data within an application subject database. Unfortunately, the successful use of integrity constraints requires that the database administrator has implemented the constraint before data are inserted into the database.

The results of this research provide a methodology for discovering previously unknown integrity relationships in a relational database. The methodology uses the principles of knowledge discovery from the artificial intelligence community, and Quinlan's ID3 machine learning algorithm as the discovery tool. Experimental results are provided that demonstrate how the methodology can be applied.

The Effect Of A Database Feedback System On User Performance, H. Chan, K. Wei, Keng Siau

Research Collection School Of Computing and Information Systems

There are two main approaches to improving the effectiveness of database interfaces. One is to raise the level of abstraction for the content of the user-database interaction. The relational model belonging to the logical level has replaced the hierarchical and network models that belong to the lower physical level. It is likely that the relational model will eventually be replaced by models belonging to the even higher conceptual level, such as entity relationship models and object-oriented models. The second approach is to enhance the actual interaction process. This can be done by providing better feedback to the user. Feedback can …

Myriad: Design And Implementation Of A Federated Database Prototype, Ee Peng Lim, San-Yih Hwang, Jaideep Srivastava, Dave Clements, M. Ganesh

Research Collection School Of Computing and Information Systems

A key problem in providing enterprise-wide information is the integration of databases that have been independently developed. An important requirement is to accommodate heterogeneity and maintain the autonomy of component databases. Myriad is a federated database prototype developed at the University of Minnesota, to provide a testbed for investigating alternatives in architecture and algorithms for database integration, query processing and optimization, and concurrency control and recovery. The system incorporates our group's research results in these areas. This paper describes our experiences in the design and implementation of Myriad, and in the project management. Special emphasis is given to discussing design …

From Formal Security Specifications To Executable Assertions - A Distributed Systems Preliminary Study, C. Serban, B. Mcmillin

Computer Science Technical Reports

A security policy for a distributed system can be checked for compliance at run-time, as the system executes, using assertions embedded in software. This paper presents the concept of run-time security assurance, according to a given security policy for a given distributed system, along with mechanisms for its usage. A model problem illustrates the implementation of executable security assertions and their run-time validation on histories (traces) of events.

Search For Supersymmetric Particles With R-Parity Violation In Z Decays, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

Searches for supersymmetric particles produced in e+e− interactions at the Z peak have been performed under the assumptions that R-parity is not conserved, that the dominant R-parity violating coupling involves only leptonic fields, and that the lifetime of the lightest supersymmetric particle can be neglected. In a data sample collected by the ALEPH detector at LEP up to 1993, and corresponding to almost two million hadronic Z decays, no signal was observed. As a result, supersymmetric particle masses and couplings are at least as well constrained as under the usual assumption of R-parity conservation.

Exceptions And Exception Handling In Computerized Information Processes, Diane M. Strong, Steven M. Miller

Research Collection School Of Computing and Information Systems

Exceptions, situations that cannot be correctly processed by computer systems, occur frequently in computer-based information processes. Five perspectives on exceptions provide insights into why exceptions occur and how they might be eliminated or more efficiently handled. We investigate these perspectives using an in-depth study of an operating information process that has frequent exceptions. Our results support the use of a total quality management (TQM) approach of eliminating exceptions for some exceptions, in particular, those caused by computer systems that are poor matches to organizational processes. However, some exceptions are explained better by a political system perspective of conflicting goals between …

An Upper Limit For The Τ Neutrino Mass From Τ → 5Π(Π0)Ντ Decays, D. Buskulic, M. Thulasidas

Research Collection School Of Computing and Information Systems

From a sample of 152,000 τ decays collected by the ALEPH detector at LEP an upper limit of 24 MeV at 95% CL on the τ neutrino mass has been determined. The limit is obtained using a two dimensional likelihood fit of the visible energy and the invariant mass distribution of 25 τ → 5π(π0)ντ events.

Study Of The Subjet Structure Of Quark And Gluon Jets, D. Buskulic, D., M. Thulasidas

Research Collection School Of Computing and Information Systems

Measurements of the subjet structure of quark and gluon jets in hadronic Z decays are presented. The analysis is based on one million hadronic events recorded by the Aleph detector. Roughly symmetric three-jet events are selected with a coarse jet-resolution cut-off, y1. Gluon jets are identified with a purity of 94.6% in those events where evidence of long-lived heavy-flavour hadrons in the other two jets is found. The jets are then analyzed using a smaller cut-off y0 (< y1) so that subjets are resolved. The properties of the jets (subjet multiplicities (Nq), (Ng) and rates Rng(q) for n = 1, 2, 3, 4) are determined and are found to be in good agreement with the expectations of perturbative QCD as long as the subjet resolution parameter y0 is sufficiently large to keep non-perturbative effects small. In particular, the ratio , which to leading order in QCD is given by the ratio of colour factors , is measured to be 1.96 ± 0.15 for y0 = 2 · 10−3, but falls to 1.29 ± 0.03 for y0 = 1.6 · 10−5.

Michel Parameters And Τ Neutrino Helicity From Decay Correlations In Z → Τ+Τ-, D. Buskulic, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Psusort: A Parallel External Sort For A Shared Memory Multiprocessor System, Sujata V. Ramamoorthy

Dissertations and Theses

A method to parallelize external sorts on a shared memory multiprocessing system is presented in this thesis. The main goal of the thesis is to develop a sorting package that is scale able and efficient. No prior knowledge of the nature, source or size of the data is assumed for this work. A dynamic load-balancing architecture is used with no static allocation of tasks to processes. The package consists of an interface and a kernel. The interface provides the sort with the following - the sort input, output and temporary work spaces as abstract data types (ADTs), memory available, number …

Weighted Coverings And Packings, G. D. Cohen, Iiro Honkala, S. N. Litsyn, H. F. Mattson Jr

Electrical Engineering and Computer Science - Technical Reports

In this paper we introduce a generalization of the concepts of coverings and packings in Hamming space called weighted coverings and packings. This allows us to formulate a number of well-known coding theoretical problems in a uniform manner. We study the existence of perfect weighted codes, discuss connections between weighted coverings and packings, and present many constructions for them.

A Type I Hybrid Arq System With Adaptive Code Rates, Robert H. Deng, Michael L. Lin

Research Collection School Of Computing and Information Systems

Type I hybrid ARQ systems use an error-control code of fixed rate for error-correction in each transmitted packet. In such systems, the code rate must be carefully chosen to match the channel bit error rate (BER) in order to maximize system throughput. Whenever there is a mismatch between code rate and channel BER, the throughput suffers. In this paper, we proposed a type I hybrid ARQ system which automatically adjusts its code rates to match channel BERs. The proposed system is very simple to implement and yet performs significantly better than type I hybrid ARQ systems of fixed code rate