ppxscal/embedding_network huggingface dataset:
Transcript Mapping for Historic Handwritten Document Images
Authors: Catalin I. Tomai, Bin Zhang, Venu Govindaraju
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

There is a large number of scanned historical documents that need to be indexed for archival and retrieval purposes. A visual word spotting scheme that would serve these purposes is a challenging task even when the transcription of the document image is available. We propose a framework for mapping each word in the transcript to the associated word image in the document. Coarse word mapping based on document constraints is used for lexicon reduction. Then, word mappings are refined using word recognition results by a dynamic programming algorithm that finds the best match while satisfying the constraints.
On Using Deterministic Test Sets in BIST
Authors: Ondrej Novak, Jiri Nosek
Venue: Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW) (2000)

The test pattern generators (TPG) in BIST usually generate pseudorandom patterns and after the pseudorandom testing phase additional deterministic test vectors, which can be compressed by the means of the same TPG, detect the random resistant faults. Another possibility is to optimize the TPG structure so that the generated test set contains all the necessary deterministic test vectors, which detect hard-to-test faults. The vectors are obtained by the means of TPG output modifications. This approach is not acceptable for large circuits because of additional delay caused by the output combinational logic. We have proposed a TPG that has a very simple structure and in which the patterns covering the random resistant faults are generated by the TPG without any output modifying logic. XORing the pre-computed modifying bits with one of the TPG internal flip-flop input controls the TPG sequence. Finding the modifying bits is done by an own algorithm, which optimizes the fault coverage gain, which is obtained by each of the generated test vectors. Several experiments were done with the ISCAS 85 and 89 benchmark circuits. The storage capacity needed for storing the modifying bits of the exercised circuits is low while the test application time is short.
On minimizing contention at semaphores
Authors: Peter J. Denning, T. Don Dennis
Venue: ACM SIGARCH Computer Architecture News (1980)

A method for reducing semaphore and ready list contention in multiprocessor operating systems is described. The method is based on tagged memory, semaphore words, and the principle of locking the individual semaphores rather than the programs that manipulate them.
How to Sell Anything on Ebay...And Make a Fortune!, 1 edition
Authors: Dennis L. Price
Venue:  (2003)

:Make a killing on eBay and other online auction sitesWith more than 50 million users in 27 countries, eBay allows even the busiest people to make money selling anything and everything. Written by one of the most listened-to experts on online auctioneering, How to Sell Anything on eBay . . . and Make a Fortune! is the consummate guide to becoming a successful online entrepreneur.Using everyday language, it covers all the bases, from how to set up an account to sophisticated strategies for getting the highest bids and the happiest customers. Readers learn the best times of the week, month, and year to sell as well as how to:Phrase auction listings in enticing waysChoose the best categories and pick items that bring the best pricesPush profits with sharper digital imagesBuild credibility and positive feedbackSet up a storefront websiteDeal with people who don't pay The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Visualising sequences of queries: a new tool for information retrieval
Authors: R. Beale, R. J. McNab, I. H. Witten
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

This paper describes a system that uses visualisation to assist a user in dealing with the information returned from a search engine. The user's queries, and the documents they return, are represented by a 3D spatial structure that shows their relationships and provides a way of accessing and exploring the documents retrieved. It is implemented to work with the New Zealand Digital Library, a set of large document collections that is available over the Web. The visualisation scheme is a Java applet that is updated dynamically whenever the user makes a new search, and can be browsed alongside the search engine.
On the Rapid Prototyping and Design of a Wireless Communication System on a Chip
Authors: Brian Kelley
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

The evolutionary convergence of computing, integrated circuit technology, and advances in wireless communications has led to an explosive growth of personal communication devices and services (PCS). In fact, the dramatic "Moore's Law" shrinkage of IC devices, itself, has lead to an unprecedented ability to place increasingly complex systems on a chip (SoC).In a wireless communication environment, the integration task is made more difficult by the need to integrate RF, mixed signal, and digital systems. Furthermore, the digital system design task generally requires a mapping of heterogeneous stacks of software processes onto a similarly diverse collection of digital signal processors, microprocessors and application-specific integrated circuits.In this presentation, we give an overview of a modern wireless communication device and describe advanced system-level design methodologies utilized for rapid prototyping and design of current and next generation systems.
Using Coupling Measurement for Impact Analysis in Object-Oriented Systems
Authors: Lionel C. Briand, Juergen Wuest, Hakim Lounis
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

Many coupling measures have been proposed in the context of object-oriented (OO) systems. In addition, due to the numerous dependencies present in OO systems, several studies have highlighted the complexity of using dependency analysis to perform impact analysis. An alternative is to investigate the construction of probabilistic decision models based on coupling measurement to support impact analysis. In addition to providing an ordering of classes where ripple effects are more likely, such an approach is simple and can be automated. In our investigation, we perform a thorough analysis on a commercial C++ system where change data has been collected over several years. We identify the coupling dimensions that seem to be significantly related to ripple effects and use these dimensions to rank classes according to their probability of containing ripple effects. We then assess the expected effectiveness of such decision models.
Register renaming for x86 superscalar design
Authors: Chang-Chung Liu, R.-Ming Shiu, Chung-Ping Chung
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Register renaming eliminates storage conflicts for registers to allow more instruction level parallelism. This idea requires nontrivial implementation, however, especially when registers are accessible with different fields and data lengths. As a result, not all bits in a register are to be updated upon a register write, and a register read may be data-dependent on multiple register writes. We propose two hardware renaming schemes to solve these difficulties: One for its ultimate performance, and the other for its desirable cost/performance ratio. We evaluate these two schemes on an aggressive superscalar machine model for Intel 80/spl times/86 architecture. Simulation results show that the second scheme can effectively reduce the hardware cost while retaining about 99% of the performance of the first.
A new variant of restarted GMRES
Authors: Valeria Simoncini
Venue:  (1997)

GMRES is an attractive iterative method for solving large non-symmetric algebraic linear systems. Computational and storage constraints usually require to restart the method after a fixed (small) number of iterations with subsequent loss of monotonic convergence properties. Trouble may be caused by the presence of eigenvalues close to the origin which are not well detected by early restarts. Unlike recent techniques that propose to include this information in later restarts, we use a new formulation of GMRES to derive a simple variant of the algorithm. The method attemps to mitigate stagnation by exploiting the smoothness of a certain polynomial near the origin, resorting to the usual method once convergence becomes truly monotonic. EMAIL:: ian@microian.ian.pv.cnr.it KEYWORDS:: Linear systems, Iterative methods, Restarts, Residual polynomials
Randomized Asynchronous Byzantine Agreements
Authors: Sam Toueg
Venue:  (1983)

A randomized protocol for reaching Byzantine Agreement in asynchronous systems with $n$ processes was recently proposed in [Rabi83]. This protocol tolerates up to $\lfloor (n-1)/10 \rfloor$ faulty processes, and agreement is reached within an expected number of phases that is a small constant independent of $n$ and the number of faulty processes $t$. In this paper, using the same computation model as in [Rabi83], it is shown that no Byzantine Agreement protocol can overcome more than $\lfloor (n-1)/3 \rfloor$ faulty processes in an asynchronous system, and we describe a protocol that achieves this upper bound. Agreement is also reached within an expected number of phases that is a small constant independent of $n$ and $t$, but the communication complexity is higher than in [Rabi83}.
Mastering Mac OS X, 3 edition
Authors: Todd Stauffer
Venue:  (2003)

:The Essential Resource for New and Veteran Mac UsersMastering Mac OS X is your comprehensive guide to the latest OS from Apple. Designed for Mac users of every experience level, this book gives you all the information you need to begin fresh with Mac OS X, or to make a fast, trouble-free transition from an earlier release. Coverage includes: Installing Mac OS X Using the new Aqua interface and Dock Performing local and Internet searches with Sherlock Connecting to the Internet over a modem or broadband connection Managing e-mail with the built-in Mail application Accessing remote servers using Web browsers and FTP applications Configuring your own network, including Web and FTP servers Using all built-in Mac OS X applications Setting up local and network printing Managing fonts Working with ColorSync Viewing and editing movies and other multimedia with QuickTime Automating your Mac with AppleScript Troubleshooting Mac OS X Installing peripheral devices
A Real-Time Heterogeneous Distributed Computing Environment for Multi-Robot System
Authors: Khaja Qutubudin, Dan Pease
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

In this paper we propose a distributed computing framework for real-time management of large number of robots in an industrial setting. The primary design objective of this framework is to allow a centralized heterogeneous multiprocessor controller to perform real-time scheduling and evaluation of Newton-Euler equations for manipulating robot motion. The real-time scheduling of tasks in such an environment is shown to be an NP-hard problem for which we propose a deadline-based heuristic. A detailed simulation reveals that the proposed heuristic can achieve a near optimal performance.
Stable and Efficient Solution of Weighted Least-Squares Problems with Applications in Interior Point Methods
Authors: Patricia D. Hough
Venue:  (1996)

In this thesis, we consider two closely related problems. The first is a full-rank weighted least-squares problem with a weight matrix that is positive definite, diagonal, and extremely ill conditioned. The ill-conditioning can cause standard algorithms to compute solutions with, in some cases, no digits of accuracy. Theory suggests the existence of an algorithm that will compute an accurate solution despite the ill-conditioning in the weight matrix. We describe a new algorithm, the Complete Orthogonal Decomposition (COD) Algorithm, for solving the weighted least-squares problem and show that it has this desirable property. In addition, the COD Algorithm is based on standard, well-understood techniques and is straightforward to implement. A natural application for the weighted least-squares problem described in the previous paragraph is interior point methods for linear programming. We discuss the problem in this context, and describe how the COD algorithm can be extended and used in this setting. Unlike other algorithms, this one is stable for interior point methods without assuming nondegeneracy in the linear programming instance. Computational experiments indicate that it is more reliable than other algorithms when the problem is near degenerate. The second problem involves a particular interior point algorithm. In 1994, Vavasis and Ye proposed a new primal-dual path-following interior point method, the layered-step interior point (LIP) method. This algorithm interleaves traditional steps with longer, layered least-squares (LLS) steps. Computation of a LLS step requires solving a weighted least-squares problem similar to the one described above, but the weight matrix also has the property that the weights fall into well-separated groups. This additional structure allows the problem to be broken down into smaller, constrained problems with well-conditioned weight matrices. The smaller problems can then be solved stably with standard algorithms, and the LLS step can be computed. Vavasis and Ye did not propose a particular algorithm for solving the LLS problem. In this thesis, we present an algorithm based on Cholesky factorization. The algorithm is such that a modified version of the sparse Cholesky code of Ng and Peyton of Oak Ridge National Laboratories can be used. Thus, the theoretical results are straightforward, and this algorithm proves to be accurate and efficient in practice.
Methodologies for Distributed Information Retrieval
Authors: Owen de Kretser, Alistair Moffat, Tim Shimmin, Justin Zobel
Venue: Proceedings of the The 18th International Conference on Distributed Computing Systems (1998)

Text collections have traditionally been located at a single site and managed as a monolithic whole. However, it is now common for a collection to be spread over several hosts and for these hosts to be geographically separated. In this paper we examine several alternative approaches to distributed text retrieval. We report on our experience with a full implementation of these methods, and give retrieval efficiency and retrieval effectiveness results for collections distributed over both a local area network and a wide area network. We conclude that, compared to monolithic systems, distributed information retrieval systems can be fast and effective, but that they are not efficient.
Techniques for non-linear magnification transformations
Authors: T. A. Keahey, E. L. Robertson
Venue: Proceedings of the 1996 IEEE Symposium on Information Visualization (INFOVIS '96) (1996)

This paper presents efficient methods for implementing general non-linear magnification transformations. Techniques are provided for: combining linear and non-linear magnifications, constraining the domain of magnifications, combining multiple transformations, and smoothly interpolating between magnified and normal views. In addition, piecewise linear methods are introduced which allow greater efficiency and expressiveness than their continuous counterparts.
The DIN method: A New Approach for Measuring and Rating Data Processing Performance
Authors: W. Dirlewanger
Venue: Proceedings of the 2nd International Computer Performance and Dependability Symposium (IPDS '96) (1996)

When data processing systems changed from "single user, single task" type to "multi user, multi task" type the internal performance measures used traditionally became less suitable. The neccessity arose for developing measures for system performance, to replace those for component performance. However, soundly based performance definitions and a measurement method, applicable to a wide area, were not generally available. Consequently 'ad hoc' solutions were used. An advanced and ambitious method for measuring and rating system performance is the DIN method. This method is explained and it is compared to some other methods. It has proved to be suitable for a wide range of computers and for many types of data processing systems (for instance mono processor system, multiprocessor system, massive parallel systems, client/server system, cluster of computers) which have various operating systems. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Integrating COTS Software Components into Dependable Software Architectures
Authors: Paulo Asterio de C. Guerra, Alexander Romanovsky, Rogério de Lemos
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

This paper considers the problem of integrating commercial off-the-shelf (COTS) software components into systems with high dependability requirements. These components, by their very nature, are built to be reused as black boxes that cannot be modified. Instead, the system architect has to rely on techniques external with respect to the component for resolving mismatches of the services required and provided that might arise in the interaction of the component and its environment. This paper proposes an architectural solution to turning COTS components into idealised fault-tolerant COTS components by adding protective wrappers to them.
Intelligent Web Representatives
Authors: Doug Sapp, Yi Shang
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

In this paper, we present the design and implementation of an intelligent Web representative based on prevalent Internet and Web technologies. The design includes three parts: natural language parser, knowledge representation, and communication between the user and the computer. With an efficient pseudo-natural language processing, a database of knowledge stored in XML, and the user communication through Microsoft Agent, the intelligent agent can answer questions effectively.
An alternative addressing scheme for conventional CDMA fiber-optic networks allows interesting parallel processing capabilities
Authors: P. M. Wexelblat
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

A different approach to addressing on a CDMA (code division multiple access) fiber based LAN (local area network) is investigated. This change serves to enable a network with unusual properties: specifically this implementation modification enables a network that provides: immediate and simultaneous access to all users (real-time); arbitrary length transmissions (including continuous); all data available to all nodes; support of sensor type nodes (no receive or monitor capability). The technique is discussed and a theoretical use of this technique to allow a fully dynamically reconfigurable parallel multiprocessor is presented.
Intuitionistic Linear Logic and Partial Correctness
Authors: Dexter Kozen, Jerzy Tiuryn
Venue:  (2001)

We formulate a Gentzen-style sequent calculus for partial correctness that subsumes propositional Hoare Logic. The system is a noncommutative Intuitionistic Linear Logic. We prove soundness and completeness over relational and trace-based models. As a corollary we obtain a complete sequent calculus for inclusion and equivalence of regular expressions.
Indexing real-world data using semi-structured documents
Authors: A. R. Schmidt, Menzo A. Windhouwer, Martin L. Kersten
Venue:  (1999)

We address the problem of deriving meaningful semantic index information for a multi-media database using a semi-structured docu\-ment model. We show how our framework, called {\em feature grammars}, can be used to (1)~exploit third-party interpretation modules for real-world unstructured components, and (2)~use context-free grammars to convert such poorly or unstructured input to semi-structured output. The basic idea is to enrich context-free grammars with special symbols called detectors, which provide for the necessary structure {\em just-in-time} to satisfy a parser look-ahead. A prototype implementation has been constructed in the Acoi project to demonstrate the feasibility of this approach for indexing both images and audio documents.
An object-oriented design for graph visualization
Authors: M. S Marshall, Ivan Herman, Guy Melancon
Venue:  (2000)

Many applications, from everyday file system browsers to visual programming tools, require the display of network and graph structures. The Graph Visualization Framework (GVF) is an architecture that supports the tasks common to most graph browsers and editors. This article gives a brief overview of the design of the GVF and focuses on the core classes that are used to represent and manipulate graphs. The design of the core classes is justified by the requirements for navigation and visualization.
Learning Perl Objects, References, and Modules
Authors: Randel Schwartz, Tom Phoenix, Damian Conway
Venue:  (2003)

Learning Perl Objects, References & Modules picks up where Learning Perl leaves off. This new book offers a gentle introduction to the world of references, object-oriented programming, and the use of Perl modules that form the backbone of any effective Perl program. Following the successful format of Learning Perl, each chapter in the book is designed to be small enough to be read in just an hour or two. Each chapter ends with a series of exercises to help you practice what you've learned with answers in an appendix for your reference. In short, this book covers everything that separates the Perl dabbler from the Perl programmer.
Technology access: resources wasted in computer laboratories
Authors: Kristian Kiili
Venue: Proceedings of the 3.1 and 3.3 working groups conference on International federation for information processing: ICT and the teacher of the future - Volume 23 (2003)

The technological infrastructure of Finnish schools varies a lot. In some schools there are computers almost for every pupil in the classroom. On the other hand there are also schools with only a few computers in the whole school. The purpose of this paper is to study how teachers from different schools and school levels utilize technological resources in their teaching. The hypothesis is that good technological infrastructure does not guarantee the use of technological devices in teaching. The data was gathered with an electronic questionnaire in fall 2002. In order to study pupils used computers more when computers were placed in the classroom. Likewise teachers' use of computers for demonstration increased when the computers were placed in the classroom. The number of computers in separate computer rooms did not increase the usage. Thus the most important thing to be considered when planning schools' computer infrastructure is the location of computers.