ppxscal/embedding_network huggingface dataset:
Reducing dictionary size by using a hashing technique
Authors: D. J. Dodds
Venue: Communications of the ACM (1982)

Peterson [3] described a variety of techniques to implement a spelling checker for plain-language documents and discussed the central importance of the structure and size of the dictionary used by such a program. The technique presented here can produce a compact, easily accessed and modified dictionary. This is done by exploiting two characteristics of the spelling checker: the sole use of the dictionary is to determine whether given strings are, or are not, in the dictionary; and a small, but nonzero probability of error is acceptable in many applications. Many other types of programs have similar characteristics and could use this concept equally well.
Minimal adaptive routing with limited injection on Toroidal k-ary n-cubes
Authors: Fabrizio Petrini, Marco Vanneschi
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Virtual channels can be used to implement deadlock free adaptive routing algorithms and increase network throughput. Unfortunately, they introduce asymmetries in the use of buffers of symmetric networks as the toroidal k-ary n-cubes. In this paper we present a minimal adaptive routing algorithm that tries to balance the use of the virtual channels by limiting the injection of new packets into the network. The experimental results, conducted on a 256 nodes torus, show that it is possible to increase the saturation point and to keep the network throughput stable at high traffic rates. The comparison with the Chaos router, a non minimal cut-through adaptive routing, shows that our algorithm obtains similar performance results using only a small fraction of buffers and a simpler router model.
Optimized implementations of the multi-configuration DFT technique for analog circuits
Authors: M. Renovell, F. Azaïs, Y. Bertrand
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The paper describes an approach to optimize the application of the multi-configuration DFT technique for analog circuits. This technique allows to emulate the circuit in a number of new test configurations targeting the maximum fault coverage. The brute force application of the multi-configuration is shown to produce a very significant improvement of the original poor testability. An optimized approach is proposed to apply this DFT technique in a more refined way. The optimization problem consists in choosing among the various permitted test configurations, a set that leads to the best testability/cost trade-off. This set is selected according to ordered requirements: (i) the fundamental requirement of maintaining the maximum fault coverage and (ii) non- fundamental requirements of satisfying some user-defined cost functions such as test time, silicon overhead or performance degradation. Results are given that exhibit very interesting features in terms of either test procedure simplicity or DFT penalty reduction.
Local Convergence of the Affine-Scaling Interior-Point Algorithm for Nonlinear Programming
Authors: L. N. Vicente
Venue: Computational Optimization and Applications (2000)

This paper addresses the local convergence properties of the affine-scaling interior-point algorithm for nonlinear programming. The analysis of local convergence is developed in terms of parameters that control the interior-point scheme and the size of the residual of the linear system that provides the step direction. The analysis follows the classical theory for quasi-Newton methods and addresses q-linear, q-superlinear, and q-quadratic rates of convergence.
A formal approach for the presentation of interactive multimedia documents
Authors: P. N. M. Sampaio, J. P. Courtiat
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

This paper presents the on-going work using a formal approach for the design of Interactive Multimedia Documents (IMDs) based on the RT-LOTOS formal description technique. The present work extends this approach proposing the scheduling of IMDs based on a simple and operational model obtained as a result from the reachability analysis. One important breakthrough of this model is that it is a scheduling graph that provides the control of the occurrence of non-deterministic events, such as user interactions, within valid temporal intervals so that the global synchronization constraints of the document can be fulfilled during its presentation. Further on, some scheduling policies are also presented based on this model. Finally, we introduce some characteristics of the player actually available for the presentation of IMDs based on this new model.
A tool framework for static and dynamic analysis of object-oriented software with templates
Authors: Kathleen A. Lindlan, Janice Cuny, Allen D. Malony, Sameer Shende, Forschungszentrum Juelich Reid Rivenburgh, Craig Rasmussen, Bernd Mohr
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

The developers of high-performance scientific applications often work in complex computing environments that place heavy demands on program analysis tools. The developers need tools that interoperate, are portable across machine architectures, and provide source-level feedback. In this paper, we describe a tool framework, the Program Database Toolkit (PDT), that supports the development of program analysis tools meeting these requirements. PDT uses compile-time information to create a complete database of high-level program information that is structured for well-defined and uniform access by tools and applications. PDT's current applications make heavy use of advanced features of C++, in particular, templates. We describe the toolkit, focussing on its most important contribution-its handling of templates-as well as its use in existing applications.
Scheduling of conditional process graphs for the synthesis of embedded systems
Authors: P. Eles, K. Kuchcinski, Z. Peng, A. Doboli, P. Pop
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

We present an approach to process scheduling based on an abstract graph representation which captures both dataflow and the flow of control. Target architectures consist of several processors, ASICs and shared busses. We have developed a heuristic which generates a schedule table so that the worst case delay is minimized. Several experiments demonstrate the efficiency of the approach.
Usability testing with screen reading technology in a Windows environment
Authors: Kitch Barnicle
Venue: Proceedings on the 2000 conference on Universal Usability (2000)

Ever since applications with graphical user interfaces were introduced, individuals who are blind have experienced great difficulty accessing these applications. The quality of access provided through a combination of screen reading software and speech synthesizer is greatly dependent on the design of the mainstream application interface. In attempt to better understand the access strategies employed by users of screen readers, this study was designed to (a) examine the interaction between users of screen reading technology and graphical user interface (GUI) elements and (b) to identify the type and significance of obstacles encountered during these interactions. Fifty-eight unique obstacles encountered by participants were identified. These obstacles were encountered by the thirteen participants a total 534 times. Although many obstacles lead to minor delays, the cumulative effect of these obstacles was to significantly delay, and in many cases, prevent task completion.
An efficient algorithm for the configuration problem of dominance graphs
Authors: Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only normal dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.
Development and use of an assembler in computer systems courses
Authors: Soe Than
Venue: Proceedings of the second annual CCSC on Computing in Small Colleges Northwestern conference (2000)

Assembly language programming provides students the ability to manipulate bits and bytes inside a computer. But how do they know that the effect of their assembly language program is the same as what they have expected? If there is a way to `see' the bits and bytes after execution of their programs, they will understand more about that computer and its instructions. Therefore a simulator and an assembler for a basic computer, designed in Computer System Architecture (3rd Edition) by M. Morris Mano [1], was developed and used in our Computer Systems course. The background information about the basic computer, development of the simulator and the assembler, our experience in using them in our course, and benefits gained from using them are discussed.
High speed neural network chip for trigger purposes in high energy physics
Authors: W. Eppler, T. Fischer, H. Gemmeke, A. Menchikov
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

A novel neural chip SAND (Simple Applicable Neural Device) is described. It is highly usable for hardware triggers in particle physics. The chip is optimized for a high input data rate (50 MHz, 16 bit data) at a very low cost basis. The performance of a single SAND chip is 200 MOPS due to four parallel 16 bit multipliers and 40 bit adders working in one clock cycle. The chip is able to implement feedforward neural networks with a maximum of 512 input neurons and three hidden layers. Kohonen feature maps and radial basis function networks may be also calculated. Four chips will be implemented on a PCI-board for simulation and on a VME board for trigger and on- and off-line analysis.
First&ndash;Order Representations of Discrete Linear MultidimensionalSystems
Authors: Eva Zerz
Venue: Multidimensional Systems and Signal Processing (2000)

The classical local state&ndash;space models for discrete multidimensional linear systems, as proposed by Roesser or Fornasini and Marchesini, require causality of the resulting transfer matrices. We consider a generalization comprising non-causal systems, based on Willems' state-space behaviors. A vector of manifest and a vector of latent variables are supposed to be linked via a first&ndash;order dynamic equation and a static equation. Any system of linear constant&ndash;coefficient partial difference equations gives rise to such an ``output&ndash;nulling'' (ON) representation. Controllable systems possess driving&ndash;variable representations, which are the dual counterpart of ON reps in many aspects. We study these representations with respect to their minimality, observability and controllability, and we derive conditions for their reducibility to the standard input&ndash;state&ndash;output setting.
Exploring recursion in Hilbert curves (poster session)
Authors: Richard Rasala
Venue: Proceedings of the 6th annual conference on Innovation and technology in computer science education (2001)

This tip will describe the use of a graphical tool to explore the recursive Hilbert curves and will explain some of the mathematical information that can be visualized using this tool.
Optimal covering tours with turn costs
Authors: Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia
Venue: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (2001)

We give the first algorithmic study of a class of &ldquo;covering tour&rdquo; problems related to the geometric Traveling Salesman Problem: Find a polygonal tour for a cutter so that it sweeps out a specified region (&ldquo;pocket&rdquo;), in order to minimize a cost that depends not only on the length of the tour but also on the number of turns. These problems arise naturally in manufacturing applications of computational geometry to automatic tool path generation and automatic inspection systems, as well as arc routing (&ldquo;postman&rdquo;) problems with turn penalties. We prove lower bounds (NP-completeness of minimum-turn milling) and give efficient approximation algorithms for several natural versions of the problem, including a polynomial-time approximation scheme based on a novel adaptation of the m-guillotine method.
TCP/IP and security software applications
Authors: William Natale
Venue: Proceedings of the seventh annual consortium for computing in small colleges central plains conference on The journal of computing in small colleges (2001)

The TCP/IP protocol suite refers to a family of protocols. The designers of TCP/IP divided the job of a full protocol suite into a number of tasks delineated as layers (show in Figure 1 below). Each layer has a different, but specific task in communication. Conceptually, it is useful to envision the layers of TCP/IP as a stack. The first layer called the link layer is responsible for communicating with the actual network hardware (e.g., Ethernet card). The second, the network layer, is responsible for determining how to get data to its destination. This layer cannot guarantee that data will reach its destination, but does decide where data should be sent. The third, the transport layer, provides data flows to the application layer and data may be checked for reliability. The fourth, the application layer, is the level where users typically interact with the network and telnet, ftp, email, and IRC reside.
Combining ALGOL statement analysis with validity checking
Authors: Paul McIsaac
Venue: Communications of the ACM (1960)

The article by Robert W. Floyd in the March 1960 issue described an algorithm for determining whether a given symbol string is a permissible ALGOL assignment statement. In his method Mr. Floyd replaces certain character pairs by single characters in an array until, in the well-formed formula, the character &Sgr; is obtained. Although this method indeed determines formation legality, one must still analyze and delimit each constituent of the statement in order to reduce the problem language to a workable format.
Robust Point Correspondence Applied to Two-and Three-Dimensional Image Registration
Authors: Elizabeth Guest, Elizabeth Berry, Richard A. Baldock, Márta Fidrich, Mike A. Smith
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

Accurate and robust correspondence calculations are very important in many medical and biological applications. Often, the correspondence calculation forms part of a rigid registration algorithm, but accurate correspondences are especially important for elastic registration algorithms and for quantifying changes over time. In this paper, a new correspondence calculation algorithm, CSM (Correspondence by Sensitivity to Movement), is described. A robust corresponding point is calculated by determining the sensitivity of a correspondence to movement of the point being matched. If the correspondence is reliable, a perturbation in the position of this point should not result in a large movement of the correspondence. A measure of reliability is also calculated. This correspondence calculation method is independent of the registration transformation and has been incorporated into both a 2D elastic registration algorithm for warping serial sections and a 3D rigid registration algorithm for registering pre and postoperative facial range scans. These applications use different methods for calculating the registration transformation and accurate rigid and elastic alignment of images has been achieved with the CSM method. It is expected that this method will be applicable to many different applications and that good results would be achieved if it were to be inserted into other methods for calculating a registration transformation from correspondences.
Asymptotic Stability and Energy Decay Rates for Solutions of the Wave Equation with Memory in a Star-Shaped Domain
Authors: M. Aassila, M. M. Cavalcanti, J. A. Soriano
Venue: SIAM Journal on Control and Optimization (2000)

We study the asymptotic stability and give the energy decay rates for solutions of the wave equation with boundary dissipation of the memory type.
Dynamic format specifications
Authors: John E. Ranelletti
Venue: Communications of the ACM (1965)

The use and implementation of two new FORTRAN format conversions are discussed. These format types give the FORTRAN programmer control of input/output specifications at execution time.
The design of a portable scientific tool: a case studying using SnB
Authors: Steven M. Gallo, Russ Miller, Charles M. Weeks
Venue: Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) (1996)

Developing and maintaining a large software package is a complex task. Decisions are made early in the design process that affect i) the ability of a user to effectively exploit the package and ii) the ability of a software engineer to maintain it. This case study discusses issues in software development and maintainability of a scientific package called SnB, which is used to determine molecular crystal structures. The design of the user interface is discussed along with important software engineering concepts, including modular programming, data encapsulation, and internal code documentation. Fortran is a language that is still widely used in the scientific community. Issues concerning the integration of Fortran into a modern scientific application with a C-based user interface are also discussed. Scientific applications benefit from being available on a wide variety of platforms. Due to demand, SnB is available on a variety of sequential and parallel platforms. Methods used in the design of SnB for such portability are presented including POSIX compliance, automatic configuration scripts, and parallel programming techniques.
Multidimensional Random Process Synthesis and Simulation
Authors: Jarosaw Figwer
Venue: Multidimensional Systems and Signal Processing (2000)

In the paper, wide-sense stationary M-D (multidimensional) random processes, defined by their power spectral densities, are synthesised and simulated by using as an approximation M-D multisine random processes consisting of a sum of M-D sine components with deterministic amplitudes and random phase shifts. On the basis of the power spectral density function and phase shifts chosen with some well defined random properties the finite discrete Fourier transform of the M-D multisine random process is synthesised. The corresponding M-D multisine random process approximation is simulated by performing an inverse M-D finite Fourier transform of the synthesised spectrum. Realisations of the synthesised and simulated random process approximations may be obtained by using an M-D fast Fourier transform algorithm. The properties of synthesised M-D multisine random processes are discussed including M-D white multisine random process.
Gathering crowds: mapping the post-human social body
Authors: Teri Rueb
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

As a digital artist, I seek to create experiential works that engage participants in an infinite feedback loop of interaction and discovery. My goal is to create works that exist in a perpetual state of transformation and becoming. I am interested in the rhythm and music of everyday activities such as walking and driving&mdash;compositions that have no beginning, ending, inside or outside. Such movements, when captured and visualized, provide a portrait of the social body that reflects our understanding of Self and Other.
Implementing soft real-time agent control
Authors: Régis Vincent, Bryan Horling, Victor Lesser, Thomas Wagner
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Real-time control has become increasingly important as technologies are moved from the lab into real world situations. The complexity associated with these systems increases as control and autonomy are distributed, due to such issues as precedence constraints, shared resources, and the lack of a complete and consistent world view. In this paper we describe a real-time environment requiring distributed control, and how we modified our existing multi-agent technologies to meet this need. Two types of enhancements are covered: those which enable planning to meet real-time constraints, such as our task representation, meta-level costing, alternative plan selection, and partial-order scheduling, and those which facilitate on-line real-time control, including scheduling flexibility, caching, and windowed commitments.
Curricula and resources for courses about multimedia (panel session)
Authors: Edward A. Fox, Wolfgang Effelsberg, Nicolas Georganas, Rachelle S. Heller, Ralf Steinmetz
Venue: Proceedings of the eighth ACM international conference on Multimedia (2000)

This panel will discuss a recommendation for curricula guidelines for courses about multimedia. Based on conference input, the guidelines will be modified for review prior to future publication by ACM (with other groups). The recommendation will be one of the main results of a June 2000 Dagstuhl workshop led by 4 of the panelists. Dr. Heller, the 5th panelist, also attended that workshop, and is co-PI with the panel moderator on a directly related NSF project, Curriculum Resources in Interactive Multimedia, CRIM, see http://ei.cs.vt.edu/~crim. Each of the panelists has taught courses about multimedia. Each is interested in developing tools/demonstrations/resources to help in those course. Each has a particular area of interest in the multimedia field. Together they constitute a representative group among those who will contribute to and benefit from curricula resources in multimedia.
Managing the computer resource: a stage hypothesis
Authors: Richard L. Nolan
Venue: Communications of the ACM (1973)

Based on the study of expenditures for data processing, a descriptive stage hypothesis is presented. It is suggested that the planning, organizing, and controlling activities associated with managing the computer resource will change in character over a period of time, and will evolve in patterns roughly correlated to four stages of the computer budget: Stage I (computer acquisition), Stage II (intense system development), Stage III (proliferation of controls), and Stage IV (user/service orientation). Each stage is described and related to individual tasks for managing the computer resource.
An interactive model-based environment for eye-movement protocol analysis and visualization
Authors: Dario D. Salvucci
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

This paper describes EyeTracer, an interactive environment for manipulating, viewing, and analyzing eye-movement protocols. EyeTracer augments the typical functionality of such systems by incorporating model-based tracing algorithms that interpret protocols with respect to the predictions of a cognitive process model. These algorithms provide robust strategy classification and fixation assignment that help to alleviate common difficulties with eye-movement data, such as equipment noise and individual variability. Using the tracing algorithms for analysis and visualization, EyeTracer facilitates both exploratory analysis for initial understanding of behavior and confirmatory analysis for model evaluation and refinement.