ppxscal/embedding_network huggingface dataset:
Design and Implementation of a Diagnostic Compiler for PL/I
Authors: Richard W. Conway, Thomas R. Wilcox
Venue:  (1971)

PL/C is a compiler for a dialect for PL/I. The design objective was to provide a maximum degree of diagnostic assistance in a batch processing environment. For the most part this assistance is implicit and is provided automatically by the compiler. The most remarkable characteristic of PL/C is its perseverance -it completes translation of every program submitted and continues execution until a user-established error limit is reached. This requires that the compiler repair errors encountered during both translation and execution, and the design of PL/C is dominated by this consideration. PL/C also introduces several explicit user-controlled facilities for program testing. Some are conventional, providing a convenient high-level trace and dump capability. An experimental version of PL/C also permits the user to controllably reverse the direction of program execution and to write routines that are asynchronously invoked when an arbitrary condition becomes true. To accomodate these extensions to PL/I without abandoning compatibility with the IBM compiler, PL/C permits `pseudo-comments'' constructions whose contents can optionally be considered either source text or comment. In spite of th ediagnostic effort PL/C is a fast and efficient processor. It effectively demonstrates that compilers can provide better diagnostic assistance than is customarily offered, even when a sophisticated source language is employed, and that this assistance need not be prohibitively costly. Key Words and Phrases: Compilers, Debugging, PL/I
ROPE: A New Twist in Computer Architectures
Authors: Kevin Karplus, Alexandru Nicolau
Venue:  (1987)

Supercomputer architectures are not as fast as logic technology allows because memories are slow than the CPU, conditional jumps limit the usefulness of pipelining and prefetching mechanisms, and functional-unit parallelism is limited by the speed of hardware scheduling. We propose a supercomputer architecture called Ring Of Prefetch Elements (ROPE) that attempts to solve the problems of memory latency and conditional jumps without hardware scheduling. ROPE consists of a pipelined CPU or very-large-instruction-word data path with a new instruction prefetching mechanism that supports general multi-way conditional jumps. To get high-performance without scheduling hardware, ROPE relies on an optimizing compiler based on a global code transformation technique (Percolation Scheduling). This paper describes both the promise and the limitations of ROPE.
Approximation Algorithms for Steiner Augmentations for Two-Connectivity
Authors: R. Ravi
Venue:  (1992)

We consider the problem of increasing the connectivity of a given graph to two at optimal cost. Fredrickson and Ja''Ja'' showed that that this problem is NP-hard and provide approximation algorithms. Recently, Khuller and Thirumella have extended these results and presented a more efficient version of the results of Fredrickson and Ja''Ja''. We consider an extension of this problem to a more general setting. In this setting, we are given an edge-weighted graph, a subset of the vertex set called the sites and an initial subgraph; the objective is to find a minimum weight augmentation of edges that makes the sites two edge-connected or vertex-connected. We provide approximation algorithms for the first time for these problems by extending those of Khuller and Thirumella with matching performance bounds. If the initial subgraph is pconnected, we find an augmentation of weight at most twice the optimal. Otherwise, the performance guarantee is three. The performance guarantee of three is obtained by an interesting application of an approximate min-max relation concerning Steiner trees and packing of cuts derived in a paper by Agrawal, Klein and Ravi. 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
Self-Stabilizing Network Orientation Algorithms In Arbitrary Rooted Networks
Authors: Ajoy K. Datta, Shivashankar Gurumurthy, Franck Petit, Vincent Villain
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper presents the first deterministic self-stabilizing network orientation algorithms. We present three protocols for arbitrary and asynchronous networks. All the protocols set up a chordal sense of direction in the network. The protocols are self-stabilizing, meaning that starting from an arbitrary state, the protocols are guaranteed to reach a state, in which all edge labels (assigned to the links) are valid (meaning, they satisfy the specification of the orientation problem).
Knowledge Bases and Agents for Domain Knowledge Representation
Authors: Marie-Pierre Chouvet, Florence Le Ber
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper focuses on the implementation of domain models for problem solving. We assume that the implementation should preserve the form of the domain models, and particularly the division between the knowledge structure and its role toward the solving process. We propose therefore to implement domain models with both knowledge bases and domain agents. We define a domain agent model which is linked to a knowledge base. We describe the various abilities of this agent and how it has been implemented in a multi-agent system with the YAFOOL language.
Robot Builder's Sourcebook
Authors: Gordon McComb
Venue:  (2002)

:Everything the Robotics Hobbyist Needs to Learn What It Is, Where to Get It, How to Get Started -- from the Author of Robot Builder's Bonanza! Fascinated by the world of robotics but don't know how to tap into the incredible amount of information available on the subject? Clueless as to locating specific information on robotics? Want the names, addresses, phone numbers, and web sites of companies that can supply the exact part, plan, kit, building material, programming language, operating system, computer system, or publication you've been searching for? Turn to Robot Builder's Sourcebook - a unique clearinghouse of information for that will open 2500+ new doors and spark almost as many new ideas. Written by Gordon McComb, author of the classic Robot Builder's Bonanza, one of the most popular books ever written on amateur robotics, the Sourcebook lists over 2500 mail-order suppliers and other sources, including local-area businesses, cross-referenced and categorized to make your search quick and easy. You'll find detailed information about the resources, including addresses and phone numbers: In short, everything you need to find - and acquire - common and uncommon robotics parts and supplies. In order to provide a true "robotics goldmine," this one-of-a kind guide also includes: Dozens of informative "sidebars" to help you understand essential robotic technologies such as motor types, sensor design, and how to select the best materials Scores of relevant articles designed to fill-in informational gaps, stimulate thinking, and help you make the most of all the material the Sourcebook makes available to you If you want to know where in the world of robotics you can find it . . . turn to the Sourcebook.
Reliable Broadcasts Through Partial Broadcasts
Authors: Ozalp Babaoglu, Patrick Stephenson
Venue:  (1985)

In the Reliable Broadcast Problem, a processor disseminates a value to all other processors in a distributed system where both processors and communication components are subject to failures. We prove lower bounds for the execution time of any reliable broadcast protocol in distributed systems with arbitrary communication networks. Our results apply to common distributed system architectures consisting of multiple broadcast network-based clusters of processors. In light of these lower bounds, our earlier protocols are shown to be optimal with respect to execution time.
US E-Government Authentication Framework and Programs
Authors: Michael Caloyannides, Dennis R. Copeland, George H. Datesman Jr., David S. Weitzel
Venue: IT Professional (2003)

Centralized trust-transfer mechanisms based on private-key encryption provide a basis for increased e-government services.
COMPOzE---Intention-based Music Composition through Constraint Programming
Authors: Martin Henz, Stefan Lauer, Detlev Zimmermann
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

The goal of this work is to derive four-voice music pieces from given musical plans, which describe the harmonic flow and the intentions of a desired composition. We developed the experimentation platform COMPOzE for intention-based composition. COMPOzE is based on constraint programming over finite domains of integers. We argue that constraint programming provides a suitable technology for this task and that the libraries and tools available for the constraint programming system Oz effectively support the implementation of COMPOzE. This work links the research areas of of automatic music composition on one hand and finite domain constraint programming on the other, and contributes the tool COMPOzE, which practically demonstrates the potential of constraint programming to open up new areas of application for automatic music composition.
Reasoning about Joint Administration of Access Policies for Coalition Resources
Authors: Himanshu Khurana, Virgil Gligor, John Linn
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

We argue that joint administration of access policies for a dynamic coalition formed by autonomous domains requires that these domains set up a coalition authority that distributes attribute certificates authorizing access to policy objects (e.g., ACLs). Control over the issuance of such certificates is retained by member domains separately holding shares of the joint coalition authority's private key with which they sign the attribute certificates. Hence, any (proper) subset of the member domains need not be trusted to protect the private key. However, application servers that implement joint administration of access policies based on attribute certificates must trust all the signers of those certificates, namely all member domains of the coalition. To capture these trust relations we extend existing access control logics and show that the extensions are sound. To reason about joint administration of access policies, we illustrate an authorization protocol in our logic for accessing policy objects using thresholdattribute certificates.
Refinement of Information Flow Architectures
Authors: Jan Philipps, Bernhard Rumpe
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

A calculus is presented for the stepwise refinement of abstract information flow architectures. We give a mathematical model for information flow components based on relations between input and output communication histories, and describe system architectures using two views: the glass box view is a network of basic components, while the black box view regards the network itself as a component. This allows us to hierarchically compose systems. The calculus consists of basic rules to add or remove components and channels, and to replace components by subnetworks and vice versa. The correctness of the rules is justified by the refinement relation on the black box view of architectures.
A clustering algorithm for huge trees
Authors: D. Auber, M. Delest
Venue: Advances in Applied Mathematics (2003)

We present a new tree clustering algorithm based on combinatorial statistics on trees. Using well-known measures on trees giving the number of leaves of a subtree or the number of siblings of a node, we design a parameter that can be used to detect irregularities in a tree. We obtain a clustering approach for trees by implementing classical statistical tests on this parameter, thus providing well balanced drawings of trees offering better aspect ratios which can be useful when dealing with large, irregular hierarchical data. Our algorithm is linear in time and can thus be applied to large data structures. Moreover the larger the structure is the better the precision of the statistical tools.
Symmetrization of Binary Random Variables
Authors: Abram Kagan, Colin Mallows, Larry Shepp, Robert J. Vanderbei, Yehuda Vardi
Venue:  (1997)

A random variable $Y$ is called an {\em independent symmetrizer} of a given random variable $X$ if (a) it is independent of $X$ and (b) the distribution of $X+Y$ is symmetric about $0$. In cases where the distribution of $X$ is symmetric about its mean, it is easy to see that the constant random variable $Y = - \Exp X$ is a minimum-variance independent symmetrizer. Taking $Y$ to have the same distribution as $-X$ clearly produces a symmetric sum but it may not be of minimum variance. We say that a random variable $X$ is {\em symmetry resistant} if the variance of any symmetrizer, $Y$, is never smaller than the variance of $X$. Let $X$ be a binary random variable: $\Prob \{ X = a \} = p$ and $\Prob \{ X = b \} = q$ where $a \ne b$, $0 > p > 1$, and $q = 1-p$. We prove that such a binary random variable is symmetry resistant if (and only if) $p \ne 1/2$. Note that the minimum variance as a function of $p$ is discontinuous at $p = 1/2$. Dropping the independence assumption, we show that the minimum-variance reduces to $pq - \min (p,q)/2$, which is a continuous function of $p$.
Mobile agents for mobile computing
Authors: Robert S. Gray, David Kotz, Saurab Nog, Daniela Rus, George Cybenko
Venue:  (1996)

Mobile agents are programs that can move through a network under their own control, migrating from host to host and interacting with other agents and resources on each. We argue that these mobile, autonomous agents have the potential to provide a convenient, efficient and robust programming paradigm for distributed applications, particularly when partially connected computers are involved. Partially connected computers include mobile computers such as laptops and personal digital assistants as well as modem-connected home computers, all of which are often disconnected from the network. In this paper, we describe the design and implementation of our mobile-agent system, Agent Tcl, and the specific features that support mobile computers and disconnected operation. These features include network-sensing tools and a docking system that allows an agent to transparently move between mobile computers, regardless of when the computers connect to the network.
Multi-Input Variable-Threshold Circuits for Multi-Valued Logic Functions
Authors: Makoto Syuto, Jing Shen, Koichi Tanno, Okihiko Ishizuka
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

In this paper, two-types of Multi-Input Variable-Threshold (M-I V-T) circuits and their applications to Multi-Valued Logic (MVL) are proposed. M-I V-T circuits are extensions of binary CMOS NAND and NOR gates to multi-valued logic. First, definitions of M-I V-T functions realized with M-I V-T circuits are presented; they are implemented using neuron-MOS transistors. The neuron-MOS transistor is a novel device with multi-input gates and can be fabricated by the standard CMOS process with a double-poly layer. Therefore, the standard CMOS process instead of using the multi-level ion implantation process can easily fabricate the proposed circuits. Second, the characteristics of the proposed circuits are evaluated using HSPICE simulations. Third, realization of a product term using M-I V-T circuits is presented. The circuit implementation of the product term is extended naturally from the literal circuit and is more powerful than the literal circuit. Finally, the synthesis of a MVL function with M-I V-T circuits is discussed.
Moving Home-Based Lazy Release Consistency for Shared Virtual Memory Systems
Authors: Jae Woong Chung, Byeong Hag Seong, Kyu Ho Park, Daeyeon Park
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

While Shared Virtual Memory is a cost-effective way to provide an illusion of shared memory to programmers, the performance of the system is limited by its inherent overheads. Several protocols such as Lazy Release Consistency (LRC) and Home-based LRC(HLRC) have been suggested to overcome the overheads.In this paper, we propose a new all-software protocol, Moving Home-based LRC(MHLRC). Its main contribution is to introduce a new concept, Moving Home. Using it, our protocol provides 4 efficient functionalities: a) providing migration mechanism, b) eliminating the duty of updating the home copy at the end of an interval, c) providing an adaptive home locating scheme, and d) simplifying the update procedure on a stale copy. To evaluate our protocol, we implemented a prototype of MHLRC. The experiment with 4 benchmarks showed that our protocol improved the performance of the system by on the average 10% over LRC, and by up to 96% over HLRC. From the detailed analysis, we found that the improvement mainly comes from the reduction of the coherence action overhead. Our protocol reduced the number of diff operations executed during computation up to 64%(FFT) ~ 0.4%(SOR) against LRC and 56%(FFT) ~ 0.3%(SOR) against HLRC. It also reduces the requirement for memory and network bandwidth.
Protocol synthesis using basic Lotos and global variables
Authors: A. Khoumsi, G. von Bochmann
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

In Kant et al. (1992), a method of protocol synthesis, using basic LOTOS (BL) as a specification language, is proposed. In the present paper, we generalize this method. We propose an extended basic LOTOS (EBL) to specify the service and the protocol. With EBL, events are associated with enabling conditions and transformation functions that depend on global variables. Next, we propose a method to synthesize protocols using EBL as a specification language. This method is inspired by the concept of transactions
Flash MX Complete Course, 1 edition
Authors: William B. Sanders, Leslie Cabarga
Venue:  (2002)

:Written by a Macromedia Flash expert and illustrated throughout in full color, this Complete Course shows you how to master the full range of Flash tools and techniques while working on a single project. Twelve sessions and more than 80 step-by-step tutorials, accompanied by vivid color images and screen shots, walk you through the creation of a beautiful, fully functional Flash Web site, from start to finish. After completing the course, you'll have an impressive portfolio piece -- and a thorough understanding of Flash fundamentals.
The role of relative permeability in simulation of RTM process filling phase
Authors: Z. Dimitrovová, S. Advani
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

In this paper new aspects are introduced into the numerical simulation of the mould filling phase of the Resin Transfer Moulding process of composites manufacturing. Necessity of transient analyses on three levels is justified and importance of consideration of the theory of wetting (unsaturated) flows through dual porous media, implying inclusion of relative permeability and homogenized capillary pressure at the macrolevel, is stressed. First methodologies for relative permeability and homogenized capillary pressure determination, applicable to macroscopically unidirectional pressure driven viscous flows through porous media are described. They are based on a detailed study of the resin progression performed by a Free Boundary Program developed by the authors. Some numerical aspects of the Free Boundary Program are also discussed.
Content Distribution Networks: An Engineering Approach
Authors: Dinesh C. Verma
Venue:  (2002)

:The exponential growth of Internet traffic has created a huge demand for techniques that improve the speed and efficiency of data delivery. One of the most important emerging approaches in this area is the use of a content distribution network (CDN), which involves employing several distributed sites to improve the scalability and responsiveness of applications. Written for network operators, ISPs, network architects, researchers, and advanced computer science students alike, here is a much-needed comprehensive overview of the fundamentals of a content distribution network. It describes the components that make up a CDN, delineates the different technologies that can be used within the network, and illustrates how several Web-based applications can be accelerated using a CDN. Both an "under-the-hood" look at how CDNs work and a guide to practical applications of CDN technologies, Content Distribution Networks: An Engineering Approach is a must-have reference for anyone who operates a Web site, manages an intranet, or needs to master this rapidly emerging, powerful new technology.
Towards Fault-tolerant and Secure Agentry
Authors: Fred B. Schneider
Venue:  (1997)

Processes that roam a network--agents--present new technical challenges. Two are discussed here. The first problem, which arises in connection with implementing fault-tolerant agents, concerns how a voter authenticates the agents comprising its electorate. The second is to characterize security policies that are enforceable as well as approaches for enforcing those policies.
Genetic Algorithms for Engineering Optimization: Theory and Practice
Authors: N. G. Yarushkina
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The genetic algorithms are heuristics and thus they do not ensure an optimal solution. We propose to use a fuzzy controller for improvement of genetic algorithms. A speed of natural evolution is changeable. Genetic algorithms can be classified into three main categories: a basic GA; evolution strategies; a mobile GA. The mobile GA has a variable chromosome structure. The aim of this paper is to consider a efficiency of various GAs. The paper will explore the utility of the recently developed GA paradigm for model fitting using sets of empirical data. To support this work, the real-world problems has been explored. The examples of real-world problems are telecommunication networks traffic optimization and taskof elements placement on plane. In case telecommunication network traffic optimization, a fitting model is a fuzzy rule based system. In this paper, a concept of fuzzy probabilistic variable is introduced. 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
Analog VLSI Circuits for Sensorimotor Feedback
Authors: Stephen P. DeWeerth
Venue:  (1991)

This thesis presents a design framework and circuit implementations for integrating sensory and motor processing onto very large-scale integrated (VLSI) chips. The designs consist of analog circuits that are composed of bipolar and subthreshold MOS transistors. The primary emphasis in this work is the transformation from the spatially-encoded representation found in sensory images to a scalar representation that is useful for controlling motor systems. The thesis begins with a discussion of the aggregation of sensory signals and the resulting extraction of high-level features from sensory images. An integrated circuit that computes the centroid of a visual image is presented. A theoretical analysis of the function of this circuit in stimulus localization and a detailed error analysis are also presented. Next, the control of motors using pulse trains is discussed. Pulse-generating circuits for use in bidirectional motor control and the implementation of traditional control schemes are presented. A method for analyzing the operation of these controllers is also discussed. Finally, a framework for the combination of sensory aggregation and pulse-encoded outputs is presented. The need for signal normalization and circuits to perform this task are discussed. Two complete sensorimotor feedback systems are presented.