ppxscal/embedding_network huggingface dataset:
A Note on Rabin''s Nearest-Neighbor Algorithm
Authors: Steven Fortune, John E. Hopcroft
Venue:  (1978)

Rabin has proposed a probabilistic algorithm for finding the closest pair of a set of points in Euclidean space. His algorithm is asymtomatically linear whereas the best of the known deterministic algorithms take order $n \log n$ time. We show that at least part of the speed up is due to the model rather than the probabilistic nature of the algorithm.
Some Notions about Information Retrieval in Automated Office Environments
Authors: Gerard Salton
Venue:  (1984)

A substantial portion of the work required in office environments involves the processing of natural language texts. This note contains some ideas relating to the structure of natural language texts in office environments. Certain approaches are also outlined concerning the analysis, storage, search, and retrieval of such items. Attention is paid in particular to the processing of items with mixed representations and the handling of complex information specifications.
On-Line Data Reconstruction in Redundant Disk Arrays
Authors: Mark Holland
Venue:  (2001)

There exists a wide variety of applications in which data availability must be continuous, that is, where the system is never taken off-line and any interruption in the accessibility of stored data causes significant disruption in the service provided by the application. Examples include on-line transaction processing systems such as airline reservation systems, and automated teller networks in banking systems. In addition, there exist many applications for which a high degree of data availability is important, but continuous operation is not required. An example is a research and development environment, where access to a centrally-stored CAD system is often necessary to make progress on a design project. These applications and many others mandate both high performance and high availability from their storage subsystems. Parity-based redundant disk arrays are very attractive storage alternatives for these systems because they offer both low cost per megabyte and high data reliability. Unfortunately such systems exhibit poor availability characteristics; their performance is severely degraded in the presence of a disk failure. This dissertation addresses the design of parity-based redundant disk arrays that offer dramatically higher levels of performance in the presence of failure than systems comprising the current state of the art. We consider two primary aspects of the failure-recovery problem: the organization of the data and redundancy in the array, and the algorithm used to recover the lost data. We apply results from combinatorial theory to generate data and parity organizations that minimize performance degradation during failure recovery by evenly distributing all failure-induced workload over a larger-than-minimal collection of disks. We develop a reconstruction algorithm that is able to absorb for failure-recovery essentially all of the array''s bandwidth that is not absorbed by the application process(es). Additionally, we develop a design for a redundant disk array targeted at extremely high availability through extremely fast failure recovery. This development also demonstrates the generality of the presented techniques.
Stable and Sequential Functions on Scott Domains
Authors: Stephen Brookes, Shai Geva
Venue:  (1992)

The search for a general semantic characterization of sequential functions is motivated by the full abstraction problem for sequential programming languages such as PCF. We present here some new developments towards such a theory of sequentiality. We give a general definition of sequential functions on Scott domains, characterized by means of a generalized form of topology, based on sequential open sets. Our notion of sequential function coincides with the Kahn-Plotkin notion of sequential function when restricted to distributive concrete domains, and considerably expands the class of domains for which sequential functions may be defined. We show that the sequential functions between two dI-domains, ordered stably, form a dI-domain. The analogous property fails for Kahn-Plotkin sequential functions. Our category of dI-domains and sequential functions is not cartesian closed, because application is not sequential. We attribute this to certain operational assumptions underlying our notion of sequentiality. We show that the Scott domains satisfying a certain "finite meet" property are closed under the pointwise-ordered stable function space, so that we obtain a new stable model based on the pointwise order. We discuss some issues arising in the search for a class of domains closed under the pointwise-ordered sequential function space. We discuss the relationship between our ideas and the full abstraction problem for PCF, and indicate directions for further development.
Formal Specification and Verification of the MISSI Sender and Local Cache Using SPIN
Authors: Milica Barjaktarovic
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

We constructed a formal specification for sending secure Internet e-mail using Multilevel Information System Security Initiative (MISSI). We used formal language PROMELA, based on Hoare's CSP. We verified the model using AT&T's automated model checker SPIN. We propose a software engineering approach where we translate from English to pseudocode to a process algebra specification, verify the specification, and discover ambiguities, omissions, and errors in the English description. This work shows that formal methods can be used to speed up and clarify the software engineering process. It took eight weeks to choose SPIN among several tools, learn SPIN and MISSI, and produce and verify a sender model. We later added a local cache specification. The complexity of the process is intensified by starting from the purely English- and figure- based original specification, which relies on many separate documents and standards that operate together.
Unix for Mac: Your Visual Blueprint for Maximizing Open Source Capabilities, 1 edition
Authors: Kynn Bartlett
Venue:  (2003)

:Welcome to the only guidebook series that takes a visual approach to professional-level computer topics. Open the book and youll discover step-by-step screen shots that demonstrate over 160 key Unix tasks you can do on Mac OS X, including: Using the terminal application Navigating the file system Working with pico, vi, and emacs text editors Customizing the shell Writing shell scripts Sharing files between computers Using system administration commands Installing and using Internet applications Running the X Window System Developing new Unix applications Productivity tools and much more on CD-ROM! OpenOffice.org, a free office productivity software suite Gimp, a GNU image manipulation program XFree86 to run X Window System applications Plus a searchable e-version of the book 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
Analysis of Typical Fault-Tolerant Architectures using HARP
Authors: J S Bavuso, B J Dugan, S K Trivedi, M E Rothmann, Earl W Smith
Venue:  (1986)

HARP (the Hybrid Automated Reliability Predictor) is a software package that implements advanced reliability modeling techniques. In this paper we present an overview of some of the problems that arise in modeling highly reliable fault-tolerant systems, loosely divided into model construction and model solution problems. We then describe the HARP approach to these difficulties, which is facilitated by a technique called {\em behavioral decomposition}. The bulk of this paper presents examples of the dependability evaluation of some typical fault tolerant systems, including a local area network, two well known fault-tolerant computer systems ( {\em C.mmp} and {\em SIFT} ), and an example of a flight control system.
A Performance System for High Quality Desktop Video Conference
Authors: Serban Catrava, Forouzan Golshani
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

This paper describes a performance system that, by graceful degradation and reallocation of resources, attempts to maintain quality in desktop video conference (DVC) systems. The performance system is based on a distributed agent architecture, where agents cooperate to maintain the required quality of service (QoS) during the video conference session. This system adjusts its setting in real time to optimally respond to a set of changing conditions and parameters. The performance system comprises a set of performance enhancers to compensate for the hardware overloads and to maintain the conference throughput when external factors are changing the environment. The performance system uses quality evaluators to analyze the system behavior and to activate /deactivate a compensation loop.
A complete term rewriting system for decimal integer arithmetic
Authors: H. R. Walters
Venue:  (1994)

We present a term rewriting system for decimal integers with addition and subtraction. We prove that the system is confluent and terminating.
Error Visualization of Tetrahedral Subdivision Approach for Trilinear Interpolation
Authors: Akio Doi, Koji Koyamada
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

A linear interpolation scheme inside a tetrahedral cell often causes a large interpolation error when field values change drastically. However, the error has not been analyzed and visualized thoroughly. In order to understand the error distribution inside a tetrahedral cell, we propose two types of error norms, which are both an interpolation function error norm and a field data error norm. These error norms make it possible to compare the linear interpolation function with a trilinear interpolation function that has often been used in rectilinear grid cell, and visualize the error distribution by using iso-surface display.
Incremental dynamics
Authors: D. J Eijck
Venue:  (1998)

An incremental semantics for a logic with dynamic binding is developed on the basis of a variable free notation for dynamic logic. The variable free indexing mechanism guarantees that active registers are never overwritten by new quantifier actions. The resulting system has the same expressive power as Dynamic Predicate Logic or Discourse Representation Theory, but comes with a more well behaved consequence relation. A calculus for dynamic reasoning with anaphora is presented and its soundness and completeness are established. Incremental dynamic logic provides an explicit account of anaphoric context and yields new insight into the dynamics of anaphoric linking in reasoning.
An RPC-Based Methodology for Client/Server Application Development in C++
Authors: Yoad Gidron, Lev Kozakov, Uri Shani
Venue: Proceedings of the 8th Israeli Conference on Computer-Based Systems and Software Engineering (1997)

Remote Procedure Call (RPC) is a commonly used mechanism for client/server applications. RPC implements a tightly synchronized client/server interaction that is analogous to the well understood procedure call in regular non-distributed applications. The underlying principle common to all RPC-based tools and standards is that both client and server share a common IDL (Interface Definition Language) file. Automatic tools process the IDL file and generate source files that when compiled with the application, ensure client/server run-time compliancy. We introduce an RPC methodology for C++ client/server applications that follows a different pattern; sharing of C++ base classes, in place of an IDL file. This releases the developer from the dependence on, and need to learn complex RPC tools and standards. We believe that C++ programmers will find this approach sufficient for most of their distributed-applications development needs.
General Framework for the Description of QoS in UML
Authors: Miguel A. de Miguel
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

UML is useful for modeling object-oriented systems, their behavior and interaction. However, UML currently does not support the modeling of quality of service (QoS) criteria, such as the reliability and accuracy (i.e., quality). A QoS framework provides support to ensure consistency in modeling various qualities of service. It supports a general categorization of different kinds of QoS; including QoS that are fixed at design time as well as ones that are manageddynamically. And it supports the integration of different categories of QoS for the purpose of QoS modeling of system aspects.Frequently the behavior of a system component is functionally correct, but the result it generates is nevertheless unacceptable because the result does not meet some QoS criteria. One way to enhance the capability of the system to deliver results of acceptable quality is to use flexible components that adapt their behavior depending on the resources available and the QoS required.
A Study of Synthetic Creativity through Behavior Modeling and Simulation of an Ant Colony
Authors: Peter S. Heck, Sumit Ghosh
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

The objective of this paper is to scientifically study the nature of creativity by modeling synthetic creativity in an ant colony, simulating it on a computer system, and measuring its impact on performance through innovative metric design. In this study, two synthetic creative traits are introduced into select individual ants of a colony by imparting to them a foraging behavior that is radically different from the normal behavior. Analysis of the simulation results reveal that a creative trait coupled with the underlying parameters of the ant colony may cause the foraging completion time metric, i.e. the time to collect food from all sources, to be marginally better or weaker than the normal colony. Contrary to intuition, the completion time metric worsens when, in a fixed sized colony, the number of creative ants, relative to normal ants, becomes excessive.
Is this a Quadrisected Mesh?
Authors: Gabriel Taubin
Venue:  (2000)

In this paper we introduce a fast and efficient linear time and space algorithm to detect and reconstruct uniform Loop subdivision structure, or triangle quadrisection, in irregular triangular meshes. Instead of a naive sequential traversal algorithm, and motivated by the concept of covering surface in Algebraic Topology, we introduce a new algorithm based on global connectivity properties of the covering mesh. We consider two main applications for this algorithm. The first one is to enable interactive modeling systems that support Loop subdivision surfaces, to use popular interchange file formats which do not preserve the subdivision structure, such as VRML, without loss of information. The second application is to improve the compression efficiency of existing lossless connectivity compression schemes, by optimally compressing meshes with Loop subdivision connectivity. Extensions to other popular uniform primal subdivision schemes such as Catmul-Clark, and dual schemes such as Doo-Sabin, are relatively strightforward but will be studied elsewhere.
Incremental Computation and the Incremental Evaluation of Functional Programs
Authors: William W. Pugh
Venue:  (1988)

Incremental computation is generally thought of as the technique of efficiently updating the result of a computation when the input is changed. This idea is used in doing semantic checking in programming environments, document formatting in WYSIWYG editors and other applications. More generally, incremental computation is the technique of efficiently applying a function to a series of similar inputs. Much of the previous work on incremental computation has centered on incremental attribute grammar and incremental dependency graph evaluation schemes, but these techniques are only suitable for certain applications. This thesis examines an alternative method for providing incremental computation. Our results provide practical methods that can be used for applications such as theorem provers for which attribute grammars are unusable. Even for those problems for which attribute grammars are best suited, our methods perform almost as well as attribute grammars. We describe an incremental evaluator for functional programs that makes use of function caching. Function caching, or memoising, allows reuse of solutions to problems that were solved previously. We examine how function caching can be effectively used when solving problems that are similar to problems that were solved previously. In order for function caching to provide incremental evaluation, two similar problems must be solved by decomposing them into sub-problems in such a way that they share many common sub-problems. We formalize and quantify this idea with the notion of a stable decomposition, and we present data structures for representing sets and sequences that have stable decompositions. We solve several problems related to the efficient implementation of function caching. To perform function caching efficiently, one must be able to determine if two values are equal in constant time and perform updates applicatively. The data structures we present for sets and sequences support these features. This was previously an open problem for representations that also supported efficient updates. We also examine how to calculate hash keys and perform fast equality tests for S-expressions and how to determine what to purge from a function cache when it is full. We report benchmarks that show our function caching implementation produces significant speed-ups in complex programs such as incremental theorem provers.
A Practical Approach to Drawing Undirected Graphs
Authors: Daniel Tunkelang
Venue:  (1994)

FTP: CMU-CS-94-161.ps Although there is extensive research on drawing graphs, none of the published methods are satisfactory for drawing general undirected graphs. Generating drawings which are optimal with respect to several aesthetic criteria is known to be NP-hard, so all published approaches to the problem have used heuristics. These heuristics are too slow to be practical for graphs of moderate size, and they do not produce consistently good drawings for general graphs. Moreover, they rely on general optimization methods, because problem-specific methods require a deeper theoretical understanding of the graph drawing problem. This paper presents an algorithm to generate two-dimensional drawings of undirected graphs. The algorithm uses a combination of heuristics to obtain drawings which are near-optimal with respect to an aesthetic cost function. The algorithm is incremental in nature, but preprocesses the graph to determine an order for node placement. The algorithm uses a local optimization strategy that effectively manages the trade-off between speed and output quality. Finally, the algorithm uses a variety of techniques to speed up computation of the aesthetic cost function. The paper discusses this algorithm in the context of previous work and open problems. The algorithm is compared with the "force-directed" algorithm of Fruchterman and Reingold and the simulated annealing algorithm of Davidson and Harel in terms of output quality. Finally, the paper considers what work is necessary to create a truly effective algorithm for drawing undirected graphs.
Supporting the Selection of Software Requirements
Authors: Joachim Karlsson, Kevin Ryan
Venue: Proceedings of the 8th International Workshop on Software Specification and Design (1996)

The choice of candidate requirements for implementation is a primary determinant of customer satisfaction. It is argued that a set of requirements should be chosen which reflects both the importance and the estimated cost of each candidate requirements. A contribution-based method is proposed which determines importance and estimates cost and industrial experience in applying this method is reported. The results indicate that the contribution of candidate requirements can vary by orders of magnitude. By applying the method, software managers are in a position to select requirements for implementation based on each candidate requirement's contribution.
Visualization in Tunnelling - New Developments
Authors: G. Opriessnig
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

Within the Visualization project of the Austrian Joint Research Initiative (JRI) Numerical Simulation in Tunnelling (SiTu) the Tunnelling Visualization System (TVS) is being developed, to display information in tunnelling. The aim of the Project is to implement a user friendly visualization system, where the data can be displayed in a way, that tunnelling engineers can understand. Virtual Reality techniques are new in tunnelling and offer a lot of new possibilities. 3D-scalar-fields are visualised in a novel way. The data to be visualised are either results from numerical simulation or ones describing geological features. Such data have special properties, which have to be considered by the visualization system. This paper will present innovative techniques for this purpose.
A hardware implementation of capability-based addressing
Authors: G. J. Myers, B. R. S. Buckingham
Venue: ACM SIGOPS Operating Systems Review (1980)

The SWARD architecture, an experimental higher-level architecture, contains the naming and protection concept of capability-based addressing. After discussing the merits of capability-based addressing, its general representation in the SWARD architecture is discussed. The initial representation of capability-based addressing in the architecture led to a set of problems; these problems are described, as well as their solutions. Finally, the implementation of capabilities by the processor is discussed.
Computer assisted manipulation of algebraic process specifications
Authors: Jan F Groote, Bert Lisser
Venue:  (2001)

Specifications of system behaviour tend to become large. Analysis of such specifications requires automated tools. Most attention hitherto has been invested in fully automatic tools. We however believe that in many cases human intervention is required and we therefore propose a number of computer tools to transform process specifications. The concrete manipulation tools that we describe can eliminate constants, redundant sum variables and parameters, and allow to split variables ranging over complex datatypes. These tools can transform specifications with large finite state spaces to variants with state spaces being a fraction of their original size, and transform specifications with infinite state spaces to those with finite state spaces.
Internet-Based Virtual Manufacturing: A Verification Tool for IC Designs
Authors: Wieslaw Kuzmicz
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

This work is the first step toward the Internet-based ?virtual manufacturing?. The problem of statistical design of IC cells, with special emphasis on analog IC design and device mismatch is addressed. A statistical CMOS process/device simulator accessible via user-friendly Web interface has been developed. The process is simulated in a statistical (Monte Carlo-type) loop with all kinds of variations, inter-die and intra-die, random and deterministic, taken into account. The input data includes device channel dimensions, orientations and positions on the chip. A statistical sample of chips is simulated. The outputs include SPICE model files with individual models for all simulated devices and a statistical file. A statistical postprocessor provides statistics of model parameters including correlations and mismatch. These data can be used for verification of manufacturability and optimization of IC designs. The user does not need to know the processing details and has no access to confidential manufacturing-related information.