ppxscal/embedding_network huggingface dataset:
The Bernoulli Generic Matrix Library
Authors: Nikolay Mateev, Keshav Pingali, Paul Stodghill
Venue:  (2000)

We have implemented the Bernoulli generic programming system for sparse matrix computations. What distinguishes it from existing generic sparse matrix libraries is that we use (i) a high-level matrix abstraction for writing generic matrix programs, (ii) a low-level matrix abstraction for describing the indexing structure and properties of sparse matrices formats, and (iii) restructuring compiler technology to transform the high-level generic programs into concrete implementations that efficiently access sparse matrices using the low-level abstraction. This paper describes the Bernoulli Generic Matrix Library (BGML). The BGML is the C++ implementation of these high-level and low-level abstractions. Within our system, it serves as the ``glue'''' between user''s sparse matrix format implementations and the restructuring sparse compiler. In this paper, we present the interfaces of the BGML and give examples of their use. Because of its role, it is critical that the BGML not impose much of an overhead on the compiler generated code. We discuss the implementation techniques that we had to use to get the most performance from the BGML. We also discuss the difficulties that we encountered in using available C++ compilers on the BGML.
Adaption to the User''s Task
Authors: Kristina Hook
Venue:  (2001)

Adapting explanations to users with varying background knowledge and abilities is a difficult task: the explanation content, style, amount of details, terms used, etc. may be affected in various ways. We have used our analysis of the information seeking tasks of the users in one particular domain as a basis for adaptation. We structured the domain information into a set of information entities where each entity describes one aspect of a node in the information space. Each information entity is fitted to one or several information seeking tasks, and by combining entities we create an explanation adapted to the user''s current task. We do not avoid concepts which are unknown to the user in our information entities. Instead we allow the users to ask follow-up questions on those concepts in order to cater the users'' differences in background knowledge. Which follow-up questions are available also depends on the users'' current task. Finally, we emphasise the need to make the difference between the adapted explanations obvious to the user. Only then can the users predict which explanations best fit their need and thereby control the self-adaptive mechanisms of the system. So, our system is adaptive to the information seeking task of the user, while the user''s knowledge, abilities and roles, are catered for by other means..
A Graph Based Algorithm for Bayesian Object Recognition
Authors: Yuri Boykov, Daniel Huttenlocher
Venue:  (2000)

We introduce an approach to feature-based object recognition, using maximum a posteriori (MAP) estimation under a Markov random field (MRF) model. Our approach assumes that both the location of the model and a configuration of matching features are not directly observable and have to be estimated. We consider a wide class of priors that explicitly model dependencies between individual features of an object. These priors capture phenomena such as the fact that unmatched features due to partial occlusion are generally spatially correlated rather than independent. Our algorithm uses an efficient graph cut technique to resolve technical difficulties introduced by dependencies between the features. The method allows hierarchical search space pruning to find the location of the model. A special case of our framework yields a particularly efficient approximation method. We call this special case {\em spatially coherent matching} (SCM). The SCM method operates directly on the image feature map, rather than relying on the graph-based methods used in the general framework. Interestingly, in the extreme case of completely independent features our general Bayesian framework reduces to Hausdorff matching. We present some Monte Carlo experiments showing that models accounting for dependencies between the features can yield substantial improvements over Hausdorff matching for cluttered scenes and partially occluded objects.
Rivalling multiprocessor organization: a hardware/speed trade-off
Authors: G. Chroust, J. R. Mühlbacher
Venue: ACM SIGARCH Computer Architecture News (1980)

The availability of microprocessors in large quantities at amazingly low prices moves the break-even point for some traditional trade-offs between hardware and execution time into the direction of more hardware and towards systems with multiple microprocessors. The following scheme allows considerable execution-time speed-up at the cost of redundant hardware.
Autonomous Integration and Provision of Heterogeneous Information Services in Distributed Information Systems
Authors: Xiaodong Lu, Yi Zhou, Helene Arfaoui, Kinji Mori
Venue: Proceedings of the The Sixth International Symposium on Autonomous Decentralized Systems (ISADS'03) (2003)

The need for flexibility, adaptability and timeliness to information service systems has become increasingly important since the advent of electronic commerce. This fosters an urgent need for the design of a high-assurance information service system to meet both providers' and users' heterogeneous requirements. In order to cope with the rapidly evolving situations of service provision and utilization, one autonomous information service system has been proposed, called Faded Information Field (FIF). FIF is a distributed information service system architecture, sustained by push/pull mobile agents, through a recursive demand-oriented provision of the most popular information closer to the users to make a tradeoff between the cost of service allocation and access. In this system, users' requests are autonomously driven by pull mobile agents in charge of finding the relevant service. In the case of a mono-service request, the system is designed to reduce the time needed for users to access the information and to preserve the consistency of the replicas. However, when the user requests joint selection of multi-services, synchronization of atomic actions and timeliness have to be assured by the system. In this paper, the relationship that exists among the contents, properties and access ratios of information services is clarified. Based on these factors, the ratio of correlation is defined and the autonomous integration and provision of information services for heterogeneous FIFs to provide one-stop service for users' multi-services requirements are proposed. The effectiveness of the proposed technology is shown through evaluation and the results show that the integrated services can reduce the total users access time and increase services consumption compared with separate systems.
Optical Occlusion and Shadows in a 'See-through' Augmented Reality Display
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

As distinct from virtual reality, which seeks to immerse the user in a fully synthetic world, computer-augmented reality systems supplement sensory input with computer-generated information. The principle has, for a number of years, been employed in the head-up display systems used by military pilots and usually comprises an optical display arrangement based on part-silvered mirrors that reflect computer graphics into the eye in such a way that they appear superimposed on the real-world view. Compositing real and virtual worlds offers many new and exciting possibilities but also presents some significant challenges, particularly with respect to applications for which the real and virtual elements need to be integrated convincingly. Unfortunately, the inherent difficulties are compounded further in situations where a direct, unpixellated view of the real world is desired, since current optical systems do not allow real- virtual occlusion, nor a number of other essential visual interactions. This paper presents a generic model of augmented reality as a context for discussion, and then describes a simple but effective technique for providing a significant degree of control over the visual compositing of real and virtual worlds.
Transmitting Visual Information: Icons Become Words
Venue: Proceedings of the International Conference on Information Visualisation (2000)

A logical analogy will show the tools to perform the action and a structural analogy will show the organization of the subject. When properly used, CAlLS produces ¿iconic message objects¿ which may be presented to the intended recipient.This paper presents CAlLS, an experimental Computer Assisted Iconic Language System that deals with three specific areas in communication: Cross-linguistic, visual/spatial concept representation and visual educational technique. 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
A note on differentiable palindromes
Authors: S. Brlek, A. Ladouceur
Venue: Theoretical Computer Science (2003)

We give a characterization of the palindromes in a class of infinite words over Σ = {1,2} related to the Kolakoski word K. This characterization, based on the left palindromic closure of all prefixes of K, is obtained by using a bijection between the class of right infinite words over Σ and a class of words over the same alphabet, and reveals the first link between the existence of some palindromes and the recurrence of K. Indeed, the existence of arbitrarily long palindromes implies the recurrence of K, and a stronger assumption implies the closure of the set of its factors by permutation of the letters in Σ.
Embraceable Processes: Adapting Methods to Fit the Team
Authors: William M. Nelson
Venue: IT Professional (2003)

Managers must use processes that balance efficient development methods with individual needs and talents. 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 Annotated Compendium of Naturally Occurring Plan-Based Misconceptions
Authors: Randall J. Calistri
Venue:  (1989)

This report consists of a large collection of naturally occurring short dialogues that contain plan-based misconceptions. Each example is described in detail, is classified according to the types of misconceptions that it contains, and is extensively cross-referenced and indexed.
Inter-organizational networks as patterns for self-organizing multiagent systems
Authors: Tore Knabe, Michael Schillo, Klaus Fischer
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Market-based approaches for task-assignment multiagent systems consist of customer agents with jobs to assign, and provider agents that have the resources to perform these jobs. Jobs can be complex in the sense that they require the collaboration of several provider agents. We present a set of sociological forms of inter-organizational networks that have the potential to increase performance through the structure they impose on collaboration.This gain of structure is especially valuable in settings where communication is limited, which is an appropriate assumption in large-scale applications. We empirically evaluate these organizational forms according to the amount of communication required and the rate of failed task-assignments, and compare them to a system without organizational forms. Furthermore,we investigate the effect of letting agents choose at runtime in which kind of organizational form to engage and which other agents to choose for this collaboration.Our evaluation shows that the proposed organizational forms and mechanisms for self-organization have the ability to improve the efficiency of a market-based multiagent system.
ACK Delay Control for Improving TCP Throughput over Satellite Links
Authors: Jing Wu, Yu Shi, Peng Zhang, Shiduan Cheng, Jian Ma
Venue: Proceedings of the 7th IEEE International Conference on Networks (1999)

TCP has been proved to be working well in a variety of situations. However, in links of large bandwidth products, e.g., satellite links, TCP might under-utilize the link and degrade the reliability. A number of revised algorithms have been proposed to improve TCP performance. In this paper, we propose a new algorithm to improve TCP throughput without modifying TCP protocol. Since TCP uses the acknowledgments (ACKs) to adjust the sending rate, the basic idea of our scheme is to delay (or shape) ACKs traveling through a node where its forward connection is congested. The algorithm aims to fully eliminate packet loss caused by buffer overflow. We implement this scheme in the intermediate nodes connecting satellite links and make a simulation study on its effect. In addition, we test the proposed algorithm in real world. The results of both simulation and test show that the proposed scheme improves the TCP throughput by effectively controlling the acknowledgment flow.
Analytic Centers and Repelling Inequalities
Authors: R. J. Caron, H. J. Greenberg, A. G. Holder
Venue:  (1999)

The new concepts of repelling inequalities, repelling paths, and prime analytic centers are introduced. A repelling path is a generalization of the analytic central path for linear programming, and we show that this path has a unique limit. Furthermore, this limit is the prime analytic center if the set of repelling inequalities contains only those constraints that ``shape'''' the polytope. Because we allow lower dimensional polytopes, the proof techniques are non-standard and follow from data perturbation analysis. This analysis overcomes the difficulty that analytic centers of lower dimensional polytopes are not necessarily continuous with respect to the polytope''s data representation. A second concept introduced here is that of the ``prime analytic center,'''' in which we establish its uniqueness in the absence of redundant inequalities. Again, this is well known for full dimensional polytopes, but it is not immediate for lower dimensional polytopes because there are many different data representations of the same polytope, each without any redundant inequalities. These two concepts combine when we introduce ways in which repelling inequalities can interact.
A Distributed Algorithm for Knot Detection in a Distributed Graph
Authors: D. Manivannan, Mukesh Singhal
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

Knot detection in a distributed graph is an important problem and finds applications in several areas such as packet switching, distributed simulation, and distributed database systems. This paper presents a distributed algorithm to efficiently detect the existence of a knot in a distributed graph. The algorithm requires 2e messages and a delay of 2(d+1) message hops to detect if a node in a distributed graph is in a knot (e is the number of edges in the reachable part of the distributed graph and d is its diameter). A significant advantage of this algorithm isthat it not only detects if a node is in a knot but also finds exactly which nodes are involved in the knot.
Achieving Optimal CRCW PRAM Fault-Tolerance
Authors: Alex A. Shvartsman
Venue:  (1989)

It is possible to combine efficiency and fault-tolerance in many PRAM algorithms in the presence of arbitrary dynamic fail-stop processor errors. Here we describe a technique for efficient and fault-tolerant simulations of {\em arbitrary} PRAM algorithms. Given a $P$-processor PRAM algorithm, we simulate it efficiently and fault-tolerantly by a $P ^ prime$-processor CRCW PRAM algorithm, for $P ^ prime ~ \leq ~ P$. The simulation is optimal for $P ^ prime ~ \leq ~ P / \log ^ 2 P $.
Two-Dimensional Smoothing Procedures and Applications to Engineering Data
Authors: Karen Kafadar
Venue:  (1996)

Data often arise as measurements in two dimensions, such as mineral content at various locations in a region, weather data, or performance characteristics of electronic components manufactured on a surface. In this chapter, we describe methods of exploring data for purposes of (1) reducing noise due to local variation or exotic values and (2) highlighting broad, spatial trends. The detection of spatial patterns often leads to insights concerning the mechanisms which generated the data and, in some cases, to suggestions for improving the process. This chapter covers purposes, costs, and benefits of smoothers (Section 1 and 2), types of two-dimensional smoothers (Section 3), displays smoothed data (Section 4), and examples (Section 5). The references include suggestions for further reading.
Upgrading and Repairing PCs, Fourteenth Edition, 14 edition
Authors: Scott Mueller
Venue:  (2002)

:This is the newest comprehensive update to the world's #1 guide to PC repair and maintenance. World-renowned PC hardware expert Scott Mueller has thoroughly updated his legendary Upgrading and Repairing PCs to reflect today's latest PC technologies, and added a new DVD with more than two hours of digital video demonstrating PC maintenance and repair, which can be watched on either their DVD-equipped PCs or any DVD player. Mueller presents updated coverage of every significant PC component: processors, motherboards, memory, the BIOS, IDE and SCSI interfaces, drives, removable and optical storage, video and audio hardware, USB, FireWire, Internet connectivity, LANs, power supplies, even PC cases. This book also contains a detailed troubleshooting index designed to help readers rapidly diagnose more than 250 common PC hardware problems, as well as an extensive vendor contact guide, and a comprehensive PC technical glossary.
Newsgroup Clustering Based On User Behavior - A Recommendation Algebra
Authors: Jussi Karlgren
Venue:  (1994)

User models are a tool for guiding system behavior in interactive systems, and their utility and properties, desirable and undesirable, have been investigated in this context. There are several ways of utilizing information about the user that have NOT been implemented, however. In this paper a scheme for users to peek at other users'' user models to extract information is proposed, in an information retrieval or information filtering domain. The material used for the study is a set of .newsrc files.
Multi-agent learning in extensive games with complete information
Authors: Pu Huang, Katia Sycara
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Learning in a multi-agent system is difficult because the learning environment jointly created by all learning agents is time-variant. This paper studies the model of multi-agent learning in complete-information extensive games (CEGs). We provide two provably convergent algorithms for this model. Both algorithms utilize the special structure of CEGs and guarantee both individual and collective convergence. Our work contributes to the multi-agent learning literature in several aspects: 1. We identify a model of multi-agent learning, namely, learning in CEGs, and provide two provably convergent algorithms for this model. 2. We explicitly address the environment-shifting problem and show that how patient agents can collectively learn to play equilibrium strategies. 3. Many game-theoretical work on learning uses a technique called fictitious play, which requires agents to build beliefs about their opponents. For our model of learning in CEGs, we show it is true that agents can collectively converge to the sub-game perfect equilibrium (SPE) by repeatedly reinforcing their previous success/failure experience; no belief building is necessary.
A Theory of Distributed Time
Authors: Sean W. Smith
Venue:  (1993)

Natural intuition organizes experience into a linear sequence of discrete events, but this approach is inappropriate for asynchronous distributed systems, where information is distributed and perception is delayed. Distributed environments require a distributed notion of time, to abstract away not only irrelevant physical detail but also irrelevant temporal and computational detail. By expressing distributed systems concepts that are difficult to talk about in terms of real time and by distinguishing what really "happens" from what physically occurred, a theory of distributed time would provide a natural framework for solving problems in distributed environments. This paper lays the groundwork for that claim by formally building such a theory. This research improves on previous work on time in distributed systems by supporting temporal relations more general than partial orders, by supporting abstraction through multiple levels of temporal relations, by separating the family of temporal relations an application consults from the particular clock implementations that track them, and by providing a single arena to consider these issues for a wide range of applications.
An Axiomatic Approach to Information Flow in Parallel Programs
Authors: Gregory R. Andrews, Richard P. Reitman
Venue:  (1978)

This paper presents a new, axiomatic approach to information flow in sequential and parallel programs. Flow axioms that capture the information flow semantics of a variety of statements are given and used to construct program flow proofs. The method is illustrated by a variety of examples. The applications of flow proofs to certifying information flow policies and solving the confinement problem are considered. It is also shown that flow axioms and correctness axioms can be combined to form an even more powerful proof system. Keywords and Phrases: information flow, information security, security certification, parallel programs, axiomatic logic, proof rules.
An Infrastructure for Profile-Driven Dynamic Recompilation
Authors: Robert G. Burger, R. Kent Dybvig
Venue: Proceedings of the 1998 International Conference on Computer Languages (1998)

Dynamic optimization of computer programs can dramatically improve their performance on a variety of applications. This paper presents an efficient infrastructure for dynamic recompilation that can support a wide range of dynamic optimizations including profile-driven optimizations. The infrastructure allows any section of code to be optimized and regenerated on-the-fly, even code for currently active procedures. The infrastructure incorporates a low-overhead edge-count profiling strategy that supports first-class continuations and reinstrumentation of active procedures. Profiling instrumentation can be added and removed dynamically, and the data can be displayed graphically in terms of the original source to provide useful feedback to the programmer.
IP Paging Service for Mobile Hosts
Authors: R. Ramjee, L. Li, T. La Porta
Venue:  (2000)

In wireless networks, mobile hosts must update the network with their current location in order to get packets delivered to them. Paging facilitates efficient power management at the mobile host by allowing the host to update the network less frequently at the cost of providing the network with only approximate location information. The network determines the exact location of a mobile host through paging before delivering packets destined to the mobile host. In current circuit-switched wireless networks, paging is implemented as a special purpose functionality in a centralized component inside the network. Given the emergence of different packet-switched wireless networks, we propose a novel router service called IP paging. This enables one common IP-based infrastructure to support different wireless interfaces such as CDMA, GPRS, Wireless LAN, etc. In this paper, we present the design, implementation, and detailed performance evaluation, using measurements and simulation, of three IP-based paging protocols for mobile hosts.