LEADER 01686nam 2200433 n 450 001 996391652903316 005 20221108042134.0 035 $a(CKB)1000000000670126 035 $a(EEBO)2240867691 035 $a(UnM)99837737 035 $a(EXLCZ)991000000000670126 100 $a19901016d1633 uy | 101 0 $aeng 135 $aurbn||||a|bb| 200 02$aA paradise of prayers$b[electronic resource] $econtaining the purity of deuotion and meditation: gathered out of all the spirituall exercises of Lewes of Granado: and Englished for the benefit of the Christian reader 205 $aThe fourth edition. 210 $aLondon $cPrinted by Iohn Norton, and are to be sold by William Sheares, at the signe of the Harrow, in Brittaines Burse$d1633 215 $a[22], 355, [1] p 300 $aPage 264 misnumbered 294. 300 $aThe fourth edition of STC 16916.3, published in 1609 with title: A paradise of praiers. 300 $aDedication signed: H.P. 300 $aSome pages cropped and tightly bound, slightly affecting headlines and marginal print. 300 $aReproduction of the original in the Bodleian Library. 330 $aeebo-0014 606 $aDevotional exercises$vEarly works to 1800 606 $aPrayers$vEarly works to 1800 615 0$aDevotional exercises 615 0$aPrayers 700 $aLuis$cde Granada,$f1504-1588.$0131794 701 $aLodge$b Thomas$f1558?-1625.$0845266 701 $aH. P$ffl. 1633.$01010252 801 0$bCu-RivES 801 1$bCu-RivES 801 2$bCStRLIN 801 2$bWaOLN 906 $aBOOK 912 $a996391652903316 996 $aA paradise of prayers$92336210 997 $aUNISA LEADER 11008nam 2200529 450 001 996490364503316 005 20230207225748.0 010 $a3-031-16336-2 035 $a(MiAaPQ)EBC7084576 035 $a(Au-PeEL)EBL7084576 035 $a(CKB)24819541500041 035 $a(PPN)264952944 035 $a(EXLCZ)9924819541500041 100 $a20230207d2022 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aQuantitative evaluation of systems $e19th International Conference, QEST 2022, Warsaw, Poland, September 12-16, 2022, proceedings /$fErika A?braha?m, Marco Paolieri, editors 210 1$aCham, Switzerland :$cSpringer,$d[2022] 210 4$d©2022 215 $a1 online resource (406 pages) 225 1 $aLecture notes in computer science ;$v13479 311 08$aPrint version: Ábrahám, Erika Quantitative Evaluation of Systems Cham : Springer International Publishing AG,c2022 9783031163357 320 $aIncludes bibliographical references and index. 327 $aIntro -- Preface -- Organization -- Robustness Guarantees for Bayesian Neural Networks (Invited Extended Abstract of a Keynote Speaker) -- Contents -- Program Analysis -- Moment-Based Invariants for Probabilistic Loops with Non-polynomial Assignments -- 1 Introduction -- 2 Preliminaries -- 2.1 Prob-Solvable Loops -- 2.2 Polynomial Chaos Expansion -- 3 Polynomial Chaos Expansion Algorithm -- 3.1 Random Function Representation -- 3.2 PCE Algorithm -- 4 Prob-Solvable Loops for General Non-polynomial Functions -- 4.1 Iteration-Stable Distributions of Random Arguments -- 4.2 Iteration Non-stable Distribution of Random Arguments -- 5 Evaluation -- 6 Conclusion -- References -- Distribution Estimation for Probabilistic Loops -- 1 Introduction -- 2 Preliminaries -- 2.1 PPs and Moments of Random Variables -- 2.2 From Moments to Distributions -- 3 Effective Estimation of Distributions for Probabilistic Loops -- 3.1 Distribution Estimation -- 3.2 Assessing Accuracy of Estimated Distributions -- 4 Experimental Evaluation -- 5 Conclusion -- References -- An Automated Quantitative Information Flow Analysis for Concurrent Programs -- 1 Introduction -- 1.1 Paper Outline -- 2 Background -- 2.1 Basics -- 2.2 Information Theory -- 2.3 Markovian Models -- 2.4 Probabilistic Schedulers -- 3 The Proposed Approach -- 3.1 The Program and Threat Models -- 3.2 The Attacker's View of the Program: Back-Bisimulation Quotient -- 3.3 Measuring the Leakage Using Back-Bisimulation Quotient -- 3.4 Computing Back-Bisimulation Quotient -- 4 Conclusions and Future Work -- A Case Study -- B Related Work -- References -- Parameter Synthesis -- Rate Lifting for Stochastic Process Algebra - Exploiting Structural Properties - -- 1 Introduction -- 2 Structural Properties of SPA -- 2.1 Moving Set and Participating Set -- 2.2 Involved Set. 327 $a3 ``Parallel'' Transitions and Relevant Selfloop Combinations -- 3.1 Multi-transition System -- 3.2 Calculating Relevant Selfloop Combinations -- 4 Lifting Algorithm -- 4.1 Spurious Transitions -- 4.2 Detailed Description of the Algorithm -- 5 Experimental Result: Cyclic Server Polling System -- 6 Correctness and Existence Considerations -- 7 Conclusion -- References -- End-to-End Statistical Model Checking for Parametric ODE Models -- 1 Introduction -- 2 Background and Notations -- 2.1 ODE Preliminaries -- 2.2 Bounded Linear Time Logic -- 2.3 Reward Function -- 3 Global Statistical Guarantees -- 3.1 Approximation Method for the Numerical Integration of the ODE -- 3.2 Monte-Carlo Method -- 3.3 Model Checking Extension Through Reward Functions -- 4 Case Studies -- 4.1 Case Study 1: A Study on Aurelia Aurita Population Growth ch5melica14 -- 4.2 Case Study 2: A Prey-Predator Model for Lynx and Hares ch5restrepo10 -- 5 Conclusion -- A Proof of Lemma 1 -- B Proof of Theorem 2 -- References -- POMDP Controllers with Optimal Budget -- 1 Introduction -- 2 Preliminaries -- 2.1 Rewards for pMCs -- 2.2 Problem Statement -- 2.3 Parameter Lifting -- 3 Monotonicity -- 3.1 Defining Monotonicity -- 3.2 Reward Order -- 3.3 Constructing Reward Orders -- 3.4 Reachability Probabilities -- 4 Divide and Conquer -- 5 Experimental Validation -- 6 Related Work -- 7 Conclusion and Future Work -- A Algorithm -- B Results -- C Proofs -- C.1 Proof Sketch of Theorem 1 -- C.2 Proof of Lemma 7 -- References -- Markovian Agents and Population Models -- A Logical Framework for Reasoning About Local and Global Properties of Collective Systems -- 1 Introduction -- 2 Modelling Global and Local Behaviours -- 2.1 Multi-agent Discrete Time Markov Chain -- 3 Global and Local Temporal Logic -- 3.1 Syntax -- 3.2 Semantic -- 4 Model Checking GLoTL. 327 $a4.1 Operational Semantics of GLoTL Formulas -- 4.2 Exact Model Checking Algorithm -- 4.3 Statistical Model Checking of GLoTL -- 5 Concluding Remarks -- References -- Jump Longer to Jump Less: Improving Dynamic Boundary Projection with h-Scaling -- 1 Introduction -- 2 Background -- 3 h-Scaling -- 3.1 Static Scaling -- 3.2 Scaled Dynamic Boundary Projection -- 4 Limit Behaviour -- 5 Multi-scale Approximation -- 6 Examples -- 6.1 Egalitarian Processor Sharing -- 6.2 Malware Propagation -- 7 Conclusion and Related Works -- A Appendix -- A.1 Derivation of Scaled DBP -- A.2 Equations for Example 3 -- A.3 Proof of Theorem 4 -- A.4 Additional Data on Malware Propagation Model -- References -- Dynamical Systems -- An Algorithm for the Formal Reduction of Differential Equations as Over-Approximations -- 1 Introduction -- 2 Background -- 3 Computing Differential Hulls -- 4 Case Studies -- 4.1 SIR Model -- 4.2 Polymerization -- 4.3 Protein Interaction Network -- 4.4 Electrical Network -- 4.5 Conversion of Light Alkanes over H-ZSM-5 -- 5 Conclusion -- A Appendix -- A.1 Proofs -- A.2 Experiments -- References -- Stability Analysis of Planar Probabilistic Piecewise Constant Derivative Systems -- 1 Introduction -- 2 Related Work -- 3 Case Study: Planar Robot with a Faulty Actuator -- 4 Preliminaries -- 4.1 Discrete-Time Markov Chain -- 4.2 Weighted Discrete-Time Markov Chain -- 4.3 Convergence of Weighted Discrete-Time Markov Chain -- 4.4 Probabilistic Bisimulation -- 4.5 Polyhedral Sets -- 5 Analyzing Convergence of Weighted Discrete-Time Markov Chains -- 5.1 Analyzing Absolute Convergence of Weighted DTMC -- 5.2 Analyzing Almost Sure Convergence of Weighted DTMC -- 5.3 Computability -- 6 Probabilistic Piecewise Constant Derivative Systems -- 6.1 Formal Definition of PPCD -- 6.2 Stability of Planar PPCD -- 7 Conclusion -- A Appendix. 327 $aA.1 Proof of Proposition 1 -- A.2 Algorithms from Sect. 5.3 -- A.3 Proof of Lemma 2 -- A.4 Proof of Lemma 4 -- References -- Tools -- LCRL: Certified Policy Synthesis via Logically-Constrained Reinforcement Learning -- 1 Introduction -- 1.1 Related Work -- 1.2 Contributions -- 2 Logically-Constrained Reinforcement Learning (LCRL) -- 2.1 Installation -- 2.2 Input Interface -- 2.3 Output Interface -- 3 Experimental Evaluation -- 4 Conclusions and Extensions -- References -- LN: A Meta-solver for Layered Queueing Network Analysis -- 1 Introduction -- 2 LQN Formalism -- 3 LQN Decomposition and Iterative Solution -- 3.1 Layering Strategy -- 3.2 Homogeneous Layers -- 3.3 Performance Metrics -- 3.4 Advanced LN Features -- 4 Novel Algorithms -- 4.1 Solving Homogeneous Layers with the CoMoM Algorithm -- 4.2 Solving Homogeneous Layers with Gaussian Quadratures -- 4.3 Computing Marginal Probabilities in Homogeneous Layers -- 4.4 Multi-server Nodes, Load-Dependence and Multi-class FCFS -- 5 Case Studies -- 5.1 Meta-solver Capabilities -- 5.2 Multi-formalism Capabilities -- 6 Conclusion -- A Proof of Theorem 1 -- B Gaussian Quadratures -- C Proof of Theorem 2 -- D Proof of Theorem 3 -- E Software Architecture Design -- References -- Eulero: A Tool for Quantitative Modeling and Evaluation of Complex Workflows -- 1 Introduction -- 2 The Eulero Library -- 3 Workflow Modeling -- 3.1 Structure Tree and STPN Blocks -- 3.2 Complexity Measures -- 3.3 Package Description -- 4 Workflow Evaluation -- 4.1 Analysis Heuristics -- 4.2 Package Description -- 5 Workflow Generation -- 5.1 Random Generation -- 5.2 Package Description -- 6 Conclusions -- References -- Applications -- Preference-Aware Computation Offloading for IoT in Multi-access Edge Computing Using Probabilistic Model Checking -- 1 Introduction -- 2 A Motivating Example -- 3 Problem Formulation. 327 $a4 Formal Model of Computation Offloading -- 4.1 LTS Model of the Offloading Policy -- 4.2 LTS Model of the IoT Device -- 4.3 DTMC Model of Task Execution Latencies -- 4.4 Turn-Based Stochastic Multi-player Game Model Composition -- 4.5 Reward Formulation and IoT User Preferences -- 4.6 Offloading Strategy Objectives -- 5 Results and Discussion -- 6 Related Work -- 7 Conclusion and Future Work -- A Battery Model -- B Experimental Setup -- B.1 Simulation Setup -- References -- Analysis of an Electric Vehicle Charging System Along a Highway -- 1 Introduction -- 2 State of the Art -- 3 The Infrastructure and the EV -- 4 Fluid Stochastic Petri Net: The Scenario -- 4.1 The Battery Level -- 4.2 Stopping Decision Policies -- 4.3 Computing Decision Policy Probability -- 5 Solution Equation -- 6 Numerical Results -- 7 Conclusions -- References -- Verifier's Dilemma in Ethereum Blockchain: A Quantitative Analysis -- 1 Introduction -- 2 Related Work -- 3 Background -- 3.1 Verifier's Dilemma -- 3.2 PEPA -- 4 Analysis of the Verifier's Dilemma -- 4.1 Model Description -- 4.2 Model Assessment -- 5 Analysis of the Invalid Block Injection Policy -- 5.1 Model Description -- 5.2 Model Assessment -- 6 Optimal Invalid Block Injection Rate -- 7 Conclusion -- A Tables of Notations -- B Steady State Probabilities for BM -- C Steady-State Probabilities for IBIM -- References -- Comparing Statistical and Analytical Routing Approaches for Delay-Tolerant Networks -- 1 Introduction -- 2 Background -- 3 Routing in Uncertain DTNs -- 3.1 RUCoP -- 3.2 LSS -- 4 Evaluation -- 4.1 Benchmark Set -- 4.2 Analysis -- 5 Conclusions -- References -- Automata Theory and Applications -- Mirrors and Memory in Quantum Automata -- 1 Introduction -- 2 Preliminaries -- 2.1 Strings and Languages -- 2.2 Quantum Computing -- 3 Measure-Once Quantum Finite Automata. 327 $a4 Heisenberg Quantum Finite Automata. 410 0$aLecture notes in computer science ;$v13479. 606 $aComputer systems$xEvaluation 606 $aComputer systems$xEvaluation$vCongresses 615 0$aComputer systems$xEvaluation. 615 0$aComputer systems$xEvaluation 676 $a004.24 702 $aA?braha?m$b Erika 702 $aPaolieri$b Marco 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996490364503316 996 $aQuantitative Evaluation of Systems$92914390 997 $aUNISA LEADER 06533nam 2201369 450 001 9910477093003321 005 20240102130941.0 010 $a978-952-359-008-3$bPDF 024 7 $a10.61201/tup.730 035 $a(CKB)5470000000569012 035 $a(NjHacI)995470000000569012 035 $a(EXLCZ)995470000000569012 100 $a20230220d2019 ky 0 101 0 $afin 135 $aur||||||||||| 181 $ctxt$2rdacontent 181 $ctxt$2rdacontent 182 $cc$2rdamedia 182 $cc$2rdamedia 183 $acr$2rdacarrier 183 $acr$2rdacarrier 200 00$aSiirtymiä ja ajan merkkejä koulutuksessa $eopetussuunnitelmatutkimuksen näkökulmia /$ftoimittaneet Tero Autio, Liisa Hakala ja Tiina Kujala 210 1$a[Tampere] :$cTampere University Press,$d[2019] 210 1$aTampere :$cTampere University Press,$d2019. 215 $a1 verkkoaineisto (472 sivua) 300 $aVertaisarvioitu. 300 $aRefereed. 300 $aPeer-reviewed. 311 08$aPainettu: 9789523590090 320 $aSisältää bibliografisia viitteitä. 330 $aTämä artikkelikokoelma jatkaa keskustelua, joka käynnistyi vuonna 2017 julkaistussa ensimmäisessä suomenkielisessä opetussuunnitelmatutkimusta käsittelevässä teoksessa. Kirjan artikkelit jakaantuvat neljään teemakokonaisuuteen. Käsiteltyjä teemoja yhdistää huoli saksalais-pohjoiseurooppalaisen Bildung/Didaktiikka -opetussuunnitelmatradition ajautumisesta entistä ahtaammalle oppimisteorioiden jäsentämän, taitoihin ja kompetensseihin rajoittuvan, näennäisesti epäpoliittisen angloamerikkalaisen curriculum-opetussuunnitelmatradition sekä sen poliittisen aisaparin, uusliberalismin, puristuksessa. 330 $aThis edited book continues the discussion on curriculum, which began in 2017 with the authors' previous work - the first book on Curriculum Studies in Finnish. The articles are divided into four thematic sets, the common denominator of which is the concern about the drifting of the comprehensive democratic German and Nordic Bildung/Didactic curriculum tradition into the narrower, competence and skills driven Anglo-American education and curriculum, shaped by the paradoxical alliance of assumedly apolitical instrumental learning theories and neoliberal policy measures. 606 $akoulutus$3http://www.yso.fi/onto/yso/p84$2yso/fin 606 $aammattikorkeakoulut$3http://www.yso.fi/onto/yso/p10564$2yso/fin 606 $aopetussuunnitelmat$3http://www.yso.fi/onto/yso/p5140$2yso/fin 606 $atutkimus$3http://www.yso.fi/onto/yso/p183$2yso/fin 606 $asivistys$3http://www.yso.fi/onto/yso/p14979$2yso/fin 606 $atieto$3http://www.yso.fi/onto/yso/p261$2yso/fin 606 $akoulutuspolitiikka$3http://www.yso.fi/onto/yso/p249$2yso/fin 606 $ayliopistot$3http://www.yso.fi/onto/yso/p10895$2yso/fin 606 $akorkea-asteen koulutus$3http://www.yso.fi/onto/yso/p3390$2yso/fin 606 $akorkeakoulupolitiikka$3http://www.yso.fi/onto/yso/p6796$2yso/fin 606 $akasvatushistoria$3http://www.yso.fi/onto/yso/p10258$2yso/fin 606 $akasvatustavoitteet$3http://www.yso.fi/onto/yso/p2745$2yso/fin 606 $avarhaiskasvatus$3http://www.yso.fi/onto/yso/p1650$2yso/fin 606 $akokonaisopetus$3http://www.yso.fi/onto/yso/p11220$2yso/fin 606 $akatsomusaineet$3http://www.yso.fi/onto/yso/p23101$2yso/fin 606 $ataidekasvatus$3http://www.yso.fi/onto/yso/p5457$2yso/fin 606 $amonilukutaito$3http://www.yso.fi/onto/yso/p28850$2yso/fin 606 $autbildning$3http://www.yso.fi/onto/yso/p84$2yso/swe 606 $ayrkeshögskolor$3http://www.yso.fi/onto/yso/p10564$2yso/swe 606 $aläroplaner$3http://www.yso.fi/onto/yso/p5140$2yso/swe 606 $aforskning$3http://www.yso.fi/onto/yso/p183$2yso/swe 606 $abildning$3http://www.yso.fi/onto/yso/p14979$2yso/swe 606 $akunskap$3http://www.yso.fi/onto/yso/p261$2yso/swe 606 $autbildningspolitik$3http://www.yso.fi/onto/yso/p249$2yso/swe 606 $auniversitet$3http://www.yso.fi/onto/yso/p10895$2yso/swe 606 $autbildning på högskolenivå$3http://www.yso.fi/onto/yso/p3390$2yso/swe 606 $ahögskolepolitik$3http://www.yso.fi/onto/yso/p6796$2yso/swe 606 $apedagogikens historia$3http://www.yso.fi/onto/yso/p10258$2yso/swe 606 $amål för fostran$3http://www.yso.fi/onto/yso/p2745$2yso/swe 606 $asmåbarnspedagogik$3http://www.yso.fi/onto/yso/p1650$2yso/swe 606 $asamordnad undervisning$3http://www.yso.fi/onto/yso/p11220$2yso/swe 606 $alivsåskådningsämnen$3http://www.yso.fi/onto/yso/p23101$2yso/swe 606 $akonstfostran$3http://www.yso.fi/onto/yso/p5457$2yso/swe 606 $amultilitteracitet$3http://www.yso.fi/onto/yso/p28850$2yso/swe 606 $aCurriculum planning$zFinland 606 $aCurriculum planning 615 7$akoulutus. 615 7$aammattikorkeakoulut. 615 7$aopetussuunnitelmat. 615 7$atutkimus. 615 7$asivistys. 615 7$atieto. 615 7$akoulutuspolitiikka. 615 7$ayliopistot. 615 7$akorkea-asteen koulutus. 615 7$akorkeakoulupolitiikka. 615 7$akasvatushistoria. 615 7$akasvatustavoitteet. 615 7$avarhaiskasvatus. 615 7$akokonaisopetus. 615 7$akatsomusaineet. 615 7$ataidekasvatus. 615 7$amonilukutaito. 615 7$autbildning. 615 7$ayrkeshögskolor. 615 7$aläroplaner. 615 7$aforskning. 615 7$abildning. 615 7$akunskap. 615 7$autbildningspolitik. 615 7$auniversitet. 615 7$autbildning på högskolenivå. 615 7$ahögskolepolitik. 615 7$apedagogikens historia. 615 7$amål för fostran. 615 7$asmåbarnspedagogik. 615 7$asamordnad undervisning. 615 7$alivsåskådningsämnen. 615 7$akonstfostran. 615 7$amultilitteracitet. 615 0$aCurriculum planning 615 0$aCurriculum planning. 676 $a373.19094897 702 $aAutio$b Tero$f1946- 702 $aHakala$b Liisa$f1961- 702 $aKujala$b Tiina 712 02$aTampere University Press, 801 0$bNjHacI 801 1$bNjHacl 801 2$bFI-Hul 906 $aBOOK 912 $a9910477093003321 996 $aSiirtymiä ja ajan merkkejä koulutuksessa$92989802 997 $aUNINA 999 $9Helka