LEADER 01092nam0-2200361li-450 001 990000255770203316 005 20180312154811.0 010 $a0-13-894759-7 035 $a0025577 035 $aUSA010025577 035 $a(ALEPH)000025577USA01 035 $a0025577 100 $a20001109d1998----km-y0itay0103----ba 101 0 $aeng 102 $aUS 200 1 $aIntranet security$estories from the trenches$fLinda McCarthy 210 $aMountain View$cSun Microsystem$dcopyr. 1998 215 $aXXV, 260 p.$cill.$d24 cm 610 1 $asicurezza dei dati 676 $a0058$9Sicurezza dei dati 700 1$aMcCarthy,$bLinda$0753113 801 $aSistema bibliotecario di Ateneo dell' Universitą di Salerno$gRICA 912 $a990000255770203316 951 $a005.8 MCC$b0022285$c005.8$d00106563 959 $aBK 969 $aSCI 979 $c19980912 979 $c20001110$lUSA01$h1715 979 $aALANDI$b90$c20010327$lUSA01$h1741 979 $c20020403$lUSA01$h1633 979 $aPATRY$b90$c20040406$lUSA01$h1618 996 $aIntranet security$91514937 997 $aUNISA LEADER 07409nam 22008175 450 001 996466021103316 005 20230406061044.0 010 $a1-280-39077-8 010 $a9786613568694 010 $a3-642-17653-4 024 7 $a10.1007/978-3-642-17653-1 035 $a(CKB)2670000000064721 035 $a(SSID)ssj0000476576 035 $a(PQKBManifestationID)11331999 035 $a(PQKBTitleCode)TC0000476576 035 $a(PQKBWorkID)10479930 035 $a(PQKB)10890604 035 $a(DE-He213)978-3-642-17653-1 035 $a(MiAaPQ)EBC3066200 035 $a(PPN)149893620 035 $a(EXLCZ)992670000000064721 100 $a20101206d2010 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aPrinciples of Distributed Systems$b[electronic resource] $e14th International Conference, OPODIS 2010, Tozeur, Tunisia, December 14-17, 2010. Proceedings /$fedited by Chenyang Lu, Toshimitsu Masuzawa, Mohamed Mosbah 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XII, 517 p. 112 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6490 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-17652-6 320 $aIncludes bibliographical references and index. 327 $aRobots -- Pattern Formation through Optimum Matching by Oblivious CORDA Robots -- RoboCast: Asynchronous Communication in Robot Networks -- Randomization in Distributed Algorithms -- Biased Selection for Building Small-World Networks -- Application of Random Walks to Decentralized Recommender Systems -- Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes -- Brief Announcements I -- Self-stabilizing (k,r)-Clustering in Wireless Ad-hoc Networks with Multiple Paths -- Self-stabilizing Byzantine Asynchronous Unison, -- Graph Algorithms -- Reliably Detecting Connectivity Using Local Graph Traits -- Distributed Game-Theoretic Vertex Coloring -- Constructing a Map of an Anonymous Graph: Applications of Universal Sequences -- Brief Announcements II -- Effect of Fairness in Model Checking of Self-stabilizing Programs -- A Formal Framework for Conformance Testing of Distributed Real-Time Systems -- Fault-Tolerance -- Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value -- A Fault Avoidance Strategy Improving the Reliability of the EGI Production Grid Infrastructure -- Failure Detectors Encapsulate Fairness -- -Based k-Set Agreement Algorithms -- Distributed Programming -- Distributed Programming with Tasks -- SkewCCC+: A Heterogeneous Distributed Hash Table -- On the Automated Implementation of Time-Based Paxos Using the IOA Compiler -- Real-Time -- Partitioning Real-Time Systems on Multiprocessors with Shared Resources -- On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors -- Tardiness Bounds for Global EDF with Deadlines Different from Periods -- Shared Memory -- Cache-Aware Lock-Free Queues for Multiple Producers/Consumers and Weak Memory Consistency -- An Adaptive Technique for Constructing Robust and High-Throughput Shared Objects -- Efficient Lock Free Privatization -- A Competitive Analysis for Balanced Transactional Memory Workloads -- Concurrency -- Fast Local-Spin Abortable Mutual Exclusion with Bounded Space -- Turning Adversaries into Friends: Simplified, Made Constructive, and Extended -- Quasi-Linearizability: Relaxed Consistency for Improved Concurrency -- A Token-Based Distributed Algorithm for the Generalized Resource Allocation Problem -- On the Message Complexity of Global Computations -- Optimizing Regenerator Cost in Traffic Grooming -- On Minimizing Average End-to-End Delay in P2P Live Streaming Systems -- Monotonic Stabilization -- Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol -- Improving Space Complexity of Self-stabilizing Counting on Mobile Sensor Networks. 330 $aThe 14th International Conference on Principles of Distributed Systems (OPODIS 2010) took place during December 14?17, 2010 in Tozeur, Tunisia. It continued a tradition of successful conferences; Chantilly (1997), Amiens (1998), Hanoi (1999), Paris (2000), Mexico (2001), Reims (2002), La Martinique (2003), Gre- ble (2004), Pisa (2005), Bordeaux (2006), Guadeloupe (2007), Luxor (2008) and N??mes (2009). The OPODIS conference constitutes an open forum for the exchange of sta- of-the-art knowledge on distributed computing and systems among researchers from around the world. Following the tradition of the previous events, the p- gram was composed of high-quality contributed papers. The program call for papers looked for original and signi?cant research contributions to the theory, speci?cation, design and implementation of distributed systems, including: ? Communication and synchronization protocols ? Distributed algorithms, multiprocessor algorithms ? Distributed cooperative computing ? Embedded systems ? Fault-tolerance, reliability, availability ? Grid and cluster computing ? Location- and context-aware systems ? Mobile agents and autonomous robots ? Mobile computing and networks ? Peer-to-peer systems, overlay networks ? Complexity and lower bounds ? Performance analysis of distributed systems ? Real-time systems ? Security issues in distributed computing and systems ? Sensor networks: theory and practice ? Speci?cation and veri?cation of distributed systems ? Testing and experimentation with distributed systems In response to this call for papers, 122 papers were submitted. Each paper was reviewed by at least three reviewers, and judged according to scienti?c and p- sentation quality, originality and relevance to the conference topics. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6490 606 $aComputer networks 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aSoftware engineering 606 $aArtificial intelligence 606 $aComputer Communication Networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aSoftware Engineering 606 $aArtificial Intelligence 606 $aSymbolic and Algebraic Manipulation 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aSoftware engineering. 615 0$aArtificial intelligence. 615 14$aComputer Communication Networks. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aSoftware Engineering. 615 24$aArtificial Intelligence. 615 24$aSymbolic and Algebraic Manipulation. 676 $a004.6 702 $aLu$b Chenyang$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMasuzawa$b Toshimitsu$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMosbah$b Mohamed$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aOPODIS 2010 906 $aBOOK 912 $a996466021103316 996 $aPrinciples of Distributed Systems$9772112 997 $aUNISA LEADER 02449oam 22003854a 450 001 9910776162403321 005 20240805131337.0 010 $a9789461665355 010 $a9461665350 035 $a(CKB)5840000000424853 035 $a(OCoLC)1419963441 035 $a(MdBmJHUP)musev2_112626 035 $a(EXLCZ)995840000000424853 100 $a20240206d2024 uy 0 101 0 $aeng 135 $aur|||||||nn|n 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 13$aAn Opaque Mirror for Trajan : $eA Literary Analysis and Interpretation of Plutarch's 'Regum et imperatorum apophthegmata' 210 1$a[S.l.] :$cLEUVEN UNIVERSITY PRESS,$d2024. 210 4$d©2024. 215 $a1 online resource 311 08$a9789462703902 311 08$a9462703906 330 $a"Plutarch's Regum et imperatorum apophthegmata (Sayings of Kings and Commanders) holds a peculiar position in his oeuvre. This collection of almost 500 anecdotes of barbarian, Greek, and Roman rulers and generals is introduced by a dedicatory letter to Trajan as a summary of the author's well-known and widely read Parallel Lives. The work is therefore Plutarch's only text that explicitly addresses a Roman emperor and is likely to shed light on his biographical technique. Yet the collection has been understudied, because its authenticity has been generally rejected since the nineteenth century. Recent scholarship defends Plutarch's authorship of the text, but some remain sceptical. This book restores its reputation and provides a first full literary analysis of the letter and collection as a genuine work of Plutarch, wherein he attempts to educate his ruler by means of great role models of the past. Plutarch's thinking about the function of role models (exempla) is not only relevant for Plutarchan research, but also for our knowledge of exemplarity, a key feature both in Greek and Latin literature in the early imperial period in general. Therefore An Opaque Mirror for Trajan is also of interest for literary and historical scholars who study the broader context of ancient literature of the first centuries CE."--Page 4 of cover. 608 $aElectronic books. 676 $a888/.0108 700 $aVAN DER WIEL$b LAURENS$01771774 801 0$bMdBmJHUP 801 1$bMdBmJHUP 906 $aBOOK 912 $a9910776162403321 996 $aAn Opaque Mirror for Trajan$94264861 997 $aUNINA