LEADER 04874nam 2200661Ia 450 001 9910455969903321 005 20200520144314.0 010 $a1-280-21210-1 010 $a9786610212101 010 $a0-309-54363-0 010 $a0-585-14444-3 035 $a(CKB)110986584751012 035 $a(EBL)3377046 035 $a(SSID)ssj0000144571 035 $a(PQKBManifestationID)11160324 035 $a(PQKBTitleCode)TC0000144571 035 $a(PQKBWorkID)10146478 035 $a(PQKB)11398257 035 $a(MiAaPQ)EBC3377046 035 $a(Au-PeEL)EBL3377046 035 $a(CaPaEBR)ebr10063006 035 $a(CaONFJC)MIL21210 035 $a(OCoLC)940510383 035 $a(EXLCZ)99110986584751012 100 $a19900907d1990 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aEffectiveness and outcomes in health care$b[electronic resource] $eproceedings of an invitational conference by the Institute of Medicine, Division of Health Care Services /$fKim A. Heithoff and Kathleen N. Lohr, editors 210 $aWashington, D.C. $cNational Academy Press$d1990 215 $a1 online resource (245 p.) 300 $aDescription based upon print version of record. 311 $a0-309-07882-2 311 $a0-309-04342-5 320 $aIncludes bibliographical references. 327 $aEffectiveness and Outcomes in Health Care; Copyright; ACKNOWLEDGMENTS; PREFACE; EFFECTIVENESS VERSUS EFFICACY; METHODOLOGIES; IMPACT UPON COSTS; RISK ADJUSTMENTS AND OUTCOMES; CONCLUSIONS; Contents; PART I INTRODUCTION; 1 Genesis of the Effectiveness Initiative and IOM's Role; THE BROADER CONTEXT; The Institute of Medicine's Contribution; The IOM Clinical Workshop; The Condition-Specific Workshops; Effectiveness and Outcomes Conference; Proceedings; 2 Promise and Limitations of Effectiveness and Outcomes Research; IMPORTANCE OF EFFECTIVENESS RESEARCH; Medicare Data Bases 327 $aKEY ASPECTS OF EFFECTIVENESS RESEARCHReliability and Validity of Data; Longitudinal Studies; Tracking the Patient; Health Status Assessment; Risk Stratification; Prevention; The Aging Process; PRINCIPLES TO GUIDE FEDERAL EFFORTS; Range of Study Designs; Funding; Balance of Approaches; Coordination; Technology Assessment; Influencing Provider Behavior; The Confluence of Biomedical, Health Services, and Effectiveness Research; PART II OVERVIEW; 3 Research on the Effectiveness of Medical Treatment: New Challenges and Opportunities; Medical Treatment Effectiveness Program 327 $aImplementation of the ProgramPriorities for Research; New Patterns of Collaboration; References; 4 The Health Care Financing Administration and the Effectiveness Initiative; HCFA'S INTEREST IN EFFECTIVENESS; THE EFFECTIVENESS INITIATIVE; FUTURE ACTIVITIES; ACKNOWLEDGEMENTS; 5 The Effectiveness Initiative: Retrospective and Prospects; THE GOVERNMENT'S ROLE IN EFFECTIVENESS RESEARCH; PROSPECTS; 6 The Social Perspective; THE PRESENT SCENARIO; COSTS OF HEALTH CARE; VARIATIONS IN MEDICAL COSTS AND PRACTICE; REASONS FOR THE EFFECTIVENESS INITIATIVE 327 $aHOW TO PROCEED IN EFFECTIVENESS AND OUTCOMES RESEARCH7 The Clinical Perspective; ISSUES IN THE USEFULNESS OF EFFECTIVENESS RESEARCH; MEETING PHYSICIANS' NEEDS; Accessibility of Results; Aiding Patient Invol Vement; Relation to Payment Mechanisms; Unbalanced Regulation; IMPACT OF THE EFFECTIVENESS INITIATIVE; Reference; 8 The Legislative Perspective; UNMET HEALTH CARE NEEDS; GROWING AWARENESS OF EFFECTIVENESS RESEARCH; THE CHALLENGE TO SCIENTISTS; CONCLUSION; PART III THE IOM CLINICAL CONDITION WORKSHOPS; The IOM Condition Workshops: Introduction; 9 Breast Cancer 327 $aTHE PROBLEM OF POOR COMPLIANCECONTROVERSIES; Screening; Treatment; THE ROLE OF EFFECTIVENESS STUDIES IN BREAST CANCER; References; 10 Hip Fracture; PREVENTION; TREATMENT; IN-HOSPITAL CARE; REHABILITATION; CONCLUSION; 11 Claims Data and Effectiveness: Acute Myocardial Infarction and Other Examples; STRENGTHS OF CLAIMS DATA; GENERAL LIMITATIONS; Limitations for Diagnostic Devices; Limitations for Drugs; Limitations for Therapies; CONCLUSION; References; PART IV METHODOLOGICAL ISSUES AND WORK IN PROGRESS; Use of Large Data Bases: Introduction 327 $a12 The Role of Large Data Bases in Effectiveness Research 606 $aMedical care$xEvaluation$xResearch$vCongresses 606 $aMedicare$vCongresses 608 $aElectronic books. 615 0$aMedical care$xEvaluation$xResearch 615 0$aMedicare 676 $a362.1/028/7 701 $aHeithoff$b Kim A$0929025 701 $aLohr$b Kathleen N.$f1941-$0873647 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910455969903321 996 $aEffectiveness and outcomes in health care$92087898 997 $aUNINA LEADER 05818nam 22007335 450 001 996465884803316 005 20230405233907.0 024 7 $a10.1007/11537311 035 $a(CKB)1000000000213173 035 $a(SSID)ssj0000317846 035 $a(PQKBManifestationID)11240626 035 $a(PQKBTitleCode)TC0000317846 035 $a(PQKBWorkID)10296036 035 $a(PQKB)10872451 035 $a(DE-He213)978-3-540-31873-6 035 $a(MiAaPQ)EBC3067899 035 $a(PPN)123096642 035 $a(EXLCZ)991000000000213173 100 $a20100721d2005 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aFundamentals of Computation Theory$b[electronic resource] $e15th International Symposium, FCT 2005, Lübeck, Gemany, August 17-20, 2005, Proceedings /$fedited by Maciej Liskiewicz, Rüdiger Reischuk 205 $a1st ed. 2005. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005. 215 $a1 online resource (XVI, 580 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3623 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-31873-9 311 $a3-540-28193-2 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- The Complexity of Querying External Memory and Streaming Data -- The Smoothed Analysis of Algorithms -- Path Coupling Using Stopping Times -- Circuits -- On the Incompressibility of Monotone DNFs -- Bounds on the Power of Constant-Depth Quantum Circuits -- Automata I -- Biautomatic Semigroups -- Deterministic Automata on Unranked Trees -- Complexity I -- Decidable Membership Problems for Finite Recurrent Systems over Sets of Naturals -- Generic Density and Small Span Theorem -- Approximability -- Logspace Optimization Problems and Their Approximability Properties -- A Faster and Simpler 2-Approximation Algorithm for Block Sorting -- Computational and Structural Complexity -- On the Power of Unambiguity in Alternating Machines -- Translational Lemmas for Alternating TMs and PRAMs -- Collapsing Recursive Oracles for Relativized Polynomial Hierarchies -- Graphs and Complexity -- Exact Algorithms for Graph Homomorphisms -- Improved Algorithms and Complexity Results for Power Domination in Graphs -- Clique-Width for Four-Vertex Forbidden Subgraphs -- Computational Game Theory -- On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems -- Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems -- Visual Cryptography and Computational Geometry -- Perfect Reconstruction of Black Pixels Revisited -- Adaptive Zooming in Point Set Labeling -- Query Complexity -- On the Black-Box Complexity of Sperner?s Lemma -- Property Testing and the Branching Program Size of Boolean Functions -- Distributed Systems -- Almost Optimal Explicit Selectors -- The Delayed k-Server Problem -- Automata and Formal Languages -- Leftist Grammars and the Chomsky Hierarchy -- Shrinking Multi-pushdown Automata -- Graph Algorithms -- A Simple and Fast Min-cut Algorithm -- (Non)-Approximability for the Multi-criteria TSP(1,2) -- Semantics -- Completeness and Compactness of Quantitative Domains -- A Self-dependency Constraint in the Simply Typed Lambda Calculus -- A Type System for Computationally Secure Information Flow -- Approximation Algorithms -- Algorithms for Graphs Embeddable with Few Crossings Per Edge -- Approximation Results for the Weighted P 4 Partition Problems -- The Maximum Resource Bin Packing Problem -- Average-Case Complexity -- Average-Case Non-approximability of Optimisation Problems -- Relations Between Average-Case and Worst-Case Complexity -- Algorithms -- Reconstructing Many Partitions Using Spectral Techniques -- Constant Time Generation of Linear Extensions -- Complexity II -- On Approximating Real-World Halting Problems -- An Explicit Solution to Post?s Problem over the Reals -- The Complexity of Semilinear Problems in Succinct Representation -- Graph Algorithms -- On Finding Acyclic Subhypergraphs -- An Improved Approximation Algorithm for TSP with Distances One and Two -- New Applications of Clique Separator Decomposition for the Maximum Weight Stable Set Problem -- Automata II -- On the Expressiveness of Asynchronous Cellular Automata -- Tree Automata and Discrete Distributed Games -- Pattern Matching -- A New Linearizing Restriction in the Pattern Matching Problem -- Fully Incremental LCS Computation. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3623 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aTheory of Computation 606 $aAlgorithms 606 $aFormal Languages and Automata Theory 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aFormal Languages and Automata Theory. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a004 702 $aLiskiewicz$b Maciej$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aReischuk$b Rüdiger$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996465884803316 996 $aFundamentals of Computation Theory$92557870 997 $aUNISA LEADER 01734nam 2200493 450 001 996464542003316 005 20231110222312.0 010 $a3-030-97131-7 035 $a(MiAaPQ)EBC6897031 035 $a(Au-PeEL)EBL6897031 035 $a(CKB)21325693700041 035 $a(PPN)260825506 035 $a(EXLCZ)9921325693700041 100 $a20221007d2022 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aPublic-key cryptography - PKC 2022 $e25th IACR international conference on practice and theory of public-key cryptography, virtual event, March 8-11, 2022, proceedings, part II /$fedited by Goichiro Hanaoka, Junji Shikata and Yohei Watanabe 210 1$aCham, Switzerland :$cSpringer,$d[2022] 210 4$dİ2022 215 $a1 online resource (538 pages) 225 1 $aLecture Notes in Computer Science ;$vv.13178 311 08$aPrint version: Hanaoka, Goichiro Public-Key Cryptography - PKC 2022 Cham : Springer International Publishing AG,c2022 9783030971304 320 $aIncludes bibliographical references and index. 410 0$aLecture Notes in Computer Science 606 $aApplication software 606 $aCoding theory 606 $aPublic key cryptography 615 0$aApplication software. 615 0$aCoding theory. 615 0$aPublic key cryptography. 676 $a005.824 702 $aWatanabe$b Yohei 702 $aHanaoka$b Goichiro 702 $aShikata$b Junji 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464542003316 996 $aPublic-key cryptography - PKC 2022$92920090 997 $aUNISA