ppxscal/embedding_network huggingface dataset:
Multi-Scale Description of Space Curves and Three-Dimensional Objects
Authors: Farzin Mokhtarian
Venue:  (1987)

This paper addresses the problem of representing the shape of three-dimensional or space curves. This problem is important since space curves can be used to model the shape of many three-dimensional objects effectively and economically. A number of shape representation methods that operate on two-dimensional objects and can be extended to apply to space curves are reviewed briefly and their shortcomings discussed. Next, the concepts of curvature and torsion of a space curve are explained. The curvature and torsion functions of a space curve specify it uniquely up to rotation and translation. Arc-length parametrization followed by Gaussian convolution is used to compute curvature and torsion on a space curve at varying levels of detail. Larger values of the scale parameter of the Gaussian bring out more basic features of the curve. Information about the curvature and torsion of the curve over a continuum of scales are combined to produce the curvature and torsion scale space images of the curve. These images are essentially invariant under rotation, uniform scaling and translation of the curve and are used as a representation for it. Using this representation, a space curve can be successfully matched to another one of similar shape. The application of this technique to a common three-dimensional object is demonstrated. Finally, the proposed representation is evaluated according to several criteria that any shape representation method should ideally satisfy. It is shown that the curvature and torsion scale space representation satisfies those criteria better than other possible candidate methods.
MAXIMUM LIKELIHOOD ESTIMATION FOR FAILURE ANALYSIS OF SRAM CELLS USING INDUCTIVE FAULT ANALYSIS
Authors: F. J Ferguson, Jianlin Yu
Venue:  (1996)

This paper presents an iterative maximum likelihood (ML) estimation method for statistical analysis of yield loss. By means of Inductive Fault Analysis (IFA) and circuit simulation, the map between defects and corresponding fault behaviors can be constructed for process-monitor SRAMs. Using the data from a tester describing the number of times each fault behavior occurs, the most likely causes of low yield can be identified automatically using the approaches presented in this paper without the need for physically deprocessing the defective SRAMs. To our knowledge the application of ML method using a mixture model on yield diagnosis has not appeared before in the literature.
Angiotool: A Tool for Interactive Visualization of MRI Vector and Tensor Fields
Authors: Abhir Bhalerao, Paul Summers
Venue:  (2001)

MR imaging is a uniquely powerful tool for non-invasively mapping blood flow and molecular diffusion. These properties have clinical significance but the lack of efficient and intuitive, display and exploration tools for the clinical expert is an obstacle to bringing these images into diagnostic use. We have developed a visualization application (Angiotool) for vector and tensor field data derived from MR phase contrast angiographic and diffusion tensor image (DTI) sequences which augments routine display functions with both quantitative and qualitative exploration features. One of its unique capabilities is to perform interactive tracking of streamlines in both velocity and diffusion tensor data. We describe the GUI model used by Angiotool and illustrate its interactive capability with example results from clinical cases. Central to the design of Angiotool is the ability to interact and navigate through the data in both 2D and 3D displays. Although implementations may differ, we see our interaction model as well suited to new applications of this type.
The "Burnside Process" Converges Slowly
Authors: Leslie A Goldberg, Mark Jerrum
Venue:  (1998)

We consider the problem of sampling ``unlabelled structures'''', i.e., sampling combinatorial structures modulo a group of symmetries. The main tool which has been used for this sampling problem is Burnside''s lemma. In situations where a significant proportion of the structures have no non-trivial symmetries, it is already fairly well understood how to apply this tool. More generally, it is possible to obtain nearly uniform samples by simulating a Markov chain that we call the Burnside process; this is a random walk on a bipartite graph which essentially implements Burnside''s lemma. For this approach to be feasible, the Markov chain ought to be ``rapidly mixing'''', i.e., converge rapidly to equilibrium. The Burnside process was known to be rapidly mixing for some special groups, and it has even been implemented in some computational group theory algorithms. In this paper, we show that the Burnside process is not rapidly mixing in general. In particular, we construct an infinite family of permutation groups for which we show that the mixing time is exponential in the degree of the group.
Using Annotations to Reduce Dynamic Optimization Time
Authors: Chandra Ckrintz, Brad Calder
Venue:  (2000)

Dynamic compilation and optimization are widely used in heterogenous computing environments and an environments requiring a virtual machine, where an intermediate form of the code is compiled to a native code during execution. An important tradeoff exists between the amount of time spent dynamically optimizing the program and the running time of the program. The time it takes to perform dynamic optimizations can cause signficant delays during execution and also negate some of the performance gains which result from a faster running program. In this research, we present an annotation framework that substantially reduces compilation overhead of Java programs. Annotations consist of analysis information collected off--line and incorporated into Java programs. The annotations are then used by dynamic compilers to guide optimization. Our annotations reduce compilation overhead incurred at all stages of compilation and optimization as well as enable complex optimizations to be performed dynamically. On average the annotation optimizations reduce optimized compilation overhead by 78% and enable total time speedups of 7% on average for the programs examined.
A Design Environment for Counterflow Pipeline Synthesis
Authors: Bruce R. Childers, Jack W. Davidson
Venue:  (1998)

The Counterflow Pipeline (CFP) organization may be a good target for synthesis of application-specific microprocessors for embedded systems because it has a regular and simple structure. This paper describes a design environment for tailoring CFP''s to an embedded application to improve performance. Our system allows exploring the design space of all possible CFP''s for a given application to understand the impact of different design decisions on performance. We have used the environment to derive heuristics that help to find the best CFP for an application. Preliminary results using our heuristics indicate that speedup for several small graphs range from 1.3 to 2.0 over a general-purpose CFP and that the heuristics find designs that are within 10% of optimal.
Dynamic Workflow Schema Evolution based on Workflow Type Versioningand Workflow Migration
Authors: Markus Kradolfer, Andreas Geppert
Venue:  (1998)

An important yet open problem in workflow management is the evolution of workflow schemas, i.e., the creation, deletion and modification of workflow types in such a way that the schema remains correct. This problem is aggravated when instances of modified workflow types are active at the time of modification, because any workflow instance has to conform to the definition of its type. This paper presents a framework for dynamic workflow schema evolution that is based on workflow type versioning and workflow migration. Workflow types can be versioned, and a new version can be derived from an existing one by applying one or more modification operations. Our approach also supports the migration of workflow instances from one workflow type version to another. Besides a taxonomy of schema modification operations, we introduce correctness criteria that must be met by workflow schemas. We also define under which conditions workflow instances can be migrated to new workflow type versions.
The Probabilistic Neural Network for Nonlinear Time Series Analysis
Authors: Anthony Zaknich, Chris deSilva, Yianni Attikiouzel
Venue:  (1991)

Abstract unavailable.
Data mining in health care applications
Authors: Fay Cobb Payton
Venue: Data mining: opportunities and challenges (2003)

Recent attention has turned to the healthcare industry and its use of voluntary community health information network (CHIN) models for e-health and care delivery. This chapter suggests that competition, economic dimensions, political issues, and a group of enablers are the primary determinants of implementation success. Most critical to these implementations is the issue of data management and utilization. Thus, health care organizations are finding value as well as strategic applications to mining patient data, in general, and community data, in particular. While significant gains can be obtained and have been noted at the organizational level of analysis, much attention has been given to the individual, where the focal points have centered on privacy and security of patient data. While the privacy debate is a salient issue, data mining (DM) offers broader community-based gains that enable and improve healthcare forecasting, analyses, and visualization.
Helligkeitsbasiertes Rechnersehen zur direkten Ermittlung raumlicherEigenschaften
Authors: An Luo
Venue:  (1993)

In this Ph.D. thesis a few of new methods are presented that reconstruct the spatial properties of a scene directly from grey images. These properties include the depth field, the optical flow, the surface gradient and the motion parameters. Based on the Bayesian method we investigate the computational theory deeply, with that the optimal estimation of the spatial properties can be achieved uniquely. In order to optimize the corresponding a-posteriori energy function globally, the new algorithms that use the multiresolution technique are developed und furtherly implemented. Under the common modeling, the different 3-D properties are estimated with the corresponding visual approaches, i.e. stereo technique, shape from motion (SFM) and shape from shading (SFS). Two important problem that exist in the field of computer vision and are neglected in most present methods, i.e. the discontinuities of visual fields and the occlusion, are here furtherly explored. In order to solve these problems satisfactorily, a simple effective modeling and a new cooperative bidirectional matching are used. The constraint of integrability under the perspective imaging geometry, which is often not allowed to be neglected, is here introduced for SFS at the first time. In order to increase the reliability and accuracy of the estimation, these visual approaches are strongly coupled or dynamically integrated according to Bayesian modeling. With this strategy the absolute motion parameters and the real depth field can be reliably estimated without ambiguity. Ammong all these methods only a unified process estimating the dense visual fields is running without pre- or postprocessing, so that the reliable extraction of features or the known correspondence of images is not necessary and the computational complexity for the complete representation of fields is moderate. Many examples of sythnetic and real scenes are given.
EXTRACTION OF BREAKS IN RECTILINEAR LAYOUTS BY PLANE SWEEPS (Master''s Thesis)
Authors: Jeffrey S. Rogenski
Venue:  (1995)

Inductive fault analysis seeks to improve the effectiveness of circuit testing by determining which faults are most likely to occur as the result of common manufacturing defects, and focusing testing efforts on these faults. In current circuit fabrication proocesses, the most common spot defects cause bridges and breaks. We present an efficient plane sweep algorithm for calculating the critical area of possible breaks in rectilinear circuit layouts. The algorithm has been integrated with an existing program, Carafe, that previously only performed extraction of likely bridges. Carafe was used to analyze the occurrence of breaks in benchmark circuits; the results of this analysis are presented.
Specifying Instructions'' Semantics Using CSDL (Preliminary Report)
Authors: Norman Ramsey, Jack W. Davidson
Venue:  (1997)

The Zephyr project is part of an effort to build a National Compiler Infrastructure, which will support research in compiling techniques and high-performance computing. Compilers work with source code, abstract syntax, intermediate forms, and machine instructions. By using high-level descriptions of the representations and semantics of these forms, we expect to be able to create compiler components that will be usable with different source languages, front ends, and target machines. To help deal with multiple machines, we are developing a family of Computer Systems Description Languages (CSDL) to describe properties that are relevant to the construction of compilers and other systems software. The languages describe properties of a machine''s instructions or its mutable state, or both. Of particular interest is the description of the semantics of instructions, i.e., their effects on the state of the machine. This report describes our preliminary design of Lambda-RTL, a CSDL language for specifying instructions'' semantics. We describe the effects of instructions using register transfer lists (RTLs). A register transfer list is a collection of assignments to locations, which represent registers, memory, and all other mutable state. We prescribe a form of RTLs that makes it explicit how to compute the values assigned and on what state the computation depends. The form also makes byte order explicit and provides for instructions whose effects may be undefined. Because our form of RTLs contains so much information, it is convenient for use by tools, but it would be tedious to write RTLs by hand. Lambda-RTL, which is based on the lambda-calculus and on register transfer lists, is a metalanguage designed to make it easier for people to write RTLs and to associate them with machine instructions. It enables us to omit substantial information from hand-written specifications; the Lambda-RTL translator infers the missing information and puts the resulting RTLs into canonical form. Lambda-RTL also provides a ``grouping'''' construct designed to help specify large groups of similar instructions. We are still designing Lambda-RTL. This report presents a short overview of Lambda-RTL, followed by examples. The examples include definitions of basic operators, which we believe will be useful for describing a wide variety of machines, as well as excerpts from descriptions of the SPARC and Pentium. We have chosen excerpts that illustrate features which are characteristic of these particular machines; for example, we show a model of SPARC register windows, and we show how Lambda-RTL can help manage the complexity of the Pentium instruction set. Both the machine descriptions and Lambda-RTL itself are under development, so this report is a snapshot of a work in progress. We issue it now to solicit feedback both on our overall approach and on the details of Lambda-RTL. Please send feedback by electronic mail to zephyr-investigators@virginia.edu.
Multimessage Multicasting with Forwarding
Authors: Teofilo F. Gonzalez
Venue:  (1996)

We consider Multimessage Multicasting over the $n$ processor complete (or fully connected) static network ($MM_{C}$) with Forwarding. We present an efficient algorithm that constructs for every degree $d$ problem instance a communication schedule with total communication time at most $2d$, where $d$ is the maximum number of messages that each processor may send (receive). Our algorithm consists of two phases. In the first phase a set of communications are scheduled to be carried out in $d$ time periods, and when these communications are performed the remaining problem becomes a multimessage unicasting problem of degree $d$. In the second phase we generate a communication schedule for this problem by reducing it to the Makespan Openshop Preemptive Scheduling problem which can be solved in polynomial time. The solution is the concatenation of the communication schedules for these two phases. Our centralized algorithms require all the communication information ahead of time. Applications where all of this information is readily available include iterative algorithms for solving linear equations, and most dynamic programming procedures. The Meiko CS-2 machine and in general computer systems with processors communicating via dynamic permutation networks whose basic switches can act as data replicators (e.g., $n$ by $n$ Benes network with 2 by 2 switches that can also act as data replicators) will also benefit from our results since the same schedules can be used for these systems.
Duals of Intuitionistic Tableaus
Authors: G. Criscuolo, R. Tortora
Venue:  (1977)

We present a dual version of the intuitionistic Beth tableaus with signed formulas introduced in Fitting $\mid9\mid$ proving their correctness and completeness with respect to Kripke models.
FAST: AN FPGA-BASED SIMULATION TESTBED FOR ATM NETWORKS
Authors: Dimitrios Stiliadis, Anujan Varma
Venue:  (1995)

Simulation of ATM switches and networks is a computationally demanding problem as compared to simulation of conventional packet-based networks, owing to the large number of cell events that need to be simulated in the former. To address this problem, we are developing a flexible hardware testbed for simulation of ATM-based networks. The testbed, called FAST (FPGA-based ATM simulation testbed), uses high-density field-programmable gate arrays (FPGAs) to allow implementation of the key simulation components such as traffic generators, switching fabric, buffer management, traffic scheduling, congestion control mechanisms, and statistics recording in hardware. In the first version of the testbed (FAST-1), each board consists of 13 Altera FLEX devices (including 4 multichip modules), providing a total of 336,000 usable gates. Each board can be used to simulate an ATM switch. Multiple boards may be interconnected to simulate large ATM networks. Software tools haven been developed for specifying the components of the underlying simulation model, such as the switch structure, traffic model, traffic scheduling algorithm, and congestion control mechanisms; synthesizing the specifications into the individual FPGAs; controlling and monitoring the simulation; and collecting and reporting statistics.
Eine Modulare Implementierung paralleler Algorithmen zur Bildverarbeitung undMustererkennung
Authors: Andreas Bieniek, Hans Burkhardt, Michael Nolle, Gerald Schreiber, Hanns Schulz-Mirbach
Venue:  (1995)

Eine Steigerung der Verarbeitungsgeschwindigkeit von Algorithmen der digitalen Bildverarbeitung und Mustererkennung ist auf Hardwareebene in gr erem Ma e nur durch den Einsatz parallel rechnender Prozessoren m glich. Gelingt es, die Algorithmen unter Beachtung von Skalierbarkeit, Portabilit t und Effizienz zu pararallelisieren, so wird ihr praktischer Einsatz auf Systemen unterschiedlicher Gr e und damit in einer an die Aufgabenstellung angepa ten Geschwindigkeit m glich. In unserem Beitrag berichten wir ber eine parallele Bildverarbeitungsbibliothek (PIPS), welche an der TU Hamburg-Harburg f r massiv parallele MIMD-Rechner mit verteiltem Speicher entwickelt wurde. Sie ist voll skalierf hig (d.h. alle Routinen passen sich zur Laufzeit an die Anzahl der vorhanden Prozessoren an) und sie enth lt mittlerweile ber 100 Anwendungen, welche mit hoher Effizienz implementiert wurden. Ein ebenfalls an der TU Hamburg-Harburg entwickeltes Mustererkennungs-Ver-fah-ren welches auf Grauwertinvarianten basiert und dessen parallele Implementierung im Bildverarbeitungssystem PIPS wird exemplarisch vorgestellt.
An Estelle-C Compiler for Automatic Protocol Implementation
Authors: Robin I Chan
Venue:  (1987)

Over the past few years, much experience has been gained in semi-automatic protocol implementation using an existing Estelle-C compiler developed at the University of British Columbia. However, with the continual evolution of the Estelle language, that compiler is now obsolete. The present study found substantial syntactic and semantic differences between the Estelle language as implemented by the existing compiler and that specified in the latest ISO document to warrant the construction of a new Estelle-C compiler. The result is a new compiler which translates Estelle as defined in the second version of the ISO Draft Proposal 9074 into the programming language C. The new Estelle-C compiler addresses issues such as dynamic reconfiguration of modules snd maintenance of priority relationships among nested modules. A run-time environment capable of supporting the new Estelle features is also presented. The implementation strategy used in the new Estelle-C compiler is illustrated by using the alternating bit protocol found in the ISO Draft Proposal 9074 document.
Finding Secret Messages in DNA Microdots
Authors: S. A. Jarvis, J. S. Mirsky, J. F. Peden, N. J. Saunders
Venue:  (2001)

A DNA microdot offers a novel way in which to communicate secret information. It is an extension of the more traditional microdot, a greatly reduced photograph of a secret document which replaced a full stop somewhere in an innocent-looking letter. The DNA microdot appears to be the secure modern alternative, exploiting the complexity of DNA in which a coded secret message is hidden. An enemy can only unlock the secret information by first knowing that an intercepted letter is impregnated with microdot DNA, and secondly by finding the message amongst a huge amount of background DNA used to mask the secret information. Using software developed to identify horizontally acquired DNA, we show that this apparently insurmountable task is in fact possible. With the increased speed of DNA sequencing, the information contained in the DNA microdot is far from secure.
An XML-based virtual patient records system for healthcare enterprises
Authors: Zhang Xiaoou, Pung Hung Keng
Venue: Enterprise information systems IV (2003)

With the advent of shared care, there is a need to integrate patient records which spread in disparate information systems. In this paper, the design and implementation of an XML-based Virtual Patient Records System, XVPRS, is described. It uses World Wide Web to consolidate patient data across multiple organizations. The system uses XML-encoded HL7 as the application level protocol between legacy systems and XML as the main information format in the system itself. XVPRS also demonstrates how to transmit and process a clinical document using CDA. Our experience in XVPRS shows that using XML as the primary information format not only simplifies the development of single information system but also facilitates information integration among enterprise systems.
Representing Knowledge About Words
Authors: Jane T Nutter
Venue:  (1989)

Most on-line lexicons contain only semantic information. Semantic information is usually stored elsewhere, in a form consistent with representation of the syntactic information. This paper reports on research toward developing a large on-line lexicon from machine-readable dictionaries, which contains both syntactic and semantic information in uniform style. The fundamental theory is that of one of the relational lexicon; we describe relational lexicons, discuss our extensions to the usual theory of relational lexicons, rehearse very quickly some of the relations we are dealing with, and show how information for some simple entries is stored.