LEADER 03527nam 22006614a 450 001 9910455244603321 005 20200520144314.0 010 $a1-282-15911-9 010 $a9786612159114 010 $a1-4008-2956-9 024 7 $a10.1515/9781400829569 035 $a(CKB)1000000000788592 035 $a(EBL)457848 035 $a(OCoLC)436089416 035 $a(SSID)ssj0000190889 035 $a(PQKBManifestationID)11171433 035 $a(PQKBTitleCode)TC0000190889 035 $a(PQKBWorkID)10201404 035 $a(PQKB)10641461 035 $a(MiAaPQ)EBC457848 035 $a(DE-B1597)446510 035 $a(OCoLC)979968441 035 $a(DE-B1597)9781400829569 035 $a(PPN)170248178 035 $a(Au-PeEL)EBL457848 035 $a(CaPaEBR)ebr10312537 035 $a(CaONFJC)MIL215911 035 $a(EXLCZ)991000000000788592 100 $a20020402d2003 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aLectures on the theory of games$b[electronic resource] /$fHarold W. Kuhn 205 $aCourse Book 210 $aPrinceton, N.J. $cPrinceton University Press$d2003 215 $a1 online resource (118 p.) 225 1 $aAnnals of mathematics studies ;$vno. 37 300 $aDescription based upon print version of record. 311 $a0-691-02771-4 311 $a0-691-02772-2 320 $aIncludes bibliographical references and index. 327 $tFrontmatter -- $tContents -- $tAuthor's Note -- $tPreface -- $tChapter 1. What Is the Theory of Games? -- $tChapter 2. Matrix Games -- $tChapter 3. Extensive Games -- $tChapter 4. Infinite Games -- $tIndex 330 $aThis book is a spectacular introduction to the modern mathematical discipline known as the Theory of Games. Harold Kuhn first presented these lectures at Princeton University in 1952. They succinctly convey the essence of the theory, in part through the prism of the most exciting developments at its frontiers half a century ago. Kuhn devotes considerable space to topics that, while not strictly the subject matter of game theory, are firmly bound to it. These are taken mainly from the geometry of convex sets and the theory of probability distributions. The book opens by addressing "matrix games," a name first introduced in these lectures as an abbreviation for two-person, zero-sum games in normal form with a finite number of pure strategies. It continues with a treatment of games in extensive form, using a model introduced by the author in 1950 that quickly supplanted von Neumann and Morgenstern's cumbersome approach. A final section deals with games that have an infinite number of pure strategies for the two players. Throughout, the theory is generously illustrated with examples, and exercises test the reader's understanding. A historical note caps off each chapter. For readers familiar with the calculus and with elementary matrix theory or vector analysis, this book offers an indispensable store of vital insights on a subject whose importance has only grown with the years. 410 0$aAnnals of mathematics studies ;$vno. 37. 606 $aGame theory 608 $aElectronic books. 615 0$aGame theory. 676 $a519.3 700 $aKuhn$b Harold W$g(Harold William),$f1925-$012823 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910455244603321 996 $aLectures on the theory of games$9145191 997 $aUNINA LEADER 01724oam 2200529 450 001 9910715040503321 005 20201120130737.0 035 $a(CKB)5470000002507600 035 $a(OCoLC)761457585 035 $a(EXLCZ)995470000002507600 100 $a20111115j196808 ua 0 101 0 $aeng 135 $aur||||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aNoncavitating and cavitating performance of two low-area-ratio water jet pumps with throat lengths of 5.66 diameters /$fby Nelson L. Sanger 210 1$aWashington, D.C. :$cNational Aeronautics and Space Administration,$dAugust 1968. 215 $a1 online resource (iv, 34 pages) $cillustrations 225 1 $aNASA technical note ;$vTN D-4759 300 $a"August 1968." 320 $aIncludes bibliographical references (page 34). 606 $aCavitation 606 $aJet nozzles 606 $aPumping machinery 606 $aCavitation$2fast 606 $aJet nozzles$2fast 606 $aPumping machinery$2fast 615 0$aCavitation. 615 0$aJet nozzles. 615 0$aPumping machinery. 615 7$aCavitation. 615 7$aJet nozzles. 615 7$aPumping machinery. 700 $aSanger$b Nelson L.$01401178 712 02$aUnited States.$bNational Aeronautics and Space Administration, 801 0$bOCLCE 801 1$bOCLCE 801 2$bOCLCQ 801 2$bOCLCF 801 2$bOCLCO 801 2$bOCLCQ 801 2$bGPO 906 $aBOOK 912 $a9910715040503321 996 $aNoncavitating and cavitating performance of two low-area-ratio water jet pumps with throat lengths of 5.66 diameters$93484918 997 $aUNINA LEADER 06840nam 2200493 450 001 996464416503316 005 20231110220647.0 010 $a3-030-89247-6 035 $a(CKB)4950000000281755 035 $a(MiAaPQ)EBC6784269 035 $a(Au-PeEL)EBL6784269 035 $a(OCoLC)1281960537 035 $a(PPN)258296372 035 $a(EXLCZ)994950000000281755 100 $a20220710d2021 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFundamentals of software engineering $e9th International Conference, FSEN 2021, Virtual event, May 19-21, 2021, revised selected papers /$fHossein Hojjat and Mieke Massink 210 1$aCham, Switzerland :$cSpringer International Publishing,$d[2021] 210 4$dİ2021 215 $a1 online resource (235 pages) 225 1 $aLecture Notes in Computer Science ;$vv.12818 311 $a3-030-89246-8 327 $aIntro -- Preface -- Organization -- Contents -- Coordination -- Protocol Scheduling -- 1 Introduction -- 2 Work Automata -- 3 Graph Games -- 4 Scheduling Game -- 5 Protocol Restriction -- 6 Conclusion -- References -- Automated Replication of Tuple Spaces via Static Analysis -- 1 Introduction -- 2 Preliminaries -- 3 Programming Interface Extension for Replication -- 4 Static Analysis and Program Transformation -- 5 Implementation and Experimental Evaluation -- 6 Related Work -- 7 Conclusion and Future Work -- References -- Incremental Refinement of Goal Models with Contracts -- 1 Introduction -- 2 Background -- 3 Running Example: Vehicle Platooning -- 4 The CoGoMo Approach -- 4.1 Goal Formalization -- 4.2 Goal Manipulation via Composition and Refinement -- 4.3 Goal Manipulation via Conjunction -- 5 CGT Extension -- 6 Related Work -- 7 Conclusions -- A Distribution of Composition over Conjunction -- References -- Logic -- Adding Proof Calculi to Epistemic Logics with Structured Knowledge -- 1 Introduction -- 2 Overview on Parametric Construction of Epistemic Logics with Structured States -- 2.1 The Parameter -- 2.2 The Method -- 3 Proof Calculus -- 3.1 Completeness -- 4 Model Checking and Satisfiability Problem -- 5 Conclusion -- References -- Introducing Interval Differential Dynamic Logic -- 1 Introduction -- 2 Interval Paradigm -- 3 Interval Functions for dL -- 4 Conclusions and Future Work -- References -- A Program Logic for Fresh Name Generation -- 1 Introduction -- 2 Programming Language -- 3 Logical Language -- 4 Model -- 4.1 Semantics -- 5 Axioms -- 6 Rules -- 7 Reasoning Examples -- 8 Conclusion -- References -- Event-Driven Temporal Logic Pattern for Control Software Requirements Specification -- 1 Introduction -- 2 Syntax and Definition of EDTL-Requirements -- 3 Semantics of EDTL-Requirements -- 3.1 Definitions for the Semantics. 327 $a3.2 The First Order Logic Semantics -- 3.3 The Linear Temporal Logic Semantics -- 4 Case Study -- 5 Related Work -- 6 Conclusion and Future Work -- A Bounded Checking of EDTL-requirements -- References -- Extending OCL with Map and Function Types -- 1 Introduction -- 2 Map Types -- 2.1 Map Type Semantics -- 2.2 Operations on Maps -- 2.3 Implementation -- 3 Function Types -- 3.1 Function Type Semantics -- 3.2 Operations on Functions -- 3.3 Implementation -- 4 Related Work -- A Additional Map Type Operators -- References -- Networks -- Deadlock in Packet Switching Networks -- 1 Introduction -- 2 Preliminaries -- 2.1 Packet Switching Network -- 2.2 Semantics of Packet Switching Networks -- 3 Deadlocks -- 3.1 Global Deadlock -- 3.2 Local Deadlock -- 3.3 Weak Deadlock -- 4 Expressivity of Different Notions of Deadlock -- 4.1 Comparing Global Deadlocks to Local and Weak Deadlocks -- 4.2 Comparing Local Deadlocks to Weak Deadlocks -- 5 Proof of Concept Implementation -- 5.1 An SMV Model for Packet Switching Networks -- 5.2 Deadlock Formulas in CTL -- 5.3 Experiments -- 6 Conclusions -- References -- Runtime Monitoring Processes Across Blockchains -- 1 Introduction -- 2 Challenges of Full Decentralisation for Monitoring Business Processes -- 3 Monitoring Business Processes Across Blockchains -- 3.1 Business Process Monitoring Through Smart Contracts -- 3.2 Communication Across Blockchains -- 4 Case Study -- 5 Related Work -- 6 Remaining Challenges -- 7 Conclusions -- References -- Solving Systems of Bilinear Equations for Transition Rate Reconstruction -- 1 Introduction -- 2 Background -- 3 Special Cases Leading to Complete System -- 3.1 Synchronising Action -- 3.2 Non-synchronising Action -- 4 Iterative Algorithm to Solve System of Equations -- 5 Case Study: Tandem Queueing Network -- 5.1 System Definition -- 5.2 Runtime Comparison -- 6 Conclusion. 327 $aReferences -- Parallel Computation -- Term Rewriting on GPUs -- 1 Introduction -- 2 Preliminaries -- 3 A GPU Algorithm for Term Rewriting -- 4 Evaluation -- References -- Promise Plus: Flexible Synchronization for Parallel Computations on Arrays -- 1 Introduction -- 2 Context -- 3 PromisePlus: Flexible Synchronization for Arrays -- 4 Benchmarks -- 5 Related Work -- 6 Future Work and Conclusion -- A Algorithms of get and set -- References -- Testing -- Towards Automatic Test Case Generation for Industrial Software Systems Based on Functional Specifications -- 1 Introduction -- 2 Background -- 2.1 Running Example: Matching Limit Orders -- 3 Functional Specification -- 3.1 Basic Specification Patterns -- 3.2 Verifying Properties on Specification -- 4 Test Case Generation -- 4.1 Fitness Function -- 4.2 Local Search -- 4.3 Global Search -- 5 Evaluation -- 5.1 Test Execution -- 5.2 Code Coverage Analysis -- 5.3 Mutation Analysis -- 6 Related Work -- 7 Conclusion -- References -- Compressing Automatically Generated Unit Test Suites Through Test Parameterization -- 1 Introduction -- 2 Related Work -- 3 Proposed Approach -- 4 Evaluation -- 5 Conclusion -- References -- Systematic Extraction of Tests from Object-Oriented Programs -- 1 Introduction -- 2 Related Works -- 3 The Proposed Approach -- 3.1 Model Extractor Component -- 3.2 Test Machine Component -- 3.3 Test Case Generator Component -- 4 Evaluation -- 4.1 Effectiveness of Tests in Revealing Errors -- 4.2 Revealing Real Error -- 5 Conclusion -- References -- Author Index. 410 0$aLecture Notes in Computer Science 606 $aSoftware engineering$vCongresses 606 $aSoftware engineering$xData processing 615 0$aSoftware engineering 615 0$aSoftware engineering$xData processing. 676 $a005.1 700 $aHojjat$b Hossein$0905425 702 $aMassink$b Mieke 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996464416503316 996 $aFundamentals of software engineering$92897772 997 $aUNISA