ppxscal/embedding_network huggingface dataset:
Embedding Connectionist Autonomous Agents in Time: The &lsquo;Road Sign Problem&rsquo;
Authors: R. M. Rylatt, C. A. Czarnecki
Venue: Neural Processing Letters (2000)

This paper identifies a problem of significance for approaches to adaptive autonomous agent research seeking to go beyond reactive behaviour without resorting to hybrid solutions. The feasibility of recurrent neural network solutions are discussed and compared in the light of experiments designed to test ability to handle long-term temporal dependencies, in a more situated context than hitherto. It is concluded that a general-purpose recurrent network with some processing enhancements can begin to fulfil the requirements of this non-trivial problem.
On generation of test problems for linear programming codes
Authors: A. Charnes, W. M. Raike, J. D. Stutz, A. S. Walters
Venue: Communications of the ACM (1974)

Users of linear programming computer codes have realized the necessity of evaluating the capacity, effectiveness, and accuracy of the solutions provided by such codes. Large scale linear programming codes at most installations are assumed to be generating correct solutions without ever having been &ldquo;bench-marked&rdquo; by test problems with known solutions. The reason for this failure to adequately test the codes is that rarely are there large problems with known solutions readily available. This paper presents a theoretical justification and an Illustrative implementation of a method for generating linear programming test problems with known solutions. The method permits the generation of test problems that are of arbitrary size and have a wide range of numerical characteristics.
Regularized Bundle-Adjustment to Model Heads from Image Sequences without Calibration Data
Authors: P. Fua
Venue: International Journal of Computer Vision (2000)

We address the structure-from-motion problem in the context of head modeling from video sequences for which calibration data is not available. This task is made challenging by the fact that correspondences are difficult to establish due to lack of texture and that a quasi-euclidean representation is required for realism.We have developed an approach based on regularized bundle-adjustment. It takes advantage of our rough knowledge of the head's shape, in the form of a generic face model. It allows us to recover relative head-motion and epipolar geometry accurately and consistently enough to exploit a previously-developed stereo-based approach to head modeling. In this way, complete and realistic head models can be acquired with a cheap and entirely passive sensor, such as an ordinary video camera, with minimal manual intervention.We chose to demonstrate and evaluate our technique mainly in the context of head-modeling. We do so because it is the application for which all the tools required to perform the complete reconstruction are available to us. We will, however, argue that the approach is generic and could be applied to other tasks, such as body modeling, for which generic facetized models exist.
Matching and searching analysis for parallel hardware implementation on FPGAs
Authors: Pablo Moisset, Pedro Diniz, Joonseok Park
Venue: Proceedings of the 2001 ACM/SIGDA ninth international symposium on Field programmable gate arrays (2001)

Matching and searching computations play an important role in the indexing of data. These computations are typically encoded in very tight loops with a single index variable and a simple search/ matching predicate. Their inherent sequential nature, either because of data dependences but more often because of very strong control dependences, makes it impossible to apply existing data dependence and parallelization analysis to exploit significant levels parallelism on traditional architectures. This paper describes a class of searching and matching computations and describes a mapping strategy to map these computations to hardware. We have developed a compiler analysis in SUIF using array data dependence analysis and implicit loop unrolling analysis to expose more parallelism for the parallel evaluation of these computations. Our compiler generates parallel hardware specifications in VHDL. The resulting parallel hardware yields significant performance improvements when these kernel operators are repeated over shifted portions of the input data on FPGA-based computing architectures.
Performance evaluation of an agent server capable of hosting large numbers of agents
Authors: Gaku Yamamoto, Hideki Tai
Venue: Proceedings of the fifth international conference on Autonomous agents (2001)

Recently Web sites have been providing users with services in accordance with their preference data. In addition to such configuration services, notification services, which process jobs in response to events which occurred at a server in the users' absence, and asynchronous services, which perform jobs after users submit requests, are also available. An agent server architecture which manages users' agents on the server side is proposed for developing systems which provide such services. Such agent servers must be able to sustain high performance. In this paper, we demonstrate that the agent server approach can achieve higher performance than an existing approach which uses DBMS. Also, we describe the performance characteristics of the agent server.
Embedded Control Systems Development with Giotto
Authors: Thomas A. Henzinger, Benjamin Horowitz, Christoph Meyer Kirsch
Venue: Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems (2001)

Giotto is a principled, tool-supported design methodology for implementing embedded control systems on platforms of possibly distributed sensors, actuators, CPUs, and networks. Giotto is based on the principle that time-triggered task invocations plus time-triggered mode switches can form the abstract essence of programming real-time control systems. Giotto consists of a programming language with a formal semantics, and a retargetable compiler and runtime library. Giotto supports the automation of control system design by strictly separating platform-independent functionality and timing concerns from platform-dependent scheduling and communication issues. The time-triggered predictability of Giotto makes it particularly suitable for safety-critical applications with hard real-time constraints. We illustrate the platform-independence and time-triggered execution of Giotto by coordinating a heterogeneous flock of Intel x86 robots and Lego Mindstorms robots.
An Optimal Algorithm for Monte Carlo Estimation
Authors: Paul Dagum, Richard Karp, Michael Luby, Sheldon Ross
Venue: SIAM Journal on Computing (2000)

A typical approach to estimate an unknown quantity $\mu$ is to design an experiment that produces a random variable Z, distributed in [0,1] with E[Z]=\mu$, run this experiment independently a number of times, and use the average of the outcomes as the estimate. In this paper, we consider the case when no a priori information about Z is known except that is distributed in [0,1]. We describe an approximation algorithm ${\cal A}{\cal A}$ which, given $\epsilon$ and $\delta$, when running independent experiments with respect to any Z, produces an estimate that is within a factor $1+\epsilon$ of $\mu$ with probability at least $1-\delta$. We prove that the expected number of experiments run by ${\cal A}{\cal A}$ (which depends on Z) is optimal to within a constant factor {for every} Z.
Robust Stability of Multivariate Polynomials, Part 3: FrequencyDomain Approach
Authors: V. L. Kharitonov, M. I. Ramirez-Sosa, J. A. Torres-Muñoz
Venue: Multidimensional Systems and Signal Processing (2000)

A new formulation of the zero exclusion principle is presented and it is applied to the study of robust stability of multivariate polynomials. It has been proven that the stability radius of a stable polynomial coincides with its strict sense stability radius. Similar results are presented for the case of structured stability radius.
A Dependability Analysis for Systems with Global Spares
Authors: Meng-Lai Yin, Douglas M. Blough, Lubomir Bic
Venue: IEEE Transactions on Computers (2000)

Systems with global spares, in which a spare can replace any of multiple identical primary modules, are widely used. We present efficient algorithms for approximating the probability distribution of performance level (number of working modules) in systems with global spares and arbitrary module failure distribution. For nondegradable systems with global spares and arbitrary module failure distribution, our algorithms provide the first efficient solution for reliability. For degradable systems with global spares, our algorithms can be used to produce upper and lower bounds on various dependability measures.
Design issues of iDICT: a gaze-assisted translation aid
Authors: Aulikki Hyrskykari, Päivi Majaranta, Antti Aaltonen, Kari-Jouko Räihä
Venue: Proceedings of the 2000 symposium on Eye tracking research & applications (2000)

Eye-aware applications have existed for long, but mostly for very special and restricted target populations. We have designed and are currently implementing an eye-aware application, called iDict, which is a general-purpose translation aid aimed at mass markets. iDict monitors the user's gaze path while s/he is reading text written in a foreign language. When the reader encounters difficulties, iDict steps in and provides assistance with the translation. To accomplish this, the system makes use of information obtained from reading research, a language model, and the user profile. This paper describes the idea of the iDict application, the design problems and the key solutions for resolving these problems.
On the approximate solution of Δ u=F(u)
Authors: D. Greenspan, M. Yohe
Venue: Communications of the ACM (1963)

Three-dimensional Dirichlet problems for &Dgr;u = F(u), Fu &gE; 0, are treated numerically by an exceptionally fast, exceptionally accurate numerical method. Programming details, numerous examples and mathematical theory are supplied. Extension of the method in a natural way to n-dimensional problems is indicated by means of a 4-dimensional example.
Color Constancy Using the Inter-Reflection from a Reference Nose
Authors: Mohamed Abdellatif, Yutaka Tanaka, Akio Gofuku, Isaku Nagai
Venue: International Journal of Computer Vision (2000)

This paper introduces a novel camera attachment for measuring the illumination color spatially in the scene. The illumination color is then used to transform color appearance in the image into that under white light.The main idea is that the scene inter-reflection through a reference camera-attached surface &ldquo;Nose&rdquo; can, under some conditions, represent the illumination color directly. The illumination measurement principle relies on the satisfaction of the gray world assumption in a local scene area or the appearance of highlights, from dielectric surfaces. Scene inter-reflections are strongly blurred due to optical dispersion on the nose surface and defocusing of the nose surface image. Blurring smoothes the intense highlights and it thus becomes possible to measure the nose inter-reflection under conditions in which intensity variation in the main image would exceed the sensor dynamic range.We designed a nose surface to reflect a blurred scene version into a small image section, which is interpreted as a spatial illumination image. The nose image is then mapped to the main image for adjusting every pixel color. Experimental results showed that the nose inter-reflection color is a good measure of illumination color when the model assumptions are satisfied. The nose method performance, operating on real images, is presented and compared with the Retinex and the scene-inserted white patch methods.
Coarse grain reconfigurable architecture (embedded tutorial)
Authors: Reiner Hartenstein
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

The paper gives a brief survey over a decade of R&D on coarse grain reconfigurable hardware and related compilation techniques and points out its significance to the emerging discipline of reconfigurable computing.
Closed Form Solution of Local Shape from Shading at Critical Points
Authors: Takayuki Okatani, Koichiro Deguchi
Venue: International Journal of Computer Vision (2000)

In the theory of shape from shading, behaviours of the local solution around a critical point of the image play an important role. This paper shows that the second derivatives of the object surface can be locally determined at these image critical points. Closed form expressions of the surface second derivatives in terms of the second derivatives of the image brightness and of the reflectance map are shown. They are derived as follows: By differentiating the image irradiance equation twice at an image critical point, a set of polynomial equations is obtained that contains the second derivatives of the surface, of the image brightness and of the reflectance map. Regarding these equations as simultaneous equations for unknown surface second derivatives, they are algebraically solved and their explicit expressions are derived. Such a derivation is possible only at image critical points and is impossible at any other image point. The applicability of the derived expressions to noisy images is tested using synthetic images.
Microcode assistant
Authors: Richard J. Haverlack
Venue: ACM SIGMICRO Newsletter (1987)

The Microcode Assistant is the interactive, graphic tool for creating, editing, assembling and verifying microcode. 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
An information resource for computer science educators
Authors: Renée McCauley, Bill Manaris
Venue: ACM SIGCSE Bulletin (2000)

This paper describes an information resource for educators in departments offering computer science degree programs. This resource is designed to provide structured, up-to-date information in terms of demographics and statistics related to curricula, faculty, and students in such departments. Additionally, it facilitates the identification of various trends based on these data over several years. This paper presents highlights of the information generated through this project.
The connectivity shapes video
Authors: Martin Isenburg, Stefan Gumhold, Craig Gotsman
Venue: Proceedings of the seventeenth annual symposium on Computational geometry (2001)

In this video we introduce a 3D shape representation that is based sol ely on mesh connectivity -- the {\em connectivity shape}. Given a connectivity, we define its natural geometry as a smooth embedding in space with uniform edge lengths and describe efficient techniques to compute it. Furthermore, we show how to generate connectivity shapes that approximate given shapes. The details will soon be published in form of a full paper.
Design of tree structures for efficient querying
Authors: R. G. Casey
Venue: Communications of the ACM (1973)

A standard information retrieval operation is to determine which records in a data collection satisfy a given query expressed in terms of data values. The process of locating the desired responses can be represented by a tree search model. This paper poses an optimization problem in the design of such trees to serve a well-specified application. The problem is academic in the sense that ordinarily the optimal tree cannot be implemented by means of practical techniques. On the other hand, it is potentially useful for the comparison it affords between observed performance and that of an intuitively attractive ideal search procedure. As a practical application of such a model this paper considers the design of a novel tree search scheme based on a bit vector representation of data and shows that essentially the same algorithm can be used to design either an ideal search tree or a bit-vector tree. An experimental study of a small formatted file illustrates the concepts.
A synthesis procedure for flexible logic functions
Authors: I. Pomeranz, S. M. Reddy
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

Certain applications allow flexibility in the specification of a function f by allowing any function in a subset F to be substituted for f. We call such functions flexible functions. Among the acceptable functions in F, the goal of synthesis is to find the function whose implementation minimizes a cost criterion such as area. We propose a method to select the implemented function based on a specific architecture that uses logic blocks called comparison units. We also demonstrate the advantages of using comparison unit based implementations as an intermediate synthesis step for conventional, non-flexible functions.
H204M &mdash; watermarking for media: classification, quality evaluation, design improvements
Authors: Jana Dittmann, Martin Steinebach, Thomas Kunkelmann, Ludwig Stoffels
Venue: Proceedings of the 2000 ACM workshops on Multimedia (2000)

Security has become one of the most significant problems for spreading new information technology. Beside cryptographic solutions digital watermarking methods offer several protection possibilities. H204M &mdash; Watermarking for Media is a joined project at GMD-IPSI (German National Research Center for Information Technology) and the German broadcast archive DRA funded by the German government to classify, evaluate and improve digital watermarking techniques. Today a wide variety of techniques has been proposed but it is quite difficult to classify the approaches and measure their quality. Our intention in this project is to discuss the main watermarking parameter and to present a media independent classification scheme as a basis for quality evaluation. Furthermore one outstanding goal of the project is practical testing of existing techniques in a real scenario at the DRA with the content-management provider tecmath AG. Practical experiences are an essential basis for better design approaches. To date, such integration of watermarking algorithm into content management systems are not evaluated. In parallel a group was established initiated by Fabien Petitcolas to offer a public automated watermarking evaluation service: StirMark Benchmark. In our paper we present the H204M project scenario, first results of the media-independent classification scheme and the StirMark Benchmark evaluation service.
Algorithm 417: Rapid computation of weights of interpolatory quadrature rules
Authors: Sven-Åke Gustafson
Venue: Communications of the ACM (1971)

This algorithm is a companion to [1] where the theoretical background is described
Mechanical Circulatory Support Systems&mdash;A review
Authors: D. Mihaylov, G. J. Verkerke, G. Rakhorst
Venue: Technology and Health Care (2000)

Congestive Heart Failure (CHF) is a major health problem with a high mortality rate. Its ultimate therapy, heart transplantation, is limited by the shortage of donor hearts. Since decades researchers have been working to solve this problem by developing Mechanical Circulatory Support Systems (MCSS) that can replace or assist the failing heart. Short-term and intermediate-term ventricular assist devices are used nowadays frequently to bridge patients with severe heart failure to recovery. Long-term ventricular assist devices (VADs) and Total Artificial Hearts (TAHs) are used increasingly as a bridge to heart transplantations or as permanent circulatory support in patients with end-stage heart failure that are contraindicated for heart transplantation. The early TAHs and VADs were mainly driven from an external pneumatic drive unit. The latest generation TAHs and long-term assist devices are electrically powered, ultracompact, totally implantable, and have small wearable drive/control consoles, allowing patients to return to their daily activities. The article categorizes and reviews the development of MCSS, highlights the medical indications and contraindications of
Design of fault-secure parity-prediction booth multipliers
Authors: M. Nicolaidis, R. O. Duarte
Venue: Proceedings of the conference on Design, automation and test in Europe (1998)

The basic drawback of parity prediction arithmetic operators is that they may not be fault secure for single faults. In a recent work we have proposed a theory for achieving fault secure design for parity prediction multipliers and dividers. This paper has not considered the case of Booth multipliers using operand recoding. This case is analyzed here. Parity prediction logic and fault secure implementation for this scheme is derived.
Assessing software maintainability
Authors: Gerald M. Berns
Venue: Communications of the ACM (1984)

How easy is it to maintain a program? To a large extent, that depends on how difficult the program is to understand. A technique to measure program difficulty yields encouraging results.
Simulation of computer logic by Fortran arithmetic
Authors: Fred W. Weingarten
Venue: Communications of the ACM (1965)

During the preliminary logical design of the NEBULA computer for the Oregon State University Department of Mathematics, it was decided to simulate the logic equations on one of the computers available on campus. Thus most of the logic could be debugged prior to backwiring.
Polynomial and spline approximation by quadratic programming
Authors: D. E. Amos, M. L. Slater
Venue: Communications of the ACM (1969)

The problem of approximation to a given function, or of fitting a given set of data, where the approximating function is required to have certain of its derivatives of specified sign over the whole range of approximation, is studied. Two approaches are presented, in each of which quadratic programming is used to provide both the constraints on the derivatives and the selection of the function which yields the best fit. The first is a modified Berstein polynomial scheme, and the second is a spline fit.
Concept and Construction Example of an Interactive Movie System
Authors: Ryohei Nakatsu, Naoko Tosa, Takeshi Ochi
Venue: Journal of VLSI Signal Processing Systems (2001)

Interactive movies are proposed as a new type of media produced by combining new trends found in movies, communications, and games. With interactive movies, we are able to build cyberspaces rich to the feeling of presence by applying computer graphics and 3D observation, and to get the feeling of complete immersion in these spaces, as if we were actually in them. In addition, it is possible to experience stories through interaction with other characters in the spaces. We first explain the concept of interactive movies and describe a first prototype system that we have developed. We then describe the construction of a second system, which we are currently developing, as well as several improvements in the system.
Multi-hit time-to-digital converter VLSI for high-energy physics experiments
Authors: Yasuo Arai
Venue: Proceedings of the 2001 Asia and South Pacific Design Automation Conference (2001)

A multi-hit time-to-digital converter VLSI has been developed using a CMOS 0.3 um gate-array technology. The chip is designed for use in a high-energy physics experiment ATLAS. Precise timing signals are generated from 16 taps of an asymmetric ring oscillator oscillating at 80MHz and controlled by a PLL circuit. A prototype chip has been developed, and a time resolution of 300 ps RMS was obtained. Many macro cells are developed to achieve such high resolution still using commercial gate-array technology.