Physical Sciences and Mathematics Commons^™

Preconditioner Construction With Rational Approximation, Mo Mu, John R. Rice

Department of Computer Science Technical Reports

No abstract provided.

Topologically Correct Approximations Of Arbitrary Rational Parametric, Chandrajit L. Bajaj, Andrew V. Royappa

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.

Collaborative Multimedia Scientific Design In Shastra, Vinod Anupam, Chandrajit L. Bajaj

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.

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

Department of Computer Science Technical Reports

No abstract provided.

Trimming And Closure Of Constrained Surfaces, Xiangping Chen, Christoph M. Hoffmann

Department of Computer Science Technical Reports

No abstract provided.

New Software Composition Tools, Bruno Degazio

Publications and Scholarship

This paper briefly discusses a number of software tools developed at the author's studio through the course of research work into algorithmic composition. Most of the tools developed are directly related to recursive techniques; some, however, arise from more general techniques of algorithmic composition first described by Joseph Schillinger.

Examples of recursive techniques include:
• META-FRACTALS - separating musical content from recursive structure
• the Lorenz attractor and Koch snowflake as musical generators
• Iterated Function Systems as musical generator
• dynamic values in the logistic equation and the Mandelbrot set.

Non-recursive tools include:
• the Intelligent Interval Tool - …

Simulation Modeling Of Prehospital Trauma Care, Robert L. Wears

UNF Graduate Theses and Dissertations

Prehospital emergency care systems are complex and do not necessarily respond predictably to changes in management. A combined discrete-continuous simulation model focusing on trauma care was designed and implemented in SIMSCRIPT II.5 to allow prediction of the systems response to policy changes in terms of its effect on the system and on patient survival.

The utility of the completed model was demonstrated by the results of experiments on triage and helicopter dispatching policies. Experiments on current and two alternate triage policies showed that helicopter utilization is significantly increased by more liberal triage to Level 1 trauma centers, which was expected, …

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 …

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

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

End-To-End Analysis Of Hexagonal Vs Rectangular Sampling In Digital Imaging Systems, John Clifton Burton Ii

Dissertations, Theses, and Masters Projects

The purpose of this study was to compare two common methods for image sampling in digital image processing: hexagonal sampling and rectangular sampling. The two methods differ primarily in the arrangement of the sample points on the image focal plane. In order to quantitatively compare the two sampling methods, a mathematical model of an idealized digital imaging system was used to develop a set of mean-squared-error fidelity loss metrics. The noiseless continuous/discrete/continuous end-to-end digital imaging system model consisted of four independent components: an input scene, an image formation point spread function, a sampling function, and a reconstruction function. The metrics …

Flush Communication Channels: Effective Implementation And Verification, Tracy Kay Camp

Dissertations, Theses, and Masters Projects

Flush communication channels, or F-channels, generalize more conventional asynchronous communication paradigms. A distributed system which uses an F-channel allows a programmer to define the delivery order of each message in relation to other messages transmitted on the channel. Unreliable datagrams and FIFO (first-in-first-out) communication channels have strictly defined delivery semantics. No restrictions are allowed on message delivery order with unreliable datagrams--message delivery is completely unordered. FIFO channels, on the other hand, insist messages are delivered in the order of their transmission. Flush channels can provide either of these delivery order semantics; in addition, F-channels allow the user to define the …

Fourier Analysis Of Frequency Domain Discrete Event Simulation Experiments, Mousumi Mitra Hazra

Dissertations, Theses, and Masters Projects

Frequency Domain Experiments (FDEs) were first used in discrete-event simulation to perform system parameter sensitivity analysis for factor screening in stochastic system simulations. FDEs are based on the intuitive assertion that if one or more system parameters are oscillated at fixed frequencies throughout a simulation run, then oscillations at the same frequencies will be induced in the system's response. Spectral (Fourier) analysis of these induced oscillations is then used to characterize and analyze the system. Since their introduction 12 years ago, significant work has been done to extend the applicability of FDEs to regression analysis, simulation optimization and gradient estimation. …

Observation Of B0 Decay To Two Charmless Mesons, M. Battle, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We report results from a search for the decays B0→π+π-, B0→K+π-, and B0→K+K-. We find 90% confidence level upper limits on the branching fractions, Bππ

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.

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.

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.

The Introduction Of A Catalog Automation And Manufacturing Costing System For Use In A Jewelry Manufacturing Company, Moshe S. Raab

CCE Theses and Dissertations

The jewelry manufacturing industry is an example of an industry that is slow to accept and incorporate new technology. There are, however, some large companies that have automated the accounting and inventory functions. Some of these companies have even invested in systems that can do image storage and retrieval. Until recently, these computer systems have been very expensive to purchase.

Prestige Marketing, Ltd. is a small jewelry manufacturing company. The owner of Prestige recognized the advantage of utilizing inexpensive personal computers to develop a software system that would calculate the cost of manufacturing and determine the recommended selling price of …

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

Temporal Model Of An Optically Pumped Co-Doped Solid State Laser, T. G. Wangler, J. J. Swetits, A. M. Buoncristiani

Mathematics & Statistics Faculty Publications

Currently, research is being conducted on the optical properties of materials associated with the development of solid-state lasers in the 2 micron region. In support of this effort, a mathematical model describing the energy transfer in a holmium laser sensitized with thulium is developed. In this paper, we establish some qualitative properties of the solution of the model, such as non-negativity, boundedness, and integrability. A local stability analysis is then performed from which conditions for asymptotic stability are obtained. Finally, we report on our numerical analysis of the system and how it compares with experimental results.

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.

So Far (Schematically) Yet So Near (Semantically), Amit P. Sheth, Vipul Kashyap

Kno.e.sis Publications

In a multidatabase system, schematic conflicts between two objects are usually of interest only when the objects have some semantic affinity. In this paper we try to reconcile the two perspectives. We first define the concept of semantic proximity and provide a semantic taxonomy. We then enumerate and classify the schematic and data conflicts. We discuss possible semantic similarities between two objects that have various types of schematic and data conflicts. Issues of uncertain information and inconsistent information are also addressed.

On Transactional Workflows, Amit P. Sheth, Marek Rusinkiewicz

Kno.e.sis Publications

The basic transaction model has evolved over time to incorporate more complex transactions structures and to take the advantage of semantics of higher-level operations that cannot be seen at the level of page reads and writes. Well known examples of such extended transaction models include nested and multi-level transactions. A number of relaxed transaction models have been defined in the last several years that permit a controlled relaxation of the transaction isolation and atomicity to better match the requirements of various database applications. Correctness criteria other than global serializability have also been proposed. Several examples of extended/relaxed transaction models are …

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

Formal Method For Scheduling, Routing And Communication Protocol, Lenore Mullin, S. A. Thibault, D. R. Dooling, E. A. Sandberg

Computer Science Faculty Research & Creative Works

The PRAM model has been shown to be an optimal design for emulating both loose and tightly coupled multiprocessors for unit time operations. When virtual processors are required, multiplexing work to available processors is employed. This introduces a form of latency incurred by operating system overhead. Further complications arise when bandwidth creates bottlenecking of work units. G.E. Blelloch (1989) showed how to add parallel prefix operations (scans) to an extended PRAM model which uses unit step, not time operations. This paper shows how the psi) calculus can be used to group work units, i.e., pipelining the work units, so that …

On Matching Ann Structure To Problem Domain Structure, George G. Lendaris, Martin Zwick, Karl Mathia

Systems Science Faculty Publications and Presentations

To achieve reduced training time and improved generalization with artificial neural networks (ANN, or NN), it is important to use a reduced complexity NN structure. A "problem" is defined by constraints among the variables describing it. If knowledge about these constraints could be obtained a priori, this could be used to reduce the complexity of the ANN before training it. Systems theory literature contains methods for determining and representing structural aspects of constrained data (these methods are herein called GSM, general systems method). The suggestion here is to use the GSM model of the given data as a pattern for …

Learning Unions Of Boxes With Membership And Equivalence Queries, Paul W. Goldberg, Sally A. Goldman, H. David Matthias

All Computer Science and Engineering Research

We present two algorithms that use membership and equivalence queries to exactly identify the concepts given by the union of s discretized axis-parallel boxes in d-dimensional discretized Euclidean space where each coordinate can have n discrete values. The first algorithm receives at most s*d counterexamples and uses time and membership queries polynomial in s and logn for d any constant. Further, all equivalence queries made can be formulated as the union of O(s*d*log(s)) axis-parallel boxes. Next, we introduce a new complexity measure that better captures the complexity of a union of boxes than simply the number of boxes and dimensions. …

Real-Time Admission Control Algorithms With Delay And Loss Guarantees In Atm Networks, Apostolos Dailianas, Andreas D. Bovopoulos

All Computer Science and Engineering Research

A multimedia ATM network is shared by media streams with different performance requirements. For media streams such as file transfers, the preservation of bursts and the provision of guarantees for loss probability at the burst level is of primary importance, while, for media streams such as voice, loss guarantees at the cell level are sufficient. Continuous media have stringent delay jitter requirements. Finally, some applications require loss-free transmission. In this paper, the first complete traffic management scheme for multimedia ATM networks is introduced. The traffic management scheme supports four different classes of traffic, each of which has different performance requirements …

An Optimal Nonblocking Multicast Virtual Circuit Switch, Jonathan S. Turner

All Computer Science and Engineering Research

This paper describes an architecture for a multicast virtual circuit switch using cell recycling. This is the first nonblocking switch architecture that is optimal in both the switching network complexity and the amount of memory required for multicast address translation. Furthermore, it is optimal in the amount of effort required for multicast connection modification. This architecture makes it both technically and economically feasible to construct the large switching systems that will ultimately be needed for wide scale deployment of Broadband ISDN to residential users. In particular, we estimate that systems with tens of thousands of 620 Mb/s ports can be …