LEADER 05523nam 22007215 450 001 996466122903316 005 20200629173908.0 010 $a3-540-49693-9 024 7 $a10.1007/BFb0056467 035 $a(CKB)1000000000210994 035 $a(SSID)ssj0000322702 035 $a(PQKBManifestationID)11238726 035 $a(PQKBTitleCode)TC0000322702 035 $a(PQKBWorkID)10287107 035 $a(PQKB)10033460 035 $a(DE-He213)978-3-540-49693-9 035 $a(PPN)155212222 035 $a(EXLCZ)991000000000210994 100 $a20121227d1998 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aDistributed Computing$b[electronic resource] $e12th International Symposium, DISC'98, Andros, Greece, September 24 -26, 1998, Proceedings /$fedited by Shay Kutten 205 $a1st ed. 1998. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1998. 215 $a1 online resource (XII, 428 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1499 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-65066-0 327 $aSense of direction in distributed computing -- Top-down considerations on distributed computing -- Inter-task co-ordination in long-lived distributed applications -- Seamlessly selecting the best copy from internet-wide replicated web servers -- Wait-free synchronization in quantum-based multiprogrammed systems -- Computing in totally anonymous asynchronous shared memory systems -- Transient fault detectors -- Directed virtual path layouts in ATM networks -- A decision-theoretic approach to reliable message delivery -- Propagation and leader election in a multihop broadcast environment -- The arrow distributed directory protocol -- Efficient Byzantine agreement secure against general adversaries -- Long-lived, fast, waitfree renaming with optimal name space and high throughput -- The compactness of interval routing for almost all graphs -- A wait-free classification of loop agreement tasks -- A stabilizing repair timer -- Java: Memory consistency and process coordination -- A complete and constant time wait-free implementation of CAS from LL/SC and vice versa -- Failure detection and consensus in the crash-recovery model -- A more committed quorum-based three phase commit protocol -- Multicast group communication as a base for a load-balancing replicated data service -- Efficient deadlock-free multi-dimensional interval routing in interconnection networks -- A new protocol for efficient cooperative transversal Web caching -- Fairness of shared objects -- Optimistic Atomic Broadcast -- Approximate agreement with mixed mode faults: Algorithm and lower bound -- Using remote access histories for thread scheduling in distributed shared memory systems -- The Bancomat problem: An example of resource allocation in a partitionable asynchronous system -- Lifetime based consistency protocols for distributed objects -- Deriving a scalable algorithm for mutual exclusion -- OFC: A distributed fossil-collection algorithm for Time-Warp. 330 $aThis book constitutes the refereed proceedings of the 12th International Symposium on Distributed Computing, DISC'98, held in Andros, Greece, in September 1998. The 28 revised papers presented were carefully reviewed and selected from a total of 87 submissions. Also included are one invited paper and two abstracts of invited contributions. The papers address all currect issues of distributed systems, in particular Internet-based computing, shared-memory systems, ATM networks, security aspects, Java process coordination, network protocols, wait-free systems, shared objects, resource allocation, and distributed objects. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1499 606 $aComputer communication systems 606 $aComputers 606 $aSoftware engineering 606 $aAlgorithms 606 $aComputer programming 606 $aComputer Communication Networks$3https://scigraph.springernature.com/ontologies/product-market-codes/I13022 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aProgramming Techniques$3https://scigraph.springernature.com/ontologies/product-market-codes/I14010 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 615 0$aComputer communication systems. 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aComputer programming. 615 14$aComputer Communication Networks. 615 24$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aProgramming Techniques. 615 24$aComputation by Abstract Devices. 676 $a004/.36 702 $aKutten$b Shay$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aDISC '98 906 $aBOOK 912 $a996466122903316 996 $aDistributed computing$9104445 997 $aUNISA LEADER 01025nam a2200265 i 4500 001 991001682269707536 008 120420s2012 caua b 001 0 eng 020 $a9781412999441 (pbk. : acid-free paper) 020 $a1412999448 (pbk. : acid-free paper) 035 $ab14052854-39ule_inst 040 $aFacoltà SSPT$bita 082 0 $a364.30973$223 245 00$aAbout criminals :$ba view of the offenders' world /$cedited by Mark R. Pogrebin 250 $a2nd ed 260 $aThousand Oaks, Calif. :$bSAGE Publications,$cc2012 300 $axi, 347 p. :$bill. ;$c26 cm 504 $aContiene riferimenti bibliografici 650 4$aCriminali$xComportamento$zStati Uniti d'America 700 1 $aPogrebin, Mark 907 $a.b14052854$b02-04-14$c20-04-12 912 $a991001682269707536 945 $aLE021 364.30 POG01.01$g1$i2020000041467$lle021$op$pE54.95$q-$rn$s- $t0$u0$v0$w0$x0$y.i15426208$z20-06-12 996 $aAbout criminals$9238081 997 $aUNISALENTO 998 $ale020$b20-04-12$cm$da $e-$feng$gcau$h0$i0 LEADER 01349nam 2200397 450 001 9910704150203321 005 20160229071345.0 035 $a(CKB)5470000002438163 035 $a(OCoLC)941762139 035 $a(EXLCZ)995470000002438163 100 $a20160229d2013 ua 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aCARD Act report $ea review of the impact of the CARD Act on the consumer credit card market 210 1$a[Washington, D.C.] :$cConsumer Financial Protection Bureau,$d2013. 215 $a1 online resource (102 pages) $ccolor illustrations 300 $aTitle from title screen (viewed Dec. 31, 2015). 300 $a"October 1, 2013." 320 $aIncludes bibliographical references (pages 97-102). 517 $aCARD Act report 606 $aCredit cards$zUnited States 606 $aConsumer credit$zUnited States 606 $aConsumer credit$xLaw and legislation$zUnited States 615 0$aCredit cards 615 0$aConsumer credit 615 0$aConsumer credit$xLaw and legislation 712 02$aUnited States.$bConsumer Financial Protection Bureau, 801 0$bGPO 801 1$bGPO 906 $aBOOK 912 $a9910704150203321 996 $aCARD Act report$93459416 997 $aUNINA