LEADER 02805nam 2200673 450 001 9910138885103321 005 20180731044803.0 010 $a2-8218-5067-0 010 $a2-7606-2484-6 024 7 $a10.4000/books.pum.497 035 $a(CKB)2470000000002270 035 $a(EBL)3248864 035 $a(SSID)ssj0000735515 035 $a(PQKBManifestationID)12300233 035 $a(PQKBTitleCode)TC0000735515 035 $a(PQKBWorkID)10749363 035 $a(PQKB)11676489 035 $a(CaPaEBR)407435 035 $a(CaBNvSL)slc00211990 035 $a(MiAaPQ)EBC3248864 035 $a(MiAaPQ)EBC4795654 035 $a(MiAaPQ)EBC6954505 035 $a(Au-PeEL)EBL6954505 035 $a(FrMaCLE)OB-pum-497 035 $a(oapen)https://directory.doabooks.org/handle/20.500.12854/57120 035 $a(VaAlCD)20.500.12592/18z223 035 $a(schport)gibson_crkn/2009-12-01/3/407435 035 $a(PPN)233380647 035 $a(EXLCZ)992470000000002270 100 $a20170222h20072007 uy 0 101 0 $afre 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aProfession sinologue /$fCharles Le Blanc 210 $cPresses de l?Université de Montréal$d2007 210 1$a[Montre?al, Canada] :$cLes Presses de l'Universite? de Montre?al,$d2007. 210 4$d©2007 215 $a1 online resource (71 p.) 225 1 $aProfession 300 $aDescription based upon print version of record. 311 $a2-7606-2027-1 320 $aIncludes bibliographical references. 330 $aÊtre sinologue, c?est chercher à comprendre et à faire comprendre les multiples facettes de la société et de la culture de la Chine. Par son isolement physique et culturel à l?autre bout de l?Eurasie, la Chine se donne comme l?Autre du monde indo-européen. Il incombe au sinologue de « traduire » cette différence pour à la fois comprendre et respecter la spécificité chinoise, enrichir l?esprit et le c?ur de l?Occident, et favoriser la communication la plus ouverte entre deux pôles incontournables de la planète. C?était bien là les valeurs que préconisait Jean Pierre Abel-Rémusat (1788-1832), titulaire de la première chaire d?études chinoises en Occident au Collège de France en 1814 et fondateur de l?étude scientifique de la Chine : la sinologie. 410 0$aProfession (Montre?al, Que?bec) 607 $aChina$xStudy and teaching$xSocial aspects 610 $aétude 610 $aChine 610 $asinologue 676 $a951.0072 700 $aLe Blanc$b Charles$0884362 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910138885103321 996 $aProfession sinologue$91974819 997 $aUNINA LEADER 06084nam 22008055 450 001 9910494560003321 005 20251113181820.0 010 $a3-030-83508-1 024 7 $a10.1007/978-3-030-83508-8 035 $a(CKB)4100000011994636 035 $a(MiAaPQ)EBC6688952 035 $a(Au-PeEL)EBL6688952 035 $a(DE-He213)978-3-030-83508-8 035 $a(PPN)257359036 035 $a(EXLCZ)994100000011994636 100 $a20210730d2021 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms and Data Structures $e17th International Symposium, WADS 2021, Virtual Event, August 9?11, 2021, Proceedings /$fedited by Anna Lubiw, Mohammad Salavatipour, Meng He 205 $a1st ed. 2021. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021. 215 $a1 online resource (687 pages) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12808 311 08$a3-030-83507-3 320 $aIncludes bibliographical references and index. 327 $aAdjacency Labelling of Planar Graphs (and Beyond) -- Algorithms for Explainable Clustering -- On the Spanning and Routing Ratios of the Directed ?6-Graph -- The Minimum Moving Spanning Tree Problem -- Scheduling with Testing on Multiple Identical Parallel Machines -- Online Makespan Minimization With Budgeted Uncertainty -- Pattern Matching in Doubling Spaces -- Reachability Problems for Transmission Graphs -- On Minimum Generalized Manhattan Connections -- HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields -- Generalized Disk Graphs -- A 4-Approximation of the 2?/3 -MST -- Dynamic Dictionaries for Multisets and Counting Filters with Constant Time Operations -- The Neighborhood Polynomial of Chordal -- Incomplete Directed Perfect Phylogeny in Linear Time -- Euclidean maximum matchings in the plane?­­­­local to global -- Solving Problems on Generalized Convex Graphs via Mim-Width -- Improved Bounds on the Spanning Ratio of the Theta-5 Graph -- Computing Weighted Subset Transversals in H-Free Graphs -- Computing the Fréchet Distance Between Uncertain Curves in One Dimension -- Finding a Largest-Area Triangle in a Terrain in Near-Linear Time -- Planar Drawings with Few Slopes of Halin Graphs and Nested Pseudotrees -- An APTAS for Bin Packing with Clique-graph Conflicts -- Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs -- ANN for time series under the Fréchet distance -- Strictly In-Place Algorithms for Permuting and Inverting -- A Stronger Lower Bound on Parametric Minimum Spanning Trees -- Online bin packing of squares and cubes -- Exploration of k-Edge-Deficient Temporal Graphs -- Parameterized Complexity of Categorical Clustering with Size Constraints -- Graph Pricing With Limited Supply -- Fair Correlation Clustering with Global and Local Guarantees -- Better Distance Labeling for Unweighted Planar Graphs -- How to Catch Marathon Cheaters: New Approximation Algorithms for Tracking Paths -- Algorithms for Radius-Optimally Augmenting Trees in a Metric Space -- Upper and Lower Bounds for Fully Retroactive Graph Problem -- Characterization of Super-stable Matching -- Uniform Embeddings for Robinson Similarity Matrices -- Particle-Based Assembly Using Precise Global Control Independent Sets in Semi-random Hypergraphs -- A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs -- Support Optimality and Adaptive Cuckoo Filters -- Computing the Union Join and Subset Graph of Acyclic Hypergraphs in Subquadratic Time -- Algorithms for the Line-Constrained Disk Coverage and Related Problems -- A universal cycle for strings with fixed-content (which are also known as multiset permutations) -- Routing on Heavy-Path WSPD-Spanners -- Mapping Multiple Regions to the Grid with Bounded Hausdorff Distance -- Diverse Partitions of Colored Points -- Reverse Shortest Path Problem for Unit-Disk Graphs. 330 $aThis book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v12808 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 $a511.8 702 $aLubiw$b Anna 702 $aSalavatipour$b Mohammad 702 $aHe$b Meng 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910494560003321 996 $aAlgorithms and Data Structures$91967417 997 $aUNINA