LEADER 02788nam 2200625I 450 001 9910456370703321 005 20200520144314.0 010 $a0-429-25267-6 010 $a1-282-61553-X 010 $a9786612615535 010 $a1-4441-1313-5 035 $a(CKB)2550000000013278 035 $a(EBL)564660 035 $a(OCoLC)650076817 035 $a(SSID)ssj0000416212 035 $a(PQKBManifestationID)11306708 035 $a(PQKBTitleCode)TC0000416212 035 $a(PQKBWorkID)10421541 035 $a(PQKB)10622044 035 $a(MiAaPQ)EBC4634467 035 $a(MiAaPQ)EBC564660 035 $a(Au-PeEL)EBL564660 035 $a(CaPaEBR)ebr11164926 035 $a(CaONFJC)MIL261553 035 $a(EXLCZ)992550000000013278 100 $a20180611h20122009 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aDrug calculations for nurses: a step-by-step approach /$fby Robert Lapham and Heather Agar 205 $aThird edition. 210 1$aBoca Raton, FL :$cCRC Press, an imprint of Taylor and Francis,$d[2012]. 210 4$dİ2009. 215 $a1 online resource (265 p.) 300 $aPrevious ed.: London: Arnold, 2003. 311 $a0-340-98733-2 320 $aIncludes bibliographical references and index. 327 $apt. 1. Mathematics -- pt. 2. Performing calculations -- pt. 3. Administering medicines. 330 3 $aThis best-selling pocket-sized book helps youperform drug calculations with confidence and competence.The completely updated third editionincludes community practice and primary caresettings, and a whole new section on pharmacology and medicines to put drug calculations into context.Starting with the basic mathematical skills required for calculations, including tips on using calculators and estimating answers, Drug Calculations for Nurses progresses to give you an understanding of basic pharmacokinetics and therapeutics.It also covers howdrugs work in specific groups such as children and the elderly. The book takes you throughstep-by-step drug calculations with units and drug strengths clearly explained. Pre-test and a revisionquestions allow you to test andbe confidentin the skills you have acquired. 606 $aPharmaceutical arithmetic$vProblems, exercises, etc 606 $aNursing$xMathematics$vProblems, exercises, etc 608 $aElectronic books. 615 0$aPharmaceutical arithmetic 615 0$aNursing$xMathematics 676 $a615.14 700 $aLapham$b Robert$0861343 702 $aAgar$b Heather 801 0$bFlBoTFG 801 1$bFlBoTFG 906 $aBOOK 912 $a9910456370703321 996 $aDrug calculations for nurses: a step-by-step approach$91922385 997 $aUNINA LEADER 06551nam 22008415 450 001 9910483010903321 005 20251226195609.0 010 $a3-540-30576-9 024 7 $a10.1007/b106171 035 $a(CKB)1000000000212845 035 $a(SSID)ssj0000258174 035 $a(PQKBManifestationID)11196207 035 $a(PQKBTitleCode)TC0000258174 035 $a(PQKBWorkID)10256051 035 $a(PQKB)10356784 035 $a(DE-He213)978-3-540-30576-7 035 $a(MiAaPQ)EBC3068329 035 $a(PPN)123092035 035 $a(EXLCZ)991000000000212845 100 $a20100704d2005 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheory of Cryptography $eSecond Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12. 2005, Proceedings /$fedited by Joe Kilian 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XII, 628 p.) 225 1 $aSecurity and Cryptology,$x2946-1863 ;$v3378 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-24573-1 320 $aIncludes bibliographical references and index. 327 $aHardness Amplification and Error Correction -- Optimal Error Correction Against Computationally Bounded Noise -- Hardness Amplification of Weakly Verifiable Puzzles -- On Hardness Amplification of One-Way Functions -- Graphs and Groups -- Cryptography in Subgroups of -- Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs -- Simulation and Secure Computation -- Comparing Two Notions of Simulatability -- Relaxing Environmental Security: Monitored Functionalities and Client-Server Computation -- Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs -- Security of Encryption -- Adaptively-Secure, Non-interactive Public-Key Encryption -- Adaptive Security of Symbolic Encryption -- Chosen-Ciphertext Security of Multiple Encryption -- Steganography and Zero Knowledge -- Public-Key Steganography with Active Attacks -- Upper and Lower Bounds on Black-Box Steganography -- Fair-Zero Knowledge -- Secure Computation I -- How to Securely Outsource Cryptographic Computations -- Secure Computation of the Mean and Related Statistics -- Keyword Search and Oblivious Pseudorandom Functions -- Secure Computation II -- Evaluating 2-DNF Formulas on Ciphertexts -- Share Conversion, Pseudorandom Secret-Sharing and Applications to Secure Computation -- Toward Privacy in Public Databases -- Quantum Cryptography and Universal Composability -- The Universal Composable Security of Quantum Key Distribution -- Universally Composable Privacy Amplification Against Quantum Adversaries -- A Universally Composable Secure Channel Based on the KEM-DEM Framework -- Cryptographic Primitives and Security -- Sufficient Conditions for Collision-Resistant Hashing -- The Relationship Between Password-Authenticated Key Exchange and Other Cryptographic Primitives -- On the Relationships Between Notions of Simulation-Based Security -- Encryption and Signatures -- A New Cramer-Shoup Like Methodology for Group Based Provably Secure Encryption Schemes -- Further Simplifications in Proactive RSA Signatures -- Proof of Plaintext Knowledge for the Ajtai-Dwork Cryptosystem -- Information Theoretic Cryptography -- Entropic Security and the Encryption of High Entropy Messages -- Error Correction in the Bounded Storage Model -- Characterizing Ideal Weighted Threshold Secret Sharing. 330 $aTCC 2005, the 2nd Annual Theory of Cryptography Conference, was held in Cambridge,Massachusetts,onFebruary10?12,2005.Theconferencereceived84 submissions,ofwhichtheprogramcommitteeselected32forpresentation.These proceedings contain the revised versions of the submissions that were presented at the conference. These revisions have not been checked for correctness, and the authors bear full responsibility for the contents of their papers. The conference program also included a panel discussion on the future of theoretical cryptography and its relationship to the real world (whatever that is). It also included the traditional ?rump session,? featuring short, informal talks on late-breaking research news. Much as hatters of old faced mercury-induced neurological damage as an occupational hazard, computer scientists will on rare occasion be a?icted with egocentrism, probably due to prolonged CRT exposure. Thus, you must view withpityandnotcontemptmyunalloyedelationathavingmynameonthefront cover of this LNCS volume, and my deep-seated conviction that I fully deserve the fame and riches that will surely come of it. However, having in recent years switched over to an LCD monitor, I would like to acknowledge some of the many who contributed to this conference. First thanks are due to the many researchers from all over the world who submitted their work to this conference. Lacking shrimp and chocolate-covered strawberries, TCC has to work hard to be a good conference. As a community, I think we have. 410 0$aSecurity and Cryptology,$x2946-1863 ;$v3378 606 $aCryptography 606 $aData encryption (Computer science) 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aOperating systems (Computers) 606 $aElectronic data processing$xManagement 606 $aComputers and civilization 606 $aCryptology 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aOperating Systems 606 $aIT Operations 606 $aComputers and Society 615 0$aCryptography. 615 0$aData encryption (Computer science) 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aOperating systems (Computers) 615 0$aElectronic data processing$xManagement. 615 0$aComputers and civilization. 615 14$aCryptology. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aOperating Systems. 615 24$aIT Operations. 615 24$aComputers and Society. 676 $a005.8 701 $aKilian$b Joe$0746783 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483010903321 996 $aTheory of cryptography$94197037 997 $aUNINA