ppxscal/embedding_network huggingface dataset:
Characterization of simple edge-firing games
Authors: Oliver Pretzel
Venue: Information Processing Letters (2002)

In a recent publication, Latapy and Magnien [Inform. Process. Lett. 83 (2002) 125-128] show how every distributive lattice can be represented as the set of configurations of a simple edge firing game (EFG). This is a converse of the result of Propp [Preprint, 1993] that shows that the set of configurations of an EFG forms a distributive lattice. Using this result and then the result of Latapy and Magnien gives an algorithm for converting an arbitrary EFG to a simple one with isomorphic state space.The purpose of this note is to provide a characterization of simple edge firing games. The characterization will emerge from a more general result which determines how often a particular vertex can be fired in such a game.
Hierarchical Growing Cell Structures: TreeGCS
Authors: Victoria J. Hodge, Jim Austin
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

We propose a hierarchical clustering algorithm (TreeGCS) based upon the Growing Cell Structure (GCS) neural network of Fritzke. Our algorithm refines and builds upon the GCS base, overcoming an inconsistency in the original GCS algorithm, where the network topology is susceptible to the ordering of the input vectors. Our algorithm is unsupervised, flexible, and dynamic and we have imposed no additional parameters on the underlying GCS algorithm. Our ultimate aim is a hierarchical clustering neural network that is both consistent and stable and identifies the innate hierarchical structure present in vector-based data. We demonstrate improved stability of the GCS foundation and evaluate our algorithm against the hierarchy generated by an ascendant hierarchical clustering dendogram. Our approach emulates the hierarchical clustering of the dendogram. It demonstrates the importance of the parameter settings for GCS and how they affect the stability of the clustering.
Hybrid Contextural Text Recognition with String Matching
Authors: R. M. K. Sinha, B. Prasada, G. F. Houle, M. Sabourin
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The hybrid contextural algorithm for reading real-life documents printed in varying fonts of any size is presented. Text is recognized progressively in three passes. The first pass is used to generate character hypothesis, the second to generate word hypothesis, and the third to verify the word hypothesis. During the first pass, isolated characters are recognized using a dynamic contour warping classifier. Transient statistical information is collected to accelerate the recognition process and to verify hypotheses in later processing. A transient dictionary consisting of high confidence nondictionary words is constructed in this pass. During the second pass, word-level hypotheses are generated using hybrid contextual text processing. Nondictionary words are recognized using a modified Viterbi algorithm, a string matching algorithm utilizing n grams, special handlers for touching characters, and pragmatic handlers for numerals, punctuation, hyphens, apostrophes, and a prefix/suffix handler. This processing usually generates several word hypothesis. During the third pass, word-level verification occurs.
Ranking Learning Algorithms: Using IBL and Meta-Learning on Accuracy and Time Results
Authors: Pavel B. Brazdil, Carlos Soares, Joaquim Pinto Da Costa
Venue: Machine Learning (2003)

We present a meta-learning method to support selection of candidate learning algorithms. It uses a k-Nearest Neighbor algorithm to identify the datasets that are most similar to the one at hand. The distance between datasets is assessed using a relatively small set of data characteristics, which was selected to represent properties that affect algorithm performance. The performance of the candidate algorithms on those datasets is used to generate a recommendation to the user in the form of a ranking. The performance is assessed using a multicriteria evaluation measure that takes not only accuracy, but also time into account. As it is not common in Machine Learning to work with rankings, we had to identify and adapt existing statistical techniques to devise an appropriate evaluation methodology. Using that methodology, we show that the meta-learning method presented leads to significantly better rankings than the baseline ranking method. The evaluation methodology is general and can be adapted to other ranking problems. Although here we have concentrated on ranking classification algorithms, the meta-learning framework presented can provide assistance in the selection of combinations of methods or more complex problem solving strategies.
Using Iterative Refinement to Find Reusable Software
Authors: Scott Henninger
Venue: IEEE Software (1994)

Component libraries are the dominant paradigm for software reuse, but they suffer from a lack of tools that support the problem-solving process of locating relevant components. Most retrieval tools assume that retrieval is a simple matter of matching well-formed queries to a repository. But forming queries can be difficult. A designer's understanding of the problem evolves while searching for a component, and large repositories often use an esoteric vocabulary. CodeFinder is a retrieval system that combines retrieval by reformulation (which supports incremental query construction) and spreading activation (which retrieves items related to the query) to help users find information. I designed it to investigate the hypothesis that this design makes for a more effective retrieval system. My study confirmed that it was more helpful to users seeking relevant information with ill-defined tasks and vocabulary mismatches than other query systems. The study supports the hypothesis that combining techniques effectively satisfies the kind of information needs typically encountered in software design.
Minimizing Bandwidth Requirements for On-Demand Data Delivery
Authors: Derek Eager, Mary Vernon, John Zahorjan
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

Two recent techniques for multicast or broadcast delivery of streaming media can provide immediate service to each client request, yet achieve considerable client stream sharing which leads to significant server and network bandwidth savings. This paper considers 1) how well these recently proposed techniques perform relative to each other and 2) whether there are new practical delivery techniques that can achieve better bandwidth savings than the previous techniques over a wide range of client request rates. The principal results are as follows: First, the recent partitioned dynamic skyscraper technique is adapted to provide immediate service to each client request more simply and directly than the original dynamic skyscraper method. Second, at moderate to high client request rates, the dynamic skyscraper method has required server bandwidth that is significantly lower than the recent optimized stream tapping/patching/controlled multicast technique. Third, the minimum required server bandwidth for any delivery technique that provides immediate real-time delivery to clients increases logarithmically (with constant factor equal to one) as a function of the client request arrival rate. Furthermore, it is (theoretically) possible to achieve very close to the minimum required server bandwidth if client receive bandwidth is equal to two times the data streaming rate and client storage capacity is sufficient for buffering data from shared streams. Finally, we propose a new practical delivery technique, called hierarchical multicast stream merging (HMSM), which has a required server bandwidth that is lower than the partitioned dynamic skyscraper and is reasonably close to the minimum achievable required server bandwidth over a wide range of client request rates.
Tuning the Pentium Pro Microarchitecture
Authors: David B. Papworth
Venue: IEEE Micro (1996)

This inside look at a large microprocessor development project reveals some of the reasoning (for goals, changes, trade-offs, and performance simulation) that lay behind its final form.
Fast view-dependent level-of-detail rendering using cached geometry
Authors: Joshua Levenberg
Venue: Proceedings of the conference on Visualization '02 (2002)

Level-of-detail rendering is essential for rendering very large, detailed worlds in real-time. Unfortunately, level-of-detail computations can be expensive, creating a bottleneck at the CPU.This paper presents the CABTT algorithm, an extension to existing binary-triangle-tree-based level-of-detail algorithms. Instead of manipulating triangles, the CABTT algorithm instead operates on clusters of geometry called aggregate triangles. This reduces CPU overhead, eliminating a bottleneck common to level-of-detail algorithms. Since aggregate triangles stay fixed over several frames, they may be cached on the video card. This further reduces CPU load and fully utilizes the hardware accelerated rendering pipeline on modern video cards. These improvements result in a fourfold increase in frame rate over ROAM [7] at high detail levels. Our implementation renders an approximation of an 8 million triangle heightfield at 42 frames per second with an maximum error of 1 pixel on consumer hardware.
Groupware related task design
Authors: Martin Wolf
Venue: ACM SIGGROUP Bulletin (2000)

This report summarizes the results of a workshop on Groupware related task design which took place at the International Conference on Supporting Group Work Group'99, Arizona, from 14th to 17th November 1999.The workshop was addressed to people from different viewpoints, backgrounds, and domains:&bull; Researchers dealing with questions of task analysis and task modeling for Groupware application from an academic point of view. They may contribute model-based design approaches or theoretically oriented work&bull; Practitioners with experience in the design and everyday use of groupware systems. They might refer to the practical side of the topic: "real" tasks, "real" problems, "real" users, etc.
Scheme: A Interpreter for Extended Lambda Calculus
Authors: Gerald Jay Sussman, Guy L. Steele,  Jr.
Venue: Higher-Order and Symbolic Computation (1998)

Inspired by ACTORS [7, 17], we have implemented an interpreter for a LISP-like language, SCHEME, based on the lambda calculus [2], but extended for side effects, multiprocessing, and process synchronization. The purpose of this implementation is tutorial. We wish to: 1.alleviate the confusion caused by Micro-PLANNER, CONNIVER, etc., by clarifying the embedding of non-recursive control structures in a recursive host language like LISP. 2.explain how to use these control structures, independent of such issues as pattern matching and data base manipulation. 3.have a simple concrete experimental domain for certain issues of programming semantics and style. This paper is organized into sections. The first section is a short &ldquo;reference manual&rdquo; containing specifications for all the unusual features of SCHEME. Next, we present a sequence of programming examples which illustrate various programming styles, and how to use them. This will raise certain issues of semantics which we will try to clarify with lambda calculus in the third section. In the fourth section we will give a general discussion of the issues facing an implementor of an interpreter for a language based on lambda calculus. Finally, we will present a completely annotated interpreter for SCHEME, written in MacLISP [13], to acquaint programmers with the tricks of the trade of implementing non-recursive control structures in a recursive language like LISP.This report describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory&lsquo;s artificial intelligence research is provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contract N00014-75-C-0643.
Influence of Defuzzification Methods on the Rate of Tuning a Fuzzy Model
Authors: A. P. Rotshtein, S. D. Shtovba
Venue: Cybernetics and Systems Analysis (2002)

The results of computer experiments performed to determine the influence of defuzzification methods on the rate of tuning fuzzy models are presented. The experiments were conducted for the defuzzification methods of the center of gravity and center of maxima and for the median method. The defuzzification method of the center of gravity was found to be the best method providing the highest tuning rate and exactness.
Software Development for Engineers with C, Pascal, C++, Assembly Language, Visual Basic, HTML, Javascript and Java
Authors: William J. Buchanan
Venue:  (1997)

:With the move toward s graphic user interface programming, engineers require a sound knowledge of several programming languages. This book introduces most of the main technical languages in a single volume. Using C++ and Pascal to provide a basic grounding in software development the author then goes on to introduce more advanced concepts such as object-oriented design through the development of C++. Sections on Visual Basic and 80X86 Assembly Language follow before Java, Windows NT and DOS are introduced, finishing with an overview of the UNIX system. All the example programs included relate to real life applications.
q-Pell sequences and two identities of V.A. Lebesgue
Authors: José Plínio O. Santos, Andrew V. Sills
Venue: Discrete Mathematics (2002)

We examine a pair of Rogers-Ramanujan type identities of Lebesgue, and give polynomial identities for which the original identities are limiting cases. The polynomial identities turn out to be q-analogs of the Pell sequence. Finally, we provide combinatorial interpretations for the identities.
Digital Analysis of Rotated Images
Authors: S. Alliney
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The problem of estimating the relative rotations of two images taken from the same scene is considered, and a numerical method for computing such rotations is presented. The main features of the proposed method consist of the possibility of fast in-place computations with no preliminary interpolation of the data and a considerable precision for moderate rotation angles. The final estimate is performed with a least square criterion, but in the present case, even such computations can be substantially simplified. A detailed analysis shows that for practical applications, the influence of discretization errors does not affect, in a relevant way, the precision of the results; that is also confirmed by numerical experiments.
Multidimensional fechnerian scaling: perceptual separability
Authors: Ehtibar N. Dzhafarov
Venue: Journal of Mathematical Psychology (2002)

A new definition of the perceptual separability of stimulus dimensions is given in terms of discrimination probabilities. Omitting technical details, stimulus dimensions are considered separable if the following two conditions are met: (a) the probability of discriminating two sufficiently close stimuli is computable from the probabilities with which one discriminates the projections of these stimuli on the coordinate axes; (b) the psychometric differential for discriminating two sufficiently close stimuli that differ in one coordinate only does not depend on the value of their matched coordinates (the psychometric differential is the difference between the probability of discriminating a comparison stimulus from a reference stimulus and the probability with which the reference is discriminated from itself). Thus defined perceptual separability is analyzed within the framework of the regular variation version of multidimensional Fechnerian scaling. The result of this analysis is that the Fechnerian metric of a stimulus space with perceptually separable dimensions has the structure of a Minkowski power metric with respect to these dimensions. The exponent of this metric equals the psychometric order of the stimulus space, or 1, whichever is greater.
Multimodal Estimation of Discontinuous Optical Flow using Markov Random Fields
Authors: F. Heitz, P. Bouthemy
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

The estimation of dense velocity fields from image sequences is basically an ill-posed problem, primarily because the data only partially constrain the solution. It is rendered especially difficult by the presence of motion boundaries and occlusion regions which are not taken into account by standard regularization approaches. In this paper, the authors present a multimodal approach to the problem of motion estimation in which the computation of visual motion is based on several complementary constraints. It is shown that multiple constraints can provide more accurate flow estimation in a wide range of circumstances. The theoretical framework relies on Bayesian estimation associated with global statistical models, namely, Markov random fields. The constraints introduced here aim to address the following issues: optical flow estimation while preserving motion boundaries, processing of occlusion regions, fusion between gradient and feature-based motion constraint equations. Deterministic relaxation algorithms are used to merge information and to provide a solution to the maximum a posteriori estimation of the unknown dense motion field. The algorithm is well suited to a multiresolution implementation which brings an appreciable speed-up as well as a significant improvement of estimation when large displacements are present in the scene. Experiments on synthetic and real world image sequences are reported.
Integrating occlusion culling with view-dependent rendering
Authors: Jihad El-Sana, Neta Sokolovsky, Cláudio T. Silva
Venue: Proceedings of the conference on Visualization '01 (2001)

We present a novel approach that integrates occlusion culling within the view-dependent rendering framework. View-dependent rendering provides the ability to change level of detail over the surface seamlessly and smoothly in real-time. The exclusive use of view-parameters to perform level-of-detail selection causes even occluded regions to be rendered in high level of detail. To overcome this serious drawback we have integrated occlusion culling into the level selection mechanism. Because computing exact visibility is expensive and it is currently not possible to perform this computation in real time, we use a visibility estimation technique instead. Our approach reduces dramatically the resolution at occluded regions.
Some Additions to "Solution of Switching Equations Based on a Tabular Algebra"
Authors: S. H. Unger
Venue: IEEE Transactions on Computers (1994)

A method was presented by A.L. Ruiz, P.P. Trabado, and J.O. Lopera for efficiently generating the solutions of Boolean equations by using tables (i.e., rectangular arrays or matrices) of 0's, 1's, and dashes to represent Boolean expressions. Some enhancements of their method are presented. First, it is shown how the uniting theorem can be applied directly to simplify tables. Then it is shown how to complement a table, which would make their method (henceforth referred to as RTL) directly applicable to expressions containing complemented subexpressions. The latter result allows the method to be extended from the solution of equations of the form f(X)=1 to equations of the form f(X)=0, and, more generally to equations of the form f(X)=g(X), or to simultaneous equations of the same types.
Investigation of barrier and slurry effects on the galvanic corrosion of copper
Authors: D. Ernur, S. Kondo, D. Shamiryan, K. Maex
Venue: Microelectronic Engineering (2002)

Galvanic corrosion of copper as a function of barrier metal type together with the effect of acid type is investigated. Refractory metals such as Ta, Ti, and W are used as the barrier metals. HNO3-based and H2O2-based aqueous solutions are used to analyze the effect of acid type of the CMP slurry on the galvanic corrosion. The results show that the galvanic etch rate of copper is affected by the barrier metal type. In addition, the type of solution used is found to influence the barrier metal as well as the copper. Especially for the case of W, the change in the direction of the electrical current flow between copper and the barrier metal depending on the type of solution used seems to alter the galvanic reaction mechanism.
A Performance Analysis of Pentium Processor Systems
Authors: Michael Bekerman, Avi Mendelson
Venue: IEEE Micro (1995)

This paper describes the architecture of the Pentium processor and provides a performance analysis of Pentium based systems. The paper presents the utilization of different architectural features of the Pentium processor under different software environments. This information aims to contribute to a better understanding of the design tradeoffs and the potential causes of performance bottle-necks. We provide the performance analysis from the CPI (cycles per instruction) point of view. We present a breakdown of the CPI into its basic constituents and examine the effects of different operating systems, such as Windows 3.1, Windows NT, Unix, and different applications on the CPI. The breakdown of the CPI indicates where the application spends its time while being executed.
Multibox Parsers: No More Handwritten Lexical Analyzers
Authors: Lev J. Dyadkin
Venue: IEEE Software (1995)

Tools are available to generate the parser part of the compiler front end from the grammar describing the language being parsed. Tools like Lex/Yacc assume that the parser has two parts, or "boxes": the lexical analyzer and the syntax analyzer. This approach poses significant problems for lexically complex languages like Fortran because one box for the entire lexical analysis is not enough to express grammatically the level of complexity. As a result, compiler writers abandon Lex (which does the lexical analysis) and produce handwritten lexical analyzers, thus defeating the main purpose of the parser generator, which is to automate the production of the entire parser. An alternative to the two-box parser, and one that overcomes these complexity problems, is the multibox parser. Instead of having a box for lexical analysis and a box for syntax analysis, the multibox parser has a string of boxes. Each box modifies its input language to produce a more "straightened" output language for the next box. The number of boxes needed depends on the complexity of the language to be parsed. This multibox approach allows the automatic generation of a lexical analyzer regardless of the language to be parsed because it has enough boxes to handle the level of lexical complexity, even in languages as complex as the new Fortran 90 standard.Although the approach has been used in constructing compilers only for Fortran 90, it is suitable for the construction of compilers for other languages as well. In this case, the number and design of the boxes and corresponding grammars must provide for the new language.
Induction By Attribute Elimination
Authors: Xindong Wu, David Urpani
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

In most data-mining applications where induction is used as the primary tool for knowledge extraction from real-world databases, it is difficult to precisely identify a complete set of relevant attributes. This paper introduces a new rule induction algorithm called Rule Induction Two In One (RITIO), which eliminates attributes in the order of decreasing irrelevancy. Like ID3-like decision tree construction algorithms, RITIO makes use of the entropy measure as a means of constraining the hypothesis search space; but, unlike ID3-like algorithms, the hypotheses language is the rule structure and RITIO generates rules without constructing decision trees. The final concept description produced by RITIO is shown to be largely based on only the most relevant attributes. Experimental results confirm that, even on noisy, industrial databases, RITIO achieves high levels of predictive accuracy.