ppxscal/embedding_network huggingface dataset:
A Fixed-Structure Learning Automaton Solution to the Stochastic Static Mapping Problem
Authors: Geir Horn, B. John Oommen
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 18 - Volume 19 (2005)

This paper considers the problem of distributing the processes of a parallel application onto a set of computing nodes. This problem called the Static Mapping Problem (SMP) is known to be NP-Hard, and has been tackled using heuristic solutions. The objective of this paper is to present the first reported Learning Automaton (LA) based solution to the SMP, generated by the close resemblance of the SMP to the equipartitioning problem. The LA in question is of the so-called Fixed-Structure family, solution to the equipartitioning problem is then modified to solve the SMP. Several algorithmic variants of this solution have been implemented, and these have all been rigorously tested and evaluated through extensive simulations on randomly generated parallel applications. The focus in this work is to demonstrate the applicability of LA to the SMP, not to optimise and evaluate the performance of the proposed strategy. The results presented here clearly demonstrate that LA provide a promising tool that can effectively solve the mapping problem.
Medical Image Registration and Interpolation by Optical Flow with Maximal Rigidity
Authors: Stephen L. Keeling, Wolfgang Ring
Venue: Journal of Mathematical Imaging and Vision (2005)

In this paper a variational method for registering or mapping like points in medical images is proposed and analyzed. The proposed variational principle penalizes a departure from rigidity and thereby provides a natural generalization of strictly rigid registration techniques used widely in medical contexts. Difficulties with finite displacements are elucidated, and alternative infinitesimal displacements are developed for an optical flow formulation which also permits image interpolation. The variational penalty against non-rigid flows provides sufficient regularization for a well-posed minimization and yet does not rule out irregular registrations corresponding to an object excision. Image similarity is measured by penalizing the variation of intensity along optical flow trajectories. The approach proposed here is also independent of the order in which images are taken. For computations, a lumped finite element Eulerian discretization is used to solve for the optical flow. Also, a Lagrangian integration of the intensity along optical flow trajectories has the advantage of prohibiting diffusion among trajectories which would otherwise blur interpolated images. The subtle aspects of the methods developed are illustrated in terms of simple examples, and the approach is finally applied to the registration of magnetic resonance images.
Parameter Estimation for MRF Stereo
Authors: Li Zhang, Steven M. Seitz
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper presents a novel approach for estimating parameters for MRF-based stereo algorithms. This approach is based on a new formulation of stereo as a maximum a posterior (MAP) problem, in which both a disparity map and MRF parameters are estimated from the stereo pair itself. We present an iterative algorithm for the MAP estimation that alternates between estimating the parameters while fixing the disparity map and estimating the disparity map while fixing the parameters. The estimated parameters include robust truncation thresholds, for both data and neighborhood terms, as well as a regularization weight. The regularization weight can be either a constant for the whole image, or spatially-varying, depending on local intensity gradients. In the latter case, the weights for intensity gradients are also estimated. Experiments indicate that our approach, as a wrapper for existing stereo algorithms, moves a baseline belief propagation stereo algorithm up six slots in the Middlebury rankings.
SRI International FASTUS system: MUC-6 test results and analysis
Authors: Douglas E. Appelt, Jerry R. Hobbs, John Bear, David Israel, Megumi Kameyama, David Martin, Karen Myers, Mabry Tyson
Venue: Proceedings of the 6th conference on Message understanding (1995)

SRI International participated in the MUC-6 evaluation using the latest version of SRI's FASTUS system [1]. The FASTUS system was originally developed for participation in the MUC-4 evaluation [3] in 1992, and the performance of FASTUS in MUC-4 helped demonstrate the viability of finite state technologies in constrained natural-language understanding tasks. The system has undergone significant revision since MUC-4, and it is safe to say that the current system does not share a single line of code with the original. The fundamental ideas behind FASTUS, however, are retained in the current system: an architecture consisting of cascaded finite state transducers, each providing an additional level of analysis of the input, together with merging of the final results.
Communication in computer science classrooms: understanding defensive climates as a means of creating supportive behaviors
Authors: Kathy Garvin-Doxas, Lecia J. Barker
Venue: Journal on Educational Resources in Computing (JERIC) (2004)

All learning environments are characterized by numerous communication and interaction practices, which lend themselves to an overall characterization of the climate as defensive or supportive. A case study of public communication and interaction in a large, research-intensive university's first year computer science courses illustrates a learning environment primarily characterized by elements and behaviors associated with a defensive communication climate. Descriptions of classroom interactions and behaviors illustrate what a defensive communication climate &ldquo;looks like&rdquo; in terms of behavior, based on extensive observational research. Interview data demonstrates that defensive communication practices can lead to attrition among women in the major and illustrates ways in which the communication climate that characterizes the major is experienced and interpreted by women in the courses. This data also links defensive communication behaviors with lower confidence among women toward their major --- results consistent with previous studies of the causes of attrition among women in other Science, Technology, Engineering, and Mathematics (STEM) disciplines. Classroom experiences and behaviors that reflect a more supportive communication climate will be discussed within the context of practices and interactions that professors can engage in to ensure that their courses lean toward a supportive rather than a defensive environment as a way of making computer science learning environments more inclusive.
Risks to the Public
Authors: Peter G. Neumann
Venue: ACM SIGSOFT Software Engineering Notes (2005)

Edited by Peter G. Neumann (Risks Forum Moderator and Chairman of the ACM Committee on Computers and Public Policy), plus personal contributions by others, as indicated. Opinions expressed are individual rather than organizational, and all of the usual disclaimers apply. We address problems relating to software, hardware, people, and other circumstances relating to computer systems. To economize on space, we include pointers to items in the online Risks Forum: (R i j) denotes RISKS vol i number j. Cited RISKS items generally identify contributors and sources, together with URLs. O cial RISKS archives are available at www.risks.org (which redirects to Newcastle and gets you nice html formatting and a search engine courtesy of Lindsay Marshall: http://catless.ncl.ac.uk/Risks/i.j.html gets you (R i j)) and at ftp://www.sri.com/risks.
Virtual Force Display: Direction Guidance Using Asymmetric Acceleration via Periodic Translational Motion
Authors: Tomohiro Amemiya, Hideyuki Ando, Taro Maeda
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper describes the development of a handheld haptic display based on a new force perception method. The method uses periodic translational motion to create asymmetric aceleration leading to a virtual force vector. The method is based on the sigmoidal relationship between perception and physical quantities (tactile and proprioceptive sensations); humans more strongly feel rapid acceleration than slow acceleration. A prototype of the haptic display that generates one-directional force using a relatively simple mechanism is fabricated and evaluated. Experiments verify the feasibility of the proposed method by examining the effect of the frequency of acceleration and amplitude of the force on the perception of the virtual force vector.
Architecture Exploration for a Reconfigurable Architecture Template
Authors: Bingfeng Mei, Andy Lambrechts, Diederik Verkest, Jean-Yves Mignolet, Rudy Lauwereins
Venue: IEEE Design Test (2005)

The vast design space of coarse-grained reconfigurable architectures complicates the design of optimized processors. However, a flexible architecture template and a retargetable simulator and compiler enable systematic architecture exploration that can lead to more efficient domain-specific architecture designs.
Using machine learning techniques and data mining tools for web document classification
Authors: Eric Brown, Roberto Scata, Shona Taiwo, Richard Truncali
Venue: Journal of Computing Sciences in Colleges (2005)

Topic directories such as the Open Directory Project (dmoz.org) and About.com rival search engines as some of the most popular websites. The ultimate goal is to organize the entire web hierarchically by topic. Such a structure allows for more focused searching. The process of classifying web documents and associating them with topics is called 'tagging'. In this paper, we explore how machine learning techniques and data mining tools can be used for automatic tagging. Automatic tagging helps not only in document classification but also in expanding directories such as dmoz.
Functions for manipulating floating-point numbers
Authors: John Reid
Venue: ACM SIGNUM Newsletter (1979)

Floating-point arithmetic is used for most scientific and engineering calculations and needs frequently arise for determining the precision of a given floating-point number, for detailed access to its component parts and for reconstructing it from its parts, much as for complex numbers. We give detailed definitions of three suitable functions in the hope that their wide use will enhance portability. They are first given without reference to any particular language and then made specific to Fortran.This note has been discussed by IFIP WG 2.5 on Numerical Software and has been approved by the working group, but does not constitute an official IFIP document.
About the standardization and the interoperability of e-learning resources
Authors: George Totkov, Cvetelina Krusteva, Nikolay Baltadzhiev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Providing interoperability by using standards and specifications for e-learning resources is an important element of the virtual learning environments (VLEs). A large number of international organizations develop specifications that provide principles for reaching a common "language" to be used in exchanging resources among the virtual university. In this paper we turn your attention to a method for providing interoperability in different standards. The experiments are carried out in the VLE PeU.
A plea for tolerance in the evaluation of numerical methods and mathematical software
Authors: Fred T. Krogh
Venue: ACM SIGNUM Newsletter (1971)

It is a trite observation that experts have difficulty in agreeing on anything, except on matters where they are not expert. My concern here is the effect this characteristic of experts has on the evaluation of numerical methods and mathematical software. I believe that careful evaluations of numerical methods and mathematical software is an important obligation of numerical analysts to the scientific community. My plea is that evaluations be carried out in such a way that people with different points of view have sufficient information to reach conclusions. This tolerance for a diversity of opinion may mean extra work for the evaluator, but without this extra work it will be impossible for some people to interpret the results.
TJFast: effective processing of XML twig pattern matching
Authors: Jiaheng Lu, Ting Chen, Tok Wang Ling
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process a twig query based on region encoding. In this paper, based on a novel labeling scheme: extended Dewey, we propose a novel and efficient holistic twig join algorithm, namely TJFast. Compared to previous work, our algorithm only needs to access the labels of leaf query nodes. We report our experimental results to show that our algorithms are superior to previous approaches in terms of the number of elements scanned and query performance.
Why Computer-Based Systems Should Be Autonomic
Authors: Roy Sterritt, Mike Hinchey
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The objective of this paper is to discuss why computer-based systems should be autonomic, where autonomicity implies self-managing, often conceptualized in terms of being self-configuring, self-healing, self-optimising, self-protecting and self-aware. We look at motivations for autonomicity, examine how more and more systems are exhibiting autonomic behavior, and finally look at future directions.
Estimating differential quantities using polynomial fitting of osculating jets
Authors: F. Cazals, M. Pouget
Venue: Computer Aided Geometric Design (2005)

This paper addresses the point-wise estimation of differential properties of a smooth manifold S--a curve in the plane or a surface in 3D--assuming a point cloud sampled over S is provided. The method consists of fitting the local representation of the manifold using a jet, and either interpolation or approximation. A jet is a truncated Taylor expansion, and the incentive for using jets is that they encode all local geometric quantities--such as normal, curvatures, extrema of curvature.On the way to using jets, the question of estimating differential properties is recasted into the more general framework of multivariate interpolation/approximation, a well-studied problem in numerical analysis. On a theoretical perspective, we prove several convergence results when the samples get denser. For curves and surfaces, these results involve asymptotic estimates with convergence rates depending upon the degree of the jet used. For the particular case of curves, an error bound is also derived. To the best of our knowledge, these results are among the first ones providing accurate estimates for differential quantities of order three and more. On the algorithmic side, we solve the interpolation/approximation problem using Vandermonde systems. Experimental results for surfaces of R3 are reported. These experiments illustrate the asymptotic convergence results, but also the robustness of the methods on general Computer Graphics models.
Possibilities to Solve the Clique Problem by Thread Parallelism using Task Pools
Authors: Holger Blaar, Thomas Lange, Renate Winter, Marcel Karnstedt
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 5 - Volume 06 (2005)

We construct parallel algorithms with implementations to solve the clique problem in practice and research their computing time compared with sequential algorithms. The parallel algorithms are implemented in Java using threads. Best efficiency is achieved by solving the problem of task scheduling by using task pools.
UNDERSTANDING ERRORS IN HUMAN COMPUTER INTERACTION
Authors: Kathy L. Lang, Arthur C. Graesser, Darold D. Hemphill
Venue: ACM SIGCHI Bulletin (1991)

The current study conducted an in-depth analysis of the errors that experienced computer users commit when learning new software. Both a descriptive and explanatory analysis of the errors was performed in order to obtain a comprehensive understanding of the errors committed in the domain of human-computer interaction. The descriptive analysis enabled the identification of the types of errors committed, whereas the explanatory analysis investigated why the errors were committed.
A protocol for packet network intercommunication
Authors: Vinton G. Cerf, Robert E. Icahn
Venue: ACM SIGCOMM Computer Communication Review (2005)

A protocol that supports the sharing of resources that exist in different packet switching networks is presented. The protocol provides for variation in individual network packet sizes, transmission failures, sequencing, flow control, end-to-end error checking, and the creation and destruction of logical process-to-process connections. Some implementation issues are considered, and problems such as internetwork routing, accounting, and timeouts are exposed.
Learning Diagnosis Profiles through Semi-Supervised Gradient Descent of Hidden Markov Models
Authors: Laurent Jeanpierre, Francois Charpillet
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In this paper, we consider the problem of adapting the model of a diagnosis-helping module which interacts with human experts. The approach consists of enforcing strong semantics in the model, so that this interaction may be as intuitive as possible. When learning the model, the problem consists in respecting these semantics while learning with few data. We addressed this problem through a semi-supervised gradient descent algorithm applied to partially observable Markov models with fuzzy observations. This method optimizes several criteria at once, guiding the search to a compromise between the Expert's directives and objective evaluations. This method has been successfully applied to a telemedicine application where the system monitors dialyzed patients and alerts nephrologists.
An Experiment on Tracking Surface Features with the Sensation of Slip
Authors: Mark Salada, J. Edward Colgate, Peter Vishton, Eviatar Frankel
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

This paper describes the last of three experiments that investigate relative motion between a surface and the fingertip (slip) as part of a larger program of research on "fingertip haptics." To confirm the suspicion that tangential displacement of the skin during contact contribute to the perception of feature movement, this experiment tasks subjects to follow a feature on a surface that displays the path tangent given three different factors: the first factor is the absence of tangential displacements 1) within the contact area and 2) on the whole finger pad. The second factor explores different surface speeds. Finally, we explore different rates of path curvature. A custom mechanical filter placed between the skin and the moving surface enables the selective elimination of tangential contact displacements. Thirty-three subjects completed the tracking test, showing that the absence of tangential forces from slip severely impairs performance. However, results reveal heightened performance with the filter in a "loose" configuration. The performance suggests that subjects do not use shape alone to track features, but some combination of shape and tangential forces (due to friction) together to perceive the movement of small features.
Managing memory access latency in packet processing
Authors: Jayaram Mudigonda, Harrick M. Vin, Raj Yavatkar
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

In this study, we refute the popular belief [1,2] that packet processing does not benefit from data-caching. We show that a small data-cache of 8KB can bring down the packet processing time by much as 50-90%, while reducing the off-chip memory bandwidth usage by about 60-95%. We also show that, unlike general-purpose computing, packet processing, due to its memory-intensive nature, cannot rely exclusively on data-caching to eliminate the memory bottleneck completely.
A camera-based interface for interaction with mobile handheld computers
Authors: Martin Hachet, Joachim Pouderoux, Pascal Guitton
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

Recent advances in mobile computing allow the users to deal with 3D interactive graphics on handheld computers. Although the computing resources and screen resolutions grow steadily, user interfaces for handheld computers do not change significantly. Consequently, we designed a new 3-DOF interface adapted to the characteristics of handheld computers. This interface tracks the movement of a target that the user holds behind the screen by analyzing the video stream of the handheld computer camera. The position of the target is directly inferred from the color-codes that are printed on it using an efficient algorithm. The users can easily interact in real-time in a mobile setting. The visualization of the data is good as the target does not occlude the screen and the interaction techniques are not dependent on the orientation of the handheld computer. We used the interface in several test applications for the visualization of large images such as maps, the manipulation of 3D models, and the navigation in 3D scenes. This new interface favors the development of 2D and 3D interactive applications on handheld computers.
Book reivew: A NATURAL LANGUAGE INTERFACE FOR COMPUTER-AIDED DESIGN by Tariq Samad (Kluwer Academic Publishers, 1986)
Venue: Issue 101 (July 1987) (1987)

Tariq Samad's A Natural Language Interface for Computer Aided Design describes a parser developed as part of the author's doctoral thesis at CMU's Department of Electrical and Computer Engineering. The motivation for this work, i.e. to develop a natural language front end for a circuit-simulation program (SPICE), was pragmatic not theoretical. Samad's parser, CLEOPATRA, is not easily positioned in the large body of theory which has developed over the last two decades in natural language research; however, it does share some similarities with work in Conceptual Dependency Theory. Basically, he feels this application, because of its "complexity," requires a novel approach. 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
Nested chain partitions of LYM posets
Authors: Yi Wang
Venue: Discrete Applied Mathematics (2005)

A long-standing conjecture states that all LYM posets possess nested chain partitions. We verify this conjecture for posets of rank 2.