00930cam2 22002771 450 SOBE0008300520250529152942.020250508d1964 |||||ita|0103 baitaIT1Denis Mack SmithBariLaterza1964414 p.21 cmUniversale Laterza1001LAEC000165592001 *Universale Laterza1001SOBE000830042001 Storia d'Italia dal 1861 al 1958 / Denis Mack SmithMack Smith, DenisA600200041390070134866ITUNISOB20250529RICAUNISOBUNISOBFondo|Calì182678SOBE00083005M 102 Monografia moderna SBNWFondo|Calì000507-1SI18267820250327CaliDonoNrovitoUNISOBUNISOB20250508071402.020250508071515.0rovito14350909UNISOB03198nam 2200589Ia 450 991096616810332120241226111221.09780761909194076190919297813224187661322418764978145226507014522650709781452233734145223373X(CKB)2550000000105312(MiAaPQ)EBC9969149657(OCoLC)1007860120(StDuBDS)EDZ0000085634(EXLCZ)99255000000010531219990203d1999 uy 0engurcn|||||||||txtrdacontentcrdamediacrrdacarrierAlcohol use among adolescents /Michael Windle1st ed.Thousand Oaks Sage Publicationsc19991 online resource (x, 126 pages) illustrationsDevelopmental clinical psychology and psychiatry series ;vol. 42Print version: Windle, Michael T. Alcohol use among adolescents. Thousand Oaks : Sage Publications, ©1999 (DLC) 99006110 (OCoLC)40755171 9780761909200 0761909206 Includes bibliographical references (p. 103-115) and indexes.Intro -- Contents -- Series Editor's Introduction -- Preface -- Chapter 1 - Scope of Adolescent Alcohol Use: An Introduction -- Brief History of Alcohol Use -- Alcohol Use, Substance Use, and Conduct Problems -- Biological Aspects of Alcohol -- Epidemiology of Alcohol-Related Behaviors Among Adolescents -- Epidemiology of Adolescent Alcohol Disorders -- Theories and Models of Adolescent Alcohol Use -- Summary -- Chapter 2 - Measurement and Diagnosis -- Survey Questions -- Screening Measures -- Clinical Diagnosis of Alcohol Disorders -- Summary -- Chapter 3 - Risk and Protective Factors -- Individual Factors -- Peer Influences -- Family Influences -- Societal and Community-Level Factors -- Summary -- Chapter 4 - Approaches to the Prevention of Alcohol Use and Abuse -- Substance Use Preventive Interventions -- Social Policy Interventions -- Treatment Approaches -- Summary -- Chapter 5 - Conceptual and Methodological Issues and Future Research Directions -- Conceptual Issues -- Risk and Protective Factors -- Prevention and Treatment Research -- Summary -- References -- Author Index -- Subject Index -- About the Author.Making use of the most recent literature on the subject, this volume conveys the significance of adolescent alcohol use as a social and clinical problem, describes effective interventions and points to future lines of research.Developmental clinical psychology and psychiatry ;v. 42.TeenagersAlcohol useAlcoholismPreventionTeenagersAlcohol use.AlcoholismPrevention.616.86/1/00835Windle Michael T1836246MiAaPQMiAaPQMiAaPQBOOK9910966168103321Alcohol use among adolescents4414149UNINA07723nam 22008415 450 991014656850332120251226204005.03-540-87744-410.1007/978-3-540-87744-8(CKB)1000000000490298(SSID)ssj0000316172(PQKBManifestationID)11923463(PQKBTitleCode)TC0000316172(PQKBWorkID)10275269(PQKB)10909836(DE-He213)978-3-540-87744-8(MiAaPQ)EBC3063481(MiAaPQ)EBC6456096(PPN)127898093(EXLCZ)99100000000049029820100301d2008 u| 0engurnn#008mamaatxtccrAlgorithms - ESA 2008 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings /edited by Kurt Mehlhorn1st ed. 2008.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2008.1 online resource (XVII, 844 p.)Theoretical Computer Science and General Issues,2512-2029 ;5193"EATCS"--Cover.3-540-87743-6 Includes bibliographical references and index.Invited Lectures -- Flexible Path Planning Using Corridor Maps -- A Bridging Model for Multi-core Computing -- Contributed Papers -- Robust Kinetic Convex Hulls in 3D -- On Dominance Reporting in 3D -- Stabbing Convex Polygons with a Segment or a Polygon -- An Efficient Algorithm for 2D Euclidean 2-Center with Outliers -- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry -- Cache-Oblivious Red-Blue Line Segment Intersection -- The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains -- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces -- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem -- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs -- Straight Skeletons of Three-Dimensional Polyhedra -- Randomized Competitive Analysis for Two-Server Problems -- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra -- Approximating Multi-criteria Max-TSP -- An Integer Programming Algorithm for Routing Optimization in IP Networks -- A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling -- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree -- Engineering Tree Labeling Schemes: A Case Study on Least Common Ancestors -- A Practical Quicksort Algorithm for Graphics Processors -- Bloomier Filters: A Second Look -- Coupled Path Planning, Region Optimization, and Applications in Intensity-Modulated Radiation Therapy -- A New Approach to Exact Crossing Minimization -- A Characterization of 2-Player Mechanisms for Scheduling -- A Local-Search 2-Approximation for 2-Correlation-Clustering -- The Alcuin Number of a Graph -- Time-Dependent SHARC-Routing -- Detecting Regular Visit Patterns -- Improved Approximation Algorithms for Relay Placement.-Selfish Bin Packing -- Improved Randomized Results for That Interval Selection Problem -- Succinct Representations of Arbitrary Graphs -- Edge Coloring and Decompositions of Weighted Graphs -- The Complexity of Sorting with Networks of Stacks and Queues -- Faster Steiner Tree Computation in Polynomial-Space -- Fitting a Step Function to a Point Set -- Faster Swap Edge Computation in Minimum Diameter Spanning Trees -- The Partial Augment–Relabel Algorithm for the Maximum Flow Problem -- An Optimal Dynamic Spanner for Doubling Metric Spaces -- RFQ: Redemptive Fair Queuing -- Range Medians -- Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves -- Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison -- On the Complexity of Optimal Hotlink Assignment -- Oblivious Randomized Direct Search for Real-Parameter Optimization -- Path Minima in Incremental Unrooted Trees -- Improved Competitive Performance Bounds for CIOQ Switches -- Two-Stage Robust Network Design with Exponential Scenarios -- An Optimal Incremental Algorithm for Minimizing Lateness with Rejection -- More Robust Hashing: Cuckoo Hashing with a Stash -- Better and Simpler Approximation Algorithms for the Stable Marriage Problem -- Edit Distances and Factorisations of Even Permutations -- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count -- Facility Location in Dynamic Geometric Data Streams -- The Effects of Local Randomness in the Adversarial Queueing Model -- Parallel Imaging Problem -- An Online Algorithm for Finding the Longest Previous Factors -- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions -- Improved BDD Algorithms for the Simulation of Quantum Circuits -- Mobile Route Planning -- How Reliable Are Practical Point-in-PolygonStrategies? -- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach -- Approximability of Average Completion Time Scheduling on Unrelated Machines -- Relative Convex Hulls in Semi-dynamic Subdivisions -- An Experimental Analysis of Robinson-Foulds Distance Matrix Algorithms -- On the Size of the 3D Visibility Skeleton: Experimental Results -- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed Dimensions -- Deterministic Sampling Algorithms for Network Design.This book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. The 67 revised full papers presented together with 2 invited lectures were carefully reviewed and selected: 51 papers out of 147 submissions for the design and analysis track and 16 out of 53 submissions in the engineering and applications track. The papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization.Theoretical Computer Science and General Issues,2512-2029 ;5193Computer programmingComputer networksComputer scienceAlgorithmsNumerical analysisComputer scienceMathematicsDiscrete mathematicsProgramming TechniquesComputer Communication NetworksTheory of ComputationAlgorithmsNumerical AnalysisDiscrete Mathematics in Computer ScienceComputer programming.Computer networks.Computer science.Algorithms.Numerical analysis.Computer scienceMathematics.Discrete mathematics.Programming Techniques.Computer Communication Networks.Theory of Computation.Algorithms.Numerical Analysis.Discrete Mathematics in Computer Science.511.8Halperin DanMehlhorn Kurt1949-MiAaPQMiAaPQMiAaPQBOOK9910146568503321Algorithms - ESA 2008774062UNINA