LEADER 03715nam 2200649 450 001 9910460275303321 005 20211011203550.0 010 $a1-4426-3219-4 024 7 $a10.3138/9781442632196 035 $a(CKB)3710000000421843 035 $a(EBL)3432180 035 $a(OCoLC)929153891 035 $a(SSID)ssj0001559091 035 $a(PQKBManifestationID)16185866 035 $a(PQKBTitleCode)TC0001559091 035 $a(PQKBWorkID)14819968 035 $a(PQKB)11691527 035 $a(MiAaPQ)EBC4669439 035 $a(DE-B1597)465785 035 $a(OCoLC)1013939122 035 $a(OCoLC)944178727 035 $a(DE-B1597)9781442632196 035 $a(Au-PeEL)EBL4669439 035 $a(CaPaEBR)ebr11255972 035 $a(OCoLC)958578105 035 $a(EXLCZ)993710000000421843 100 $a20160920h19821982 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aInside out $ethe social meaning of mental retardation /$fRobert Bogdan and Steven J. Taylor 210 1$aToronto, [Ontario] ;$aBuffalo, [New York] ;$aLondon, [England] :$cUniversity of Toronto Press,$d1982. 210 4$dİ1982 215 $a1 online resource (247 p.) 225 0 $aHeritage 300 $aDescription based upon print version of record. 311 $a1-4426-5206-3 320 $aIncludes bibliographical references. 327 $tFrontmatter --$tContents --$tForeword /$rSarason, Seymour B. --$tAcknowledgments --$tPreface --$t1. Introduction --$t2. The Life Histories --$t3. Conclusion --$tBibliography --$tBackmatter 330 $a'We have to assume that the mind is working no matter what it looks like on the outside. We can't just judge by appearance...If you take away the label they are human beings.' Ed MurphyWhat does it mean to be 'mentally retarded'? Professors Bogdan and Taylor have interviewed two experts, 'Ed Murphy' and 'Pattie Burt,' for answers. Ed and Pattie, former inmates of institutions for the retarded, tell us in their own words.Their autobiographies are not always pleasant reading. They describe the physical, mental, and emotional abuses heaped upon them throughout their youth and young adulthood; being spurned, neglected, and ultimately abandoned by family and friends; being labelled and stigmatized by social service professionals armed with tests and preconceptions; being incarcerated and depersonalized by the state.Ed and Pattie survived these experiences-evidence, perhaps, of the indefatigable will of the human spirit to assert its essential humanity-but the wounds they have suffered, and the scars they bear, have not been overcome. They are now contributing, independent, members of society, but the stigma of 'mental retardation' remains.Their stories are both true and representative-powerful indictments of our knowledge of, our thinking about, and our ministrations to, the mentally handicapped. The interviewers argue that Ed and Pattie challenge the very concept of 'mental retardation.' Retardation, they assert, is an 'imaginary disease'; our attempts to 'cure' it are a hoax.Read Ed's and Pattie's accounts and judge for yourself. 606 $aIntellectual disability$xSocial aspects 606 $aPeople with mental disabilities$vCase studies 608 $aElectronic books. 615 0$aIntellectual disability$xSocial aspects. 615 0$aPeople with mental disabilities 676 $a362.3/092/2 700 $aBogdan$b Robert$0124273 702 $aTaylor$b Steven J.$f1949- 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910460275303321 996 $aInside out$91983410 997 $aUNINA LEADER 08000nam 2200685 450 001 9910830315203321 005 20240219134710.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(OCoLC)181348311 035 $a(PPN)255939876 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$01619514 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910830315203321 996 $aAn introduction to communication network analysis$93951798 997 $aUNINA