LEADER 02454nam 2200601 a 450 001 9910461803403321 005 20200520144314.0 010 $a1-281-60309-0 010 $a9786613783783 010 $a1-118-22779-4 035 $a(CKB)2670000000209124 035 $a(EBL)821868 035 $a(OCoLC)798534390 035 $a(SSID)ssj0000686763 035 $a(PQKBManifestationID)11412591 035 $a(PQKBTitleCode)TC0000686763 035 $a(PQKBWorkID)10733217 035 $a(PQKB)10007149 035 $a(MiAaPQ)EBC821868 035 $a(CaSebORM)9781118239773 035 $a(Au-PeEL)EBL821868 035 $a(CaPaEBR)ebr10580211 035 $a(CaONFJC)MIL378378 035 $a(EXLCZ)992670000000209124 100 $a20120728d2012 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aAdobe Dreamweaver CS6 bible$b[electronic resource] /$fJoseph Lowery 205 $a1st edition 210 $aIndianapolis $cWiley$d2012 215 $a1 online resource (1226 p.) 225 1 $aBible ;$vv.777 300 $aIncludes index. 311 $a1-118-23977-6 311 $a1-118-17063-6 327 $apt. 1. Laying the groundwork in Dreamweaver -- pt. 2. Designing and crafting basic pages -- pt. 3. Adding advanced design features -- pt. 4. Incorporating dynamic data -- pt. 5. Including multimedia elements -- pt. 6. Enhancing productivity and website management -- pt. 7. Extending Dreamweaver. 330 $a Thoroughly covers the latest version of the leading website development software Web designers rely on Dreamweaver to create functional, attractive websites quickly and efficiently. The newest version adds some important functionality for tablet and smart phone screens, HTML5 enhancements, CSS3 updates, and native mobile application development for iOS, Android, and other platforms. This comprehensive guide covers them all and much more, making it the complete course in Dreamweaver for new users as well as a vital guide to help experienced designers delve deeper into more advan 410 0$aBible 608 $aElectronic books. 676 $a006.7/8 676 $a006.78 676 $a006.786 700 $aLowery$b Joseph$0459935 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910461803403321 996 $aAdobe Dreamweaver CS6 bible$92172578 997 $aUNINA LEADER 02987nam 2200589 450 001 9910779742903321 005 20180731202610.0 010 $a90-04-25455-2 024 7 $a10.1163/9789004254558 035 $a(CKB)2550000001096571 035 $a(EBL)1251032 035 $a(OCoLC)852899164 035 $a(SSID)ssj0000918743 035 $a(PQKBManifestationID)11480976 035 $a(PQKBTitleCode)TC0000918743 035 $a(PQKBWorkID)10908637 035 $a(PQKB)11246314 035 $a(MiAaPQ)EBC1251032 035 $a(OCoLC)853311916 035 $a(nllekb)BRILL9789004254558 035 $a(PPN)174589867 035 $a(EXLCZ)992550000001096571 100 $a20130711d2013 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 14$aThe Thirteenth Dalai Lama on the run (1904-1906) $earchival documents from Mongolia 210 1$aLeiden :$cBrill,$d2013. 215 $a1 online resource (628 p.) 225 1 $aBrill's Inner Asia archive 300 $aDescription based upon print version of record. 311 $a90-04-25454-4 311 $a1-299-71854-X 320 $aIncludes bibliographical references and index. 327 $tPreliminary Material -- $tIntroduction: The 13th Dalai Lama in Mongolia, or the Dawn of Inner Asian Modernity /$rUradyn E. Bulag -- $tArchival Documents -- $tIndex. 330 $aIn 1904, the Thirteenth Dalai Lama fled from the British invasion of Tibet to Mongolia in search of support from Russia. Although the mission failed, his extended sojourn in Mongolia marked the beginning of political modernity in both Mongolia and Tibet. The Thirteenth Dalai Lama on the Run (1904-1906) is a facsimile collection comprising hitherto unpublished archival documents from Mongolia about this historical episode. Written in Mongolian, Manchu and Chinese, the documents concern the operation of the Mongol princes in hosting the Dalai Lama in Mongolia and the attempts made by the Qing frontier officials to remove him from Mongolia back to Tibet. Details of his extensive travels within the country, the associated elaborate ritual activities and the great financial costs incurred which were borne by the Mongols, come to light for the first time in this publication. The documents which are supported by detailed captions are discussed in an in-depth introduction. 410 0$aBrill?s Inner Asia Archive$v1. 607 $aTibet Autonomous Region (China)$xRelations$zMongolia$vSources 607 $aMongolia$xRelations$zChina$zTibet Autonomous Region$vSources 607 $aMongolia$xHistory$y20th century$vSources 676 $a294.3/923092 676 $a294.3923092 700 $aChuluun$b Sampildondov$01581820 701 $aBulag$b Uradyn E$01581821 801 0$bNL-LeKB 801 1$bNL-LeKB 906 $aBOOK 912 $a9910779742903321 996 $aThe Thirteenth Dalai Lama on the run (1904-1906)$93863644 997 $aUNINA LEADER 06079nam 22008175 450 001 9910736011703321 005 20251113193854.0 010 $a9783031389061 010 $a3031389069 024 7 $a10.1007/978-3-031-38906-1 035 $a(MiAaPQ)EBC30668298 035 $a(Au-PeEL)EBL30668298 035 $a(DE-He213)978-3-031-38906-1 035 $a(PPN)272250163 035 $a(CKB)27867636400041 035 $a(OCoLC)1391978432 035 $a(EXLCZ)9927867636400041 100 $a20230727d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Data Structures $e18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 ? August 2, 2023, Proceedings /$fedited by Pat Morin, Subhash Suri 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (732 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14079 311 08$aPrint version: Morin, Pat Algorithms and Data Structures Cham : Springer,c2023 9783031389054 327 $aGeometric Spanning Trees Minimizing the Wiener Index -- The Mutual Visibility Problem for Fat Robots -- Faster Algorithms for Cycle Hitting Problems on Disk Graphs -- Tight analysis of the lazy algorithm for open online dial-a-ride -- Online TSP with Known Locations -- Socially Fair Matching: Exact and Approximation Algorithms -- A Parameterized Approximation Scheme for Generalized Partial Vertex Cover -- Dominator Coloring and CD Coloring in Almost Cluster Graphs -- Tight Approximation Algorithms for Ordered Covering -- Online Minimum Spanning Trees with Weight Predictions -- Compact Distance Oracles with Large Sensitivity and Low Stretch -- Finding Diameter-Reducing Shortcuts in Trees -- Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon -- Online Interval Scheduling with Predictions -- On Length-Sensitive Frechet Similarity -- Hardness of Graph-Structured Algebraic and Symbolic Problems-. Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs -- Efficient k-center algorithms for planar points in convex position -- Classification via Two-Way Comparisons (extended abstract) -- Improved Bounds for Discrete Voronoi Games -- General Space-Time Tradeoffs via Relational Queries -- Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs -- Differentially Private Range Query on Shortest Paths -- Revisiting Graph Persistence for Updates and Efficiency -- Block Crossings in One-Sided Tanglegrams -- Observation Routes and External Watchman Routes -- Lower Bounds for Non-Adaptive Shortest Path Relaxation -- Shortest coordinated motion for square robots -- Linear Layouts of Bipartite Planar Graphs -- Adaptive Data Structures for 2D Dominance Colored Range Counting -- Zip-zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent -- External-Memory Sorting with Comparison Errors -- Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs -- Reconfiguration of Time-Respecting Arborescences -- Algorithmic Theory of Qubit Routing -- 3-Coloring C4 or C3-free Diameter Two Graphs -- Colored Constrained Spanning Tree on Directed Graphs -- Geometric Hitting Set for Line-Constrained Disks -- An ETH-Tight Algorithm for Bidirected Steiner Connectivity -- From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy -- Fully dynamic clustering and diversity maximization in doubling metrics -- Quick Minimization of Tardy Processing Time on a Single Machine -- Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location -- Approximating the discrete center line segment in linear time -- Density Approximation for Moving Groups -- Dynamic Convex Hulls under Window-Sliding Updates -- Realizability Makes a Difference: A Complexity Gap for Sink-Finding in USOs. 330 $aThis book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Data Structures, WADS 2023, held during July 31-August 2, 2023. The 47 regular papers, presented in this book, were carefully reviewed and selected from a total of 92 submissions. They present original research on the theory, design and application of algorithms and data structures. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14079 606 $aData structures (Computer science) 606 $aInformation theory 606 $aAlgorithms 606 $aComputer engineering 606 $aComputer networks 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aComputer graphics 606 $aData Structures and Information Theory 606 $aDesign and Analysis of Algorithms 606 $aComputer Engineering and Networks 606 $aSymbolic and Algebraic Manipulation 606 $aDiscrete Mathematics in Computer Science 606 $aComputer Graphics 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aAlgorithms. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aComputer graphics. 615 14$aData Structures and Information Theory. 615 24$aDesign and Analysis of Algorithms. 615 24$aComputer Engineering and Networks. 615 24$aSymbolic and Algebraic Manipulation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aComputer Graphics. 676 $a005.73 676 $a003.54 700 $aMorin$b Pat$0802741 701 $aSuri$b Subhash$01379894 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910736011703321 996 $aAlgorithms and Data Structures$93420335 997 $aUNINA LEADER 02147nam 22004813 450 001 9910136708203321 005 20231110215611.0 035 $a(CKB)3710000000906930 035 $a(MiAaPQ)EBC6377601 035 $a(Au-PeEL)EBL6377601 035 $a(OCoLC)1237410030 035 $a(BIP)50277504 035 $a(EXLCZ)993710000000906930 100 $a20210901d2015 uy 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aEmpire of Night 210 1$aNew York :$cPRH Canada Young Readers,$d2015. 210 4$d©2015. 215 $a1 online resource (313 pages) 225 1 $aAge of Legends 311 08$a0-385-67202-0 311 08$a0-385-67201-2 330 $aThe second book in a big, breathtaking new trilogy that blends fantasy, romance, horror, and pulse-pounding action, from #1 New York Times bestselling author Kelley Armstrong.      Sisters Moria and Ashyn are the Keeper and Seeker of Edgewood. Or at least, they were.      Their village is gone. Their friends have betrayed them. And now, they are all but prisoners in court, forced to watch and wait while the Emperor decides whether to help the children of Edgewood, who remain hostages of the treacherous Alvar Kitsune.      But when the emperor finally sends the girls on a mission to rescue the children--accompanied by Prince Tyrus and a small band of men--the journey proves more perilous than any of them could have imagined. With lies and unrest mounting in the empire, Moria and Ashyn will have to draw on every bit of influence and power they possess to unite their people and avert an all-out war. 410 0$aAge of Legends 606 $aAdventure and adventurers 606 $aTwins 606 $aSisters 615 0$aAdventure and adventurers. 615 0$aTwins. 615 0$aSisters. 676 $a813/.6 700 $aArmstrong$b Kelley$0848524 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910136708203321 996 $aEmpire of Night$91958075 997 $aUNINA