ppxscal/embedding_network huggingface dataset:
Intelligent balloon: a subdivision-based deformable model for surface reconstruction of arbitrary topology
Authors: Ye Duan, Hong Qin
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

In this paper, we develop a novel subdivision-based model&mdash;Intelligent Balloon&mdash;which is capable of recovering arbitrary, complicated shape geometry as well as its unknown topology simultaneously. Our Intelligent Balloon is a parameterized subdivision surface whose geometry and its deformable behaviors are governed by the principle of energy minimization. Our algorithm starts from a simple seed model (of genus zero) that can be arbitrarily initiated by users within regions of interest. The growing behavior of our model is controlled by a locally defined objective function associated with each vertex. Through the numerical integration of function optimization, our algorithm can adaptively subdivide the model geometry, automatically detect self-collision of the model, properly modify its topology (because of the occurrence of self-collision), correctly evolve the model towards the region boundary and reduce fitting error and improve fitting quality via global subdivision. Commonly used mesh optimization techniques are employed throughout the geometric deformation and topological variation in order to ensure the model both locally smooth and globally well conditioned. We have applied our topologically flexible models to such applications as reverse engineering from range data and surface reconstruction from volumetric image data. Our new models prove to be very powerful and extremely useful for boundary representation of complicated solids of arbitrary topology, shape recovery and segmentation for medical imaging, and iso-surface extraction for visualization.
High-Resolution Nonoscillatory Central Schemes for Hamilton--Jacobi Equations
Authors: Chi-Tien Lin, Eitan Tadmor
Venue: SIAM Journal on Scientific Computing (1999)

In this paper, we construct second-order central schemes for multidimensional Hamilton--Jacobi equations and we show that they are nonoscillatory in the sense of satisfying the maximum principle. Thus, these schemes provide the first examples of nonoscillatory second-order Godunov-type schemes based on global projection operators. Numerical experiments are performed; $L^1$/$L^{\infty}$-errors and convergence rates are calculated. For convex Hamiltonians, numerical evidence confirms that our central schemes converge with second-order rates, when measured in the L1-norm advocated in our recent paper [Numer. Math, to appear]. The standard $L^{\infty}$-norm, however, fails to detect this second-order rate.
Using a coordination language to specify and analyze systems containing mobile components
Authors: P. Ciancarini, F. Franzé, C. Mascolo
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2000)

New computing paradigms for network-aware applications need specification languages able to deal with the features of mobile code-based systems. A coordination language provides a formal framework in which the interaction of active entities can be expressed. A coordination language deals with the creation and destruction of code or complex agents, their communication activites, as well as their distribution and mobility in space. We show how the coordination language PoliS offers a flexible basis for the description and the automatic analysis of architectures of systems including mobile entities. Polis is based on multiple tuple spaces and offers a basis for defining, studying, and controlling mobility as it allows decoupling mobile entities from their environments both in space and in time. The pattern-matching mechanism adopted for communication helps in abstracting from addressing issues. We have developed a model-checking technique for the automatic analysis of PoliS specifications. In the article we show how this technique can be applied to mobile code-based systems
Computer-aided design
Authors: Douglas T. Ross
Venue: Communications of the ACM (1961)

This project is engaged in (a) a program of research into the application of the concepts and techniques of modern data processing to the design of mechanical parts, and (b) the further development of automatic programming systems for numerically controlled machine tools. The project is a cooperative venture between the Computer Applications Group of the Electronic Systems Laboratory and the Design and Graphics Division of the Mechanical Engineering Department, and is sponsored by the Manufacturing Methods Division of the USAF Air Material Command through Contract AF-33(600)-40604.
Generalized map coloring for use in geographical information systems
Authors: Robert Freimer
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

We propose a new model for cartographic map coloring for use in Geographical Information Systems. Map coloring motivated the famous four-color problem in Mathematics. The published proofs of the four-color theorem yield impractical polynomial-time algorithms. Actual political maps often require generalizations to the standard four-coloring problem given the topology of some regions. We allow each region to have m disjoint pieces, which is Heawood's m-pire problem. We also count node adjacency between regions, i.e., two regions are adjacent if they share a common point. The adjacency graphs using node adjacency are known as map graphs. By combining m-pires with node and island adjacency, we formulate a new model to handle actual GIS instances. We implemented Br&eacute;laz's Dsatur heuristic, since no specific algorithm exists for coloring our resulting cartographic graphs. The choice works well in practice and we discuss the details of the implementation in TransCAD&reg;.
Compiling connectives
Authors: Charles J. Swift
Venue: Communications of the ACM (1960)

The connectives &ldquo;and&rdquo;, &ldquo;or&rdquo; and their alternatives can be used to connect words, phrases or clauses in natural English. In the specifications for the FACT language for the Honeywell 800(1), authors attempted to include as many of these uses as possible while still retaining simple rules as to what was allowable. The compiler operates on connectives by expanding the original source statements, using repetitions, until there has been generated an equivalent statement in which the connectives connect only complete conditional or imperative clauses. This paper describes the methods employed by the compiler for part of this expansion.
Efficient implementation of a variable projection algorithm for nonlinear least squares problems
Authors: Fred T. Krogh
Venue: Communications of the ACM (1974)

Nonlinear least squares problems frequently arise for which the variables to be solved for can be separated into a linear and a nonlinear part. A variable projection algorithm has been developed recently which is designed to take advantage of the structure of a problem whose variables separate in this way. This paper gives a slightly more efficient and slightly more general version of this algorithm than has appeared earlier.
Comment on a computing the k shortest paths in a graph
Authors: Eugene L. Lawler
Venue: Communications of the ACM (1977)

In [1] Hardgrave discusses &ldquo;positional&rdquo; versus keyword parameter communication with subprograms from the viewpoint of structured programming. In this note an additional argument in favor of the keyword approach is suggested.
Scheduling precedence-constrained jobs with stochastic processing times on parallel machines
Authors: Martin Skutella, Marc Uetz
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We consider parallel machine scheduling problems where the jobs are subject to precedence constraints, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the weighted sum of job completion times &sum;, w, C, in expectation, where w, &gne; 0. Building upon an LP-relaxation from [3] and an idle time charging scheme from [1], we derive the first approximation algorithms for this model.
An Integrated Bayesian Approach to Layer Extraction from Image Sequences
Authors: Philip H. S. Torr, Richard Szeliski, P. Anandan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

This paper describes a Bayesian approach for modeling 3D scenes as a collection of approximately planar layers that are arbitrarily positioned and oriented in the scene. In contrast to much of the previous work on layer-based motion modeling, which computes layered descriptions of 2D image motion, our work leads to a 3D description of the scene. There are two contributions within the paper. The first is to formulate the prior assumptions about the layers and scene within a Bayesian decision making framework which is used to automatically determine the number of layers and the assignment of individual pixels to layers. The second is algorithmic. In order to achieve the optimization, a Bayesian version of RANSAC is developed with which to initialize the segmentation. Then, a generalized expectation maximization method is used to find the MAP solution.
Information reference coding
Authors: J. J. Florentin
Venue: Communications of the ACM (1976)

Items in business systems have to be identified by reference codes, which can later be used as data codes and file keys in an associated data processing system. In business systems associated with large collections of integrated files (databases) it is vital to assign codes in a methodical way so as to control future extension and changes while maintaining correct program action. The principles of methodical coding are discussed, and the way in which logical connections between data items must be reflected in the reference code framework is shown through a set-theoretic information model.
Entropy and self-organization in multi-agent systems
Authors: H. Van Dyke Parunak, Sven Brueckner
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Emergent self-organization in multi-agent systems appears to contradict the second law of thermodynamics. This paradox has been explained in terms of a coupling between the macro level that hosts self-organization (and an apparent reduction in entropy), and the micro level (where random processes greatly increase entropy). Metaphorically, the micro level serves as an entropy &ldquo;sink&rdquo;, permitting overall system entropy to increase while sequestering this increase from the interactions where selforganization is desired. We make this metaphor precise by constructing a simple example of pheromone-based coordination, defining a way to measure the Shannon entropy at the macro (agent) and micro (pheromone) levels, and exhibiting an entropybased view of the coordination.
Half rotations in N-dimensional Euclidean space
Authors: Richard B. McCammon
Venue: Communications of the ACM (1966)

An iterative procedure is described for determining half rotations in n-dimensional Euclidean space. The method is a variant of the cyclic Jacobi procedure and utilizes elementary plane rotations to obtain the half rotation matrix. Numerical examples are given.
Distributed Termination
Authors: Nissim Francez
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (1980)

Discussed is a distributed system based on communication among disjoint processes, where each process is capable of achieving a post-condition of its local space in such a way that the conjunction of local post-conditions implies a global post-condition of the whole system. The system is then augmented with extra control communication in order to achieve distributed termination, without adding new channels of communication. The algorithm is applied to a problem of constructing a sorted partition.
A wrapper generator for wrapping high performance legacy codes as Java/CORBA components
Authors: M. Li, O. F. Rana, M. S. Shields, D. W. Walker
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

This paper describes a Wrapper Generator for wrapping high performance legacy codes as Java/CORBA components for use in a distributed component-based problem-solving environment. Using the Wrapper Generator we have automatically wrapped an MPI-based legacy code as a single CORBA object, and implemented a problem-solving environment for molecular dynamic simulations. Performance comparisons between runs of the CORBA object and the original legacy code on a cluster of workstations and on a parallel computer are also presented.
A time-stamping algorithm for efficient performance estimation of superscalar processors
Authors: Gabriel Loh
Venue: ACM SIGMETRICS Performance Evaluation Review (2001)

The increasing complexity of modern superscalar microprocessors makes the evaluation of new designs and techniques much more difficult. Fast and accurate methods for simulating program execution on realistic and hypothetical processor models are of great interest to many computer architects and compiler writers. There are many existing techniques, from profile based runtime estimation to complete cycle-level simulations. Many researchers choose to sacrifice the speed of profiling for the accuracy obtainable by cycle-level simulators. This paper presents a technique that provides accurate performance predictions, while avoiding the complexity associated with a complete processor emulator. The approach augments a fast in-order simulator with a time-stamping algorithm that provides a very good estimate of program running time. This algorithm achieves an average accuracy that is within 7.5% of a cycle-level out-of-order simulator in approximately 41% of the running time on the eight SPECInt95 integer benchmarks.
Computer science&mdash;a vicious circle
Authors: Abraham Kandel
Venue: Communications of the ACM (1972)

In many computer science departments throughout the country, including some interdisciplinary departments, the curriculum has placed increasing emphasis upon applied mathematics and the fundamental nature of computational systems. A set of core courses which usually are fitted into such a program can be found in the report of the ACM curriculum committee on computer science, Curriculum 68 [1]. Some computer science departments have done such a magnificent job of de-emphasizing the importance of the experimental laboratory in their program that their graduates emerge thoroughly unprepared to tackle the intricacies associated with design work in the real-life world&mdash;both in software and hardware. This is basically because most computer science departments do not emphasize sufficiently the practical aspects of computational system design and implementation. For example, some students have serious difficulty in designing even a shift register of an 8-4-2-1 counter with ripple carry, not to mention more complicated computer systems. Perhaps even more important, computer science in the academic sense has implemented the &ldquo;modus ponens&rdquo; (rule of detachment) from the real-life world and has very little to do with real computers. The relationship between the abstract side of computer science and questions of cost and marketing are hardly ever mentioned in courses.
A balanced code placement framework
Authors: Reinhard von Hanxleden, Ken Kennedy
Venue: ACM Transactions on Programming Languages and Systems (TOPLAS) (2000)

Give-N-Take is a code placement framework which uses a generic producer-consumer mechanism. An instance of this could be a communication step between a processor that computes (produces) some data, and other processors that subsequently reference (consume) these data in an expression. An advantage of Give-N-Take over traditional partial redundancy elimination techniques is its concept of production regions, instead of single locations, which can be beneficial for general latency hiding. Give-N-Take also guarantees balanced production, i.e., each production will be started and stopped exactly once. The framework can also take advantage of production coming &ldquo;for free,&rdquo; as induced by side effects, without disturbing balance. Give-N-Take can place production either before or after consumption, and it also provides the option to speculatively hoist code out of potentially zero-trip loop (nest) constructs. Give-N-Take uses a fast elimination method based on Tarjan intervals, with a complexity linear in the program size in most cases. We have implemented Give-N-Take as partof a Fortran D compiler prototype, where it solves various communication generation problems associated with compiling data-parallel languages onto distributed-memory architectures.
A recursive relation for the determinant of a pentadiagonal matrix
Authors: Roland A. Sweet
Venue: Communications of the ACM (1969)

A recursive relation, relating leading principal minors, is developed for the determinant of a pentadiagonal matrix. A numerical example is included to indicate its use in calculating eigenvalues.
Characterization of Linear Structures
Authors: Sylvie Dubuc
Venue: Designs, Codes and Cryptography (2001)

We study the notion of linear structure of a function defined from \F^m to \F^n, and in particular of a Boolean function. We characterize the existence of linear structures by means of the Fourier transform of the function. For Boolean functions, this characterization can be stated in a simpler way. Finally, we give some constructions of resilient Boolean functions which have no linear structure.
Low power design challenges for the decade (invited talk)
Authors: Shekhar Borkar
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

Technology scaling will become difficult beyond 0.18 micron. For continued growth in performance, transistor density, and reduced energy per computation, circuit design will have to employ a new set of design techniques, with adequate design automation tools support. This paper discusses a few such techniques that reduce active and leakage power, and deliver higher performance. It concludes by pointing out some of the potential paradigm shifts.
&ldquo;GazeToTalk&rdquo;: a nonverbal interface with meta-communication facility (Poster Session)
Authors: Tetsuro Chino, Kazuhiro Fukui, Kaoru Suzuki
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

We propose a new human interface (HI) system named &ldquo;GazeToTalk&rdquo; that is implemented by vision based gaze detection, acoustic speech recognition (ASR), and animated human-like agent CG with facial expressions and gestures. The &ldquo;GazeToTalk&rdquo; system demonstrates that eye-tracking technologies can be utilized to improve HI effectively by working with other non-verbal messages such as facial expressions and gestures. Conventional voice interface system have the following serious drawbacks. (1) They cannot distinct between input voice and other noise, and (2) cannot understand who is the intended hearer of each utterance. A &ldquo;push-to-Wk&rdquo; mechanism can be used to ease these problems, but it spoils the advantages of voice interfaces (e.g. contact-less, suitability in hand-busy situation). In real human dialogues, besides exchanging content messages, people use non-verbal messages such as gaze, facial expressions and gestures to establish or maintain conversations, or recover from problems that arise in the conversation. The &ldquo;GazeToTalk&rdquo; system simulates this kind of &ldquo;meta-communication&rdquo; facility by utilizing vision based gaze detection, ASR, and human-like agent CG. When the user intends to input voice commands, he gazes on the agent on the display in order to request to talk, just as in daily human-human dialogues. This gaze is recognized by the gaze detection module and the agent shows a particular facial expression and gestures as a feedback to establish an &ldquo;eye-contact.&rdquo; Then the system accepts or rejects speech input from the user depending on the state of the &ldquo;eye-contact.&rdquo; This mechanism allows the &ldquo;GazeToTalk&rdquo; system to accept only intended voice input and ignore another voices and environmental noises successfully, without forcing any arbitrary operation to the user. We also demonstrate an extended mechanism to treat more flexible &ldquo;eye contact&rdquo; variations. The preliminary experiments suggest that in the context of meta-communication, nonverbal messages can be utilized to improve HI in terms of naturalness, friendliness and tactfulness.
Discrete least squares polynomial fits
Authors: L. F. Shampine
Venue: Communications of the ACM (1975)

The recurrence relation between orthogonal polynomials is widely used for discrete least squares data fitting. A variant of the classical algorithm which has better numerical properties is presented and the reason for its improved performance is explained.
Considerations about Nanoelectronic GSI Processors
Authors: Jose´ Camargo da Costa, Jaap Hoekstra, Martijn J. Goossens, Chris J. M. Verhoeven, Arthur H. M. van Roermund
Venue: Analog Integrated Circuits and Signal Processing (2000)

According to recent studies, the basic technologies presently adopted by the semiconductor industry for memory and processor fabrication should attain limits imposed by the laws of physics around the year 2010. Nanoscale sized devices like single-electron transistors appear as a highly promising option to replace conventional devices by that time. In this study, considerations about the realization of a GSI processor, based upon nanoelectronic devices, are presented.
Information systems curriculum recommendations for the 80s: undergraduate and graduate programs
Authors: Jay F. Nunamaker,  Jr., J. Daniel Couger, Gordon B. Davis
Venue: Communications of the ACM (1982)

The recommendations of the 1972 and 1973 ACM Curriculum Committee on Information Systems programs have been influential in the development of degree programs at the bachelor's, master's, and doctoral levels. The earlier curriculum has been revised and updated based on advances in the field over the past nine years. The report discusses the continuing need for education related to the definition, analysis, design, construction, and management of information systems in organizations. The structure of both bachelor's and master's level programs are described and courses are defined. Course outlines include rationale for the courase, course objectives, instructional modes, and a list of topics. Each topic is weighted in terms of suggested percent of time devoted to the subject.
On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals
Authors: Gérard D. Cohen, Iiro Honkala, Antoine Lobstein
Venue: IEEE Transactions on Computers (2001)

Fault diagnosis of multiprocessor systems motivates the following graph-theoretic definition. A subset $C$ of points in an undirected graph $G=(V,E)$ is called an identifying code if the sets $B(v) \cap C$ consisting of all elements of $C$ within distance one from the vertex $v$ are different. We also require that the sets $B(v) \cap C$ are all nonempty. We take $G$ to be the infinite square lattice with diagonals and show that the density of the smallest identifying code is at least 2/9 and at most 4/17.