ppxscal/embedding_network huggingface dataset:
Browsing in a digital library collecting linearly arranged documents
Authors: Yanhua Qu, Keizo Sato, Makoto Nakashima, Tetsuro Ito
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

A method of assisting a user in finding the required documents effectively is proposed. A user being informed which documents are worth examining can browse in a digital library (DL) in a linear fashion. Computational evaluations were carried out, and a DL and its navigator are designed and constructed.
SP/k: a system for teaching computer programming
Authors: R. C. Holt, D. B. Wortman, D. T. Barnard, J. R. Cordy
Venue: Communications of the ACM (1977)

SP/k is a compatible subset of the PL/I language that has been designed for teaching programming. The features of the SP/k language were chosen to encourage structured problem solving by computers, to make the language easy to learn and use, to eliminate confusing and redundant constructs, and to make the language easy to compile. The resulting language is suitable for introducing programming concepts used in various applications, including business data processing, scientific calculations and non-numeric computation. SP/k is actually a sequence of language subsets called SP/1, SP/2, &hellip; SP/8. Each subset introduces new programming language constructs while retaining all the constructs of preceding subsets. Each subset is precisely defined and can be learned or implemented without the following subsets.
Virtual Java/FPGA interface for networked reconfiguration
Authors: Yajun Ha, Geert Vanmeerbeeck, Patrick Schaumont, Serge Vernalde, Marc Engels, Rudy Lauwereins, Hugo De Man
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A virtual interface between Java and FPGA for networked reconfiguration is presented. Through the Java/FPGA interface, Java applications can exploit hardware accelerators with FPGAs for both functional flexibility and performance acceleration. At the same time, the interface is platform independent. It enables the networked application developers to design their applications with only one interface in mind when considering the interfacing issues. The virtual interface is part of our work to build a platform-independent deployment framework for the networked services. In the framework, both the software and hardware components of services can be platform independently described and deployed.
Hardware prediction for data coherency of scientific codes on DSM
Authors: J. T. Acquaviva, W. Jalby
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

This paper proposes a hardware mechanism for reducing coherency overhead occurring in scientific computations within DSM systems. A first phase aims at detecting, in the address space regular patterns (called streams) of coherency events (such as requests for exclusive, shared or invalidation). Once a stream is detected at a loop level, regularity of data access can be exploited at the loop level (spatial locality) but also between loops (temporal locality). We present a hardware mechanism capable of detecting and exploiting efficiently these regular patterns. Expectable benefits as well as hardware complexity are discussed and the limited drawbacks and potential overheads are exposed. For a benchmarks suite of typical scientific applications results are very promising, both in terms of coherency streams and the effectiveness of our optimizations.
Automatic Construction of 2D Shape Models
Authors: Nicolae Duta, Anil K. Jain, Marie-Pierre Dubuisson-Jolly
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2001)

A procedure for automated $2D$ shape model design is presented. The modeling system is given a set of training example shapes defined by the coordinates of their contour points. The shapes are automatically aligned using Procrustes analysis and clustered to obtain cluster prototypes (typical objects) and statistical information about intracluster shape variation. One difference from previously reported methods is that the training set is first automatically clustered and those shapes considered to be outliers are discarded. In this way, the cluster prototypes are not distorted by outlier shapes. A second difference is in the manner in which registered sets of points are extracted from each shape contour. We propose a flexible point matching technique that takes into account both pose/scale differences as well as nonlinear shape differences between a pair of objects. The matching method is independent of the initial relative position/scale of the two objects and does not require any manually tuned parameters. Our shape model design method was used to learn 11 different shapes from contours that were manually traced in MR brain images. The resulting model was then employed to segment several MR brain images that were not included in the shape-training set. A quantitative analysis of our shape registration approach, within the main cluster of each structure, demonstrated results that compare very well to those achieved by manual registration; achieving an average registration error of about 1 pixel. Our approach can serve as a fully automated substitute to the tedious and time-consuming manual $2D$ shape registration and analysis.
Efficient wire formats for high performance computing
Authors: Fabian E. Bustamante, Greg Eisenhauer, Karsten Schwan, Patrick Widener
Venue: Proceedings of the 2000 ACM/IEEE conference on Supercomputing (CDROM) (2000)

High performance computing is being increasingly utilized in non-traditional circumstances where it must interoperate with other applications. For example, online visualization is being used to monitor the progress of applications, and real-world sensors are used as inputs to simulations. Whenever these situations arise, there is a question of what communications infrastructure should be used to link the different components. Traditional HPC-style communications systems such as MPI offer relatively high performance, but are poorly suited for developing these less tightly-coupled cooperating applications. Object-based systems and meta-data formats like XML offer substantial plug-and-play flexibility, but with substantially lower performance. We observe that the flexibility and baseline performance of all these systems is strongly determined by their "wire format," or how they represent data for transmission in a heterogeneous environment. We examine the performance implications of different wire formats and present an alternative with significant advantages in terms of both performance and flexibility.
A phonological rule tester
Authors: Daniel G. Bobrow, J. Bruce Fraser
Venue: Communications of the ACM (1968)

Theoretical and practical values of error coefficients useful in bounding the error in integrating periodic analytic functions with the trapezoidal rule are tabulated for various ranges of the parameters.
A Light Workflow Management System Using SimpleProcess Models
Authors: Alessandra Agostini, Giorgio de Michelis
Venue: Computer Supported Cooperative Work (2000)

Workflow management systems are considered a hot technology. Nevertheless, up to now they have not had the diffusion other packages such as productivity tools, E-mail systems and groupware platforms have. We believe that this fact is due to the many limitations of current workflow technology (weak support for changes; complex exception handling mechanisms; limited openness to and integrability with other system components&semi; &hellip;) and that radically new workflow management systems should be designed and developed in order to offer adequate products to the market. In this paper, we outline the main innovative features of the workflow management component of the Milano system making it highly flexible and adaptable. Particular attention is paid to its modelling framework, which is based on a class of net systems well supported by efficient algorithms, and to the services it offers to both workflow designers and actors. The most relevant aspects of the MILANO workflow management system are also illustrated through a realistic example.
Estimation of the errors at signal harmonic components amplitudes cross influence at its spectral analysis on computer (abstract only)
Authors: Yaroslav Dragan, Petro Yevtux, Galyna Sharina
Venue: Proceedings of the symposium on Contemporary computing in Ukraine (2000)

A method of estimation of systematic errors at signal spectral components amplitudes cross influence at its spectral analysis on computer is presented.
Computer experiments in finite algebra
Authors: Ward Douglas Maurer
Venue: Communications of the ACM (1966)

A medium-scale programming system is written in MAD and FAP on the IBM 7094 to manipulate some of the objects of modern algebra: finite groups, maps and sets of maps, subsets and sets of subsets, constant integers and truth-values. Designed to operate in a time-sharing environment, the system can serve as a teacher's aid to the undergraduate student of modern algebra, as well as for the working scientist or engineer wishing to familiarize himself with the subject.
Extracting Structure from Optical Flow Using the Fast Error Search Technique
Authors: Sridhar Srinivasan
Venue: International Journal of Computer Vision (2000)

In this paper, we present a globally optimal and computationally efficient technique for estimating the focus of expansion (FOE) of an optical flow field, using fast partial search. For each candidate location on a discrete sampling of the image area, we generate a linear system of equations for determining the remaining unknowns, viz. rotation and inverse depth. We compute the least squares error of the system without actually solving the equations, to generate an error surface that describes the goodness of fit across the hypotheses. Using Fourier techniques, we prove that given an N &times; N flow field, the FOE, and subsequently rotation and structure, can be estimated in {\cal O}(N^2 log N) operations. Since the resulting system is linear, bounded perturbations in the data lead to bounded errors.We support the theoretical development and proof of our technique with experiments on synthetic and real data. Through a series of experiments on synthetic data, we prove the correctness, robustness and operating envelope of our algorithm. We demonstrate the utility of our technique by applying it for detecting obstacles from a monocular sequence of images.
Building interoperable digital library services: MARIAN, open archives, and the NDLTD
Authors: Edward A. Fox, Robert France, Marcos Andre Goncalves, Hussein Suleman
Venue: Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001)

In this demonstration, we present interoperable and personalized search services for the Networked Digital Library of Theses and Dissertations (NDLTD). Using standard protocols and software, including those specified by the Open Archives Initiative (OAI), distributed sites can share metadata easily. On top of these harvesting protocols, we implement a union collection of theses managed by the MARIAN digital library system. Our demonstration covers aspects of NDLTD, OAI, and MARIAN.
Composing letters with a simulated listening typewriter
Authors: John D. Gould, John Conti, Todd Hovanyecz
Venue: Communications of the ACM (1983)

With a listening typewriter, what an author says would be automatically recognized and displayed in front of him or her. However, speech recognition is not yet advanced enough to provide people with a reliable listening typewriter. An aim of our experiments was to determine if an imperfect listening typewriter would be useful for composing letters. Participants dictated letters, either in isolated words or in consecutive word speech. They did this with simulations of listening typewriters that recognized either a limited vocabulary (1000 or 5000 words)or an unlimited vocabulary. Results suggest that some versions, even upon first using them, could be at least as good as traditional methods of handwriting and dictating. Isolated word speech with large vocabularies may provide the basis for a useful listening typewriter.
The intelligent classroom: providing competent assistance
Authors: David Franklin, Kristian Hammond
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

In the software industry, designers are forever trying to &ldquo;improve&rdquo; their products by adding ever more features to them, producing bloated software systems that are capable of doing just about anything. However, these systems often make it increasingly difficult for their users to perform their tasks as they are forced to wade through a mess of unwanted features to find the few that they actually need. We believe that a fruitful area of research is in building intelligent systems for particular tasks and then having the systems actively try to assist their users in performing these tasks. Such a system knows the plans (and the problems associated with those plans) that their users are likely to pursue. These \textit{competent assistants} can use their expertise on their particular tasks to guide their users through their tasks, provide better help, or perhaps even volunteer to take over some part of the task. Such an assistive agent is able to helpful because, through its task knowledge, it is able to limit what it needs to consider in cooperating with its user. In this paper we look at the implementation of a competent assistant that functions in a physical domain. The Intelligent Classroom is a prototype automated lecture facility that serves as its own audio/visual assistant. We focus on the representations and algorithms to use task knowledge to produce cooperative behavior, arguing these techniques could easily to be extended for use in a wide range of domains (i.e. both physical and purely electronic domains).
A Cumulant Expansion Technique for Simultaneous Markov Random Field Image Restoration and Hyperparameter Estimation
Authors: Marc Sigelle
Venue: International Journal of Computer Vision (2000)

We investigate hyperparameter estimation for incomplete data in Markov random Field image restoration. Assuming linear dependence of energies with respect to hyperparameters framework, we use a cumulant expansion technique widely known in Statistical Physics and Signal Processing. New insight is given on Maximum Likelihood estimation of hyperparameters of the prior, regularization and contour probability distribution functions (pdfs) for an explicit joint boundary-pixel process aimed to preserve discontinuities. In particular the case where the prior regularization potential is an homogeneous function of pixels is fully analyzed. A Generalized Stochastic Gradient (GSG) algorithm with a fast sampling technique is devised aiming to achieve simultaneous hyperparameter estimation and pixel restoration. Image restoration performances of Posterior Mean performed during GSG convergence and of Simulated Annealing performed after GSG convergence are compared experimentally. Results and perspectives are given.
Fully Differential Class-AB Log-Domain Integrator
Authors: Ezz I. El-Masry, Jie Wu
Venue: Analog Integrated Circuits and Signal Processing (2000)

A new fully differential class-AB log-domain integrator is proposed. The structure consists of two non-inverting integrators and an intersection circuit with a common-feedback circuit. The effects of transistor non-idealities and signal path mismatches on the differential integrator are investigated. A 5th-order Chebyshev low-pass filter which can be tuned from 1 to 45 MHz is designed. The validity and stability of the proposed circuits are verified using HSPICE simulations.
An Implementation of Constructive Synchronous Programs in POLIS
Authors: Gérard Berry, Ellen M. Sentovich
Venue: Formal Methods in System Design (2000)

Design tools for embedded reactive systems commonly use a model of computation that employs both synchronous and asynchronous communication styles. We form a junction between these two with an implementation of synchronous languages and circuits (Esterel) on asynchronous networks (POLIS). We implement fact propagation, the key concept of synchronous constructive semantics, on an asynchronous non-deterministic network: POLIS nodes (CFSMs) save state locally to deduce facts, and the network globally propagates facts between them. The result is a correct implementation of the synchronous input/output behavior of the program. Our model is compositional, and thus permits implementations at various levels of granularity from one CFSM per circuit gate to one CFSM per circuit. This allows one to explore various tradeoffs between synchronous and asynchronous implementations.
An Analytical Model of Adaptive Wormhole Routing in Hypercubes in the Presence of Hot Spot Traffic
Authors: Mohamed Ould-Khaoua, Hamid Sarbazi-Azad
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

Analytical models of fully adaptive routing for common wormhole-routed networks (e.g., hypercubes) under the uniform traffic pattern have recently been reported in the literature. However, many studies have revealed that the performance advantages of adaptive routing over deterministic routing is more noticeable when the traffic is nonuniform due to, for example, the existence of hot spots in the network. This paper proposes a new queueing model of fully adaptive routing in the hypercube in the presence of hot spot traffic. The analysis focuses on Duato's algorithm [11], but can easily be applied to other fully adaptive routing algorithms. Results from simulation experiments are presented to validate the model.
Password security: a case history
Authors: Robert Morris, Ken Thompson
Venue: Communications of the ACM (1979)

This paper describes the history of the design of the password security scheme on a remotely accessed time-sharing system. The present design was the result of countering observed attempts to penetrate the system. The result is a compromise between extreme security and ease of use.
Techniques for Supporting Dynamic and Adaptive Workflow
Authors: Peter J. Kammer, Gregory Alan Bolcer, Richard N. Taylor, Arthur S. Hitomi, Mark Bergman
Venue: Computer Supported Cooperative Work (2000)

The unpredictability of business processes requires that workflow systems support exception handling with the ability to dynamically adapt to the changing environment. Traditional approaches to handling this problem have fallen short, providing little support for change, particularly once the process has begun execution. Further, exceptions vary widely in their character and significance, challenging the application of any single approach to handling them. We briefly discuss the classification of exceptions, highlighting differing impacts on the workflow model. Based on this discussion, we suggest principal goals to address in the development of adaptive workflow support, including strategies for avoiding exceptions, detecting them when they occur, and handling them at various levels of impact. We then identify a number of specific approaches to supporting these goals within the design of a workflow system infrastructure. Finally, we describe the implementation of many of these approaches in the Endeavors workflow support system.
Design of an ATM switch for handoff support
Authors: Heechang Kim, H. Jonathan Chao
Venue: Wireless Networks (2000)

In a wireless ATM system, a network must provide seamless services to mobile users. To support this, mobility function should be added to existing ATM networks. Through a handoff operation, a mobile user can receive a service from the network without disconnecting the communication. A handoff results in connection path rerouting during an active connection. To avoid cell loss during a handoff, cell buffering and rerouting are required in the network. A handoff switch is a connection breakdown point on an original connection path in the network from which a new connection sub&dash;path is established. It performs cell buffering and rerouting during a handoff. Cell buffering and rerouting can introduce a cell out&dash;of&dash;sequence problem. In this paper we propose a handoff switch architecture with a shared memory. The architecture performs cell buffering and rerouting efficiently by managing logical queues of virtual connections in the shared memory and sorting head&dash;of&dash;line cells for transmission, thus achieving in&dash;sequence cell delivery during a handoff. We also present simulation results to understand the impacts of handoffs on switch performance.
Utilizing memory bandwidth in DSP embedded processors
Authors: Catherine H. Gebotys
Venue: Proceedings of the 38th annual Design Automation Conference (2001)

This paper presents a network flow approach to solving the register binding and allocation problem for multiword memory access DSP processors. In recently announced DSP processors, such as Star*core, sixteen bit instructions which simultaneously access four words from memory are supported. A polynomial-time network flow methodology is used to allocate multiword accesses while minimizing code size. Results show that improvements of up to 87% in terms of memory bandwidth (and up to 30% reduction in energy dissipation) are obtained compared to compiler-generated DSP code. This research is important for industry since this value-added technique can increase memory bandwidths and minimize code size without increasing cost.
Bit-sliced index arithmetic
Authors: Denis Rinfret, Patrick O'Neil
Venue: Proceedings of the 2001 ACM SIGMOD international conference on Management of data (2001)

The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how to efficiently generate new BSI's Z, V, and W, such that Z = X + Y, V = X - Y, and W = MIN(X, Y); this means that if a row r in T has a value x represented in BSI X and a value y in BSI Y, the value for r in BSI Z will be x + y, the value in V will be x - y and the value in W will be MIN(x, y). Since a bitmap representing a set of rows is the simplest bit-sliced index, BSI arithmetic is the most straightforward way to determine multisets of rows (with duplicates) resulting from the SQL clauses UNION ALL (addition), EXCEPT ALL (subtraction), and INTERSECT ALL (min) (see [OO00, DB2SQL] for definitions of these clauses). Another contribution of the current paper is to generalize BSI range restrictions from [ONQ97] to a new non-Boolean form: to determine the top k BSI-valued rows, for ally meaningful value k between one and the total number of rows in T. Together with bit-sliced addition, this permits us to solve a common basic problem of text retrieval: given an object-relational table T of rows representing documents, with a collection type column K representing keyword terms, we demonstrate an efficient algorithm to find k documents that share the largest number of terms with some query list Q of terms. A great deal of published work on such problems exists in the Information Retrieval (IR) field. The algorithm we introduce, which we call Bit-Sliced Term-Matching, or BSTM, uses an approach comparable in performance to the most efficient known IR algorithm, a major improvement on current DBMS text searching algorithms, with the advantage that it uses only indexing we propose for native database operations.
Online programming
Authors: Jules I. Schwartz
Venue: Communications of the ACM (1966)

When the transition has been made from offline to online programming, there are a number of changes in the working conditions noted. These changes in the environment make necessary corresponding changes in the processes related to producing and checking out programs. In the main, it is not the programming language itself which must be changed to provide a facility for the online user; it is the system surrounding the programming language. In this paper the online environment and its effect on programming are discussed.