LEADER 01116cam0-22003851i-450 001 990000201430403321 005 20180511121727.0 035 $a000020143 035 $aFED01000020143 035 $a(Aleph)000020143FED01 035 $a000020143 100 $a20020821d1928----km-y0itay50------ba 101 0 $afre 102 $aFR 105 $aa-------001yy 200 1 $aTraité d'adductions et de distributions d'eau$fpar J. Gilbert et E. Mondon 210 $aParis$cDunod$d1928 215 $a2 v. (VII, 1478 p.)$cill.$d25 cm 610 0 $aAcque potabili$aApprovvigionamento 610 0 $aAcque potabili$aDistribuzione 610 0 $aCostruzioni idrauliche 676 $a628.1 700 1$aGilbert,$bJ.$0331874 702 1$aMondon,$bE. 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990000201430403321 952 $a13 P 26 14$b7991/A$fFINBC 952 $a13 P 26 15$b7991/B$fFINBC 952 $a15 ID J/3-15$fDINID 952 $a15 ID J/3-16$fDINID 959 $aFINBC 959 $aDINID 996 $aTraité d'adductions et de distributions d'eau$9122223 997 $aUNINA LEADER 04906nam 2200697 450 001 9910828933003321 005 20230807213532.0 010 $a1-5231-1077-5 010 $a1-118-98635-0 010 $a1-118-98634-2 010 $a1-118-98637-7 035 $a(CKB)3710000000355737 035 $a(EBL)1895865 035 $a(OCoLC)903318141 035 $a(SSID)ssj0001421183 035 $a(PQKBManifestationID)11964431 035 $a(PQKBTitleCode)TC0001421183 035 $a(PQKBWorkID)11429600 035 $a(PQKB)10997198 035 $a(PQKBManifestationID)16114633 035 $a(PQKB)24059195 035 $a(MiAaPQ)EBC1895865 035 $a(DLC) 2014021554 035 $a(Au-PeEL)EBL1895865 035 $a(CaPaEBR)ebr11017921 035 $a(CaONFJC)MIL726297 035 $a(EXLCZ)993710000000355737 100 $a20150318h20152015 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aHandbook of petroleum product analysis /$fJames G. Speight, PhD, DSc 205 $aSecond edition. 210 1$aHoboken, New Jersey :$cWiley,$d2015. 210 4$d©2015 215 $a1 online resource (369 p.) 225 1 $aChemical Analysis ;$vVolume 182 300 $aIncludes index. 311 $a1-322-95015-6 311 $a1-118-36926-2 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $a""Title Page""; ""Copyright Page""; ""Contents""; ""Preface""; ""Chapter 1 Petroleum and Petroleum Products""; ""1.1 Introduction""; ""1.2 Perspectives""; ""1.2.1 Historical Perspectives""; ""1.2.2 Modern Perspectives""; ""1.3 Definitions""; ""1.3.1 Petroleum""; ""1.3.1.1 Correlation Index""; ""1.3.1.2 Characterization Factor""; ""1.3.1.3 Character and Behavior""; ""1.3.1.4 Bulk Fractions""; ""1.3.2 Natural Gas""; ""1.3.3 Natural Gas Liquids and Natural Gasoline""; ""1.3.4 Opportunity Crudes""; ""1.3.5 High-Acid Crudes""; ""1.3.6 Foamy Oil""; ""1.3.7 Oil from Shale""; ""1.3.8 Heavy Oil"" 327 $a""1.3.9 Extra Heavy Oil""""1.3.10 Tar Sand Bitumen""; ""1.4 Petroleum Refining""; ""1.4.1 Visbreaking""; ""1.4.2 Coking""; ""1.4.3 Hydroprocessing""; ""1.5 Petroleum Products""; ""1.5.1 Types""; ""1.5.1.1 Gases""; ""1.5.1.2 Naphtha, Solvents, and Gasoline""; ""1.5.1.3 Kerosene and Diesel Fuel""; ""1.5.1.4 Fuel Oil""; ""1.5.1.5 White Oil, Insulating Oil, Insecticides""; ""1.5.1.6 Lubricating Oil""; ""1.5.1.7 Grease""; ""1.5.1.8 Wax""; ""1.5.1.9 Residua and Asphalt""; ""1.5.1.10 Coke, Carbon Black, and Graphite""; ""1.5.1.11 Fischera???Tropsch Liquids and Bio-Oil""; ""1.5.2 Properties"" 327 $a""References""""Chapter 2 Analytical Methods""; ""2.1 Introduction""; ""2.2 Chemical and Physical Analyses""; ""2.2.1 Boiling Point Distribution""; ""2.2.2 Density, Specific Gravity, and API Gravity""; ""2.2.3 Emulsion Formation""; ""2.2.4 Evaporation""; ""2.2.5 Fire Point and Flash Point""; ""2.2.6 Fractionation""; ""2.2.7 Metal Content""; ""2.2.8 Pour Point""; ""2.2.9 Sulfur Content""; ""2.2.10 Surface Tension and Interfacial Tension""; ""2.2.11 Viscosity""; ""2.2.12 Water Content""; ""2.3 Chromatographic Analyses""; ""2.3.1 Adsorption Chromatography""; ""2.3.2 Gas Chromatography"" 327 $a""2.3.3 Gas Chromatographya???Mass Spectrometry""""2.3.4 High-Performance Liquid Chromatography""; ""2.3.5 Thin Layer Chromatography""; ""2.4 Spectroscopic Analyses""; ""2.4.1 Infrared Spectroscopy""; ""2.4.2 Mass Spectrometry""; ""2.4.3 Nuclear Magnetic Resonance""; ""2.4.4 Ultraviolet Spectroscopy""; ""2.4.5 X-Ray Diffraction""; ""2.5 Molecular Weight""; ""2.6 Instability and Incompatibility""; ""2.7 The Future""; ""References""; ""Chapter 3 Sampling and Measurement""; ""3.1 Introduction""; ""3.2 Sampling""; ""3.2.1 Sampling Protocol""; ""3.2.2 Representative Sample"" 327 $a""3.2.3 Sampling Error""""3.3 Volume Measurement""; ""3.4 Method Validation""; ""3.4.1 Requirements""; ""3.4.2 Detection Limit""; ""3.4.3 Accuracy""; ""3.4.4 Precision""; ""3.5 Quality Control and Quality Assurance""; ""3.5.1 Quality Control""; ""3.5.2 Quality Assurance""; ""3.6 Assay and Specifications""; ""3.6.1 Assay""; ""3.6.2 Specifications""; ""3.6.2.1 Distillation""; ""3.6.2.2 Low-Boiling Hydrocarbons""; ""3.6.2.3 Metallic Constituents""; ""3.6.2.4 Salt Content""; ""3.6.2.5 Sulfur Content""; ""3.6.2.6 Viscosity and Pour Point""; ""3.6.2.7 Water and Sediment""; ""3.6.3 Other Tests"" 327 $a""References"" 410 0$aChemical analysis ;$vVolume 182. 606 $aPetroleum products$xAnalysis 615 0$aPetroleum products$xAnalysis. 676 $a665.5/38 700 $aSpeight$b James G.$017073 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910828933003321 996 $aHandbook of petroleum product analysis$93978650 997 $aUNINA LEADER 08433nam 22008775 450 001 9910483048903321 005 20251226195333.0 010 $a3-540-69733-0 024 7 $a10.1007/978-3-540-69733-6 035 $a(CKB)1000000000440801 035 $a(SSID)ssj0000316941 035 $a(PQKBManifestationID)11225856 035 $a(PQKBTitleCode)TC0000316941 035 $a(PQKBWorkID)10287725 035 $a(PQKB)10574647 035 $a(DE-He213)978-3-540-69733-6 035 $a(MiAaPQ)EBC3068513 035 $a(PPN)127051864 035 $a(EXLCZ)991000000000440801 100 $a20100301d2008 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputing and Combinatorics $e14th International Conference, COCOON 2008 Dalian, China, June 27-29, 2008, Proceedings /$fedited by Xiaodong Hu, Jie Wang 205 $a1st ed. 2008. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2008. 215 $a1 online resource (XIV, 680 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5092 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-69732-2 320 $aIncludes bibliographical references and index. 327 $aAlgorithms and Data Structures -- Efficient Compression of Web Graphs -- Damaged BZip Files Are Difficult to Repair -- Isoperimetric Problem and Meta-fibonacci Sequences -- Algorithmic Game Theory and Online Algorithms -- On the Complexity of Equilibria Problems in Angel-Daemon Games -- Average-Case Competitive Analyses for One-Way Trading -- On the Monotonicity of Weak Searching -- Automata, Languages, Logic, and Computability -- VC Dimension Bounds for Analytic Algebraic Computations -- Resource Bounded Frequency Computations with Three Errors -- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model -- Smallest Formulas for Parity of 2 k Variables Are Essentially Unique -- Combinatorics Related to Algorithms and Complexity -- Counting Polycubes without the Dimensionality Curse -- Polychromatic Colorings of n-Dimensional Guillotine-Partitions -- The Computational Complexity of Link Building -- Improved Parameterized Algorithms for Weighted 3-Set Packing -- Structural Identifiability in Low-Rank Matrix Factorization -- Complexity of Counting the Optimal Solutions -- Complexity Theory -- The Orbit Problem Is in the GapL Hierarchy -- Quantum Separation of Local Search and Fixed Point Computation -- Multi-party Quantum Communication Complexity with Routed Messages -- Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments -- Approximating Alternative Solutions -- Dimensions of Points in Self-similar Fractals -- Cryptography, Reliability and Security, and Database Theory -- Visual Cryptography on Graphs -- Algebraic Cryptanalysis of CTRU Cryptosystem -- Computational Biology and Bioinformatics ? Model -- Detecting Community Structure by Network Vectorization -- Quasi-bicliques: Complexity and Binding Pairs -- Complexity of a Collision-Aware StringPartition Problem and Its Relation to Oligo Design for Gene Synthesis -- Genome Halving under DCJ Revisited -- Haplotype Inferring Via Galled-Tree Networks Is NP-Complete -- Computational Biology and Bioinformatics ? Algorithms -- Adjacent Swaps on Strings -- Efficient Algorithms for SNP Haplotype Block Selection Problems -- Sequence Alignment Algorithms for Run-Length-Encoded Strings -- A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations -- A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI -- Computational Algebra, Geometry, and Number Theory -- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance -- On Center Regions and Balls Containing Many Points -- On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees -- New Algorithms for Online Rectangle Filling with k-Lookahead -- Geometric Spanner of Objects under L 1 Distance -- Graph Drawing and Information Visualization -- Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints -- Graph Theory and Algorithms -- A New Characterization of P 6-Free Graphs -- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction -- Efficient Algorithms for the k Smallest Cuts Enumeration -- Covering Directed Graphs by In-Trees -- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints -- Probe Ptolemaic Graphs -- Communication Networks and Optimization -- Diagnosability of Two-Matching Composition Networks -- The Iterated Restricted Immediate Snapshot Model -- Finding Frequent Items in a Turnstile Data Stream -- A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints -- Optimal Tree Structures for Group Key Tree Management ConsideringInsertion and Deletion Cost -- Wireless Network -- Throughput Maximization with Traffic Profile in Wireless Mesh Network -- Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment -- (6?+??)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs -- Spectrum Bidding in Wireless Networks and Related -- Network Optimization -- (1?+??)-Approximation for Selected-Internal Steiner Minimum Tree -- Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities -- Spreading Messages -- On Some City Guarding Problems -- Optimal Insertion of a Segment Highway in a City Metric -- Approximating the Generalized Capacitated Tree-Routing Problem -- Column Generation Algorithms for the Capacitated m-Ring-Star Problem -- Scheduling Problem -- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine -- A Two-Stage Flexible Flowshop Problem with Deterioration -- A Lower Bound for the On-Line Preemptive Machine Scheduling with ? p Norm -- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. 330 $aThe refereed proceedings of the 14th Annual International Computing and Combinatorics Conference, COCOON 2008, held in Dalian, China, in June 2008. The 66 revised full papers presented were carefully reviewed and selected from 172 submissions. The papers are organized in topical sections on algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory and algorithms, communication networks, and optimization, wireless network, network optimization, and scheduling problem. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5092 606 $aComputer programming 606 $aComputer networks 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aComputer graphics 606 $aProgramming Techniques 606 $aComputer Communication Networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 606 $aComputer Graphics 615 0$aComputer programming. 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 0$aComputer graphics. 615 14$aProgramming Techniques. 615 24$aComputer Communication Networks. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 615 24$aComputer Graphics. 676 $a004.0151 686 $aDAT 500f$2stub 686 $aDAT 537f$2stub 686 $aMAT 050f$2stub 686 $aSS 4800$2rvk 701 $aHu$b Xiaodong$01619003 701 $aWang$b Jie$0898642 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483048903321 996 $aComputing and combinatorics$94201312 997 $aUNINA