06107nam 22007815 450 99646540810331620200701081919.03-540-45253-210.1007/3-540-45253-2(CKB)1000000000211290(SSID)ssj0000321189(PQKBManifestationID)11256250(PQKBTitleCode)TC0000321189(PQKBWorkID)10263098(PQKB)10172761(DE-He213)978-3-540-45253-9(MiAaPQ)EBC3071876(PPN)155188607(EXLCZ)99100000000021129020121227d2000 u| 0engurnn|008mamaatxtccrAlgorithms - ESA 2000[electronic resource] 8th Annual European Symposium Saarbrücken, Germany, September 5-8, 2000 Proceedings /edited by Mike Paterson1st ed. 2000.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2000.1 online resource (X, 450 p.) Lecture Notes in Computer Science,0302-9743 ;1879Bibliographic Level Mode of Issuance: Monograph3-540-41004-X Includes bibliographical references at the end of each chapters and index.Invited Papers -- Web Information Retrieval - an Algorithmic Perspective -- Computational Biology — Algorithms and More -- Contributed Papers -- Polygon Decomposition for Efficient Construction of Minkowski Sums -- An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts -- Offline List Update is NP-hard -- Computing Largest Common Point Sets under Approximate Congruence -- Online Algorithms for Caching Multimedia Streams -- On Recognizing Cayley Graphs -- Fast Algorithms for Even/Odd Minimum Cuts and Generalizations -- Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs -- Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset -- Range Searching over Tree Cross Products -- A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem -- The Minimum Range Assignment Problem on Linear Radio Networks -- Property Testing in Computational Geometry -- On R-Trees with Low Stabbing Number -- K-D Trees Are Better when Cut on the Longest Side -- On Multicriteria Online Problems -- Online Scheduling Revisited -- Constant Ratio Approximation Algorithms for the Rectangle Stabbing Problem and the Rectilinear Partitioning Problem -- I/O-Efficient Well-Separated Pair Decomposition and Its Applications -- Higher Order Delaunay Triangulations -- On Representations of Algebraic-Geometric Codes for List Decoding -- Minimizing a Convex Cost Closure Set -- Preemptive Scheduling with Rejection -- Simpler and Faster Vertex-Connectivity Augmentation Algorithms -- Scheduling Broadcasts in Wireless Networks -- Jitter Regulation in an Internet Router with Delay Consideration -- Approximation of Curvature-Constrained Shortest Paths through a Sequence of Points -- Resource Constrained Shortest Paths -- On the Competitiveness of Linear Search -- Maintaining a Minimum Spanning Tree under Transient Node Failures -- Minimum Depth Graph Embedding -- New Algorithms for Two-Label Point Labeling -- Analysing the Cache Behaviour of Non-uniform Distribution Sorting Algorithms -- How Helpers Hasten h-Relations -- Computing Optimal Linear Layouts of Trees in Linear Time -- Coloring Sparse Random Graphs in Polynomial Average Time -- Restarts Can Help in the On-Line Minimization of the Maximum Delivery Time on a Single Machine -- Collision Detection Using Bounding Boxes: Convexity Helps.This book constitutes the refereed proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000, held in Saarbrücken, Germany in September 2000. The 39 revised full papers presented together with two invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are parallelism, distributed systems, approximation, combinatorial optimization, computational biology, computational geometry, external-memory algorithms, graph algorithms, network algorithms, online algorithms, data compression, symbolic computation, pattern matching, and randomized algorithms.Lecture Notes in Computer Science,0302-9743 ;1879Computer programmingData structures (Computer science)Application softwareAlgorithmsComputer graphicsProgramming Techniqueshttps://scigraph.springernature.com/ontologies/product-market-codes/I14010Data Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Computer Applicationshttps://scigraph.springernature.com/ontologies/product-market-codes/I23001Algorithm Analysis and Problem Complexityhttps://scigraph.springernature.com/ontologies/product-market-codes/I16021Data Structureshttps://scigraph.springernature.com/ontologies/product-market-codes/I15017Computer Graphicshttps://scigraph.springernature.com/ontologies/product-market-codes/I22013Computer programming.Data structures (Computer science).Application software.Algorithms.Computer graphics.Programming Techniques.Data Structures and Information Theory.Computer Applications.Algorithm Analysis and Problem Complexity.Data Structures.Computer Graphics.004.015118Paterson Mikeedthttp://id.loc.gov/vocabulary/relators/edtESA 2000MiAaPQMiAaPQMiAaPQBOOK996465408103316Algorithms - ESA 20001980334UNISA02671nam 2200349 450 99627934250331620231206213740.01-5044-0581-110.1109/IEEESTD.2015.7358449(CKB)3710000000553805(NjHacI)993710000000553805(EXLCZ)99371000000055380520231206d2015 uy 0engur|||||||||||txtrdacontentcrdamediacrrdacarrierIEC 63004 Edition 1.0 2015-12 IEEE Std 1505 IEC/IEEE International standard for receiver fixture interface /Institute of Electrical and Electronics EngineersPiscataway, New Jersey :IEEE,2015.1 online resource (161 pages)A mechanical and electrical specification for implementing a common interoperable mechanical quick-disconnect interconnect system for use by industry for interfacing large numbers of electrical signals (digital, analog, RF, power, etc.) is provided. These large interface panels (receiver and fixture panels) are employed primarily in test systems between stimulus/measurement assets and a related unit-under-test (UUT), although any application involving high-density contacts requiring a quick disconnect interface could benefit. The receiver is a receptacle that is mounted to test system mates with multiple fixtures, which serve as thebuffer between the UUT and automatic test equipment (ATE). Fixtures translate standard input/output (I/O) signal routing offered at the receiver to a wiring interface that directly connects to the UUT. These UUT interfaces can represent cable connectors, direct plug-in (printed circuit board edge connectors), sensor monitoring, or manual feedback from the test technician.The primary objectives of this standard are: (a) to establish interface standards that permit interchangeability of mechanical/electrical receiver/fixture/connector product assemblies from various manufacturers under an open architecture; and (b) to develop within this framework a defined set(s) of interconnecting connector and mechanical specifications that supports available, accepted, low-cost commercial technology to reduced dependence on proprietary designs and extend life-cycle availability.IEC 63004 Edition 1.0 2015-12 IEEE Std 1505Internetworking (Telecommunication)Internetworking (Telecommunication)363.340284NjHacINjHaclDOCUMENT996279342503316IEC 63004 Edition 1.0 2015-12 IEEE Std 15053646210UNISA