ppxscal/embedding_network huggingface dataset:
SVG Essentials, 1 edition
Authors: J. David Eisenberg
Venue:  (2002)

:Scalable Vector Graphics -- or SVG -- is the new XML-based graphics standard from the W3C that will enable web documents to be smaller, faster, and more interactive. J. David Eisenberg's insightful book takes you through the ins and outs of SVG, beginning with basics needed to create simple line drawings and then moving through more complicated features such as filters, transformations, and integration with Java, Perl, and XSLT. Unlike bitmapped GIFs, JPEGs, or PNGs, SVG images are both resolution- and device-independent, so that they can scale up or down to fit proportionally into any size display or any Internet device -- from PDAs to large office monitors to high-resolution printers. Smaller than bitmapped files and faster to download, SVG images can be rendered with different CSS styles for each environment. They work well across a range of available bandwidths. SVG eliminates designers' constant need to update graphics by hand or use custom code to generate bitmap images. And while SVG was created with the Web in mind, the language has a variety of other uses. By focusing closely on the markup at the foundation of SVG, SVG Essentials gives you a solid base upon which to create your own custom tools. Explanations of key technical tools -- such as XML, matrix math, and scripting -- are included as appendixes, along with a reference to the SVG vocabulary. Whether you're a graphic designer in search of new tools or a programmer dealing with the complex task of creating and managing graphics, SVG Essentials provides you with the means to take advantage of SVG.
Optimal Message Logging Protocols \\ (Preliminary Version)
Authors: Lorenzo Alvisi, Keith Marzullo
Venue:  (1994)

Message logging protocols are an integral part of a technique for implementing processes that can recover from crash failures. All message logging protocols require that the state of a recovered process be consistent with the states of the other processes. This consistency requirement is usually expressed in terms of {\em orphan processes\/}, surviving processes whose states are inconsistent with the recovered state of a crashed process. Orphans are either avoided through careful logging or are eliminated through a somewhat complex recovery protocol. We give a specification of the consistency property ``no orphan processes''''. From this specification, we describe how different existing classes of message logging protocols (namely {\em optimistic}, {\em pessimistic}, and a class that we call {\em causal}) implement this property. We then propose a set of metrics to evaluate the performance of message logging protocols, and characterize the protocols that are {\em optimal} with respect to these metrics. We give several examples of optimal message logging protocols that can tolerate $f$ overlapping failures and recoveries for a parameter $f: 1 \le f \le n$, and discuss the tradeoffs that arise in the implementation of these protocols.
Design of logical topologies for wavelength-routed all-optical networks
Authors: R. Ramaswami, K. N. Sivarajan
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

This paper considers the problem of designing a logical topology over a wavelength-routed all-optical network physical topology. The physical topology consists of the nodes and fiber links in the network. On an all-optical network physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics. The set of lightpaths along with the nodes constitutes the logical topology. For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to maximize the network throughput while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology). We will see that ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays. On the other hand, in all our examples, imposing it results in a minimal reduction in throughput. While the number of wavelengths required to imbed the resulting logical topology on the physical all-optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small. We formulate the combined logical topology design and routing problem described above (ignoring the constraint on the number of available wavelengths) as a mixed integer programming problem which we then solve for a number of cases of a 6-node network. Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program. We then compare the performance of two heuristic topology design algorithms (that do take wavelength assignment constraints into account) against that of randomly generated topologies.
Testability of Generalized Multiple-Valued Reed-Muller Circuits
Authors: E. V. Dubrova, J. C. Muzio
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

The testability of generalized Reed-Muller circuits realizing m-valued functions in modulo $m$ sum-of-product form, with $m$ being a prime greater than two, is investigated. Two aspects of the problem are considered - the number of tests required for fault detection, and the generation of tests. We prove that just four tests are sufficient to detect all single stuck-at faults on internal lines in the circuit. Furthermore, this set of tests is independent of the function being realized and therefore universal. We give two alternative techniques for testing primary inputs - one by generating a test set of maximum length $2n$, where $n$ is the number of primary inputs, and the other by adding to the circuit an extra multiplication mod $m$ gate with an observable output to ensure that the four tests for internal lines also detect all single stuck-at faults on primary inputs.
Structuring Requirements Specifications through Goals Interactions
Authors: Jonathan Lee, Nien-Lin Xue, Kuo-Hsun Hsu, Yong-Yi Fangjang
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

One of the foci of the recent development in requirements engineering has been the study of conflicting requirements. However, there is no systematic way in the existing approaches to handling the interactions among requirements and their impacts on the structuring of requirement specifications. In this paper, a new approach is proposed to formulate the requirement specifications based on goals interactions (i.e., cooperative, conflicting, counterbalanced and irrelevant).
Coordination in multiagent reinforcement learning: a Bayesian approach
Authors: Georgios Chalkiadakis, Craig Boutilier
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Much emphasis in multiagent reinforcement learning (MARL) research is placed on ensuring that MARL algorithms (eventually) converge to desirable equilibria. As in standard reinforcement learning, convergence generally requires sufficient exploration of strategy space. However, exploration often comes at a price in the form of penalties or foregone opportunities. In multiagent settings, the problem is exacerbated by the need for agents to "coordinate" their policies on equilibria. We propose a Bayesian model for optimal exploration in MARL problems that allows these exploration costs to be weighed against their expected benefits using the notion of value of information. Unlike standard RL models, this model requires reasoning about how one's actions will influence the behavior of other agents. We develop tractable approximations to optimal Bayesian exploration, and report on experiments illustrating the benefits of this approach in identical interest games.
The Transition from Asynchronous to Synchronous System Operation: An Approach for Distributed Fault-Tolerant Systems
Authors: Wilfried Steiner, Michael Paulitsch
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

Immediately after power-up, synchronous distributed systems need some time until essential timing properties, which are required to operate correctly, are established. We say that synchronous systems are initially in asynchronous operation. In this paper, we present an algorithm and architectural guidelines that assure the transition from asynchronous to synchronous operation within a bounded duration even in case of failures.
Living on the Fault Line: Managing for Shareholder Value in the Age of the Internet
Authors: Geoffrey A. Moore
Venue:  (2003)

:The fault line--that dangerous, unstable seam in the economy where the Internet and other powerful innovations meet and create market-shattering tremors. Every company lives on it; no manager can control it. Everyone must learn to deal with it. Now, Geoffrey Moore, author of Crossing the Chasm and Inside the Tornado, two bestselling works that helped guide the high-tech revolution, explores the new management paradigms that will guide businesses in the twenty-first century, showing them how to survive and thrive on the fault line. In this long-awaited new book, Moore turns his attention to the most important question for businesses: How can companies that rose to prominence prior to the age of the Internet manage for shareholder value now that the Internet is upon us? The old management truths are dead. Business models that worked admirably until the last decade of the twentieth century must be replaced. The dotcoms are invading every sector of commerce, overturning established relationships, reengineering markets, attacking long-established price points, and disintermediating longstanding institutions. What should management do when it is under direct assault from companies no one ever heard of even a few years ago? In a book that will reset the management agenda in the age of the Internet, Moore shows why sensitivity to stock price is the single most important lever for managing in the future, both as a leading indicator of shifts in competitive advantage and as an employee motivator for making necessary changes in organizations heretofore impervious to change. He prescribes a new agenda for management teams that includes New strategies for achieving and sustaining competitive advantage New metrics to keep management teams on course with these strategies A specific blueprint for how the blue-chip companies can meet the challenge of the dotcoms Models of organizational change for each stage of market development The crucial role of declaring a culture inenabling swift response to global change Today practically every company, whether inside the high-tech sector or not, is living on the fault line. By synthesizing his groundbreaking earlier work on the dynamics of technology-based markets with a new focus on managing publicly held corporations for shareholder value, Geoffrey Moore provides a highly prescriptive guide for any company struggling to manage the disruptive forces of the new economy. In Crossing the Chasm and Inside the Tornado, Moore created a new language for navigating the technology adoption life cycle. In Living on the Fault Line, he once again offers a brilliant set of navigational tools to help meet today's defining management challenge-managing for shareholder value in the age of the Internet.
Optimal design of tensile fabric structures
Authors: T. Nouri-Baranger, P. Trompette
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The final design of a tensile membrane is achieved when the stress states generated by different and normalised climatic (snow, wind) loadings have been deemed as acceptable by the official control bodies. For this reason, and since in tensile structures the shape and the stress states are strongly related, the whole design may result from a repeated iterative process between the designers, i.e. the firm of architects and the research consultants. This motivates the presentation in this paper of an optimisation tool devoted to fabric structures which could be used to ease the design process in decreasing the number of back-and-forth interactions between all the different participants. First a specific and new shape form finding procedure is proposed; taking into account the usual geometrical constraints or data requirements, but also a desired biaxial (warp and weft) non uniform stress state, an optimal (optimal must be understood in the sense: nearest as possible) initial shape is found Then the climatic loads are applied and the current loaded positions calculated. A Sensitive analysis of these equilibrium positions depending on different parameters such as the positions of the anchorage points and cable tensions, allows one to modify with efficiency the shape and/or the stress state in order to better satisfy the requirements. This optimisation loop is included in a larger one that takes into account possible modifications of the cutting patterns, which is an other way of optimising the stress states. The efficiency of this procedure is demonstrated on an actual example.
Behavior-based Language Generation for Believable Agents
Authors: A. B Loyall, Joseph Bates
Venue:  (1995)

We are studying how to create believable agents that perform actions and use natural language in interactive, animated, real-time worlds. We have extended Hap, our behavior-based architecture for believable non-linguistic agents, to better support natural language text generation. These extensions allow us to tightly integrate generation with other aspects of the agent, including action, perception, inference and emotion. We describe our approach, and show how it leads to agents with properties we believe important for believability, such as: using language and action together to accomplish communication goals; using perception to help make linguistic choices; varying generated text according to emotional state; and issuing the text in real-time with pauses, restarts and other breakdowns visible. Besides being useful in constructing believable agents, we feel these extensions may interest researchers seeking to generate language in other action architectures.
Memory Organization for Improved Data Cache Performance in Embedded Processors
Authors: Preeti Ranjan Panda, Nikil D. Dutt, Alexandru Nicolau
Venue: Proceedings of the 9th international symposium on System synthesis (1996)

Code generation for embedded processors creates opportunities for several performance optimizations not applicable for traditional compilers. We present techniques for improving data cache performance by organizing variables declared in embedded code into memory, using specific parameters of the data cache. Our approach clusters variables to minimize compulsory cache misses, and solves the memory assignment problem to minimize conflict cache misses. Our experiments demonstrate significant improvement in data cache performance (average 46\% in hit ratios) by the application of our memory organization technique using code kernels from DSP and other domains on the LSI Logic CW4001 embedded processor.
Physical Time-Series Prediction Using Second-Order Pipelined Recurrent Neural Network
Authors: Abir Hussain
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper presents a novel type of higher-order pipelined recurrent neural networks called the second-order pipelined recurrent neural network. The aim of the network is to improve the performance of the pipelined recurrent neural network by accommodating second order terms in the inputs. The network is tested for the prediction of non-linear and non-stationary signals. Two physical time-series, which are the mean value of the AE index and the sunspot signals are used in the simulation. The simulation results showed an average improvement in the signal to noise ratio of 6.09 dB when compared to the pipelined recurrent neural networks.
ARQuake: An Outdoor/Indoor Augmented Reality First Person Application
Authors: Bruce Thomas, Ben Close, John Donoghue, John Squires, Phillip de Bondi, Michael Morris, Wayne Piekarski
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

This paper presents an outdoor/indoor augmented reality first person application ARQuake we have developed. ARQuake is an extension of the desktop game Quake, and as such, we are investigating how to convert a desktop first person application into an outdoor/indoor mobile augmented reality application. We present architecture for a low cost, moderately accurate six degrees of freedom tracking system based on GPS, digital compass, and fiducial vision-based tracking. Usability issues such as monster selection, color, and input devices are discussed. A second application for AR architectural design visualization is presented.
Scheduling of conditional branches using SSA form for superscalar/VLIW processors
Authors: Seong-Uk Choi, Sung-Soon Park, Myong-Soon Park
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

Global scheduling and optimization techniques are proposed to get more enough speedup for superscalar and VLIW (Very Long Instruction Word) processors. When we consider global scheduling and optimization, one of the most important issue is how to schedule conditional branches. Control dependences are caused by conditional branches and limit the scope of scheduling. Most of previous scheduling schemes are based on speculative or predicated execution techniques to overcome conditional branches. However, speculative execution requires computation for code motion and insertion of compensation code to preserve semantics. The complexity of scheduler is largely due to computation for code motion. In addition, performance is dependent on branch outcomes. Predicated execution makes it possible to schedule more simpler. But the difficulties in the design of the instruction set are a serious problem. This paper proposes scheduling method using SSA form. The scheduling algorithm can be more simpler by utilizing /spl phi/-functions aggressively because computations for code motion are not required. We don't need complex hardware support. Our scheme also makes the performance independent on the result of branch outcomes.
High Speed 15 ns 4 Mbits SRAM for Space Application
Authors: Bernard Coloma, Patrick Delaunay, Olivier Husson
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

A high speed 15 ns 4 Mbits asynchronous SRAM, 500 µA stand-by current, 300 Krads total dose tolerant, has been developed for space applications, using a hardened 0.25 micron 4 layers metal full CMOS process. A hierarchical organisation per IO bits has been used to achieve high speed as well as low dynamic consumption, also suited for simple SEU (single event upset) induced error corrections, allowing mitigation with classical EDAC corrector. The product operates within 3 to 3.6V, and ambient temperature from -55 to +125°C. A high density die size of 68,3 mm 2 allows the use of a specific 36-pins dual in line flat pack package with a 500 mils width, making this product very competitive against SEU hardened chips. Sucessful silicon results are presented as well as radiation tests up to 300 Krads.
Real Time Distributed Control Systems Using RTAI
Authors: Lorenzo Dozio, Paolo Mantegazza
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

The paper outlines the design and implementation of the Real Time Application Interface (RTA ) for Linux, as used for high performance local/distributed control systems implemented on low cost off the shelf general purpose computers. Its native lean real time middleware layer is described along with its use in an advanced tool to easily manage and monitor complex networked control systems.
A Field-Programmable Digital Filter Chip Using Multiple-Valued Current-Mode Logic
Authors: Katsuhiko Degawa, Takafumi Aoki, Tatsuo Higuchi
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper presents a Field-Programmable DigitalFilter (FPDF) IC that employs carry-propagation-freeredundant arithmetic algorithms for faster computationand multiple-valued current-mode circuit technologyfor high-density low-power implementation.Theprototype FPDF fabrication with 0.6µm CMOS technologydemonstrates that the chip area and power consumptioncan be reduced to 41% and 74%, respectively,compared with the standard binary logic implementation.
Concealment of Lost Speech Packets Using Adaptive Packetization
Authors: Henning Sanneck
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Long-term correlation within a speech signal is usually exploited to achieve higher compression ratios (e.g. RPE-LTP coders). In this paper we aim to use the long-term correlation to influence the packetization interval of a voice stream at the sender before sending it over a lossy packet-switched network. If a packet is lost, the receiver can conceal the loss of information by using adjacent signal segments of which (due to the pre-processing/packetization at the sender) a certain similarity to the lost segment can be assumed. Subjective test results show that the "Adaptive Packetization / Concealment" scheme (AP/C) can alleviate significantly the impact of isolated packet losses to speech quality.
A Software Architecture Approach for Designing CASE Systems
Authors: Mauro Pezze, Sergio Silva
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

This paper presents a software architecture approach that supports facilities for customizing the set of functionalities offered by CASE systems, without affecting the complexity of the system. The proposed software architecture approach supports on-line composition of elementary and composite functionalities to implement new complex functionalities required for specific applications. The proposal pushes the interesting results obtained by other research groups beyond the goals reached so far by allowing new functionalities to be defined run-time, without recompiling the system, but relying on dynamic linking mechanisms. The proposal is illustrated with a case-study, successfully used in some industrial pilot projects.
Several classes of (2m - 1,w,2 optical orthogonal codes
Authors: Cunsheng Ding, Chaoping Xing
Venue: Discrete Applied Mathematics (2003)

Optical orthogonal codes have applications in optical code-division multiple access communication systems and other wide band code-division multiple environments. They can also be used to construct protocol sequences for multiuser collision channel without feedback, and constant weight codes for error detection and correction. In this paper, we construct four classes of (2m - 1,w,2) cyclotomic optical orthogonal codes, where w ∈ {5,9} or w ≥ 11 is any prime having primitive root 2, and therefore the corresponding classes of binary constant-weight cyclic codes.