Sat, 26 Jul 2008 04:18:43 BST CiteULike: Group: Slicing - library [14 articles] http://www.citeulike.org/group/628 CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/group/628/article/1165356 <i>(April 2007)</i> Cobra: Content-based Filtering and Aggregation of Blogs and RSS Feeds Ian Rose Rohan Murty Peter Pietzuch Jonathan Ledlie Mema Roussopoulos Matt Welsh (April 2007) 2007-03-15T11:40:04-00:00 2007 blog content filtering p2p rss systme http://www.citeulike.org/group/628/article/1189260 <i>(May 2006)</i> Pastwatch: a Distributed Version Control System Alexander Yip Benjie Chen Robert Morris (May 2006) 2007-03-27T15:07:44-00:00 2006 control p2p system version http://www.citeulike.org/group/628/article/600462 <i>(2004)</i><br /><br />This paper addresses the problem of churn---the continuous process of node arrival and departure---in distributed hash tables (DHTs). We demonstrate through experiment that existing DHT implementations break down at churn levels observed in deployed peer-to-peer systems, contrary to simulation-based results. We present Bamboo, a DHT that handles high levels of churn, and discuss the manner in which it does so. We show that Bamboo is able to function effectively for median node session times as... Handling churn in a dht S Rhea D Geels T Roscoe J Kubiatowicz (2004) 2006-04-25T16:19:34-00:00 2004 dht p2p http://www.citeulike.org/group/628/article/1591579 <i>(06 April 2007)</i><br /><br /><b>Inside markets, innovation, and risk</b> <p> Why do markets keep crashing and why are financial crises greater than ever before? As the risk manager to some of the leading firms on Wall Street–from Morgan Stanley to Salomon and Citigroup–and a member of some of the world’s largest hedge funds, from Moore Capital to Ziff Brothers and FrontPoint Partners, Rick Bookstaber has seen the ghost inside the machine and vividly shows us a world that is even riskier than we think. The very things done to make markets safer, have, in fact, created a world that is far more dangerous. From the 1987 crash to Citigroup closing the Salomon Arb unit, from staggering losses at UBS to the demise of Long-Term Capital Management, Bookstaber gives readers a front row seat to the management decisions made by some of the most powerful financial figures in the world that led to catastrophe, and describes the impact of his own activities on markets and market crashes. Much of the innovation of the last 30 years has wreaked havoc on the markets and cost trillions of dollars. <i>A Demon of Our Own Design</i> tells the story of man’s attempt to manage market risk and what it has wrought. In the process of showing what we have done, Bookstaber shines a light on what the future holds for a world where capital and power have moved from Wall Street institutions to elite and highly leveraged hedge funds. A Demon of Our Own Design: Markets, Hedge Funds, and the Perils of Financial Innovation Richard Bookstaber (06 April 2007) 2007-08-25T04:12:16-00:00 2007 Wiley finance http://www.citeulike.org/group/628/article/1119048 <i>(January 2007)</i> Analytical Model for BitTorrent- based Live Video Streaming S Tewari L Kleinrock (January 2007) 2007-02-23T16:06:03-00:00 2007 p2p streaming http://www.citeulike.org/group/628/article/606077 <i>(April 2006)</i><br /><br />Efficient and scalable live-streaming overlay construction has become a hot topic recently. In order to improve the performance metrics, such as startup delay, source-to-end delay, and playback continuity, most previous studies focused on intra-overlay optimization. Such approaches have drawbacks including low resource utilization, high startup and source-to-end delay, and unreasonable resource assignment in global P2P networks. Anysee is a peer-to-peer live streaming system and adopts an inter-overlay optimization scheme, in which resources can join multiple overlays, so as to (1) improve global resource utilization and distribute traffic to all physical links evenly; (2) assign resources based on their locality and delay; (3) guarantee streaming service quality by using the nearest peers, even when such peers might belong to different overlays; and (4) balance the load among the group members. We compare the performance of our design with existing approaches based on comprehensive trace driven simulations. Results show that AnySee outperforms previous schemes in resource utilization and the QoS of streaming services. AnySee has been implemented as an Internet based live streaming system, and was successfully released in the summer of 2004 in CERNET of China. Over 60,000 users enjoy massive entertainment programs, including TV programs, movies, and academic conferences. Statistics prove that this design is scalable and robust, and we believe that the wide deployment of AnySee will soon benefit many more Internet users. AnySee: Peer-to-Peer Live Streaming Xiaofei Liao Hai Jin Yunhao Liu Lionel Ni Dafu Deng (April 2006) 2006-04-29T03:27:33-00:00 2006 iptv p2p http://www.citeulike.org/group/628/article/780554 <i>(2006)</i> Insights into PPLive: A Measurement Study of a Large-Scale P2P IPTV System X Hei C Liang J Liang Y Liu KW Ross (2006) 2006-07-31T02:53:50-00:00 2006 iptv p2p pplive http://www.citeulike.org/group/628/article/47 <i>Nature, Vol. 406, No. 6798. (24 August 2000)</i> Navigation in a small world JM Kleinberg doi:10.1038/35022643 Nature, Vol. 406, No. 6798. (24 August 2000) 2004-11-22T00:17:30-00:00 2000 Nature 0028-0836 406 6798 small world http://www.citeulike.org/group/628/article/1571020 <i></i> Examining the Tradeoffs of Structured Overlays in a Dynamic Non-Transitive Network Steven 2007-08-17T02:25:56-00:00 network overlay http://www.citeulike.org/group/628/article/387172 <i>(2003)</i><br /><br />Program slicing is a technique to identify statements that may influence the computations at other statements. Precise slicing has been shown to be undecidable for concurrent programs. This work presents the first context-sensitive approach to slice concurrent programs accurately. It extends the well known structures of the control flow graph and the (interprocedural) program dependence graph for concurrent programs with interference. This new technique does not require serialization or... Context-Sensitive Slicing of Concurrent Programs Jens Krinke (2003) 2005-11-10T14:05:12-00:00 2003 no-tag http://www.citeulike.org/group/628/article/387171 <i>(2002), pp. 22-31.</i><br /><br />We present an empirical evaluation of three contextsensitive slicing algorithms and five context-sensitive chopping algorithms, and compare them to context-insensitive methods. Besides the algorithms by Reps et al. and Agrawal we investigate six new algorithms based on variations of k-limited call strings and approximative chopping based on summary information. It turns out that chopping based on summary information may have a prohibitive complexity, and that approximate algorithms are almost... Evaluating Context-Sensitive Slicing and Chopping Jens Krinke (2002), pp. 22-31. 2005-11-10T14:05:10-00:00 2002 22 31 no-tag http://www.citeulike.org/group/628/article/387170 <i>(2004), pp. 310-315.</i><br /><br />Aspect mining tries to identify crosscutting concerns in existing systems and thus supports the adaption to an aspect-oriented design. This paper describes the first aspect mining approach that detects crosscutting concerns in legacy systems based on dynamic analysis. The analysis uses program traces that are generated in different program executions as underlying data pool. These traces are then investigated for recurring execution patterns based on different constraints, such as the... Aspect Mining Using Event Traces Silvia Breu Jens Krinke (2004), pp. 310-315. 2005-11-10T14:02:59-00:00 2004 310 315 no-tag http://www.citeulike.org/group/628/article/387168 <i>(2001), pp. 301-309.</i><br /><br />We present an approach to identify similar code in programs based on finding similar subgraphs in attributed directed graphs. This approach is used on program dependence graphs and therefore considers not only the syntactic structure of programs but also the data flow within (as an abstraction of the semantics). As a result, there is no tradeoff between precision and recall---our approach is very good in both. An evaluation of our prototype implementation shows that our approach is feasible and ... Identifying Similar Code with Program Dependence Graphs Jens Krinke (2001), pp. 301-309. 2005-11-10T14:02:17-00:00 2001 301 309 no-tag http://www.citeulike.org/group/628/article/387141 <i>(June 1998), pp. 35-42.</i><br /><br />Static program slicing is an established method for analyzing sequential programs, especially for program understanding, debugging and testing. Until now, there was no slicing method for threaded programs which handles interference correctly. We present such a method which also calculates more precise static slices. This paper extends the well known structures of the control flow graph and the program dependence graph for threaded programs with interference. This new technique does not require... Static Slicing of Threaded Programs Jens Krinke (June 1998), pp. 35-42. 2005-11-10T13:58:10-00:00 1998 35 42 no-tag