LEADER 05535oam 2200589 450 001 996466369203316 005 20210715122443.0 010 $a3-540-46632-0 024 7 $a10.1007/3-540-46632-0 035 $a(CKB)1000000000211335 035 $a(SSID)ssj0000321203 035 $a(PQKBManifestationID)11262341 035 $a(PQKBTitleCode)TC0000321203 035 $a(PQKBWorkID)10263100 035 $a(PQKB)10176410 035 $a(DE-He213)978-3-540-46632-1 035 $a(MiAaPQ)EBC3073124 035 $a(MiAaPQ)EBC6486036 035 $a(PPN)155219758 035 $a(EXLCZ)991000000000211335 100 $a20210715d1999 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aAlgorithms and computations $e10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 proceedings /$fAlok Aggarwal, C. Pandu Rangan (Eds.) 205 $a1st ed. 1999. 210 1$aBerlin ;$aHeidelberg :$cSpringer,$d[1999] 210 4$d©1999 215 $a1 online resource (XIV, 454 p.) 225 1 $aLecture Notes in Computer Science ;$v1741 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-66916-7 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Talk -- The Engineering of Some Bipartite Matching Programs -- Session 1(a) - Data Structure I -- General Splay: A Basic Theory and Calculus -- Static Dictionaries Supporting Rank -- Session 1(b) - Parallel & Distributed Computing I -- Multiple Spin-Block Decisions -- Asynchronous Random Polling Dynamic Load Balancing -- Session 2(a) - Approximate Algorithm I -- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability -- Hardness of Approximating Independent Domination in Circle Graphs -- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs -- Session 2(b) - Computational Intelligence -- Ordered Binary Decision Diagrams as Knowledge-Bases -- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots -- Session 3(a) - Online Algorithm -- On-Line Load Balancing of Temporary Tasks Revisited -- Online Routing in Triangulations -- Session 3(b) - Complexity Theory I -- The Query Complexity of Program Checking by Constant-Depth Circuits -- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle -- Session 4(a) - Approximate Algorithm II -- Efficient Approximation Algorithms for Multi-label Map Labeling -- Approximation Algorithms in Batch Processing -- Session 4(b) - Graph Algorithm I -- LexBFS-Ordering in Asteroidal Triple-Free Graphs -- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs -- Invited Talk -- Approximation Algorithms for Some Clustering and Classification Problems -- Session 5(a) - Computational Geometry I -- How Many People Can Hide in a Terrain? -- Carrying Umbrellas: An Online Relocation Problem on Graphs -- Session 5(b) - Parallel & Distributed Computing II -- Survivable Networks with Bounded Delay: The Edge Failure Case -- Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks -- Session 6(a) - Data Structure II -- Constructing the Suffix Tree of a Tree with a Large Alphabet -- An O(1) Time Algorithm for Generating Multiset Permutations -- Session 6(b) - Complexity Theory II -- Upper Bounds for MaxSat: Further Improved -- A Linear Time Algorithm for Recognizing Regular Boolean Functions -- Session 7(a) - Computational Geometry II -- Station Layouts in the Presence of Location Constraints -- Reverse Center Location Problem -- Session 7(b) - Algorithms in Practice -- Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields -- External Memory Algorithms for Outerplanar Graphs -- Session 8(a) - Approximate Algorithm III -- A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree -- Approximation Algorithms for Channel Assignment with Constraints -- Session 8(b) - Graph Algorithm II -- Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs -- A Linear Algorithm for Finding Total Colorings of Partial k-Trees -- Invited Talk -- Topology-Oriented Approach to Robust Geometric Computation -- Session 9(a) - Approximate Algorithm IV -- Approximating Multicast Congestion -- Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts -- Session 9(b) - Parallel & Distributed Computing III -- Online Scheduling of Parallel Communications with Individual Deadlines -- A Faster Algorithm for Finding Disjoint Paths in Grids -- Session 10(a) - Computational Geometry III -- Output-Sensitive Algorithms for Uniform Partitions of Points -- Convexifying Monotone Polygons -- Session 10(b) - Graph Algorithm III -- Bisecting Two Subsets in 3-Connected Graphs -- Generalized Maximum Independent Sets for Trees in Subquadratic Time. 410 0$aLecture notes in computer science ;$v1741. 606 $aComputer science$vCongresses 606 $aComputer software$vCongresses 615 0$aComputer science 615 0$aComputer software 676 $a004 702 $aAggarwal$b Alok 702 $aPandu Rangan$b C.$f1955- 712 12$aISAAC (Conference) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bUtOrBLW 906 $aBOOK 912 $a996466369203316 996 $aAlgorithms and computations$92240113 997 $aUNISA LEADER 02064oam 2200589 450 001 9910715972003321 005 20210402091749.0 035 $a(CKB)5470000002516373 035 $a(OCoLC)682104129$z(OCoLC)631845526$z(OCoLC)667965629$z(OCoLC)966434461$z(OCoLC)1153330122 035 $a(OCoLC)995470000002516373 035 $a(EXLCZ)995470000002516373 100 $a20101117d1992 ua 0 101 0 $aeng 135 $aurbn||||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aFeasibility of using portable, noninvasive pipe flowmeters and time totalizers for determining water use /$fby Donald V. Arvin ; prepared in cooperation with the Indiana Department of Natural Resources, Division of Water 210 1$aIndianapolis, Indiana :$cU.S. Geological Survey,$d1992. 215 $a1 online resource (vi, 65 pages) $cillustrations 225 1 $aWater-resources investigations report ;$v91-4110 320 $aIncludes bibliographical references (page 20). 606 $aFlow meters 606 $aHydrological instruments 606 $aWater use 606 $aWater consumption$xAnalysis 606 $aFlow meters$2fast 606 $aHydrological instruments$2fast 606 $aWater use$2fast 615 0$aFlow meters. 615 0$aHydrological instruments. 615 0$aWater use. 615 0$aWater consumption$xAnalysis. 615 7$aFlow meters. 615 7$aHydrological instruments. 615 7$aWater use. 700 $aArvin$b Donald V.$01395804 712 02$aGeological Survey (U.S.), 712 02$aIndiana.$bDepartment of Natural Resources.$bDivision of Water. 801 0$bOCLCE 801 1$bOCLCE 801 2$bOCLCQ 801 2$bOCLCF 801 2$bOCLCQ 801 2$bOCLCO 801 2$bOCLCQ 801 2$bCOP 801 2$bGPO 906 $aBOOK 912 $a9910715972003321 996 $aFeasibility of using portable, noninvasive pipe flowmeters and time totalizers for determining water use$93460779 997 $aUNINA LEADER 02858nam 22004693 450 001 9910157591703321 005 20251209084635.0 010 $a1-944003-55-X 035 $a(CKB)3710000001001658 035 $a(BIP)055877709 035 $a(Exl-AI)993710000001001658 035 $a(MiAaPQ)EBC4804496 035 $a(Au-PeEL)EBL4804496 035 $a(CaPaEBR)ebr11347952 035 $a(OCoLC)967683356 035 $a(EXLCZ)993710000001001658 100 $a20251209d2016 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aPit Perfect 210 1$aSan Francisco :$cBook Boutiques,$d2016. 210 4$d©2016. 215 $a1 online resource (200 p.) 225 1 $aBarkside of the Moon Mysteries ;$vv.1 330 8 $aPit Bulls are Sweet . . . and that's no mystery!Fall in love with Lily Mason, the shifter who only wants to live as a human, and her pit bull Smooshie, a rescue dog who in the end may be the one doing the rescuing!Pit Perfect, Book 1 of the Barkside of the Moon Mysteries from USA Today bestselling paranormal cozy mystery author Renee George, is an exciting tale of mystery and suspense that will have you on the edge of your seat. When cougar-shifter Lily Mason moves to Moonrise, Missouri, she wishes for only three things from the town and its human population. . . to find a job, to find a place to live, and to live as a human, not a therianthrope.Lily gets more than she bargains for when a rescue pit bull named Smooshie rescues her from an oncoming car, and it's love at first sight. Thanks to Smooshie, Lily's first two wishes are granted by Parker Knowles, the owner of the Pit Bull Rescue center, who offers her a job at the shelter and the room over his garage for rent.Lily's new life as an integrator is threatened when Smooshie finds Katherine Kapersky, the local church choir leader and head of the town council, dead in the field behind the rescue center. Unfortunately, there are more suspects than mourners for the elderly town leader. Can Lily keep her less-than-human status under wraps? Or will the killer, who has pulled off a nearly Pit Perfect murder, expose her to keep Lily and her dog from digging up the truth?This paranormal cozy mystery contains cougar-shifters, shifters, lovable pit bulls, and supernatural beings. 410 0$aBarkside of the Moon Mysteries 517 $aBarkside of the Moon Mysteries 606 $aParanormal fiction$7Generated by AI 606 $aPit bull terriers$7Generated by AI 615 0$aParanormal fiction 615 0$aPit bull terriers 700 $aGeorge$b Renee$01375335 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910157591703321 996 $aPit Perfect$94463316 997 $aUNINA