ppxscal/embedding_network huggingface dataset:
Representation and extraction of volumetric attributes using trivariate splines: a mathematical framework
Authors: William Martin, Elaine Cohen
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

Our goal in this paper is to leverage traditional strengths from the geometric design and scientific visualization communities to produce a tool valuable to both. We present a method for representing and specifying attribute data across a trivariate NURBS volume. Some relevant attribute quantities include material composition and density, optical indices of refraction and dispersion, and data from medical imaging. The method is independent of the granularity of the physical geometry, allowing for a decoupling of the resolution of the carried data from that of the volume. Volume attributes can be modeled or fit to data. A method is presented for efficient evaluation of trivariate NURBS. We incorporate methods for data analysis and visualization including isosurface extraction, planar slicing, volume ray tracing, and optical path tracing, all of which are grounded in refinement theory for splines. The applications for these techniques are diverse, including such fields as optics, fluid dynamics, and medical visualization.
A system organization for resource allocation
Authors: D. M. Dahm, T. H. Gerbstadt
Venue: Communications of the ACM (1967)

This paper introduces a system for resource management using the concepts of &ldquo;process,&rdquo; &ldquo;facility,&rdquo; and &ldquo;event.&rdquo; Except for the processor no attempt has been made to give serious suggestions for the policy to be followed for resource allocation. However, a basic framework is provided in which a system analyst can express solutions to resource management problems. The paper is divided into a tutorial presentation, a description of the system primitives, and a small collection of examples of the use of the primitives.
Three dimensional threaded fastener meshing algorithm
Authors: Paul Kinney, Dave Strenski
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

Understanding the stresses in the root of a thread of a bolt has never been easy. Ideally one would like to put a strain gage right at the root and measure them directly, but the placement of the gage and its wires are impossible without changing the insitu environment. Engineers then turned to analytical models, but soon discovered that two dimensional models where not giving the correct results because the geometry is not axis symmetric and three dimensional models where too difficult to mesh with today's CAD tools. A team consisting of Ford engineers and computer programers developed a program that will automatically generate a full three dimensional model of a thread fastener and mating threaded block by using a combination of cylindrical meshing techniques and a method of revolving &ldquo;profiles&rdquo; in a helical coordinate system. The bolt meshing program is able to input parameters about the thread fastener and block: diameter, pitch, length, etc., and output a complete three dimensional model in the form of an ABAQUS or NASTRAN finite element input deck. This model can then run through the ABAQUS finite element program and the resulting stress field computed. This paper will focus on the algorithm used to generate the mesh.
Sard kernels for certain bivariate cubatures
Authors: Robert E. Barnhill, David T. Pilcher
Venue: Communications of the ACM (1973)

An error analysis for some bivariate cubatures is given. The remainders are obtained by the use of Sard kernels. Numerical results and computer graphs are given for some of the kernel functions.
Transaction Scheduling in Distributed Real-Time Systems
Authors: Kwok-Wa Lam, Victor C. S. Lee, Sheung-Lun Hung
Venue: Real-Time Systems (2000)

In this paper, we study the performance of using optimistic approach to concurrency control in distributed real-time database systems (RTDBS). The traditional optimistic approach suffers from the problem of unnecessary restarts. Transaction restarts can significantly increase the system workload and intensify resource and data contention. In distributed environments, the complexity of the system and the high communication overhead exacerbate the problem. Therefore, the number of unnecessary restarts is the determinant factor that affects the performance of optimistic approach in distributed RTDBS. When optimistic approach is extended to distributed environments, a number of issues resulting from the increased complexity and communication overhead have to be resolved. In this paper, a new real-time distributed optimistic concurrency control (DOCC) protocol with dynamic adjustment of serialization order (DASO), called DOCC-DA is proposed. This protocol can avoid unnecessary transaction restarts by dynamically adjusting the serialization order of the conflicting transactions. Therefore, resources can be saved and more transactions can meet their deadlines. In the DOCC-DA protocol, a new distributed circular validation scheme is included to facilitate transaction validation in distributed environments. The performance of the DOCC-DA protocol has been examined in detail by simulation. The results showed that the performance of the DOCC-DA protocol is consistently better than that of other protocols.
Module placement with boundary constraints using the sequence-pair representation
Authors: Jianbang Lai, Ming-Shiun Lin, Ting-Chi Wang
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In VLSI module placement, it is very practical to consider placing some modules along the pre-specified boundaries of the chip so that the modules are easier to be connected to certain I/O pads. In this paper, we study the module placement problem where some modules have the boundary constraints, and present a simulated annealing based algorithm that represents each placement topology by a sequence-pair. The major contribution of our algorithm is that a feasible placement is always obtainable. Our algorithm has been implemented, and its effectiveness is supported by the encouraging experimental results.
N-body simulation of galaxy formation on GRAPE-4 special-purpose computer
Authors: Toshiyuki Fukushige, Junichiro Makino
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

We report on resent N-body simulations of galaxy formation performed on the GRAPE-4 (GRAvity PipE 4) system, a special-purpose computer for astrophysical N-body simulations. We review the astrophysical motivation, the algorithm, the actual performance, and the price per performance. The performance obtained is 332 Gflops averaged over 185 hours for a simulation of a galaxy formation with 786,400 particles. The price per performance obtained is 4,600 dollars per Gflops. The configuration used for the simulation consists of 1,269 pipeline processors and has a peak speed of 663 Gflops.
Reflections on trusting trust
Authors: Ken Thompson
Venue: Communications of the ACM (1984)

To what extent should one trust a statement that a program is free of Trojan horses? Perhaps it is more important to trust the people who wrote the software.
An algebraic approach to static analysis of active database rules
Authors: Elena Baralis, Jennifer Widom
Venue: ACM Transactions on Database Systems (TODS) (2000)

Rules in active database systems can be very difficult to program due to the unstructured and unpredictable nature of rule processing. We provide static analysis techniques for predicting whether a given rule set is guaranteed to terminate and whether rule execution is confluent (guaranteed to have a unique final state). Our methods are based on previous techniques for analyzing rules in active database systems. We improve considerably on the previous techniques by providing analysis criteria that are much less conservative: our methods often determine that a rule set will terminate or is confluent when previous methods could not make this determination. Our improved analysis is based on a &ldquo;propagation&rdquo; algorithm, which uses an extended relational algebra to accurately determine when the action of one rule can affect the condition of another, and determine when rule actions commute. We consider both conditon-action rules and event-condition-action-rules, making our approach widely applicable to relational active database rule languages and to the trigger language in the SQL:1999 standard.
Solving Fundamental Problems on Sparse-Meshes
Authors: Jop F. Sibeyn
Venue: IEEE Transactions on Parallel and Distributed Systems (2000)

A sparse-mesh, which has PUs on the diagonal of a two-dimensional grid only, is a cost effective distributed memory machine. Variants of this machine have been considered before, but none are as simple and pure as a sparse-mesh. Various fundamental problems (routing, sorting, list ranking) are analyzed, proving that sparse-meshes have great potential. It is shown that on a two-dimensional $n \times n$ sparse-mesh, which has $n$ PUs, for $h = \omega(n^\epsilon \cdot \log n)$, h-relations can be routed in $(h + o(h)) / \epsilon$ steps. The results are extended for higher dimensional sparse-meshes. On a $d$-dimensional $n \times \cdots \times n$ sparse-mesh, with $h = \omega(n^\epsilon \cdot \log n)$, h-relations are routed in $(6 \cdot (d - 1) / \epsilon - 4) \cdot (h + o(h))$ steps.
Interactive tools for constructing and browsing structures for movie films
Authors: Riad Hammoud, Roger Mohr
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

This paper presents a prototype for constructing, browsing and using structures for movie films based on content image analysis only. The goal of the structuring is to facilitate the user's access to the video content (non-linear navigation, etc.). Our prototype provides for the &ldquo;editor user&rdquo; advanced tools for structuring the video at its low-level (e.g. shots, key-frames) and high-level structures (e.g. groups of objects, scenes). Also, it provides for the &ldquo;end user&rdquo; flexible interfaces for browsing and using constructed video structures. Against the previous version of this prototype [1], we mainly improved the matching and the clustering of segmented objects. Also, constructing and browsing the high-level scene structure are now available.
The design of an asynchronous VHDL synthesizer
Authors: S.-Y. Tan, S. B. Furber, W.-F. Yen
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

This paper presents a straightforward approach for synthesizing a standard VHDL description of an asynchronous circuit from a behavioral VHDL description. The asynchronous circuit style is based on "micropipelines", a style currently used to develop asynchronous microprocessors at Manchester University. The rules of partition and conversion which are used to implement the synthesizer are also described. The synthesizer greatly reduces the design time of a complex micropipeline circuit.
Recent Developments in Inverse Acoustic Scattering Theory
Authors: David Colton, Joe Coyle, Peter Monk
Venue: SIAM Review (2000)

We survey some of the highlights of inverse scattering theory as it has developed over the last 15 years, with emphasis on uniqueness theorems and reconstruction algorithms for time harmonic acoustic waves. Included in our presentation are numerical experiments using real data and numerical examples of the use of inverse scattering methods to detect buried objects.
Error bounds for periodic quintic splines
Authors: Charles Allan Hall
Venue: Communications of the ACM (1969)

Explicit error bounds for periodic quintic spline interpolation are developed. The first (third) derivative of the periodic spline is shown to be a sixth (fourth) order approximation at the mesh points to the first (third) derivative of the function being interpolated.
Documenter: a simple geographical information system
Authors: Ahmed Gomaa, El Sayed Mostafa
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

Documenter is a geographical information system package developed in visualbasic6 and MsAccess2000. It imports and views maps with embedded databases. It includes searching, zooming and printing facilities. Documenter runs under all Windows operating systems. The documenter uses ActiveX technology, as OLE especially the object handler dynamic link library that does not activate the OLE server when the embedded object is used. One of The problems faced while developing the package is the inconsistency of maps starting points opened within the OLE container. Another problem was the interrelated coordinates of a map and how to manage the zooming of the maps within the OLE container putting in consideration the activation of the OLE server. The package solves those problems in a simple and creative manner. The GUI design of DOCUMENTER is collaboration between the system users and the developers. The software is developed using the IEF methodology. DOCUMENTER uses the OLE technology in a creative manner, which helps in minimizing the maps access time, and eliminates the need of the ole server while running the system a fact that decreases tremendously the licensing expenses. Figure1 gives a general overview of the system.
Long term file migration: development and evaluation of algorithms
Authors: Alan Jay Smith
Venue: Communications of the ACM (1981)

The steady increase in the power and complexity of modern computer systems has encouraged the implementation of automatic file migration systems which move files dynamically between mass storage devices and disk in response to user reference patterns. Using information describing 13 months of user disk data set file references, we develop and evaluate (replacement) algorithms for the selection of files to be moved from disk to mass storage. Our approach is general and demonstrates a general methodology for this type of problem. We find that algorithms based on both the file size and the time since the file was last used work well. The best realizable algorithms tested condition on the empirical distribution of the times between file references. Acceptable results are also obtained by selecting for replacement that file whose size times time to most recent reference is maximal. Comparisons are made with a number of standard algorithms developed for paging, such as Working Set, VMIN, and GOPT. Sufficient information (parameter values, fitted equations) is provided so that our algorithms may be easily implemented on other systems.
Introduction: Learning and Vision at CBCL
Authors: Tomaso Poggio, Alessandro Verri
Venue: International Journal of Computer Vision (2000)

This special issue is dedicated to some of the recent work at the Center for Biological and Computational Learning at MIT in applying machine learning techniques to computer vision.
Canonical structure in attribute based file organization
Authors: Eugene Wong, T. C. Chiang
Venue: Communications of the ACM (1971)

A new file structure for attribute based retrieval is proposed in this paper. It allows queries involving arbitrary Boolean functions of the attribute-value pairs to be processed without taking intersections of lists. The structure is highly dependent on the way in which the file is to be used and is uniquely determined by the specification of the allowed queries. Thus, for example, the structure for retrieval on the basis of ranges of values on a given attribute would be very different from one where only retrieval on the basis of a single value is permitted. The file organization being proposed is based on the atoms of a Boolean algebra generated by the queries. The desirable properties claimed for this structure are proved, and file maintenance questions are discussed.
Research and practice in federated information systems
Authors: W. Hasselbring, W.-J. van den Heuvel, G. J. Houben, R.-D. Kutsche, B. Rieger, M. Roantree, K. Subieta
Venue: ACM SIGMOD Record (2000)

EFIS 2000 was held at Dublin City University in June 2000. The principal aim of this third workshop was to bring together new insights from academic research with industry-driven developments and perspectives in the area of federated information systems. This report describes the observations of the workshop together with the outcome and future research possibilities.
Random lifts of graphs
Authors: Alon Amit, Nathan Linial, Jiří Matoušek, Eyal Rozenman
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We describe here a simple probabilistic model for graphs that are lifts of a fixed base graph G, i.e., those graphs from which there is a covering man onto G. Our aim is to investigate the properties of typical graphs in this class. In particular, we show that almost every lift of G is &dgr;(G)-connected where &dgr;(G) is the minimal degree of G. We calculate the typical edge expansion of lifts of the bouquet Bd and
Mediacaptain - a demo
Authors: Florian Mueller
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

The mediacaptain is a system that facilitates indexing, browsing, summarizing and retrieval of video, on the Web with the support of supplementary material. The demo is available over the Web at htt://www.mediacaptain.com. It is a presentation about the mediacaptain using the features of the mediacaptain. In order to experience all the possibilities of the mediacaptain, it is advisable to watch the video at the given URL and make use of the provided functionality.
Accreditation and student assessment in distance education: why we all need to pay attention
Authors: Lisa C. Kaczmarczyk
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

Distance Education (D.E.) is changing fundamental debates about academic integrity and rigor. The role of teaching and learning is being discussed with respect to both accreditation and student assessment. Evidence suggests that popular methods of student assessment in D.E. differ little from traditional methods. Studies of cheating in D.E. show that perceptions do not match reality. Accrediting agencies are grappling with an inherent educational paradigm shift. Beliefs about professional autonomy and academic freedom may be affected. Computer Scientists are in a unique position to understand the implications of this technology-driven debate. We need to educate ourselves about these issues and make our voices heard.
Maximum computing power and cost factors in the centralization problem
Authors: A. E. Oldehoeft, M. H. Halstead
Venue: Communications of the ACM (1972)

A simple analysis of some computer-economic factors involved in comparing multimachine installations versus large single machine installations is given, and a mathematical model is derived to assist policy decisions.
A real-time garbage collector based on the lifetimes of objects
Authors: Henry Lieberman, Carl Hewitt
Venue: Communications of the ACM (1983)

In previous heap storage systems, the cost of creating objects and garbage collection is independent of the lifetime of the object. Since objects with short lifetimes account for a large portion of storage use, it is worth optimizing a garbage collector to reclaim storage for these objects more quickly. The garbage collector should spend proportionately less effort reclaiming objects with longer lifetimes. We present a garbage collection algorithm that (1) makes storage for short-lived objects cheaper than storage for long-lived objects, (2) that operates in real time&mdash;object creation and access times are bounded, (3) increases locality of reference, for better virtual memory performance, (4) works well with multiple processors and a large address space.
Neural Net Based Hybrid Modeling of the Methanol Synthesis Process
Authors: Primož Potočnik, Marko Šetinc, Igor Grabec, Janez Levec
Venue: Neural Processing Letters (2000)

A Hybrid modeling approach, combining an analytical model with a radial basis function neural network is introduced in this paper. The modeling procedure is combined with genetic algorithm based feature selection designed to select informative variables from the set of available measurements. By only using informative inputs, the model's generalization ability can be enhanced. The approach proposed is applied to modeling of the liquid&ndash;phase methanol synthesis. It is shown that a hybrid modeling approach exploiting available a priori knowledge and experimental data can considerably outperform a purely analytical approach.
FLID-DL: congestion control for layered multicast
Authors: John Byers, Michael Frumin, Gavin Horn, Michael Luby, Michael Mitzenmacher, Alex Roetter, William Shaver
Venue: Proceedings of NGC 2000 on Networked group communication (2000)

We describe Fair Layered Increase/Decrease with Dynamic Layering (FLID-DL), a new multi-rate congestion control algorithm for layered multicast sessions. FLID-DL generalizes the receiver-driven layered congestion (RLC) control protocol introduced by Vicisano, Rizzo, and Crowcroft, ameliorating the problems associated with large IGMP leave latencies and abrupt rate increases. Like RLC, FLID-DL is a scalable, receiver-driven congestion control mechanism in which receivers add layers at sender-initiated synchronization points and leave layers when they experience congestion. FLID-DL congestion control coexists with TCP flows as well as other FLID-DL sessions and supports general rates on the different multicast layers. We demonstrate via simulations that our congestion control scheme exhibits better fairness properties and provides better throughput than previous methods. A key contribution that enables FLID-DL and may be useful elsewhere is Dynamic Layering (DL), which mitigates the negative impact of long IGMP leave latencies and eliminates the need for probe intervals present in RLC. We use DL to respond to congestion much faster than IGMP leave operations, which have proven to be a bottleneck for prior work.
Querying Documents using Content, Structure and Properties
Authors: Patrick Lambrix, Nahid Shahmehri
Venue: Journal of Intelligent Information Systems (2000)

Much information is nowadays stored electronically in document bases. Users retrieve information from these document bases by browsing and querying. While a large number of tools are available nowadays, not much work has been done on tools that support queries involving all the characteristics of documents as well as the use of domain knowledge during the search for information. In this paper we propose a query language that allows for querying documents using content information, information about the logical structure of the documents as well as information about properties of the documents. Domain knowledge is taken into account during the search as well. We also present an architecture for a system supporting such a language and we describe a prototype implementation together with test results.
Intelligent visualization in a planning simulation
Authors: Robert St. Amant, Christopher G. Healey, Mark Riedl, Sarat Kocherlakota, David A. Pegram, Mika Torhola
Venue: Proceedings of the 6th international conference on Intelligent user interfaces (2001)

This paper describes a set of visualization techniques for interactive planning in a physical force simulation called AFS. We have developed a 3D environment in which textures are overlaid on a simulated landscape to convey information about environmental properties, agent actions, and possible strategies. Scenes are presented, via automated camera planning, such that some simple agent goals can be induced visually with little effort. These two areas of visualization functionality in AFS exploit properties of human low-level and intermediate-level vision, respectively. This paper presents AFS, its visualization environment, and studies we have run to explore the relationship between AFS visualizations and the high-level planning process.