LEADER 04322oam 2200781I 450 001 9910462446503321 005 20200520144314.0 010 $a1-283-60614-3 010 $a9786613918598 010 $a1-136-27708-0 010 $a0-203-11102-8 024 7 $a10.4324/9780203111024 035 $a(CKB)2670000000242248 035 $a(EBL)1024508 035 $a(OCoLC)811505732 035 $a(SSID)ssj0000742112 035 $a(PQKBManifestationID)11417000 035 $a(PQKBTitleCode)TC0000742112 035 $a(PQKBWorkID)10745109 035 $a(PQKB)10599259 035 $a(MiAaPQ)EBC1024508 035 $a(Au-PeEL)EBL1024508 035 $a(CaPaEBR)ebr10603626 035 $a(CaONFJC)MIL391859 035 $a(OCoLC)811788780 035 $a(EXLCZ)992670000000242248 100 $a20180706d2013 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 00$aBuddhism and violence $emilitarism and Buddhism in modern Asia /$fedited by Vladimir Tikhonov and Torkel Brekke 205 $aFirst edition. 210 1$aNew York :$cRoutledge,$d2013. 215 $a1 online resource (277 p.) 225 1 $aRoutledge studies in religion ;$v19 225 0$aRoutledge studies in religion ;$v19 300 $aDescription based upon print version of record. 311 $a1-138-92189-0 311 $a0-415-53696-0 320 $aIncludes bibliographical references and index. 327 $aCover; Title; Copyright; Contents; List of Figures and Tables; Preface; Introduction: Dialectics of Violence and Non-Violence-Buddhism and Other Religions; PART I Nationalism and Militarism in Modern Asian Buddhisms; 1 Sinhala Ethno-nationalisms and Militarization in Sri Lanka; 2 Military Temples and Saffron-Robed Soldiers: Legitimacy and the Securing of Buddhism in Southern Thailand; 3 Reconsidering the Historiography of Modern Korean Buddhism: Nationalism and Identity of the Chogye Order of Korean Buddhism; PART II Militarism and the Buddhist Monks 327 $a4 A Path to Militant Buddhism: Thai Buddhist Monks as Representations5 Canonical Ambiguity and Differential Practices: Buddhism and Militarism in Contemporary Sri Lanka; 6 The Monks and the Hmong: The Special Relationship between the Chao Fa and the Tham Krabok Buddhist Temple in Saraburi Province, Thailand; 7 A Closer Look at Zen at War: The Battlefield Chaplaincy of Shaku So?en in the Russo-Japanese War (1904-1905); PART III Buddhist Justifications for Peace and Militarism; 8 Question of Violence in Thai Buddhism; 9 Buddhism and the Justification of War with Focus on Chinese Buddhist History 327 $a10 Anti-War and Peace Movements among Japanese Buddhists after the Second World War11 Violent Buddhism-Korean Buddhists and the Pacific War, 1937-1945; Conclusion; Notes on Contributors; Index 330 $aIt is generally accepted in the West that Buddhism is a 'peaceful' religion. The Western public tends to assume that the doctrinal rejection of violence in Buddhism would make Buddhist pacifists, and often expects Buddhist societies or individual Asian Buddhists to conform to the modern Western standards of 'peaceful' behavior. This stereotype - which may well be termed 'positive Orientalism,' since it is based on assumption that an 'Oriental' religion would be more faithful to its original non-violent teachings than Western Christianity - has been periodically challenged by enthusiastic ac 410 0$aRoutledge Studies in Religion 606 $aViolence$zAsia$xReligious aspects$xBuddhism 606 $aMilitarism$zAsia$xReligious aspects$xBuddhism 606 $aMilitarism$zAsia$xHistory$y20th century 606 $aMilitarism$zAsia$xHistory$y21st century 608 $aElectronic books. 615 0$aViolence$xReligious aspects$xBuddhism. 615 0$aMilitarism$xReligious aspects$xBuddhism. 615 0$aMilitarism$xHistory 615 0$aMilitarism$xHistory 676 $a294.3/37273 676 $a294.337 676 $a294.337273 701 $aBrekke$b Torkel$0853973 701 $aTikhonov$b Vladimir$0914884 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910462446503321 996 $aBuddhism and violence$92050191 997 $aUNINA LEADER 08863nam 22008415 450 001 996200139803316 005 20230329140427.0 010 $a3-662-43948-4 024 7 $a10.1007/978-3-662-43948-7 035 $a(CKB)3710000000143973 035 $a(SSID)ssj0001274726 035 $a(PQKBManifestationID)11738370 035 $a(PQKBTitleCode)TC0001274726 035 $a(PQKBWorkID)11334073 035 $a(PQKB)10203566 035 $a(DE-He213)978-3-662-43948-7 035 $a(MiAaPQ)EBC3107104 035 $a(PPN)179766562 035 $a(EXLCZ)993710000000143973 100 $a20140611d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAutomata, Languages, and Programming$b[electronic resource] $e41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I /$fedited by Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, Elias Koutsoupias 205 $a1st ed. 2014. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2014. 215 $a1 online resource (XXXIV, 1090 p. 74 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8572 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-662-43947-6 327 $aInvited Talks -- Sporadic Solutions to Zero-One Exclusion Tasks -- Verifying and Synthesizing Software with Recursive Functions (Invited Contribution) -- Track A: Algorithms, Complexity, and Games Weak Parity -- Consequences of Faster Alignment of Sequences -- Distance Labels with Optimal Local Stretch -- Time-Expanded Packings -- Deterministic Rectangle Enclosure and Offline Dominance Reporting on the RAM -- The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average -- Tighter Relations between Sensitivity and Other Complexity Measures -- On Hardness of Jumbled Indexing -- Morphing Planar Graph Drawings Optimally -- Incremental Algorithm for Maintaining DFS Tree for Undirected Graphs -- On the Role of Shared Randomness in Simultaneous Communication -- Short PCPs with Projection Queries -- Star Partitions of Perfect Graphs -- Coordination Mechanisms for Selfish Routing over Time on a Tree -- On Area-Optimal Planar Graph Drawings -- Shortest Two Disjoint Paths in Polynomial Time -- Listing Triangles -- On DNF Approximators for Monotone Boolean Functions -- Internal DLA: Efficient Simulation of a Physical Growth Model [Extended Abstract]. Lower Bounds for Approximate LDCs -- Holographic Algorithms Beyond Matchgates -- Testing Probability Distributions Underlying Aggregated Data -- Parallel Repetition of Entangled Games with Exponential Decay via the Superposed Information Cost -- The Bose-Hubbard Model is QMA-complete -- Characterization of Binary Constraint System Games -- Fast Algorithms for Constructing Maximum Entropy Summary Trees -- Thorp Shuffling, Butterflies, and Non-Markovian Couplings.-Dynamic Complexity of Directed Reachability and Other Problems -- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile -- Canadians Should Travel Randomly -- Efficiency Guarantees in Auctions with Budgets -- Parameterized Complexity of Bandwidth on Trees -- Testing Equivalence of Polynomials under Shifts -- Optimal Analysis of Best Fit Bin Packing -- Light Spanners.-Semi-Streaming Set Cover (Extended Abstract) -- Online Stochastic Reordering Buffer Scheduling -- Demand Queries with Preprocessing -- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs -- Public vs Private Coin in Bounded-Round Information -- En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations -- Improved Submatrix Maximum Queries in Monge Matrices -- For-All Sparse Recovery in Near-Optimal Time -- Families with Infants: A General Approach to Solve Hard Partition Problems -- Changing Bases: Multistage Optimization for Matroids and Matchings -- Problems -- Nearly Linear-Time Model-Based Compressive Sensing -- Breaking the PPSZ Barrier for Unique 3-SAT -- Privately Solving Linear Programs -- How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions -- Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not -- Partial Garbling Schemes and Their Applications -- On the Complexity of Trial and Error for Constraint Satisfaction Problems -- Information Theoretical Cryptogenography -- The Complexity of Somewhat Approximation Resistant Predicates -- Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound -- Distance Oracles for Time-Dependent Networks -- Efficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields -- Coloring Relatives of Interval Overlap Graphs via On-line Games -- Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits.-Testing Forest-Isomorphism in the Adjacency List Model -- Parameterized Approximation Schemes Using Graph Widths -- FPTAS for Weighted Fibonacci Gates and Its Applications -- Parameterized Algorithms to Preserve Connectivity -- Nonuniform Graph Partitioning with Unrelated Weights -- Precedence-Constrained Scheduling of Malleable Jobs with Preemption -- Unbounded Entanglement Can Be Needed to Achieve the Optimal Success Probability -- QCSP on Semicomplete Digraphs -- Fast Pseudorandomness for Independence and Load Balancing [Extended Abstract] -- Determining Majority in Networks with Local Interactions and Very Small Local Memory -- Lower Bounds for Oblivious Subspace Embedding -- Secure Computation Using Leaky Tokens -- An Improved Interactive Streaming Algorithm for the Distinct Elements Problem -- A Faster Parameterized Algorithm for Treedepth -- Pseudorandom Graphs in Data Structures -- Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications -- The Mondshein Sequence -- Balanced Allocations: A Simple Proof for the Heavily Loaded Case -- Close to Uniform Prime Number Generation with Fewer Random Bits -- Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs -- Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem (Extended Abstract) -- On Learning, Lower Bounds and (un)Keeping Promises -- Certificates in Data Structures -- Optimal Query Complexity for Estimating the Trace of a Matrix -- Faster Separators for Shallow Minor-Free Graphs via Dynamic Approximate Distance Oracles -- Spatial Mixing of Coloring Random Graphs. 330 $aThis two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8572 606 $aAlgorithms 606 $aComputer science 606 $aComputer networks 606 $aInformation storage and retrieval systems 606 $aApplication software 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aAlgorithms 606 $aTheory of Computation 606 $aComputer Communication Networks 606 $aInformation Storage and Retrieval 606 $aComputer and Information Systems Applications 606 $aDiscrete Mathematics in Computer Science 615 0$aAlgorithms. 615 0$aComputer science. 615 0$aComputer networks. 615 0$aInformation storage and retrieval systems. 615 0$aApplication software. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aAlgorithms. 615 24$aTheory of Computation. 615 24$aComputer Communication Networks. 615 24$aInformation Storage and Retrieval. 615 24$aComputer and Information Systems Applications. 615 24$aDiscrete Mathematics in Computer Science. 676 $a001.642 702 $aEsparza$b Javier$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aFraigniaud$b Pierre$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aHusfeldt$b Thore$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKoutsoupias$b Elias$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996200139803316 996 $aAutomata, languages and programming$9339738 997 $aUNISA