LEADER 01357nam 2200373I 450 001 9910704873703321 005 20130910081644.0 035 $a(CKB)5470000002444996 035 $a(OCoLC)857786077 035 $a(EXLCZ)995470000002444996 100 $a20130910d1982 ua 0 101 0 $aeng 135 $aurbn||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aEconomical and simple production of containerized hardwood seedlings /$fMerrill C. Hoyle 210 1$aBroomall, PA :$cUnited States Department of Agriculture, Forest Service, Northeastern Forest Experiment Station,$d[1982] 215 $a1 online resource (12 pages) $cillustrations 225 1 $aResearch paper NE ;$v500 300 $aTitle from title screen (viewed Sept. 10, 2013). 320 $aIncludes bibliographical references (page 12). 606 $aTrees$xSeedlings 606 $aHardwoods$xSeedlings, Container 615 0$aTrees$xSeedlings. 615 0$aHardwoods$xSeedlings, Container. 700 $aHoyle$b Merrill C.$f1931-$01409144 712 02$aNortheastern Forest Experiment Station (Radnor, Pa.), 801 0$bGPO 801 1$bGPO 906 $aBOOK 912 $a9910704873703321 996 $aEconomical and simple production of containerized hardwood seedlings$93494801 997 $aUNINA LEADER 08744nam 22008775 450 001 9910483466403321 005 20251226203857.0 010 $a3-540-77120-4 024 7 $a10.1007/978-3-540-77120-3 035 $a(CKB)1000000000490300 035 $a(SSID)ssj0000316177 035 $a(PQKBManifestationID)11261609 035 $a(PQKBTitleCode)TC0000316177 035 $a(PQKBWorkID)10263644 035 $a(PQKB)11111743 035 $a(DE-He213)978-3-540-77120-3 035 $a(MiAaPQ)EBC4976762 035 $a(MiAaPQ)EBC337778 035 $a(MiAaPQ)EBC6511717 035 $a(Au-PeEL)EBL337778 035 $a(OCoLC)232363520 035 $a(Au-PeEL)EBL6511717 035 $a(PPN)123731682 035 $a(MiAaPQ)EBC5585125 035 $a(EXLCZ)991000000000490300 100 $a20100301d2007 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aAlgorithms and Computation $e18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings /$fedited by Takeshi Tokuyama 205 $a1st ed. 2007. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2007. 215 $a1 online resource (XVII, 929 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4835 300 $aIncludes index. 311 08$a3-540-77118-2 327 $aInvited Talk -- Modeling and Analyzing Massive Terrain Data Sets -- Coloring Triangle-Free Graphs on Surfaces -- Best Paper Award Presentation -- Integer Representation and Counting in the Bit Probe Model -- 1A Graph Algorithms I -- Minimum Degree Orderings -- Greedy Approximation for Source Location Problem with Vertex-Connectivity Requirements in Undirected Graphs -- Dynamic Distance Hereditary Graphs Using Split Decomposition -- Unifying Two Graph Decompositions with Modular Decomposition -- 1B Computational Geometry I -- Escaping Off-Line Searchers and a Discrete Isoperimetric Theorem -- Geometric Spanner of Segments -- Dilation-Optimal Edge Deletion in Polygonal Cycles -- 2A Complexity I -- Unbounded-Error Classical and Quantum Communication Complexity -- A Spectral Method for MAX2SAT in the Planted Solution Model -- On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices -- The 1-Versus-2 Queries Problem Revisited -- 2B Graph Drawing -- Approximating the Crossing Number of Toroidal Graphs -- Width-Optimal Visibility Representations of Plane Graphs -- Computing Upward Topological Book Embeddings of Upward Planar Digraphs -- Algorithms for the Hypergraph and the Minor Crossing Number Problems -- 3A Distributed Algorithms -- On Mixing and Edge Expansion Properties in Randomized Broadcasting -- Linear Reconfiguration of Cube-Style Modular Robots -- Fast Message Dissemination in Random Geometric Ad-Hoc Radio Networks -- Sensor Network Gossiping or How to Break the Broadcast Lower Bound -- On the Complexity of the ?Most General? Undirected Firing Squad Synchronization Problem -- 3B Optimization I -- Capacitated Domination Problem -- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number -- New Bounds for the Nearly EquitableEdge Coloring Problem -- Approximation to the Minimum Cost Edge Installation Problem -- Approximability of Packing Disjoint Cycles -- 4A Data Structure I -- Succinct Representation of Labeled Graphs -- More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding -- Kinetic Maintenance of Mobile k-Centres on Trees -- Checking Value-Sensitive Data Structures in Sublinear Space -- 4B Game Theory -- Manipulation in Games -- Using Nash Implementation to Achieve Better Frugality Ratios -- The Price of Nash Equilibria in Multicast Transmissions Games -- 5A Database Applications -- An Efficient Algorithm for Enumerating Pseudo Cliques -- Fast Adaptive Diagnosis with a Minimum Number of Tests -- Dynamic Structures for Top-k Queries on Uncertain Data -- Separating Populations with Wide Data: A Spectral Analysis -- 5B Online Algorithms -- A Constant-Competitive Algorithm for Online OVSF Code Assignment -- Average-Case Analysis of Online Topological Ordering -- Energy Efficient Deadline Scheduling in Two Processor Systems -- On the Relative Dominance of Paging Algorithms -- 6A I/O Algorithms -- I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions -- Geometric Streaming Algorithms with a Sorting Primitive -- External Memory Range Reporting on a Grid -- Approximate Range Searching in External Memory -- 6B Networks -- Faster Treasure Hunt and Better Strongly Universal Exploration Sequences -- Hardness and Approximation of Traffic Grooming -- Depth of Field and Cautious-Greedy Routing in Social Networks -- Locating Facilities on a Network to Minimize Their Average Service Radius -- 7A Optimization II -- Faster Combinatorial Algorithms for Determinant and Pfaffian -- A Polynomial-Time-Delay and Polynomial-Space Algorithm for Enumeration Problems in Multi-criteria Optimization.-The Parameterized Complexity of the Unique Coverage Problem -- Bounded Tree-Width and CSP-Related Problems -- 7B Computational Geometry II -- Covering Points by Unit Disks of Fixed Location -- Geodesic Disks and Clustering in a Simple Polygon -- An O(n 2logn) Time Algorithm for Computing Shortest Paths Amidst Growing Discs in the Plane -- Optimal Triangulation with Steiner Points -- 8A Geometric Applications -- New Algorithm for Field Splitting in Radiation Therapy -- In-Place Algorithm for Image Rotation -- Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction -- 8B Data Structures II -- Distributed Relationship Schemes for Trees -- Fast Evaluation of Union-Intersection Expressions -- A Sub-cubic Time Algorithm for the k-Maximum Subarray Problem -- 9A Computational Geometry III -- Compressing Spatio-temporal Trajectories -- Finding Popular Places -- Maintaining Extremal Points and Its Applications to Deciding Optimal Orientations -- 9B Complexity II -- The Monomial Ideal Membership Problem and Polynomial Identity Testing -- On the Fault Testing for Reversible Circuits -- The Space Complexity of k-Tree Isomorphism -- 10A String -- Algorithms for Computing the Length-Constrained Max-Score Segments with Applications to DNA Copy Number Data Analysis -- Space Efficient Indexes for String Matching with Don?t Cares -- 2-Stage Fault Tolerant Interval Group Testing -- Approximate String Matching with Swap and Mismatch -- 10B Graph Algorithms II -- Minimum Fill-In and Treewidth of Split+?ke and Split+?kv Graphs -- Weighted Treewidth Algorithmic Techniques and Results -- Spanning Trees with Many Leaves in Regular Bipartite Graphs -- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs. 330 $aThis book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007, held in Sendai, Japan, in December 2007. The 77 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 220 submissions. The papers are organized in topical sections on graph algorithms, computational geometry, complexity, graph drawing, distributed algorithms, optimization, data structure, game theory, database applications, online algorithms, I/O algorithms, networks, geometric applications, and string. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v4835 606 $aComputer science 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aNumerical analysis 606 $aComputer networks 606 $aComputer graphics 606 $aTheory of Computation 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aNumerical Analysis 606 $aComputer Communication Networks 606 $aComputer Graphics 615 0$aComputer science. 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$aTheory of Computation. 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 702 $aTokuyama$b Takeshi 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483466403321 996 $aAlgorithms and Computation$9771857 997 $aUNINA LEADER 03210nas 2200661-a 450 001 9910891492703321 005 20260218111953.0 011 $a2304-3210 035 $a(DE-599)ZDB2399025-9 035 $a(CKB)2320000000018396 035 $a(CONSER)--2007205111 035 $a(DE-599)2399025-9 035 $a(EXLCZ)992320000000018396 100 $a20060508a19999999 -f- - 101 0 $aeng 135 $aurunu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 00$aRegional economic outlook$iAsia and Pacific 210 $aWashington, D.C. $cInternational Monetary Fund 215 $a1 online resource 225 1 $aWorld economic and financial surveys 300 $aVols. for May 2009- each have a distinctive part title. 311 08$aPrint version: Regional economic outlook. 2071-4149 (DLC) 2007205111 (OCoLC)68517958 320 $aIncludes bibliographical references. 327 $aMachine generated contents note: 1.Managing Shifting Risks -- Signs of Pickup amid Receding Tail Risks -- Stronger Prospects in the Period Ahead Hinge on Internal Demand Dynamics -- More Balanced, but Shifting Risks -- A Transition to Rebuilding Policy Space -- Laying Foundations for Sustained and Shared Prosperity -- 2.Fiscal Policy: Dampening Cyclical Fluctuations and Supporting Inclusive Growth -- The Role of Fiscal Policy in Dampening Cyclical Fluctuadons in Asia -- Increasing Space to Support Sustained and Inclusive Growth -- 3.Is Middle-Income Asia at Risk of a Sustained Growth Slowdown? -- What Is a Sustained Growth Slowdown? -- Are Middle-Income Economies Different? -- What Explains the Likelihood of Getting Trapped? -- Are Middle-Income Asian Economies at Risk of a Sustained Growth Slowdown? -- Can Emerging Asia Get Old before It Gets Rich?. 410 0$aWorld economic and financial surveys. 517 3 $aAsia and Pacific 606 $aEconomic forecasting$zAsia$vPeriodicals 606 $aEconomic forecasting$zPacific Area$vPeriodicals 606 $aPrévision économique$zAsie$vPériodiques 606 $aPrévision économique$zPacifique, Région du$vPériodiques 606 $aEconomic forecasting$2fast 606 $aEconomic history$2fast 607 $aAsia$xEconomic conditions$vPeriodicals 607 $aPacific Area$xEconomic conditions$vPeriodicals 607 $aAsie$xConditions économiques$vPériodiques 607 $aPacifique, Région du$xConditions économiques$vPériodiques 607 $aAsia$2fast$1https://id.oclc.org/worldcat/entity/E39PBJxMpyjKQ9Jtm3jkjPBgKd 607 $aPacific Area$2fast 608 $aperiodicals.$2aat 608 $aPeriodicals.$2fast 608 $aPeriodicals.$2lcgft 608 $aPériodiques.$2rvmgf 615 0$aEconomic forecasting 615 0$aEconomic forecasting 615 6$aPrévision économique 615 6$aPrévision économique 615 7$aEconomic forecasting. 615 7$aEconomic history. 676 $a330.95 712 02$aInternational Monetary Fund. 906 $aJOURNAL 912 $a9910891492703321 920 $aexl_impl conversion 996 $aRegional economic outlook$91916023 997 $aUNINA