ppxscal/embedding_network huggingface dataset:
Surface drawing: creating organic 3D shapes with the hand and tangible tools
Authors: Steven Schkolne, Michael Pruett, Peter Schröder
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2001)

Surface Drawing is a system for creating organic 3D shapes in a manner which supports the needs and interests of artists. This medium facilitates the early stages of creative design which many 3D modeling programs neglect. Much like traditional media such as line drawing and painting, Surface Drawing lets users construct shapes through repeated marking. In our case, the hand is used to mark 3D space in a semi-immersive virtual environment. The interface is completed with tangible tools to edit and manipulate models. We introduce the use of tongs to move and scale 3D shapes and demonstrate a magnet tool which is comfortably held without restricting hand motion. We evaluated our system through collaboration with artists and designers, exhibition before hundreds of users, our own extensive exploration of the medium, and an informal user study. Response was especially positive from users with an artistic background.
Writing an online debugging program for the experienced user
Authors: Paul T. Brady
Venue: Communications of the ACM (1968)

Presently available online debugging routines are often unsatisfactory for the experienced user because they require unnecessarily rigid and complicated typing formats, make it difficult for the user to correct typing errors, and consume excessive memory with intricate features. In a debugging program it is of prime importance that the program be simple, flexible, and highly efficient to use. Communication between the user and the debugging program can be improved by using certain techniques applicable to most online debugging programs. These techniques are presented and are illustrated by their use in OPAK (octal package), a debugging program coded for the PDP-5/8 and the SDS-930. The compromise between economy of utility program core storage and incorporation of elegant debugging features is discussed.
Why do they fail?: how do they succeed? The success of some students in CS2
Authors: M. Dee Medley
Venue: Journal of Computing Sciences in Colleges (2001)

This paper is intended to stimulate discussion about the progress of students through the typical CS2 course. It is based on test results from only a single class, and is thus extremely limited in terms of applicability or extensibility. However, the problems encountered by the class on this test seem to be of a nature that may be quite general. The paper focuses on the problems the students had writing the test and suggests reasons why they may have encountered these problems. It represents a first attempt to see what the students in this course are lacking for eventual success.
A construction of minimal delay Steiner tree using two-pole delay model
Authors: LiYi Lin, YiYu Liu, Ting Ting Hwang
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

In this paper, we will study the construction of a Steiner routing tree for a given net with the objective of minimizing the delay of the routing tree. Previous researches adopt Elmore delay model to compute delay. However, with the advancement of IC technology, a more accurate delay model is required. Therefore, in this paper, we will use two-pole delay model to compute the cost function of a Steiner tree. Moreover, we propose a new algorithm to construct the Steiner tree. Our algorithm takes into consideration the net topology, the total wire length and the longest path from the source to sink. Experimental results show that our algorithm is very effective and efficient as compared to [8].
The development and customization of GIS-based applications and Web-based GIS applications with the CASE tool AIGLE
Authors: Ahmed Lbath, François Pinet
Venue: Proceedings of the 8th ACM international symposium on Advances in geographic information systems (2000)

In this paper, we propose a visual CASE Tool named Aigle with multiple abstraction levels including a visual language (oriented end-user) and a technical visual language context (oriented designer) for Geographic Information Systems. This CASE Tool addresses the problem of the customizations of GIS applications on several marketed GIS platforms. The use of visual language is suitable for the readability of high level diagrams by non-expert end-users. AIGLE generates automatic customized GIS-Based Applications and Web-Based GIS Applications thanks to a user-friendly interface. Thus the designers can save 95% of the time spent on developing. More over a visual object oriented method is proposed to facilitate the design of spatial applications
Using xinetd
Authors: José Nazario
Venue: Linux Journal (2001)

Jos&eacute; demonstrates how to start configuring and tweaking xinetd.
Numerical Analysis of Compatible Phase Transitions in Elastic Solids
Authors: Carsten Carstensen, Petr Plechác
Venue: SIAM Journal on Numerical Analysis (2000)

The variational model of phase transitions for elastic materials based on linearized elasticity leads to a nonconvex minimization problem (P) in which a minimum need not be attained. In the design of advanced materials, the main interest is in reliable numerical predictions of certain macroscopic quantities such as the global deformation and the stress field determined in a relaxed problem (QP). An explicit formula of the quasi-convexified energy density in (QP) due to R. V. Kohn provides us with a well-posed numerical problem. First, a mathematical a priori and a posteriori error analysis is established for the finite element approximation of the stress variable; then the residual based error indicator is implemented within an adaptive mesh-refinement algorithm. Numerical examples illustrate that the macroscopic properties of the materials are computed efficiently with appropriate error control.
Digital computer determination of alpha source activity
Authors: Donald Robbins, W. E. Taylor
Venue: Communications of the ACM (1964)

A technique is described for determining the activity and homogeneity of an alpha source. It is believed that the technique, using a digital computer, has many uses and applications in the field of nuclear physics. The technique involves computer manipulation of the digital image of the nuclear source. Experimental details are given.
Computer Aided Design of Fault-Tolerant Application Specific Programmable Processors
Authors: Ramesh Karri, Kyosun Kim, Miodrag Potkonjak
Venue: IEEE Transactions on Computers (2000)

Application Specific Programmable Processors (ASPP) provide efficient implementation for any of $m$ specified functionalities. Due to their flexibility and convenient performance-cost trade-offs, ASPPs are being developed by DSP, video, multimedia, and embedded IC manufacturers. In this paper, we present two low-cost approaches to graceful degradation-based permanent fault tolerance of ASPPs. ASPP fault tolerance constraints are incorporated during scheduling, allocation, and assignment phases of behavioral synthesis. Graceful degradation is supported by implementing multiple schedules of the ASPP applications, each with a different throughput constraint. In this paper, we do not consider concurrent error detection. The first ASPP fault tolerance technique minimizes the hardware resources while guaranteeing that the ASPP remains operational in the presence of all k-unit faults. On the other hand, the second fault tolerance technique maximizes the ASPP fault tolerance subject to constraints on the hardware resources. These ASPP fault tolerance techniques impose several unique tasks, such as fault-tolerant scheduling, hardware allocation, and application-to-faulty-unit assignment. We address each of them and demonstrate the effectiveness of the overall approach, the synthesis algorithms, and software implementations on a number of industrial-strength designs.
Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow
Authors: Maiko Shigeno, Satoru Iwata, S. Thomas Mccormick
Venue: Mathematics of Operations Research (2000)

This paper presents two new scaling algorithms for the minimum cost network flow problem, one a primal cycle canceling algorithm, the other a dual cut canceling algorithm. Both algorithms scale a relaxed optimality parameter, and create a second, inner relaxation. The primal algorithm uses the inner relaxation to cancel a most negative node-disjoint family of cycles w.r.t. the scaled parameter, the dual algorithm uses it to cancel most positive cuts w.r.t. the scaled parameter. We show that in a network withn nodes andm arcs, both algorithms need to cancel onlyO(mn) objects per scaling phase.Furthermore, we show how to efficiently implement both algorithms to yield weakly polynomial running times that are as fast as any other cycle or cut canceling algorithms. Our algorithms have potential practical advantages compared to some other canceling algorithms as well.Along the way, we give a comprehensive survey of cycle and cut canceling algorithms for min-cost flow. We also clarify the formal duality between cycles and cuts.
Production and employment of Ph.D.'s in computer science&mdash;1976
Authors: Orrin E. Taulbee, S. D. Conte
Venue: Communications of the ACM (1977)

Statistics are presented on the production and employment of Ph.D.'s in computer science for the calendar year 1975-76. Data include profiles of graduate students and of faculty at 60 Ph.D.-producing departments as well as a breakdown of degrees granted by specialty areas. Significant trends are noted and comparisons with comparable data gathered for the 1974-75 calendar year are made.
Overview of continuous optimization advances and applications to circuit tuning
Authors: Andrew R. Conn, Chandu Visweswariah
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

This paper surveys the state-of-the-art in continuous nonlinear optimization and makes the case that due to tremendous recent progress, larger and more complex problems can be solved than previously thought possible. The two basic paradigms, trust-region and line-search methods, are briefly described. In addition, various nonlinear optimization techniques are reviewed. The application of these nonlinear optimization methods to circuit sizing is presented by describing a pair of circuit sizing tools, one for dynamic tuning and one for tuning based on static timing analysis. Particular emphasis has been given to the customization of nonlinear optimization to the circuit sizing application.
Description of basic algorithm DETAB/65 preprocessor
Authors: Michael D. Callahan, Anson E. Chapman
Venue: Communications of the ACM (1967)

The basic algorithm for the conversion of decision tables into COBOL code is contained in the generator portion of the DETAB/65 preprocessor. The generator analyzes a decision table and produces simple COBOL conditional statements. Core storage is saved by using queueing techniques and extensive indexing and also by outputting the code as it is generated, a line at a time. The only optimization attempted is the elimination of obviously unnecessary tests on certain conditions in the decision table. Since the preprocessor and this language associated with it were developed for COBOL users, the preprocessor was written in a modular form in required COBOL-61.
Multi-GHz interconnect effects in microprocessors
Authors: Phillip J. Restle, Albert E. Ruehli, Steven G. Walker
Venue: Proceedings of the 2001 international symposium on Physical design (2001)

High frequency on-chip interconnect examples are accurately analyzed using full-wave PEEC (Partial Element Equivalent Circuit) analysis. All wire currents and voltages (or delays) are visualized using 3D animations to aid intuitive understanding of new, high frequency interconnect effects.
Agent-based forwarding strategies for reducing location management cost in mobile networks
Authors: Ing-Ray Chen, Tsong-Min Chen, Chiang Lee
Venue: Mobile Networks and Applications (2001)

An important issue in location management for dealing with user mobility in wireless networks is to reduce the cost associated with location updates and searches. The former operation occurs when a mobile user moves to a new location registration area and the network is being informed of the mobile user's current location; the latter operation occurs when there is a call for the mobile user and the netowrk must deliver the call to the mobile user. In this paper, we propose and analyze a class of new agent-based forwarding schemes with the objective to reduce the location management cost in mobile wireless networks. We develop analytical models to compare the performance of the proposed schemes with existing location management schemes to demonstrate their feasibility and also to reveal conditions under which our proposed schemes are superior to existing ones. Our proposed schemes are particularly suitable for mobile networks with switches which can cover a large number of location registration areas.
A sum of squares theorem for visibility
Authors: Pierre Angelier, Michel Pocchiola
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

We present a new and simpler method to implement in constant amortized time the flip operation of the so-called &ldqo;Greedy Flip Algorithm&rdquo;, an optimal algorithm to compute the visibility complex of a collection of pairwise disjoint bounded convex sets of constant complexity. The method relies on a &ldquo;sum of squares&rdquo; like theorem for visibility complexes stated and proved in this paper. (The sum of squares theorem for an arrangement of lines states that the average value of the square of the number of vertices of a face of the arrangement is a $O(1)$.)
The FERET Evaluation Methodology for Face-Recognition Algorithms
Authors: P. Jonathon Phillips, Hyeonjoon Moon, Syed A. Rizvi, Patrick J. Rauss
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Two of the most critical requirements in support of producing reliable face-recognition systems are a large database of facial images and a testing procedure to evaluate systems. The Face Recognition Technology (FERET) program has addressed both issues through the FERET database of facial images and the establishment of the FERET tests. To date, 14,126 images from 1,199 individuals are included in the FERET database, which is divided into development and sequestered portions of the database. In September 1996, the FERET program administered the third in a series of FERET face-recognition tests. The primary objectives of the third test were to 1) assess the state of the art, 2) identify future areas of research, and 3) measure algorithm performance.
The measurement of user information satisfaction
Authors: Blake Ives, Margrethe H. Olson, Jack J. Baroudi
Venue: Communications of the ACM (1983)

This paper critically reviews measures of user information satisfaction and selects one for replication and extension. A survey of production managers is used to provide additional support for the instrument, eliminate scales that are psychometrically unsound, and develop a standard short form for use when only an overall assessment of information satisfaction is required and survey time is limited.
Calculating in an object-oriented iterator-view-generator framework
Authors: Johan Larsson
Venue: Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum) (2000)

This paper briefly describes research on generic object-oriented programming where we establish a set of design patterns (or idioms) which makes algorithms independent of data structures. In the framework that implements these design patterns, an algorithm is not defined directly on a data structure class, but more abstractly on a set of structural properties shared by multiple data structures.
Query optimization for vector space problems
Authors: K. Goda, T. Tamura, M. Kitsuregawa, A. Chowdhury, O. Frieder
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

We present performance measurement results for a parallel SQL based information retrieval system implemented on a PC cluster system. We used the Web-TREC dataset under a left-deep query execution plan. We achieved satisfactory speed up.
Representation of temporal change in solid models
Authors: Erik E. Hayes, Jonathan Sevy, William C. Regli
Venue: Proceedings of the sixth ACM symposium on Solid modeling and applications (2001)

Solid models are static entities, usually defined by a boundary representation model as a set of enclosing surfaces. Constructive Solid Geometry and existing feature-based computer-aided design environments create procedural descriptions of 3D objects as history or CSG trees. These representations are temporally fixed, i.e., they describe the state of a 3D object at a particular point in time. This paper describes a method to represent and capture the temporal evolution of solid models&mdash;what we call the model process history of an object. We define the process history to be the total set of states the model goes through during the design process&mdash;the search space of the detailed design process. This paper presents our work to develop a representational formalism we call model process graphs (MPGs). We use MPGs to integrate a traditional 3D solid model's BRep and feature-based descriptions with a model of the temporal changes that occur during the design process. We believe that MPG representations can have valuable application for many design and manufacturing problems. The paper briefly defines our MPGs that will (1) create a record of the design process; (2) store process-based design rationale; (3) represent in-process shapes for machined artifacts. We anticipate that MPG-like representations will find application in other design and manufacturing problems in which important process knowledge is embodied by temporal changes that occur as models evolve to their final forms.
Multiobject Behavior Recognition by Event Driven Selective Attention Method
Authors: Toshikazu Wada, Takashi Matsuyama
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2000)

Recognizing multiple object behaviors from nonsegmented image sequences is a difficult problem because most of the motion recognition methods proposed so far share the limitation of the single-object assumption. Based on existing methods, the problem can be solved only by bottom-up image sequence segmentation followed by sequence classification. This straightforward approach totally depends on bottom-up segmentation which is easily affected by occlusions and outliers. This paper presents a completely novel approach for this task without using bottom-up segmentation. Our approach is based on assumption generation and verification, i.e., feasible assumptions about the present behaviors consistent with the input image and behavior models are dynamically generated and verified by finding their supporting evidence in input images. This can be realized by an architecture called the selective attention model, which consists of a state-dependent event detector and an event sequence analyzer. The former detects image variation (event) in a limited image region (focusing region), which is not affected by occlusions and outliers. The latter analyzes sequences of detected events and activates all feasible states representing assumptions about multiobject behaviors. In this architecture, event detection can be regarded as a verification process of generated assumptions because each focusing region is determined by the corresponding assumption. This architecture is sound since all feasible assumptions are generated. However, these redundant assumptions imply ambiguity of the recognition result. Hence, we further extend the system by introducing 1) colored-token propagation to discriminate different objects in state space and 2) integration of multiviewpoint image sequences to disambiguate the single-view recognition results. Extensive experiments of human behavior recognition in real world environments demonstrate the soundness and robustness of our architecture.
Using self-diagnosis to adapt organizational structures
Authors: Bryan Horling, Brett Benyo, Victor Lesser
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

The specific organization used by a multi-agent system is crucial for its effectiveness and efficiency. In dynamic environments, or when the objectives of the system shift, the organization must therefore be able to change as well. In this paper we propose using a general diagnosis engine to drive this process of adaptation, using the \tems\ modeling language as the primary representation of organizational information. Results from experiments employing such a system in the Producer-Consumer-Transporter domain are also presented.
On Four-Weight Spin Models and their Gauge Transformations
Authors: Françcois Jaeger
Venue: Journal of Algebraic Combinatorics: An International Journal (2000)

We study the four-weight spin models (W_1, W_2, W_3, W_4) introduced by Eiichi and Etsuko Bannai (Pacific J. of Math, to appear). We start with the observation, based on the concept of special link diagram, that two such spin models yield the same link invariant whenever they have the same pair (W_1, W_3), or the same pair (W_2, W_4). As a consequence, we show that the link invariant associated with a four-weight spin model is not sensitive to the full reversal of orientation of a link. We also show in a similar way that such a link invariant is invariant under mutation of links.Next, we give an algebraic characterization of the transformations of four-weight spin models which preserve W_1, W_3 or preserve W_2, W_4. Such &ldquo;gauge transformations&rdquo; correspond to multiplication of W_2, W_4 by permutation matrices representing certain symmetries of the spin model, and to conjugation of W_1, W_3 by diagonal matrices. We show for instance that up to gauge transformations, we can assume that W_1, W_3 are symmetric.Finally we apply these results to two-weight spin models obtained as solutions of the modular invariance equation for a given Bose-Mesner algebra B and a given duality of B. We show that the set of such spin models is invariant under certain gauge transformations associated with the permutation matrices in B. In the case where B is the Bose-Mesner algebra of some Abelian group association scheme, we also show that any two such spin models (which generalize those introduced by Eiichi and Etsuko Bannai in J. Alg. Combin. 3 (1994), 243&ndash;259) are related by a gauge transformation. As a consequence, the link invariant associated with such a spin model depends only trivially on the link orientation.
A New Time-Based Iterative Solver for Linear Standing-Wave Problems
Authors: Kishor Ganguly, Steven A. Orszag
Venue: Journal of Scientific Computing (1999)

We explore time-based solvers for linear standing-wave problems, especially the oscillatory Helmholtz equation. Here, we show how to accelerate the convergence properties of timestepping. We introduce a new time-based solver that we call phase-adjusted time-averaging (PATA), which we couple to timestepping to form the PATA-TS solver. Numerical experiments indicate that the PATA-TS solver is faster than the PATA solver and timestepping by a factor of 1.2 and 1.5 or more, respectively. We also explain why the PATA-TS solver is robust, efficient, and easy to program for a variety of practical applications.