ppxscal/embedding_network huggingface dataset:
On the Parsimony of the Multi-Layer Perceptrons when ProcessingEncoded Symbolic Variables
Authors: D. Bonnet, A. Grumbach, V. Labouisse
Venue: Neural Processing Letters (1998)

This article addresses the issue of symbolic processing with Multi-Layer Perceptrons through encoding. Given an encoding, we propose a lower bound of the number of parameters for an MLP to perform a random mapping of its input symbolic space to its output symbolic space. In the case of what we call binary encoding, the needed number of parameters may be theoretically computed. Given these two results, we show that the most efficient encodings are the ones which use one input unit per value.
Multigrid Solvers for Nonaligned Sonic Flows
Authors: Achi Brandt, Boris Diskin
Venue: SIAM Journal on Scientific Computing (1999)

We investigate an approach to the solution of nonelliptic equations on a rectangular grid. The multigrid algorithms presented here demonstrate the "textbook multigrid efficiency" even in the case that the equation characteristics do not align with the grid. To serve as a model problem, the two-dimensional (2D) and three-dimensional (3D) linearized sonic flow equations have been chosen. Efficient full-multigrid (FMG) solvers for the problems are demonstrated.
Calculating encoding and decoding functions for prefix codes
Authors: Cristóbal Pareja-Flores, J. Ángel Velázquez-Iturbide
Venue: ACM SIGPLAN Notices (1999)

The transformational model of program development allows obtaining programs correct by construction. When developing nontrivial programs, three activities arise: program synthesis, program transformation, and verification of properties; in addition, specification, use and implementation of ADTs must typically be considered all through these activities. The purpose of this article is to illustrate the need for all these activities by means of a nontrivial problem: encoding and decoding with prefix codes. Our exposition is rather informal, not being committed to any particular program transformation system, and it should be understood by any programmer looking forward to develop functional programs in a systematic way, while avoiding the burden of any particular system. In particular, we show the stages in the complete transformational development of a functional program, dealing successively with correctness and time efficiency, as well as the key decisions that are adopted.
Matrix Algebras and Displacement Decompositions
Authors: Carmine Di Fiore
Venue: SIAM Journal on Matrix Analysis and Applications (1999)

A class $\xi$ of algebras of symmetric n × n matrices, related to Toeplitz-plus-Hankel structures and including the well-known algebra $\mathcal{H}$ diagonalized by the Hartley transform, is investigated. The algebras of $\xi$ are then exploited in a general displacement decomposition of an arbitrary n × n matrix A. Any algebra of $\xi$ is a 1-space, i.e., it is spanned by n matrices having as first rows the vectors of the canonical basis. The notion of 1-space (which generalizes the previous notions of $\mathcal{L}_1$ space [Bevilacqua and Zellini, Linear and Multilinear Algebra, 25 (1989), pp. 1--25] and Hessenberg algebra [Di Fiore and Zellini, Linear Algebra Appl., 229 (1995), pp. 49--99]) finally leads to the identification in $\xi$ of three new (non-Hessenberg) matrix algebras close to $\mathcal{H}$, which are shown to be associated with fast Hartley-type transforms. These algebras are also involved in new efficient centrosymmetric Toeplitz-plus-Hankel inversion formulas.
User effort in query construction and interface selection
Authors: Paul Gerwe, Charles L. Viles
Venue: Proceedings of the fifth ACM conference on Digital libraries (2000)

This study was designed to examine user beliefs and behavior on the selection and use of search features and search interfaces. Five weeks of user logs were taken from a user-targeted collection and surveys were administered immediately before and after this time period. Survey results indicate a significant correlation between a user's level of effort and their perceived benefit from that effort.Reported search feature use increased by more than 35\% over the fiveweeks. This raises the question of how the behavior of an Internet user changes over time. Results from the log files were inconclusive but suggest a reluctance to use the advanced search interface.
Synchronization in portable device drivers
Authors: Stein J. Ryan
Venue: ACM SIGOPS Operating Systems Review (1999)

We present an overview of the synchronization mechanisms offered to device drivers by different operating systems and develop a foundation for writing portable device drivers by unifying these mechanisms. Our foundation has been used to implement an efficient portable cluster adapter driver for three different operating systems as part of the runtime system for a heterogeneous PC cluster. We show how our portable synchronization mechanisms map to the native synchronization mechanisms of these three operating systems.
Creating digital libraries together&mdash;collaboration, multimodality, and plurality
Authors: Anders Hedman
Venue: ACM SIGCSE Bulletin (1999)

Many have tried to answer the question of what a digital library is and how such libraries should be built. But, in a sense the question of how to construct digital libraries as well defined entities is misguided from the beginning. There are many approaches to building digital libraries [7, 18, 4] and each approach must be understood from within a context. Some contexts such as information retrieval and digitizing of existing materials have received much attention [12, 22, 18, 17], while other contexts have been more or less ignored [19]. One such context is that of networking from a higher level of abstraction [8, 11]. Since traditional libraries have long since existed in elaborate and large-scale physical networks it is only natural that we should see such structures mirrored in the world of digital abstract networks. The Universal Simulator [10] application builds on the idea that research in digital libraries need not necessarily focus on micro level infrastructures, but that we may also find interesting possibilities on the macro level of digital library infrastructures. Moreover, at such a macro level we may find important new ways of collaborating and building digital libraries in educational settings.
Computation of Nonclassical Solutions to Hamilton--Jacobi Problems
Authors: Pierre-Alain Gremaud, Nicholas R. Ide
Venue: SIAM Journal on Scientific Computing (1999)

This paper is devoted to the construction of numerical methods for the approximation of nonclassical solutions to multidimensional Hamilton--Jacobi equations for both scalar and vectorial problems. Recent theoretical results have yielded existence of solutions in many cases for which the usual viscosity approach was ill-suited or not applicable. The selection criterion used here is based on a viscoelasticity/capillarity approach, common in solid mechanics. Numerical methods adapted to this framework are built. Consistency of the model equation with the given selection criterion is essential. It is achieved here through the use of high-order finite difference schemes. By considering applications to potential well problems, the convergence of the methods are investigated.
Explicit Error Bounds for a Nonconforming Finite Element Method
Authors: Philippe Destuynder, Brigitte Métivet
Venue: SIAM Journal on Numerical Analysis (1998)

Let u be the solution of the following model: $$ \left\{\begin{array}{l} \mbox{find $u \in H^1_0(\Omega)$ such that} \\ [3pt] -\Delta u = f\quad\mbox{in } \Omega, \end{array}\right. $$ where f is a given function in L2(\Omega)$ and $\Omega$ a bounded open set in $\mathbb{R}^{2}$ with a polygonal boundary. Let uh be a finite element approximation of u. The goal of this paper is to suggest an explicit bound of the error (u - uh). Furthermore, this bound is obtained without complex computations. The basic idea is to define locally an admissible vector field for the dual model.
A Structure Theory for Linear Dynamic Errors-in-Variables Models
Authors: W. Scherrer, M. Deistler
Venue: SIAM Journal on Control and Optimization (1998)

We deal with problems connected with the identification of linear dynamic systems in situations when inputs and outputs may be contaminated by noise. The case of uncorrelated noise components and the bounded noise case is considered. If also the inputs may be contaminated by noise, a number of additional complications in identification arise, in particular the underlying system is not uniquely determined from the population second moments of the observations. A description of classes of observationally equivalent systems is given, continuity properties of mappings relating classes of observationally equivalent systems to the spectral densities of the observations are derived and the classes of spectral densities corresponding to a given maximum number of outputs are studied.
Evolution of the high level programming languages: a critical perspective
Authors: Masud Ahmad Malik
Venue: ACM SIGPLAN Notices (1998)

Programming languages have emerged as the powerful tools we use to describe algorithms for execution by computers. Ever since need for such languages was felt half a century ago, numerous languages have been designed and implemented with varying goals and for different application areas. This article reviews the evolution of the imperative high level programming languages and critically examines the factors that influenced different design efforts and direction of programming language design, from Zuse's Plankalkul to the present day object-oriented programming languages.
Abstracting dependencies between software configuration items
Authors: Carl A. Gunter
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2000)

This article studies an abstract model of dependencies between software configuration items based on a theory of concurrent computation over a class of Petri nets called production nets. A general theory of build optimizations and their correctness is developed based on a form of abstract interpretation called a build abstraction; these are created during a build and are used to optimize subsequent builds. Various examples of such optimizations are discussed. The theory is used to show how properties can be characterized and proved, and how optimizations can be composed and compared.
Expansive Visibilization of Work: AnActivity-Theoretical Perspective
Authors: Yrjö Engeström
Venue: Computer Supported Cooperative Work (1999)

Work is commonly made visible along two dimensions: the linear and the socio-spatial. Both are limited to depicting work in terms of relatively discrete actions. Activity theory introduces the crucial distinction between collective activity systems and individual actions. Expansive visibilization of collective activity systems offers a powerful intervention methodology for dealing with major transformations of work. The linear and the socio-spatial dimensions of work actions are seen in the broader perspective of a third, developmental dimension of work activity. Four steps are identified in a cycle of expansive visibilization, combining activity-level visions and action-level concretizations. The cycle is examined in detail as it unfolded in an intervention study at a children&lsquo;s hospital in Finland. It is concluded that expansive visibilization, driven by contradictions and seeking to reconceptualize the object and motive of work, is not a straightforward process which can be neatly controlled from above. Coherent analytical explanation and goal-setting may come only after the creation and practical implementation of innovative solutions.
A new approach to the first theory course
Authors: John E. Savage
Venue: ACM SIGACT News (1998)

This article describes a novel first theory course, entitled "Models of Computation, " that I've been teaching at Brown University for the last three years with considerable success. In fact, many students tell me that they enjoy it very much, a somewhat unusual reaction for a required theory course. I believe its appeal is due to my efforts to make the material relevant to their experience and interests by introducing new topics, namely, circuits, computer organization, and programming, and covering the standard material in an unusual order. Highlights of the course are that students acquire a good understanding of NP-complete languages by midsemester, learn almost all of the material normally taught in a theory course on formal languages and automata and computability, and develop a very good appreciation for the importance of reductions in theoretical (and non-theoretical) computer science. More information on the course can be found at www.cs.brown.edu/courses/cs051.
Hypertext databases and data mining
Authors: Soumen Chakrabarti
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

The volume of unstructured text and hypertext data far exceeds that of structured data. Text and hypertext are used for digital libraries, product catalogs, reviews, newsgroups, medical reports, customer service reports, and the like. Currently measured in billions of dollars, the worldwide internet activity is expected to reach a trillion dollars by 2002. Database researchers have kept some cautious distance from this action. The goal of this tutorial is to expose database researchers to text and hypertext information retrieval (IR) and mining systems, and to discuss emerging issues in the overlapping areas of databases, hypertext, and data mining.
Using policies for effective network management
Authors: Michele J. Wright
Venue: International Journal of Network Management (1999)

The goal of policy-based management is to reduce the complex administration of networks. Copyright &copy; 1999 John Wiley Sons, Ltd.
Data mining library reuse patterns using generalized association rules
Authors: Amir Michail
Venue: Proceedings of the 22nd international conference on Software engineering (2000)

In this paper, we show how data mining can be used to discover library reuse patterns in existing applications. Specifically, we consider the problem of discovering library classes and member functions that are typically reused in combination by application classes. This paper improves upon our earlier research using &ldquo;association rules&rdquo; [8] by taking into account the inheritance hierarchy using &ldquo;generalized association rules&rdquo;. This turns out to be a non-trivial but worthwhile endeavor.By browsing generalized association rules, a developer can discover patterns in library usage in a way that takes into account inheritance relationships. For example, such a rule might tell us that application classes that inherit from a particular library class often instantiate another class or one of its descendents. We illustrate the approach using our tool, CodeWeb, by demonstrating characteristic ways in which applications reuse classes in the KDE application framework.
Neuron-MOS Parallel Search Hardware for Real-Time Signal Processing
Authors: Tsutomu Nakai, Takeo Yamashita, Tadahiro Ohmi, Tadashi Shibata
Venue: Analog Integrated Circuits and Signal Processing (1999)

Circuit architecture for parallel data processing directly carried out on the hardware have been developed based on a high-functionality transistor, neuron MOSFET (neuMOS or &nu;MOS for short). In the &nu;MOS data sorting circuit, multiple analog input data are numbered in binary codes according to the order of their magnitudes after a single ramp voltage scan. A &nu;MOS motion-vector detector has been developed for on-chip moving image processing based on x- and y-projection data. The circuit can find the movement of an image in two successive frames within a few 100 nsec. The projection-data-based motion detection algorithm has been tested by computer simulation. Test circuits were fabricated by a double-polysilicon CMOS process and basic operation of the circuits has been demonstrated.
A Digitally Controlled Shunt Capacitor CMOS Delay Line
Authors: P. Andreani, F. Bigongiari, R. Roncella, R. Saletti, P. Terreni
Venue: Analog Integrated Circuits and Signal Processing (1999)

Delay-controlled CMOS delay lines have been proved useful in a number of applications, notably the digitization of short time intervals. This paper introduces a new kind of CMOS delay line, in which the delay element is an array of capacitors controlled by a digital signal vector. This choice allows for a robust implementation of the circuitry controlling the delay generation, while the maximum speed attainable by the line is high compared to the maximum speed achieved by other delay line architectures. The delay line presented here was designed to produce an accurately tunable 16 \times 0.5 ns delay under large temperature, supply voltage, and technological process quality variations.
Standardizing the Definition and Measurement of Catheter-Related Infection in Home Care: A Proposed Outcome Measurement System
Authors: Donna L. Zimay
Venue: Journal of Medical Systems (1999)

The growth of home health care has not been met with an equal level of clinical outcome data to objectively evaluate the quality and cost effectiveness of care provided in that sector. In response, outcome based initiatives have been introduced to address this issue. However, none have adequately addressed the incidence and impact of catheter-related infection (CRI) in the home due to the complexities of measurement in this environment. An outcomes-oriented process to standardize the definition, measurement and reporting of CRI has been developed that addresses the realities of home care in order to foster continued outcomes research and standardized comparisons between providers.
On the Homotopy Method for Perturbed Symmetric Generalized Eigenvalue Problems
Authors: T. Zhang, K. H. Law, G. H. Golub
Venue: SIAM Journal on Scientific Computing (1998)

The generalized eigenvalue problem plays a significant role in many applications. Usually only a few smallest eigenpairs (i.e., eigenvalues and their corresponding eigenvectors) are desired. A frequently encountered problem is to solve a system slightly perturbed from the original system. If the perturbation is small, the new system can be solved by using Rayleigh quotient iteration (RQI); the initial Ritz vectors are provided by the eigenvectors from the original system. However, if the perturbation is relatively large, direct use of RQI will not be sufficient and, in many cases, will give inaccurate results, such as missing some of the eigenvalues. The homotopy method can be used to remedy this problem. In this paper, we first review the homotopy method and its theoretical background. The approach employed here is based on perturbation theory. We then discuss some algorithmic issues such as step size estimation and grouping clustered eigenvalues. Numerical examples are given to illustrate the potential applications of this method.
Symmetry Detection by Generalized Complex (GC) Moments: A Close-Form Solution
Authors: Dinggang Shen, Horace H. S. Ip, Kent K. T. Cheung, Eam Khwang Teoh
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

This paper presents a unified method for detecting both reflection-symmetry and rotation-symmetry of 2D images based on an identical set of features, i.e., the first three nonzero generalized complex (GC) moments. This method is theoretically guaranteed to detect all the axes of symmetries of every 2D image, if more nonzero GC moments are used in the feature set. Furthermore, we establish the relationship between reflectional symmetry and rotational symmetry in an image, which can be used to check the correctness of symmetry detection. This method has been demonstrated experimentally using more than 200 images.
The QLP Approximation to the Singular Value Decomposition
Authors: G. W. Stewart
Venue: SIAM Journal on Scientific Computing (1999)

In this paper we introduce a new decomposition called the pivoted QLP decomposition. It is computed by applying pivoted orthogonal triangularization to the columns of the matrix X in question to get an upper triangular factor R and then applying the same procedure to the rows of R to get a lower triangular matrix L. The diagonal elements of R are called the R-values of X; those of L are called the L-values. Numerical examples show that the L-values track the singular values of X with considerable fidelity---far better than the R-values. At a gap in the L-values the decomposition provides orthonormal bases of analogues of row, column, and null spaces provided of X. The decomposition requires no more than twice the work required for a pivoted QR decomposition. The computation of R and L can be interleaved, so that the computation can be terminated at any suitable point, which makes the decomposition especially suitable for low-rank determination problems. The interleaved algorithm also suggests a new, efficient 2-norm estimator.
Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey
Authors: Rainer E. Burkard, Vladimir G. Deineko, René van Dal, Jack A. A. van, der Veen, Gerhard J. Woeginger
Venue: SIAM Review (1998)

The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an ${\cal NP}$-hard problem, many of its special cases can be solved efficiently in polynomial time. We survey these special cases with emphasis on the results that have been obtained during the decade 1985--1995. This survey complements an earlier survey from 1985 compiled by Gilmore, Lawler, and Shmoys [The Traveling Salesman Problem---A Guided Tour of Combinatorial Optimization, Wiley, Chichester, pp. 87--143].
RTL Test Justification and Propagation Analysis for Modular Designs
Authors: Yiorgos Makris, Alex Orailoǧlu
Venue: Journal of Electronic Testing: Theory and Applications (1998)

Modular decomposition and functional abstraction are commonly employed to accommodate the growing size and complexity of modern designs. In the test domain, a divide-and-conquer type of approach is utilized, wherein test is locally generated for each module and consequently translated to global design test. We present an RTL analysis methodology that identifies the test justification and propagation bottlenecks, facilitating a judicious DFT insertion process. We introduce two mechanisms for capturing, without reasoning on the complete functional space, data and control module behavior related to test translation. A traversal algorithm that identifies the test translation bottlenecks in the design is described. The algorithm is capable of handling cyclic behavior, reconvergence and variable bit-widths in an efficient manner. We demonstrate our scheme on representative examples, unveiling its potential of accurately identifying and consequently minimizing the reported controllability and observability bottlenecks of large, modular designs.
Emotional interfaces for interactive aardvarks: designing affect into social interfaces for children
Authors: Erik Strommen, Kristin Alexander
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: the CHI is the limit (1999)

Character-based social interfaces present a unique opportunity to integrate emotion into technology interactions. The present paper reports on the use of three emotional interactions (humor, praise, and affection) in the audio interfaces for two character-based interactive learning toys. The reasons for selecting the emotions used, the design rationale for their application, and findings from usability testing are reviewed. It is suggested that as a form of pretend play-acting akin to puppetry, social interfaces can engage the emotions of users in a variety of beneficial ways.