The proliferation of applications that must reliably distribute bulk data to a large number of autonomous clients motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous clients to acquire bulk data with optimal efficiency at times of their choosing. Moreover, no feedback channels are needed to ensure reliable delivery, even in the face of high loss rates. We develop a protocol that closely approximates a digital fountain using a new class of erasure codes that are orders of magnitude faster than standard erasure codes. We provide performance measurements that demonstrate the feasibility of our approach and discuss the design, implementation and performance of an experimental system. 1 Introduction Software companies that plan to efficiently disseminate new software over the Internet to millions of users simultaneously will ...

This paper describes a complete and practical algorithm for the problem of geometric theorem proving.The algorithm works over algebraically closed fields as well as over the reals and takes care of degenerate cases.Our work ismotivated by several recent improvements in algorithms for sign determination and symbolic-numeric computation.Based on these, we provide an algorithm for solving triangular systems efficiently using straightline program arithmetic.The report concludes with a description of an implementation and provides preliminary benchmarks from the same.The basic problem we consider is the following : given a system of hypotheses polynomial equations in triangular form, determine whether the set of their common zeros over the reals M contained in the set of real zeros of the conclusion polynomial.(One can use any standard algorithm for triangulating if the hypotheses are not triangular to begin with, see e.g.[4]).The observation here is that, in order to prove a theorem or refute it, one is only interested in the sign (+, -or O) of the conclusion polynomial at the real zeros of the hypotheses polynomials.We provide an efficient method to encode the roots of a triangular system using the Sylvester resultant.To determine the signs, we make use of Sturm sequences which enable us to determine the number of real roots of the hypotheses where the conclusion is non-zero.Thus our algorithm can determine

This paper addresses the problem of efficient construction of monomial bases for the coordinate rings of zero-dimensional varieties.

Article Free Access Share on An exact algorithm for kinodynamic planning in the plane Authors: John Canny Computer Science Division, University of California, Berkeley Computer Science Division, University of California, BerkeleyView Profile , Ashutosh Rege Computer Science Division, University of California, Berkeley Computer Science Division, University of California, BerkeleyView Profile , John Reif Computer Science Department, Duke University, Durham, N.C. Computer Science Department, Duke University, Durham, N.C.View Profile Authors Info & Claims SCG '90: Proceedings of the sixth annual symposium on Computational geometryMay 1990Pages 271–280https://doi.org/10.1145/98524.98584Published:01 May 1990Publication History 22citation29DownloadsMetricsTotal Citations22Total Downloads29Last 12 Months16Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

The authors present the concept of influence diagrams for representing probabilistic dependence and independence between state variables in a given problem domain and a topological framework for solving probabilistic inference problems in expert systems. The mathematical basis for influence diagrams is explained and theorems for mathematical manipulation of them are presented, in a graph-theoretic framework. Topological transformation rules developed in previous research are formalized in an axiomatic manner based on a concept of consistency. A polynomial-time symbolic-level algorithm for solving probabilistic inference problems is developed. The algorithm involves searching through the diagram to answer any specific diagnostic query about the system.>