ppxscal/embedding_network huggingface dataset:
Enhancing a digital book with a reading recommender
Authors: Allison Woodruff, Rich Gossweiler, James Pitkow, Ed H. Chi, Stuart K. Card
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

Digital books can significantly enhance the reading experience, providing many functions not available in printed books. In this paper we study a particular augmentation of digital books that provides readers with customized recommendations. We systematically explore the application of spreading activation over text and citation data to generate useful recommendations. Our findings reveal that for the tasks performed in our corpus, spreading activation over text is more useful than citation data. Further, fusing text and citation data via spreading activation results in the most useful recommendations. The fused spreading activation techniques outperform traditional text-based retrieval methods. Finally, we introduce a preliminary user interface for the display of recommendations from these algorithms.
An Experimental Study of Projective Structure From Motion
Authors: John Oliensis, Venu Govindu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

We describe an essentially algorithm-independent experimental comparison of projective versus Euclidean reconstruction. The Euclidean approach is as accurate as the projective one, even with significant calibration error and for the pure projective structure. Projective optimization has less of a local-minima problem than its Euclidean equivalent. We describe techniques that enhance the convergence of optimization algorithms.
Correlations and Copulas for Decision and Risk Analysis
Authors: Robert T. Clemen, Terence Reilly
Venue: Management Science (1999)

The construction of a probabilistic model is a key step in most decision and risk analyses. Typically this is done by defining a joint distribution in terms of marginal and conditional distributions for the model's random variables. We describe an alternative approach that uses a copula to construct joint distributions and pairwise correlations to incorporate dependence among the variables. The approach is designed specifically to permit the use of an expert's subjective judgments of marginal distributions and correlations. The copula that underlies the multivariate normal distribution provides the basis for modeling dependence, but arbitrary marginals are allowed. We discuss how correlations can be assessed using techniques that are familiar to decision analysts, and we report the results of an empirical study of the accuracy of the assessment methods. The approach is demonstrated in the context of a simple example, including a study of the sensitivity of the results to the assessed correlations.
Iterative Regularization and MINRES
Authors: Misha Kilmer, G. W. Stewart
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

In this paper we present three theorems which give insight into the regularizing properties of MINRES. While our theory does not completely characterize the regularizing behavior of the algorithm, it provides a partial explanation of the observed behavior of the method. Unlike traditional attempts to explain the regularizing properties of Krylov subspace methods, our approach focuses on convergence properties of the residual rather than on convergence analysis of the harmonic Ritz values. The import of our analysis is illustrated by two examples. In particular, our theoretical and numerical results support the following important observation: in some circumstances the dimension of the optimal Krylov subspace can be much smaller than the number of the components of the truncated spectral solution that must be computed to attain comparable accuracy.
Numerical Passage from Systems of Conservation Laws to Hamilton--Jacobi Equations, and Relaxation Schemes
Authors: Shi Jin, Zhouping Xin
Venue: SIAM Journal on Numerical Analysis (1998)

In this paper we study the numerical transition from a Hamilton--Jacobi (H--J) equation to its associated system of conservation laws in arbitrary space dimensions. We first study how, in a very generic setting, one can recover the viscosity solutions of the H--J equation using the numerical solutions to the system of conservation laws. We then introduce a simple, second-order relaxation scheme to solve the underlying weakly hyperbolic system of conservation laws.
A symmetric version of the McEliece public-key cryptosystem
Authors: A. Kh. Al Jabri
Venue: International Journal of Network Management (1997)

This article exploits the fact that linear codes can correct twice the number of erasures as that of errors, allowing reduction in code size and providing the same level of security. &copy; 1997 John Wiley & Sons, Ltd.
Accurate Singular Value Decompositions of Structured Matrices
Authors: James Demmel
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

We present new O(n3) algorithms to compute very accurate singular value decompositions of Cauchy matrices, Vandermonde matrices, and related "unit-displacement-rank" matrices. These algorithms compute all the singular values with guaranteed relative accuracy, independent of their dynamic range. In contrast, previous O(n3) algorithms can potentially lose all relative accuracy in the tiniest singular values.
Fundamentals of fault-tolerant distributed computing in asynchronous environments
Authors: Felix C. Gärtner
Venue: ACM Computing Surveys (CSUR) (1999)

Fault tolerance in distributed computing is a wide area with a significant body of literature that is vastly diverse in methodology and terminology. This paper aims at structuring the area and thus guiding readers into this interesting field. We use a formal approach to define important terms like fault, fault tolerance, and redundancy. This leads to four distinct forms of fault tolerance and to two main phases in achieving them: detection and correction. We show that this can help to reveal inherently fundamental structures that contribute to understanding and unifying methods and terminology. By doing this, we survey many existing methodologies and discuss their relations. The underlying system model is the close-to-reality asynchronous message-passing model of distributed computing.
Approximate Geometric Pattern Matching Under Rigid Motions
Authors: Michael T. Goodrich, Joseph S. B. Mitchell, Mark W. Orletsky
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.
An algorithm for ordering subgoals in NAIL?
Authors: Katherine A. Morris
Venue: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems (1988)

Rule-goal graphs are the central data structures used in the NAIL&prime; system, a knowledge-base system being developed at Stanford University They are constructed while testing the applicability of capture rules, and traversed while generating ICODE to evaluate queries. Generating rule-goal graphs may be reduced to the problem of ordering subgoals. This paper gives an algorithm for generating rule-goal graphs efficiently, in time polynomial in the size of the rules if the arity of recursive predicates is bounded. The graphs generated may be suboptimal for some purposes, but the algorithm will always find a rule-goal graph if one exists. The algorithm has been implemented in Cprolog, and is currently being used to generate rule-goal graphs for the NAIL&prime; system
High-Order Central Schemes for Hyperbolic Systems of Conservation Laws
Authors: Franca Bianco, Gabriella Puppo, Giovanni Russo
Venue: SIAM Journal on Scientific Computing (1999)

A family of shock capturing schemes for the approximate solution of hyperbolic systems of conservation laws is presented. The schemes are based on a modified ENO reconstruction of pointwise values from cell averages and on approximate computation of the flux on cell boundaries. The use of a staggered grid avoids the need of a Riemann solver. The integral of the fluxes is computed by Simpson's rule. The approximation of the flux on the quadrature nodes is obtained by Runge--Kutta schemes with the aid of natural continuous extension (NCE). This choice gives great flexibility at low computational cost. Several tests are performed on the scalar equation and on systems. The numerical results confirm the expected accuracy and the high resolution properties of the schemes.
Applying parallel discrete event simulation to network emulation
Authors: Rob Simmonds, Russell Bradford, Brian Unger
Venue: Proceedings of the fourteenth workshop on Parallel and distributed simulation (2000)

The simulation of wide area computer networks is one area where the benefits of parallel simulation have been clearly demonstrated. Here we present a description of a system that uses a parallel discrete event simulator to act as a high speed network emulator. With this, real Internet Protocol (IP) traffic generated by application programs running on user workstations can interact with modelled traffic in the emulator, thus providing a controlled test environment for distributed applications. The network emulator uses the TasKit conservative parallel discrete event simulation (PDES) kernel. TasKit has been shown to be able to achieve improved parallel performance over existing conservative and optimistic PDES kernels, as well as improved sequential performance over an existing central-event-list based kernel. This paper explains the modifications that have been made to TasKit to enable real-time operation along with the emulator interface that allows the IP network simulation running in the TasKit kernel to interact with real IP clients. Initial emulator performance data is included.
An Efficient, Probabilistically Sound Algorithm for Segmentation andWord Discovery
Authors: Michael R. Brent
Venue: Machine Learning (1999)

This paper presents a model-based, unsupervised algorithm for recovering word boundaries in a natural-language text from which they have been deleted. The algorithm is derived from a probability model of the source that generated the text. The fundamental structure of the model is specified abstractly so that the detailed component models of phonology, word-order, and word frequency can be replaced in a modular fashion. The model yields a language-independent, prior probability distribution on all possible sequences of all possible words over a given alphabet, based on the assumption that the input was generated by concatenating words from a fixed but unknown lexicon. The model is unusual in that it treats the generation of a complete corpus, regardless of length, as a single event in the probability space. Accordingly, the algorithm does not estimate a probability distribution on words&semi; instead, it attempts to calculate the prior probabilities of various word sequences that could underlie the observed text. Experiments on phonemic transcripts of spontaneous speech by parents to young children suggest that our algorithm is more effective than other proposed algorithms, at least when utterance boundaries are given and the text includes a substantial number of short utterances.
Erratum: "Existence of Markov Controls and Characterization of Optimal Markov Controls"
Authors: Thomas G. Kurtz, Richard H. Stockbridge
Venue: SIAM Journal on Control and Optimization (1999)

A compactness condition used to establish the equivalence of infinite-dimensional linear programming problems with stochastic control problems in [SIAM J. Control Optim., 36 (1998), pp. 609--653.] was misstated. The correct statement of the condition is given, as well as an example to show that the erroneous condition is not sufficient to obtain equivalence.
The Jungle database search engine
Authors: Michael Böhlen, Linas Bukauskas, Curtis Dyreson
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

Information spread in in databases cannot be found by current search engines. A database search engine is capable to access and advertise database on the WWW. Jungle is a database search engine prototype developed at Aalborg University. Operating through JDBC connections to remote databases, Jungle extracts and indexes database data and meta-data, building a data store of database information. This information is used to evaluate and optimize queries in the AQUA query language. AQUA is a natural and intuitive database query language that helps users to search for information without knowing how that information is structured. This paper gives an overview of AQUA and describes the implementation of Jungle.
Projected realities: conceptual design for cultural effect
Authors: William Gaver, Anthony Dunne
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

As a part of a European Union sponsored project, we have proposed a system which aggregates peoples expressions over a widening network of public electronic displays in a massive Dutch housing development. Reflecting ideas from contemporary arts as well as from research on media spaces, this is an example of a conceptual design intended to produce meaningful effects on a local culture. In this paper, we describe the methods and ideas that led to this proposal, as an example of research on technologies from the traditions of artist-designers.
A Low-Loss Built-In Current Sensor
Authors: Yukiya Miura, Hiroshi Yamazaki
Venue: Journal of Electronic Testing: Theory and Applications (1999)

This paper presents a novel built-in current sensor that uses two additional power supply voltages besides the system power supply voltage, and that is constructed by using a current mirror circuit to pick up an abnormal IDDQ. It is activated only by an abnormal quiescent power supply current and minimizes the voltage drop at the terminal of the circuit under test. Simulation results showed that it could detect 16-&mu;A IDDQ against 0.03-V voltage drop at 3.3-V VDD and that it reduced performance degradation in the circuit under test. It is therefore suitable for testing low-voltage integrated circuits. Moreover, we verified the behavior of the sensor circuit implemented on the board by using discrete devices. Experimental results showed that the real circuit of the sensor functioned properly.
Backward Error Analysis for Numerical Integrators
Authors: Sebastian Reich
Venue: SIAM Journal on Numerical Analysis (1999)

Backward error analysis has become an important tool for understanding the long time behavior of numerical integration methods. This is true in particular for the integration of Hamiltonian systems where backward error analysis can be used to show that a symplectic method will conserve energy over exponentially long periods of time. Such results are typically based on two aspects of backward error analysis: (i) It can be shown that the modified vector fields have some qualitative properties which they share with the given problem and (ii) an estimate is given for the difference between the best interpolating vector field and the numerical method. These aspects have been investigated recently, for example, by Benettin and Giorgilli in [ J. Statist. Phys., 74 (1994), pp. 1117--1143], by Hairer in [Ann. Numer. Math., 1 (1994), pp. 107--132], and by Hairer and Lubich in [ Numer. Math., 76 (1997), pp. 441--462]. In this paper we aim at providing a unifying framework and a simplification of the existing results and corresponding proofs. Our approach to backward error analysis is based on a simple recursive definition of the modified vector fields that does not require explicit Taylor series expansion of the numerical method and the corresponding flow maps as in the above-cited works. As an application we discuss the long time integration of chaotic Hamiltonian systems and the approximation of time averages along numerically computed trajectories.
HandSCAPE: a vectorizing tape measure for on-site measuring applications
Authors: Jay Lee, Victor Su, Sandia Ren, Hiroshi Ishii
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2000)

We introduce HandSCAPE, an orientation-aware digital tape measure, as an input device for digitizing field measurements, and visualizing the volume of the resulting vectors with computer graphics. Using embedded orientation-sensing hardware, HandSCAPE captures relevant vectors on each linear measurements and transmits this data wirelessly to a remote computer in real-time. To guide us in design, we have closely studied the intended users, their tasks, and the physical workplaces to extract the needs from real worlds. In this paper, we first describe the potential utility of HandSCAPE for three on-site application areas: archeological surveys, interior design, and storage space allocation. We then describe the overall system which includes orientation sensing, vector calculation, and primitive modeling. With exploratory usage results, we conclude our paper for interface design issues and future developments.
Toeplitz Preconditioners Constructed from Linear Approximation Processes
Authors: Stefano Serra Capizzano
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

Preconditioned conjugate gradients (PCG) are widely and successfully used methods to solve Toeplitz linear systems An(f)x=b. Here we consider preconditioners belonging to trigonometric matrix algebras and to the band Toeplitz class and we analyze them from the viewpoint of the function theory in the case where f is supposed continuous and strictly positive. First we prove that the necessary (and sufficient) condition, in order to devise a superlinear PCG method, is that the spectrum of the preconditioners is described by a sequence of approximation operators "converging" to f . The other important information we deduce is that while the matrix algebra approach is substantially not sensitive to the approximation features of the underlying approximation operators, the band Toeplitz approach is. Therefore, the only class of methods for which we may obtain impressive evidence of superlinear convergence behavior is the one [S. Serra, Math. Comp., 66 (1997), pp. 651--665] based on band Toeplitz matrices with weakly increasing bandwidth.
Lattice-Simplex Coverings and the 84-Shape
Authors: Rod Forcade, Jack Lamoreaux
Venue: SIAM Journal on Discrete Mathematics (2000)

It is known that diameters of abelian Cayley graphs with n generators are related to Manhattan diameters of a particular type of lattice tile called a Cayley tile and that determining the lower bound of those diameters is related to the density of lattice-simplex coverings of Rn. We construct a natural tile associated with each lattice-simplex covering and show that the 84-shape (discovered in [R. Dougherty and V. Faber, The Degree-Diameter Problem for Several Varieties of Cayley Graphs, http://www.c3.lanl.gov/dm/pub/laces.html (1994) and C. M. Fiduccia, J. S. Zito, and E. Mann, Network Interconnection Architectures and Translational Tilings, Tech. report, Center for Computing Science, Bowie, MD, 1994]) represents a local mininum of the density of lattice coverings of R3 by a particular simplex D (the convex hull of the unit basis vectors).
A worldwide, web-based study of the attitudes of college freshmen toward computing
Authors: Bunny J. Tjaden
Venue: Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education (2000)

We propose to initiate a worldwide survey of colleges and universities to re-evaluate attitudes of students toward computing courses. In 1985, a study of college freshmen was conducted to determine their attitudes toward introductory computer science courses [10]. At that time, access to and experience with computers was not the norm for the typical student about to enter the university. The 1985 study found that females, as well as students with no computer experience, reported the most negative encounters with computing. We intend to expand the original study, delving into whether or not the programming language learned, compiler and operating system used, peer and parental attitudes, as well as other factors, influence a student's attitude toward computing. We are particularly interested in examining these attitudes from the standpoint of women and minorities, those who are still least likely to have prior, in-depth computer experience. Additionally, with the ease of communication due to email and the internet, we believe it is of interest to computing educators worldwide to participate in such a study. We will provide a survey instrument, a set of World Wide Web tools, and a database. Faculty and their classes from around the world will be encouraged to participate. Each institution will be able to immediately compare the profile of their students with those of other schools. We will provide search capabilities on several key fields in order to facilitate participant data analysis. We foresee the results of our survey generating a dialogue among educators and possibly changing the direction of and/or way in which computer science is taught.
New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases
Authors: Huapeng Wu, M. Anwarul Hasan, Ian F. Blake
Venue: IEEE Transactions on Computers (1998)

New structures of bit-parallel weakly dual basis (WDB) multipliers over the binary ground field are proposed. An upper bound on the size complexity of bit-parallel multiplier using an arbitrary generating polynomial is given. When the generating polynomial is an irreducible trinomial xm + xk + 1, $1\le k\le \left\lfloor {{{m \over 2}}} \right\rfloor,$ the structure of the proposed bit-parallel multiplier requires only m2 two-input AND gates and at most m2$-$1 XOR gates. The time delay is no greater than $T_A + (\lceil \log_2 m\rceil + 2)T_X,$ where TA and TX are the time delays of an AND gate and an XOR gate, respectively.
Lattice Boltzmann Models for Anisotropic Diffusion of Images
Authors: Björn Jawerth, Peng Lin, Eric Sinzinger
Venue: Journal of Mathematical Imaging and Vision (1999)

The lattice Boltzmann method has attracted more and more attention as an alternative numerical scheme to traditional numerical methods for solving partial differential equations and modeling physical systems. The idea of the lattice Boltzmann method is to construct a simplified discrete microscopic dynamics to simulate the macroscopic model described by the partial differential equations. The use of the lattice Boltzmann method has allowed the study of a broad class of systems that would have been difficult by other means. The advantage of the lattice Boltzmann method is that it provides easily implemented fully parallel algorithms and the capability of handling complicated boundaries. In this paper, we present two lattice Boltzmann models for nonlinear anisotropic diffusion of images. We show that image feature selective diffusion (smoothing) can be achieved by making the relaxation parameter in the lattice Boltzmann equation be image feature and direction dependent. The models naturally lead to the numerical algorithms that are easy to implement. Experimental results on both synthetic and real images are described.