LEADER 04042nam 2200601Ia 450 001 9910139551503321 005 20170810172803.0 010 $a0-470-82620-7 010 $a1-119-19947-6 010 $a1-283-37246-0 010 $a9786613372468 010 $a0-470-82619-3 035 $a(CKB)2550000000064959 035 $a(EBL)706815 035 $a(OCoLC)782860692 035 $a(SSID)ssj0000534169 035 $a(PQKBManifestationID)12231927 035 $a(PQKBTitleCode)TC0000534169 035 $a(PQKBWorkID)10510852 035 $a(PQKB)11437940 035 $a(MiAaPQ)EBC706815 035 $a(EXLCZ)992550000000064959 100 $a20100921d2010 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAsia alone$b[electronic resource] $ethe dangerous post-crisis divide from America /$fSimon SC Tay 210 $aSingapore ;$aHoboken, NJ $cWiley$d2010 215 $a1 online resource (230 p.) 300 $aDescription based upon print version of record. 311 $a0-470-82582-0 320 $aIncludes bibliographical references and index. 327 $aAsia Alone; CONTENTS; Introduction; Acknowledgments; 1. From Interdependence to a Dangerous Divide: How is the Crisis Changing Asia and America?; Langfang and Interdependence; Origins in Crisis; A New Asian Balance; Meeting Mr. Post-American; The Blame Game; From American Soft Power to Chinese Charm; Why It Matters; What Can Be Done; 2. Two Crises, One Asia: Is Asia Coming Together as a Region Without the United States? Why?; Asia as One; The ''Asian'' Crisis and America; How America Lost Asia; Asia Decoupling; 3. Leading Asia's Rise: Who's In and Who Leads? 327 $aChina and Southeast Asia: From Alarm to CharmGaining from Crises, Gaining from China; ASEAN's Example; The Problem with Japan and Others; ASEAN's Limits and the Regional Mess; 4. When Buffalo Fight: Can Rivalries Be Resolved as Asian Powers Emerge?; Tribute to China; Contested Histories, Future Doubts; Enter India; The Status Quo: Containment and Balance; Economic Logic and Political Insanities; 5. American Adjustments and Continuing Interests: Does the United States Really Want and Need Asia?; When the Going Gets Tough, the Tough (Don't) Go Shopping; Chinese Trading Junk, Globalization Blues 327 $aThe Asian Opportunity (Again)From Americanization to Global-as-Asian; ''Buy American'': Investment as Invasion; 6. Bridging the Divide, Rebalancing the Region: How Can America and Asia Adjust to Their Post-Crisis Relationship?; Eight Days in Asia: Kowtowing and Not Being Kennedy; A Risen China and the Power of &; The City of &: The Equi-Proximate Policy; Asia's Normative Community; 7. A Shared Future?: What Can Go Wrong?; A Dubai-ous Global Future; Getting Asia on the Global Stage; What Can Asians and Americans Do?; American Presence Not Past; Asia Alone and the Options; The Post-Crisis World 327 $aNotesIndex 330 $aAn insightful examination of the changing relationship between Asia and the United States In this lucidly written and thought-provoking book, author Simon Tay highlights the accelerating trends that point to Asia increasingly forging its own path, independent of the United States. He also describes the fundamental changes and new policy directions needed to maintain and strengthen the bonds between Asia and the United States that have been beneficial to both since the end of the Second World War. On the eve of the global financial crisis of 2008, the economies of the United Stat 606 $aInternational relations 607 $aAsia$xForeign relations$zUnited States 607 $aUnited States$xForeign relations$zAsia 608 $aElectronic books. 615 0$aInternational relations. 676 $a327.7305 700 $aTay$b Simon$0944708 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910139551503321 996 $aAsia alone$92132597 997 $aUNINA LEADER 08897nam 22008535 450 001 9910484314703321 005 20251226195857.0 010 $a3-540-49696-3 024 7 $a10.1007/11940128 035 $a(CKB)1000000000283730 035 $a(SSID)ssj0000316180 035 $a(PQKBManifestationID)11273113 035 $a(PQKBTitleCode)TC0000316180 035 $a(PQKBWorkID)10263185 035 $a(PQKB)10696669 035 $a(DE-He213)978-3-540-49696-0 035 $a(MiAaPQ)EBC3068628 035 $a(PPN)123139813 035 $a(BIP)34164514 035 $a(BIP)13947253 035 $a(EXLCZ)991000000000283730 100 $a20100301d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Computation $e17th International Symposium, ISAAC 2006, Kolkata, India, December 18-20, 2006, Proceedings /$fedited by Tetsuo Asano 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (XX, 766 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4288 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-49694-7 320 $aIncludes bibliographical references and author index. 327 $aInvited Talks -- Stable Matching Problems -- Delaunay Meshing of Surfaces -- Best Paper 2006 -- Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner?s Contraction -- Best Student Paper 2006 -- Branching and Treewidth Based Exact Algorithms -- Session 1A: Algorithms and Data Structures -- Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees -- Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules -- Flexible Word Design and Graph Labeling -- Session 1B: Online Algorithms -- Frequency Allocation Problems for Linear Cellular Networks -- Finite-State Online Algorithms and Their Automated Competitive Analysis -- Offline Sorting Buffers on Line -- Session 2A: Approximation Algorithms -- Approximating Tree Edit Distance Through String Edit Distance -- A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees -- Improved Approximation for Single-Sink Buy-at-Bulk -- Approximability of Partitioning Graphs with Supply and Demand -- Session 2B: Graphs -- Convex Grid Drawings of Plane Graphs with Rectangular Contours -- Algorithms on Graphs with Small Dominating Targets -- Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems -- On Estimating Path Aggregates over Streaming Graphs -- Session 3A: Computational Geometry -- Diamond Triangulations Contain Spanners of Bounded Degree -- Optimal Construction of the City Voronoi Diagram -- Relations Between Two Common Types of Rectangular Tilings -- Quality Tetrahedral Mesh Generation for Macromolecules -- On Approximating the TSP with Intersecting Neighborhoods -- Session 3B: Computational Complexity -- Negation-Limited Complexity of Parity and Inverters -- The Complexity of Quasigroup Isomorphism and the MinimumGenerating Set Problem -- Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete -- Parameterized Problems on Coincidence Graphs -- On 2-Query Codeword Testing with Near-Perfect Completeness -- Session 4A: Algorithms and Data Structures -- Poketree: A Dynamically Competitive Data Structure with Good Worst-Case Performance -- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications -- On Locating Disjoint Segments with Maximum Sum of Densities -- Two-Tier Relaxed Heaps -- Session 4B: Games and Networks -- The Interval Liar Game -- How Much Independent Should Individual Contacts Be to Form a Small?World? -- Faster Centralized Communication in Radio Networks -- On the Runtime and Robustness of Randomized Broadcasting -- Session 5A: Combinatorial Optimization and Computational Biology -- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency -- Non-cooperative Facility Location and Covering Games -- Optimal Algorithms for the Path/Tree-Shaped Facility Location Problems in Trees -- Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications -- Algorithms for Computing Variants of the Longest Common Subsequence Problem -- Session 5B: Graphs -- Constructing Labeling Schemes Through Universal Matrices -- Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions -- Analyzing Disturbed Diffusion on Networks -- Exact Algorithms for Finding the Minimum Independent Dominating Set in Graphs -- On Isomorphism and Canonization of Tournaments and Hypertournaments -- Session 6A: Algorithms and Data Structures -- Efficient Algorithms for the Sum Selection Problem and K Maximum Sums Problem -- Deterministic Random Walks on the Two-Dimensional Grid.-Improving Time and Space Complexity for Compressed Pattern Matching -- Improved Multi-unit Auction Clearing Algorithms with Interval (Multiple-Choice) Knapsack Problems -- Session 6B: Graphs -- A Simple Message Passing Algorithm for Graph Partitioning Problems -- Minimal Interval Completion Through Graph Exploration -- Balanced Cut Approximation in Random Geometric Graphs -- Improved Algorithms for the Minmax-Regret 1-Center Problem -- Session 7A: Approximation Algorithms -- On Approximating the Maximum Simple Sharing Problem -- Approximation Scheme for Lowest Outdegree Orientation and Graph Density Measures -- Improved Approximation Algorithms for Maximum Resource Bin Packing and Lazy Bin Covering Problems -- Session 7B: Graphs -- Partitioning the Nodes of a Graph to Minimize the Sum of Subgraph Radii -- Efficient Prüfer-Like Coding and Counting Labelled Hypertrees -- Intuitive Algorithms and t-Vertex Cover -- Session 8A: Combinatorial Optimization and Quantum Computing -- Politician?s Firefighting -- Runtime Analysis of a Simple Ant Colony Optimization Algorithm -- Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems -- Resources Required for Preparing Graph States -- Session 8B: Online Algorithms -- Online Multi-path Routing in a Maze -- On the On-Line k-Truck Problem with Benefit Maximization -- Energy-Efficient Broadcast Scheduling for Speed-Controlled Transmission Channels -- Online Packet Admission and Oblivious Routing in Sensor Networks -- Session 9A: Computational Geometry -- Field Splitting Problems in Intensity-Modulated Radiation Therapy -- Shape Rectangularization Problems in Intensity-Modulated Radiation Therapy -- A New Approximation Algorithm for Multidimensional Rectangle Tiling -- Tessellation of Quadratic Elements -- Session9B: Distributed Computing and Cryptography -- Effective Elections for Anonymous Mobile Agents -- Gathering Asynchronous Oblivious Mobile Robots in a Ring -- Provably Secure Steganography and the Complexity of Sampling. 330 $aThis book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India, December 2006. The 73 revised full papers cover algorithms and data structures, online algorithms, approximation algorithm, computational geometry, computational complexity, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4288 606 $aComputer programming 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer networks 606 $aComputer graphics 606 $aProgramming Techniques 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Communication Networks 606 $aComputer Graphics 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aNumerical analysis. 615 0$aComputer networks. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aNumerical Analysis. 615 24$aComputer Communication Networks. 615 24$aComputer Graphics. 676 $a005.1 701 $aAsano$b T$g(Tetsuo),$f1949-$01757721 712 12$aISAAC (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484314703321 996 $aAlgorithms and computation$94195666 997 $aUNINA