DOCSLIB.ORG

Download Book

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Download Book Lecture Notes in Computer Science 3279 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen University of Dortmund, Germany Madhu Sudan Massachusetts Institute of Technology, MA, USA Demetri Terzopoulos New York University, NY, USA Doug Tygar University of California, Berkeley, CA, USA Moshe Y. Vardi Rice University, Houston, TX, USA Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany Geoffrey M. Voelker Scott Shenker (Eds.) Peer-to-Peer Systems III Third International Workshop, IPTPS 2004 La Jolla, CA, USA, February 26-27, 2004 Revised Selected Papers 13 Volume Editors Geoffrey M. Voelker University of California, San Diego Department of Computer Science and Engineering 9500 Gilman Dr., MC 0114, La Jolla, CA 92093-0114, USA E-mail: [email protected] Scott Shenker University of California, Berkeley Computer Science Division, EECS Department 683 Soda Hall, 1776, Berkeley, CA 94720, USA E-mail: [email protected] Library of Congress Control Number: Applied for CR Subject Classification (1998): C.2.4, C.2, H.3, H.4, D.4, F.2.2, E.1, D.2 ISSN 0302-9743 ISBN 3-540-24252-X Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springeronline.com © Springer-Verlag Berlin Heidelberg 2004 Printed in Germany Typesetting: Camera-ready by author, data conversion by Olgun Computergrafik Printed on acid-free paper SPIN: 11361909 06/3142 543210 Preface On February 26–27, 2004, the 3rd International Workshop on Peer-to-Peer Sys- tems (IPTPS 2004) brought researchers and practitioners together to discuss the latest developments in peer-to-peer technologies, applications, and systems. As the third workshop in the series, IPTPS 2004 continued the success of the previous workshops in pioneering the state of the art in peer-to-peer systems and identifying key research challenges in the area. The workshop received 145 submissions in the form of five-page position papers. As with previous workshops, submissions went through two rounds of reviews by an international program committee of 14 experts from industry and academia. In the first round each submission received two reviews. In the second round we focused our attention on submissions with either positive reviews, or with reviews that expressed substantially different opinions. In addition to the technical merit, the reviewing process emphasized originality and the potential of the submission to lead to interesting discussions during the workshop. In the end, the program committee selected a workshop program of 27 papers covering a wide range of topics including new peer-to-peer applications, advances in routing, load balancing, searching, as well as transport, mobility, and other networking topics. Authors revised accepted position papers to six pages for the workshop program, and made a final round of revision for this volume. The workshop was composed of eight sessions that spanned two days. To focus discussions, attendance was limited to 67 participants and included sub- stantial time for interaction and discussion between sessions and at social events. A hallmark of the IPTPS workshops is that they serve as a crossroads for re- searchers to gather from many disciplines and communities, including systems, networking, databases, theory, and scientific computing. The workshop this year continued the trend with lively discussions and insight provided by researchers from these many fields. The workshop would not have been a success without substantial help from a variety of people. First, we thank the program committee for their dedication and effort during an intense reviewing period spanning the winter holidays. The high quality and diversity of the program is due to their insight, experience, and commitment. We would also like to thank Jennifer Anderson for the outstanding local arrangements at the Sea Lodge in La Jolla, Marvin McNett for system administrative support for the IPTPS 2004 Web server, and Michelle Panik for assistance with formatting this volume. And we graciously thank our sponsors, Microsoft Research and Intel, for their continued generous support of the IPTPS workshops. This volume includes a report on the discussions during the technical sessions. This report conveys the interactions during the workshop beyond the material included in position papers and presented in talks. We thank Sumeet Singh, VI Preface Sriram Ramabhadran, and Kiran Tati for diligently taking notes during the workshop and collecting them into this report. Finally, we thank all authors who submitted papers to the workshop for continuing to make peer-to-peer computing a vibrant research community, the authors of accepted papers for their ideas and contributions to the area, the speakers for spirited and engaging talks, and all participants for making the workshop a success. March 2004 Geoffrey M. Voelker and Scott Shenker Workshop Co-chairs Scott Shenker ICSI and UC Berkeley, USA Geoffrey M. Voelker UC San Diego, USA Program Committee Steve Gribble University of Washington, USA John Kubiatowicz UC Berkeley, USA Michael Mitzenmacher Harvard University, USA Sylvia Ratnasamy Intel Research, USA Srini Seshan CMU, USA Alex Snoeren UC San Diego, USA Robbert van Renesse Cornell, USA Dan Wallach Rice University, USA Roger Wattenhofer ETH Zurich, Switzerland Alec Wolman Microsoft Research, USA Zhichen Xu HP Labs, USA Zheng Zhang Microsoft Research, China Steering Committee Peter Druschel Rice University, USA Frans Kaashoek MIT, USA Antony Rowstron Microsoft Research, UK Scott Shenker ICSI and UC Berkeley, USA Ion Stoica UC Berkeley, USA Administrative Assistant Jennifer Anderson UC San Diego, USA Sponsoring Institutions Table of Contents Workshop Report for the 3rd International Workshop on Peer-to-Peer Systems ............................................ 1 Sriram Ramabhadran, Sumeet Singh, and Kiran Tati I Miscellaneous A Practical Distributed Mutual Exclusion Protocol in Dynamic Peer-to-Peer Systems .................................... 11 Shi-Ding Lin, Qiao Lian, Ming Chen, and Zheng Zhang On the Cost of Participating in a Peer-to-Peer Network ................. 22 Nicolas Christin and John Chuang 2 P2P or Not 2 P2P? ............................................... 33 Mema Roussopoulos, Mary Baker, David S.H. Rosenthal, Thomas J. Giuli, Petros Maniatis, and Jeff Mogul II Networking On Transport Layer Support for Peer-to-Peer Networks ................. 44 Hung-Yun Hsieh and Raghupathy Sivakumar Supporting Heterogeneity and Congestion Control in Peer-to-Peer Multicast Streaming .................................. 54 Venkata N. Padmanabhan, Helen J. Wang, and Philip A. Chou Rapid Mobility via Type Indirection .................................. 64 Ben Y. Zhao, Ling Huang, Anthony D. Joseph, and John Kubiatowicz P6P: A Peer-to-Peer Approach to Internet Infrastructure ............... 75 Lidong Zhou and Robbert van Renesse III Routing Comparing the Performance of Distributed Hash Tables Under Churn .... 87 Jinyang Li, Jeremy Stribling, Thomer M. Gil, Robert Morris, and M. Frans Kaashoek DHT Routing Using Social Links ....................................100 Sergio Marti, Prasanna Ganesan, and Hector Garcia-Molina X Table of Contents When Multi-hop Peer-to-Peer Lookup Matters .........................112 Rodrigo Rodrigues and Charles Blake IV Load Balancing and Searching Uncoordinated Load Balancing and Congestion Games in P2P Systems ...123 Subhash Suri, Csaba D. T´oth, and Yunhong Zhou Simple Efficient Load Balancing Algorithms for Peer-to-Peer Systems .....131 David R. Karger and Matthias Ruhl The Case for a Hybrid P2P Search Infrastructure ......................141 Boon Thau Loo, Ryan Huebsch, Ion Stoica, and Joseph M. Hellerstein Making Peer-to-Peer Keyword Searching Feasible Using Multi-level Partitioning .......................................151 Shuming Shi, Guangwen Yang, Dingxing Wang, Jin Yu, Shaogang Qu, and Ming Chen V Miscellaneous Providing Administrative Control and Autonomy in Structured Peer-to-Peer Overlays ..................................162 Alan Mislove and Peter Druschel Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol ......173 Robbert van Renesse and Adrian Bozdog Friends Troubleshooting Network: Towards Privacy-Preserving, Automatic Troubleshooting ................184 Helen J. Wang, Yih-Chun Hu, Chun Yuan, Zheng Zhang, and Yi-Min Wang Spurring Adoption of DHTs with OpenHash, a Public DHT Service ......195
Load more

Recommended publications
  • The Wealth of Networks How Social Production Transforms Markets and Freedom
    Name /yal05/27282_u00 01/27/06 10:25AM Plate # 0-Composite pg 3 # 3 The Wealth of Networks How Social Production Transforms Markets and Freedom Yochai Benkler Yale University Press Ϫ1 New Haven and London 0 ϩ1 Name /yal05/27282_u00 01/27/06 10:25AM Plate # 0-Composite pg 4 # 4 Copyright ᭧ 2006 by Yochai Benkler. All rights reserved. Subject to the exception immediately following, this book may not be repro- duced, in whole or in part, including illustrations, in any form (beyond that copy- ing permitted by Sections 107 and 108 of the U.S. Copyright Law and except by reviewers for the public press), without written permission from the publishers. The author has made an online version of the book available under a Creative Commons Noncommercial Sharealike license; it can be accessed through the author’s website at http://www.benkler.org. Printed in the United States of America. Library of Congress Cataloging-in-Publication Data Benkler, Yochai. The wealth of networks : how social production transforms markets and freedom / Yochai Benkler. p. cm. Includes bibliographical references and index. ISBN-13: 978-0-300-11056-2 (alk. paper) ISBN-10: 0-300-11056-1 (alk. paper) 1. Information society. 2. Information networks. 3. Computer networks—Social aspects. 4. Computer networks—Economic aspects. I. Title. HM851.B457 2006 303.48'33—dc22 2005028316 A catalogue record for this book is available from the British Library. The paper in this book meets the guidelines for permanence and durability of the Committee on Production Guidelines for Book Longevity of the Council on Library Resources.
    [Show full text]
  • The Edonkey File-Sharing Network
    The eDonkey File-Sharing Network Oliver Heckmann, Axel Bock, Andreas Mauthe, Ralf Steinmetz Multimedia Kommunikation (KOM) Technische Universitat¨ Darmstadt Merckstr. 25, 64293 Darmstadt (heckmann, bock, mauthe, steinmetz)@kom.tu-darmstadt.de Abstract: The eDonkey 2000 file-sharing network is one of the most successful peer- to-peer file-sharing applications, especially in Germany. The network itself is a hybrid peer-to-peer network with client applications running on the end-system that are con- nected to a distributed network of dedicated servers. In this paper we describe the eDonkey protocol and measurement results on network/transport layer and application layer that were made with the client software and with an open-source eDonkey server we extended for these measurements. 1 Motivation and Introduction Most of the traffic in the network of access and backbone Internet service providers (ISPs) is generated by peer-to-peer (P2P) file-sharing applications [San03]. These applications are typically bandwidth greedy and generate more long-lived TCP flows than the WWW traffic that was dominating the Internet traffic before the P2P applications. To understand the influence of these applications and the characteristics of the traffic they produce and their impact on network design, capacity expansion, traffic engineering and shaping, it is important to empirically analyse the dominant file-sharing applications. The eDonkey file-sharing protocol is one of these file-sharing protocols. It is imple- mented by the original eDonkey2000 client [eDonkey] and additionally by some open- source clients like mldonkey [mlDonkey] and eMule [eMule]. According to [San03] it is with 52% of the generated file-sharing traffic the most successful P2P file-sharing net- work in Germany, even more successful than the FastTrack protocol used by the P2P client KaZaa [KaZaa] that comes to 44% of the traffic.
    [Show full text]
  • Rendezvous Search with Revealed Information: Applications to the Line
    J. Appl. Prob. 44, 1–15 (2007) Printed in England © Applied Probability Trust 2007 RENDEZVOUS SEARCH WITH REVEALED INFORMATION: APPLICATIONS TO THE LINE STEVE ALPERN,∗ London School of Economics Abstract The symmetric rendezvous problem on a network Q asks how two players, forced to use the same mixed strategy, can minimize their expected meeting time, starting from a known initial distribution on the nodes of Q. This minimum is called the (symmetric) ‘rendezvous value’of Q. Traditionally, the players are assumed to receive no information while playing the game. We consider the effect on rendezvous times of giving the players some information about past actions and chance moves, enabling each of them to apply Bayesian updates to improve his knowledge of the other’s whereabouts. This technique can be used to give lower bounds on the rendezvous times of the original game (without any revealed information). We consider the case in which they are placed a known distance apart on the line graph Q (known as ‘symmetric rendezvous on the line’). Our approach is to concentrate on a general analysis of the effect of revelations, rather than compute the best bounds possible with our technique. Keywords: Rendezvous; search; common interest game; team theory 2000 Mathematics Subject Classification: Primary 90B40 1. Introduction In this paper we consider how the revelation of information can affect an important unsolved problem in rendezvous theory: the symmetric rendezvous problem on the line or line graph (whose nodes are the integers, Z) posed in [1], dubbed . (In fact, given the recent solution by Weber [14] of the symmetric rendezvous problem on the complete graph K3,is arguably the main unsolved problem.) The problem begins with a chance move α, called the initial configuration.
    [Show full text]
  • Coding Theory, Information Theory and Cryptology : Proceedings of the EIDMA Winter Meeting, Veldhoven, December 19-21, 1994
    Coding theory, information theory and cryptology : proceedings of the EIDMA winter meeting, Veldhoven, December 19-21, 1994 Citation for published version (APA): Tilborg, van, H. C. A., & Willems, F. M. J. (Eds.) (1994). Coding theory, information theory and cryptology : proceedings of the EIDMA winter meeting, Veldhoven, December 19-21, 1994. Euler Institute of Discrete Mathematics and its Applications. Document status and date: Published: 01/01/1994 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Open Thesis-Cklee-Jul21.Pdf
    The Pennsylvania State University The Graduate School College of Engineering EFFICIENT INFORMATION ACCESS FOR LOCATION-BASED SERVICES IN MOBILE ENVIRONMENTS A Dissertation in Computer Science and Engineering by Chi Keung Lee c 2009 Chi Keung Lee Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy August 2009 The dissertation of Chi Keung Lee was reviewed and approved∗ by the following: Wang-Chien Lee Associate Professor of Computer Science and Engineering Dissertation Advisor Chair of Committee Donna Peuquet Professor of Geography Piotr Berman Associate Professor of Computer Science and Engineering Daniel Kifer Assistant Professor of Computer Science and Engineering Raj Acharya Professor of Computer Science and Engineering Head of Computer Science and Engineering ∗Signatures are on file in the Graduate School. Abstract The demand for pervasive access of location-related information (e.g., local traffic, restau- rant locations, navigation maps, weather conditions, pollution index, etc.) fosters a tremen- dous application base of Location Based Services (LBSs). Without loss of generality, we model location-related information as spatial objects and the accesses of such information as Location-Dependent Spatial Queries (LDSQs) in LBS systems. In this thesis, we address the efficiency issue of LDSQ processing through several innovative techniques. First, we develop a new client-side data caching model, called Complementary Space Caching (CSC), to effectively shorten data access latency over wireless channels. This is mo- tivated by an observation that mobile clients, with only a subset of objects cached, do not have sufficient knowledge to assert whether or not certain object access from the remote server are necessary for given LDSQs.
    [Show full text]
  • Internet Evidence Finder Report
    Patrick Leahy Center for Digital Investigation (LCDI) Internet Evidence Finder Report Written and Researched by Nick Murray 175 Lakeside Ave, Room 300A Phone: 802/865-5744 Fax: 802/865-6446 http://www.lcdi.champlin.edu July 2013 IEF Report 6/28/2013 Page 1 of 33 Patrick Leahy Center for Digital Investigation (LCDI) Disclaimer: This document contains information based on research that has been gathered by employee(s) of The Senator Patrick Leahy Center for Digital Investigation (LCDI). The data contained in this project is submitted voluntarily and is unaudited. Every effort has been made by LCDI to assure the accuracy and reliability of the data contained in this report. However, LCDI nor any of our employees make no representation, warranty or guarantee in connection with this report and hereby expressly disclaims any liability or responsibility for loss or damage resulting from use of this data. Information in this report can be downloaded and redistributed by any person or persons. Any redistribution must maintain the LCDI logo and any references from this report must be properly annotated. Contents Introduction ............................................................................................................................................................. 5 Prior Work: .......................................................................................................................................................... 7 Purpose and Scope: ............................................................................................................................................
    [Show full text]
  • Checking Whether a Word Is Hamming-Isometric in Linear Time
    Checking whether a word is Hamming-isometric in linear time Marie-Pierre B´eal ID ,∗ Maxime Crochemore ID † July 26, 2021 Abstract duced Fibonacci cubes in which nodes are on a binary alphabet and avoid the factor 11. The notion of d- A finite word f is Hamming-isometric if for any two ary n-cubes has subsequently be extended to define word u and v of the same length avoiding f, u can the generalized Fibonacci cube [10, 11, 19] ; it is the 2 be transformed into v by changing one by one all the subgraph Qn(f) of a 2-ary n-cube whose nodes avoid letters on which u differs from v, in such a way that some factor f. In this framework, a binary word f is 2 all of the new words obtained in this process also said to be Lee-isometric when, for any n 1, Qn(f) 2 ≥ avoid f. Words which are not Hamming-isometric can be isometrically embedded into Qn, that is, the 2 have been characterized as words having a border distance between two words u and v vertices of Qn(f) 2 2 with two mismatches. We derive from this charac- is the same in Qn(f) and in Qn. terization a linear-time algorithm to check whether On a binary alphabet, the definition of a Lee- a word is Hamming-isometric. It is based on pat- isometric word can be equivalently given by ignor- tern matching algorithms with k mismatches. Lee- ing hypercubes and adopting a point of view closer isometric words over a four-letter alphabet have been to combinatorics on words.
    [Show full text]
  • Pledge of Compliance of the Information Security Policy of Nagoya University
    For submission Pledge of Compliance of the Information Security Policy of Nagoya University To the Director of Information and Communications Headquarters 1. As a member of the academic community of Nagoya University, I will carefully read the following two documents and hereby pledge to comply with the rules, regulations and guidelines specified therein. a. The Information Security Policy of Nagoya University (*1) b. The Network Usage Guidelines (User Information) of Nagoya University (*2) 2. I promise to take the “e-Learning Training Course on Information Security” (*3) within one month after enrollment. Examinee's number Date: School / Graduate School: Department: Name: Signature: Notice: Users who violate the Information Security Policy of Nagoya University and/or the Network Usage Guidelines (User Information) of Nagoya University may be subject to disciplinary action according to the Nagoya University General Rules, the Nagoya University Student Discipline Rules, etc. Downloading illegally distributed music and/or movie files is an infringement of copyright law. Those who download files illegally will be liable for compensation damages. Nagoya University will prohibit any illegal downloading of files through its computers and/or network. Nagoya University prohibits the use of file sharing software such as Winny, WinMX, Share, Gnutella (Cabos, LimeWire, Shareaza, etc.) and Xunlei. * If the use of said software is required for education or research purposes, prior approval by the Information and Communications Headquarters is mandatory. If users fail to take the “e-Learning Training Course on Information Security” within one month after enrollment or if they do not successfully complete the course, their access to the Nagoya University Portal, Nagoya University Mail, the Information Media System, and the Wireless LAN (NUWNET) will be suspended.
    [Show full text]
  • Illegal File Sharing Notice Notice Is Sent to All Enrolled Students Via Email
    Illegal File Sharing Notice Notice is sent to all enrolled students via email. Sample notification: Do YOU know the risks of illegal file sharing? The Recording Industry Association of America, the Motion Picture Association of America, the TV networks like NBC and ABC and other copyright holders will find you and sue you for illegal file sharing! It has happened to students here on campus, so don’t think that this won’t happen to you! Are YOU ready to pay $3,000 to $5,000 for illegally file sharing music, movies, software, etc.? Copyright law allows a copyright holder to sue someone who violates their rights for up to $150,000 per song, movie or TV episode. Students who have been fined at UWSP settled out of court for between $3,000 and $5,000. No one has that kind of cash just sitting around, so how can you avoid these fines? 1. Do NOT use peer‐to‐peer (P2P) file sharing programs like LimeWire, FrostWire, BitTorrent, Ares or Bearshare. 2. Educate yourself about illegal downloading and file sharing at: http://library.uwsp.edu/guides/Copyright/filesharing.htm 3. Use legal music, video and TV sites listed on this web site: http://www.educause.edu/Resources/Browse/LegalDownloading/33381 Here is what happens if YOU get caught for illegal file sharing on the UWSP campus: If you are a student caught while using our Residential Network, the campus wireless network or the campus wired network such as in a computer lab, you will lose your ability to use the Internet on campus for 7 days for a first offense.
    [Show full text]
  • Downloading Music & Illegal File Sharing
    DOWNLOADING MUSIC & ILLEGAL FILE SHARING Under the Digital Millennium Copyright Act of 1998, California State University, Chico is required to take steps to expeditiously remove or disable access to any copyrighted material being shared illegally from within its network Illegal file-sharing and other copyright violations are a violation of Title 5 of the California Code of Regulations. What is illegal file sharing? Using file sharing programs such as LimeWire, BitTorrent, Ares, and eMule to share or obtain copyrighted music, movies, games, and other software without the permission of the copyright holder is illegal. Organizations such as the Recording Industry Association of America (RIAA), the Motion Picture Association of America (MPAA), the Entertainment Software Association (ESA), and others monitor file sharing systems on the Internet. When they discover an instance of illegal file sharing that is originating from within Chico State’s network, they will send an official notice to the University. Upon receipt of this notice, the University must take action to stop copyright infringement from occurring on its network. What are the consequences? If you illegally share copyrighted files: Your ResNet network privileges will be suspended. You may have to pay at least $3,000 in a settlement with the copyright holder! Repeat offenders will face disciplinary action with Student Judicial Affairs. First-time offenders will be directed to a warning web page and will be notified via an email to his/her Wildcat Mail account. It will be your responsibility to follow the instructions on the warning page. Repeat offenders will lose their network privileges indefinitely and face further disciplinary action.
    [Show full text]
  • Connection Manual for Student Residence Hall Network System
    Connection Manual for Student Residence Hall Network System Academic Computing and Communications Center April 1, 2013 This manual describes the use of the Student Residence Hall Network System. You will receive your user name (printed on the back of your student ID card) and password during the university enrollment procedures. Please be aware that you will not be able to use the network system before that. Furthermore, even if you make inquiries beforehand, you will not receive your user name and password. You can find more details about the user name and password at the following URL: https://account.tsukuba.ac.jp/index-e.html (English) Please make sure you respect the important points below before using the Student Residence Hall Network System. □ The use of peer-to-peer file sharing software (Xunlei, Torrent, eMule, Limewire etc.) is strictly prohibited in our university. □ Do not illegally download or upload any kind of copyrighted material. □ Please enroll in the “INFOSS 情報倫理” (“INFOSS information ethics”) course offered by the e-learning system (moodle) of the University of Tsukuba. □ Do not use any wireless LAN device or broadband router in a student residence hall. Such a device may cause other users to lose their network connection (more than 45 problems were caused by such instances in the first half of the last year). □ Please install the antivirus software provided by our university (each student can install this software on one device). □ The Academic Computing and Communications Center cannot offer support on weekends or during the night time. However, a help desk offering support for connecting to the university network is open for a limited time for newly enrolled students (details can be found on the last page).
    [Show full text]
  • Modern Techniques for Constraint Solving the Casper Experience
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by New University of Lisbon's Repository MARCO VARGAS CORREIA MODERN TECHNIQUES FOR CONSTRAINT SOLVING THE CASPER EXPERIENCE Dissertação apresentada para obtenção do Grau de Doutor em Engenharia Informática, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia. UNIÃO EUROPEIA Fundo Social Europeu LISBOA 2010 ii Acknowledgments First I would like to thank Pedro Barahona, the supervisor of this work. Besides his valuable scientific advice, his general optimism kept me motivated throughout the long, and some- times convoluted, years of my PhD. Additionally, he managed to find financial support for my participation on international conferences, workshops, and summer schools, and even for the extension of my grant for an extra year and an half. This was essential to keep me focused on the scientific work, and ultimately responsible for the existence of this dissertation. Designing, developing, and maintaining a constraint solver requires a lot of effort. I have been lucky to count on the help and advice of colleagues contributing directly or indirectly to the design and implementation of CASPER, to whom I am truly indebted: Francisco Azevedo introduced me to constraint solving over set variables, and was the first to point out the potential of incremental propagation. The set constraint solver integrating the work presented in this dissertation is based on his own solver CARDINAL, which he has thoroughly explained to me. Jorge Cruz was very helpful for clarifying many issues about real valued arithmetic, and propagation of constraints over real valued variables in general.
    [Show full text]