ppxscal/embedding_network huggingface dataset:
Available Code for Image Processing
Authors: Hugh Sanderson
Venue:  (1993)

Over the years the CIIPS group has had many programmers working on many different algorithms and using many different machines, languages and operating systems, producing mountains of code. Most of which is not useless. In an attempt to make the code I''ve written useful to others, and so that something may live on long after I''m gone, this document presents some of my code in the hope that it will find a good home. This document also offers tips on how to use the code and how to get started on image processing. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Raven System
Authors: Donald Acton, Terry Coatta, Gerald Neufeld
Venue:  (1992)

This report describes the distributed object-oriented system, Raven. Raven is both a distributed operating system as well as a programming language. The language will be familiar to C programmers in that it has many constructs similar to the C programming language. Raven uses a simple, uniform object model in which all entities, at least conceptually, are objects. The object model supports classes for implementation inheritance and type checking. Both static and dynamic typing as well as static and dynamic method binding is supported. Object behavior is defined by the class of the object. The language is compiled (rather than interpreted) and supports several features that improve performance. Support also exists for parallel and distributed computing as well as persistent data. Raven is designed specifically for high-performance parallel and distributed applications. Note: The Raven System has undergone many changes since this report was published. The report acurately reflects the basic operating principles of Raven, but the syntactic details of Raven are no longer the same.
Understanding Design Patterns with Design Rationale Graphs
Authors: Baniassad Elisa L. A., Murphy Gail C., Schwanninger Christa
Venue:  (2002)

A Design Pattern presents a proven solution to a common design problem using a combination of informal text, diagrams, and examples. Often, to suitably describe an issue, the author of a Design Pattern must spread and repeat information throughout the Pattern description. Unfortunately, spreading the information can make it difficult for a reader to grasp subtleties in the design, leading to possible misuses of the Pattern. In this paper, we introduce the Design Rationale Graph (DRG) representation that connects and visualizes related concepts described in a Design Pattern. The localization of concept information is intended to help improve a readers understanding of a Design Pattern. Improved comprehension of a Pattern could aid the use of a Pattern during implementation, and the reading of code built upon the Pattern. In addition to describing the DRG representation, we present a tool we have built to support the semi-automatic creation of a DRG from Design Pattern text, and we report on a small study conducted to explore the utility of DRGs. The study showed that readers with access to a DRG were able to answer questions about the Pattern more completely and with more confidence than those given the Design Pattern alone.
USING PHYLOGENETIC MARKOV TREES TO DETECT CONSERVED STRUCTURE IN RNA MULTIPLE ALIGNMENTS (Masters Thesis)
Authors: Bradford Gulko
Venue:  (1996)

We describe a statistical method to determine if a pair of columns in a multiple alignment of a homologous family of RNA sequences shows evidence of being base paired. The method makes explicit use of a given phylogenetic tree for the sequences in the alignment. It is tested on a multiple alignment of 16S rRNA sequences with good results. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Constitutive error estimator for the control of contact problems involving friction
Authors: J. Ph. Combe, F. Louf, J. P. Pelle
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper, we propose an error estimator for unilateral contact problems involving friction. The use of a bipotential to formulate the constitutive relation on the contact zone leads to a very straightforward construction of an error in constitutive relation estimator for this kind of problem. Its implementation is described in detail for the case of two elastic bodies and two 2D examples are presented. An error indicator which enables one to estimate the quality of the numerical solution of the nonlinear problem is proposed.
A Fast Data Compression Method
Authors: Samuel T. Chanson, Jee F Pang
Venue:  (1983)

This paper presents a new data compression scheme. The scheme uses both fixed and variable length codes and gives a compression ratio of about one-third for English text and program source files (without leading and trailing blank suppression). This is very respectable compared to existing schemes. The compression ratio for numbers ranges from 52\% for numbers in scientific notation to 65\% for integers. The major advantage of the scheme is its simplicity. The scheme is at least six times faster than Huffman''s code and takes about half the main memory space to execute.
Automating Knowledge Engineering
Authors: Christopher J.S. deSilva, Mike Alder, Yianni Attikiouzel
Venue:  (1990)

This paper considers the abstract and practical issues invoved in automatically generating higher level descriptions of data structures from lower levels. The applications are restricted to one (string) and two (pixel array) dimensional data structures and are incomplete.
Gossip versus Deterministic Flooding: Low Message Overhead and High Reliability for Broadcasting on Small Networks
Authors: Meng Lin, Keith Marzullo, Stefano Masini
Venue:  (1999)

Rumor mongering (also known as gossip) is an epidemiological protocol that implements broadcasting with a reliability that can be very high. Rumor mongering is attractive because it is generic, scalable, adapts well to failures and recoveries, and has a reliability that gracefully degrades with the number of failures in a run. In this paper we present a protocol that superficially resembles rumor mongering but is deterministic. We show that this new protocol has most of the same attractions as rumor mongering. The one attraction that rumor mongering has - namely graceful degradation - comes at a high cost in terms of the number of messages sent. We compare the two approaches both at an abstract level and in terms of how they perform in an Ethernet.
MULTI-LEVEL SPECTRAL HYPERGRAPH PARTITIONING WITH ARBITRARY VERTEX SIZES
Authors: Jason Y. Zien, Martine Schlag, Pak K. Chan
Venue:  (1996)

This paper presents a new spectral partitioning formulation which directly incorporates vertex size information. The formulation results in a generalized eigenvalue problem, and this problem is reduced to the standard eigenvalue problem. Experimental results show that incorporating vertex sizes into the eigenvalue calculation produces results that are 50% better than the standard formulation in terms of scaled ratio-cut cost, even when a Kernighan-Lin style iterative improvement algorithm taking into vertex sizes is applied as a post-processing step. The standard spectral partitioning formulation is impractical for use in multi-level partitioning schemes since it requires a contraction method that produces nearly-equal-size clusters. To evaluate the new method for use in multi-level partitioning, we combine the partitioner with a multi-level bottom-up clustering algorithm and iterative refinement. Experimental results show that our new spectral algorithm is more effective than the standard spectral formulation and other partitioners in the multi-level partitioning of hypergraphs.
The Potential Costs and Benefits of Long-term Prefetching for ContentDistribution
Authors: Arun Venkataramani, Praveen Yalagandula, Ravindranath Kokku, Sadia Sharif, Mike Dahlin
Venue:  (2001)

This paper examines the costs and potential benefits of long-term prefetching for content distribution. In contrast with traditional short-term prefetching, in which caches use recent access history to predict and prefetch objects likely to be referenced in the near future, long-term prefetching uses long-term steadystate object access rates and update frequencies to identify objects to replicate to content distribution locations. Compared to demand caching, long-term prefetching increases network bandwidth and disk space costs but may benefit a system by improving hit rates. Using analytic models and trace-based simulations, we examine several algorithms for selecting objects for long-term prefetching. We find that although the web''s Zipf-like object popularities makes it challenging to prefetch enough objects to significantly improve hit rates, systems can achieve significant benefits at modest costs by focusing their attention on long-lived objects.
On the Separation of Two Matrices
Authors: Jim M. Varah
Venue:  (1977)

The sensitivity of the solution $X$ to the matrix equation C$ is primarily dependent on the quantity sep$(A,B)$ introduced by Stewart in connection with the resolution of invariant subspaces. In this paper, we discuss some properties of sep$(A,B)$, give some examples to show how very small it can be for seemingly harmless X^{(k)}B + C$ for solving the matrix equation.
Introduction to Logic Programming
Authors: Krzysztof R. Apt
Venue:  (1988)

We provide a systematic and self-contained introduction to the theory of logic programming.
Abbildung einer TROLL-Spezifikation auf das relationale Datenbankmanagmentsystem ORCALE 7 unter Ausnutzung
Authors: Uwe Scholz
Venue:  (1995)

Kurzfassung: TROLL ist eine formale objektorientierte Spezifikations- sprache zum konzeptionellen Entwurf von Informations- systemen. Mit ihrer Hilfe konnen sowohl Struktur als auch Verhalten des Informationssystems beschrieben werden. Um die Adaquatheit des spezifizierten Informationssystems nachzuweisen, ist eine Validierung durchzufuhren. Dazu kann ein Prototyp generiert werden. Dieser Prototyp mu? seine Daten persistent in einer Datenbank abspeichern. Obwohl die Nutzung einer objektorientierten Entwurfs- methode die Anwendungeines objektorientierten Daten- bankmanagementsystems zur Realisierung der Persistenz nahelegt, entscheidet sich der Anwender oft aufgrund der Marktrelevanz und des Entwicklungsstandes fur ein relationales System wie z.B. ORACLE. Durch diese Ent- scheidung mu? die Abbildungslucke zwischen objektorien- tierter Spezifikation und relationalem System geschlossen werden. In der vorliegenden Arbeit wurden die Moglichkeiten der Abbildung der Datenstrukturen einer TROLL-Spezifikation auf das relationale Datenbankmanagementsystem ORACLE Version 7 untersucht. Dabei ist die Abbildung von elemen- taren TROLL-Datentypen, Typkonstruktoren, Objektklassen und die Moglichkeiten der Abbildung erweiterter Konzepte von TROLL wie z.B. Relationships, Rollen, Referenzen und Sichten beschrieben worden.
Laguerre Spectral Coefficients as features in pattern recognition.
Authors: Arkell
Venue:  (1994)

Abstract unavailable. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Edge-Packing by Isomorphic Subgraphs
Authors: John P Vergara, Lenwood S. Heath
Venue:  (1991)

Maximum G Edge-Packing (EPackG) is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. This paper investigates the computational complexity of edge-packing for planar guests and planar hosts. Edge-packing is solvable in linear time when G is a 2-path and H is arbitrary, or when H is outerplanar and G is either a 3-cycle or a k-star. Edge-packing is solvable in polynomial time when both G and H are trees. Edge-packing is NP-complete when H is planar and G is either a cycle or a tree with ≥3 edges. The approximability of EPackG is considered. A strategy for developing polynomial-time approximation algorithms for planar hosts is exemplified by a linear-time approximation algorithm for EPack k-star that finds an edge-packing of size at least one-half optimal. Finally, EPackG is shown not to be in the complexity class Max SNP, though it is Max SNP-hard for G a k-star, ≥3.
Design of Composite Laminates by a Genetic Algorithm with Memory
Authors: N. Kogiso, Layne T. Watson, Z. Gurdal, Robert T. Haftka, S. Nagendra
Venue:  (1994)

This paper describes the use of a genetic algorithm with memory for the design of minimum thickness composite laminates subject to strength, buckling and ply contiguity constraints. A binary tree is used to efficiently store and retrieve information about past designs. This information is used to construct a set of linear approximations to the buckling load in the neighborhood of each member of the population of designs. The approximations are then used to seek nearby improved designs in a procedure called local improvement. The paper demonstrates that this procedure substantially reduces the number of analyses required for the genetic search. The paper also demonstrates that the use of genetic algorithms helps find several alternate designs with similar performance, thus giving the designer a choice of alternatives.
Memory Reference Reuse Latency: Accelerated Sampled Microarchitecture Simulation
Authors: Jr Haskins, K. Skadron
Venue:  (2002)

This paper explores techniques for speeding up sampled microprocessor simulations by exploiting the observation that of the memory references that precede a sample, references that occur nearest to the sample are more likely to be germane during the sample itself. This means that accurately warming up simulated cache and branch predictor state only requires that a subset of the memory references and control-flow instructions immediately preceding a simulation sample need to be modeled. Our technique takes measurements of the memory reference reuse latencies (MRRLs) and uses these data to choose a point prior to each sample to engage cache hierarchy and branch predictor modeling. By starting cache and branch predictor modeling late in the pre-sample instruction stream, rather than modeling cache and branch predictor interactions for all pre-sample instructions we are able to save the time cost of modeling them. This savings reduces overall simulation running times by an average of 25%, while generating an average error in IPC of less than 0.7%.
Similarity-based Word Sense Disambiguation
Authors: Y. Karov, S. Edelman
Venue:  (1996)

We describe a method for automatic word sense disambiguation using a text corpus and a machine-readable dictionary (MRD). The method is based on word similarity and context similarity measures. Words are considered similar if they appear in similar contexts; contexts are similar if they contain similar words. The circularity of this definition is resolved by an iterative, converging process, in which the system learns from the corpus a set of typical usages for each of the senses of the polysemous word listed in the MRD. A new instance of a polysemous word is assigned the sense associated with the typical usage most similar to its context. Experiments show that this method performs well, and can learn even from very sparse training data.
Automatically Downloading Images to Improve Web Transfer Times
Authors: Girish Chandranmenon, George Varghese
Venue:  (2001)

Advances in technology have led to the introduction of Gigabit and even Terabit links. However, latencies are limited by the speed of light, In this paper we propose a technique called Auto Inline Download which enables servers and clients to transfer a web page and its embedded data (such as images, applets, etc.,) with just one GET request. This saves overall retrieval time by eliminating the delays associated with buffered request processing and saves a round trip if the the inline data reference is in the last segment of the data transfer for the web page itself. During our experiments, we found that with the current segment size of 512 bytes, TCP will take at least 7 round trip times to transfer an average web page. This implies that even if we have infinite speed links, TCP slow start will limit the transfer of a web page to at least 490msec assumung a coast-coast latenct of 70 msec.
Modelling of the structural fire response of steel framed buildings
Authors: A. Y. Elghazouli, B. A. Izzuddin
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

In this paper, computational numerical models constructed to simulate the response of steel-framed buildings with composite floors are described, and the results are compared with findings from tests undertaken on full-scale structures. The analysis is carried out using a finite element program which accounts for both geometric and material nonlinearities, and which includes temperature-dependent constitutive models for steel and concrete materials. The approaches used to represent the various structural details are discussed, and the procedure employed for incorporating the experimentally-measured temperature profiles and histories is described. A comparison between the numerical results and experimental measurements for several fire tests illustrate the reliability of the modelling tool and approaches. It is also shown that the extent of the structural models may be considerably reduced provided that representative boundary conditions are utilised, leading to improved computational efficiency. Furthermore, close examination of the numerical results provides an insight into the complex interactions that occur in a structure at elevated temperatures.
Parallel Discrete Event Simulation: A Modeling MethodologicalPerspective
Authors: Ernest H. Page, Richard E. Nance
Venue:  (1994)

The field of parallel discrete event simulation is entering a period of self-assessment. Fifteen years of investigation has seen great strides in techniques for efficiently executing discrete event simulations on parallel and distributed machines. Still, the discrete event simulation community at large has failed to recognize much of these results. One reason for this is perhaps a disagreement in the focus and purpose of the parallel discrete event simulation research community (primarily computer scientists) and the discrete event simulation community (a widely diverse group including operations researchers, statisticians, as well as computer scientists). An examination of the parallel discrete event simulation problem from a modeling methodological perspective illustrates some of these differences and reveals potentials for their resolution.
A study on the effect of static and cyclic loading and linear and non-linear material properties in the analysis of flexible pavements by finite element modelling
Authors: M. N. S. Hadi, B. C. Bodhinayake
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A research study is being undertaken to incorporate the realistic material properties of the pavement layers and the moving traffic load, in the analysis of flexible pavements, using the finite element theory. As a preliminary step taken herein in this direction, a pavement structure where field measurements have been carried out when subjected to a cyclic loading, is selected and modelled as a finite element model. The analysis is being carried out using the finite element computer package ABAQUS/STANDARD, when this pavement model is subjected to static and cyclic loading while considering the linear and non-linear material properties of the pavement layers. The results indicate that displacements under cyclic loading when non-linear materials are present, are the closest to field measured deflections.
Queue Layouts and Staircase Covers of Matrices
Authors: Marc Abrams, Alan Batongbacal, Randy Ribler, Devendra Vazirani, Lenwood S. Heath, Sriram V. Pemmaraju
Venue:  (1994)

A connection between a queue layout of an undirected graph and a staircase cover of its adjacency matrix is established. The connection is exploited to establish a number of combinatorial results relating the number of vertices, the number of edges, and the queue number of a queue layout. The staircase notion is generalized to that of an (h,w)- staircase, and an efficient algorithm to optimally cover a matrix with (h,w)- staircases is presented. The algorithm is applied to problems of monotonic subsequences and to the maxdominance problem of Atallah and Kosaraju.
Automatic Mapping of Parallel Programs onto Processor Networks
Authors: Jurgen W. Meyer
Venue:  (1992)

Many heuristics have been created to solve the mapping problem. A set of mapping heuristics has been integrated into a program development system, such that mapping becomes an automatic step of program generation. The system serves as a basis for development, analysis, and comparison of mapping heuristics as well as as programs development tool with selectable mapping heuristics for program configuration. The system is implemented on a flexible transputer based parallel computer, which is able to emulate a large variety of problems for mapping heuristics. Runtime monitoring of configured programs allows a detailed evaluation of mapping heuristics. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Mesh Independence Principle for Nonlinear Equations on Hilbert Spaces by Preconditioning
Authors: C. Popa
Venue:  (1997)

Starting with the nonlinear system of equations obtained after a finite element discretization of a nonlinear boundary value problem on a real separable Hilbert space, we precondition it by an incomplete Cholesky decomposition of the gram matrix of the finite element basis functions.Thus, under some natural assumptions on the discretization and if the incomplete Cholesky decomposition satisfies a special property (which is obviously true at least in the well known and used case of a complete decomposition) we prove that the family of these preconditioned nonlinear discrete systems associated to our problem,satisfies the Mesh Independence Principle.In the last section of the paper we present numerical examples which confirm our theoretical results from the previous ones. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Partial Security Policies to Support Timeliness in Secure Real-Time Databases
Authors: Sang H. Son, Craig Chaney, Norris P. Thomlinson
Venue:  (1998)

Conflicts in database systems with both real-time and security requirements can be unresolvable. We address this issue by allowing a database system to provide partial security in order to improve real-time performance when necessary. Systems that are partially secure allow potential security violations such as covert channel use at certain situations. We present the idea of requirement specification that enables the system designer to specify important properties of the database at an appropriate level. To help the designer, a tool can process the database specification to find unresolvable conflicts, and to allow the designer to specify the rules to follow during execution when those conflicts arise. We discuss several partial security policies and compare their performance in terms of timeliness and potential security violations.