ppxscal/embedding_network huggingface dataset:
Asynchronous Circuits: An Increasingly Practical Design Solution
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

While ultra-deep-submicron design presents increasingly difficult challenges for standard synchronous design practices, recent research in asynchronous design techniques is making asynchronous circuits an increasingly practical alternative. These challenges include the increasing pressure for low-power, the growing challenge of predicting increasing impact of wire load and delay, and the performance penalty associated with supporting communication between different clock domains. This paper reviews the different solutions to these problems that the spectrum of existing asynchronous design techniques support. It focuses on techniques for fine-grain two-dimensional pipelining that yield ultra-high-speed at nominal power supplies and very low-energy at reduced power supplies.
Parallel Computing Aided Design of Earthing Systems for Electrical Substations in Non-Homogeneous Soil Models
Authors: J. Gómez-Calviño, I. Colominas, F. Navarrina, M. Casteleiro, J. M. Cela
Venue: Proceedings of the 2000 International Workshop on Parallel Processing (2000)

An accurate design of grounding systems is essential to assure the safety of the persons, to protect the equipment and to avoid interruptions in the power supply. In order to attain these targets, the equivalent electrical resistance of the system and the potential distribution on the earth surface in fault conditions are necessary to compute. In this paper, it is presented a numerical approach for grounding analysis embedded in stratified soils and its implementation in a high-performance parallel computer. The feasibility of this system is shown with its application to the analysis of a real grounding system in a layered soil.
Building Predictive Models on Complex Symbolic Sequences with a Second-Order Recurrent BCM Network with Lateral Inhibition
Authors: Peter Tino, Michal Stancík, Lubica Benu"ková
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

Activation patterns across recurrent units in recurrent neural net works (RNNs) can be thought of as spatial codes of the history of inputs seen so far. When trained on symbolic sequences to perform the next-symbol prediction, RNNs tend to organize their state space so that ¿close¿ recurrent activation vectors correspond to histories of symbols yielding similar next-symbol distributions [1]. This leads to simple finite-context predictive models built on top of recurrent activations by grouping close activation patterns via a vector quantization. In this paper, we investigate an unsupervised alternative to the state space organization. In particular, we use a recurrent version of the Bienenstock, Cooper and Munro (BCM) network with lateral inhibition [2] to map histories of symbols into activations of the recurrent layer. Recurrent BCM networks perform a kind of time-conditional projection pursuit. We compare the finite-context models built on top of BCM recurrent activations with those constructed on top of RNN recurrent activation vectors. As a test bed, we use two complex symbolic sequences with rather deep memory structures. Surprisingly, the BCM-based model has a comparable or better performance than its RNN-based counterpart. This can be explained by the familiar information-latching problem in recurrent net works when longer time spans are to be latched [3, 4].
Characterization of Deadlocks in Irregular Networks
Authors: Sugath Warnakulasuriya, Timothy Mark Pinkston
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

This paper characterizes how various network parameters influence message blocking and deadlocks in irregular networks. Information on blocking behavior is provided that is useful in making design trade-offs between restricting routing freedom and allowing the possibility for deadlocks to form in irregular networks. This work also identifies ways in which a network's susceptibility to deadlock can be reduced and provides guidelines for designing irregular networks which maximize routing flexibility and resource utilization. Finally, a new empirical evaluation methodology for classifying irregular topologies and relating network behavior to various classes of network topologies is introduced.
Reliability Assessment of Framework-Based Distributed Embedded Software Systems
Authors: Farokh B. Bastani, Sung Kim, I-Ling Yen, Ing-Ray Chen
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Distributed embedded software systems, such as sensornetworks and command and control systems, are complexsystems with stringent performance, reliability, security,and safety constraints. These are also long-lived systemsthat must be continually upgraded and evolved to incorporate enhanced functionality. One approach for achievinghigh quality and evolvability for these systems is to organizethem in the form of application-oriented frameworks thatallow the system to be composed from orthogonal aspectsthat can be independently developed, evolved, and certified.In this paper, we define a general framework that allows a distributed embedded system to have relatively independent aspects, including \plug-and-play" capability. Wepresent conditions under which the reliability of the system can be inferred from the reliability of the individualaspects. The approach is illustrated for a framework-baseddistributed sensor network.
Autonomous Agent Technology
Authors: Stefan Covaci
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

The first question addressed in the paper is Why and how agent technology supports the design and implementation of Autonomous Decentralised Systems?. Subsequently, based on the main characteristics of the intelligent and mobile agents we assess the specific support agent technology collectively can offer. Finally a glimpse into the future of this technology is given. A critical evaluation of the agent technology vs. the traditional distributed object technology and RPC is undertaken throughout the paper in order to foresee possible introduction and evolution scenarios. The paper merely focuses on the aspects relevant to the providers of infoware technology, frameworks and products.
Virtual path bandwidth allocation in multi-user networks
Authors: A. A. Lazar, A. Orda, D. E. Pendarakis
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

Considers a multi-user network that is shared by noncooperative users. Each user sets up virtual paths that optimize its own, selfish, performance measure. This measure accounts for both the guaranteed call level quality of service, as well as for the cost incurred for reserving the resource. The interaction between the user strategies is formalized as a game. The authors show that this game has a unique Nash equilibrium, and that it possesses a certain fairness property. They investigate the dynamics of this game, and prove convergence to the Nash equilibrium of both a Gauss-Seidel scheme and a Jacobi scheme. They extend their study to various general network topologies.
Ontology mediation in heterogeneous venue services
Authors: Juan Jim Tan, Stefan Poslad, Leonid Titkov
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Dynamic service synthesis is one of the key aims of the EU Agentcities project [1]. This seeks to generate new services through reusing and combining existing services. Agent-based services are commonly represented and accessed using specific ontologies and they are advertised using terms from these same ontologies. Some event-based services such as a wedding or concert, seeks to organise the event across multiple venues, it forms a horizontal layer that cuts across multiple vertical service instances such as hotel, cinema and restaurant. Hence some services naturally require the use of multiple ontologies. This paper focuses on analysing and specifying a support for ontology mediation for composing heterogeneous venue-based services. The term ontology mediation refers to the co-ordinated matching of generalised ontology name-values across multiple ontology instances. In this version of the service, the core interoperability between services is addressed by applying ontology mediation techniques where relationships, semantics and mappings of arbitrary venue ontology definitions are mediated. Consequently, the implementation demonstrates the use of dynamic creation of proxy venue agents, and this supports interoperability for venue finder agents to query, book, negotiate, and aggregate services both locally and in open service domains.
How To Do Everything With Macromedia Flash MX
Authors: Bonnie Blake
Venue:  (2002)

:Animate,and activate! Draw energy and attention to your Web site by incorporating all manner of motion,animation,sound,active text,rollovers,and more. This resource offers a wealth of knowledge to help get you going.
Multi-Valued Logic Pass Gate Network Using Neuron-MOS Transistors
Authors: Jing Shen, Motoi Inaba, Koichi Tanno, Okihiko Ishizuka
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A multi-valued logic (MVL) pass gate is an important element to configure multi-valued logic networks. Different from binary pass gates, multiple logical levels are required to be discriminated in MVL pass gates. In this paper, according to the feature of the threshold operation of a neuron. MOS transistor (vMOS), two types of MVL pass gates using vMOS are presented. One type, a CMOS MVL pass gate with vMOS down literal circuit, is composed of a CMOS pass gate and a vMOS threshold gate (v MOS down. literal circuit (DLC)). The threshold gate realizes the discrimination between different MVL signals. Another type, a vMOS hybrid pass gate, consists of a vMOS transistor, a MOS transistor and a binary inverter. The vMOS transistor is used as a pass transistor, and the vMOS pass gate directly implements the threshold discrimination. The latter is more compact than the former. The number of transistors and the layout area of the MVL network can be reduced by using vMOS hybrid pass gates, while the bias setting is easier by using CMOS MVL pass gates. The common advantages of the proposed pass gates are low fabrication cost and possibility to build reconfigurable networks.
Building quantum wires: the long and the short of it
Authors: Mark Oskin, Frederic T. Chong, Isaac L. Chuang, John Kubiatowicz
Venue: ACM SIGARCH Computer Architecture News (2003)

As quantum computing moves closer to reality the need for basic architectural studies becomes more pressing. Quantum wires, which transport quantum data, will be a fundamental component in all anticipated silicon quantum architectures. In this paper, we introduce a quantum wire architecture based upon quantum teleportation. We compare this teleportation channel with the traditional approach to transporting quantum data, which we refer to as the swapping channel. We characterize the latency and bandwidth of these two alternatives in a device-independent way and describe how the advanced architecture of the teleportation channel overcomes a basic limit to the maximum communication distance of the swapping channel. In addition, we discover a fundamental tension between the scale of quantum effects and the scale of the classical logic needed to control them. This "pitch-matching" problem imposes constraints on minimum wire lengths and wire intersections, which in turn imply a sparsely connected architecture of coarse-grained quantum computational elements. This is in direct contrast to the "sea of gates" architectures presently assumed by most quantum computing studies.
Stylized Highlights for Cartoon Rendering and Animation
Authors: Ken-ichi Anjyo, Katsuaki Hiramitsu
Venue: IEEE Computer Graphics and Applications (2003)

A novel highlight shader depicts cartoon-style highlights for 3D objects in cel animation. In general, highlighting in cel animation is used semantically, rather than photorealistically, by employing simple primitives-such as white stripes on a window or crescent figures on an alloy wheel. It's difficult and tedious work, however, to get such a stylized highlight animation for 3D models when using conventional cartoon-shading algorithms.This article presents an approach that generalizes the concept of a highlight for 3D objects in cel animation. This is achieved by introducing a new class of vector field-called a highlight vector field-on a surface to be depicted. A generalized highlight area on the surface is then defined through the highlight vector field. Thus, this highlight shader enables cartoon-style highlighting through simple operations defined for the highlight vector field. These operations actually correspond to the direct manipulations on the highlight area defined by the vector field, these include local affine transform and simple deformation of the highlight.
Recursive Evaluation of the Generalized Reed-Muller Coefficients
Authors: Gi Soo Na, Sang Wan Kim, Jai Sock choi, Heung Soo Kim
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

In this paper, we propose the computationmethod of GRM(Generalized Reed - Muller)coefficients over GF(2) using triangle cell recursively.GRM expansions of each polarity contain differentnumbers of product terms. Hence, the minimum formmay be selected from them. Many authors havepresented various algorithms of calculating thecoefficients of GRM expansions under mixedpolarities. The method proposed by W. Besslichrequires 2n-1 \times (2n-1) modulo - sums(i.e. Ex-OR)[1], but the method proposed in this paperrequires only 2\times(the number of modulo-sums forn-1 variable) + 3n-1 ones. From this proposedmethod we can get easily GRM coefficients.
Probabilistic Broadcast
Authors: Mark Hayden, Kenneth Birman
Venue:  (1996)

We present a class of scalable and probabilisticly reliable communication protocols. The protocols are based on a probabilistic system model and thus their properties tend to be probabilistic in nature. The protocols are scalable in two senses. First, the message costs and latencies of the protocols grow slowly with the system size. Second, the reliability of the protocols, expressed in terms of the probability of a failed run of a protocol, approaches 0 exponentially fast as the number of processes is increased. This scalable reliability is achieved through a form of gossip protocol which is strongly self-stabilizing in a sense similar, although not identical to, the notion of self stabilizing systems proposed by Dijkstra.
The Duke Internet Programming Contest
Authors: Owen Astrachan, Vivek Khera, David Kotz
Venue:  (1990)

On the evening of October 23, 1990, electronic mail messages started to pour into the computers at the Duke University Computer Science Department. Teams of programmers from all over the world were registering to compete in the first global (as far as the authors are aware) programming contest to be held on the Internet. During the three-hour competition, modeled after the annual ACM scholastic programming contest, 60 teams from 37 institutions in 5 countries attempted to solve a set of six programming problems using C or Pascal. Their solutions were sent by electronic mail to Duke, where their programs were judged and the results returned by electronic mail. At the conclusion of the contest, 330 program submissions had been judged and 65 clarification requests were answered.
Secure Program Partitioning
Authors: Steve Zdancewic, Lantian Zheng, Nathaniel Nystrom, Andrew Myers
Venue:  (2001)

This paper presents secure program partitioning, a language-based technique for protecting confidential data during computation in distributed systems containing mutually untrusted hosts. Confidentiality and integrity policies can be expressed by annotating programs with security types that constrain information flow; these programs can then be partitioned automatically to run securely on heterogeneously trusted hosts. The resulting communicating subprograms collectively implement the original program, yet the system as a whole satisfies the security requirements of participating principals without requiring a universally trusted host machine. The experience in applying this methodology and the performance of the resulting distributed code suggest that this is a promising way to obtain secure distributed computation. This Technical Report is an expanded version of the published paper ``Untrusted Hosts and Confidentiality: Secure Program Partitioning.'''' The main difference between the two is Appendix A, which contains a correctness proof for the control-transfer protocols described in Section 5.
Short universal generators via generalized ratio-of-uniforms method
Authors: Josef Leydold
Venue: Mathematics of Computation (2003)

We use inequalities to design short universal algorithms that can be used to generate random variates from large classes of univariate continuous or discrete distributions (including all log-concave distributions). The expected time is uniformly bounded over all these distributions for a particular generator. The algorithms can be implemented in a few lines of high level language code.
Fault-Tolerant Wormhole Routing in 2D Meshes
Authors: J. Zhou, F. Lau
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

A deterministic fault-tolerant wormhole routing algorithm is presented for mesh networks in this paper. The proposed algorithm can tolerate convex fault-connected regions with only three virtual channels per physical channel, and overlapping of processors along the boundaries of different fault regions is allowed. The proposed algorithm, which routes the messages by XY routing algorithm in the fault-free regions, is deadlock-and livelock-flee.
Multiplexing spacer outputs on cell emissions
Authors: G. Mercankosk, T. Moors, A. Cantoni
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

In ATM networks, one effective way to provide service guarantees is to shape individual traffic streams at various points in the network. In the paper, the authors present a method for multiplexing a large number of single-stream spacer outputs on cell emissions rather than on cell arrivals. The method not only approximates first come first served (FCFS) multiplexing of such outputs but also better suits bursty arrivals. A number of performance related issues of the proposed method are identified and examined.
ASP.NET in a Nutshell, 2 edition
Authors: G. Andrew Duthie, Matthew MacDonald
Venue:  (2003)

:Here, a concise, one-volume reference is all you need to have at your fingertips to make effective use of ASP.NET. ASP.NET is the successor to Active Server Pages and is the next generation technology for building dynamic web applications and web services for the .NET platform. With its documentation of the web-related classes in the .NET Framework Class Library, ASP.NET in a Nutshell is the definitive reference guide for developers of both applications and web services.
A Commercial Virtual Reality System Based on Parallel and Distributed Approach
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

Virtual Reality (VR) is an exciting yet challenging area. Especially in commercial VR system, one of main challenges is how to maintain relatively constant performance under vairous loading and at low-cost. This paper present a parallel and distributed solution to the problem under the background of a commercial entertainment VR system. In the paper, the architecture of the system is introduced. the strategies of distribution and the mechanism of the parallel processing are discussed.
Statistical Properties of Contact Maps
Authors: Vendruscolo Michele, Subramanian Balakrishna, Kanter Ido, Domany Eytan, Lebowitz Joel
Venue:  (1999)

A contact map is a simple representation of the structure of proteins and other chain-like macromolecules. This representation is quite amenable to numerical studies of folding. We show that the number of contact maps corresponding to the possible configurations of a polypeptide chain of $N$ amino acids, represented by $(N-1)$-step self avoiding walks on a lattice, grows exponentially with $N$ for all dimensions $D < 1$. We carry out exact enumerations in $D=2$ on the square and triangular lattices for walks of up to 20 steps and investigate various statistical properties of contact maps corresponding to such walks.. We also study the exact statistics of contact maps generated by walks on a ladder.
Greedy Dynamic Hot-Potato Routing on Arrays
Authors: I. Caragiannis, C. Kaklamanis, I. Vergados
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

In this paper we consider the problem of routing packets in two-dimensional torus-connected processor arrays. Motivated by recent theoretical work on dynamic routing, we address the dynamic case where packets are continuously injected into the network. We describe three greedy hot-potato routing algorithms and present simulation experiments on tori of several sizes using four well-known greedy (also known as work-conserving) protocols (namely FIFO, LIFO, FTG, and NTG) for the implementation of injection buffers. Our results demonstrate that there exists a greedy hot-potato routing algorithm that is stable for all greedy injection queueing protocols for injection rates very close to 100% of the network capacity. Furthermore, according to the algorithms we studied, we can claim that the one-pass property is not appropriate for the dynamic case, since the system cannot achieve stability at high injectionrates.
Task Assignment in a Distributed System: Improving Performance by Unbalancing Load
Authors: Mark Crovella, Mor Harchol-Balter, Cristina Murta
Venue:  (1997)

Abstract We consider the problem of task assignment in a distributed system (such as a distributed Web server) in which task sizes are drawn from a heavy-tailed distribution. Many task assignment algorithms are based on the heuristic that balancing the load at the server hosts will result in optimal performance. We show this conventional wisdom is less true when the task size distribution is heavy-tailed (as is the case for Web file sizes). We introduce a new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V). SITA-V purposely operates the server hosts at different loads, and directs smaller tasks to the lighter-loaded hosts. The result is that SITA-V provably decreases the mean task slowdown by significant factors (up to 1000 or more) where the more heavy-tailed the workload, the greater the improvement factor. We evaluate the tradeoff between improvement in slowdown and increase in waiting time in a system using SITA-V, and show conditions under which SITA-V represents a particularly appealing policy. We conclude with a discussion of the use of SITA-V in a distributed Web server, and show that it is attractive because it has a simple implementation which requires no communication from the server hosts back to the task router.