Digital Commons Network^™

A-Hohfeld: A Language For Robust Structural Representation Of Knowledge In The Legal Domain To Build Interpretation-Assistance Expert Systems, Layman E. Allen, Charles S. Saxon

Book Chapters

The A-Hohfeld language is presented as a set of definitions; it can be used to precisely express legal norms. The usefulness of the AHohfeld language is illustrated in articulating 2560 alternative structural interpretations of the four-sentence 1982 Library Regulations of Imperial College and constructing an interpretation-assistance legal expert system for these regulations by means of the general-purpose Interpretation-Assistance legal expert system builder called MINT. The logical basis for A-Hohfeld is included as an appendix.

Detection Of Skin Tumor Boundaries In Color Images, Fikret Erçal, M. Moganti, William V. Stoecker, Randy Hays Moss

Computer Science Faculty Research & Creative Works

A simple and yet effective method for finding the borders of tumors is presented as an initial step towards the diagnosis of skin tumors from their color images. The method makes use of an adaptive color metric from the red, green, and blue planes that contains information for discriminating the tumor from the background. Using this suitable coordinate transformation, the image is segmented. The tumor portion is then extracted from the segmented image and borders are drawn. Experimental results that verify the effectiveness of this approach are given

Evidence For Penguin-Diagram Decays: First Observation Of B→K*(892)Γ, R. Ammar, M. Thulasidas

Research Collection School Of Computing and Information Systems

We have observed the decays B0→K*(892)0γ and B−→K*(892)−γ, which are evidence for the quark-level process b→sγ. The average branching fraction is (4.5±1.5±0.9)×10−5. This value is consistent with standard model predictions from electromagnetic penguin diagrams.

Practical Prefetching Techniques For Multiprocessor File Systems, David Kotz, Carla Schlatter Ellis

Dartmouth Scholarship

Improvements in the processing speed of multiprocessors are outpacing improvements in the speed of disk hardware. Parallel disk I/O subsystems have been proposed as one way to close the gap between processor and disk speeds. In a previous paper we showed that prefetching and caching have the potential to deliver the performance benefits of parallel file systems to parallel applications. In this paper we describe experiments with practical prefetching policies that base decisions only on on-line reference history, and that can be implemented efficiently. We also test the ability of these policies across a range of architectural parameters.

Distributed Modeling And Rendering Of Splines Using Ganith And Splinex, Chandrajit L. Bajaj, Jindon Chen, Susan B. Evans

Department of Computer Science Technical Reports

No abstract provided.

A Coarse-Grained, Architecture-Independent Approach For Connected Component Labeling, Mikhail J. Atallah, Frank Dehne, Susanne E. Hambrusch

Department of Computer Science Technical Reports

No abstract provided.

An Optimal Algorithm For Shortest Paths On Weighted Interval And Circular-Arc Graphs With Applications, Mikhail J. Atallah, Danny Z. Chen, D. T. Lee

Department of Computer Science Technical Reports

No abstract provided.

A Unifying Approach To Hierarchical Transaction Management In Multidatabase Systems, Ahmed K. Almagarmid, Aidong Zhang

Department of Computer Science Technical Reports

No abstract provided.

On The Semantics Of Generative Geometry Representations, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

Visual Inspection Algorithms For Printed Circuit Board Patterns A Survey, Madhav Moganti, Fikret ErçAl, Cihan H. Dagli

Computer Science Technical Reports

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 last 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 …

Repository Evaluation Of Software Reuse: An Empirical Study, R. D. Banker, Robert J. Kauffman, D. Zweig

Research Collection School Of Computing and Information Systems

The use and benefits of repository evaluation of software reuse are illustrated through an analysis of the evolving repositories of two large firms that recently implemented integrated CASE development tools. The analysis shows that these tools have supported high levels of software reuse, but it also suggests that there remains considerable unexploited reuse potential. The findings indicate that organizational changes will be required before the full potential of the new technology can be realized.

Functional Representation And Reasoning About The F/A-18 Aircraft Fuel System, M. Pegah, J. Sticklen, William E. Bond

Computer Science Faculty Research & Creative Works

Functional reasoning, a subfield of model-based reasoning, is discussed. This approach uses abstractions of a device's purpose to index behaviors that achieve that purpose. Functional modeling, a variation on this method, also uses simulation as a core reasoning strategy. The complex causal knowledge of a device along functional lines is decomposed, then a causal story of how the device will operate in a particular situation given stated boundary conditions is composed. The application of the functional approach to modeling the fuel system of a F/A-18 aircraft is described. The representation of the F/A-18 fuel system includes 89 component devices, 92 …

Optimal Greedy Algorithms For Indifference Graphs, Peter J. Looges, Stephan Olariu

Computer Science Faculty Publications

A fundamental problem in social sciences and management is understanding and predicting decisions made by individuals, various groups, or the society as a whole. In this context, one important concept is the notion of indifference. We characterize the class of indifference graphs, that is, graphs which arise in the process of quantifying indifference relations. In particular, we show that these graphs are characterized by the existence of a special ordering of their vertices. As it turns out, this ordering leads naturally to optimal greedy algorithms for a number of computational problems, including coloring, finding a shortest path between two vertices, …

Intel Nx To Pvm 3.2 Message Passing Conversion Library, Trey Arthur, Michael L. Nelson

Computer Science Faculty Publications

NASA Langley Research Center has developed a library that allows Intel NX message passing codes to be executed under the more popular and widely supported Parallel Virtual Machine (PVM) message passing library. PVM was developed at Oak Ridge National Labs and has become the defacto standard for message passing. This library will allow the many programs that were developed on the Intel iPSC/860 or Intel Paragon in a Single Program Multiple Data (SPMD) design to be ported to the numerous architectures that PVM (version 3.2) supports. Also, the library adds global operations capability to PVM. A familiarity with Intel NX …

Syntactic Segmentation And Labeling Of Digitized Pages From Technical Journals, Mukkai Krishnamoorthy, George Nagy, Sharad C. Seth, Mahesh Viswanathan

School of Computing: Faculty Publications

Alternating horizontal and vertical projection profiles are extracted from nested sub-blocks of scanned page images of technical documents. The thresholded profile strings are parsed using the compiler utilities Lex and Yacc. The significant document components are demarcated and identified by the recursive application of block grammars. Backtracking for error recovery and branch and bound for maximum-area labeling are implemented with Unix Shell programs. Results of the segmentation and labeling process are stored in a labeled X-Y tree. It is shown that families of technical documents that share the same layout conventions can be readily analyzed. More than 20 types of …

Generating Tests For Delay Faults In Nonscan Circuits, Prathima Agrawal, Vishwani D. Agrawal, Sharad C. Seth

School of Computing: Faculty Publications

This new method allows any sequential-circuit test generation program to produce path delay tests for nonscan circuits. To test a given path, the authors augment the netlist model of the circuit with a logic block in which testing for a certain single stuck-at fault is equivalent to testing for a path delay fault. The test sequence for the stuck-at fault performs all the necessary delay fault test functions: initialization, path activation, and fault propagation. The authors present results on benchmarks for nonscan and scan/hold modes of testing.

Clock Partitioning For Testability, Kent L. Einspahr, Sharad C. Seth, Vishwani D. Agrawal

School of Computing: Conference and Workshop Papers

An implementation of a design for testability model for sequential circuits is presented. The flip-flops in a sequential circuit are partitioned to reduce the number of cycles and the path lengths in each partition, thereby reducing the complexity of test generation. The implementation includes a Podem-based test generator. Preliminary results using the Contest sequential test generator are presented.

Revisiting The Edge Of Chaos: Evolving Cellular Automata To Perform Computations, Melanie Mitchell, Peter T. Hraber, James P. Crutchfield

Computer Science Faculty Publications and Presentations

No abstract provided.

Neural Network Diagnosis Of Malignant Melanoma From Color Images, Fikret ErçAl, C. Chawla, William V. Stoecker, Randy Hays Moss

Computer Science Technical Reports

Malignant melanoma is the deadliest form of all skin cancers. Approximately 32,000 new cases of malignant melanoma were diagnosed in 1991, with approximately 80 percent of patients expected to survive five years [1]. Fortunately, if detected early, even malignant melanoma may be treated successfully. Thus, in recent years, there has been a rising interest in the automated detection and diagnosis of skin cancer, particularly malignant melanoma [2]. In this paper, we present a novel neural network approach for the automated separation of melanoma from three other benign categories of tumors which exhibit melanoma-like characteristics. Our approach is based on devising …

When Will A Genetic Algorithm Outperform Hill-Climbing?, Melanie Mitchell, John H. Holland

Computer Science Faculty Publications and Presentations

In this paper we review some previously published experimental results in which a simple hillclimbing algorithm-Random Mutation Hill-Climbing (RMHC)-significantly outperforms a genetic algorithm on a simple "Royal Road" function. vVe present an analysis of RMHC followed by an analysis of an "idealized" genetic algorithm (IGA) that is in turn significantly faster than RMHC. We isolate the features of the IGA that allow for this speedup, and discuss how these features can be incorporated into a real GA and a fitness landscape, making the GA better approximate the IGA. We use these features to design a modified version of the previously …

Tau Decays With One Charged Particle Plus Multiple Π0'S, M. Procario, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

With the CLEO-II detector at the Cornell Electron Storage Ring, we have measured branching fractions for tau lepton decay into one-prong final states with multiple π0’s B0hnπ, normalized to the branching fraction for tau decay into one charged particle and a single π0. We find B0h2π/B0hπ=0.345±0.006±0.016, B0h3π/B0hπ=0.041 ±0.003±0.005, and B0h4π/B0hπ=0.006±0.002±0.002.

Measurement Of Charmless Semileptonic Decays Of B Mesons, Bartelt; J.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Observation Of The Charmed Baryon C+ And Measurement Of The Isospin Mass Splittings Of The C, Crawford, G.; Et Al., M. Thulasidas

Research Collection School Of Computing and Information Systems

No abstract provided.

Search For Τ-→Γμ-: A Test Of Lepton Number Conservation, A. Bean, M. Thulasidas

Research Collection School Of Computing and Information Systems

A search for the lepton mumber violating decay of the τ lepton to the γμ final state has been performed with the CLEO II detector at the Cornell e+e− storage ring CESR. In a data sample that corresponds to an integrated luminosity of 1.55 fb−1, we observe no candidates in the signal region. We thus determine an upper limit of B(τ−→γμ−)

Study Of D0 Decays Into K̄0 And K̄*0, M. Procario, M. Thulasidas

Research Collection School Of Computing and Information Systems

Using the CLEO II detector at CESR we have studied D0 decays into final states with a ¯K0 or ¯K*0, and have measured branching ratios for the decay modes D0→(¯K0¯K*0)π0, η, η′. These results are compared with predictions of various charm decay models, and contributions of final-state interactions are discussed.

Genetic Algorithms With 3-Parent Crossover, L. Vincent Edmondson

Doctoral Dissertations

"A new genetic algorithm which uses a 3-parent uniform crossover operator is developed and analyzed. Uniform crossover operators are shown to be based on the premise that all bit-level genetic information should be passed from parents to children. The 3-parent uniform crossover operator is shown to adhere to this premise. The 3-parent uniform crossover operator is shown to be better than the 2-parent uniform crossover operator on the De Jong test functions.

Two new genetic algorithms which use 3-parent traditional crossover operators are developed and analyzed. The first uses a strategy of randomly selecting 3 of the 6 children resulting …

The Effect Of Subliminal Learning: Using A Direct Manipulation Computer Interface, Tammy P. Campbell

UNF Graduate Theses and Dissertations

Research to determine what subliminal presentation accomplishes and its effects upon the learning process is very limited. The possibility of presenting subliminal information in a passive manner to reinforce the learning process and the possibility that this presentation can aid in the absorption of the information needed to learn is examined. A previous study examined this possibility using a text editor as the test instrument. In this thesis, a direct manipulation interface using a spreadsheet which visually presents tasks is examined to determine if this environment might be more effective with a learning medium using subliminal perception, then was the …

A Case Tool For Conceptual Database Design, Keng Siau, Kok Phuang Tan, Hock Chuan Chan

Research Collection School Of Computing and Information Systems

The paper describes a Computer Aided Software Engineering (CASE) tool to support conceptual database modelling. One popular approach for conceptual database modelling is use of the Entity-Relationship (ER) model. The paper proposes the use of an Enhanced Entity-Relationship (EER) model for conceptual database modelling. This Enhanced Entity-Relationship model extends the Entity-Relationship model by incorporating the generalization/specialization, aggregation and categorization abstractions. The CASE tool, which is based on the Enhanced Entity-Relationship model, is known as the Enhanced Entity-Relationship Diagrammer (EERD). In addition, the CASE tool supports direct visual query and update based on the EERM.

Eztex: A Graphical User Interface System For Latex, Ravi K. Kosaraju

Masters Theses

No abstract provided.

Distributed Design Of Hip Protheses With Bhautik, Chandrajit L. Bajaj, Daniel R. Schikore

Department of Computer Science Technical Reports

No abstract provided.