ppxscal/embedding_network huggingface dataset:
A Kinematic Model for Collision Response
Authors: Jason Harrison, David Forsey
Venue:  (1994)

One aspect of traditional 3D animation using clay or plasticine is the ease with which the object can be deformed. Animators take for granted the ability to interactively press complex objects together. In 3D computer animation, this ability is severely restricted and any improvement would drastically increase the range and style of animations that can be created within a production environment. This paper presents a simple, fast, geometric approach to controlling the nature, extent and timing of the surface deformations arising from the interpenetration of kinematically controlled animated objects. Rather than using dynamic simulations, which are difficult to configure, code, and control, the algorithm presented here formulates collision response kinematically by moving points on a multiresolution surface towards goal points at a certain rate. This new multi-resolution approach to deformation provides control over the response of the surface using a small number of parameters that determine how each level in the multi-resolution representation of the surface reacts to the interpenetration. The deformations are calculated in linear time and space proportional to the number of points used to define the surface.
Lateral buckling analysis of thin-walled composite I-section beams
Authors: J. Lee, S. Lee
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

Lateral buckling of a laminated composite beam with I-section is studied. A general analytical model applicable to the lateral buckling of a I-section composite beam subjected to various types of loadings is developed. This model is based on the classical lamination theory, and accounts for the material coupling for arbitrary laminate stacking sequence configuration and various boundary conditions. The effects of the location of applied loading on the buckling capacity are also included in the analysis. A displacement-based one-dimensional finite element model is developed to predict critical loads and corresponding buckling modes for a thin-walled composite beam with arbitrary boundary conditions. Numerical results are obtained for thin-walled angle-ply laminated composites under central point load, uniformly-distributed load, and pure bending. The effects of fiber orientation, location of applied load, and types of loads on the critical buckling loads are parametrically studied.
The Elevation Pyramid
Authors: Clifford A. Shaffer, Dave B. Boldery
Venue:  (1990)

The elevation pyramid, a pyramid-based representation for storing gridded elevation data, is described. Associated with the root of the pyramid is the corresponding grid''s minimum elevation and range. The elevation value for a specified grid pixel is calculated by transversing a path from the pyramid root to the corresponding leaf node. As the transversal proceeds, the minimum and range values are refined by interpreting the codes stored at each node along the path. At the leaf level, the final minimum value equals the associated elevation value. We present results from experiments using 2,3 and 4 bit code words. For the two bit code, since the total number of nodes in the pyramid is 4/3 the number of pixels required for the bottom level of the pyramid, the amortized storage cost is less than 3 bits per pixel, regardless of vertical resolution. This corresponds to a 5:1 compression rate for a 16 bit gridded elevation data. The elevation pyramid is most appropriate for efficient secondary storage archival, such as on a CD-ROM. It allows efficient retrieval of complete elevation data from any sub-region, at multiple scales, within the entire elevation database. This is a lossless encoding when the difference between sibling pixels is not "too great." Rapid changes in elevation between adjacent pixels will be smoothed. Most data sets contain relatively few pixels that cannot be encoded by the techniques studied. Such pixels can be efficiently stored in an auxiliary table if perfec reconstruction is required. "Elevation" pyramids can be used to store any 2D surface or 3D density data.
Formalizing Attribution by Default
Authors: Paul C. Gilmore
Venue:  (1987)

Attribution by default occurs when, in the absence of information to the contrary, an entity is assumed to have a property. The provision of information to the contrary results in the withdrawal of the attribution. It has been argued that classical logic cannot formalize such commonsense reasoning and that the development of a nonmonotonic logic is necessary. Evidence is offered in this note that this is not the case for some important defaults.
Dynamic Access Ordering for Symmetric Multiprocessors
Authors: Sally A. McKee
Venue:  (1994)

Memory bandwidth is rapidly becoming the performance bottleneck in the application of high performance microprocessors to vector-like algorithms, including the "Grand Challenge" scien- tific problems. Caching is not the sole solution for these applications due to the poor temporal and spatial locality of their data accesses. Moreover, the nature of memories themselves has changed. Achieving greater bandwidth requires exploiting the characteristics of memory components "on the other side of the cache" - they should not be treated as uniform access-time RAM. This paper describes the use of hardware-assisted access ordering in symmetric multiprocessor (SMP) systems. Our technique combines compile-time detection of memory access patterns with a memory subsystem (called a Stream Memory Controller, or SMC) that decouples the order of requests generated by the computational elements from that issued to the memory system. This decoupling permits the requests to be issued in an order that optimizes use of the memory system. Our simulations indicate that SMP SMC systems can consistently deliver nearly the full system bandwidth.
Parallel Solution of Generalized Symmetric Tridiagonal Eigenvalue Problems on Shared Memory Multiprocessors
Authors: Calvin J. Ribbens, Christopher A. Beattie
Venue:  (1992)

This paper describes and compares two methods for solving a generalized eigenvalue problem , where T and S are both real symmetric and tridiagonal, and S is positive definite, and the target architecture is a shared memory multiprocessor. One method can be viewed as a generalization of the treeql algorithm of Dongarra and Sorensen [1987]. The second algorithm is a straightforward parallel extension of the bisection/inverse iteration algorithm treeps of Lo, Philippe, and Sameh [1987]. The two methods are representative of families of algorithms of quite different character. We illustrate and compare sequential and parallel performance of the two approaches with numerical examples.
Stability and Postbuckling of a Platform with Flexible Legs Resting on a Slippery Surface
Authors: Thacker William I., Wang C.Y., Watson Layne T.
Venue:  (1997)

A rigid platform is supported by thin elastic legs. The legs are able to slide on the ground as they deform. The governing equations for large deformations are formulated and solved numerically by homotopy and quasi-Newton methods. Nonlinear phenomena such as nonuniqueness are found. A global critical load for nonlinear stability is presented.
Unbundling Active Functionality
Authors: Stella Gatziu, Arne Koschel, Guenter Bueltzingsloewen, Hans Fritschi
Venue:  (1997)

New application areas or new technical innovations expect from database management systems more and more new functionality. However, adding functions to the DBMS as an integral part of them, tends to create monoliths that are difficult to design, implement, validate, maintain and adapt. Such monoliths can be avoided if one configures DBMS according to the actually needed functionality. In order to identify the basic functional components for the configuration the current monoliths should be broken up into smaller units, or in other words they could be "unbundled". In this paper we apply unbundling to active database systems. This results in a new form of active mechanisms where active functionality is no longer an integral part of the DBMS functionality. This allows the use of active capabilities with any arbitrary DBMS and in broader contexts. Furthermore, it allows the adaption of the active functionality to the application profile. Such aspects are crucial for a wide use of active functionality in real (database or not) applications.
A cable and membrane pseudo stiffness implementation
Authors: J. Muylle, B. H. V. Topping
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

This paper describes how a pseudo-stiffness approach may be used to simulate bending stiffness in an explicit transient dynamic analysis of cable-membrane structures. Implementaion details of the method are included with some examples. These examples demonstrate that the bending stiffness affects the simulations of these structures.
Towards an Organizational Model of Attitude Change
Authors: Luis Almeida Costa, João Amaro De Matos
Venue: Computational Mathematical Organization Theory (2002)

Building on the growing literature that views organizations as complex adaptive systems, this paper proposes a general model to analyze the relationship between organizational context and attitudes. In particular, we focus on how the system of formal and informal communication channels that characterize an organization and the timing of information flows affect the dynamic process of attitude change. We also use a stylized version of the model to illustrate how the general framework is able to generate insights that are relevant to particular situations.
The Semantics of TLA on the PVS Theorem Prover
Authors: M. Wahab
Venue:  (1996)

An implementation of Lamport''s Temporal Logic of Actions (TLA) on a higher order logic theorem prover is described. TLA is a temporal logic, for which a syntax and semantics are defined, based on an action logic which is represented by higher order functions. The temporal logic includes quantifiers for variables with constant values and for variables whose values change over time. The semantics of the latter depend on an auxiliary function which cannot be defined by primitive recursion and an alternative is given based on the Hilbert e operator. 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
A Multi-HMM Isolated Word Recognizer
Authors: Yaxin Zhang, Christopher J.S. deSilva, Roberto Togneri, Mike Alder, Yianni Attikiouzel
Venue:  (1992)

A multi-HMM speaker-independent isolated word recognition system is described. In this system,three vector quantization methods are used for the classification of speech space. This multi-HMM system results in an improvement of about 50 per cent in the error rate in comparison to the single
VOTING WITH REGENERABLE VOLATILE WITNESSES
Authors: Darrell D. E. Long, Jehan Paris
Venue:  (1990)

Voting protocols ensure the consistency of replicated objects by requiring all read and write requests to collect an appropriate quorum of replicas. We propose to replace some of these replicas by *volatile witnesses* that have no data and require no stable storage, and to regenerate them instead of waiting for recovery. The small size of volatile witnesses allows them to be regenerated much easier than full replicas. Regeneration attempts are much more likely to succeed since volatile witnesses can be stored on diskless nodes. We show that under standard Markovian assumptions two full replicas and one regenerable volatile witness managed by a two-tier dynamic voting protocol provide a higher data availability than three full replicas managed by majority consensus voting or optimistic dynamic voting provided site failures can be detected significantly faster than they can be repaired.
Massively Time-Parallel, Approximate Simulation of Loss QueueingSystems
Authors: Jain J. Wang, Marc Abrams
Venue:  (1994)

A time-parallel simulation obtains parallelism by partitioning the time domain of the simulation. An approximate time-parallel simulation algorithm named GG1K is developed for acyclic networks of loss FCFS G/G/1/K queues. In the first phase, a similar system (i.e., a G/G/1/infinity queue) is simulated using the GLM algorithm. Then the resultant trajectory is transformed into an approximate G/G/1/K trajectory in the second phase. The closeness of the approximation is investigated theoretically and experimentally. Our results show that the approximation is highly accurate except when K is very small (e.g., 5) in certain models. The algorithm exploits unbounded parallelism and can achieve near-linear speedup when the number of arrivals simulated is sufficiently large.
Constancy and Similarity
Authors: R. Basri, D. Jacobs
Venue:  (1996)

Pizlo, Rosenfeld, and Weiss [6] suggest that people perceive two 2-D shapes as the same (i.e., there is shape constancy) when one shape might be a perspective image of the other. We argue that this hypothesis is both too broad and too restrictive. Their view is too broad because, as we show, two such images can appear quite different when there is significant perspective distortion. Their view is too restrictive because factors such as context and the complexity of the shapes compared can play a role in judgements of shape constancy. Moreover, Pizlo et al.''s formulation is asymmetric in requiring that one of the images be considered the model which produces the other. One can consider removing this asymmetry by judging shapes as the same when they could be two perspective views, taken with the same camera, of a third planar shape. We show that this is true if and only if the images are projectively equivalent. However, Pizlo et al.&#x00A0;have convincingly rejected projective equivalence as a model of shape constancy.
Solving Diagnostic Problems using Extended Truth Maintenance Systems
Authors: Gregory M. Provan
Venue:  (1988)

We describe the use of efficient, extended Truth Maintenance Systems (TMSs) for diagnosis. We show that for complicated diagnostic problems, existing ATMSs need some method of ranking competing explanations and pruning the search space in order to maintain computational efficiency. We describe a specific implementation of an ATMS for efficient problem solving that incorporates the full Dempster Shafer theory in a semantically clear and efficient manner. Such an extension allows the Problem Solver to rank competing solutions and explore only the ``most likely'''' solutions. We also describe several efficient algorithms for computing both exact and approximate values for Dempster Shafer belief functions.
Predicting the Cache Miss Ratio of Loop-Nested Array References
Authors: J. S. Harper, D. J. Kerbyson, G. R. Nudd
Venue:  (1997)

The time a program takes to execute can be massively affected by the efficiency with which it utilizes cache memory. Moreover the cache-miss behavior of a program can be highly unpredictable, in that small changes to input parameters can cause large changes in the number of misses. In this paper we present novel analytical models of the cache behavior of programs consisting mainly of array operations inside nested loops, for direct-mapped caches. The models are used to predict the miss-ratios of three example loop nests; the results are shown to be largely within ten percent of simulated values. A significant advantage is that the calculation time is proportional to the number of array references in the program, typically several orders of magnitude faster than traditional cache simulation methods.
END-TO-END PERFORMANCE PREDICTION FOR THE INTERNET
Authors: Richard A. Golding
Venue:  (1992)

Many applications designed for wide-area systems use replication to provide a service at multiple locations. From which site should a client choose to obtain service? A client can specify its needs in terms of communication latency, bandwidth, or error rate. This specification must be matched against the expected performance available from each site. I present the results of two experiments that measured end-to-end performance, and discuss how the results can be used for prediction. (work in progress)
Rapid Secure Development. Ein Verfahren zur Definition einesInternet-Sicherheitskonzeptes
Authors: D. Damm, Ph Kirsch, Th Schlienger, St Teufel, H. Weidner, U. Zurfluh
Venue:  (1999)

Die Nutzung von Online-Diensten des Internet wird fuer immer mehr Unternehmen zu einem wichtign Geschaefts- und Werbeinstrument. Mit der zunehmenden kommerziellen Nutzung gewinnen auch Sicherheitsaspekte im Internet zunehmend an Bedeutung. Obwohl viele Loesungen zu einzelnen Sicherheitsproblemen existieren, werden diese in der Praxis kaum umgesetzt. Grund dafuer sind die Schwierigkeiten bei der Auswahl der einzelnen Sicherheitsmassnahmen und ihre Einbettung in die organisatorischen Ablaeufe eines Unternehmens. Rapid Secure Development (RSD) ist ein Verfahren zur Konzeption eines gesicherten Internet- Anschlusses fuer kleinere und mittlere Unternehmen. Es fuehrt den Benutzer in fuenf Schritten von der Definition der Internet- Nutzungsszenarien ueber Auswahl von Internet-Diensten und Gefahrenanalyse bis hin zur Auswahl und Realisierung von Sicherheitsmassnahmen. Das Verfahren entstand als Resultat des SPP- IuK "Sichere Nutzung von Online-Diensten" (SINUS). Neben dem eigentlichen Verfahren beinhaltet dieser Bericht eine Einfuehrung in das Informationssicherheitsmanagement und der Internet-Technologie. Im Anhang werden einzelne Sicherheitsmassnahmen, insbesondere der im SINUS- Projekt entstandene Firewall-Prototyp, naeher beschrieben. Am Ende wird das Verfahren anhand eines (fiktiven) Beispiels exemplarisch durchgefuehrt.
A quality management tool for a public-private partnership highway project
Authors: J. Rankin, A. J. Christian, B. Lundrigan
Venue: Proceedings of the eighth international conference on The application of artificial intelligence to civil and structural engineering computing (2001)

A software application of a Quality Management Tool (QMT) was designed and developed to support the information management needs of the Maritime Road Development Corporation's (MRDC) quality management system for a $650 million (Canadian) highway project. This paper describes the project environment and application of the QMT from the perspectives of function, process, data and interface. As a web based collaborative project management tool, the QMT demonstrates a practical application, for the construction industry, implementing emerging technologies. The QMT supports MRDC's contractual obligation to demonstrate the effectiveness of its quality management. Although developed for a large highway project, the ultimate target for the QMT is small to medium sized construction companies.
Character Animation using Hierarchical B-Splines
Authors: David R. Forsey
Venue:  (1991)

The challenge of building and animating computer generated human and animal figures is complicated by the need to smoothly and realistically control the deformation of the surface around the articulations of the underlying skeleton. This paper reviews approaches to surface modelling for character animation and describes a geometric (as apposed to physically-based) approach to character modelling using an extension to the hierarchical B-spline. This techinique provides differential attachment of the surface to the skeleton and allows multi-resolution control of surface deformation during animation. The attachment mechanism is simple, easy to use, inexpensive, extensible and can drastically reduce the effort required to animate a surface. The techniques introduced are illustrated using examples of human and animal forms.
The Isoperimetric Number of d-dimensional k-ary Arrays
Authors: M. C Azizoglu, Omer Egecioglu
Venue:  (1998)

The d-dimensional k-ary array $A_k^d$ is the k-fold Cartesian product graph of the path $P_k$ on k vertices. We show that the (edge) isoperimetric number of $A_k^d$ is given by $i(A_k^d)=i(P_k) = {1}/{\lfloor \frac{k}{2} \rfloor}$ for all k and d, and identify the cardinalities and the structure of the isoperimetric sets. For k odd, the cardinalities of the isoperimetric sets are $(k^d -1)/2, (k^d -k)/2, \ldots ,(k^d-k^{d-1})/2$, whereas every isoperimetric set in $A_k^d$ has cardinality $k^d /2$ when k is even.
Process Calculus and Parallel Object-oriented Programming Languages
Authors: D. J. Walker
Venue:  (1993)

Techniques for giving simple accounts of the semantics of parallel object-oriented programming languages are illustrated through a study of the language pobl. A two-level operational semantics is given in which the global transitions of a configuration are derived in a simple way from labelled transitions describing the possible actions of its constituent objects. A second semantics by translation to a fragment of the Higher-Order pi-calculus is presented. A close correspondence between the semantics is described. 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
Similarity Metric Learning for a Variable-Kernel Classifier
Authors: David G. Lowe
Venue:  (1993)

Nearest-neighbour interpolation algorithms have many useful properties for applications to learning, but they often exhibit poor generalization. In this paper, it is shown that much better generalization can be obtained by using a variable interpolation kernel in combination with conjugate gradient optimization of the similarity metric and kernel size. The resulting method is called variable-kernel similarity metric (VSM) learning. It has been tested on several standard classification data sets, and on these problems it shows better generalization than back propagation and most other learning methods. An important advantage is that the system can operate as a black box in which no model minimization parameters need to be experimentally set by the user. The number of parameters that must be determined through optimization are orders of magnitude less than for back-propagation or RBF networks, which may indicate that the method better captures the essential degrees of variation in learning. Other features of VSM learning are discussed that make it relevant to models for biological learning in the brain.
Process Identification in THOTH
Authors: David R. Cheriton
Venue:  (1979)

A scheme is presented for the identification of processes in a minicomputer operating system. This scheme was designed and implemented as part of the development of the Thoth operating system. The scheme is efficient in time and space as well as exhibiting a reasonable lower bound on the minimum recycle time for process identifiers.
Semantics, Consistency and Query Processing of Empirical Deductive Databases
Authors: Raymond T. Ng
Venue:  (1994)

In recent years, there has been growing interest in reasoning with uncertainty in logic programming and deductive databases. However, most frameworks proposed thus far are either non-probabilistic in nature or based on subjective probabilities. In this paper, we address the problem of incorporating empirical probabilities -- that is, probabilities obtained from statistical findings -- in deductive databases. To this end, we develop a formal model-theoretic basis for such databases. We also present a sound and complete algorithm for checking the consistency of such databases. Moreover, we develop consistency-preserving ways to optimize the algorithm for practical usage. Finally, we show how query answering for empirical deductive databases can be carried out. {\bf Keywords:} deductive databases, empirical probabilities, model semantics, constraint satisfaction, optimizations, query answering