ppxscal/embedding_network huggingface dataset:
Cornell Local Network (CLONE): Interface Unit, Principles of Operation
Venue:  (1981)

This document describes the architecture and operation of a CLONE Interface Unit. It is the defining document. 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
Modeling and Analysis of Fault-Tolerant Systems
Authors: S K Trivedi
Venue:  (1984)

Important problems in modeling complex fault-tolerant systems are classified and some of the solutions are discussed. Attention is focused on the reliability analysis and the performance analysis of systems subject to failure.
Projecting our Presence in Space and in Time
Authors: Daniel E. Cooke
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

"When people think of space, they think of rocket plumes and the Space Shuttle, but the future of space is information technology. We must develop a virtual presence, in space, on planets, in aircraft and spacecraft." [Dan Goldin, May 1996] To help meet NASA's computer science research needs, the number one priority at the NASA Ames Research Center is nowcomputer science research. [CH2000]NASA's change in focus has arisen out of its realization that the major technological roadblocks impeding the nation's ability to perform earth and space science, and to achieve its exploration goals, center on computation and Artificial Intelligence (AI). Communication delays on long distance missions compel NASA to focus on Computer Science research. Withroundtrip communication delays ranging from 6 to 45 minutes between Earth and Mars, human and robotic missions cannot be effectively controlled remotely from earth. Much of the intelligence provided by Mission Controllers will, in the future, necessarily accompany human and virtual explorers. 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
SPARKLE Work Package 3: Phrasal Parsing Software. Deliverable D3.2
Authors: J. Carroll, T. Briscoe, G. Carroll, M. Light, D. Prescher, M. Rooth, S. Federici, S. Montemagni, V. Pirrelli, I. Prodanof, M. Vannocchi
Venue:  (1997)

Deliverable 3.1 at T12 reported the initial work on the SPARKLE parsing systems. In this deliverable, we report futher development since T12 of the robust parsers at Cambridge/Sussex, Stuttgart, and Pisa. TEL:: +39 50 560481
Centralized Multicast
Authors: Srinivasan Keshav, Sanjoy Paul
Venue:  (1998)

Most current schemes for multicast routing assume that multicast routers participate both in forwarding multicast packets and in control algorithms for routing, resource reservation, and group management. By separating data and control flow, and by centralizing control in distinct control elements, we have designed a simple and scalable approach to IP multicast that we call Centralized Multicast. We present the details of our approach, a proof of its correctness, analysis of its performance, and a discussion of its advantages over current schemes.
A direct-indirect reward sharing model in multiagent reinforcement learning
Authors: Yoshinobu Bochi, Tadachika Ozono, Toramatsu Shintani
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We propose a new multiagent model called direct-indirect reward sharing model. An evaluator in our model determines contributions of agents in a goal state, and shares a reward according to them. We have examined two methods for determining the ratios of contributions. One method uses a constant ratio that is derived the theory for suppressing irrational rules we prove in this paper. The other method evaluates them based on the evaluator's past memory.
Flash MX Audio Magic
Authors: Brad Kozak, Manuel Clement, Eric E. Dolecki
Venue:  (2002)

:Half of Flash is AUDIO, not just visual: Don't let bad sound ruin your great looking Flash site. Flash Audio Magic is organized into six projects-based sections, each of which contains several stepped-through tutorials for mastering a critical component of creating and integrating audio with Flash. These six sections are followed by four appendices completely covering the myriad resources on the book's CD and how to use them, keyboard shortcuts, bibliography (books and web sites), and more. The CD-ROM includes trail version of Flash, ACID Pro 3.0, copy of ACID Xpress, Vegas Audio 2.0, SoundForge XP, 4.5, library of ACID loops, FLA, SWF and WAV examples, list of online resources. Flash Audio Magic is not tied to a specific rev of Flash.
Immersive and 3D viewers for CUMULVS: VTK/CAVETM and AVS/Express
Authors: Torsten Wilde, James A. Kohl, Raymond E. Flanery,  Jr.
Venue: Future Generation Computer Systems (2003)

This paper will discuss the development of two viewer interfaces for the CUMULVS system, one for virtual reality (VR) visualization via ImmersaDeskTM/CAVETM systems, and one for 3D data visualization using the commercial component-based AVS/Express visualization environment. The CUMULVS (Collaborative, User Migration, User Library fee Visualization and Steering) system, developed at Oak Ridge National Laboratory, is an essential platform for interacting with high-performance scientific simulation programs on-the-fly. It provides runtime visualization of data while they are being computed, as well as coordinated computational steering, application-directed checkpointing and fault recovery mechanisms, and rudimentary model coupling functions. CUMULVS consists of a set of cooperative libraries that enable the dynamic attachment of front-end "viewer" programs to running applications, for interactive visualization of extracted data snapshots using a variety of visualization tools. A development strategy will be presented for integrating CUMULVS with the given visualization libraries and environments, including discussion of the various data transformations and the visualization pipeline necessary for converting raw CUMULVS data into fully rendered graphical entities. In addition to the immersive VR CUMULVS viewer, an overview of the object-based AVS/Express CUMULVS viewer design will be presented, including discussion of the various components, modules, macros and user interfaces. A comparison will be made of the two viewer design approaches.
Molecular Dynamics on the Mosaic
Authors: Klaas Esselink, Jan L.A. van de Snepscheut
Venue:  (1992)

We describe the development, implementation and performance of a parallel Molecular Dynamics program for the MOSAIC network of processors being developed at Caltech. A communication protocol is set up, and the influence of using different communication networks on the physical network is studied.
Wave-Parallel Computing Technique for Neural Networks Based on Amplitude-Modulated Waves
Authors: Yasushi Yuminaka, Yoshisato Sasaki, Takafumi Aoki, Tatsuo Higuchi
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

Wave-parallel computing (WPC) technique is proposed to address the interconnection problem in massively interconnected VLSI architectures required for implementing artificial neural networks. The fundamental concepts are frequency multiplexing of signals on a single line, and their wave-parallel processing without decomposition. This paper discusses the realization of a Hopfield-type fully connected neural network as an example, and shows that the WPC-based network exhibits much lower topological complexity compared with the original network. We also investigate the possible implementation of WPC based on the present MOS technology, and discuss the evaluation in terms of the degree of multiplexing and processing speed. Keywords : Wave-Parallel Computing, Set-valued logic, Neural Networks, Frequency multiplexing , Parallel processing
A Multiprocessor Extension to the Conventional File System Interface
Authors: Nils Nieuwejaar, David Kotz
Venue:  (1994)

As the I/O needs of parallel scientific applications increase, file systems for multiprocessors are being designed to provide applications with parallel access to multiple disks. Many parallel file systems present applications with a conventional Unix-like interface that allows the application to access multiple disks transparently. By tracing all the activity of a parallel file system in a production, scientific computing environment, we show that many applications exhibit highly regular, but non-consecutive I/O access patterns. Since the conventional interface does not provide an efficient method of describing these patterns, we present an extension which supports strided and nested-strided I/O requests.
The Logic of Aliasing
Authors: Robert Cartwright, Derek Oppen
Venue:  (1978)

We give a new version of Hoare''s logic which correctly handles programs with aliased variables. The central proof rules of the logic (procedure call and assignment) are proved sound and complete.
Counting, enumerating and sampling of execution plans in a cost-based query optimizer
Authors: Florian Waas, Cesar A. Galindo-Legaria
Venue:  (1999)

Testing an SQL database system by running large sets of deterministic or stochastic SQL statements is common practice in commercial database development. However, code defects often remain undetected as the query optimizer''s choice of an execution plan is not only depending on the query but strongly influenced by a large number of parameters describing the database and the hardware environment. Modifying these parameters in order to steer the optimizer to select other plans is difficult since this means anticipating often complex search strategies implemented in the optimizer. In this paper we devise algorithms for counting, exhaustive generation, and uniform sampling of plans from the complete search space. Our techniques allow extensive validation of both generation of alternatives, and execution algorithms with plans other than the optimized one---if two candidate plans fail to produce the same results, then either the optimizer considered an invalid plan, or the execution code is faulty. When the space of alternatives becomes too large for exhaustive testing, which can occur even with a handful of joins, uniform random sampling provides a mechanism for unbiased testing. The technique is implemented in Microsoft''s SQL Server, where it is an integral part of the validation and testing process.
An Approach to the Functional Description of an Information Retrieval System Based on a Generalized Model
Authors: Carolyn J. Crouch, Richard E. Nance
Venue:  (1984)

In this paper, the authors present a high level, functional approach to the description of a generalized information retrieval system. The description is based on the top-down decomposition of the system into modules and processes and on an appropriate data abstraction. The purpose of this paper is to describe the behavior of the system in terms of the component processes and the interactions of these processes in terms of inputs, outputs, and the associated transformations. It allows one to view the system as a collection of abstract processes, each of which is concisely defined via a notation that describes what is accomplished but not how such a process is to be implemented. Semantically irrelevant details are removed, thereby producing a nonprocedural description which not only elucidates system behavior but serves as a basis for subsequent formal specification.
Performance Evaluation of Nested-Loop Join Processing on Networks of Workstations
Authors: Kenji Imasaki, Sivarama Dandamudi
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems (2000)

Networks Of Workstations (NOWs) are attractive for parallel processing due to their cost advantage. This paper investigates the performance issues in processing join operations and the inherent tradeoff in the networked workstation environment. Specifically, we look at the performance of the nested-loop join algorithm. Since NOWs are heterogeneous in nature, load sharing is important for their performance. We evaluated the performance of three load sharing methods: static equal, static proportional and dynamic scheduling with fixed-chunk size. The three scheduling methods are evaluated on an experimental heterogeneous network of workstations with non-query background loads. Our experimental results suggest that, when there is no background load, dynamic scheduling outperforms static equal scheduling (up to 40%) and marginally better (about 10% better speedup) than the static proportional scheduling. When there is dynamic background load on nodes, dynamic scheduling provides substantial performance improvement over the static proportional scheduling (up to 50%) and static equal scheduling (up to about 100%). In all cases, selection of an appropriate chunk size is important in dynamic scheduling.
Deriving a Fault Architecture from Defect History
Authors: A. von Mayrhauser, J. Wang, M. C. Ohlsson, C. Wohlin
Venue: Proceedings of the 10th International Symposium on Software Reliability Engineering (1999)

As software systems mature, there is the danger that not only code decays, but software architecture as well. We adapt a reverse architecting technique to defect reports of a series of releases. Relationships among system components are identified based on whether they are involved in the same defect report, and for how many defect reports this occurs. There are degrees of fault-coupling between components depending on how often two components are involved in a defect fix. After these fault-coupling relationships between components are extracted, they are abstracted to the subsystem level. The resulting fault architecture figures show for each release what its most fault-prone relationships are. Comparing across releases shows whether some relationships between components are repeatedly fault prone, indicating an underlying systemic architecture problem. We illustrate our technique on a large commercial system consisting of over 800 KLOC of C, C++, and microcode.
Local consensus ontologies for B2B-oriented service composition
Authors: Andrew Williams, Anand Padmanabhan, M. Brian Blake
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Agents seeking to discover and compose needed Web services may face knowledge sharing interoperability problems due to differing ontologies. In practice, agents may not have a global consensus ontology that will facilitate knowledge sharing and integration of required services. We investigate a method for agents to develop local consensus ontologies to aid in the communication within a multi-agent system of business-to-business (B2B) agents. We compare variations of syntactic and semantic similarity matching to form local consensus ontologies with and without the use of a lexical database.
Interconnect Effort - A Unification of Repeater Insertion and Logical Effort
Authors: Srividya Srinivasaraghavan, Wayne Burleson
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

Interconnects are assuming increasing importance in deep submicron design, however there is a signicant gap between industrial design practice and classical results of uniform repeater insertion. This work questions two of the standard assumptions of academic interconnect circuits: 1) the uniformity of repeater sizes and spacing and 2) the boundary between logic and interconnects. This research explores the co-design of logic sizing and repeater insertion for improved delay, power and placement. The technique of logical effort is used to develop the sizing scheme for the logic including polarity considerations. Non-uniform repeater insertion is used to c ombine cascade d sizing and distributed wire buffering. HSPICE simulations carried out for the 0:18µ technology show that combining the sized logic with uniform repeaters is faster than using minimum sized logic circuitry by about 10% while with non-uniform repeaters the gain is about 15%. The average power consumption of non-uniform repeater insertion is less than that of uniform insertion by about 20%. Non-uniform repeater insertion is also less placement sensitive (shifting the position of each repeater in the setup by about 40% results in a delay loss of only about 3% while for uniform repeaters the delay loss is about 20%).
CCNA: Cisco Certified Network Associate Exam Notes, 3 edition
Authors: Todd Lammle, Sean Odom
Venue:  (2002)

:CCNA: Cisco Certified Network Associate Exam Notes provides the fastest and most effective way to review essential exam material and make sure you're ready to pass the new CCNA exam.
Heavy-traffic analysis for the $GI/G/1$ queue with heavy-tailed distributions
Authors: Onno J. Boxma, J. W. Cohen
Venue:  (1997)

We consider a $GI/G/1$ queue in which the service time distribution and/or the interarrival time distribution has a heavy tail, i.e., a tail behaviour like $t^{-\nu}$ with $1>\nu \leq 2$, so that the mean is finite but the variance is infinite. We prove a heavy-traffic limit theorem for the distribution of the stationary waiting time ${\bf W}$. If the tail of the service time distribution is heavier than that of the interarrival time distribution, and the traffic load $a \rightarrow 1$, then ${\bf W}$, multiplied by an appropriate `coefficient of contraction'' that is a function of $a$, converges in distribution to the Kovalenko distribution. If the tail of the interarrival time distribution is heavier than that of the service time distribution, and the traffic load $a \rightarrow 1$, then ${\bf W}$, multiplied by another appropriate `coefficient of contraction'' that is a function of $a$, converges in distribution to the negative exponential distribution.
Logical Model for Representing Uncertain Statuses of Multiple-Valued Logic Systems Realized by Min, Max and Literals
Authors: Noboru Takagi, Akimitsu Hon-nami, Kyoichi Nakashima
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

This paper will discuss on a logical model which is suitable for representing uncertain statuses existing in multiple-valued logic systems realized by minimum, maximum and literals. Then, some of the mathematical properties of functions defined by the logical model will be presented.
Thurstonian-type representations for "same-different" discriminations: probabilistic decisions and interdependent images
Authors: Ehtibar N. Dzhafarov
Venue: Journal of Mathematical Psychology (2003)

A general Thurstonian-type representation (with stochastically interdependent images and probabilistic decisions) for a "same-different" discrimination probability function Φ(x, y) is a model in which the two stimuli x, y are mapped into two generally interdependent random images P(x) and Q(y) taking on their values in some "perceptual" space; and the realizations of these two random images in a given trial determine the probability with which x and y in this trial are judged to be different. While stochastically interdependent, P(x) and Q(y) are selectively attributed to (influenced by), respectively, x and y, which is understood as the possibility of conditioning P(x) and Q(y) on some random variable R that renders them stochastically independent, with their conditional distributions selectively depending on, respectively, x and y. A general Thurstonian-type representation is considered "well-behaved" if the conditional probability with which P(x) and Q(y), given a value of the conditioning random variable R, fall within two given subsets of the perceptual space, possess appropriately defined bounded directional derivatives with respect to x and y. It is shown that no such well-behaved Thurstonian-type representation can account for Φ(x, y) possessing two basic properties: regular minimality and nonconstant self-similarity. At the same time, an alternative to Thurstonian-type modeling (a model employing "uncertainty blobs" in stimulus spaces instead of random variables in perceptual spaces) is readily available that predicts these two properties "automatically".
An architecture for privacy-preserving mining of client information
Authors: Murat Kantarcioglu, Jaideep Vaidya
Venue: Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14 (2002)

Due to privacy concerns, clients of some services may not want to reveal their private information. Even in these situations, data mining is feasible without sacrificing user privacy. Prior approaches to this problem generally trade off accuracy for security, without giving provable bounds on security. Alternatives to the randomization technique are required to enable accurate data mining while strictly preserving privacy. In this paper, we present a general architecture that enables privacy-preserving mining of client information. Under some reasonable assumptions, we show that our methods are secure, while maintaining the accuracy of the results.
The Hamlet Design Entry System: On the Implementation of Synchronous Channels
Authors: M. R. Steen
Venue:  (1994)

The graphical Hamlet Application Design Language (ADL) has been developed to support the construction of parallel applications. The language is based on a notion of processes communicating by means of message-passing. One of the goals of ADL is that its implementation should allow for automated parallel code generation. However, not every communication constructyy
Computing the Pipelined Phase-Rotation FFT
Authors: Langhorne P. Withers, John E. Whelchel, David R. O''Hallaron, Peter J. Lieu
Venue:  (1993)

The phase-rotation FFT is a new form of the FFT that replaces data movement with multiplications by constant phasor multipliers. The result is an FFT that is simple to pipeline. This paper reports some fundamental new improvements to the original phase-rotation FFT design, provides a complete description of the algorithm directly in terms of the parallel pipeline, and describes a radix-2 implementation on the iWarp computer system that balances computation and communication to run at the full-bandwidth of the communications links, regardless of the input data set size.
A TMO Based Approach to Structuring Real-Time Agents
Authors: K. H. (Kane) Kim
Venue: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (2002)

Mobile agent structuring is an increasingly practiced branch of distributed computing softwareengineering. In this paper we discuss the major issues encountered in producing real-time (RT) agents which are designed to perform output actions in manners meeting specified timing requirements. An approach to structuring of RT agents which is an extension of a high-levelreal-time distributed object programming approach called the Time-triggered Message-triggered Object (TMO) programming scheme, is also presented. The TMO based approach is promising because it provides a sound framework in which timeliness issues can be resolved in cost-effective manners.