Digital Commons Network^™

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 …

An Object Oriented Preemptive Multitasking Kernel, Lee Gene Shipman

Masters Theses

“This paper describes a preemptive multitasking kernel designed and coded using C++ using an object oriented paradigm. The kernel design, while implemented on an Intel 80386 based IBM PC running MS-DOS 4.01, can be ported to any platform, rewriting only the low level, hardware specific code.

The kernel, in application framework form, enables the applications developer to create real-time multitasking applications. This can be done in a systematic way by capitalizing on the power of object oriented program development.

A simulation was created to verify the correctness of the kernel against a traditional non-multitasking approach. This simulation provides the proof …

X.500 Directory Service Support For Electronic Mail, Mihai G. Sirbu

Masters Theses

"One of the difficult problems on the Internet is finding the electronic mail addresses of users. In practice, there are some indirect ways of finding these addresses such as the finger program in UNIX, but almost all of these methods require the user to know the exact host name of the destination. What is most desirable is an automated mechanism which provides the e-mail addresses of users if some minimal information about the destination site is known.

This thesis describes the design of such a directory service support system, based on the X.500 Series of CCITT Recommendation, for the elm …

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-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.

An Application-Oriented Approach To Distributed Error-Detecting Branch & Bound, Aggie Y. Sun, Hanan Lutfiyya, Bruce Mcmillin

Computer Science Technical Reports

An important aspect which is often overlooked in software _design of distributed environments is that of fault tolerance. Many methodologies in the past have attempted to provide fault tolerance efficiently, but have never been successful at eliminating explicit time and space redundancy. One approach is the Application-Oriented Fault Tolerance Paradigm, which provides fault tolerance by examining the behavior and properties of the application and deriving executable assertions for the detection of faults. Previous work has demonstrated the feasibility of the application-oriented fault tolerance paradigm for various applications. However, the executable assertions were guided by the natural constraints of the problem. …

Performance Of Iterative Methods For Distributed Memory Processors, Dan C. Marintescu, John R. Rice, E. Vavallis

Department of Computer Science Technical Reports

No abstract provided.

Efficient Accommodation Of May-Alias Information In Ssa Form, Ron Cytron, Reid Gershbein

All Computer Science and Engineering Research

We present an algorithm for incrementally including may-alias information into Static Single Assignment form by computing a sequence of increasingly precise (and correspondingly larger) partial SSA forms. Our experiments show significant speedup of our method over exhaustive use of may-alias information, as optimization problems converge well before most may-aliases are needed.

Exact Dominance Without Search In Decision Trees, Nilesh L. Jain, Ronald P. Loui

All Computer Science and Engineering Research

In order to improve understanding of how planning and decision analysis relate, we propose a hybrid model containing concepts from both. This model is comparable to [Hartman90], with slightly more detail. Dominance is simple concept in decision theory. In a restricted version of our model, we give conditions under which dominance can be detected without search: that is, it can be used as a pruning strategy to avoid growing large trees. This investigation follows the lead of [Wellman87]. The conditions seem hard to meet, but may nevertheless be useful in forward-chaining situations without focus, such as [Breese87]. It may be …

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.

A Computer Simulation Of The Rotary Vacuum Filter Brown Stock Washing System Using Distribution Sampling, Edison G. Yiu

Masters Theses

A probabilistic model was utilized to simulate the brown stock washing system's error due to process variability and measurement noise. Mass balances of the washing system were performed using distribution sampling. This model relies on a nonlinear relationship between displacement and dilution, which permitted the generation of displacement ratio based upon wash liquor ratio. Experimental trials were performed on a pilotscale rotary vacuum single-stage washer. Nonlinear first-order relationship appears to characterize a pilotscale washer adequately. Differences were observed between the means and standard deviations of the measured results compared to the simulation output. Future work is needed to identify the …

An Efficient Over-The-Cell Routing Algorithm For High Performance Circuits, Sivakumar Natarajan

Masters Theses

In this thesis, we present a three-layer and a two-layer over-the-cell (OTC) channel routing algorithm (WILMA3 and WILMA2 respectively) for high speed circuits. This router not only minimizes the channel height by using over-the-cell areas but also achieves the net’s timing requirements.

We have implemented our routers in C on SUN Sparc 1+ workstation and tested it on MCNC benchmarks Primary I and II. Experimental results show that WILMA3 can achieve results which are 72% better (on the average) than the conventional two layer channel router, 61% better than two layer over-the-cell router and 51% better than three layer greedy …

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

Masters Theses

No abstract provided.

Pargal: A Package For Parallel Graph Algorithms, Winston Anand-Kumar

Masters Theses

In this thesis, we have considered three graph problems namely, spanning forest problem, connected component problem and minimum cost spanning forest problem. Standard methods to solve these problems using sequential algorithms by various authors are presented for each problem. Efficient parallel algorithms for these problems have also been presented by various authors; however, most of these solutions demands a need for large number of processors, which immediately increases the cost of the hardware and in most of the cases it seems not very practical.

We present efficient solutions for the three problems on a hypercube parallel computer using p processors. …

On The Difficulty Of Manhattan Channel Routing, Ronald I. Greenberg, Joseph Jaja, Sridhar Krishnamurthy

Computer Science: Faculty Publications and Other Works

We show that channel routing in the Manhattan model remains difficult even when all nets are single-sided. Given a set of n single-sided nets, we consider the problem of determining the minimum number of tracks required to obtain a dogleg-free routing. In addition to showing that the decision version of the problem isNP-complete, we show that there are problems requiring at least d+Omega(sqrt(n)) tracks, where d is the density. This existential lower bound does not follow from any of the known lower bounds in the literature.

On Domains Of Superior Convergence Of The Ssor Method Over The Sor Method For P- Cyclic H-Matrices, Apostolos Hadjidimos, Michael Neumann

Department of Computer Science Technical Reports

No abstract provided.

The Gati Client/Server Animation Toolkit, Changrajit L. Bajaj, Steve Cutchin

Department of Computer Science Technical Reports

No abstract provided.

A-Splines: Local Interpolation And Approximation Using Ck Continuous Piecewise Real Algebraic Curves, Chandrajit L. Bajaj, Guoliang Xu

Department of Computer Science Technical Reports

No abstract provided.

A Theory Of Global Concurrency Control In Multidatabase Systems, Aidong Zhang, Ahmed K. Elmagarmid

Department of Computer Science Technical Reports

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.

Improved Global Routing Using ⋋-Geometry, Surendra Burman

Masters Theses

No abstract provided.

An Object Based Approach Towards The Automation Of Office Procedures Using Intelligent Messages, Robert L. Palumbo

Student Work

Office support systems are used to automate routine office tasks. Since office tasks often require the cooperation of several office workers who may be physically dispersed, it is important to develop advanced communication systems that better facilitate collaborative and cooperative office work among office workers.

In this thesis, we propose an approach to the construction of advanced communication systems in which messages are represented as objects that are “intelligent” and “active” and can therefore perform certain activities (such as interacting with various entities to collect data) and decisions (such as dynamically deciding which user to go to next) on their …

Power Analysis In Flexible Automation, Nathan A. Titus

Theses and Dissertations

The performance of an automation or robotic device can be measured in terms of its power efficiency. Screw theory is used to mathematically define the task instantaneously with two screws. The task wrench defines the effect of the device on its environment, and the task twist describes the motion of the device. The tasks can be separated into three task types: kinetic, manipulative, and reactive. Efficiency metrics are developed for each task type. The output power is strictly a function of the task screws, while device input power is shown to be a function of the task, the device Jacobian, …