1 / 9

Power Laws, Highly Optimized Tolerance and generalized source coding

This presentation proposes a generalized optimization problem that extends the concept of data compression to other domains such as website layout and forest fires. The problem is formulated and analyzed for three examples, showcasing the tradeoff between resource allocation and event loss. The average statistics in these examples exhibit power law distributions, highlighting the need for highly optimized solutions. This presentation provides insights into the applicability of the generalized framework and raises questions about the optimality of existing designs in the given domains.

fredericksen
Télécharger la présentation

Power Laws, Highly Optimized Tolerance and generalized source coding

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Power Laws, Highly Optimized Tolerance and generalized source coding John Doyle, J.M. Carlson Presented by Sumitra Ganesh

  2. Overview • Propose an optimization problem that is a generalization of the Data Compression (Source coding) problem • Problem is formulated and analyzed for 3 examples : Data compression (DC), Website layout (WWW), Forest Fires (FF)

  3. The PLR optimization problem Probability of event Loss/size associated with event Resource allocated to suppress the size

  4. Data Compression Each source symbol – codeword of Bits.

  5. Web Layout • The sizes are the lengths of the files • The probabilities are determined by user interest in the files • The cost is the average delay that a user experiences in downloading files • Resource limit is on the total number of files

  6. WWW contd Crucial : The resource-loss tradeoff is determined by The resource allocation (separation if document into files) may change influence the hit probability for a given file. Split the one-dimensional file into N regions of equal size and with uniform access probability

  7. Forest Fires • Two-dimensional problem • The losses are the burned areas • The probabilities are determined by the probability of sparks • The cost is the average timber lost in fires • Resource is the density of firebreaks etc.

  8. Heavy tailed CDFs

  9. Comments • Generalized framework : not clear about its applicability • The average statistics seem to obey power laws even though the individual websites were not optimally designed (Why?) • The three examples are explained well

More Related