07558nam 22008175 450 99646583990331620230221150325.01-280-38772-697866135656483-642-14165-X10.1007/978-3-642-14165-2(CKB)2670000000028924(SSID)ssj0000446321(PQKBManifestationID)11281707(PQKBTitleCode)TC0000446321(PQKBWorkID)10491751(PQKB)11234749(DE-He213)978-3-642-14165-2(MiAaPQ)EBC3065500(PPN)149072864(EXLCZ)99267000000002892420100705d2010 u| 0engurnn#008mamaatxtccrAutomata, Languages and Programming[electronic resource] 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I /edited by Samson Abramsky, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, Paul Spirakis1st ed. 2010.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2010.1 online resource (XXIII, 754 p. 42 illus.)Theoretical Computer Science and General Issues,2512-2029 ;6198Bibliographic Level Mode of Issuance: Monograph3-642-14164-1 Includes bibliographical references and index.Invited Talks -- Local Search: Simple, Successful, But Sometimes Sluggish -- When Conflicting Constraints Can Be Resolved – The Lovász Local Lemma and Satisfiability -- Session 1-Track A. Combinatorial Optimization -- Plane Spanners of Maximum Degree Six -- The Positive Semidefinite Grothendieck Problem with Rank Constraint -- Cycle Detection and Correction -- Decomposition Width of Matroids -- Session 2-Track A1. Game Theory -- The Cooperative Game Theory Foundations of Network Bargaining Games -- On the Existence of Pure Nash Equilibria in Weighted Congestion Games -- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions -- Mean-Payoff Games and Propositional Proofs -- Session 2-Track A2. Security -- Online Network Design with Outliers -- Efficient Completely Non-malleable Public Key Encryption -- Polynomial-Space Approximation of No-Signaling Provers -- From Secrecy to Soundness: Efficient Verification via Secure Computation -- Session 3-Track A1. Data Structures -- Mergeable Dictionaries -- Faster Algorithms for Semi-matching Problems (Extended Abstract) -- Clustering with Diversity -- New Data Structures for Subgraph Connectivity -- Session 3-Track A2. Sorting & Hashing -- Tight Thresholds for Cuckoo Hashing via XORSAT -- Resource Oblivious Sorting on Multicores -- Interval Sorting -- Session 4-Track A. Graphs, Nets and Optimization -- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems -- Thresholded Covering Algorithms for Robust and Max-min Optimization -- Graph Homomorphisms with Complex Values: A Dichotomy Theorem -- Metrical Task Systems and the k-Server Problem on HSTs -- Session 5-Track A1. Scheduling -- Scheduling Periodic Tasks in a Hard Real-Time Environment -- Scalably Scheduling Power-Heterogeneous Processors -- Better Scalable Algorithms for Broadcast Scheduling -- Max-min Online Allocations with a Reordering Buffer -- Session 5-Track A2. Graphs & Hypergraphs -- Orientability of Random Hypergraphs and the Power of Multiple Choices -- On the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs -- Dynamic Programming for Graphs on Surfaces -- Interval Graphs: Canonical Representation in Logspace -- Session 6-Track A. Best Paper Award -- Approximating the Partition Function of the Ferromagnetic Potts Model -- Session 7-Track A. Algebraic Problems -- On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors -- On Sums of Roots of Unity -- Exponential Time Complexity of the Permanent and the Tutte Polynomial -- On Approximate Horn Formula Minimization -- Session 8-Track A. Networks & Communication Complexity -- Choosing, Agreeing, and Eliminating in Communication Complexity -- Additive Spanners in Nearly Quadratic Time -- Composition Theorems in Communication Complexity -- Network Design via Core Detouring for Problems without a Core -- Session 9-Track A1. Complexity & Automata -- Weak Completeness Notions for Exponential Time -- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests -- On the Complexity of Searching in Trees: Average-Case Minimization -- Session 9-Track A2. Finding & Testing -- Finding Is as Easy as Detecting for Quantum Walks -- Improved Constructions for Non-adaptive Threshold Group Testing -- Testing Non-uniform k-Wise Independent Distributions over Product Spaces -- Session 10-Track A1. Approximations -- A Sublogarithmic Approximation for Highway and Tollbooth Pricing -- Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm -- Cell Probe Lower Bounds and Approximations for Range Mode -- SDP Gaps for 2-to-1 and Other Label-Cover Variants -- Session 10-Track A2. Streaming & Preprocessing -- Data Stream Algorithms for Codeword Testing -- Streaming Algorithms for Independent Sets -- Preprocessing of Min Ones Problems: A Dichotomy -- Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems -- Session 11-Track A1. Adaptive, Knowledge & Optimality -- Optimal Trade-Offs for Succinct String Indexes -- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems -- Concurrent Knowledge Extraction in the Public-Key Model -- Session 11-Track A2. Covering, Graphs & Independence -- On the k-Independence Required by Linear Probing and Minwise Independence -- Covering and Packing in Linear Space -- Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs.Theoretical Computer Science and General Issues,2512-2029 ;6198Software engineeringComputer programmingComputer networksAlgorithmsArtificial intelligenceComputer scienceSoftware EngineeringProgramming TechniquesComputer Communication NetworksAlgorithmsArtificial IntelligenceTheory of ComputationSoftware engineering.Computer programming.Computer networks.Algorithms.Artificial intelligence.Computer science.Software Engineering.Programming Techniques.Computer Communication Networks.Algorithms.Artificial Intelligence.Theory of Computation.005.1Abramsky Samsonedthttp://id.loc.gov/vocabulary/relators/edtGavoille Cyriledthttp://id.loc.gov/vocabulary/relators/edtKirchner Claudeedthttp://id.loc.gov/vocabulary/relators/edtMeyer auf der Heide Friedhelmedthttp://id.loc.gov/vocabulary/relators/edtSpirakis Pauledthttp://id.loc.gov/vocabulary/relators/edtBOOK996465839903316Automata, languages and programming339738UNISA03478oam 2200769 450 991025145850332120230621141331.01-78639-441-3(CKB)4220000000000369(oapen)https://directory.doabooks.org/handle/20.500.12854/47574.3(EXLCZ)99422000000000036920201027c2017uuuu uu 0enguubu#---uu|uutxtrdacontentnrdamediancrdacarrierField guide for the identification of damage on woody sentinel plants /edited by Alain Roques, Michelle Cleary, Iryna Matsiakh [and] René EschenCABI2017Wallingford :CAB International,20171 online resource (302 pages) illustrations; digital, PDF file(s)Print version: 9781786394408 Includes bibliographical references.This guide is intended as an aid for managers of sentinel plantings, botanical gardens or arboreta, as well as phytosanitary inspectors, who may have knowledge of common pests and diseases of woody plants, but may not know the likely cause of damage that they have not encountered before. It aims to provide a tentative identification of relatively broad groups of organisms and not definitive identification of the causal agents. Hence, the pictures in this guide need to be regarded as typical examples of the described symptoms. There are chapters that explain how to use the guide, followed by keys (for different organs of conifer and broadleaf species) to guide the user to the relevant sections of the book, based on the questions entomologists and pathologists ask themselves when looking at a damaged or diseased tree in a fashion similar to how a doctor interrogates a patient to arrive at a diagnosis. The largest part of the book is devoted to the description and illustration of damage types and typical causes of the observed damage. The last chapters provide instructions for taking and preserving samples for further identification by an expert, notification of relevant authorities, and a glossary.Plant pathology & diseasesbicsscAgricultural sciencebicsscpestsinjuriesarthropodskeystreespreservationsampling techniquesplantswoody plantsplant diseasesanimalsPinopsidapest arthropodsbroadleaved treeseukaryotesguide booksPinophytagymnospermssamplingbroadleavesplant pestssymptomsarthropod pestsbotanic gardensarboretaSpermatophytabotanical gardensinvertebratesPlant pathology & diseasesAgricultural science634.9/63Roques Alainauth87836Roques AlainCleary MichelleMatsiakh IrynaEschen ReneUkMaJRUBOOK9910251458503321Field guide for the identification of damage on woody sentinel plants3384142UNINA