LEADER 07999nam 2200685 450 001 9910143570503321 005 20221206105603.0 010 $a1-280-93525-1 010 $a9786610935253 010 $a0-470-16868-4 010 $a0-470-16867-6 024 7 $a10.1002/9780470168684 035 $a(CKB)1000000000355814 035 $a(EBL)309751 035 $a(SSID)ssj0000182448 035 $a(PQKBManifestationID)11167763 035 $a(PQKBTitleCode)TC0000182448 035 $a(PQKBWorkID)10172250 035 $a(PQKB)10281900 035 $a(MiAaPQ)EBC309751 035 $a(CaBNVSL)mat05201523 035 $a(IDAMS)0b0000648104a9d5 035 $a(IEEE)5201523 035 $a(PPN)255939140 035 $a(OCoLC)181348311 035 $a(EXLCZ)991000000000355814 100 $a20071115h20152007 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 13$aAn introduction to communication network analysis /$fGeorge Kesidis 210 1$aHoboken, New Jersey :$cWiley-Interscience,$dc2007. 215 $a1 online resource (248 p.) 300 $aDescription based upon print version of record. 311 $a0-471-37141-6 320 $aIncludes bibliographical references (p. 221-232). 327 $aPreface -- 1. Review of Elementary Probability Theory -- 1.1 Sample space, events and probabilities -- 1.2 Random variables -- 1.3 Cumulative distribution functions, expectation and moment generating functions -- 1.4 Discretely distributed random variables -- 1.4.1 The Bernoulli distribution -- 1.4.2 The geometric distribution -- 1.4.3 The binomial distribution -- 1.4.4 The Poisson distribution -- 1.4.5 The discrete uniform distribution -- 1.5 Continuously distributed random variables -- 1.5.1 The continuous uniform distribution -- 1.5.2 The exponential distribution -- 1.5.3 The gamma distribution -- 1.5.4 The Gaussian (or normal) distribution -- 1.6 Some useful inequalities -- 1.7 Joint distribution functions -- 1.7.1 Joint PDF -- 1.7.2 Marginalizing a joint distribution -- 1.8 Conditional expectation -- 1.9 Independent random variables -- 1.9.1 Sums of independent random variables -- 1.10 Conditional independence -- 1.11 A law of large numbers -- 1.12 First order autoregressive estimators -- 1.13 Measures of separation between distributions -- 1.14 Statistical confidence -- 1.14.1 A central limit theorem -- 1.14.2Confidence intervals -- 1.14.3Recursive formulas and a stopping criterion -- 1.15 Deciding between two alternative claims -- Problems -- 2. Markov Chains -- 2.1 Memoryless property of the exponential distribution -- 2.2 Finite dimensional distributions and stationarity -- 2.3 The Poisson (counting) process on R+ -- 2.4 Continuous-time, time-homogeneous, Markov processes with countable state-space -- 2.4.1 The Markov property -- 2.4.2 Sample-path construction of a time-homogeneous, continuous-time Markov chain -- 2.4.3 The transition rate matrix and transition rate diagram -- 2.4.4 The Kolmogorov equations -- 2.4.5 The balance equations for the stationary distribution -- 2.4.6 Transience and recurrence -- 2.4.7 Convergence in distribution to steady-state -- 2.4.8 Time-reversibility and the detailed balance equation 327 $a2.5 Birth-death Markov chains -- 2.5.1 Birth-death processes with finite state-space -- 2.5.2 Birth-death processes with infinite state-space -- 2.5.3 Applications of forward equations -- 2.6 Modeling time-series data using a Markov chain -- 2.7 Simulating a Markov chain -- 2.8 Overview of discrete-time Markov chains -- 2.9 Martingales adapted to discrete-time Markov chains -- Problems -- 3. Introduction to Queueing Theory -- 3.1 Arrivals, departures and queue occupancy -- 3.2 Lossless queues -- 3.2.1 No waiting room -- 3.2.2 Single-server queue -- 3.2.3 Single-server and constant service times -- 3.2.4 Single-server and general service times -- 3.3 A queue described by an underlying Markov chain -- 3.4 Stationary queues -- 3.4.1 Point processes and queues on R -- 3.4.2 Stationary and synchronous versions of a marked point process -- 3.4.3 Poisson arrivals see time-averages -- 3.4.4 Little's result -- 3.5 Erlang's blocking formula for the M/M/K/K queue -- 3.6 Overview of discrete-time queues -- Problems -- 4. Local Multiplexing -- 4.1 Internet router architecture -- 4.1.1 Big picture of an IP (layer 3) router -- 4.1.2 Ingress linecard -- 4.1.3 Switch fabric -- 4.1.4 Egress linecard -- 4.2 Token (leaky) buckets for packet-traffic regulation -- 4.3 Multiplexing flows of variable-length packets -- 4.3.1 Multiplexing with a single FIFO queue -- 4.3.2 Strict priority -- 4.3.3 Deficit Round-Robin (DRR) -- 4.3.4 Shaped Virtual Clock (SVC) -- 4.4 Service curves -- 4.5 Connection multiplexing on a single trunk -- 4.6 A game-theoretic framework for multiplexing packet flows -- 4.7 Discussion: local medium access control of a single wireless channel -- Problems -- 5. Queueing networks with static routing -- 5.1 Loss Networks -- 5.1.1 Fixed route arrival rates -- 5.1.2 Exact expression for connection blocking -- 5.1.3 Fixed point iteration for approximate connection blocking -- 5.2 Stable open networks of queues -- 5.2.1 Flow balance equation 327 $a5.2.2 Open Jackson networks -- Problems -- 6. Dynamic Routing and Routing with Incentives -- 6.1 General routing issues -- 6.1.1 Discussion: IP forwarding -- 6.1.2 Discussion: MPLS -- 6.2 Unconstrained optimization -- 6.3 Revenue maximization for loss networks -- 6.4 Constrained optimization and duality -- 6.5 A distributed pricing and resource management framework -- 6.6 Discussion: joint scheduling and routing in multihop wireless networks -- 6.7 Multipath load balancing -- Problems -- 7. Peer-to-Peer File Sharing with Incentives -- 7.1 Summary of query resolution -- 7.2 Unstructured query resolution -- 7.2.1 A centralized approach -- 7.2.2 A decentralized approach: limited-scope flooding and reverse-path forwarding -- 7.2.3 A hybrid approach -- 7.2.4 An example of search by random walk -- 7.3 Structured query resolution -- 7.3.1 A "Voronoi" structured P2P framework -- 7.3.2 Specific Voronoi approaches -- 7.3.3 Variations in the design of search, including Chord -- 7.3.4 The Kademlia example -- 7.3.5 Spatial neighbor-to-neighbor graphs -- 7.4 Discussion: security issues -- 7.5 Incentives for cooperation when downloading -- 7.5.1 Rule-based incentives of BitTorrent-like swarms -- 7.5.2 Cumulative reputations -- 7.5.3 Trust groups for scalability and reliability -- 7.5.4 Discussion: P2P games -- Problems -- References -- Appendix A: Additional Background on Routing -- A.1 Network graph terminology -- A.2 Link-state algorithms -- A.3 The Bellman-Ford approach -- Appendix B: Solutions or References for Selected Problems -- Reference 330 $aThis book is a quantitative text, which focuses on the real issues behind serious modeling and analysis of communications networks. The author covers all the necessary mathematics and theory in order for students to understand the tools that optimize computer networks today. . Covers both classical (e.g. queueing theory) and modern (e.g. pricing) aspects of networking. Integrates material on communication networks with material on modeling/analyzing and designing such networks. Includes a Solution Manual 517 3 $aCommunication network analysis 606 $aTelecommunication$xTraffic$vTextbooks 606 $aNetwork performance (Telecommunication)$vTextbooks 606 $aSwitching theory$vTextbooks 615 0$aTelecommunication$xTraffic 615 0$aNetwork performance (Telecommunication) 615 0$aSwitching theory 676 $a004.6 676 $a621.382/1 676 $a621.3821 700 $aKesidis$b George$0959818 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910143570503321 996 $aAn introduction to communication network analysis$92175301 997 $aUNINA LEADER 00909nam a22002411i 4500 001 991000860469707536 005 20021102083256.0 008 021102s1953 it |||||||||||||||||ita 035 $ab12065663-39ule_inst 035 $aARCHE-015546$9ExL 040 $aDip.to Filologia Ling. e Lett.$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 100 1 $aOriani, Alfredo$0136975 245 13$aLa disfatta /$cdi Alfredo Oriani 250 $aEd. integrale 260 $a[Milano] :$bArnoldo Mondadori editore,$c1953 300 $a308 p. ;$c19 cm 490 0 $aBiblioteca moderna Mondadori.$pNuova serie ;$v358-359 907 $a.b12065663$b28-04-17$c01-04-03 912 $a991000860469707536 945 $aLE008 TS F VIII 19$g1$i2008000330439$lle008$o-$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i12362128$z01-04-03 996 $aDisfatta$999196 997 $aUNISALENTO 998 $ale008$b01-04-03$cm$da $e-$fita$git $h3$i1 LEADER 02717nam 2200721 450 001 9910789643103321 005 20210311111955.0 010 $a1-350-21840-5 010 $a1-84813-911-X 010 $a1-283-23861-6 010 $a9786613238610 010 $a1-84813-910-1 024 7 $a10.5040/9781350218406 035 $a(CKB)2670000000113597 035 $a(OCoLC)748242110 035 $a(CaPaEBR)ebrary10500250 035 $a(SSID)ssj0000542954 035 $a(PQKBManifestationID)11367155 035 $a(PQKBTitleCode)TC0000542954 035 $a(PQKBWorkID)10518826 035 $a(PQKB)10453540 035 $a(MiAaPQ)EBC765177 035 $a(Au-PeEL)EBL765177 035 $a(CaPaEBR)ebr10500250 035 $a(CaONFJC)MIL323861 035 $a(CaBNVSL)9781350218406 035 $a(EXLCZ)992670000000113597 100 $a20210311h20212011 uy 0 101 0 $aeng 135 $aurcn||||||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAl-Qaeda $efrom global network to local franchise /$fChristina Hellmich 210 1$aLondon, England :$cZed Books,$d2011. 210 2$a[London, England] :$cBloomsbury Publishing,$d2021 215 $a1 online resource (223 p.) 225 1 $aRebels 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a1-84813-908-X 311 $a1-84813-909-8 320 $aIncludes bibliographical references (pages 169-206) and index. 327 $a9/11 and the anxious search for answers -- What is al-Qaeda? From Afghanistan to 9/11 -- Hypocrites, Wahhabis and Salafi jihadis: post-9/11 explanations of al-Qaeda's ideology -- Reclaiming the umma: the ideology of al-Qaeda in the context of the pan-Islamic tradition -- Al-Qaeda post-9/11: destroyed, weakened or re-emergent? -- The future of al-Qaeda. 330 $a"Christina Hellmich forensically examines the most authoritative sources on which the present understanding of al-Qaeda relies, examining the discrepancies between what is reported and what can realistically be known"--Publisher. 410 0$aRebels (Halifax, N.S.) 606 $aTerrorism$zMiddle East 606 $aTerrorism$xReligious aspects$xIslam 606 $aTerrorism$xPrevention 606 $aPolitical science & theory$2bicssc 615 0$aTerrorism 615 0$aTerrorism$xReligious aspects$xIslam. 615 0$aTerrorism$xPrevention. 615 7$aPolitical science & theory 676 $a303.62509 676 $a973.931 700 $aHellmich$b Christina$f1978-$01503533 801 0$bEBLCP 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910789643103321 996 $aAl-Qaeda$93732014 997 $aUNINA LEADER 02135oam 2200517 450 001 9910792405003321 005 20170523091559.0 010 $a1-4166-1235-1 010 $a1-282-52534-4 010 $a9786612525346 010 $a1-4166-1019-7 010 $a1-4166-1021-9 010 $a1-4166-1022-7 035 $a(OCoLC)647914938 035 $a(MiFhGG)GVRL4MGA 035 $a(EXLCZ)992670000000018499 100 $a20090914d2010 uy 0 101 0 $aeng 135 $aurun|---uuuua 181 $ctxt 182 $cc 183 $acr 200 10$aInviting students to learn $e100 tips for talking effectively with your students /$fJenny Edwards 210 $aAlexandria, VA $cASCD$dc2010 210 1$aAlexandria, Va. :$cASCD,$d2010. 215 $a1 online resource (xxiii, 170 pages) 225 0 $aGale eBooks 300 $aDescription based on print version record. 311 $a1-4166-0903-2 320 $aIncludes bibliographical references and index. 327 $aCover; Title Page; Copyright; Table of Contents; Acknowledgments; Foreword; Preface; Introduction; Chapter 1: Developing a Mind-set for Communicating Invitationally with Students; Chapter 2: Arenas in Which the Language Tips Can Be Applied; Chapter 3: Strategies for Using the Language Tips with Various Types of Students; Chapter 4: Possible Purposes for Using the Language Tips; Chapter 5: 100 Tips for Talking Effectively with Your Students; References; Index; About the Author; Search this Book 330 $aCommunication tips, backed by research, to help teachers work with their students. Includes a wealth of specific examples. 606 $aCommunication in education 606 $aMotivation in education 606 $aTeacher-student relationships 615 0$aCommunication in education. 615 0$aMotivation in education. 615 0$aTeacher-student relationships. 676 $a371.102/2 700 $aEdwards$b Jenny$f1949-$01531912 801 0$bMiFhGG 801 1$bMiFhGG 906 $aBOOK 912 $a9910792405003321 996 $aInviting students to learn$93777873 997 $aUNINA