ppxscal/embedding_network huggingface dataset:
An Evaluation of Interactive, X-Window Capable Software for Scientific Evaluation
Authors: Steven R. Lantz
Venue:  (1992)

Scientific visualization is on the verge of being revolutionized; but in all the excitement over new technologies, it is important not to lose sight of the basic visualization infrastructure. This is especially true at the CNSF, where major hardware and software changes are presently underway. This Technical Report documents a study led by the author in late 1991 and early 1992 to survey existing graphics packages for their ability to do "bread-and-butter" graphics--i.e., to do the unglamorous kinds of visual data exploration which are the most crucial in day-to-day scientific research. To integrate effectively into current working environments, eligible packages had to run in X Windows, and had to offer the user a significant degree of interactivity. Thirteen different commercial and public-domain packages were examined in all; about half were actually installed for hands-on testing by CNSF staff, to see if any of them were suitable to support as a general-purpose graphics tool. In this report, after an extended introduction which spells out the basic requirements from the point of view of a computational scientist, summaries of the products are given and their capabilities compared. Then, an analysis of the advantages and disadvantages of each is presented, and recommendations are offered. A list of sources for all reviewed software is included.
Crowds: Anonymity for Web Transactions
Authors: Michael K. Reiter, Aviel D. Rubin
Venue:  (1997)

In this announcement we introduce a system called Crowds for protecting users'' anonymity on the world-wide-web. Crowds, named for the notion of ``blending into a crowd'''', operates by grouping users into a large and geographically diverse group (crowd) that collectively issues requests on behalf of its members. Web servers are unable to learn the true source of a request because it is equally likely to have originated from any member of the crowd, and indeed collaborating crowd members cannot distinguish the originator of a request from a member who is merely forwarding the request on behalf of another. Our security analysis introduces {\em degrees of anonymity} as an important tool for describing and proving anonymity properties.
The Web as a Visual Design Medium
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

One of the main problems of the web is its dominant textual characteristics. Since the natural way designers express their design ideas is in graphical form, accessing graphical information is a key issue in developing the web as a visual design medium. Since most of the design documents which are created today are products of CAD programs, our current research emphasis is upon indexing and retrieval of CAD documents on the WEB. In this paper we present an approach for the utility and accessibility of CAD-based design information. An approach for the use of CAD documents as a form of distributed case-based design resource on the web is proposed. Possibilities for employing case-based CAD as a theoretical foundation for building large design resource bases on the Web are presented. A case-based technology as a basis for indexing and storage of design cases in a form which enhances the accessibility of design information is proposed.
System Tools for the J-Machine
Authors: Daniel Maskit, Yair Zadik, Stephen Taylor
Venue:  (1993)

No Abstract.
Conformance Testing of Time-Dependent Protocols
Authors: J. Salinas, N. Park, U. Arunkumar, F. Lombardi
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

This paper presents an approach for verifying and validating time-dependent protocols, i.e. protocols for which the time spent for the functions is critical to a successful execution. The proposed approach is a novel modification of the traditional Unique Input/Output (UIO) method by explicitly taking into account the time specification of each edge in a protocol modeled as a finite state machine (FSM). A new FSM model which characterizes the timing properties of the protocol, is proposed. An algorithm which generates a test sequence with minimal traversal time for a time-dependent protocol in polynomial time complexity, is proposed.
Sharing the Garden GATE: Towards an Efficient Uniform Programming Model for CLUMPS
Authors: Darren Butler, Paul Roe
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Gardens integrates a programming language and system to support parallel computation over a network of workstations. Our goal is to develop extensions to Gardens allowing it to efficiently support clusters of SMP machines under a uniform programming model. Such support requires the implementation of high-performance shared memory message passing primitives as well as changes to the existing model invariants and the Gardens runtime system itself. The new communication primitives have demonstrated a minimum latency of 2.0 microseconds and can maintain a maximum bandwidth of approximately 194 MB/s on our test system. The NAS benchmarks, EP and CG have also demonstrated significant performance increases when parallelized by Gardens. The major contribution of this work is a system that efficiently supports multiprocessor computers in a network of workstations with a uniform programming model. Such a system promises to greatly simplify the task of developing high-performance parallel applications to run on CLUMPS.
The number of nucleotide sites needed to accurately reconstructlarge evolutionary trees
Authors: Mike Steel, Laszlo A. Szekely, Peter L. Erdos
Venue:  (1996)

Biologists seek to reconstruct evolutionary trees for increasing number of species, $n$, from aligned genetic sequences. How fast the sequence length $N$ must grow, as a function of $n$, in order to accurately recover the underlying tree with probability $1-\epsilon$, if the sequences evolve according to simple stochastic models of nucleotide substitution? We show that for a certain model, a reconstruction method exists for which the sequence length $N$ can grow surprisingly slowly with $n$ (sublinearly for a wide range of parameters, and even as a power of $\log n$ in a narrow range, which roughly meets the lower bound from information theory). By contrast a more traditional technique (maximum compatibility) provably requires $N$ to grow faster than linearly in $n$. Our approach is based on a new, and computationally efficient approach for reconstructing phylogenetic trees from aligned DNA sequences.
Evaluating the Utility of FEC with Reliable Multicast
Authors: Dan Li, David R. Cheriton
Venue: Proceedings of the Seventh Annual International Conference on Network Protocols (1999)

Forward Error Correction (FEC) has been proposed as a technique for implementing efficient reliable multicast (RM). However, FEC incurs costs in encode/decode delay and implementation complexity. How much benefit is provided relative to these costs and how dependent the benefit is on the specific RM protocol?In this paper, we evaluate the benefits of FEC for RM, considering both proactive and reactive use with three RM recovery techniques: duplicate avoidance, limited scope multicast and subcast. Our simulation-based results indicate that FEC provides little benefit for an efficient RM protocol like OTERS and introduces extra delay for multi-point streaming data applications.
A frequency-based and a poisson-based definition of the probability of being informative
Authors: Thomas Roelleke
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

This paper reports on theoretical investigations about the assumptions underlying the inverse document frequency (idf). We show that an intuitive idf-based probability function for the probability of a term being informative assumes disjoint document events. By assuming documents to be independent rather than disjoint, we arrive at a Poisson-based probability of being informative. The framework is useful for understanding and deciding the parameter estimation and combination in probabilistic retrieval models.
Verifying Programs That Use Causally-Ordered Message-Passing
Authors: Scott D. Stoller, Fred B. Schneider
Venue:  (1994)

We give an operational model of causally-ordered message-passing primitives. Based on this model, we formulate a Hoare-style proof system for causally-ordered delivery. To illustrate the use of this proof system and to demonstrate the feasibility of applying invariant-based verification techniques to algorithms that depend on causally-ordered delivery, we verify an asynchronous variant of the distributed termination detection algorithm of Dijkstra, Feijen, and van Gasteren.
On Spline Approximations for Bayesian Computations
Authors: Eugene Santos,  Jr.
Venue:  (1992)

Probabilistic reasoning suffers from NP-hard implementations. In particular, the amount of probabilistic information necessary to the computations is often overwhelming. For example, the size of conditional probability tables in Bayesian networks has long been a limiting factor in the general use of these networks. We present a new approach for manipulating the probabilistic information given. This approach avoids being overwhelmed by essentially compressing the information. Furthermore, unlike existing techniques, we do not need to explicitly access all the data in order to perform our computations. We have achieved this by transforming the problem into linear constraint satisfaction and using approximating functions.
Dynamic Multi-Resolution Spatial Object Derivation for Mobile and WWW Applications
Authors: Sham Prasher, Xiaofang Zhou, Masaru Kitsuregawa
Venue: World Wide Web (2003)

Online geographic information systems provide the means to extract a subset of desired spatial information from a larger remote repository. Data retrieved representing real-world geographic phenomena are then manipulated to suit the specific needs of an end-user. Often this extraction requires the derivation of representations of objects specific to a particular resolution or scale from a single original stored version. Currently standard spatial data handling techniques cannot support the multi-resolution representation of such features in a database. In this paper a methodology to store and retrieve versions of spatial objects at different resolutions with respect to scale using standard database primitives and SQL is presented. The technique involves heavy fragmentation of spatial features that allows dynamic simplification into scale-specific object representations customised to the display resolution of the end-user's device. Experimental results comparing the new approach to traditional R-Tree indexing and external object simplification reveal the former performs notably better for mobile and WWW applications where client-side resources are limited and retrieved data loads are kept relatively small.
The 50 Best Science & Technology Stocks for Canadians, 2 edition
Authors: Marco Ouden
Venue:  (2002)

:Science and technology stocks have been hit hard in recent months. But what goes around comes around, and high-quality companies on the cutting edge of technology are ready to bounce back. Using the rigorous selection criteria from our 50 Best Advisory Board, Marco den Ouden presents the 50 best science and technology stocks for adding potential rewards to your portfolio while managing risk.Profiles each stock in-depth, including general information about the company, financial highlights, quick-reference graphs and tables, and star ratings.Provides comprehensive financial data on each stock, going back as far as ten years.Analyses the strengths and weaknesses of each stock and explains why you should consider investing in it.Includes an introduction that guides investors through the risks and rewards of investing in this volatile sector, explains how to do your own research, and describes trends that may affect where the market is heading. 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 Algorithm for Distributed Location Management in Networks of Mobile Computers
Authors: Svetlana Kryukova, Berna Massingill, Beverly Sanders
Venue:  (1996)

In a network supporting mobile communication devices, a mechanism to find the location of a device, wherever it may be, is needed. In this paper, we present a distributed algorithm for this purpose along with its formal specification and proof sketch. Inspired by our experiences with Wang''s algorithm [9], one goal of this paper is to demonstrate that the process of formalization together with careful attention to abstraction and presentation can yield significant benefits in algorithm design. In this case, we obtained a more regular, general, and robust algorithm with a clearer description. An incidental contribution is a useful theorem for proving progress properties in distributed algorithms that use tokens.
Corel Draw 10: Superfacil
Authors: Carmen Cordoba Gonzalez, Enrique Cordoba Moreno
Venue:  (2002)

:This manual explains the use and function of all the different CorelDRAW and Corel Photo Paint 10 tools with clear examples and illustrations. The CD contains exercises, videos, and information about free upgrades and design concepts.Este manual explica el uso de las diferentes herramientas del CorelDRAW y del Corel Photo Paint version 10 a traves de ejemplos. Con ilustraciones y breves explicaciones se puede ver claramente como funciona cada una de estas herramientas. Contiene un CD-ROM con 132 ejercicios, 63 videos, e informacion sobre nuevas aplicaciones complementarias y conceptos de diseno."C. Cordoba, C. Gonzalez, and E. Cordoba are the authors of CorelDRAW 9 curso completo and Photoshop 6 superfacil.
Pattern-Supported Architecture Recovery
Authors: Martin Pinzger, Harald Gall
Venue: Proceedings of the 10th International Workshop on Program Comprehension (2002)

Architectural patterns and styles represent important design decisions and thus are valuable abstractions for architecture recovery. Recognizing them is a challenge because styles and patterns basically span several architectural elements and can be implemented in various ways depending on the problem domain and the implementation variants. Our approach uses source code structures as patterns and introduces an iterative and interactive architecture recovery approach built upon such lower-level patterns extracted from source code. Associations between extracted pattern instances and architectural elements such as modules arise which result in new and higher-level views of the software system. These pattern views provide information for a consecutive refinement of pattern definitions to aggregate and abstract higher-level patterns which finally enable the description of a software system's architecture.
Free as in Freedom: Richard Stallman's Crusade for Free Software, 1 edition
Authors: Sam Williams
Venue:  (2002)

:"Why would Microsoft executives lie awake at night worrying about the antics of a long-haired, renegade hacker named Richard Stallman? Why do some of the smartest programmers on the planet revere this man as "St. Ignucius"? And how did a stubborn, precocious boy obsessed with creating the perfect model rocket grow up to play David to the software industry's Goliath?" Free as in Freedom traces this eccentric genius's evolution from gifted, solitary child to teen outcast to revered and reviled crusader. Through extensive interviews with Stallman, his family, fellow hackers, and tech-industry heavyweights, author Sam Williams crafts a portrait of a freedom fighter who has, in fact, changed the world.
Chip Level Signal Integrity Analysis & Crosstalk Prediction Using Artificial Neural Nets
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

Recent ITRS # predictions indicate that by the year 2011, the billion transistor monolithic die will be a reality. This clearly poses a challenge to gigascale integrated circuit design with regard to provision of multilevel interconnect wiring for the distribution of power,data and control signals to all parts of a chip. This paper addresses the problem of characterization, modeling and verification of 3D chip level interconnect crosstalk. The novel methodology proposed involves topological decomposition of interconnect into standard cells - and the creation of parameterized models of these primitive structures using neural networks. Experimental results from a high performance operational amplifier demonstrates the viability of the 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
Pre- and postsynthesis simulation mismatches
Authors: H. Howe
Venue: Proceedings of the 1997 IEEE International Verilog HDL Conference (IVC '97) (1997)

With the widespread adoption of top-down design methodologies using HDL and synthesis, RTL models have become the "golden" design database. However, ASIC and FPGA vendors still require a gate level netlist as the official sign-off design. Model ambiguities in RTL designs can cause differences between RTL and synthesized netlist designs. These differences in the best case cause simulation mismatches between RTL and gate designs. In the worst case, if not detected in simulation they can result in faulty hardware. This paper covers common sources of ambiguity in RTL models. Solutions are provided for avoiding these situations. Some basic simulation debug tips are provided to help identify these errors in simulation with both VHDL and Verilog. These examples are based on Synergy (Cadence's synthesis tool) but also apply to synthesis in general.
Why a distributed kernel?
Authors: Swamy Kutti
Venue: ACM SIGOPS Operating Systems Review (1984)

Until now, the design of operating systems assumed the kernel as an extension of a single processor's physical layer supporting user processes in the one cpu. The present multiprocessor operating systems duplicate this set-up in multiple cpus in order to reduce complex inter-processor communication. Since the functions of a kernel in both a uniprocessor and a multiprocessor operating system have a tendency to grow in an unlimited manner, the redesign of both an intelligent and high speed kernel, becomes an important issue. In this paper, I describe firstly, a brief summary of the current status of a kernel, and secondly the future requirements of a complex operating system. Finally, I present part of a possible solution to construct a high speed kernel based on multiple processors.
Real-Time Commit Protocol For Distributed Real-Time Database Systems
Authors: Yong-Ik Yoon, Mikyung Han, JuHyun Cho
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

A major goal of real-time systems is to meet the timing requirements. A distributed transaction processing should guarantee correct completion for the failure atomicity. When distributed transaction processing is required for real-time applications, it must satisfy the correct completion along with timeliness. All previous commit protocols supporting the correct completion, however, fail to provide the timeliness for real-time processing. This paper proposes a new commit protocol. The basic idea is that the commit procedures for correctness rely on the results of remote transactions that are timely completed. We call the new protocol Real-time Commit Protocol (RCP). RCP satisfies both the correct and the timely completion and produces several desirable effects for fast computing like the elimination of voting phase and the reduction of the number of messages in two phase commit protocol.
Two Experiments on Learning Probabilistic Dependency Grammars from Corpora
Authors: Glenn Carroll, Eugene Charniak
Venue:  (1992)

We present a scheme for learning probabilistic dependency grammars from positive training examples plus constraints on rules. In particular, we present the results of two experiments. The first, in which the constraints were minimal, was unsuccessful. The second, with significant constraints, was successful within the bounds of the task we had set.
Evolutionary bits'n'spikes
Authors: Dario Floreano, Nicolas Schoeni, Gilles Caprari, Jesper Blynel
Venue: Proceedings of the eighth international conference on Artificial life (2002)

We describe a model and implementation of evolutionary spiking neurons for embedded microcontrollers with few bytes of memory and very low power consumption. The approach is tested with an autonomous microrobot of less than 1 in3 that evolves the ability to move in a small maze without human intervention and external computers. Considering the very large diffusion, small size, and low cost of embedded microcontrollers, the approach described here could find its way in several intelligent devices with sensors and/or actuators, as well as in smart credit cards.
A high performance reliable atomic group protocol
Authors: W. Jia, J. Cao, E. Nett, J. Kaiser
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

A novel and efficient group communication (multicast) protocol, based on a single logical-clock token ring approach, is described. The protocol is highly efficient and it guarantees total ordering and atomicity of multicast messages for asynchronous distributed systems. Unlike other logical token-ring algorithms, the protocol does not have a problem of token loss. The optimized fault-tolerant algorithms of the protocol can handle process failures and network partitioning. The experiment results of the implemented protocol in a local area network of workstations have demonstrated that its performance is better than any existing solutions in the same environment, especially, for achieving message total ordering and atomic (safe) delivery.
Enumeration of the Elementary Circuits of a Directed Graph
Authors: Robert E Tarjan
Venue:  (1972)

An algorithm to enumerate all the elementary circuits of a directed graph is presented. The algorithm uses back-tracking with lookahead to avoid unnecessary work, and it has a time bound of $O ((V+E)(C+1))$ when applied to a graph with $V$ vertices, $E$ edges, and $C$ elementary circuits. Keywords: Algorithm, circuit, cycle, graph
Maintaining COTS-based Systems: Is it Possible?
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Maintaining well-documented source-code is a fairly straight-forward process (although not foolproof) when it is performed by the code's original author. Because future information systems will contain functionality (provided in software units termed components) that was developed by organizations external to the one responsible for assembling the system, those activities traditionally associated with the software maintenance process may need to be modified or replaced. 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