ppxscal/embedding_network huggingface dataset:
Eye tracking the visual search of click-down menus
Authors: Michael D. Byrne, John R. Anderson, Scott Douglass, Michael Matessa
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Click-down (or pull-down) menus have long been a key component of graphical user interfaces, yet we know surprisingly little about how users actually interact with such menus. Nilsens [8] study on menu selection has led to the development of a number of models of how users perform the task [6, 21. However, the validity of these models has not been empirically assessed with respect to eye movements (though [l] presents some interesting data that bear on these models). The present study is an attempt to provide data that can help refine our understanding of how users interact with such menus.
Design and optimization of LC oscillators
Authors: Maria del Mar Hershenson, Ali Hajimiri, Sunderarajan S. Mohan, Stephen P. Boyd, Thomas H. Lee
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

We present a method for optimizing and automating component and transistor sizing for CMOS LC oscillators. We observe that the performance measures can be formulated as posynomial functions of the design variables. As a result, the LC oscillator design problems can be posed as a geometric program, a special type of optimization problem for which very efficient global optimization methods have recently been developed. The synthesis method is therefore fast, and determines the globally optimal design; in particular the final solution is completely independent of the starting point (which can even be infeasible), and infeasible specifications are unambiguously detected. We can rapidly compute globally optimal trade-off curves between competing objectives such as phase noise and power.
The Data-Correcting Algorithm for the Minimization of Supermodular Functions
Authors: Boris Goldengorin, Gerard Sierksma, Gert A. Tijssen, Michael Tso
Venue: Management Science (1999)

The Data-Correcting (DC) Algorithm is a recursive branch-and-bound type algorithm, in which the data of a given problem instance are "heuristically corrected" at each branching in such a way that the new instance will be as close as possible to polynomially solvable and the result satisfies a prescribed accuracy (the difference between optimal and current solution). In this paper the DC algorithm is applied to determining exact or approximate global minima of supermodular functions. The working of the algorithm is illustrated by an instance of the Simple Plant Location (SPL) Problem. Computational results, obtained for the Quadratic Cost Partition Problem (QCP), show that the DC algorithm outperforms a branch-and-cut algorithm, not only for sparse graphs but also for nonsparse graphs (with density more than 40%), often with speeds 100 times faster.
The structure of e-commerce in the banking industry: an empirical investigation
Authors: Elias M. Awad
Venue: Proceedings of the 2000 ACM SIGCPR conference on Computer personnel research (2000)

In this paper, we explore the status of e-commerce in the banking industry. A random sample of 43 commercial Virginia bank Web sites were evaluated to determine the level of e-commerce involvement and the potential of e-commerce in banking. Preliminary results indicate a state of fragmentation in the quality, content, personalization, and category of Web sites, although more and more banks have demonstrated ready commitment to &ldquo;presence&rdquo; on the Internet.
The Perfectly Matched Layer in Curvilinear Coordinates
Authors: Francis Collino, Peter Monk
Venue: SIAM Journal on Scientific Computing (1998)

In 1994 Bérenger showed how to construct a perfectly matched absorbing layer for the Maxwell system in rectilinear coordinates. This layer absorbs waves of any wavelength and any frequency without reflection and thus can be used to artificially terminate the domain of scattering calculations. In this paper we show how to derive and implement the Bérenger layer in curvilinear coordinates (in two space dimensions). We prove that an infinite layer of this type can be used to solve time harmonic scattering problems. We also show that the truncated Bérenger problem has a solution except at a discrete set of exceptional frequencies (which might be empty). Finally numerical results show that the curvilinear layer can produce accurate solutions in the time and frequency domain.
A New One-Parametric Fitting Method for Planar Objects
Authors: Klaus Voss, Herbert Suesse
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

This paper is an extension of the already published paper by Voss and Suesse [11]. In that paper, wedeveloped a new region-based fitting method using the method of normalization. There we demonstrated the zero-parametric fitting of lines, triangles, parallelograms, circles, and ellipses. In the present paper, we discuss this normalization idea for fitting of closed regions using circular segments, elliptical segments, and super-ellipses. As features, we use the area-based low order moments. We show that we have to solve only one-dimensional optimization problems in these cases.
Self-stabilizing token circulation on asynchronous uniform unidirectional rings
Authors: Laurent Rosaz
Venue: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (2000)

In [2], J. Beauquier, M. Gradinariu and C. Johnen presented a probabilistic self-stabilizing token circulation algorithm for asynchronous uniform unidirectional rings. This paper provides an improvement on this algorithm. It also computes the (message) complexity of the stabilization period of the original algorithm, which is &THgr;(N3), and the improved version, which is &THgr;(N2 log N), where N is the number of processes plus the number of messages in transit. Such algorithms are mostly used for mutual exclusion.
At the heart of information ecologies: invisibility and technical communication
Authors: Frances J. Ranney
Venue: ACM Journal of Computer Documentation (JCD) (2000)

The ecological metaphor for technological systems provides a useful supplement to others dealing with the question of human control over technologies. However, it fails to develop adequately its own reliance on communication as the means whereby human values may be embedded in technologies, or to recognize the role of professional communicators in that process.
A digital museum of Taiwanese butterflies
Authors: Jen-Shin Hong, Herng-Yow Chen, Jieh Hsiang
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

Taiwan is renown for its great variety of butterflies. There are about 400 species, a number of which unique to Taiwan, over its 36,500 sq km land. Last year we built a comprehensive digital collection of Taiwan's butterflies to provide a modern research environment on butterflies for academic institutions, as well as an interactive butterfly educational environment for the general public. Our digital museum emphasizes on the ease to use, and provides a number of innovative features to help the user fully utilize the information provided by the system. The digital museum is accessible through the Web at http://digimuse.nmns.edu.tw.
The Impact of Rate Control Algorithms on System-Level VLSI Design
Authors: Sheu-Chih Cheng, Hsueh-Ming Hang
Venue: Journal of VLSI Signal Processing Systems (1998)

This paper presents an evaluation of rate control algorithms from a system-level VLSI design viewpoint. Rate control in video coding has a significant influence on the coded bit rate and image quality. Many rate control algorithms have been proposed mainly focusing on the optimal rate-distortion performance without considering their performance on the VLSI implementation. The purpose of this study is not to propose a hardware architecture for any specific algorithm but to study the algorithm impact on hardware design. Based on our finding, a system designer should choose an algorithm not only good in rate control performance but also good in hardware implementation. When implementing and comparing a few rate control algorithms using a generic processor structure, we found that, in addition to the ordinary computational complexity, the internal buffer size is also very critical in VLSI realization. Several picture sequences have been tested including one sequence constructed specifically to simulate a difficult case for rate control. In this paper, three different types of popular rate control algorithms have been analyzed based on their picture quality, the internal buffer size, and the hardware cost. The methodology and results presented here provide useful guidelines for selecting an appropriate rate control algorithm for system-level VLSI designers.
Using selective discard to improve real-time video quality on an ethernet local area network
Authors: Yantian Della Torre Lu, Kenneth J. Christensen
Venue: International Journal of Network Management (1999)

To support real-time MPEG video on Ethernet, a selective discard scheme can be implemented to trade-off the loss of more important MPEG &ldquo;I&rdquo; frames for less important &ldquo;B&rdquo; frames. Such a scheme results in better video quality. Copyright &copy; 1999 John Wiley Sons, Ltd.
A New Fast Discrete Fourier Transform
Authors: Feng Zhou, Peter Kornerup
Venue: Journal of VLSI Signal Processing Systems (1998)

This paper presents a new fast Discrete Fourier Transform (DFT) algorithm. By rewriting the DFT, a new algorithm is obtained that uses 2n&minus;2(3n&minus;13)+4n&minus;2 real multiplications and 2n&minus;2(7n&minus;29)+6n+2 real additions for a real data N&equals;2n point DFT, comparable to the number of operations in the Split-Radix method, but with slightly fewer multiply and add operations in total. Because of the organization of multiplications as plane rotations in this DFT algorithm, it is possible to apply a pipelined CORDIC algorithm in a hardware implementation of a long-point DFT, e.g., at a 100 MHz input rate, a 1024-point transform can be realized with a 200 MHz clocking of a single CORDIC pipeline.
Expressing business rules
Authors: Ronald G. Ross
Venue: ACM SIGMOD Record (2000)

Point-and-Click Expression Builders, for instance limits and type consistency.Structured English, for more complex restrictions and logical inferences.Entity Life History or State Transition Diagrams, for both basic and more advanced state transition rules.Data Model or Class Model extensions, for basic property rules.No matter how the rules are captured, there should be a single, unified conceptual representation &ldquo;inside&rdquo; of the man-machine boundary. &ldquo;Inside&rdquo; here means transparent to the specifiers, but visible to analysis tools (e.g., for conflict analysis) and to rule engines or business logic servers (for run-time processing).Inside, there may be still other representations. For processing and performance reasons, there might be many physical representations of the rules, optimized for particular tools or hardware/software environments.The result is actually three layers of representation: external, conceptual, and internal. This is strongly reminiscent of the old ANSI/SPARC three-schema architecture for data. This should not be surprising since rules simply build on terms and facts, which can be ultimately represented by data. Where is this research now? A new, more concise representation scheme is under development. One focus of this scheme is a formal expression of how non-atomic rule types are derived from atomic ones. This would allow reduction of rules to a common base of fundamental rule types, in order to support automatic analysis of conflict and overlap in systematic fashion.This is opening exciting new avenues of research, and significant opportunities for those interested in getting involved.
Electromagnetic parasitic extraction via a multipole method with hierarchical refinement
Authors: Michael W. Beattie, Lawrence T. Pileggi
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

The increasing interconnect density and operating frequencies of system-on-a-chip (SOC) designs necessitates extraction of parasitic electromagnetic couplings beyond the localized confines of functional design blocks. In addition, SOC design styles and gridless variable-width routing make it increasingly difficult to use precharacterized library shapes for parasitic extraction. A comprehensive capacitance and inductance extraction solution requires a hierarchical data representation and fast runtime algorithms. We illustrate through examples that both the multipole method and hierarchical refinement, which are the two most successful approaches for parasitic extraction to date, work efficiently only under certain, limiting conditions. To improve this situation we present an approach which combines the best of both methods into a concurrent multipole refinement representation of the electromagnetic interaction which is efficient for arbitrary interconnect configurations. We use a generalized formulation of electromagnetic interactions to exploit the similarities in capacitance and inductance extraction for greater efficiency.
Copyright protection of designs based on multi source IPs
Authors: Edoardo Charbon, Ilhami Torunoglu
Venue: Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design (1999)

This paper addresses the copyright protection problem of integrated circuits designed with blocks which are originated from multiple design sources. The process consists of two phases. First, a compact signature is generated from every block independently and made public. Utilizing such signatures, a design can be decomposed into its original building blocks, regardless of multiple hierarchies. Then, a map of all the blocks can be built, thus allowing to reconstruct the original copyright dependencies. The proposed methodology can be used by foundries to verify that designs submitted for fabrication contain blocks traceable to a legal source of intellectual property. The verification process is also useful to intellectual property providers and integrators, as it reduces the likelihood of infringement, thus ultimately minimizing the risk of litigation.
Three Absolute Perturbation Bounds for Matrix Eigenvalues Imply Relative Bounds
Authors: Stanley C. Eisenstat, Ilse C. F. Ipsen
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

We show that three well-known perturbation bounds for matrix eigenvalues imply relative bounds: the Bauer--Fike and Hoffman--Wielandt theorems for diagonalizable matrices, and Weyl's theorem for Hermitian matrices. As a consequence, relative perturbation bounds are not necessarily stronger than absolute bounds, and the conditioning of an eigenvalue in the relative sense is the same as in the absolute sense.We also show that eigenvalues of normal matrices are no more sensitive to perturbations than eigenvalues of Hermitian positive-definite matrices. The relative error bounds are invariant under congruence transformations, such as grading and scaling.
Computation of Derivatives of Repeated Eigenvalues and the Corresponding Eigenvectors of Symmetric Matrix Pencils
Authors: Alan L. Andrew, Roger C. E. Tan
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

This paper presents and analyzes new algorithms for computing the numerical values of derivatives, of arbitrary order, and of eigenvalues and eigenvectors of ${\bf A}(\rho){\bf x}(\rho) = \lambda(\rho){\bf B}(\rho){\bf x}(\rho)$ at a point $\rho=\rho_0$ at which the eigenvalues considered are multiple. Here ${\bf A}(\rho)$ and ${\bf B}(\rho)$ are hermitian matrices which depend analytically on a single real variable $\rho,$ and ${\bf B}(\rho_0)$ is positive definite. The algorithms are valid under more general conditions than previous algorithms. Numerical results support the theoretical analysis and show that the algorithms are also useful when eigenvalues are merely very close rather than coincident.
Websom for Textual Data Mining
Authors: Krista Lagus, Timo Honkela, Samuel Kaski, Teuvo Kohonen
Venue: Artificial Intelligence Review (1999)

New methods that are user-friendly and efficient are needed for guidance among the masses of textual information available in the Internet and the World Wide Web. We have developed a method and a tool called the WEBSOM which utilizes the self-organizing map algorithm (SOM) for organizing large collections of text documents onto visual document maps. The approach to processing text is statistically oriented, computationally feasible, and scalable &ndash; over a million text documents have been ordered on a single map. In the article we consider different kinds of information needs and tasks regarding organizing, visualizing, searching, categorizing and filtering textual data. Furthermore, we discuss and illustrate with examples how document maps can aid in these situations. An example is presented where a document map is utilized as a tool for visualizing and filtering a stream of incoming electronic mail messages.
Efficient Deterministic and Probabilistic Simulations of PRAMs on Linear Arrays with Reconfigurable Pipelined Bus Systems
Authors: Keqin Li, Yi Pan, Si Qing Zheng
Venue: The Journal of Supercomputing (2000)

In this paper, we present deterministic and probabilistic methods for simulating PRAM computations on linear arrays with reconfigurable pipelined bus systems (LARPBS). The following results are established in this paper. (1) Each step of a p-processor PRAM with m&equals;O(p) shared memory cells can be simulated by a p-processors LARPBS in O(log p) time, where the constant in the big-O notation is small. (2) Each step of a p-processor PRAM with m&equals;&Omega;(p) shared memory cells can be simulated by a p-processors LARPBS in O(log m) time. (3) Each step of a p-processor PRAM can be simulated by a p-processor LARPBS in O(log p) time with probability larger than 1&minus;1/p^c for all c>0. (4) As an interesting byproduct, we show that a p-processor LARPBS can sort p items in O(log p) time, with a small constant hidden in the big-O notation. Our results indicate that an LARPBS can simulate a PRAM very efficiently.
An anonymous electronic commerce scheme with an off-line authority and untrusted agents
Authors: Josep Domingo-Ferrer, Jordi Herrera-Joancomartí
Venue: ACM SIGMOD Record (1998)

In the last years, the exponential growth of computer networks has created an incredibly large offer of products and services in the net. Such a huge amount of information makes it impossible for a single person to analyze all existing offers of a product on the net and decide which of them fits better her requirements. This problem is solved with the intelligent trade agents (ITA), which are programs that have the ability to roam a network, collect business-related data and use them to make decisions to buy goods on their owners' behalf. Known ITA systems do not provide anonymity in transactions, require an on-line trusted third party and implicitly assume that the user trusts the ITA. We present a new scheme for an intelligent untrusted trade agent system allowing anonymous electronic transactions with an off-line trusted third party.
The &rsquo;&rsquo;Harmonic&lsquo;&lsquo; Rejecting Correlation Function
Authors: Douglas Nelson
Venue: Multidimensional Systems and Signal Processing (1998)

A classical problem in signal processing is accurate estimation of fundamental frequency/periodicity of periodic signals at low SNR. Typically, researchers address the estimation problem, assuming that the signal environment is a sum of sinusoids in white Gaussian noise. If the signals and noise are pulsed, the situation is much more complex since normal FFT based methods result in spectra which are sums of harmonic structures. Sorting radar signals can be especially difficult since there may be many pulsed signals present in a low SNR impulsive noise environment. In this paper, a method equivalent to integration along a hyperbola on the Wigner distribution is presented. This transform, which is closely related to both the Fourier transform and the correlation function, has the property that a periodic signal produces an expected non-zero complex-valued bulge at only the fundamental. The phase, magnitude and position of the correlation bulge are sufficient to characterize the time-domain pulse train. Finally, a simple super-resolution method is presented which may be used to refine the fundamental frequency/period estimate.
A multimedia animated simulation generator
Authors: John Hewson, Wendy Doube, Michael Calagaz
Venue: ACM SIGCSE Bulletin (1999)

This paper shows how a multimedia multi-framed simulation generator was developed. A technique of recording a sequence of steps and playing them back as an animation overcomes the major problems with the synchronous mapping of components which execute asynchronously and non-sequentially It also preserves the integrity of instructional design. A simulation of any executing program code segment can be produced in a few hours using this generator. Four frames can simultaneously display different representations of the segment as text or graphical images. Users can step through the simulation or have it run at variable speed, and can change specified code statements to increase learning potential. The Animated Simulation Generator could be used for any frame-based animation requiring complex sets of interrelated text and/or graphical components.
Bundling Information Goods: Pricing, Profits, and Efficiency
Authors: Yannis Bakos, Erik Brynjolfsson
Venue: Management Science (1999)

We study the strategy of bundling a large number of information goods, such as those increasingly available on the Internet, and selling them for a fixed price. We analyze the optimal bundling strategies for a multiproduct monopolist, and we find that bundling very large numbers of unrelated information goods can be surprisingly profitable. The reason is that the law of large numbers makes it much easier to predict consumers' valuations for a bundle of goods than their valuations for the individual goods when sold separately. As a result, this "predictive value of bundling" makes it possible to achieve greater sales, greater economic efficiency, and greater profits per good from a bundle of information goods than can be attained when the same goods are sold separately. Our main results do not extend to most physical goods, as the marginal costs of production for goods not used by the buyer typically negate any benefits from the predictive value of large-scale bundling. While determining optimal bundling strategies for more than two goods is a notoriously difficult problem, we use statistical techniques to provide strong asymptotic results and bounds on profits for bundles of any arbitrary size. We show how our model can be used to analyze the bundling of complements and substitutes, bundling in the presence of budget constraints, and bundling of goods with various types of correlations and how each of these conditions can lead to limits on optimal bundle size. In particular we find that when different market segments of consumers differ systematically in their valuations for goods, simple bundling will no longer be optimal. However, by offering a menu of different bundles aimed at each market segment, bundling makes traditional price discrimination strategies more powerful by reducing the role of unpredictable idiosyncratic components of valuations. The predictions of our analysis appear to be consistent with empirical observations of the markets for Internet and online content, cable television programming, and copyrighted music.