ppxscal/embedding_network huggingface dataset:
The Next Generation Internet: Unsafe at Any Speed?
Authors: Kenneth P. Birman
Venue:  (1999)

Will the Next Generation Internet provide an appropriate infrastructure for critical applications, such as are emerging in such settings as health care, electric power grid control, air traffic control, banking, and military command and control? This paper suggests that current trends are unlikely to yield the required platform. Drawing lessons from successful critical networking projects of the past, we propose an alternative based on Virtual Overlay Networks (VONs). Support for VONs would not require radical departure from existing router capabilities, because a limited mechanism of the type we propose is already available. Given a simple Overlay Network (ON) capability, we show that tools for building more sophisticated VONs are already widely available.
Solving Time-Dependent Planning Problems
Authors: Mark Boddy, Thomas Dean
Venue:  (1989)

We are interested in constructing solutions to time-dependent planning problems: problems in which time spent planning affects the utility of the system''s performance. In a previous paper, we define a fraomework for constructing solutions to time-dependent planning problems called expectation-driven iterative refinement. In this paper, we analyze and solve a moderately complex time-dependent planning problem involving path planning for a mobile robot, as a way of exploring a methodology for applying expectation-driven iterative refinement.
Low voltage and low power: how low can you go?
Authors: G. Yee, C. Sechen
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

Power management is an important design issue. For mobile electronics, the motivation is to extend battery life. For desktop systems, the design goal is to reduce audible noise from cooling fans which are a cause of annoyance, and to reduce the heat release in closed environments. For large systems, the motivation is to hold the packaging cost down. In communication applications, the limit on RF power is decided by factors such as distance from transmitter/receiver, geographic location etc. In digital electronics, the governing factors behind power dissipation can be summarized by three aspects of VLSI design: power supply voltage, switching activity and capacitances. Reducing any of these factors can reduce the power requirement. This paper discusses the problems in managing these factors and offers effective ways of dealing with it.
Critical Bandwidth Allocation Techniques for Stored Video Delivery Across Best-Effort Networks
Authors: Wu-chi Feng, Ming Liu
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

In this paper, we propose two new techniques for the delivery of compressed prerecorded video streams across best-effort networks like the Internet. Current approaches for the delivery of stored video across best-effort networks typically alter the quality of the video frames, the frame rate delivered to the user, or a combination of both. By using network feedback, these algorithms continually adjust the video quality to fit within the available network resources.These approaches, however, do not take advantage of the a priori information available from stored video streams, namely the frame sizes that the movie consists of. We will show how monitoring the a priori information and actively monitoring a client-side buffer can help smooth the video frame rate delivered to the user, providing a more consistent quality of video.
Runtime Performance Analysis of the M-to-N Scheduling Model
Authors: Bryan M. Cantrill
Venue:  (1996)

The popular M-to-N thread scheduling model multiplexes many user-level threads on top of fewer kernel-level threads. While this model is designed to be scalable and efficient without excessive resource consumption, we isolate several elementary examples under which the M-to-N model exhibits highly nonintuitive performance. We use a runtime performance monitor for multithreaded programs which we have developed, ThreadMon, to explain the causes of the unexpected results. We conclude that the complexity and nondeterminism exported to the programmer make performance tuning to the intricate M-to-N model extremely difficult. Moreover, we show that the insulation of user-level scheduling from kernel-level scheduling can have undesirable side-effects.
Parallel Algorithms for Chordal Graphs
Authors: Philip Klein
Venue:  (1991)

This paper is a version of a chapter to be included in {\em The Synthesis of Parallel Algorithms}, edited by John H. Reif. We describe algorithms, both sequential and parallel, for {\em chordal graphs}, a class of graphs including {\em interval graphs}. We start by defining the notions of an interval graph, a chordal graph, a perfect elimination ordering, and an elimination tree. We illustrate these notions by showing how the elimination ordering can be used to solve optimization problems sequentially on chordal graphs. Then we show how the sequential solutions may be efficiently carried out in parallel. The sequential algorithms are due to Gavril. The parallel algorithms are due to Naor, Naor, and Sch\"affer, and to Klein. The key to these efficient sequential and parallel solutions is finding a perfect elimination ordering. In the latter part of this chapter, we define a framework for finding an elimination ordering by successive refinement. Working within this framework, we explain the sequential algorithm due to Rose, Tarjan, and Lueker. Then we describe the parallel algorithm due to Klein.
Constitutive and Centrifuge Modelling Two Extremes
Authors: Bhawani Singh, R. K. Goel
Venue:  (2003)

:Software for Engineering Control of Landslide and Tunnelling Hazards serves both the international academic and professional civil and mining engineering communities, and is also an excellent tool for those working and studying in the field of engineering geology.
The Mathematics of Shape-Geometry Approach To The Analysis Of Curve Profile
Authors: Farzad Khosrowshahi
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

It has been previously shown that the visual approach to the analysis of the behaviour of growth patterns can provide a viable solution to the understanding of the physical behaviour of the subject matter.Also, it has been demonstrated that the shape of the profile can be defined in terms of a number of characteristics some of which are general for all profiles and others are specific to individual circumstances. These characteristics, referred to as shape-parameters, are used for the analysis of the profile. Also, they are used for construction of the profile that the phenomenon is likely to assume.The method was validated by applying it to construction project expenditure pattern forecasting and further validation was undertaken by the use of statistical technique, namely, Principal Component Analysis.In this paper, the mathematics of the model is represented, whereby, for a given set of shape-parameters, the precise profile is mathematically generated. Due to its complex nature, the problem is decomposed into separate modules each satisfying a number of requirements. The modules operate independently but when combined, the overall boundary requirements are also satisfied.
Analysis of Some Matrix Problems Using the CS Decomposition
Authors: Charles Van Loan
Venue:  (1984)

The gist of the CS decomposition is that the blocks of a partitioned orthogonal matrix have related singular value decompositions. In this paper we develop a perturbation theory for the CS decomposition and use it to analyze (a) the total least squares problem, (b) the Golub-Klema-Stewart subset selection algorithm, (c) the algebraic Riccati equation, and (d) the generalized singular value decomposition.
Low-Energy Asynchronous Memory Design
Authors: Jose A. Tierno, Alain J. Martin
Venue:  (1994)

We introduce the concept of energy per operation as a measure of performance of an asynchronous circuit. We show how to model energy consumption based on the high-level language specification. This model is independent of voltage and timing considerations. We apply this model to memory design. We show first how to dimension a memory array, and how to break up this memory array into smaller arrays to minimize the energy per access. We then show how to use cache memory and pre-fetch mechanisms to further reduce energy per access.
Microsoft Office Excel 2003 Inside Out
Authors: Mark Dodge
Venue:  (2003)

Take your Microsoft Excel experience to the next level! This supremely organized reference packs hundreds of timesaving solutions, troubleshooting tips, and handy workarounds for Excel 2003 in concise, fast-answer format.
Systematic Derivation of Incremental Programs
Authors: Yanhong A. Liu, Tim Teitelbaum
Venue:  (1994)

A systematic approach is given for deriving incremental programs from non-incremental programs written in a standard functional programming language. We exploit a number of program analysis and transformation techniques and domain-specific knowledge, centered around effective utilization of caching, in order to provide a degree of incrementality not otherwise achievable by a generic incremental evaluator.
Design and Implementation of Error Detection and Correction Circuitry for Multilevel Memory Protection
Authors: Boris Polianskikh, Zeljko Zilic
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

Traditional memories use only two levels per cell (0/1), which limitstheir storage capacity to 1 bit per cell. By doubling the cell capacity,we increase density of the memory, at the expense of its reliability.There are several types of memories that employ multilevel techniques.The subject of this paper is the design of Multi-Level Dynamic RandomAccess Memory (MLDRAM). The problem of their reliability is investigatedand a practical solution is proposed. The solution is based on theorganization of the Error Correcting Code (ECC), that is tuned to MLDRAMimplementation. Conventional memories employ Single-Error-Correcting andDouble-Error-Detecting (SEC-DED) ECC. While such codes have beenconsidered for MLDRAM, their use is inefficient, due to likelydouble-bit errors in a single cell. For this reason we propose inducedECC architecture that uses ECC in such a way that no common errorcorrupts two bits. Induced ECC allows significant increase inreliability of the MLDRAM, by improved check bit generation circuitrythat allows to use less space for parity bit generation circuitry. Thesuggested approach is able to correct a two bit error intwo-bits-per-cell MLDRAM which the basic ECC can not correct. Proposedsolutions make MLDRAM more tolerant to any kind of faults andconsequently more practical for mass production.
The Effects of Communication Media on Group Performance in Requirements Engineering
Authors: Daniela E. Herlea Damian, Armin Eberlein, Mildred L. G. Shaw, Brian R. Gaines
Venue: Proceedings of the 4th International Conference on Requirements Engineering (ICRE'00) (2000)

Delivering systems that meet all stakeholders' needs is easier said than done in a software development world in which resource constraints are everyday realities. In particular, the negotiation between different stakeholders and the reconciliation of their conflicting viewpoints has been recognized as major problems in requirements engineering. This is even more challenging as organizations become more global, and requirements often come from distributed groups. Although the use of multimedia meeting systems is becoming a reality in distributed software development, our knowledge of how such systems affect group performance and their role in facilitating social processes in requirements engineering is limited.This paper reports on a study that compared the performance of groups in face-to-face and distributed requirements negotiation meetings, paying special consideration to the socio-psychological aspects of group interaction in both communication media.
The Scheduling Problem in Learning From Hints
Authors: Zehra Cataltepe
Venue:  (1994)

Any information about the function to be learned is called a hint. Learning from hints is a generalization of learning from examples. In this paradigm, hints are expressed by their examples and then taught to a learning-from-examples system. In general, using other hints in addition to the examples of the function, improves the generalization performance. The scheduling problem in learning from hints is deciding which hint to teach at which time during training. Over- or under- emphasizing a hint may render it useless, making scheduling very important. Fixed and adaptive schedules are two types of schedules that are discussed. Adaptive minimization is a general adaptive schedule that uses an estimate of generalization error in terms of errors on hints. When such an estimate is available, it can also be optimized by means of directly descending on it. An estimate may be used to decide on when to stop training, too. A method to find an estimate incorporating the errors on invariance hints, and simulation results on this estimate, are presented. Two computer programs that provide a learning- from- hints environment and improvements on them are discussed.
Causality-Preserving Timestamps in Distributed Programs
Authors: Adam Beguelin, Erik Seligman
Venue:  (1993)

A tachyon is an improperly ordered event in a distributed program. Tachyons are most often manifested as messages which are received before they are sent, violating the principle of causality. Although tachyons are not possible in "real life", they may appear to occur in distributed parallel program traces due to coarse clock granularity or poor clock synchronization. In this paper, we establish that tachyons do in fact occur commonly in distributed programs on our Ethernet at Carnegie Mellon University, and we discuss some ways of eliminating them from program traces while preserving at least some knowledge of the length of time intervals in our programs. Our methods are based on Lamport-style clock corrections; when a process receives a message stamped with a later sending time, it sets its own clock ahead to a time at least as great as the sending timestamp. We have implemented this both in real time and in a more comprehensive post-processor for Xab.
Asymptotics of the total chromatic number for multigraphs
Authors: P. M Kayll
Venue:  (1997)

or loopless multigraphs, the total chromatic number is asymptotically its fractional counterpart as the latter invariant increases without bound. This extends DIMACS Technical Report 96-20, where the same assertion, restricted to simple graphs, was proved. The proof for multigraphs --- presented in this note --- is based on a recent theorem, due to Kahn, establishing the analogous asymptotic behaviour of the list-chromatic index. FOOTNOTE This note is a companion article to DIMACS Technical Report 96-20.
Techniques for Probabilistic Analysis and Randomness-Efficient Computation
Venue:  (1993)

Randomness is well-recognized as an important computational resource in theoretical computer science. Not only are there classical problems for which the only known ``efficient'''' solutions are randomized, but there are problems for which randomness can be used to circumvent deterministic lower bounds. However, standard tools available for probabilistic analysis such as the Chernoff-Hoeffding bounds are not sufficiently powerful in all situations; second, since there are no known ``true'''' sources of randomness, there is a need to develop general techniques for reducing/removing randomness from randomized algorithms. This thesis addresses these two issues. Certain types of scheduling and resource allocation problems in a distributed setting can be modeled as edge coloring problems. In Chapter 2, we present a fast and simple randomized algorithm for edge coloring a graph, in the synchronous distributed point-to-point model of computation. Our algorithm computes an edge-coloring of a graph $G$ with $n$ nodes and maximum degree $\Delta$ with at most $(1.6 + \epsilon) \Delta + O(\log^{2+\delta} n)$ colors with high probability, for any fixed $\epsilon, \delta, < 0$. To analyze our algorithm, we introduce techniques for proving upper bounds on the tails of random variables, extending the Chernoff-Hoeffding (CH) bounds to some types of dependent random variables. This is joint work with A. Panconesi [91]. In Chapter 3, we show that the CH bounds for the tails of the sums of bounded and independent random variables $X_{1}, \ldots, X_{n}$ require only limited independence among the $X_{i}$s. We show that if $X_{1}, \ldots, X_{n}$ lie in [0,1] and are $k$-wise independent, then $Pr(X \geq E[\sum_{i}X_{i}](1 + \delta))$ can be upper bounded by the CH bound, if $k \geq \mu \cdot min\{\delta,\delta^{2}\}$. This leads to algorithms that require a reduced amount of randomness for any analysis which uses the CH bounds. This is joint work with J.P. Schmidt and A. Siegel [108]. In Chapter 4, we present an $RNC^{2}$ algorithm for the perfect matching problem which uses $O(\log Z)$ random bits where $Z$ is any given upper bound on the number of perfect matchings in the graph, generalizing results of Grigoriev and Karpinski. Underlying our algorithm is a randomness-optimal generalization of the Isolating Lemma of Mulmuley, Vazirani \& Vazirani, which also leads to other applications. This is joint work with S. Chari and P. Rohatgi [26]. 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
Incremental Computation: A Semantics-Based Systematic Transformational Approach
Authors: Yanhong A Liu
Venue:  (1995)

Incremental computation takes advantage of repeated computations on inputs that differ slightly from one another, computing each new output incrementally by making use of the previous output rather than from scratch. This thesis concerns the theory, design, and implementation of a general approach to incremental computation. It also elucidates the essence of improving the efficiency of computations by relating it to incremental computation. Our general approach allows incremental computation to be obtained systematically from non-incremental computation and program efficiency to be systematically improved. This research focuses on identifying the fundamentals of efficient incremental computation out of domain-specific properties and language-specific features, devising a general framework that accommodates these fundamentals, and developing a systematic approach based on the framework that exploits program semantics. Three fundamental aspects of incremental computation are identified: avoiding repeated identical computations, caching useful intermediate results, and discovering appropriate auxiliary information. Given a program $f$ and an operation $\oplus$, an incremental program is developed to compute $f(x\oplus y)$ efficiently by using $f(x)$, the intermediate results computed in computing $f(x)$, and auxiliary information about $x$ that can be inexpensively maintained. The approach in this thesis is formalized for a simple functional language, but the underlying principles also apply to other programming languages. It exploits program semantics to discover incrementality that is not directly embedded in primitive operators and takes into consideration properties of application domains as well. It is composed of step-wise program analysis and transformation modules that can, for the most part, be mechanized. Since every non-trivial computation proceeds by iteration (or recursion), the approach is used straightforwardly for achieving efficient computation in general, by computing each iteration incrementally using an appropriate incremental program. This method is applied to problems in interactive systems, optimizing compilers, transformational program development, {\it etc}. The design and implementation of a prototype system, CACHET, for obtaining incremental programs is also described.
The Wearable Computer as a Remote Interface for People with Disabilities
Authors: David A. Ross, Jon A. Sanford
Venue: Proceedings of the 1st IEEE International Symposium on Wearable Computers (1997)

A wearable computer is being developed for use as a remote interface (RI) to electronic products for people aging with/into a physical hand or arm impairment. The goal is to provide these people with a single usable interface with which they can control many types of products. Although the target population is functionally diverse, the investigators hypothesize that a minimum set of interfaces can be identified that, when combined in various "mix and match" configurations, can form interfaces usable by most people with a hand or arm impairment. Methods include: (1) evaluating the usability of existing interfaces and (2) designing and testing the usability of a modular RI system that enables the mixing and matching of modular interface components.
Performance Index Based Network Reliability Analysis with Stratified Sampling
Authors: L. Jereb, A. Kiss
Venue: Proceedings of the 4th International Computer Performance and Dependability Symposium (2000)

The evolution of communication technologies results in continuously increasing capacities and higher concentration of traffic on relatively fewer network elements. In order to avoid the influence of these failures on the services provided by the network several network resilience schemes have been developed and applied in real networks.The objective of the paper is to present a reliability analysis method based on stratified sampling. The method makes it possible to derive the network performance indices even in the case of real size networks by significantly decreasing the number of necessary states. The effectiveness of the method is demonstrated with some numerical examples.
A pragmatic, rigorous integration of structural and behavioral modeling notations
Authors: D. M. Berry, M. Weber
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

This paper describes a pragmatic, rigorous integration of the mathematical specification language Z with well-known object modeling notations and an object-oriented variant of statecharts. The goal is to preserve the abstraction and flexibility of widely-used design notations while being able to embed the precision and rigor of mathematical specification at selected places. The integration between the notations is based on a mapping between entities of the three models.
Observing your Verilog-XL simulation from 30,000 feet: using high level views of simulations to improve debug productivity
Authors: D. Kelf
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

Describes a method to improve simulation debugging throughput by the examination of simulation results at higher levels of abstraction than are generally used by most designers today. As ASIC designs become more and more complex, these kind of techniques will play an increasingly important role in the faster detection and repair of intricate problems within large design descriptions. This paper examines current debugging techniques and contrasts them to a debugging method utilizing higher-level views of simulations. Ways of creating these higher-levels views in Verilog today are discussed, together with a description of technology that can assist in this area. Examples of these views are also presented.
A Comparison of Strict and Non-Strict Semantics for Lists
Authors: Jerry R. Burch
Venue:  (1988)

No abstract available.
ARCA Target Configuration Interface Design Document
Authors: Maria B Baldacci, Donatella Castelli, Pasquale Pagano
Venue:  (1997)

This document describes the mechanisms of the interface used to configure the ARCA target upon a specific OPAC. EMAIL:: baldacci@iei.pi.cnr.it