ppxscal/embedding_network huggingface dataset:
High-Speed Visual Estimation Using Preattentive Processing
Authors: Christopher G. Healey, Kellogg S. Booth, James T. Enns
Venue:  (1993)

A new method is presented for performing rapid and accurate numerical estimation. It is derived from principles arising in an area of cognitive psychology called preattentive processing. Preattentive processing refers to an initial organization of the human visual system based on operations believed to be rapid, automatic, and spatially parallel. Examples of visual features that can be detected in this way include hue, intensity, orientation, size, and motion. We believe that studies from preattentive vision should be used to assist in the design of visualization tools, especially those for which high speed target, boundary, and region detection are important. In our present study, we investigated two known preattentive features (hue and orientation) in the context of a new task (numerical estimation) in order to see whether preattentive estimation was possible. Our experiments tested displays that were designed to visualize data from simulations being run in the Department of Oceanography. The results showed that rapid and accurate estimation is indeed possible using either hue or orientation. Furthermore, random variation of one of these features resulted in no interference when subjects estimated the numerosity of the other. To determine the robustness of our results, we varied two important display parameters, display duration and feature difference, and found boundary conditions for each. Implications of our results for application to real-word data and tasks are discussed.
A Report on Computer-Aided Software Engineering (CASE)
Authors: Alfred L. McKinney
Venue: Journal of Computing Sciences in Colleges (1991)

The use of CASE in Software Engineering and Systems Analysis and Design courses is relatively recent. This paper defines CASE and discusses its brief history, its attitude toward software development, its components, its current state and usage, its promise and future, its use at LSU-Shreveport, and finally a recommendation for its use at other colleges and universities.
Large Deformations of Rotating Polygonal Space Structures
Authors: Layne T. Watson, C. Y. Wang
Venue:  (1990)

The effects of rotation on space structures are very important nowadays. Because the structures are large and thus relatively flexible, unacceptable stresses or deformations may occur due to centrifugal forces. In a recent paper we considered the effects of rotation on an unbalanced circular ring. The present note studies a related problem, i.e., the free rotation of polygonal frames. These shapes are basic in structural design.
Multi-layered cross-media linking
Authors: Beat Signer, Moira C. Norrie
Venue: Proceedings of the fourteenth ACM conference on Hypertext and hypermedia (2003)

The integration of printed paper and digital information enables new forms of enhanced reading. We present digitally augmented paper as a specific application of our more general Integration Server (iServer) architecture for cross-media information management. Multi-layered linking is introduced as a way to manage the granularity of link anchors and an application making active use of multi-layered links is presented. Furthermore, we point out how the concept of supporting multiple layers in link management can be applied to other media such as, for example, XHTML in combination with the XML Linking Language (XLink).
(1+e,b)-Spanner Constructions for General Graphs
Authors: M. Elkin, D. Peleg
Venue:  (2000)

An (a,b)-spanner of a graph G is a subgraph H such that dH(u,w) # a?dG(u,w)+b for every pair of vertices u,w, where dG?(u,w) denotes the distance between two vertices u and v in G?. It is known that every graph G has a polynomially constructible (2k-1,0)-spanner (a.k.a.&#x00A0;multiplicative (2k-1)-spanner) of size O(n1+1/k) for every integer k ? 1, and a polynomially constructible (1,2)-spanner (a.k.a.&#x00A0;additive 2-spanner) of size [O\tilde](n3/2). This paper explores hybrid spanner constructions (involving both multiplicative and additive factors) for general graphs and shows that the multiplicative factor can be made arbitrarily close to 1 while keeping the spanner size arbitrarily close to O(n), at the cost of allowing the additive term to be a sufficiently large constant. More formally, we show that for any constant e, d < 0 there exists a constant b = b(e, d) such that for every n-vertex graph G there is an efficiently constructible (1+ e, b)-spanner of size O(n1 + d).
Project GEOSIM: The First Two Modules
Authors: Clifford A. Shaffer, Laurence W. Carstensen, Vincent F. Miranda, Sheryl A. Kriss, Robert W. Morrill, Edward A. Fox
Venue:  (1991)

We present our initial report on Project GeoSim: a multidisciplinary effort involving members of the Departments of Geography and Computer Science at Virginia Tech to develop computer-aided instruction (CAI) software for the teaching of introductory geography. Project GeoSim will apply the immense capabilities of Geographic Information Systems (GIS) and simulation to the teaching of geography, beginning at the first geography course. Our computer-aided educational materials will be usable by a wide range of students, focusing in particular on first-year undergraduate and high school students. Initially we will provide a series of computerized laboratory modules applicable to several introductory geography courses. These modules must meet several criteria such as being highly interactive, appropriate for computer novices, incorporating a Geographic Information System (GIS) and simulation when appropriate, and able to run on a wide range of moderately priced equipment. This paper presents the overall project, and describes the working prototypes for two of these modules: Mental Maps and International Population.
Explicit Parallel Programming: System Description
Authors: Jim Gamble, Calvin J. Ribbens
Venue:  (1991)

The implementation of the Explicit Parallel Programming (EPP) system is described. EPP is a prototype implementation of a language for writing parallel programs for shared memory multiprocessors. EPP may be viewed as a coordination language, since it is used to define the sequencing or ordering of various tasks, while the tasks themselves are defined in some other compilable language. The two main components of the EPP system---a compiler and an executive---are described in this report. An appendix is included which contains the grammar defining the EPP language as well as templates used by the compiler in code generation.
Parallelization of Particle Methods on the Sphere
Authors: Omer Egecioglu
Venue:  (1996)

We consider data structures and algorithms for efficient parallelization of particle methods when the domain is the surface of a sphere. Such applications typically arise when dealing with directional data. We propose a domain decomposition scheme based on a combination of geometric and combinatorial partitioning, that provides domains suitable for efficient implementation of requisite operations that are performed on the data in parallel. The algorithm has the advantage of being fast enough to be applied dynamically, and at the same time provides good partitions, comparable in quality to those produced by multilevel graph partitioning schemes.
Basic Fortran Support in Legion
Authors: Adam J. Ferrari, Andrew S. Grimshaw
Venue:  (1998)

Fortran is the most widely used programming language for high-performance scientific computing applications, yet in the past the Legion system has not supported objects implemented in Fortran. This paper describes the design and interface of the Legion Basic Fortran Support (BFS) system. This system consists of compiler and runtime library that allow the description of Legion object interfaces in a Fortran-like Interface Description Language (IDL), and the implementation of Legion objects using Fortran. The system also supports remote method invocations on Legion objects through the use of pseudo-comments: Legion BFS directives embedded in normal Fortran comment lines. These method invocations are processed using a macro-dataflow model similar to that provided by the Mentat Programming Language, thus allowing both inter- and intra-method parallelism.
Extensions of Block-Projections Methods with Relaxation Parameters to Inconsistent and Rank-Defficient Least-Squares Problems
Authors: C. Popa
Venue:  (1996)

In this paper we present generalizations of some row-projections algorithms (previously described by the author in [9] and [11]) to the case of block-rows-projections. In this way we obtain extensions of the algorithms from [7] (in the finite dimensional case) and from [4] (see also [5], [6]). These extensions generate sequences of vectors convergent to the minimal norm solution of the initial least-squares problem even in the case that this is inconsistent and rank-defficient. They are important because of some improvements concerning the convergence properties and also because of some aspects concerning the parallelization of the original algorithms. Some numerical experiments are also described in the last section of the paper. 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
Distributed Algorithms for Multimessage Multicasting
Authors: Teofilo F. Gonzalez
Venue:  (1998)

We consider the multimessage multicasting over the $n$ processor complete (or fully connected) static network when the forwarding of messages is allowed, and initially each processor only knows the messages it needs to send and their destinations. We present an efficient distributed algorithm to route the messages for every degree $d$ problem instance with total expected communication time $O(d + \log n)$, where $d$ is the maximum number of messages that each processor may send (or receive). Our routing algorithm consists of three phases. In the first phase the processors exchange messages to learn some basic global information. In the second phase each processor forwards its messages to transform the problem to a multimessage unicasting problem of degree $d$. The third phase uses a well known distributed algorithm to transmit all the unicasting messages.
Applying ESP and Region Specialists to Neuro-Evolution for Go
Authors: Andres S Perez-Bergquist
Venue:  (2001)

Go is one notable board game where computer competence still trails behind that of human experts. In the past, neural-network-based approaches have shown promise. In this paper, the ESP variant of the SANE neuro-evolution algorithm was applied to go, and an alternate network architecture featuring subnetworks specialized for certain board regions was implemented. ESP produced simpler networks that performed just as well as the more complex ones produced by SANE in other studies. Having region-specialist subnetworks improved the already great performance marginally. However, both the simple network and the network with specialists failed to scale up to board sizes larger than 7x7.
ACCESSING REPLICATED DATA IN AN INTERNETWORK
Authors: Richard Golding, Darrell D. E. Long
Venue:  (1990)

When accessing a replicated data object across an internetwork, the time to access different replicas is non-uniform. Further, the probability that a particular replica is inaccessible is much higher in an internetwork than in a local-area network because of partitions and the many intermediate hosts and networks that can fail. We report three replica-accessing algorithms which can be tuned to minimize either the time spent on the access or the number of messages sent. We have obtained performance results for these algorithms by simulation. We find an inverse relationship between the time spent processing an access and the number of messages required to complete the access.
Using SimPoints in Diverse Simulation Environments
Authors: Erez Perelman, Michael Van Biesbrouk, Timothy Sherwood, Brad Calder
Venue:  (2002)

Modern architecture research relies heavily on detailed pipeline simulation. Simulating the full execution of an industry standard benchmark can take weeks to months to complete. To address this issue researchers have recently proposed using Simulation Points (SimPoints) to increase the efficiency and accuracy of simulation. SimPoints are a small subset of execution intervals that are representative of a program''s phases, so that when combined they accurately represent the complete execution of the program. These SimPoints are found using clustering techniques based on the structure of the executed code. The prior work on SimPoints assumed a somewhat advanced simulation environment that supported check-points, had perfect warm-up ability, and focused only on simulating single threaded architectures. In this research we explore what happens when you break these assumptions and provide techniques that are capable of dealing with more complex simulation environments. We focus on environments that have the ability to fast-forward, but to not checkpoint, and we extend the use of SimPoints to multi-threaded architectures. We present results comparing our improved SimPoint techniques with past SimPoint work and in addition provide a comparison to Random Sampling.
Pure versus Impure Lisp
Authors: Nicholas Pippernger
Venue:  (1995)

The aspect of purity versus impurity that we address involves the absence versus presence of mutation: the use of primitives (RPLACA and RPLACD in Lisp, set-car! and set-cdr! in Scheme) that change the state of pairs without creating new pairs. It is well known that cyclic list structures can be created by impure programs, but not by pure ones. In this sense, impure Lisp is ``more powerful'''' than pure Lisp. If the inputs and outputs of programs are restricted to be sequences of atomic symbols, however, this difference in computability disappears. We shall show that if the temporal sequence of input and output operations must be maintained (that is, if computations must be ``on-line''''), then a difference in complexity remains: for a pure program to do what an impure program does in n steps, O(n log n) steps are sufficient, and in some cases Omega(n log n) steps are necessary.
Hardware Characterisation of Multi-Processor Systems
Authors: M. J. Zemerly
Venue:  (1993)

This study is concerned with hardware characterisation of parallel systems. In this second report an analytical expression for the performance measure (execution time) is derived for a single processor and issues involving the characterisation of multi-processor systems are discussed. A simple analytical model used in (BSKP90) for performance evaluation of parallel systems is also described.
Communication Complexity of Document Exchange
Authors: Graham Cormode, Mike Paterson, Suleyman C Sahinalp, Uzi Vishkin
Venue:  (1999)

We have two users, A and B, who hold documents x and y respectively. Neither of the users has any information about the other''s document. They exchange messages so that B computes x; it may be required that A compute y as well. Our goal is to design communication protocols with the main objective of minimizing the total number of bits they exchange; other objectives are minimizing the number of rounds and the complexity of internal computations. An important notion which determines the efficiency of the protocols is how one measures the distance between x and y. We consider several metrics for measuring this distance, namely the Hamming metric, the Levenshtein metric (edit distance), and a new LZ metric, which is introduced in this paper. We show how to estimate the distance between x and y using a single message of logarithmic size. For each metric, we present the first communication-efficient protocols, which often match the corresponding lower bounds. A consequence of these are error-correcting codes for these error models which correct up to d errors in n characters using O(d log n) bits. Our most interesting methods use a new histogram transformation that we introduce to convert edit distance to L1 distance.
Proofs for Improved Approximation Algorithms forMultimessage Multicasting
Authors: Teofilo F. Gonzalez
Venue:  (1996)

This paper has all the proofs for Gonzalez'' paper entitled ``Improved Approximation Algorithms for Multimessage Multicasting'''' by T. Gonzalez \cite{TGIM}. One set of proofs are ``hand proofs'''' and the other set is by a Mathematica program. The Mathematica proofs can also be found in http://www.cs.ucsb.edu/\verb+~+teo.
The Comparison and Improvement of Effort Estimates from Three Software Cost Models
Authors: Dennis G. Kafura, Sallie M. Henry, Mark Gintner
Venue:  (1987)

This paper presents an empirical investigation of effort estimation techniques using three software cost models: Boehm''s basic COCOMO model, Thebaut''s COPMO model, and Putnam''s model. The results, based on proprietary historical project data provided by a major computer manufacturer, are in three parts: (1) a comparison of the three mdels showing that more accurate estimates are obtained from the COPMO model; (2) improvements in the COPMO estimates by means of two techniques termed "submodeling" and "constructive modeling"; and (3) the definition and evaluation of a promising new technique, termed "adjustment multipliers", for improving a model''s estimates. Finally, a second set of industrial data is used to confirm the general applicability of these improvement techniques.
A Correct Optimized Algorithm for Incrementally Generating Prime Implicates
Authors: Alex Kean, George Tsiknis
Venue:  (1992)

In response to the demands of some applications, we had developed an algorithm, called IPIA, to incrementally generate the prime implicates/implicants of a set of clauses. In an attempt to improve IPIA some optimizations were also presented. It was pointed out to us that some of these optimizations, namely the {\em subsumption} and {\em history restriction}, are self conflicting. Subsumption is a necessary operation to guarantee the primeness of implicates/implicants and {\em history restriction} is a scheme that exploits the history of consensus operation to avoid generating non prime implicant/implicates. The original IPIA, where {\em history restriction} was not consider, was proven correct. However, when {\em history restriction} was introduced later in the optimized version, it interacted with the subsumption operation to produce an incomplete set of prime implicants/implicates. This paper explains the problem in more details, proposes a solution and provides a proof of its correctness.
Using Discrimination Graphs to Represent Visual Knowledge
Authors: Mulder Jan A.
Venue:  (1985)

This dissertation is concerned with the representation of visual knowledge. Image features often havee many different local interpretalions. As a result, visual interpretations are often ambiguous and hypothetical. In many model-based vision systems the problem of representing ambiguous and hypothelical interpretations is not very specifically addressed. Generally specialization hierarchies are used to suppress a potential explosion in local interpretations. Such a solution has problems, as many local interpretalions cannot be represented by a single hierarchy. As well, ambiguous and hypothetical interpretations tend to be represented along more than one knowledge representation dimension limiting modularity in representation and control. In this dissertation a better solution is proposed. Classes of objects which have local features with similar appearance in the image are represented by discrimination graphs. Such graphs are directed and acyclic. Their leaves represent classes of elementary objects. All other nodes represent abstract (and sometimes unnatural) classes of objects which intensionally represent the set of elementary object classes that descend from them Rather than interpreting each image feature as an elementary object we use the abstract class that represents the complete set of possible (elementary) objects. Following the principle of least commitment the interpretation of each image feature is repeatedly forced into more restrictive classes as the context for the image feature is expanded until the image no longer provides subclassification information. This approach is called discrimination vision and it has several attractive features. First, hypothetical and ambiguous interpretations can be represented along one knowledge representation dimension. Second the number of hypotheses represented for a single image feature can be kept small. Third in an interpretation graph competing hypotheses can he represented in the domain of a single variable. This often eliminates the need for restructuring the graph when a hypothesis is invalidated. Fourth, the problem of resolving ambiguity can be treated as a constraint satisfaction problem which is a well researched problem in Computational Vision. Our system has been implemented as Mapsee-3, a program for interpreting sketch maps. A hierarchical arc consistency algorithm has been used to deal with the inherently hierarchical discrimination graphs. Experimental data show that, for the domain implemented, this algorithm is more efficient than standard arc consislency algorithm.
Implications of Natural Categories for Natural Language Generation
Authors: Ben E. Cline, Jane T Nutter
Venue:  (1989)

Psychological research has shown that natural taxonomies contain a distinguished or basic level. Adult speakers use the names of these categories most frequently and can list a large number of attributes for them. They typically can list many attributes for superordinate categories and list few additional attributes for subordinate categories. Because natural taxonomies are important to human language, their use in natural language processing systems appears well founded. In the past, however, most AI systems have been implemented around uniform taxonomies in which there is no distinguished level. It has recently been demonstrated that natural taxonomies enhance natural language processing systems by allowing selection of appropriate category names and by providing the means to handle implicit focus. We propose that additional benefits from the use of natural categories can be realized in multi-sentential connected text generation systems. After discussing the psychological research on natural taxonomies that relates to natural language processing systems, the use of natural categorizations in current natural language processing systems is presented. We then describe how natural categories can be used in multiple sentence generation systems to allow the selection of appropriate category names, to provide the mechanism to help determine salience to aid in the selection of discourse schema. to provide for the shallow modeling audience expertise, and to increase the efficiency of taxonomy inheritance.
A Distributed Key Generation Technique
Authors: Chenxi Wang, William A. Wulf
Venue:  (1996)

In a public key cryptographic system, the uniqueness and authenticity of the keys are essential to the success of the system. Traditionally, a single, centralized key distribution/certification server has been used to generate and distribute keys. This approach requires a distinguished trusted entity which could potentially become a single point of failure or penetration in a distributed environment. We present in this paper a new, simple way to handle distributed key generation We assign a unique range of m-bit numbers to each key generator in the system. As a result, the lower-order m bits of the keys generated is a unique number in the assigned range. our scheme not only provides a way to generate globally unique keys in an independent, distributed fashion, it also enhances the security of public-key cryptosystems by eliminating the mapping between keys and entity names.