ppxscal/embedding_network huggingface dataset:
A Vision System for Robotic Inspection and Manipulation
Authors: M. Trivedi, C. Chen, S. B. Marapane
Venue: Computer (1989)

A model-based approach has been proposed to make object recognition computationally tractable. In this approach, models associated with objects expected to appear in the scene are recorded in the system's knowledge base. The system extracts various features from the input images using robust, low-level, general-purpose operators. Finally, matching is performed between the image-derived features and the scene domain models to recognize objects. Factors affecting the successful design and implementation of model-based vision systems include the ability to derive suitable object models, the nature of image features extracted by the operators, a computationally effective matching approach, knowledge representation schemes, and effective control mechanisms for guiding the systems's overall operation. The vision system they describe uses gray-scale images, which can successfully handle complex scenes with multiple object types.
A strong problem reduction method based on function introduction
Authors: M. Baaz, A. Leitsh
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

Although problem reduction is a very important tool in mathematical practice, relatively little attention has been paid to problem reduction in automated theorem proving. A systematical treatment of different problem reduction methods can be found in [BI71] and [Lo78]. (In [BI71] we find unary and binary reduction rules. In the unary case we reduce a problem E to a problem E', where E is provable (refutable) if E' is; for binary reduction we have to produce problems E1, E2 out of E such that E is provable (refutable) if both E1, E2 are provable (refutable).) In finding stronger reduction strategies, one has to give up completeness of the split of E into E1, E2; that means, we only require that the provability of E1 and E2 implies that of E. The authors therefore propose problem reduction based on a splitting rule of the form C &rarr; C', where C &sim; C1 &ngr; C2, C' &sim; C1 &ngr; C'2, C'2 &sim; C2 {&times; &larr; &fnof;(y1,&hellip;yn)}, {x,y1,&hellip;yn} is the set of variables both in C1 and C2 and &fnof; is a new function symbol up to this point not occurring in any clause. Note that the Herbrand universe is extended by &fnof; and consequently C' is not derivable from C by usual resolution methods! As (&forall;y1) &hellip; (&forall;yn(&forall;x) (C1 &ngr; C2) &rarr; (&forall;y1) &hellip; (&forall;yn ((&forall;x) C1 &ngr; (&exist;x) (C2) is valid in first order predicate logic and C1 &ngr; C'2 is the Skolemization of the implied formula, splitting of this kind is correct. For reasons of efficiency (reduction of search space and restriction of compound terms) the authors restrict the application of the rule above to sequences of applications (called Q-reduction) completely separating the variables in C1 and C2. Finally the authors construct a sequence of clause sets Cn having resolution proofs exponential in n only, but application of the new reduction rule reduces the problem to two problems linear in n. Thus it turns out that the introduction of (elementary) quantificational rules into clause logic can strongly influence the structure of proofs and the performance of theorem provers.
A note on clustering modules for floorplanning
Authors: J. D. Gabbe, P. A. Subrahmanyam
Venue: Proceedings of the 26th ACM/IEEE Design Automation Conference (1989)

Many VLSI floorplanners work by recursively decomposing rectangular modules into lower-level rectangular modules until the leaf-level modules are reached[5]. Good layouts require good floorplans. The quality of a floorplan depends (among other things) on how the leaf-level modules are clustered into the various levels of the hierarchy. Some of the factors that determine the suitability of a decomposition are the geometry of the modules, the connectivity among modules, and timing constraints. Our experience with the mechanization of a VLSI design manager[1] has shown that the initial structural hierarchy that arises during synthesis from behavioral specifications is not always suitable for floorplanning. We describe hierarchical-clustering-based algorithms that lead to a small number of superior candidate hierarchies.
User-tailorable systems: pressing the issues with buttons
Authors: Allan MacLean, Kathleen Carter, Lennart Lövstrand, Thomas Moran
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems: Empowering people (1990)

It is impossible to design systems which are appropriate for all users and all situations. We believe that a useful technique is to have end users tailor their systems to match their personal work practices. This requires not only systems which can be tailored, but a culture within which users feel in control of the system and in which tailoring is the norm. In a two-pronged research project we have worked closely with a group of users to develop a system to support tailoring and to help the users evolve a &ldquo;tailoring culture&rdquo;. This has resulted in a flexible system based around the use of distributed on-screen Buttons to support a range of tailoring techniques.
A Bibliography on Digital and Computational Convexity (1961-1988)
Authors: Christian Ronse
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1989)

A bibliography of 370 references of books, papers in serial journals, and conference papers, on convexity in relation to computer science is presented. The subject is divided into five topics: (1) convexity and straightness in digital images; (2) convex hull algorithms and their complexity; (3) other computational problems related to convexity; (4) miscellaneous applications; and (5) general mathematical sources. These references range in time from 1961 to September 1988.
Vector and parallel algorithms for Cholesky factorization on IBM 3090
Authors: R. C. Agarwal, F. G. Gustavson
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

In many engineering applications, a solution of Fx = b is required, where F is a positive definite symmetric matrix. This is usually done by the Cholesky factorization, F = RRT, where R is the lower triangular Cholesky factor. This is a compute intensive problem. However, in order to achieve the best possible performance on IBM 3090 Vector Facility, the problem requires blocking at various levels to match 3090 memory hierarchy. A large problem which does not fit in a particular level of memory is blocked so that each block fits in memory. This minimizes data transfers between various levels of memory. In this paper, various blocking schemes are described for vector and parallel implementation on 3090 VF. Some of these algorithms have been included in the Engineering and Scientific Subroutine Library (ESSL). Performance numbers are also included. These algorithms achieve close to the peak performance of the 3090 uniprocessor and multiprocessors.
Debugging Effort Estimation Using Software Metricsv
Authors: N. Gorla, A. C. Benander, B. A. Benander
Venue: IEEE Transactions on Software Engineering (1990)

Measurements of 23 style characteristics, and the program metrics LOC, V(g), VARS, and PARS were collected from student Cobol programs by a program analyzer. These measurements, together with debugging time (syntax and logic) data, were analyzed using several statistical procedures of SAS (statistical analysis system), including linear, quadratic, and multiple regressions. Some of the characteristics shown to correlate significantly with debug time are GOTO usage, structuring of the IF-ELSE construct, level 88 item usage, paragraph invocation pattern, and data name length. Among the observed characteristic measures which are associated with lowest debug times are: 17% blank lines in the data division, 12% blank lines in the procedure division, and 13-character-long data items. A debugging effort estimator, DEST, was developed to estimate debug times.
Concurrent operations on priority queues
Authors: Douglas W. Jones
Venue: Communications of the ACM (1989)

Among the fastest priority queue implementations, skew heaps have properties that make them particularly suited to concurrent manipulation of shared queues. A concurrent version of the top down implementation of skew heaps can be produced from previously published sequential versions using almost mechanical transformations. This implementation requires O(log n) time to enqueue or dequeue an item, but it allows new operations to begin after only O(1) time on a MIMD machine. Thus, there is potential for significant concurrency when multiple processes share a queue. Applications to problems in graph theory and simulation are discussed in this article.
Semantics based transaction management techniques for replicated data
Authors: Akhil Kumar, Michael Stonebraker
Venue: ACM SIGMOD Record (1988)

Data is often replicated in distributed database applications to improve availability and response time. Conventional multi-copy algorithms deliver fast response times and high availability for read-only transactions while sacrificing these goals for updates. In this paper, we propose a multi-copy algorithm that works well in both retrieval and update environments by exploiting special application semantics. By subdividing transactions into various categories, and utilizing a commutativity property, we demonstrate cheaper techniques and show that they guarantee correctness. A performance comparison between our techniques and conventional ones quantifies the extent of the savings.
An introduction to Prolog III
Authors: Alain Colmerauer
Venue: Communications of the ACM (1990)

The Prolog III programming language extends Prolog by redefining the fundamental process at its heart: unification. This article presents the specifications of this new language and illustrates its capabilities.
Analysis of simulation data using sandie
Authors: A. Thesen
Venue: Proceedings of the 21st conference on Winter simulation (1989)

Sandie is a PC based system designed to perform many of the data analysis chores of simulators. We first show how Sandie is used to analyze input data and to fit theoretical distributions to empirical data. We then show how Sandie can be used to perform simple simulations. Finally, we show how to use Sandie to analyze output data. Special care was made in the development of Sandie to design an easy-to-use system that would serve as an aid in the development of an intuitive "sense of numbers". Pull down menus and a dynamic help-line constantly inform the user of all currently operative options.
Parallel processor balance through loop spreading
Authors: Y. Wu, T. Lewis
Venue: Proceedings of the 1989 ACM/IEEE conference on Supercomputing (1989)

When the number of processors P is less than the number of tasks N in a parallel loop, the loop has to be executed in &lceil;N/P&rceil; rounds and the last round executes only (N mod P) tasks. In many cases, in the last round all but a few processors are idle, which causes a significant drop in performance. This performance drop becomes more and more detrimental as the number of processors increases. Loop spreading is a technique for restructuring parallel loops so as to balance parallel tasks on multiple processors. A spread loop runs at least as fast as the non-spread loop even when N mod P = 0, and shows no performance drop when N changes. We show how the method keeps the performance of the matrix multiplication and a simplex algorithm from decreasing as the size of input changes.
A cache-based message passing scheme for a shared-bus multiprocessor
Authors: B. R. Preiss, V. C. Hamacher
Venue: ACM SIGARCH Computer Architecture News (1988)

This paper describes a scheme for using cache-based hardware to provide simple and efficient message passing support for message-based software systems on a tightly-coupled, shared-bus multiprocessor. This approach is based on the utilization of the existing interprocessor communications medium, the shared bus, to effect the exchange of single-word messages. Communication between processes is accomplished over logical channels using simple, blocking send and receive primitives. The physical processor/channel interface is designed so that the message transfer primitives can be implemented as single machine instructions, namely store and fetch. Special-purpose caches, called message caches, mediate channel operations and effect the exchange of messages over the shared bus.
Driver behaviour during haptic and visual secondary tasks
Authors: Annie Rydström, Camilla Grane, Peter Bengtsson
Venue: Proceedings of the 1st International Conference on Automotive User Interfaces and Interactive Vehicular Applications (2009)

There has been an increasing interest for in-vehicle interfaces that make use of haptic information. A simulator study was conducted to investigate whether haptic information can facilitate the interaction with an interface while driving. The conceptual in-car interface consisted of a visual menu of four textures displayed on a screen and corresponding haptic information displayed through the interaction device -- a rotary device. The experimental conditions included either visual or haptic or both visual and haptic information. One advantage of the condition including only haptic information was that the participants' eyes remained on the road during the interaction. However, since the haptic interaction necessitated serial processing, the experimental task took longer when using only haptic information. Therefore the participants seem to have relied more on the visual information when it was available. The degradation in driving performance and mental workload assessment did not differ between the conditions.
Tug-Of-War Model for Two-Bandit Problem
Authors: Song-Ju Kim, Masashi Aono, Masahiko Hara
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

The amoeba of the true slime mold Physarum polycephalum shows high computational capabilities. In the so-called amoeba-based computing, some computing tasks including combinatorial optimization are performed by the amoeba instead of a digital computer. We expect that there must be problems living organisms are good at solving. The "multi-armed bandit problem" would be the one of such problems. Consider a number of slot machines. Each of the machines has an arm which gives a player a reward with a certain probability when pulled. The problem is to determine the optimal strategy for maximizing the total reward sum after a certain number of trials. To maximize the total reward sum, it is necessary to judge correctly and quickly which machine has the highest reward probability. Therefore, the player should explore many machines to gather much knowledge on which machine is the best, but should not fail to exploit the reward from the known best machine. We consider that living organisms follow some efficient method to solve the problem.We propose a model, named as the "tug-of-war (TOW) model," based on the photoavoidance behavior of amoeba induced by light stimuli. The TOW model is a bio-inspired computing method capable of solving the problem efficiently, while it is not necessarily a biological model for reproducing a behavior of the true slime mold. In this study, we focus on the two-bandit problem. In the original version of the problem, the player can select only one machine for a trial. To explore advantages of parallel computing, we extend this problem so that the player is allowed to select both machines for a trial. We show that the TOW model exhibits good performance. The average accuracy rate of the TOW model is higher than that of well-known algorithms such as the modified ¿-greedy algorithm and the modified softmax algorithm. Additionally, the TOW model is effective for solving relatively difficult problems in which the reward probabilities of the two machines are close. Finally, we show that the TOW model is good at adapting to a changing environment in which the reward probabilities are dynamically updated. The results are highly suggestive because, in order to survive in the unknown world, living organisms have to adapt to new environments as quickly as possible at the expense of a slight reduction in accuracy.
Tactical Reconnaissance Using Groups of Partly Autonomous UGVs
Authors: Peter Svenmarck, Dennis Andersson, Björn Lindahl, Johan Hedström, Patrik Lif
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

This paper investigates how one operator can control a multi-robot system for tactical reconnaissance using partly autonomous UGVs. Instead of controlling individual UGVs, the operator uses supervisory control to allocate partly autonomous UGVs into suitable groups and define areas for search. A state-of-the-art pursuit-evasion algorithm then performed the detailed control of available UGVs. The supervisory control was evaluated by allowing subjects to control either six or twelve UGVs for tactical reconnaissance along the route of advance for a convoy traveling through an urban environment with mobile threats. The results show that increasing the number of UGVs improve the subjects situation awareness, increase the number of threats that are detected, and reduce the number of hits on the convoy. More importantly, these benefits were achieved without any increase in mental workload. The results support the common belief in autonomous functions as an approach to reduce the operator-to-vehicle ratio in military applications.
Composition of Semi-LTCs by Two-Wise Tensor Products
Authors: Eli Ben-Sasson, Michael Viderman
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We continue the study of the local testability of error correcting codes constructed by taking the two-wise tensor product of a "base-code" with itself. We show that if the base-code is any locally testable code (LTC) or any expander code, then the code obtained by taking the repeated two-wise tensor product of the base-code with itself is locally testable. This extends the results of Dinur et al. in [11] in two ways. First, we answer a question posed in that paper by expanding the class of allowed base-codes to include all locally testable code, and not just so-called uniform LTCs whose associated tester queries all codeword entries with equal probability. Second, we show that repeating the two-wise tensor operation a constant number of times still results in a locally testable code, improving upon previous results which only worked when the tensor product was applied once.To obtain our results we define a new tester for the tensor product of LTCs. Our tester uses the distribution of the tester associated with the base-code to sample rows and columns of the product code. This construction differs from previously studied testers for tensor product codes which sampled rows and columns uniformly.
Cost Reduction - Buzzwords and Their Real Use: Mission Families, Mission Planning, Mission Automation and Standardization
Authors: Michael Koller, Christian Schurig
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

For many missions, the European Space Agency ESA has followed a delta approach connected with excessive software reuse for the development of operational ground software for space missions. This approach of mission families is well proven and has already led to enormous cost savings regarding development and maintenance costs. Advances in mission planning and mission automation are an example how operational IT can reduce operational costs of space missions. For further cost reductions and to allow for less effort required for the development of ground systems and the definition of exchange formats, ESA is actively moving forward in standardization.
Exploiting Efficient Transpacking for One-Sided Communication and MPI-IO
Authors: Faisal Ghias Mir, Jesper Larsson Träff
Venue: Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface (2009)

Based on a construction of socalled input-output datatypes that define a mapping between non-consecutive input and output buffers, we outline an efficient method for copying of structured data. We term this operation transpacking, and show how transpacking can be applied for the MPI implementation of one-sided communication and MPI-IO. For one-sided communication via shared-memory, we demonstrate the expected performance improvements by up to a factor of two. For individual MPI-IO, the time to read or write from file dominates the overall time, but even here efficient transpacking can in some scenarios reduce file I/O time considerably. The reported results have been achieved on a single NEC SX-8 vector node.
Efficient Video Watermarking Using Motion Estimation Approach
Authors: Aree Ali Mohammed, Jamal Ali Hussein
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Digital watermarking is a helpful technology for providing copyright protection for valuable multimedia data. In particular, video watermarking deals with several issues that are unique to various types of media watermarking. In this paper a method for embedding additive digital watermarks into uncompressed and compressed video sequences is presented in a spatial domain. The proposed method is adopted to exploit only the motion regions between frames using motion estimation technique. The method is tested on different types of video (compressed DVD quality movie and uncompressed digital camera movie). The experimental results show that the quality of watermarked video (PSNR) seems to be reasonable (watermark invisibility) when the value of scale factor is taken a = 0.05. This scheme supposes to be robust against the attack of frame dropping, averaging, statistical analysis and lossy compression.
Backchannel persistence and collaborative meaning-making
Authors: Brian McNely
Venue: Proceedings of the 27th ACM international conference on Design of communication (2009)

Digital backchannel communication has become an increasingly important area of study for researchers and practitioners in several fields. From the emergence of wifi-enabled Internet Relay Chat (IRC) to contemporary instances of microblogging and SMS messaging, the role of digital backchannels in enabling collaborative affordances has received much recent attention. As backchannel communication continues to become more prevalent at professional conferences, in educational curricula, and in organizational settings, robust frameworks for understanding the role of backchannel environments in collaborative meaning-making are needed. Drawing upon cultural-historical activity theory and actor network theory, this paper explores the development of backchannel persistence through microblogging platforms, and suggests an approach to studying the collaborative affordances of backchannel communication by focusing on the related concepts of mobilization and recursive writing collaboration.